基于扇形领域扩展的同步双向A*算法

为提高航空器飞行的安全性和平滑性,解决传统A^*算法拐弯角度过大、搜索路径节点过多等问题,提出一种基于扇形领域扩展的同步双向A^*搜索算法。首先,根据栅格图法扩展危险区域边界;其次,设计了基于同步双向搜索的A^*算法,动态定义正反向搜索的目标节点。针对搜索角度有限问题,提出了在5×5领域内的扇形领域扩展策略,并设计了含有双重权重参数的评价函数以减少冗余点的产生。为验证改进算法的有效性,选取方形和不规则形状危险区进行仿真。结果表明改进的同步双向搜索算法搜索的路径更平滑;与传统双向A^*算法的结果相比,在不同形状的危险区域下,搜索路径长度分别减少了1.65%、13.16%,搜索路径节点个数减少了42.6%、46.81%,具有较强的搜索效率。     

基于改进麻雀搜索算法的服务功能链优化映射算法

为了实现5G网络场景下服务功能链的低成本高效率部署,提出了一种基于改进麻雀搜索算法的服务功能链优化映射算法。在服务功能链映射过程中,采用双层编码方式,将服务请求的组链方案和映射方案进行混合编码,然后使用改进离散麻雀搜索算法进行求解,得到该请求的服务功能链部署方案,并计算其映射权重。当同一时间片内存在多个请求类型时,按照映射权重对所有服务功能链进行排序,优先映射权重高的请求,以此减少延迟开销,提高节点计算资源利用率和链路资源利用率。仿真结果表明,该算法可以有效减少部署开销,提高资源利用率。     

Probabilistic heuristic estimates

Though they constitute the major knowledge source in problem-solving systems, no unified theory of heuristics has emerged. Pearl [15] defines heuristics as criteria, methods, or principles for deciding which among several alternative courses of action promises to be the most effective in order to achieve some goal. The absence of a more precise definition has impeded our efforts to understand, utilize, and discover heuristics. Another consequence is that problem-solving techniques which rely on heuristic knowledge cannot be relied upon to act rationally — in the sense of the normative theory of rationality.To provide a sound basis for BPS, the Bayesian Problem-Solver, we have developed a simple formal theory of heuristics, which is general enough to subsume traditional heuristic functions as well as other forms of problem-solving knowledge, and to straddle disparate problem domains. Probabilistic heuristic estimates represent a probabilistic association of sensations with prior experience — specifically, a mapping from observations directly to subjective probabilities which enables the use of theoretically principled mechanisms for coherent inference and decision making during problem-solving. This paper discusses some of the implications of this theory, and describes its successful application in BPS.This research was made possible by support from Heuristicrats, the National Aeronautics and Space Administration, and the Rand Corporation.     

Visual recognition efficiency of handheld infrared thermometer interface information under low ambient illuminance

One of the symptoms of plagues, epidemics or pandemics is often a fever, so during such unprecedented times, handheld infrared thermometers are vital devices for monitoring symptomatic individuals. It is therefore very important to enhance reading efficiency when these thermometers are used for lengthy periods of time in a low illuminance environment. The need for the efficient reading of infrared thermometers or a fast reaction time when reading the information is even more relevant now during the COVID-19 pandemic. In this study, a target search experiment of digital characters is carried out through a simulated interface and use scenarios of a handheld thermometer based on three variables: the inclination angle or slant of the seven segment display characters, screen brightness, and ambient illuminance. The experimental results show that the inclination angle or slant of the characters and ambient illuminance have a significant effect on the reaction speed. In general, the slowest reaction time is found when reading characters with a slant of 10° to the left and the reaction time is the fastest with a right slant of 20°. A continued reduction in ambient illuminance does not affect the visual recognition performance but instead further enhances reading efficiency. Increasing the screen brightness increases the reaction time more in relatively low ambient illuminance conditions as opposed to relatively high ambient illuminance, which implies that in higher ambient illuminance conditions, a brighter screen needs to be used to obtain the same reaction speed as that in lower ambient illuminance conditions.     

Selection of optimized features for fusion of palm print and finger knuckle‐based person authentication

The impact of digital technology in biometrics is much more efficient at interpreting data than humans, which results in completely replacement of manual identification procedures in forensic science. Because the single modality‐based biometric frameworks limit performance in terms of accuracy and anti‐spoofing capabilities due to the presence of low quality data, therefore, information fusion of more than one biometric characteristic in pursuit of high recognition results can be beneficial. In this article, we present a multimodal biometric system based on information fusion of palm print and finger knuckle traits, which are least associated to any criminal investigation as evidence yet. The proposed multimodal biometric system might be useful to identify the suspects in case of physical beating or kidnapping and establish supportive scientific evidences, when no fingerprint or face information is present in photographs. The first step in our work is data preprocessing, in which region of interest of palm and finger knuckle images have been extracted. To minimize nonuniform illumination effects, we first normalize the detected circular palm or finger knuckle and then apply line ordinal pattern (LOP)‐based encoding scheme for texture enrichment. The nondecimated quaternion wavelet provides denser feature representation at multiple scales and orientations when extracted over proposed LOP encoding and increases the discrimination power of line and ridge features. To best of our knowledge, this first attempt is a combination of backtracking search algorithm and 2D²LDA has been employed to select the dominant palm and knuckle features for classification. The classifiers output for two modalities are combined at unsupervised rank level fusion rule through Borda count method, which shows an increase in performance in terms of recognition and verification, that is, 100% (correct recognition rate), 0.26% (equal error rate), 3.52 (discriminative index), and 1,262 m (speed).     

一种改进的基于在线解耦的轻量级动态污点分析方法

在针对二进制程序的实际分析场景中,动态分析方法因具有更高的准确性而得到更为广泛的关注和运用.但是以动态污点分析为代表的细粒度分析方法通常会产生较高的性能和资源开销.为缓解这些问题,本文提出一种改进的轻量级在线解耦的动态污点分析方法,其主要思想是在线解耦程序执行和指令分析,同步构建分析代码并完成分析.该方法能够进一步降低对目标程序运行时的性能影响,并易将分析过程迁移至其它上下文环境中,从而可进一步减小对目标程序运行环境的干扰.本文通过采用多种实际程序进行实验,结果表明该方法能够比传统在线污点分析具有更高的分析性能,并具有较低的系统资源消耗,易于在实际环境中进行部署和应用.     

井下人员定位系统读卡器存储算法分析与测试

从查找时间与存储容量2个方面分析了适用于井下人员定位系统读卡器的3种存储算法,即链式存储算法、哈希表存储算法和哈希二叉树存储算法,给出了该3种不同存储算法的使用效率与应用场合。测试结果表明,链式存储算法查找时间呈线性增长,哈希表存储算法明显优越于链式存储算法,如果测试数据增多,其优越性会更明显;当数据量较大时,哈希搜索二叉树存储算法又明显优于哈希表存储算法,当人数达到行业所要求的8 000人以上时,选择哈希搜索二叉树存储算法更为合理。     

An efficient IP address lookup algorithm based on a small balanced tree using entry reduction

Due to a tremendous increase in internet traffic, backbone routers must have the capability to forward massive incoming packets at several gigabits per second. IP address lookup is one of the most challenging tasks for high-speed packet forwarding. Some high-end routers have been implemented with hardware parallelism using ternary content addressable memory (TCAM). However, TCAM is much more expensive in terms of circuit complexity as well as power consumption. Therefore, efficient algorithmic solutions are essentially required to be implemented using network processors as low cost solutions.Among the state-of-the-art algorithms for IP address lookup, a binary search based on a balanced tree is effective in providing a low-cost solution. In order to construct a balanced search tree, the prefixes with the nesting relationship should be converted into completely disjointed prefixes. A leaf-pushing technique is very useful to eliminate the nesting relationship among prefixes [V. Srinivasan, G. Varghese, Fast address lookups using controlled prefix expansion, ACM Transactions on Computer Systems 17 (1) (1999) 1-40]. However, it creates duplicate prefixes, thus expanding the search tree.This paper proposes an efficient IP address lookup algorithm based on a small balanced tree using entry reduction. The leaf-pushing technique is used for creating the completely disjointed entries. In the leaf-pushed prefixes, there are numerous pairs of adjacent prefixes with similarities in prefix strings and output ports. The number of entries can be significantly reduced by the use of a new entry reduction method which merges pairs with these similar prefixes. After sorting the reduced disjointed entries, a small balanced tree is constructed with a very small node size. Based on this small balanced tree, a native binary search can be effectively used in address lookup issue. In addition, we propose a new multi-way search algorithm to improve a binary search for IPv4 address lookup. As a result, the proposed algorithms offer excellent lookup performance along with reduced memory requirements. Besides, these provide good scalability for large amounts of routing data and for the address migration toward IPv6. Using both various IPv4 and IPv6 routing data, the performance evaluation results demonstrate that the proposed algorithms have better performance in terms of lookup speed, memory requirement and scalability for the growth of entries and IPv6, as compared with other algorithms based on a binary search.     

A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests

Combinatorial optimization problems are usually modeled in a static fashion. In this kind of problems, all data are known in advance, i.e. before the optimization process has started. However, in practice, many problems are dynamic, and change while the optimization is in progress. For example, in the dynamic vehicle routing problem (DVRP), new orders arrive when the working day plan is in progress. In this case, routes must be reconfigured dynamically while executing the current simulation. The DVRP is an extension of a conventional routing problem, its main interest being the connection to many real word applications (repair services, courier mail services, dial-a-ride services, etc.). In this article, a DVRP is examined, and solving methods based on particle swarm optimization and variable neighborhood search paradigms are proposed. The performance of both approaches is evaluated using a new set of benchmarks that we introduce here as well as existing benchmarks in the literature. Finally, we measure the behavior of both methods in terms of dynamic adaptation.