The two hands and ten fingers that humans are born with are the most dexterous parts of the body and the intrinsic tools that have created our history. To advance human-computer interaction so that we make use of such...
详细信息
Task scheduling with load balancing in grid computing aims to assign tasks to computing nodes and minimize the execution time of tasks as well as workload across all nodes. Despite of the intractability, the schedulin...
详细信息
Task scheduling with load balancing in grid computing aims to assign tasks to computing nodes and minimize the execution time of tasks as well as workload across all nodes. Despite of the intractability, the scheduling problem is of particular concern to both users and grid systems. In this paper, a multiple ant colonies optimization (MACO) approach is proposed for achieving task scheduling with load balancing. In the MACO approach, multiple ant colonies work together and exchange information to collectively find solutions with a two-fold objective of minimizing the execution time of tasks and the degree of imbalance of computing nodes. Experimental results show that our algorithm outperforms FCFS and ACS approaches.
Threat evaluation of targets, an important part in warship's C 4 ISR, was the judgment of threat levels. A Shepard interpolation model for threat evaluation of the air targets is presented. It can be helpful to es...
详细信息
Threat evaluation of targets, an important part in warship's C 4 ISR, was the judgment of threat levels. A Shepard interpolation model for threat evaluation of the air targets is presented. It can be helpful to estimate the threat levels of air targets in the anti-air combat of single ship. Using standard threat levels based on standard battle-field situations, threat levels can be generated from the interpolation model according to attribute values of the new target. The case study at the end shows the effectiveness and simplicity of the model.
As a recommender in the reputation systems can submit inaccurate recommendations for a variety of reasons, the trustworthiness degree of recommending (TDR) must be critically assessed. In this article, two mechanisms,...
As a recommender in the reputation systems can submit inaccurate recommendations for a variety of reasons, the trustworthiness degree of recommending (TDR) must be critically assessed. In this article, two mechanisms, i.e. the virtual verifying and time decaying, are introduced to help calculating TDR. The former is aimed to solve the accuracy and efficiency problem caused by insufficient evidences of recommending when calculating. The latter focuses on detecting the oscillation of recommender's behaviors, and time-decaying-rate factor and time-decaying-frequency factor are involved to make the recent evidences be more important to the calculating. Experimental results show that our model has better performance and is robust even with large amount of malicious peers.
This paper firstly analyzes the complexity of war system, and proposes eight factors attributed to the complexity of war system from the view of scenario, cognition, core interest zero-sum gaming, interfering strategi...
详细信息
This paper firstly analyzes the complexity of war system, and proposes eight factors attributed to the complexity of war system from the view of scenario, cognition, core interest zero-sum gaming, interfering strategies, in-house corresponding, un-repeatability and etc. On this basis, the paper points out the four most important integration problems of all challenges to methodology, method and technology that the war complex system (WCS) is confronted with in the research of war system, namely tactics and equipment integration, future scenario and interfering strategies integration, heterogeneity group experts wisdom integration, quantitative analysis and qualitative analysis integration. At last, the effective method, war design engineering (WDE), is presented to solve the four integration problems.
The topological properties of peer-to-peer overlay networks are critical factors that dominate the performance of these systems. Several non-constant and constant degree interconnection networks have been used as topo...
详细信息
The topological properties of peer-to-peer overlay networks are critical factors that dominate the performance of these systems. Several non-constant and constant degree interconnection networks have been used as topologies of many peer-to-peer networks. One of these has many desirable properties: the Kautz digraph. Unlike interconnection networks, peer-to-peer networks need a topology with an arbitrary size and degree, but the complete Kautz digraph does not possess these properties. In this paper, we propose Moore: the first effective and practical peer-to-peer network based on the incomplete Kautz digraph with O (log d N ) diameter and constant degree under a dynamic environment. The diameter and average routing path length are [log d ( N ) - log d (1 + 1/ d )] and log d N , respectively, and are shorter than that of CAN, butterfly, and cube-connected-cycle. They are close to that of complete de Bruijn and Kautz digraphs. The message cost of node joining and departing operations are at most 2.5 d log d N and (2.5 d + 1) log d N , and only d and 2 d nodes need to update their routing tables. Moore can achieve optimal diameter, high performance, good connectivity and low congestion evaluated by formal proofs and simulations.
This paper focuses on how to model grid resource and locate grid resource using efficient and scaleable protocol under a grid environment. A mathematic model of grid physical resource space and logical resource space ...
详细信息
暂无评论