Little-JIL, a language for programming coordination in processes is an executable, high-level language with a formal (yet graphical) syntax and rigorously defined operational semantics. The central abstraction in Litt...
详细信息
ISBN:
(纸本)9781581132069
Little-JIL, a language for programming coordination in processes is an executable, high-level language with a formal (yet graphical) syntax and rigorously defined operational semantics. The central abstraction in Little-JIL is the “step,” which is the focal point for coordination, providing a scoping mechanism for control, data, and exception flow and for agent and resource assignment. Steps are organized into a static hierarchy, but can have a highly dynamic execution structure including the possibility of recursion and ***-JIL is based on two main hypotheses. The first is that coordination structure is separable from other process language issues. Little-JIL provides rich control structures while relying on separate systems for resource, artifact, and agenda management. The second hypothesis is that processes are executed by agents that know how to perform their tasks but benefit from coordination support. Accordingly, each Little-JIL step has an execution agent (human or automated) that is responsible for performing the work of the *** approach has proven effective in supporting the clear and concise expression of agent coordination for a wide variety of software, workflow, and other processes.
Shared Web caches allow multiple clients to quickly access a pool of popular Web pages. An organization that provides shared caching to its Web clients will typically have a collection of shared caches rather than a s...
详细信息
ISBN:
(纸本)0769507778
Shared Web caches allow multiple clients to quickly access a pool of popular Web pages. An organization that provides shared caching to its Web clients will typically have a collection of shared caches rather than a single cache. If a collection of shared caches is used, it is required to coordinate the caches so that all cached pages in the collection are shared among the clients of the organization. In this paper, two protocol schemes for coordinating the collection of shared caches are investigated. The first scheme is based on the Internet caching protocol (ICP). In the ICP scheme, the Web caches query other caches for the Web pages and fetch the Web pages from the neighbors if they have cached the requested page. The second scheme is the hash routing scheme in which the client (browser) has to find the hash value for the URL of the requested page and send the request to the corresponding cache server. These two schemes have been implemented, and compared with respect to the page retrieval latency and the adaptability of the cache servers when a peer cache server fails. Our analysis shows that the hash routing schemes have significant performance advantages over ICP with respect to the average latency under normal conditions but when failure rate of the cache server is significant the ICP provides good adaptability. Also, we observe that the hashing function used in the hash routing scheme must have certain features such as quick calculation of the hash value and uniform distribution of the Web pages (among cache servers).
Many interesting research challenges await the paradigm shift in the relationship between humans and computers. This article highlights those challenges from two distinct perspectives: human-centered;and technology-ce...
详细信息
Many interesting research challenges await the paradigm shift in the relationship between humans and computers. This article highlights those challenges from two distinct perspectives: human-centered;and technology-centered. It also discusses findings from breakout discussions representing these two perspectives.
The study of approximately periodic strings is relevant to diverse applications such as molecular biology, data compression, and computer-assisted music analysis. Here we study di_erent forms of approximate periodicit...
详细信息
The realization of new distributed and heterogeneous software applications is a challenge that software engineers have to face. Logic programming and multi-agent systems can play a very effective role in the rapid pro...
详细信息
This paper describes the results of the working group investigating the issues of empirical studies for evolving systems. The groups found that there were many issues that were central to successful evolution and this...
详细信息
This paper describes the results of the working group investigating the issues of empirical studies for evolving systems. The groups found that there were many issues that were central to successful evolution and this concluded that this is a very important area within softwareengineering. Finally nine main areas were selected for consideration. For each of these areas the central issues were identified as well as success factors. In some cases success stories were also described and the critical factors accounting for the success analyzed. In some cases it was later found that a number of areas were so tightly coupled that it was important to discuss them together.
This paper examines task partition problem in a Multiagent based Distributed Open Computing Environment Model(MDOCEM). We first present a formal method to describe the task partition problem, then give a heuristic al...
详细信息
This paper examines task partition problem in a Multiagent based Distributed Open Computing Environment Model(MDOCEM). We first present a formal method to describe the task partition problem, then give a heuristic algorithm to solve the task partition problem that gives an approximate optimum solution.
Design of an adaptive built-in-self-test (BIST) scheme for detecting multiple stuck-open faults in a CMOS complex cell is proposed. The test pattern generator (TPG) adaptively generates a subset of single-input-change...
详细信息
Design of an adaptive built-in-self-test (BIST) scheme for detecting multiple stuck-open faults in a CMOS complex cell is proposed. The test pattern generator (TPG) adaptively generates a subset of single-input-change (SIC) test pairs based on the past responses of the circuit under test (CUT). The design is universal, i.e., independent of the structure and functionality of the CUT. The average length of the test sequence (TS) in an n-input CUT is (n+1).2/sup n/ [(n+1).2/sup n-1/] in a fault-free [faulty] condition. The response analyzer (RA) is also simple to design. All robustly testable multiple stuck-open faults (occurring simultaneously both in n- and p-parts) can be detected using the proposed BIST scheme.
There has been lots of research to improve the precision of IR system. These research have been studied on the document ranking, user profiles, relevance feedback and the information processing that includes document ...
详细信息
There has been lots of research to improve the precision of IR system. These research have been studied on the document ranking, user profiles, relevance feedback and the information processing that includes document classification, clustering, routing and filtering. This paper proposes and incarnates method of neural approach about the information processing which makes users can search documents effectively and of the document clustering. In this paper the system calculates entropy between the query, the profile and the each of the web documents each other; and clusters documents using the calculated entropy as the value of the clustering variable through SOM. As the Bayesian Neural Network model has high classification accuracy with a rapid learning speed and clustering, it is possible that dynamic document clustering as it was combined with Bayesian probability model used in real-time document classification. We used KTSET which is a test collection to evaluate Korean IR system for the experiment.
暂无评论