This paper investigates how to maintain an efficient dynamic ordered set of bit strings, which is an important problem in the field of information search and information processing. Generally, a dynamic ordered set is...
详细信息
This paper investigates how to maintain an efficient dynamic ordered set of bit strings, which is an important problem in the field of information search and information processing. Generally, a dynamic ordered set is required to support 5 essential operations including search, insertion, deletion, max-value retrieval and next-larger-value retrieval. Based on previous research fruits, we present an advanced data structure named rich binary tree （RBT）, which follows both the binary-search-tree property and the digital-search-tree property. Also, every key K keeps the most significant difference bit （MSDB） between itself and the next larger value among K＇s ancestors, as well as that between itself and the next smaller one among its ancestors. With the new data structure, we can maintain a dynamic ordered set in O（L） time. Since computers represent objects in binary mode, our method has a big potential in application. In fact, RBT can be viewed as a general-purpose data structure for problems concerning order, such as search, sorting and maintaining a priority queue. For example, when RBT is applied in sorting, we get a linear-time algorithm with regard to the key number and its performance is far better than quick-sort. What is more powerful than quick-sort is that RBT supports constant-time dynamic insertion/deletion.
作者：
Man, JingtaoZeng, ZhigangXiao, Qiang
Key Laboratory of Image Information Processing and Intelligent Control Ministry of Education of China Wuhan China
Spatial deployment of large-scale heterogeneous multi-agent systems (HMASs) over desired 2D or 3D curves is investigated in this paper. With assumption that HMASs consist of numerous first-order agents (FOAs) and seco...
详细信息
A slot-fed dualband rectangular dielectric resonator antenna (DRA) for WLAN applications is investigated. ANSYS HFSS was used to study the reflection coefficient, radiation patterns and antenna gain of the dualband DR...
详细信息
A new efficient algorithm is developed to design DNA words with equal length for DNA computing. The algorithm uses a global heuristic optimizing search approach and converts constraints to a carry number to accelerate...
详细信息
A new efficient algorithm is developed to design DNA words with equal length for DNA computing. The algorithm uses a global heuristic optimizing search approach and converts constraints to a carry number to accelerate the convergence, which can generate a DNA words set satisfying some thermodynamic and combinatorial constraints. Based on the algorithm, a software for DNA words design is developed.
Unsupervised learning methods in computer vision have achieved remarkable success, exceeding the performance of supervised learning methods. It is noteworthy that current unsupervised learning methods share certain si...
详细信息
The thesis studies the semi-global scaled edge-consensus of linear discrete-time multi-agent systems under both the directed networks and undirected networks, where the states of each edge are subject to input saturat...
详细信息
Membrane algorithms （MAs）, which inherit from P systems, constitute a new parallel and distribute framework for approximate computation. In the paper, a membrane algorithm is proposed with the improvement that the i...
详细信息
Membrane algorithms （MAs）, which inherit from P systems, constitute a new parallel and distribute framework for approximate computation. In the paper, a membrane algorithm is proposed with the improvement that the involved parameters can be adaptively chosen. In the algorithm, some membranes can evolve dynamically during the computing process to specify the values of the requested parameters. The new algorithm is tested on a well-known combinatorial optimization problem, the travelling salesman problem. The em-pirical evidence suggests that the proposed approach is efficient and reliable when dealing with 11 benchmark instances, particularly obtaining the best of the known solutions in eight instances. Compared with the genetic algorithm, simulated annealing algorithm, neural net-work and a fine-tuned non-adaptive membrane algorithm, our algorithm performs better than them. In practice, to design the airline network that minimize the total routing cost on the CAB data with twenty-five US cities, we can quickly obtain high quality solutions using our algorithm.
In order to avoid stair casing and preserve small scale texture information for the classical total variation regularization, a new minimization energy functional model for image decomposition is proposed. We firstly ...
详细信息
This paper presents a frame interpolation algorithm using the motion information of some object within the estimated blocks. The proposed algorithm uses two initial frames that are generated based on the backward and ...
详细信息
In this paper we proposed a new method to approximate and reveal the essential piecewise chaos dynamics characteristics of EEG more effectively than the conventional single neural network model. The simulation with th...
详细信息
暂无评论