Smart sensor systems have gained increasing importance in various fields, including healthcare, environmental monitoring, industrial automation, and security. Photoacoustic gas sensors are an emerging type of optical ...
详细信息
Smart sensor systems have gained increasing importance in various fields, including healthcare, environmental monitoring, industrial automation, and security. Photoacoustic gas sensors are an emerging type of optical sensor used in various applications due to its enhanced performance characteristics. However, the accuracy and reliability of gas concentration measurements from photoacoustic gas sensors may be impacted by several known limitations, including drift of the gas cell resonant frequency over extended periods of time. Researchers have proposed various solutions, including optimization methods and signal processing algorithms, to address this and others issues. In this paper, we propose a novel solution using an extremum-seeking control algorithm to manage the laser modulation frequency of photoacoustic gas sensors. By tracking the changing resonant frequency of the gas cell, long-term stability can be achieved, making it suitable for environmental monitoring, petroleum exploration, and industrial process control. Our approach has the potential to improve the accuracy and reliability of long-term measurements obtained from photoacoustic gas sensors, providing a stable and reliable method for gas concentration estimation.
Parameter uncertainty is inevitably found in almost every system and, if is ignored, it could jeopardize the effectiveness of control method. Motivated by this issue, we consider a robust optimal control problem gover...
详细信息
Parameter uncertainty is inevitably found in almost every system and, if is ignored, it could jeopardize the effectiveness of control method. Motivated by this issue, we consider a robust optimal control problem governed by a nonlinear fractional system with uncertain parameters, where the system sensitivity with respect to the uncertain parameters is explicitly included in the cost functional. For this problem, we first prove that the system sensitivity can be expressed as the solution of an auxiliary fractional system. Then, we propose a numerical scheme for discretizing both the original and auxiliary fractional systems, resulting in a finite dimensional optimization problem. Furthermore, a numerical solution algorithm based on gradients of the cost functional is developed for the resulting optimization problem. Finally, numerical results for two example problems are given to demonstrate the validity and applicability of the proposed algorithm.
During the early design stage of green residential buildings, there are tremendous potential of using parametric optimization to achieve preferable green performance, such as building energy consumption efficiency, da...
详细信息
During the early design stage of green residential buildings, there are tremendous potential of using parametric optimization to achieve preferable green performance, such as building energy consumption efficiency, daylighting, ventilation and thermal comfort. Taking residential design features into consideration, this paper presents an optimization workflow and effects based on a case study of a residential building project in Beijing. Firstly, 27 design parameters related to residential spatial form and building envelope were selected for the optimization. The simulation results of the cooling and heating load were taken as the optimization objects. Secondly, optimized schemes were obtained from 6246 simulation results, with 1925 verified simulation results proving that the optimized result is reliable. Finally, analysis was performed to establish the correlations between design parameters and performance in order to create the easy access for architects to determine design parameters depending on the performance sensitivity of each parameter. Analysis results showed that parametric optimization of spatial form and building envelope at the design stage is a feasible approach to reducing energy consumption in residential building design.
A novel parameter-free meta-heuristic optimization algorithm known as the golden ratio optimization method (GROM) is proposed. The proposed algorithm is inspired by the golden ratio of plant and animal growth which is...
详细信息
A novel parameter-free meta-heuristic optimization algorithm known as the golden ratio optimization method (GROM) is proposed. The proposed algorithm is inspired by the golden ratio of plant and animal growth which is formulated by the well-known mathematician Fibonacci. He introduced a series of numbers in which a number (except the first two numbers) is equal to the sum of the two previous numbers. In this series, the ratio of two consecutive numbers is almost the same for all the numbers and is known as golden ratio. This ratio can be extensively found in nature such as snail lacquer part and foliage growth of trees. The proposed approach employed this golden ratio to update the solutions in an optimization algorithm. In the proposed method, the solutions are updated in two different phases to achieve the global best answer. There is no need for any parameter tuning, and the implementation of the proposed method is very simple. In order to evaluate the proposed method, 29 well-known benchmark test functions and also 5 classical engineering optimization problems including 4 mechanical engineering problems and 1 electrical engineering problem are employed. Using several test functions, the performance of the proposed method in solving different problems including discrete, continuous, high dimension, and high constraints problems is testified. The results of the proposed method are compared with those of 11 well-regarded state-of-the-art optimization algorithms. The comparisons are made from different aspects such as the final obtained answer, the speed and behavior of convergence, and CPU time consumption. Superiority of the purposed method from different points of views can be concluded by means of comparisons.
There is a strong need for the optimized management of the thermal problem in Nd:YAG laser rod and for a powerful, fast, and accurate modelling tool capable of treating the heat source distribution very close to what ...
详细信息
There is a strong need for the optimized management of the thermal problem in Nd:YAG laser rod and for a powerful, fast, and accurate modelling tool capable of treating the heat source distribution very close to what it actually is. In this paper, a new optimization algorithm called bacterial foraging optimization algorithm (BFOA) is proposed for simulation of the radial heat distribution. A BFOA discloses a simulation method which delivers the exact temperature distribution in a circularly cylindrical structure with a circularly symmetrical, longitudinally, and transversally non-uniform heat source distribution and circularly symmetrical cooling means. The output power is obtained and compared with previously published experimental measurements for different pump power and a good agreement has been found.
A reconfiguration error correction model for an FBG shape sensor (FSS) is proposed. The model includes curvature, bending direction error correction, and the self-correction of the FBG placement angle and calibration ...
详细信息
A reconfiguration error correction model for an FBG shape sensor (FSS) is proposed. The model includes curvature, bending direction error correction, and the self-correction of the FBG placement angle and calibration error based on an improved sparrow search algorithm (SSA). SSA could automatically correct the placement angle and calibration direction of the FBG, and then use the corrected placement angle and calibration direction to correct the curvature and bending direction of the FSS, thereby improving the accuracy of shape reconfiguration. After error correction, the tail point reconfiguration errors of different shapes were reduced from 2.56% and 4.96% to 1.12% and 2.45%, respectively. This paper provides a new reconfiguration error correction method for FSS that does not require a complicated experimental calibration process, is simpler, more efficient, and more operable than traditional methods, and has great potential in FSS application scenarios.
Since segmentation of magnetic resonance images is one of the most important initial steps in brain magnetic resonance image processing, success in this part has a great influence on the quality of outcomes of subsequ...
详细信息
Since segmentation of magnetic resonance images is one of the most important initial steps in brain magnetic resonance image processing, success in this part has a great influence on the quality of outcomes of subsequent steps. In the past few decades, numerous methods have been introduced for classification of such images, but typically they perform well only on a specific subset of images, do not generalize well to other image sets, and have poor computational performance. In this study, we provided a method for segmentation of magnetic resonance images of the brain that despite its simplicity has a high accuracy. We compare the performance of our proposed algorithm with similar evolutionary algorithms on a pixel-by-pixel basis. Our algorithm is tested across varying sets of magnetic resonance images and demonstrates high speed and accuracy. It should be noted that in initial steps, the algorithm is computationally intensive requiring a large number of calculations;however, in subsequent steps of the search process, the number is reduced with the segmentation focused only in the target area.
The world wide web acts as the dominant tool for data transmission due to access such as data retrieving and data transactions. The retrieval of data from the web is a complex procedure due to the large volume of web ...
详细信息
The world wide web acts as the dominant tool for data transmission due to access such as data retrieving and data transactions. The retrieval of data from the web is a complex procedure due to the large volume of web domain. The basic uses of the websites are described through web usage mining, which mines the weblog records to identify the pattern of accessing the web pages through the user. The web page prediction assists the web users in finding the plot and obtains the information as to their requirements. Several effective algorithms have been developed to mine association rules that make the predictive model more appropriate for web prediction. They can be commonly revised to ensure the changing feature of web access patterns. The Apriori algorithm involves extracting the recurrent itemset and interrelation rule that learns the relational data is commonly utilized for web page prediction. The Apriori algorithm remains the standard model for deriving the patterns and rules from the datasets in co-operative rule extraction. The Apriori algorithm thus generates large mines associated rules for web page prediction. Hence, to select the best rule, the proposed deer hunting rooster-based chicken swarm optimization algorithm is used by integrating the cockerel search agents' dominating social search creatures' hunting habits and their traits of looking for food. Further, the neural network (NN) is employed in this research for the prediction of web pages with minimum error. The trained NN is a technique of unsupervised learning that analyzes a dataset of input to produce the desired result, in which the effectiveness of the NN is enhanced by optimal tuning of weight by the adaptive deer hunting rooster-based chicken swarm optimization algorithm. The experimental analysis illustrates that the proposed adaptive deer hunting rooster-based chicken swarm optimization frameworks inherit lower error measures such as mean deviation = 139.89 and symmetric mean absolute percen
Bat algorithm is one of the optimization techniques that mimic the behavior of bat. Bat algorithm is a powerful algorithm in finding the optimum feature data collection. Classification is one of the data mining tasks ...
详细信息
Bat algorithm is one of the optimization techniques that mimic the behavior of bat. Bat algorithm is a powerful algorithm in finding the optimum feature data collection. Classification is one of the data mining tasks that useful in knowledge representation. But, the high dimensional data become the issue in the classification that interrupt classification accuracy. From the literature, feature selection and discretization able to overcome the problem. Therefore, this study aims to show Bat algorithm is potential as a discretization approach and as a feature selection to improve classification accuracy. In this paper, a new hybrid Bat-K-Mean algorithm refer as hBA is proposed to convert continuous data into discrete data called as optimize discrete dataset. Then, Bat is used as feature selection to select the optimum feature from the optimized discrete dataset in order to reduce the dimension of data. The experiment is conducted by using k-Nearest Neighbor to evaluate the effectiveness of discretization and feature selection in classification by comparing with continuous dataset without feature selection, discrete dataset without feature selection, and continuous dataset without discretization and feature selection. Also, to show Bat is potential as a discretization approach and feature selection method. The experiments were carried out using a number of benchmark datasets from the UCI machine learning repository. The results show the classification accuracy is improved with the Bat-K-Means optimized discretization and Bat optimized feature selection.
Employee deployment is a crucial process in production systems. Based on qualification and individual performance of employees, deployment decisions can lead to ambiguous outcomes. This paper first reviews the state o...
详细信息
Employee deployment is a crucial process in production systems. Based on qualification and individual performance of employees, deployment decisions can lead to ambiguous outcomes. This paper first reviews the state of the art and further compares two methods based on combinatorial analysis for employee deployment. Therefore, this paper emphasizes the costs and benefits of a Brute Force and an alternative Greedy method. When considering the qualification and individual performance of each employee, both algorithms provide working solutions. In direct comparison, the outcome of the alternative Greedy algorithm is more efficient in terms of calculation time whereas the Brute Force method provides the combination with the global optimum. This means calculation time as well as quality of outcome differ. The exponential growth of employee allocation possibilities depends on the amount of employees and leads to high calculation times, when using a Brute Force method. The comparison of both methods reveal that the proposed alternative Greedy algorithm reaches nearly as high outcomes as the Brute Force does, with significantly less calculation time. Furthermore, this paper offers an insight into the impact of deployment decisions within production systems.
暂无评论