Due to the preeminent work of the real-time specification for Java(RTSJ), Java is increasingly expected to become the leading programming language in real-time systems. To provide a Java platform suitable for real-tim...
详细信息
ISBN:
(纸本)1595934804;9781595934802
Due to the preeminent work of the real-time specification for Java(RTSJ), Java is increasingly expected to become the leading programming language in real-time systems. To provide a Java platform suitable for real-time applications, a real-time Java processor can execute Java bytecode directly is proposed in this paper. This processor provides efficient support in hardware for mechanisms specified in the RTSJ and offers a simpler programming model through ameliorating the scoped memory of the RTSJ. The most important characteristic of the processor is that its WCET(worst case execution time) of the bytecode execution is predictable. It is vital for the real-time systems. Copyright 2007 acm.
The Pfaffian of an oriented graph is closely linked to perfect matching. It is also naturally related to the determinant of an appropriately defined matrix. This relation between Pfaffian and determinant is usually ex...
详细信息
The Pfaffian of an oriented graph is closely linked to perfect matching. It is also naturally related to the determinant of an appropriately defined matrix. This relation between Pfaffian and determinant is usually exploited to give a fast algorithm for computing Pfaffians. We present the first NC algorithm for computing the Pfaffian. (Previous determinant-based methods computed it in NC only up to the correct sign, while previous polynomial-time algorithms did not lend themselves to parallelization.) Our algorithm is completely combinatorial in nature. Furthermore, it is division-free and works over arbitrary commutative rings. Over integers, we show that it can be implemented in the complexity class GapL. This upper bound was not known before, and establishes that computing the Pfaffian for integer skew-symmetric matrices is complete for GapL. Our proof techniques generalize the recent combinatorial characterization of determinant proceedings of the Eighth Annual acm-SIAM symposium o Discrete Algorithms, SODA, 1997, 730. As a corollary, we show that under reasonable encodings of a planar graph, Kasteleyn's algorithm [Graph Theory and Theoretical Physics, Academic Press, New York, 1967, 43] for counting the number of perfect matchings in a planar graph is also in GapL. (C) 2003 Elsevier B.V. All rights reserved.
AS we close out the first full decade of the acm Special Interest Group on appliedcomputing, the acmsymposium on appliedcomputing, and the acm SIGAPP newsletter, appliedcomputing Review, it may be useful to review...
详细信息
This paper discusses the use of an individual computing environment (PC, workstation, etc.) to design and analyze fractals. An algorithm that facilitates the analysis and design of many fractals is given as an example.
ISBN:
(纸本)9780897916585
This paper discusses the use of an individual computing environment (PC, workstation, etc.) to design and analyze fractals. An algorithm that facilitates the analysis and design of many fractals is given as an example.
Fog computing is gaining popularity as a new distributed computing paradigm. Several simulators have been proposed for the evaluation of new approaches for fog computing. This paper compares four simulators for fog co...
详细信息
ISBN:
(纸本)9781450368667
Fog computing is gaining popularity as a new distributed computing paradigm. Several simulators have been proposed for the evaluation of new approaches for fog computing. This paper compares four simulators for fog computing: iFogSim, MyiFogSim, EdgeCloudSim, and YAFS. The comparison is based on both publicly available information about the simulators, and on our experience with their practical use. The results show strengths and weaknesses of the simulators, and also some potentially anomalous behaviors.
Biological literature databases continue to grow rapidly with vital information that is important for conducting sound biomedical research. As data and information space continue to grow exponentially, the need for ra...
详细信息
Biological literature databases continue to grow rapidly with vital information that is important for conducting sound biomedical research. As data and information space continue to grow exponentially, the need for rapidly surveying the published literature, synthesizing, and discovering the embedded "knowledge" is becoming critical to allow the researchers to conduct "informed" work, avoid repetition, and generate new hypotheses. Knowledge, in this case, is defined as one-to-many and many-to-many relationships among biological entities such as gene, protein, drug, disease, etc. The knowledge discovery process basically involves identification of biological object names, reference resolution, ontology and synonym discovery, and finally extracting object-object relationships. The overall goal of this work is to investigate and develop a complete knowledge base, called BioMap, using the entire MEDLINE collection of (over 12 million) bibliographic citations and author abstracts from over 4600 biomedical journals worldwide and to develop an interactive knowledge network for users to access this secondary knowledge (BioMap) along with its primary databases such as the MEDLINE. In this paper we present the organization of a distributed database system to maintain the knowledge base of BioMap and some preliminary results on biological object name identification problem based on an initial set of 30,000 MEDLINE abstracts.
Information systems based on the World Wide Web increased the impact of concurrent programs. Such increase demands the definition of methods for obtaining safe and efficient implementations of concurrent programs, sin...
详细信息
ISBN:
(纸本)1595934804;9781595934802
Information systems based on the World Wide Web increased the impact of concurrent programs. Such increase demands the definition of methods for obtaining safe and efficient implementations of concurrent programs, since the complexity of implementation and tests in concurrent environments is bigger than in sequential environments. This work defined guidelines to restructure object-oriented software in order to modularize concurrency control using aspect-oriented programming. Those guidelines are supported by a concurrency control implementation that guarantees system correctness without redundant concurrency control, both increasing performance and guaranteeing safety. We define abstract aspects that constitute a simple aspect framework that can be reused to implement concurrency control in other applications. The achieved modularization makes the concurrency control easy to evolve and decreases the complexity of other parts of the software, such as business and data management modules, by decoupling concurrency control code from them. Copyright 2007 acm.
Summarizing a set of streaming time series is an important issue that reliably allows information to be monitored and stored in domains such as finance [12], networks [2, 1], etc. To date, most of existing algorithms ...
详细信息
暂无评论