In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of t...In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of the three-dimensional attack area model,restrict their practical applications.To address these issues,an improved backtracking algorithm is proposed to improve calculation efficiency.A significant reduction in solution time and maintenance of accuracy in the three-dimensional attack area are achieved by using the proposed algorithm.Furthermore,the age-layered population structure genetic programming(ALPS-GP)algorithm is introduced to determine an analytical polynomial model of the three-dimensional attack area,considering real-time requirements.The accuracy of the polynomial model is enhanced through the coefficient correction using an improved gradient descent algorithm.The study reveals a remarkable combination of high accuracy and efficient real-time computation,with a mean error of 91.89 m using the analytical polynomial model of the three-dimensional attack area solved in just 10^(-4)s,thus meeting the requirements of real-time combat scenarios.展开更多
The backtracking search optimization algorithm（BSA） is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powe...The backtracking search optimization algorithm（BSA） is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powerful capability to find global optimal solutions. However, the algorithm is still insufficient in balancing the exploration and the exploitation. Therefore, an improved adaptive backtracking search optimization algorithm combined with modified Hooke-Jeeves pattern search is proposed for numerical global optimization. It has two main parts： the BSA is used for the exploration phase and the modified pattern search method completes the exploitation phase. In particular, a simple but effective strategy of adapting one of BSA＇s important control parameters is introduced. The proposed algorithm is compared with standard BSA, three state-of-the-art evolutionary algorithms and three superior algorithms in IEEE Congress on Evolutionary Computation 2014（IEEE CEC2014） over six widely-used benchmarks and 22 real-parameter single objective numerical optimization benchmarks in IEEE CEC2014. The results of experiment and statistical analysis demonstrate the effectiveness and efficiency of the proposed algorithm.展开更多
In the distribution center, the way of order picking personnel to pick goods has two kinds: single picking and batch picking. Based on the way of the single picking and assumed warehouse model, in order to reduce the ...In the distribution center, the way of order picking personnel to pick goods has two kinds: single picking and batch picking. Based on the way of the single picking and assumed warehouse model, in order to reduce the walking path of order picking, the order picking problem is transformed into the traveling salesman problem in this paper. Based on backtracking algorithm, the order picking path gets optimized. Finally verifing the optimization method under the environment of VC++6.0, order picking path in the warehouse model get optimized, and compared with the traditional order picking walking paths. The results show that in small and medium-sized warehouse, the optimization method proposed in this paper can reduce order picking walking path and improve the work efficiency as well as reduce the time cost.展开更多
Failure-insensitive routing is a good mechanism to avoid packet dropping and disconnection of forwarding when some links fail, but multiple failure links may bring routing loop for the mechanism. Backtracking routing ...Failure-insensitive routing is a good mechanism to avoid packet dropping and disconnection of forwarding when some links fail, but multiple failure links may bring routing loop for the mechanism. Backtracking routing algorithm based on inverse shortest path tree rooted at destination is presented. The feasible restoration routing is obtained through searching from the start of the failure link and tracing back to the leaves of the shortest path tree with the destination as the root. The packets are forwarded from the mounted point with smaller sequence to the mount point with bigger sequence to decrease the possible of loop in case of multi-failures. The simulations and analysis indicate that backtracking routing algorithm improves the network survivability especially for large network, at the cost of the computation complexity in the same order as failure insensitive routing.展开更多
A new iterative greedy algorithm based on the backtracking technique was proposed for distributed compressed sensing(DCS) problem. The algorithm applies two mechanisms for precise recovery soft thresholding and cuttin...A new iterative greedy algorithm based on the backtracking technique was proposed for distributed compressed sensing(DCS) problem. The algorithm applies two mechanisms for precise recovery soft thresholding and cutting. It can reconstruct several compressed signals simultaneously even without any prior information of the sparsity, which makes it a potential candidate for many practical applications, but the numbers of non-zero(significant) coefficients of signals are not available. Numerical experiments are conducted to demonstrate the validity and high performance of the proposed algorithm, as compared to other existing strong DCS algorithms.展开更多
After the introduction of BTL （Build-Transfer-Lease） projects in 2005, most construction projects of school facilities have been implemented in BTL system. However, concern about whether the school facilities can be...After the introduction of BTL （Build-Transfer-Lease） projects in 2005, most construction projects of school facilities have been implemented in BTL system. However, concern about whether the school facilities can be managed appropriately during the 20 year as operation and management period is increasing. Therefore, the necessity of reference for evaluation standard on operating costs and the establishment of LCC （life cycle costing） prediction models is coming to the fore. In this respect, the goal of this study was to extract the variables for LCC-related models and conduct analyses of the correlations of the variables using statistical analysis tool, in order to establish LCC prediction and backtracking model based on BTL project cases of school facilities. The prediction and backtracking model of LCC will be a key for budget equalization or optimum range as one way of estimating method using LCC by year and school type. In the future, it would provide the accurate reference for analyzing and managing the actual input costs against the plan and evaluating the practical cost for long-term facility management plan as the predictive management.展开更多
We study the mixing rate of non-backtracking random walks on graphs by looking at non-backtracking walks as walks on the directed edges of a graph. A result known as Ihara’s Theorem relates the adjacency matrix of a ...We study the mixing rate of non-backtracking random walks on graphs by looking at non-backtracking walks as walks on the directed edges of a graph. A result known as Ihara’s Theorem relates the adjacency matrix of a graph to a matrix related to non-backtracking walks on the directed edges. We prove a weighted version of Ihara’s Theorem which relates the transition probability matrix of a non-backtracking walk to the transition matrix for the usual random walk. This allows us to determine the spectrum of the transition probability matrix of a non-backtracking random walk in the case of regular graphs and biregular graphs. As a corollary, we obtain a result of Alon et al. in [1] that in most cases, a non-backtracking random walk on a regular graph has a faster mixing rate than the usual random walk. In addition, we obtain an analogous result for biregular graphs.展开更多
现有研究在多QoS(quality of service)调度问题中,由于仅依赖即时奖励反馈机制,在资源受限的场景下处理时延敏感数据和具有连续传输需求的媒体数据时,存在可扩展性差和资源浪费的问题。为此,提出了一种基于奖励回溯的DQN(reward backtra...现有研究在多QoS(quality of service)调度问题中,由于仅依赖即时奖励反馈机制,在资源受限的场景下处理时延敏感数据和具有连续传输需求的媒体数据时,存在可扩展性差和资源浪费的问题。为此,提出了一种基于奖励回溯的DQN(reward backtracking based deep Q-network,RB-DQN)算法。该算法通过未来时刻的交互来回溯调整当前状态的策略评估,以更加有效地识别并解决因不合理调度策略导致的丢包。同时,设计了一种时延-吞吐均衡度量(latency throughput trade-off,LTT)指标,该指标综合考虑了时延敏感数据和媒体类型数据的业务需求,并可通过权重调整来突出不同的侧重点。大量仿真结果表明,与其他调度策略相比,所提算法能够有效降低时延敏感数据的延迟和抖动,同时确保媒体类型数据的流畅性与稳定性。展开更多
为全面提取节点的全局特征,提高复杂网络关键节点识别结果的准确性,提出一种基于改进DDQN(double deep Q-network)算法的复杂网络关键节点识别方法。通过重构DDQN的初始奖励值、引入回退探索和优先访问方法,改进DDQN算法,提取节点全局特...为全面提取节点的全局特征,提高复杂网络关键节点识别结果的准确性,提出一种基于改进DDQN(double deep Q-network)算法的复杂网络关键节点识别方法。通过重构DDQN的初始奖励值、引入回退探索和优先访问方法,改进DDQN算法,提取节点全局特征,从而提升全局特征提取的效率和提取结果的准确性。引入聚类系数获取节点的局部特征,通过网络性能均值实验得到全局特征和局部特征的融合参数,对全局特征和局部特征进行融合,得到节点的重要度排序,从而实现关键节点识别。在7个真实网络数据集上的实验结果表明,此方法在基于网络性能均值的评价指标以及SIR模型上均优于对比的基线方法。证明其可以更全面地提取节点全局特征,更准确地识别关键节点。展开更多
In this paper, we propose a new hybrid method called SQPBSA which combines backtracking search optimization algorithm （BSA） and sequential quadratic programming （SQP）. BSA, as an exploration search engine, gives a...In this paper, we propose a new hybrid method called SQPBSA which combines backtracking search optimization algorithm （BSA） and sequential quadratic programming （SQP）. BSA, as an exploration search engine, gives a good direction to the global optimal region, while SQP is used as a local search technique to exploit the optimal solution. The experiments are carried on two suits of 28 functions proposed in the CEC-2013 competitions to verify the performance of SQPBSA. The results indicate the proposed method is effective and competitive.展开更多
基金National Natural Science Foundation of China(62373187)Forward-looking Layout Special Projects(ILA220591A22)。
文摘In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of the three-dimensional attack area model,restrict their practical applications.To address these issues,an improved backtracking algorithm is proposed to improve calculation efficiency.A significant reduction in solution time and maintenance of accuracy in the three-dimensional attack area are achieved by using the proposed algorithm.Furthermore,the age-layered population structure genetic programming(ALPS-GP)algorithm is introduced to determine an analytical polynomial model of the three-dimensional attack area,considering real-time requirements.The accuracy of the polynomial model is enhanced through the coefficient correction using an improved gradient descent algorithm.The study reveals a remarkable combination of high accuracy and efficient real-time computation,with a mean error of 91.89 m using the analytical polynomial model of the three-dimensional attack area solved in just 10^(-4)s,thus meeting the requirements of real-time combat scenarios.
基金supported by the National Natural Science Foundation of China(61271250)
文摘The backtracking search optimization algorithm（BSA） is one of the most recently proposed population-based evolutionary algorithms for global optimization. Due to its memory ability and simple structure, BSA has powerful capability to find global optimal solutions. However, the algorithm is still insufficient in balancing the exploration and the exploitation. Therefore, an improved adaptive backtracking search optimization algorithm combined with modified Hooke-Jeeves pattern search is proposed for numerical global optimization. It has two main parts： the BSA is used for the exploration phase and the modified pattern search method completes the exploitation phase. In particular, a simple but effective strategy of adapting one of BSA＇s important control parameters is introduced. The proposed algorithm is compared with standard BSA, three state-of-the-art evolutionary algorithms and three superior algorithms in IEEE Congress on Evolutionary Computation 2014（IEEE CEC2014） over six widely-used benchmarks and 22 real-parameter single objective numerical optimization benchmarks in IEEE CEC2014. The results of experiment and statistical analysis demonstrate the effectiveness and efficiency of the proposed algorithm.
文摘In the distribution center, the way of order picking personnel to pick goods has two kinds: single picking and batch picking. Based on the way of the single picking and assumed warehouse model, in order to reduce the walking path of order picking, the order picking problem is transformed into the traveling salesman problem in this paper. Based on backtracking algorithm, the order picking path gets optimized. Finally verifing the optimization method under the environment of VC++6.0, order picking path in the warehouse model get optimized, and compared with the traditional order picking walking paths. The results show that in small and medium-sized warehouse, the optimization method proposed in this paper can reduce order picking walking path and improve the work efficiency as well as reduce the time cost.
基金Supported by the National Natural Science Foundation of China (60502028)
文摘Failure-insensitive routing is a good mechanism to avoid packet dropping and disconnection of forwarding when some links fail, but multiple failure links may bring routing loop for the mechanism. Backtracking routing algorithm based on inverse shortest path tree rooted at destination is presented. The feasible restoration routing is obtained through searching from the start of the failure link and tracing back to the leaves of the shortest path tree with the destination as the root. The packets are forwarded from the mounted point with smaller sequence to the mount point with bigger sequence to decrease the possible of loop in case of multi-failures. The simulations and analysis indicate that backtracking routing algorithm improves the network survivability especially for large network, at the cost of the computation complexity in the same order as failure insensitive routing.
基金Projects(61203287,61302138,11126274)supported by the National Natural Science Foundation of ChinaProject(2013CFB414)supported by Natural Science Foundation of Hubei Province,ChinaProject(CUGL130247)supported by the Special Fund for Basic Scientific Research of Central Colleges of China University of Geosciences
文摘A new iterative greedy algorithm based on the backtracking technique was proposed for distributed compressed sensing(DCS) problem. The algorithm applies two mechanisms for precise recovery soft thresholding and cutting. It can reconstruct several compressed signals simultaneously even without any prior information of the sparsity, which makes it a potential candidate for many practical applications, but the numbers of non-zero(significant) coefficients of signals are not available. Numerical experiments are conducted to demonstrate the validity and high performance of the proposed algorithm, as compared to other existing strong DCS algorithms.
文摘After the introduction of BTL （Build-Transfer-Lease） projects in 2005, most construction projects of school facilities have been implemented in BTL system. However, concern about whether the school facilities can be managed appropriately during the 20 year as operation and management period is increasing. Therefore, the necessity of reference for evaluation standard on operating costs and the establishment of LCC （life cycle costing） prediction models is coming to the fore. In this respect, the goal of this study was to extract the variables for LCC-related models and conduct analyses of the correlations of the variables using statistical analysis tool, in order to establish LCC prediction and backtracking model based on BTL project cases of school facilities. The prediction and backtracking model of LCC will be a key for budget equalization or optimum range as one way of estimating method using LCC by year and school type. In the future, it would provide the accurate reference for analyzing and managing the actual input costs against the plan and evaluating the practical cost for long-term facility management plan as the predictive management.
文摘We study the mixing rate of non-backtracking random walks on graphs by looking at non-backtracking walks as walks on the directed edges of a graph. A result known as Ihara’s Theorem relates the adjacency matrix of a graph to a matrix related to non-backtracking walks on the directed edges. We prove a weighted version of Ihara’s Theorem which relates the transition probability matrix of a non-backtracking walk to the transition matrix for the usual random walk. This allows us to determine the spectrum of the transition probability matrix of a non-backtracking random walk in the case of regular graphs and biregular graphs. As a corollary, we obtain a result of Alon et al. in [1] that in most cases, a non-backtracking random walk on a regular graph has a faster mixing rate than the usual random walk. In addition, we obtain an analogous result for biregular graphs.
文摘现有研究在多QoS(quality of service)调度问题中,由于仅依赖即时奖励反馈机制,在资源受限的场景下处理时延敏感数据和具有连续传输需求的媒体数据时,存在可扩展性差和资源浪费的问题。为此,提出了一种基于奖励回溯的DQN(reward backtracking based deep Q-network,RB-DQN)算法。该算法通过未来时刻的交互来回溯调整当前状态的策略评估,以更加有效地识别并解决因不合理调度策略导致的丢包。同时,设计了一种时延-吞吐均衡度量(latency throughput trade-off,LTT)指标,该指标综合考虑了时延敏感数据和媒体类型数据的业务需求,并可通过权重调整来突出不同的侧重点。大量仿真结果表明,与其他调度策略相比,所提算法能够有效降低时延敏感数据的延迟和抖动,同时确保媒体类型数据的流畅性与稳定性。
文摘为全面提取节点的全局特征,提高复杂网络关键节点识别结果的准确性,提出一种基于改进DDQN(double deep Q-network)算法的复杂网络关键节点识别方法。通过重构DDQN的初始奖励值、引入回退探索和优先访问方法,改进DDQN算法,提取节点全局特征,从而提升全局特征提取的效率和提取结果的准确性。引入聚类系数获取节点的局部特征,通过网络性能均值实验得到全局特征和局部特征的融合参数,对全局特征和局部特征进行融合,得到节点的重要度排序,从而实现关键节点识别。在7个真实网络数据集上的实验结果表明,此方法在基于网络性能均值的评价指标以及SIR模型上均优于对比的基线方法。证明其可以更全面地提取节点全局特征,更准确地识别关键节点。
基金Acknowledgements This work was supported by the NSFC-Guangdong Joint Fund （U1201258）, the National Natural Science Foundation of China （Grant No. 61573219）, the Shandong Natural Science Funds for Distinguished Young Scholars （JQ201316）, the Fundamental Research Funds of Shandong University （2014JC028）, and the Natural Science Foundation of Fujian Province of China （2016J01280）.
文摘In this paper, we propose a new hybrid method called SQPBSA which combines backtracking search optimization algorithm （BSA） and sequential quadratic programming （SQP）. BSA, as an exploration search engine, gives a good direction to the global optimal region, while SQP is used as a local search technique to exploit the optimal solution. The experiments are carried on two suits of 28 functions proposed in the CEC-2013 competitions to verify the performance of SQPBSA. The results indicate the proposed method is effective and competitive.
