The weapon-target assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. The WTA problem can be formulated as a nonlinear integer programming problem and is k...
详细信息
The weapon-target assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. The WTA problem can be formulated as a nonlinear integer programming problem and is known to be NP-complete. We present firstly a technique founded on the use weapon cell, which enables one-to-many mapping about weapon-target to become one-to-one mapping. Next, we introduce a framework of solving the WTA problem. Based on this framework, an approximation algorithm that is grounded on the rules about weapon cells and targets is proposed. Finally, the simulative results show that the proposed algorithm indeed is very efficient.
This paper proposes an optimistic data consistency method according to the question about data dependence in data consistency. In the method, data object is partitioned into data blocks by fixed size as the basic unit...
详细信息
This paper proposes an optimistic data consistency method according to the question about data dependence in data consistency. In the method, data object is partitioned into data blocks by fixed size as the basic unit of data management. Updates are compressed by Bloom filter technique and propagated in double-path. Negotiation algorithms detect and reconcile update conflicts, and dynamic data management algorithms accommodate dynamic data processing. The results of the performance evaluation show that it is an efficient method to achieve consistency, good dynamic property, and strong robustness when choosing the size of data block appropriately. At the same time, a feasible way is put forward on how to choose appropriate data block size.
The features of simple description, small updates item and weak dependence are the main characteristics of updates of key-attributes in P2P systems. Accordingly, an optimistic data consistency maintenance method based...
详细信息
The features of simple description, small updates item and weak dependence are the main characteristics of updates of key-attributes in P2P systems. Accordingly, an optimistic data consistency maintenance method based on key-attributes is proposed. In the method, the update of key-attributes is separated from user update requests. Key-Updates are propagated by latency-overlay update propagation model, that is, updates are always propagated to the nodes having maximum or minimum latency, and assured and uncertain propagation paths of updates are all taken into account. Based on classifying key-update conflicts, a double-level reconciling mechanism including buffer preprocessing and update-log processing is applied to detect and reconcile conflicts, and then conflicts are solved by policies as last-writer-win and divide-and-rule. Lastly, update-log management method and maintenance method brought by node failure and network partitioning are discussed for the above is deployed based on the information storied in update-log. Delaying key-attributes updates cannot occur by the optimistic disposal method, and then it cannot depress efficiency of resource location based on key-attributes, which adapts well to P2P systems for Internet. The simulation results show that it is an effective optimistic data consistency maintenance method, achieving good consistency overhead, resource location and resource access overhead, and having strong robustness.
Nowadays, weakly hard real-time is attracted in the research of real-time system. Existing weakly hard real-time scheduling algorithms cannot guarantee the meeting ratio of executing sequence of which the length is la...
详细信息
Nowadays, weakly hard real-time is attracted in the research of real-time system. Existing weakly hard real-time scheduling algorithms cannot guarantee the meeting ratio of executing sequence of which the length is larger than fixed window-size. Therefore, this paper, based on the (m, p) constraint, proposes an algorithm which is named as CDBS (cut-down based scheduling). Since the discrimination of the satisfiability of (m, p) constraint needs to go over the whole executing sequence of the task, it's very difficult and infeasible. For this reason, this paper brings an efficient algorithm of cutting down the sequence, proves the correctness of the algorithm. We use proper data structures so that the complexity of judgment is not relevant to the length of sequence. Experiments show the efficiency. Furthermore, we compare CDBS with other classical algorithms, such as EDF, DBP, DWCS, and the results show its competence.
Recent studies on network traffic have shown that self-similar is very popular, and the character will not be changed during buffering, switching and transmitting. The character self-similar must be considered in netw...
详细信息
Recent studies on network traffic have shown that self-similar is very popular, and the character will not be changed during buffering, switching and transmitting. The character self-similar must be considered in network traffic prediction. This paper analyzed and summarized the research results of self-similar network traffic prediction from the fields of self-similar modeling, parameter computing and performance prediction. An equivalent bandwidth algorithm of self-similar traffic prediction based on measurement was put forward. Our analysis has shown that the algorithm can effectively reduce computing and realizing complexities.
ETLs are temporal logics employing w-automata as temporal connectives. This paper presents sound and complete axiom systems for ETLl, ETLf, and ETLr, respectively. Axioms and rules reflecting temporal behaviors of loo...
详细信息
ISBN:
(纸本)9783540752905
ETLs are temporal logics employing w-automata as temporal connectives. This paper presents sound and complete axiom systems for ETLl, ETLf, and ETLr, respectively. Axioms and rules reflecting temporal behaviors of looping, finite and repeating automaton connectives are provided. Moreover, by encoding temporal operators into automaton connectives and instantiating the axioms and rules relating to automaton connectives, one may derive axiom systems for given ETL fragments.
Due to the characteristics of stream applications and the insufficiency of conventional processors when running stream programs, stream processors which support data-level parallelism become the research hotspot. This...
详细信息
Due to the characteristics of stream applications and the insufficiency of conventional processors when running stream programs, stream processors which support data-level parallelism become the research hotspot. This paper presents two means, stream partition (SP) and stream compression (SC), to optimize streams on Imagine. The results of simulation show that SP and SC can make stream applications take full advantage of the parallel clusters, pipelines and three-level memory hierarchy of the Imagine processor, and then reduce the execution time of stream programs.
This paper proposes a network memory-based P2P IO BUffering Service (PIBUS), which buffers blocks for IO-intensive applications in P2P network memory like a 2-level disk cache. PIBUS reduces the IO overhead when local...
详细信息
For target recognition based on biologic vision, an application-specific stream SOC: MASA-MI is described in this paper. MASA-MI consists of several heterogeneous cores, and a stream accelerator core is used to accele...
详细信息
This paper presents a novel methodology, called COPP, to estimate available bandwidth over a given network path. COPP deploys a particular probe scheme, namely chirp of packet pairs, which is composed of several packe...
详细信息
暂无评论