Despite the recent advances in access control approaches applicable to grid computing, there remain issues that impede the development of effective access control for grid applications. Amongst them are the lack of co...
详细信息
ISBN:
(纸本)0769524052
Despite the recent advances in access control approaches applicable to grid computing, there remain issues that impede the development of effective access control for grid applications. Amongst them are the lack of context-based models for access control, and reliance on identity or capability-based access control schemes. In this paper, we propose RCBAC model which extends the RBAC with context constraints. The RCBAC mechanisms dynamically grant and adapt permissions to users based on a set of contextual information collected from the grid environments, while retaining the advantages of RBAC model.
We consider task assignment problem in distributed systems. Tasks are chosen by independent processing units (IPUs) which have only the knowledge of: 1, their own situations;and 2, the system's simple feedbacks. W...
详细信息
ISBN:
(纸本)0780378407
We consider task assignment problem in distributed systems. Tasks are chosen by independent processing units (IPUs) which have only the knowledge of: 1, their own situations;and 2, the system's simple feedbacks. We propose a dynamic algorithm with which IPUs can adjust their tasks in an adaptive fashion and in turn help the system getting optimal. This algorithm overcomes an important limitation of previous works, that is, the max reward probability r*≥0.5, and can get much better performance. Algorithm correctness is analyzed by Markov chains. Experiments and comparisons are presented. Reward/penalty dependency, an issue has not been addressed in previous works, is also analyzed. Moreover, this algorithm can also be used to solve the general assignment problem.
Locomotive-track coupling dynamical simulation has made good achievements. However, a problem, how to improve the simulating speed when visualization and dynamical computation are considered at the same time, is still...
详细信息
Locomotive-track coupling dynamical simulation has made good achievements. However, a problem, how to improve the simulating speed when visualization and dynamical computation are considered at the same time, is still not overcome. Here, based on existing success, we present a distributed COM technology, which is used to change the status of the present slow speed simulation. In this paper, at first, the locomotive-track dynamics system is modeled, a resolving formula is discussed, and visualization of the system is given, then the characteristic of the main integration resolving algorithm is analyzed, which is the reason of actuating the DCOM method. Secondly, we divide these resolving equations into several separated module, which is distributed in different resolving machine as a COM, and construct a distributedparallelcomputing environment, this method effectively reduces the computing load of the main computer and the computing speed is improved, which is the basement of real-time simulation such as virtual dynamical test of locomotive.
Genetic Algorithm has emerged as a successful tool for optimization problems. Earlier, we proposed a task allocation model to maximize the reliability of distributedcomputing System(DCS) using genetic algorithm. Our ...
详细信息
Genetic Algorithm has emerged as a successful tool for optimization problems. Earlier, we proposed a task allocation model to maximize the reliability of distributedcomputing System(DCS) using genetic algorithm. Our objective, in this work, is to use the same simple genetic algorithm to minimize the turnaround time of the task given to the DCS for execution and then to compare the resultant allocation with the allocation of maximal reliablity as obtained in [2]. Comparisons of both the algorithms are made by illustrated examples and appropriate comments.
In a genetic algorithm (GA), the undesirable phenomenon of excess convergence can often occur. Excess convergence is the phenomenon where the diversity of a group is lost. This phenomenon occurs because homogeneous in...
详细信息
ISBN:
(纸本)0780378407
In a genetic algorithm (GA), the undesirable phenomenon of excess convergence can often occur. Excess convergence is the phenomenon where the diversity of a group is lost. This phenomenon occurs because homogeneous individuals are increased rapidly in the group while evolving or searching. Therefore, crossover loses its function. Once the excess convergence occurs, the search by the GA becomes meaningless. Therefore, it is important to avoid excess convergence and maintain diversity. First, we show an implementation of a parallel GA based on a multiple-group-type island model, that uses object-shared space. Next, as a simple, effective method for avoiding excess convergence, we propose a diversity maintenance technique based on selection of the homogeneous individuals called the Noah's ark strategy for parallel GAs, and demonstrate its effectiveness on a knapsack problem. Our proposed method is to replace individuals in sub-groups that have excessively converged with the new individuals coming from the search space. That is, we avoid excess convergence by expelling homogeneous individuals, with the exception of one "elite" individual (that we call for Noah). Thus, we limit a decrease in diversity of an entire group.
To support the advanced concept technology demonstration of intelligence reconnaissance system application on future information battlefield, multi-agent-oriented modeling and simulation technology is applied to set z...
详细信息
ISBN:
(纸本)0769524052
To support the advanced concept technology demonstration of intelligence reconnaissance system application on future information battlefield, multi-agent-oriented modeling and simulation technology is applied to set zip the mappings ftom intelligence reconnaissance system's members to respective agents, by which the distributed multi-agent system is designed The established distributed multi-agent system model of intelligence reconnaissance can afford advantage for realizing the simulation of the external, dynamic, complicated and intelligent process.
A novel model and architecture of network management-Dynamically Constructed Network Management (DCNM) based on the active network technology is proposed in this paper. The network services and applications are treate...
详细信息
ISBN:
(纸本)0780378407
A novel model and architecture of network management-Dynamically Constructed Network Management (DCNM) based on the active network technology is proposed in this paper. The network services and applications are treated as "soft equipment" managed by the NMS thus all the resources in the network can be managed under this model. As the function of managed objects, i.e., network services and applications etc., management functions will be dynamically constructed along with the development and deployment of variety of services and applications in the network. This makes management itself an adaptive component of the network. The architecture of dynamically constructed network management is composed of the management center, the middle management node, the data collection node, and the management client. A DCNM prototype has been developed based on our research experiences. We use this architecture on management of Web services. It makes management itself a Web service.
Skeletal parallelism offers a good trade-off between programming productivity and execution efficiency. In this style of parallelism, an application is a composition of algorithmic skeletons. An algorithmic skeleton c...
详细信息
This paper discusses a parallel immune algorithm (IA) for detection of lung cancer in chest X-ray images based on object shared space. The template matching method is combined to the algorithm and JavaSpaces is used a...
详细信息
Using the multilevel concatenation, long block codes can be constructed from shorter component codes, resulting in much less decoding complexity. The component codes can also be constructed from multilevel concatenati...
详细信息
暂无评论