This paper is devoted to a generalized particle model (GPM) approach to distributed problem-solving in MAS, which transforms the optimization problem of resource assignments and task allocations of MAS in complex envi...
详细信息
This paper is devoted to a generalized particle model (GPM) approach to distributed problem-solving in MAS, which transforms the optimization problem of resource assignments and task allocations of MAS in complex environment into the kinematics and dynamics in GPM. The complex environment in MAS that the proposed GPM approach may deal with includes: A variety of interactions randomly and concurrently occurring among agents;different personality and autonomy of distinct agents;different life-cycle period, congestion degree and failure rate for distinct entities in MAS. At first, the relation between the GPM and MAS in the context of distributed problem-solving is expatiated. Then the mathematical-physical formalization for GPM and the parallel algorithm GPMA are presented. The basic properties of the GPMA algorithm, including the feasibility, convergency and stability, are discussed. Through a number of simulation experiments and comparisons related to resource assignments and task allocations in MAS in complex environment, the authors demonstrate many advantages of the proposed GPM approach over other coalition methods for MAS problem-solving in terms of the parallelism and the suitability for complex environment.
In 1999, Sun et al. proposed a new (t, n) threshold proxy signature scheme based on Zhang's threshold proxy signature scheme. But in 2003 Hsu et al. pointed out that Sun's scheme suffered from a drawback and d...
详细信息
In 1999, Sun et al. proposed a new (t, n) threshold proxy signature scheme based on Zhang's threshold proxy signature scheme. But in 2003 Hsu et al. pointed out that Sun's scheme suffered from a drawback and demonstrated an improvement to counter it. In this paper we point out that Hsu's scheme suffers from an insider attack against their scheme. That is, a malicious proxy signer can forge a valid threshold proxy signature on any message. To thwart this attack, some improvements are further proposed.
We have proposed an inductive (magnetic shielding) type of superconducting fault current limiter which consists of a high Tc superconducting plate in doughnut shape and spiral coil as the primary winding. In this pape...
H.264 is the latest international video coding standard. It adopts tree-structure macroblock partitions in motion-compensated coding modes to improve coding performance. This technology searches all available modes, s...
详细信息
Microarchitects should consider power consumption, together with accuracy, when designing a branch predictor, especially in embedded processors. This paper proposes a power-aware branch predictor, which is based on th...
详细信息
Microarchitects should consider power consumption, together with accuracy, when designing a branch predictor, especially in embedded processors. This paper proposes a power-aware branch predictor, which is based on the gshare predictor, by accessing the BTB （Branch Target Buffer） selectively. To enable the selective access to the BTB, the PHT （Pattern History Table） in the proposed branch predictor is accessed one cycle earlier than the traditional PHT if the program is executed sequentially without branch instructions. As a side effect, two predictions from the PHT are obtained through one access to the PHT, resulting in more power savings. In the proposed branch predictor, if the previous instruction was not a branch and the prediction from the PHT is untaken, the BTB is not accessed to reduce power consumption. If the previous instruction was a branch, the BTB is always accessed, regardless of the prediction from the PHT, to prevent the additional delay/accuracy decrease. The proposed branch predictor reduces the power consumption with little hardware overhead, not incurring additional delay and never harming prediction accuracy. The simulation results show that the proposed branch predictor reduces the power consumption by 29-47%.
Tianwang for the first time participated in all three tasks of the Terabyte Track of TREC 2005 to explore its performance. All three tasks, including the adhoc task (find all the relevant documents with high precision...
详细信息
Tianwang for the first time participated in all three tasks of the Terabyte Track of TREC 2005 to explore its performance. All three tasks, including the adhoc task (find all the relevant documents with high precision), the efficiency task (find top- 20 results for each of 50k-entry queries with efficiency and scalability) and the named page finding task (sometimes search a page by name), are based on a 426GB collection of 25.2 million pages taken from the .gov Web domain ("GOV2"). In the adhoc task with 50 topics, Tianwang returned at least one relevant document in top 10 for 42 topics. In the efficiency task, Tianwang returned at least one relevant document in top 20 for 44 of the 50 quires. In the named page task with 252 topics, Tianwang returned a desired page in top 10 for 99 topics;meanwhile, it failed to find a correct one for 120 topics.
Grid services provide an important abstract layer on top of heterogeneous components (hardware and software) that take part into a grid environment. We are developing a data grid service prototype that aims at providi...
详细信息
暂无评论