Search

With the development of the drying rack system, users with limited time tend to use the fully functional drying rack system to realize various intelligent control functions. However, the existing control methods for drying rack system has some defects such as, low intelligence and system delay, which are unsuitable for most users. In this paper, an efficient intelligent control algorithm based on the back‐propagation (BP) neural network is proposed. In this system, STM32F103 is first utilized as the central controller and multiple sensors are used to collect environmental information. Then, the remote control, voice keywords, and buttons can be used to achieve intelligent control. Subsequently, a motor drive intelligence control algorithm based on the BP neural network (MCBP) is proposed to improve the accuracy of the intelligent control. Next, an Application (APP) that can display environmental data such as wind speed, temperature, and humidity is developed. The APP can realize various intelligent control functions such as lifting, panning, rotating, and harvesting. Finally, MCBP is compared with normal control and programmable logic controller control. The accuracy of the MCBP is higher than other two control methods. The final extensive experiments confirm the accuracy and efficiency of the proposed intelligent control algorithm. [ABSTRACT FROM AUTHOR]

Multi‐objective optimization problems frequently appear in many diverse research areas and application domains. Metaheuristics, as efficient techniques to solve them, need to be easily accessible to users with different expertise and programming skills. In this context, metaheuristic optimization frameworks are helpful, as they provide popular algorithms, customizable components and additional facilities to conduct experiments. Due to the broad range of available tools, this paper presents a systematic evaluation and experimental comparison of 10 frameworks, covering from multi‐purpose, consolidated tools to recent libraries specifically designed for multi‐objective optimization. The evaluation is organized around seven characteristics: search components and techniques, configuration, execution, utilities, external support and community, software implementation and performance. An analysis of code metrics and a series of experiments serves to assess the last two features. Lesson learned and open issues are also discussed as part of the comparative study. The outcomes of the evaluation process reveal a contrasted support to recent advances in multi‐objective optimization, with a lack of novel algorithms and variety of metaheuristics other than evolutionary algorithms. The experimental comparison also reports significant differences in terms of both execution time and memory usage under demanding configurations. [ABSTRACT FROM AUTHOR]

Polycyclic aromatic hydrocarbons (PAHs) are organic pollutants and manufactured substances conferring toxicity to human health. The present study investigated whether pyrene, a type of PAH, harms rats. Our research provides an effective feature selection strategy for the animal dataset from Wenzhou Medical University's Experimental Animal Center to thoroughly examine the impacts of PAH toxicity on rat features. Initially, we devised a high‐performance optimization method (SCBA) and added the Sobol sequence, vertical crossover and horizontal crossover mechanisms to the bat algorithm (BA). The SCBA‐KELM model, which combines SCBA with the kernel extreme learning machine model (KELM), has excellent accuracy and high stability for selecting features. Benchmark function tests are then used in this research to verify the overall optimization performance of SCBA. In this paper, the feature selection performance of SCBA‐KELM is verified using various comparative experiments. According to the results, the features of the genes PXR, CAR, CYP2B1/2 and CYP1A1/2 have the most impact on rats. The SCBA‐KELM model's classification performance for the gene dataset was 100%, and the model's precision value for the public dataset was around 96%, as determined by the classification index. In conclusion, the model utilized in this research is anticipated to be a reliable and valuable approach for toxicological classification and assessment. [ABSTRACT FROM AUTHOR]

Summary: Industrial internet‐of‐things (IIoT) cloud computing gives users with the ease of outsourcing calculations and carrying the risk of privacy disclosure. To solve this issue, secure high‐order clustering algorithm by fast search (SHOCFS) technique is introduced recently. The major factors of SHOCFS algorithm are speed improvement and detecting optimal density peaks. The optimal selection of density points in the SHOCFS algorithm still becomes an important issue to be considered. The swallow swarm optimization (SSO) is introduced in the proposed work for choosing optimal density peaks in clustering algorithm. This paper motivates to design a new secure cloud service system for cloud in IIoT environment. The secure high‐order optimal density selection (SHODS3O‐CFS) approach is proposed in hybrid cloud environment. The major contribution of the work is to develop an optimization‐based secure clustering algorithm for finding the best density points in clustering algorithm. It may reduce the overlapping peak points in the cluster and increase the security of system in hybrid cloud. The experimental results of the proposed algorithm and existing methods are measured via clustering metrics such as accuracy, clustering center quality, and speed ratio. The metrics like clustering center quality, Rand index (RI), encryption time (ms), and speedup ratio have been used to measure the results of the proposed system and existing methods. From the results, it is concluded that the proposed work has achieved higher average RI of 93.4%, which is 29.68% and 17.4% higher when compared with the privacy preservation high‐order clustering algorithm by fast search (PPHOCFS) and SHOCFS methods. [ABSTRACT FROM AUTHOR]

This study presents a cohesive configuration controller for distributed space coverage by a swarm of robots. The goal is to build a dense, convex network that is robust against disconnection while robots are flocking with only incomplete knowledge about the network. The controller is an integrated framework of two different algorithms. First, we present a boundary force algorithm: physics‐based swarm intelligence that borrows the concept of surface tension force between liquid molecules. The combination of such a force with conventional flocking produces a convex and dense configuration without knowledge of the complete geometry of a robot network. Second, robots distributively determine when a configuration is on the verge of disconnection by identifying a local articulation point—a region where the removal of a single robot will change the local topology. When such a point is detected, robots switch their behavior to clustering, which aggregates them around the vulnerable region to remove every articulation point and retain a connected configuration. Finally, we introduced an index that objectively represents the level of risk of a robot configuration against the massive fragmentation, called vulnerability index. We provide theoretical performance analyses of each algorithm and validate the results with simulations and experiments using a set of low‐cost robots. [ABSTRACT FROM AUTHOR]

In this article, the paradigm of machine culture as an extension to machine intelligence is introduced. This new concept is modelled based on animal intelligence and culture. The example of orca intelligence and culture is considered as orcas possess in addition to skills allowing them to reach preys, the ability to transmit their culture from generation to generation. The orca intelligence is studied and then simulated to design an algorithm called Orca Algorithm (OA). OA consists in modelling the orca lifestyle and in particular the orcas social organization, echolocation behaviour and hunting techniques. In order to integrate the cultural dimension, OA was hybridized with the Cultural Algorithm (CA) to get an algorithm called Orca Cultural Algorithm (OCA). OCA was tested on 22 benchmark problems of the literature to evaluate its performance. Extensive experiments were first performed to set the algorithm parameters prior to measure its effectiveness and efficiency. In a second stage, OCA was adapted to discrete problems and applied to the maze game with four level of complexity. Additional experiments were held to compare the designed algorithm with recent state‐of‐the‐art evolutionary algorithms. The overall obtained results are very promising. [ABSTRACT FROM AUTHOR]

Summary: In edge computing, how to save energy among sustainable edge nodes is a hot topic. ON/OFF switching of edge nodes as a key point is efficient but still suffers from the long round‐trip time problem because of its centralized control manner. Especially in the wireless network, service coverage is proved to be NP‐Complete. To this end, we propose a Distributed Swarm intelligence‐based Energy‐saving algorithm (DSE). In DSE, pheromone and residual energy are used to calculate the wake‐up probability. Through the wake‐up probability, the edge node can be activated periodically and efficiently. In order to balance the energy in the whole system that contains massive edge nodes, we further use a correction factor, that is, DSE+, to adjust the wake‐up probability of the nodes. The proposed methods allow for distributed implementation without requiring a centralized control by the coordinator, and the pheromone accumulated temporally and spatially. In addition, they do not require node localization. Experiments show that both DSE and DSE+ can work as expected, and DSE+ with the correction factor improves the lifetime of the whole system at least 12.6% compared with the DSE without the correction factor. [ABSTRACT FROM AUTHOR]

Summary: Cognitive radio network (CRN) has occupied rich awareness on amazing potentiality of spectrum utilization for the secondary users. In CRN, effective spectrum management has received more attention by increasing number of communication devices and several techniques have been evolved in recent years. However, efficient spectrum sensing with minimum delay reducing number of spectrum handoffs and maximum throughputs are some of the major challenges to be addressed. In this proposed work, discrete Hughes‐Hartogs optimal and dual vector spectrum management (DHHO‐DVSM) in CRN are used for effective utilization of channel selection. The expected maximization Q channel selection is designed to obtain an efficient idle channels for improved transmission of the secondary user. The optimal channel is attained by the number of idle channels maintained from the Q channel selection list. Based on each SU requests, discrete Hughes‐Hartogs particle swarm optimal channel selection is proposed to find the best channel by computing the fitness function for discrete factor. Finally, dual constraints‐based vector spectrum handoff model is proposed to produce the hyper plane based on the probability conditional factors with the objective of minimizing the number of handoffs for secondary users. The simulation result shows that the proposed method has transparent edges over conventional channel selection models. In addition, results are verified to learn the optimal channel selection with minimal sensing delay, increasing throughput and minimal handoffs. The proposed algorithm DHHO‐DVSM is 22.8% comparatively better than E‐CRNs and 41% improvement than SpecPSO. [ABSTRACT FROM AUTHOR]