We study the asymptotic throughput for random extended networks , where n ad hoc nodes are randomly deployed in a square region R ( n ) = 0 , n 2 . We directly consider the multicast throughput to unify the unicast an...
We study the asymptotic throughput for random extended networks , where n ad hoc nodes are randomly deployed in a square region R ( n ) = 0 , n 2 . We directly consider the multicast throughput to unify the unicast and broadcast throughput, and design a new multicast scheme under the generalized physical model based on the so-called secondary highways system . Taking account of all possible cases of n s = ω (1) and 1 ⩽ n d ⩽ n − 1, we derive the achievable multicast throughput, where n s and n d denote the number of sessions and the number of destinations of each session. We prove that for some cases in terms of n s and n d , our scheme achieves better throughput than the existing schemes.
Grid is a promising infrastructure which enables scientists and engineers to access geographically distributed resources. Grid computing is a new technology which focuses on aggregating various kinds of resource (e.g....
详细信息
ISBN:
(纸本)9781424476169
Grid is a promising infrastructure which enables scientists and engineers to access geographically distributed resources. Grid computing is a new technology which focuses on aggregating various kinds of resource (e.g., processor cycles, disk storage, and contents) into one computing platform. The realization of grid computing requires a resource agent to manage and monitor available resources. Based on study of past models, this paper presents a new agent-based resource monitoring model whose main feature is multi-layered monitoring architecture, which enhances the ability to monitor related resource efficiently. In the meantime, the new model has been implemented in the development of a resource monitoring module integrated within a academic grid project.
Interaction testing has addressed some issues on how to select a small subset of test cases. In many systems where interaction testing is needed, the entire test suite is not executed because of time or budget constra...
详细信息
ISBN:
(纸本)9781424463886;9780769539874
Interaction testing has addressed some issues on how to select a small subset of test cases. In many systems where interaction testing is needed, the entire test suite is not executed because of time or budget constraints. It is important to prioritize the test cases in these situations. On the other hand, there are not always interactions among any factors in real systems. Moreover, some factors may need N-way (N>2) testing since there is a closer relationship among them. We present a model for prioritized interaction testing with interaction relationship and propose a greedy algorithm for generating variable strength covering arrays with bias.
Knowledge reduction, one of essential issues for data mining, has alwaysbeen a, hot topic due to the explosive growth of inform,a,tion. However, whenhandling large-scale data, m,any current knowledge reduction m,ethod...
详细信息
Decision rules mining is an important issue in machine learning and data ***,most proposed algorithms mine categorical data at single level,and these rules are not easily understandable and really useful for ***,a new...
详细信息
Decision rules mining is an important issue in machine learning and data ***,most proposed algorithms mine categorical data at single level,and these rules are not easily understandable and really useful for ***,a new approach to hierarchical decision rules mining is provided in this paper,in which similarity direction measure is introduced to deal with hybrid *** approach can mine hierarchical decision rules by adjusting similarity measure parameters and the level of concept hierarchy trees.
Thread migration is an effective technique for fault resilience and load balancing in high performance computing. However, flexible thread migration is not easy to achieve. In this paper, we present an approach to cre...
详细信息
Thread migration is an effective technique for fault resilience and load balancing in high performance computing. However, flexible thread migration is not easy to achieve. In this paper, we present an approach to creating migratory threads dynamically at application level. The targets must be executable source files. Compared to the static ones, the number of threads created during migration with the new scheme is independent from the context. Various thread cases are considered for migration. Thread state is handled at application level. Variables are saved in structures in C language for speedy state construction. In order to solve the inability of traditional methods in tracking the created threads, a tree of active function calls is used to record the callback. The preprocessor of the proposed one is written in YACC for accuracy and programmability. The migration enabling process is transparent to programmers with the help of the preprocess. The experimental results have demonstrated the effectiveness of this approach.
Partial order reduction techniques have been used to combat the state explosion problem in model checking procedures for concurrent systems with probabilistic behaviors. There are some results that give criteria on ap...
详细信息
ISBN:
(纸本)9781424465972;9780769540115
Partial order reduction techniques have been used to combat the state explosion problem in model checking procedures for concurrent systems with probabilistic behaviors. There are some results that give criteria on applying partial order reduction for verifying quantitative time properties and reward-based properties on actions. However, there are many situations that reward-based properties are expressed on states rather than on actions because actions are triggered in no time and the quantities can not be obtained easily. This paper presents reduction criteria for a probabilistic temporal logic that allows specification of restrictions on quantitative measures given by spatial resources function for the states of the considered system and provides the proof of the correctness.
This paper proposes a generalized model by extending Markov chain with spatial resources labels, which can describe the functional and performance properties and some basic characteristics such as nondeterminacy and r...
详细信息
This paper proposes a generalized model by extending Markov chain with spatial resources labels, which can describe the functional and performance properties and some basic characteristics such as nondeterminacy and randomicity. The syntax and semantics of the new model are shown based on the existing temporal logics such as CSRL and pathCSRL. The model checking procedure is discussed and thus the practicability of the new model is intuitive. Based on the existing models, the proposed model includes spatial resources labels only by adding the spatial information to the existing labels of states, so the treatment of the state explosion problem is similar to that in the existing models.
Particle swarm optimizer (PSO) is a stochastic global optimization technique based on a social interaction metaphor. Because of the complexity, dynamics and randomness involved in PSO, it is hard to theoretically anal...
详细信息
A new geometric computing theory was proposed. On the definition level of geometric elements, using the Cartesian coordinates ideology as reference, 2D and 3D ″geometric algebra elements″ (or ″geometric elements″ ...
详细信息
A new geometric computing theory was proposed. On the definition level of geometric elements, using the Cartesian coordinates ideology as reference, 2D and 3D ″geometric algebra elements″ (or ″geometric elements″ for short, which could construct an upper-level element in the solving sequence) were constructed by geometry algebraization methods. On the processing level of geometries, geometric problems were solved with geometry methods, by which a geometric element solving sequence could be constructed. Directional property was introduced into geometries in this theory and geometries were represented in a unified format. They help to simplify the processing of finding the geometric element solving sequence for a geometry problem. The paper also tried to theoretically find out an integrated solution for geometry ambiguity issues, and established a unified, standardized geometry computing architecture. The Leibniz's mind-to process geometric objects with geometric language-was implemented in an indirect way!
暂无评论