We present our on-going work to develop techniques for specifying source code signatures of bug patterns. Specifically, we discuss two approaches. The first approach directly analyzes a program in the intermediate rep...
详细信息
ISBN:
(纸本)159593748X
We present our on-going work to develop techniques for specifying source code signatures of bug patterns. Specifically, we discuss two approaches. The first approach directly analyzes a program in the intermediate representation (IR) of the ROSE compiler infrastructure using ROSE's API. The second analyzes the program using the bddbddb system of Lam, Whaley, et al.. In this approach, we store the IR produced by ROSE as a relational database, express patterns as declarative inference rules on relations in the language Datalog, and bddbddb implements the Datalog programs using binary decision diagram (BDD) techniques. Both approaches readily apply to large-scale applications, since ROSE provides full type analysis, control flow, and other available analysis information. In this paper, we primarily consider bug patterns expressed with respect to the structure of the source code or the control flow, or both. More complex techniques to specify patterns that are functions of data flow properties may be addressed by either of the above approaches, but are not directly treated here. Our Datalog-based work includes explicit support for expressing patterns on the use of the Message Passing Interface (MPI) in parallel distributed memory programs. We show examples of this on-going work as well. Copyright 2007 ACM.
During the past few years museums and other cultural heritage institutions have started making use of handheld technologies to provide tourist guides to their visitors. For open-air sites, a number of experimental and...
详细信息
This paper proposes a self-organizing, cluster based protocol - multi-path, multi-hop hierarchical routing (MuMHR) - for use in large scale, distributed wireless sensor networks (WSN). With MuMHR, robustness is achiev...
详细信息
This paper proposes a self-organizing, cluster based protocol - multi-path, multi-hop hierarchical routing (MuMHR) - for use in large scale, distributed wireless sensor networks (WSN). With MuMHR, robustness is achieved by each node learning multiple paths and election of cluster-head backup node(s). Energy expenditure is reduced by shortening the distance between the node and its cluster-head and by reducing the setup communication overhead. This is done through incorporating the number-of-hops metric in addition to the back-off waiting time. Simulation results show that MuMHR performs better than LEACH, which is the most promising hierarchical routing algorithm to date; MuMHR reduces the total number of set-up messages by up to 65% and enhances the data delivery ratio by up to 0.83.
Context: Secondary studies, such as systematic literature reviews and mapping studies, are an essential element of the evidence-based paradigm. A critical part of the review process is the identification of all releva...
详细信息
Student retention in computerscience is becoming a serious concern among Educators in many colleges and universities. Most institutions currently face a significant drop in enrollment in computerscience. A number of...
详细信息
N-Gram (n-character sequences in text documents) counting is a well-established technique used in classifying the language of text in a document. In this paper, n-gram processing is accelerated through the use of reco...
详细信息
ISBN:
(纸本)9781595938947
N-Gram (n-character sequences in text documents) counting is a well-established technique used in classifying the language of text in a document. In this paper, n-gram processing is accelerated through the use of reconfigurable hardware on the XtremeData XD1000 system. Our design employs parallelism at multiple levels, with parallel Bloom Filters accessing on-chip RAM, parallel language classifiers, and parallel document processing. In contrast to another hardware implementation (HAIL algorithm) that uses offchip SRAM for lookup, our highly scalable implementation uses only on-chip memory blocks. Our implementation of end-to-end language classification runs at 85 X comparable software and 1.45x the competing hardware design. Copyright. 2007 ACM.
In this paper, we propose an Interactive hidden Markov model (IHMM). In a traditional HMM, the observable states are affected directly by the hidden states, but not vice versa. In the proposed IHMM, the transitions of...
详细信息
In this paper, we propose an Interactive hidden Markov model (IHMM). In a traditional HMM, the observable states are affected directly by the hidden states, but not vice versa. In the proposed IHMM, the transitions of hidden states depend on the observable states. We also develop an efficient estimation method for the model parameters. Numerical examples on the sales demand data and economic data are given to demonstrate the applicability of the model.
Secondary studies, such as systematic literature reviews and mapping studies, are an essential element of the evidence-based paradigm. A critical part of the review process is the identification of all relevant resear...
详细信息
Secondary studies, such as systematic literature reviews and mapping studies, are an essential element of the evidence-based paradigm. A critical part of the review process is the identification of all relevant research. As such, any researcher intending to conduct a secondary review should be aware of the strengths and weakness of the search engines available. Analyse the overlap between search engine results for software engineering studies. Three independent studies were conducted to evaluate the overlap between multiple search engines for different search areas. The findings indicate that very little overlap was found between the search engines. To complete a systematic review, researchers must use multiple search terms and search engines. The lack of overlap might also be caused by inconsistent keyword selection amongst authors.
Component frameworks simplify development of enterprise systems and enable code reuse, but most frameworks are unpredictable and hence unsuitable for embedded or real-time systems. Similarly, Java is increasingly bein...
详细信息
ISBN:
(纸本)9783540767770
Component frameworks simplify development of enterprise systems and enable code reuse, but most frameworks are unpredictable and hence unsuitable for embedded or real-time systems. Similarly, Java is increasingly being used to build embedded system software because of its portability and ease of use. The Real-Time Specification for Java (RTSJ) reduces the unpredictability in Java execution times by eliminating the need for a garbage collector. However, it introduces programming complexity that makes it difficult to build non-trivial applications. To bring the advantages of Java component development to DRE systems, while simultaneously simplifying the use of RTSJ, therefore, we have developed a new lightweight component model for RTSJ called Compadres. Compadres offers the following advantages: 1) Simple component definition in Java that abstracts away RTSJ memory management complexity; 2) System assembly from components by connecting ports that communicate through strongly-typed objects; 3) The Compadres compiler that automatically generates the scoped memory architecture for components, while the component framework handles communication between the components. To validate this work, we construct a non-trivial example application using the component framework, a simple real-time CORBA implementation. We then analyze the performance and efficiency of our component example versus a non-component example, RTZen. Our measurements show that our Compadres example built with components incurs only minor time overhead as compared to a comparable hand-coded example.
暂无评论