Ali Ahmadi Shahrakht¹, Parisa Hajirahimi², Omid Rostami³, Diego Martín^4,*

Intelligent Automation & Soft Computing, Vol.37, No.3, pp. 3059-3081, 2023, DOI:10.32604/iasc.2023.040502

Abstract As the internet of things (IoT) continues to expand rapidly, the significance of its security concerns has grown in recent years. To address these concerns, physical unclonable functions (PUFs) have emerged as valuable tools for enhancing IoT security. PUFs leverage the inherent randomness found in the embedded hardware of IoT devices. However, it has been shown that some PUFs can be modeled by attackers using machine-learning-based approaches. In this paper, a new deep learning (DL)-based modeling attack is introduced to break the resistance of complex XAPUFs. Because training DL models is a problem that falls under the category of NP-hard… More >

Hachemi Bennaceur, Meznah Almutairy, Norah Alhussain^*

Intelligent Automation & Soft Computing, Vol.37, No.3, pp. 2687-2706, 2023, DOI:10.32604/iasc.2023.038723

Abstract The dimensionality of data is increasing very rapidly, which creates challenges for most of the current mining and learning algorithms, such as large memory requirements and high computational costs. The literature includes much research on feature selection for supervised learning. However, feature selection for unsupervised learning has only recently been studied. Finding the subset of features in unsupervised learning that enhances the performance is challenging since the clusters are indeterminate. This work proposes a hybrid technique for unsupervised feature selection called GAk-MEANS, which combines the genetic algorithm (GA) approach with the classical k-Means algorithm. In the proposed algorithm, a new… More >

Qinhui Liu, Zhijie Gao, Jiang Li^*, Shuo Li, Laizheng Zhu

CMC-Computers, Materials & Continua, Vol.76, No.2, pp. 2503-2530, 2023, DOI:10.32604/cmc.2023.040505

Abstract With the rapid development of intelligent manufacturing and the changes in market demand, the current manufacturing industry presents the characteristics of multi-varieties, small batches, customization, and a short production cycle, with the whole production process having certain flexibility. In this paper, a mathematical model is established with the minimum production cycle as the optimization objective for the dual-resource batch scheduling of the flexible job shop, and an improved nested optimization algorithm is designed to solve the problem. The outer layer batch optimization problem is solved by the improved simulated annealing algorithm. The inner double resource scheduling problem is solved by… More >

Yongxuan Sang, Jiangpo Wei^*, Zhifeng Zhang, Bo Wang

CMC-Computers, Materials & Continua, Vol.76, No.2, pp. 2483-2502, 2023, DOI:10.32604/cmc.2023.040485

Abstract Computing-intensive and latency-sensitive user requests pose significant challenges to traditional cloud computing. In response to these challenges, mobile edge computing (MEC) has emerged as a new paradigm that extends the computational, caching, and communication capabilities of cloud computing. By caching certain services on edge nodes, computational support can be provided for requests that are offloaded to the edges. However, previous studies on task offloading have generally not considered the impact of caching mechanisms and the cache space occupied by services. This oversight can lead to problems, such as high delays in task executions and invalidation of offloading decisions. To optimize… More >

Lei Ling¹, Lijun Huang², Jie Wang², Li Zhang², Yue Wu², Yizhang Jiang¹, Kaijian Xia^2,3,*

CMES-Computer Modeling in Engineering & Sciences, Vol.137, No.3, pp. 2353-2379, 2023, DOI:10.32604/cmes.2023.028828

Abstract In recent years, the soft subspace clustering algorithm has shown good results for high-dimensional data, which can assign different weights to each cluster class and use weights to measure the contribution of each dimension in various features. The enhanced soft subspace clustering algorithm combines interclass separation and intraclass tightness information, which has strong results for image segmentation, but the clustering algorithm is vulnerable to noisy data and dependence on the initialized clustering center. However, the clustering algorithm is susceptible to the influence of noisy data and reliance on initialized clustering centers and falls into a local optimum; the clustering effect… More >

Nizheen A. Ali¹, Ramadhan J. Mstafa^2,3,*

Computer Systems Science and Engineering, Vol.47, No.2, pp. 1451-1469, 2023, DOI:10.32604/csse.2023.039957

Abstract With the widespread use of the internet, there is an increasing need to ensure the security and privacy of transmitted data. This has led to an intensified focus on the study of video steganography, which is a technique that hides data within a video cover to avoid detection. The effectiveness of any steganography method depends on its ability to embed data without altering the original video’s quality while maintaining high efficiency. This paper proposes a new method to video steganography, which involves utilizing a Genetic Algorithm (GA) for identifying the Region of Interest (ROI) in the cover video. The ROI… More >

Zeyu Zhang¹, Han Zhu¹, Wei Zhang¹, Zhiming Cai^2,*, Linkai Zhu², Zefeng Li²

Computer Systems Science and Engineering, Vol.47, No.2, pp. 1901-1917, 2023, DOI:10.32604/csse.2023.039395

Abstract With the rapid development of urban road traffic and the increasing number of vehicles, how to alleviate traffic congestion is one of the hot issues that need to be urgently addressed in building smart cities. Therefore, in this paper, a nonlinear multi-objective optimization model of urban intersection signal timing based on a Genetic Algorithm was constructed. Specifically, a typical urban intersection was selected as the research object, and drivers’ acceleration habits were taken into account. What’s more, the shortest average delay time, the least average number of stops, and the maximum capacity of the intersection were regarded as the optimization… More >

Sihan Wang, Xinyu Li, Qihao Liu^*

CMES-Computer Modeling in Engineering & Sciences, Vol.137, No.2, pp. 1871-1890, 2023, DOI:10.32604/cmes.2023.028339

Abstract The job shop scheduling problem (JSSP) is a classical combinatorial optimization problem that exists widely in diverse scenarios of manufacturing systems. It is a well-known NP-hard problem, when the number of jobs increases, the difficulty of solving the problem exponentially increases. Therefore, a major challenge is to increase the solving efficiency of current algorithms. Modifying the neighborhood structure of the solutions can effectively improve the local search ability and efficiency. In this paper, a genetic Tabu search algorithm with neighborhood clipping (GTS_NC) is proposed for solving JSSP. A neighborhood solution clipping method is developed and embedded into Tabu search to… More >

Junru Liu, Yonggui Lv^*

Intelligent Automation & Soft Computing, Vol.37, No.2, pp. 2421-2439, 2023, DOI:10.32604/iasc.2023.040262

Abstract Numerous clothing enterprises in the market have a relatively low efficiency of assembly line planning due to insufficient optimization of bottleneck stations. As a result, the production efficiency of the enterprise is not high, and the production organization is not up to expectations. Aiming at the problem of flexible process route planning in garment workshops, a multi-object genetic algorithm is proposed to solve the assembly line balance optimization problem and minimize the machine adjustment path. The encoding method adopts the object-oriented path representation method, and the initial population is generated by random topology sorting based on an in-degree selection mechanism.… More >

Zhiwei Ye¹, Ziqian Fang¹, Zhina Song^1,*, Haigang Sui², Chunyan Yan¹, Wen Zhou¹, Mingwei Wang¹

Intelligent Automation & Soft Computing, Vol.37, No.2, pp. 2019-2035, 2023, DOI:10.32604/iasc.2023.039949

Abstract Hyperparameters play a vital impact in the performance of most machine learning algorithms. It is a challenge for traditional methods to configure hyperparameters of the capsule network to obtain high-performance manually. Some swarm intelligence or evolutionary computation algorithms have been effectively employed to seek optimal hyperparameters as a combinatorial optimization problem. However, these algorithms are prone to get trapped in the local optimal solution as random search strategies are adopted. The inspiration for the hybrid rice optimization (HRO) algorithm is from the breeding technology of three-line hybrid rice in China, which has the advantages of easy implementation, less parameters and… More >