Grey Wolf Optimization (GWO) is a nature-inspired metaheuristic algorithm that has gained popularity for solving optimization problems. In GWO, the success of the algorithm heavily relies on the efficient updating of ...Grey Wolf Optimization (GWO) is a nature-inspired metaheuristic algorithm that has gained popularity for solving optimization problems. In GWO, the success of the algorithm heavily relies on the efficient updating of the agents’ positions relative to the leader wolves. In this paper, we provide a brief overview of the Grey Wolf Optimization technique and its significance in solving complex optimization problems. Building upon the foundation of GWO, we introduce a novel technique for updating agents’ positions, which aims to enhance the algorithm’s effectiveness and efficiency. To evaluate the performance of our proposed approach, we conduct comprehensive experiments and compare the results with the original Grey Wolf Optimization technique. Our comparative analysis demonstrates that the proposed technique achieves superior optimization outcomes. These findings underscore the potential of our approach in addressing optimization challenges effectively and efficiently, making it a valuable contribution to the field of optimization algorithms.展开更多
Global navigation satellite system could provide accurate positioning results in signal complete condition. However, the performance is severe when signal denied, especially for the single-mode Bei Dou receiver. This ...Global navigation satellite system could provide accurate positioning results in signal complete condition. However, the performance is severe when signal denied, especially for the single-mode Bei Dou receiver. This paper proposes a dual-satellite positioning algorithm to promote the positioning performance in the satellite signal gap. The new algorithm utilizes the previous positioning data stored in complete condition to simplify the positioning equations. As the clock bias persists for a short period, this proposed method could work out accurate positioning results by only two visible satellites, without the need of computing the clock bias. Also, the Kalman filtering algorithm is used to smooth the trajectories, and improve the positioning results. During the incomplete period, only two satellites for 30 seconds and three satellites for 60 seconds, the preliminary experiment result shows that, the presented method could provide almost the same positioning results as in complete condition.展开更多
A new iterative method,which is called positive interior-point algorithm,is presented for solving the nonlinear complementarity problems.This method is of the desirable feature of robustness.And the convergence theore...A new iterative method,which is called positive interior-point algorithm,is presented for solving the nonlinear complementarity problems.This method is of the desirable feature of robustness.And the convergence theorems of the algorithm is established.In addition,some numerical results are reported.展开更多
With the help of surgical navigation system,doctors can operate on patients more intuitively and accurately.The positioning accuracy and real-time performance of surgical instruments are very important to the whole sy...With the help of surgical navigation system,doctors can operate on patients more intuitively and accurately.The positioning accuracy and real-time performance of surgical instruments are very important to the whole system.In this paper,we analyze and design the detection algorithm of surgical instrument location mark,and estimate the posture of surgical instrument.In addition,we optimized the pose by remapping.Finally,the algorithm of location mark detection proposed in this paper and the posture analysis data of surgical instruments are verified and analyzed through experiments.The final result shows a high accuracy.展开更多
To guarantee the optimal reduct set, a heuristic reduction algorithm is proposed, which considers the distinguishing information between the members of each pair decision classes. Firstly the pairwise positive region ...To guarantee the optimal reduct set, a heuristic reduction algorithm is proposed, which considers the distinguishing information between the members of each pair decision classes. Firstly the pairwise positive region is defined, based on which the pairwise significance measure is calculated between the members of each pair classes. Finally the weighted pairwise significance of attribute is used as the attribute reduction criterion, which indicates the necessity of attributes very well. By introducing the noise tolerance factor, the new algorithm can tolerate noise to some extent. Experimental results show the advantages of our novel heuristic reduction algorithm over the traditional attribute dependency based algorithm.展开更多
This note deals with how to position bricks so that m aximizing the numbers of whole brick in a given area. A method by genetic algori thm is given to solve this problem. By this method, the numbers of whole brick a n...This note deals with how to position bricks so that m aximizing the numbers of whole brick in a given area. A method by genetic algori thm is given to solve this problem. By this method, the numbers of whole brick a nd their position are gained when given areas are convex polygon and brick is re ctangular, and you can easily design a CAD soft to optimize the scheme of positi oning bricks. It is huge advantage by this method when given areas are nonregula r. Some rules of parameter’s influence to algorithm are pointed out by computer simulation. The first section states the problem and the math model of problem is given out. The second section gives out the solution by genetic algorithm, in cluding description of genetic algorithm and steps of algorithm about proble m of positioning bricks. The third section gives a computer simulation example. The last section is some discussions about this algorithm, including the influen ce of parameter to algorithm and optimizing parameter. Some rule is gained.展开更多
As increase of disk access speed has far lagged the speed of processors and main memory, disk-scheduling performance, although less significant for personal users with dedicated storage, is crucial for internet-based ...As increase of disk access speed has far lagged the speed of processors and main memory, disk-scheduling performance, although less significant for personal users with dedicated storage, is crucial for internet-based intensive data processing. For modern disks, increase of disk rotation rate makes overhead of disk access to data transfer heavier. Therefore, it seems more important to improve both parallel processing capability of disk I/O and disk-scheduling performance at the same time. For disk-scheduling algorithms based on both disk arm and rotational positions, their time-resolving powers are more precise in comparison with those for disk-scheduling algorithms based only on disk arm position. Algorithms of this sort are studied in this paper. Several improved algorithms based on rotational position are proposed, and simulation results of their performances demonstrate.展开更多
This paper presents a new distributed positioning algorithm for unknown nodes in a wireless sensor network. The algorithm is based exclusively on connectivity. First, assuming that the positions of the anchor nodes ar...This paper presents a new distributed positioning algorithm for unknown nodes in a wireless sensor network. The algorithm is based exclusively on connectivity. First, assuming that the positions of the anchor nodes are already known, a circular belt containing an unknown node is obtained using information about the anchor nodes that are in radio range of the unknown node, based on the geometric relationships and communication constraints among the unknown node and the anchor nodes. Then, the centroid of the circular belt is taken to be the estimated position of the unknown node. Since the algorithm is very simple and since the only communication needed is between the anchor nodes and the unknown node, the communication and computational loads are very small. Furthermore, the algorithm is robust because neither the failure of old unknown nodes nor the addition of new unknown nodes influences the positioning of unknown nodes to be located. A theoretical analysis and simulation results show that the algorithm does not produce any cumulative error and is insensitive to range error, and that a change in the number of sensor nodes does not affect the communication or computational load. These features make this algorithm suitable for all sizes of low-power wireless sensor networks.展开更多
In the fingerprint matching-based wireless local area network(WLAN) indoor positioning system,Kalman filter(KF) is usually applied after fingerprint matching algorithms to make positioning results more accurate and co...In the fingerprint matching-based wireless local area network(WLAN) indoor positioning system,Kalman filter(KF) is usually applied after fingerprint matching algorithms to make positioning results more accurate and consecutive.But this method,like most methods in WLAN indoor positioning field,fails to consider and make use of users' moving speed information.In order to make the positioning results more accurate through using the users' moving speed information,a coordinate correction algorithm(CCA) is proposed in this paper.It predicts a reasonable range for positioning coordinates by using the moving speed information.If the real positioning coordinates are not in the predicted range,it means that the positioning coordinates are not reasonable to a moving user in indoor environment,so the proposed CCA is used to correct this kind of positioning coordinates.The simulation results prove that the positioning results by the CCA are more accurate than those calculated by the KF and the CCA is effective to improve the positioning performance.展开更多
ZigBee无线通信技术在智能家居组网中具有重要的应用。为了探究其使用场景和方法,文章首先分析了基于ZigBee的智能家居网络组网方式,其次介绍了接收信号强度指示(Received Signal Strength Indicator,RSSI)算法的测距原理和DV-Hop算法...ZigBee无线通信技术在智能家居组网中具有重要的应用。为了探究其使用场景和方法,文章首先分析了基于ZigBee的智能家居网络组网方式,其次介绍了接收信号强度指示(Received Signal Strength Indicator,RSSI)算法的测距原理和DV-Hop算法的测点原理,最后针对两种算法的局限性,提出基于阈值的改进定位算法。展开更多
温度控制在生产生活中发挥着举足轻重的作用。位式控制算法在调节具有滞后性的水暖床垫温度控制系统时容易导致温度在目标值上下波动,控制效果不理想。为了解决此问题,设计了一种基于位置式PID的水暖床垫温度控制系统,系统以51内核的微...温度控制在生产生活中发挥着举足轻重的作用。位式控制算法在调节具有滞后性的水暖床垫温度控制系统时容易导致温度在目标值上下波动,控制效果不理想。为了解决此问题,设计了一种基于位置式PID的水暖床垫温度控制系统,系统以51内核的微处理器为核心控制器、以负温度系数热敏电阻(Negative Temperature Coefficient,NTC)为温度传感器、以PTC为加热器、以直流电机作为循环水泵。经实际测试结果表明,该系统运行稳定,控温精度在±0.5℃以内,达到了理想的温度控制效果。展开更多
文摘Grey Wolf Optimization (GWO) is a nature-inspired metaheuristic algorithm that has gained popularity for solving optimization problems. In GWO, the success of the algorithm heavily relies on the efficient updating of the agents’ positions relative to the leader wolves. In this paper, we provide a brief overview of the Grey Wolf Optimization technique and its significance in solving complex optimization problems. Building upon the foundation of GWO, we introduce a novel technique for updating agents’ positions, which aims to enhance the algorithm’s effectiveness and efficiency. To evaluate the performance of our proposed approach, we conduct comprehensive experiments and compare the results with the original Grey Wolf Optimization technique. Our comparative analysis demonstrates that the proposed technique achieves superior optimization outcomes. These findings underscore the potential of our approach in addressing optimization challenges effectively and efficiently, making it a valuable contribution to the field of optimization algorithms.
基金partially supported by the National Natural Science Foundation of China under Grant No.61601296, 61601295, and 61671304
文摘Global navigation satellite system could provide accurate positioning results in signal complete condition. However, the performance is severe when signal denied, especially for the single-mode Bei Dou receiver. This paper proposes a dual-satellite positioning algorithm to promote the positioning performance in the satellite signal gap. The new algorithm utilizes the previous positioning data stored in complete condition to simplify the positioning equations. As the clock bias persists for a short period, this proposed method could work out accurate positioning results by only two visible satellites, without the need of computing the clock bias. Also, the Kalman filtering algorithm is used to smooth the trajectories, and improve the positioning results. During the incomplete period, only two satellites for 30 seconds and three satellites for 60 seconds, the preliminary experiment result shows that, the presented method could provide almost the same positioning results as in complete condition.
文摘A new iterative method,which is called positive interior-point algorithm,is presented for solving the nonlinear complementarity problems.This method is of the desirable feature of robustness.And the convergence theorems of the algorithm is established.In addition,some numerical results are reported.
基金supported by the Sichuan Science and Technology Program(2021YFQ0003).
文摘With the help of surgical navigation system,doctors can operate on patients more intuitively and accurately.The positioning accuracy and real-time performance of surgical instruments are very important to the whole system.In this paper,we analyze and design the detection algorithm of surgical instrument location mark,and estimate the posture of surgical instrument.In addition,we optimized the pose by remapping.Finally,the algorithm of location mark detection proposed in this paper and the posture analysis data of surgical instruments are verified and analyzed through experiments.The final result shows a high accuracy.
基金Sponsored by the Ministerial Level Advanced Research Foundation(11415133)
文摘To guarantee the optimal reduct set, a heuristic reduction algorithm is proposed, which considers the distinguishing information between the members of each pair decision classes. Firstly the pairwise positive region is defined, based on which the pairwise significance measure is calculated between the members of each pair classes. Finally the weighted pairwise significance of attribute is used as the attribute reduction criterion, which indicates the necessity of attributes very well. By introducing the noise tolerance factor, the new algorithm can tolerate noise to some extent. Experimental results show the advantages of our novel heuristic reduction algorithm over the traditional attribute dependency based algorithm.
文摘This note deals with how to position bricks so that m aximizing the numbers of whole brick in a given area. A method by genetic algori thm is given to solve this problem. By this method, the numbers of whole brick a nd their position are gained when given areas are convex polygon and brick is re ctangular, and you can easily design a CAD soft to optimize the scheme of positi oning bricks. It is huge advantage by this method when given areas are nonregula r. Some rules of parameter’s influence to algorithm are pointed out by computer simulation. The first section states the problem and the math model of problem is given out. The second section gives out the solution by genetic algorithm, in cluding description of genetic algorithm and steps of algorithm about proble m of positioning bricks. The third section gives a computer simulation example. The last section is some discussions about this algorithm, including the influen ce of parameter to algorithm and optimizing parameter. Some rule is gained.
基金Project supported by National Natural Science Foundation of Chi-na( Grant No . 60373088) , and Defense Pre-research Project ofChina(Grant No .413160502)
文摘As increase of disk access speed has far lagged the speed of processors and main memory, disk-scheduling performance, although less significant for personal users with dedicated storage, is crucial for internet-based intensive data processing. For modern disks, increase of disk rotation rate makes overhead of disk access to data transfer heavier. Therefore, it seems more important to improve both parallel processing capability of disk I/O and disk-scheduling performance at the same time. For disk-scheduling algorithms based on both disk arm and rotational positions, their time-resolving powers are more precise in comparison with those for disk-scheduling algorithms based only on disk arm position. Algorithms of this sort are studied in this paper. Several improved algorithms based on rotational position are proposed, and simulation results of their performances demonstrate.
基金This work was supported by the National Science Foundation of P.R.China(No.60425310)the Teaching and Research Award Program for Outstanding Young Teachers in Higher Education Institutions of the Ministry of Education,P.R.China (TRAPOYT).
文摘This paper presents a new distributed positioning algorithm for unknown nodes in a wireless sensor network. The algorithm is based exclusively on connectivity. First, assuming that the positions of the anchor nodes are already known, a circular belt containing an unknown node is obtained using information about the anchor nodes that are in radio range of the unknown node, based on the geometric relationships and communication constraints among the unknown node and the anchor nodes. Then, the centroid of the circular belt is taken to be the estimated position of the unknown node. Since the algorithm is very simple and since the only communication needed is between the anchor nodes and the unknown node, the communication and computational loads are very small. Furthermore, the algorithm is robust because neither the failure of old unknown nodes nor the addition of new unknown nodes influences the positioning of unknown nodes to be located. A theoretical analysis and simulation results show that the algorithm does not produce any cumulative error and is insensitive to range error, and that a change in the number of sensor nodes does not affect the communication or computational load. These features make this algorithm suitable for all sizes of low-power wireless sensor networks.
基金Sponsored by the High Technology Research and Development Program of China (Grant No. 2008AA12Z305)
文摘In the fingerprint matching-based wireless local area network(WLAN) indoor positioning system,Kalman filter(KF) is usually applied after fingerprint matching algorithms to make positioning results more accurate and consecutive.But this method,like most methods in WLAN indoor positioning field,fails to consider and make use of users' moving speed information.In order to make the positioning results more accurate through using the users' moving speed information,a coordinate correction algorithm(CCA) is proposed in this paper.It predicts a reasonable range for positioning coordinates by using the moving speed information.If the real positioning coordinates are not in the predicted range,it means that the positioning coordinates are not reasonable to a moving user in indoor environment,so the proposed CCA is used to correct this kind of positioning coordinates.The simulation results prove that the positioning results by the CCA are more accurate than those calculated by the KF and the CCA is effective to improve the positioning performance.
文摘ZigBee无线通信技术在智能家居组网中具有重要的应用。为了探究其使用场景和方法,文章首先分析了基于ZigBee的智能家居网络组网方式,其次介绍了接收信号强度指示(Received Signal Strength Indicator,RSSI)算法的测距原理和DV-Hop算法的测点原理,最后针对两种算法的局限性,提出基于阈值的改进定位算法。
文摘温度控制在生产生活中发挥着举足轻重的作用。位式控制算法在调节具有滞后性的水暖床垫温度控制系统时容易导致温度在目标值上下波动,控制效果不理想。为了解决此问题,设计了一种基于位置式PID的水暖床垫温度控制系统,系统以51内核的微处理器为核心控制器、以负温度系数热敏电阻(Negative Temperature Coefficient,NTC)为温度传感器、以PTC为加热器、以直流电机作为循环水泵。经实际测试结果表明,该系统运行稳定,控温精度在±0.5℃以内,达到了理想的温度控制效果。
