ppxscal/embedding_network huggingface dataset:
A low-power accelerator for the SPHINX 3 speech recognition system
Authors: Binu Mathew, Al Davis, Zhen Fang
Venue: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems (2003)

Accurate real-time speech recognition is not currently possible in the mobile embedded space where the need for natural voice interfaces is clearly important. The continuous nature of speech recognition coupled with an inherently large working set creates significant cache interference with other processes. Hence real-time recognition is problematic even on high-performance general-purpose platforms. This paper provides a detailed analysis of CMU's latest speech recognizer (Sphinx 3.2), identifies three distinct processing phases, and quantifies the architectural requirements for each phase. Several optimizations are then described which expose parallelism and drastically reduce the bandwidth and power requirements for real-time recognition. A special-purpose accelerator for the dominant Gaussiann probability phase is developed for a 0.25μ CMOS process which is then analyzed and compared with Sphinx's measured energy and performance on a 0.13μ 2.4 GHz Pentium 4 system. The results show an improvement in power consumption by a factor of 29 at equivalent processing throughput. However after normalizing for process, the special-purpose approach has twice the throughput, and consumes 104 times less energy than the general-purpose processor. The energy-delay product is a better comparison metric due to the inherent design trade-offs between energy consumption and performance. The energy-delay product of the special-purpose approach is 196 times better than the Pentium 4. These results provide strong evidence that real-time large vocabulary speech recognition can be done within a power budget commensurate with embedded processing using today's technology.
Eldo-XL: a software accelerator for the analysis of digital MOS circuits by an analog simulator
Authors: Joel Besnard, Jacques Benkoski, Bernard Hennion
Venue: Proceedings of the conference on European design automation (1991)

Eldo-XL is composed of a set of techniques developed on the basis of the Eldo analog simulator and integrated in it. Eldo-XL is targeted at the simulation of MOS digital circuits with minimal loss of accuracy compared to Eldo. The basis of Eldo-XL is a simpler MOS transistor model which allows the analytical solution of the nodal equations most of the time. The costly iterations associated the implicit solution are avoided and a large speed-up is obtained. The availability of a simpler relaxation algorithm can further enhance the performance on circuits with little feedback. All these acceleration techniques can be used on the digital part of a mixed analog/digital circuit without influencing the accuracy of the solution of the analog part. This paper presents the three techniques developed for Eldo-XL and attempts to show that a good efficiency can be reached without losing generality by combining a classical analog simulator with a dedicated evaluation engine for digital MOS circuits.
DAOP-ADL: an architecture description language for dynamic component and aspect-based development
Authors: Mónica Pinto, Lidia Fuentes, Jose María Troya
Venue: Proceedings of the 2nd international conference on Generative programming and component engineering (2003)

Architecture description languages deal with the description, analysis and reuse of software architectures. This paper describes DAOP-ADL, a component- and aspect-based language to specify the architecture of an application in terms of components, aspects and a set of plug-compatibility rules between them. With the aim of connecting the specification of the application architecture to the implementation, we describe our language using XML and XML Schemas. The DAOP-ADL language was designed to be interpreted by DAOP, our own dynamic component- and aspect-oriented platform. DAOP provides a composition mechanism that plugs aspects into components dynamically at runtime. The software architect will use the DAOP-ADL language at design time to describe the architecture of the application. Later this architectural information is loaded into the DAOP platform, which needs it to establish the dynamic connections between autonomous components and aspects. Therefore, the use of DAOP-ADL closes the gap between design and implementation of component- and aspect-based applications.
On easy and hard hereditary classes of graphs with respect to the independent set problem
Authors: Vladimir E. Alekseev
Venue: Discrete Applied Mathematics (2003)

In this paper we introduce the concept of a boundary class, which is a helpful tool for classification of hereditary classes of graphs according to the complexity of the independent set problem. It is shown that in a class X defined by a finite set of forbidden induced subgraphs, the problem is NP-hard if and only if X includes a boundary class. The paper presents a particular boundary class and establishes several new polynomially solvable cases for the independent set problem.
Abstract specification of resource accessing disciplines: adequacy, starvation, priority and interrupts
Authors: P. E. Lauer, M. W. Shields
Venue: ACM SIGPLAN Notices (1978)

A macro notation incorporating path notation is introduced. The notation was designed to permit the specification of the behaviour of a distributed system in terms of resources characterized by associated synchronization statements. The proper co-ordination of processes using the resources can thus be stated as the permissible order of execution of operations on shared resources as part of the resource definition. This contrasts with the usual "process oriented" approach which associates synchronization statements with the processes using the resource. This makes proper co-ordination of processes part of the individual task of each process. We argue that the process oriented approach is not suited for specifying highly parallel systems with distributed decision capabilities. The notions of adequacy, starvation, priority and interrupts are discussed in the context of our "resource oriented" approach and compared with thei counterparts in a "process oriented" approach. Semi formal demonstrations of the adequacy of simple but realistic example systems are sketched.
Case study: visualization of volcanic ash clouds
Authors: Mitchell Roth, Rick Guritz
Venue: Proceedings of the conference on Visualization '94 (1994)

Ash clouds resulting from volcanic eruptions are a serious hazard to aviation safety. In Alaska alone, there are over 40 active volcanoes whose eruptions may affect more than 40,000 flights using the great circle polar routes each year. The clouds are especially problematic because they are invisible to radar and nearly impossible to distinguish from weather clouds. The Arctic Region Supercomputing Center and the Alaska Volcano Observatory have collaborated to develop a system for predicting and visualizing the movement of volcanic ash clouds when an eruption occurs. The output from the model is combined with a digtal elevation model to produce a realistic view of the ash cloud which may be examined interactively from any desired point of view at any time during the prediction period. This paper describes the visualization techniques employed in the system and includes a video animation of the 1989 Mount Redoubt eruption which caused complete engine failure on a 747 passenger jet.
Fault Correction Profiles
Authors: Norman F. Schneidewind
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

In general, software reliability models have focusedon modeling and predicting the failure detection processand have not given equal priority to modeling the faultcorrection process. However, it is important to addressthe fault correction process in order to identify the needfor process improvements. Process improvements, inturn, will contribute to achieving software reliabilitygoals. We introduce the concept of a fault correctionprofile -- a set of functions that predict fault correctionevents as a function of failure detection events. The faultcorrection profile identifies the need for processimprovements and provides information for developingfault correction strategies. Related to the faultcorrection profile is the goal fault correction profile.This profile represents the fault correction goal againstwhich the achieved fault correction profile can becompared. This comparison motivates the concept offault correction process instability, and the attributes ofinstability. Applying these concepts to the NASAGoddard Space Flight Center fault correction processand its data, we demonstrate that the need for processimprovement can be identified, and that improvementsin process would contribute to meeting productreliability goals.
Solos in concert
Authors: Cosimo Laneve, Björn Victor
Venue: Mathematical Structures in Computer Science (2003)

We present a calculus of mobile processes without prefix or summation, called the solos calculus. Using two different encodings, we show that the solos calculus can express both action prefix and guarded summation. One encoding gives a strong correspondence, but uses a match operator; the other yields a slightly weaker correspondence, but uses no additional operators. We also show that the expressive power of the solos calculus is still retained by the sub-calculus where actions carry at most two names. On the other hand, expressiveness is lost in the solos calculus without match and with actions carrying at most one name.
Minimal Suppression Level for External Perturbations in Robust H&infin; Output Control: A Computation Method
Authors: D. V. Balandin, M. M. Kogan
Venue: Automation and Remote Control (2003)

The admissible value interval for the Lagrange multiplier in robust H&infin; output control is shown to be finite. Its bounds are determined and a computation procedure is designed to estimate the minimal external perturbation suppression level that can be attained in an uncertain system with unknown bounded parameters by a dynamic output controller.
Investigating chemical reactions using computer simulations
Authors: Jeremy Schofield
Venue:  (2003)

Although proton-transfer reactions are ubiquitous in chemistry and biology, their theoretical study is limited by number of difficulties. Some of the practical challenges involving the study of proton-transfer reactions include the fact that accurate descriptions of hydrogen-bonded systems require time-consuming ab initio electronic structure methods. Computer time limitations become particularly relevant when investigating &ldquo;rare events&rdquo; such as chemical reactions, especially when the reactions are accompanied by substantial differences in the structure of the solvent. In addition, the proton is the lightest nucleus and nuclear quantum effects must be described adequately in proton-transfer reactions. The problems mentioned above are addressed by proposing methodological improvements to calculate reaction rates for proton-transfer reactions. A new ab initio Monte Carlo algorithm is proposed in which a much faster molecular mechanics potential &ldquo;guides&rdquo; the slow ab initio electronic structure simulation resulting in significantly more efficient sampling schemes compared to the more familiar ab initio molecular dynamics methods. The molecular mechanics guided sampling method is generalized to incorporate nuclear quantum effects via centroid transition state theory and solvent effects via hybrid quantum mechanics-molecular mechanics methods. The use of the molecular mechanics based importance function method is exemplified in a study of model intra-molecular proton-transfer reactions which investigates how molecular mechanics potentials should be created in order to predict kinetic isotope effects and reaction mechanisms correctly, and to understand the conditions in which atoms other than the hydrogen atom should be treated quantum-mechanically.
Belief, inquiry, argument and reflection as significant issues in learning about information systems development methodologies
Authors: David A. Banks
Venue: Current issues in IT education (2003)

This chapter examines some of the issues that are driving the development of a master's course designated as "Information Systems Development Methodologies." The course takes a "reality as a social construct" view of the world, the purpose of the approach being to encourage students to challenge assumptions and enhance their abilities to research, reflect, critique, and develop strong arguments to support their understanding of the subject area. An interpretive approach such as this can challenge those students whose experiences of previous educational settings have been more strongly oriented toward rote or positivistic teaching and learning styles. The chapter outlines a number of approaches that have been adopted to help students deal with interpretive approaches to learning and to introduce them to issues of belief inquiry, argument, and reflection.
Improving Nogood Recording Using 2SAT
Authors: Peter J. Stuckey, Lei Zheng
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Nogood recording is a dynamic learning technique widely applied to solve CSP problems. It is highly effective in reducing the search space for SAT problems. While SAT is NP-complete, the problem restricted to binary clauses (2SAT) is solvable in linear time. We can improve SAT solving by incorporating 2SAT solving techniques. In this paper we investigate extending nogood recording to make use of binary clause resolution. Our experiments show that nogoods generated from binary resolution can significantly reduce the search space, and size of nogoods generated, as well as the search time.
Research, teaching, and service: the miniconference as a model for CS graduate seminar courses
Authors: Paolo A. G. Sivilotti, Bruce W. Weide
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

Rarely are the three pillars of academia---research, teaching, and service---addressed together, within one intellectually cohesive context in the graduate curriculum. Such a context is important for exposing students to the inter-relationships among these facets.This paper presents our experience with structuring graduate research seminar courses around the model of a "miniconference". Throughout the quarter, students pursue original research projects in the discipline of the seminar course. At the end of the quarter, students write their findings as technical conference papers, then act as the miniconference program committee in reviewing each other's submissions. Finally, the selected papers are presented at the miniconference. In addition to the model itself, we describe some variations in instantiation and an assessment of the benefits of this general approach.
GDSI: A Web-Based Decision Support System to Facilitate the Efficient and Effective Use of Clinical Practice Guidelines
Authors: Douglas C. Stahl, Layla Rouse, Dave Ko, Joyce C. Niland
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

Clinical Practice Guidelines (CPGs) are systematically developed healthcare recommendations designed to improve quality and control costs by reducing errors, minimizing practice variability, and promoting best practices. Although considerable effort and resources have been applied to CPG design, development, and deployment, the impact of CPGs on clinician behavior is inconsistent at best. The biomedical literature suggests that CPG efficacy could be improved using information systems that make CPGs and related patient-specific decision support functions available and easier to use at the point of care. This approach also depends upon the ability to integrate CPG information systems into the clinician workflow.Based on an analysis of the barriers to efficient and effective guideline use, researchers from City of Hope National Medical Center's Division of Information Sciences were motivated to develop a Web-based expert system to facilitate CPG utilization in a variety of clinical environments.The resulting Graphical Decision Support Interface (GDSI) employs a relational database-driven state machine architecture adapted from an instrument control system developed by one of the authors. The user interface was designed to facilitate clinician interaction with large, complex decision hierarchies. As users enter information about anindividual patient, the system computes additional derived values and provides context-specific recommendations. It also documents when and why clinicians intentionally deviate from guideline recommendations to assist with organizational benchmarking and CPG modification efforts. This report describes the GDSI prototype and our experience with the translation of breast cancer treatment guidelines into algorithms with explicit states and decision points. It also describes a pilot study of the system at two Southern California cancertreatment facilities. Preliminary results suggest that the GDSI system is well received among clinicians and is capable of making a positive contribution toward CPG development and use. Lessons learned and directions for future research are also discussed.
NAUTILE: a safe environment for silicon compilation
Authors: P. Bondono, A. A. Jerraya, A. Hornik, B. Courtois, D. Bonifas
Venue: Proceedings of the conference on European design automation (1990)

This paper deals with an environment for IC's layout, to act as a framework for the design of module generators for behavioral silicon compilation.It is built around an object oriented data manager that handles hierarchical design, and multiple representations, with emphasis on a safe design methodology. This manager also allows the use of externally defined elements, and the integration of tools written for other systems.
A Phase Error Analysis of Multigrid Methods for Hyperbolic Equations
Authors: W. L. Wan, Tony F. Chan
Venue: SIAM Journal on Scientific Computing (2003)

In this paper, we study the effects of the coarse grid correction process on multigrid convergence for hyperbolic problems in one and two dimensions. We approach this from the perspective of phase error, which allows us to exploit the hyperbolic nature of the underlying PDE. In particular, we consider three combinations of coarse grid operators and coarse grid solution approaches: (1) inexact coarse grid solve with direct discretization, (2) exact coarse grid solve with direct discretization, and (3) exact coarse grid solve with Galerkin coarse grid operator. For all these approaches, we show that the convergence behavior of multigrid can be precisely described by the phase error analysis of the coarse grid correction matrix, and we verify our results by numerical examples in one and two dimensions.
XRules: an effective structural classifier for XML data
Authors: Mohammed J. Zaki, Charu C. Aggarwal
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

XML documents have recently become ubiquitous because of their varied applicability in a number of applications. Classification is an important problem in the data mining domain, but current classification methods for XML documents use IR-based methods in which each document is treated as a bag of words. Such techniques ignore a significant amount of information hidden inside the documents. In this paper we discuss the problem of rule based classification of XML data by using frequent discriminatory substructures within XML documents. Such a technique is more capable of finding the classification characteristics of documents. In addition, the technique can also be extended to cost sensitive classification. We show the effectiveness of the method with respect to other classifiers. We note that the methodology discussed in this paper is applicable to any kind of semi-structured data.
A model of legal reasoning with cases incorporating theories and values
Authors: Trevor Bench-Capon, Giovanni Sartor
Venue: Artificial Intelligence (2003)

Reasoning with cases has been a primary focus of those working in AI and law who have attempted to model legal reasoning. In this paper we put forward a formal model of reasoning with cases which captures many of the insights from that previous work. We begin by stating our view of reasoning with cases as a process of constructing, evaluating and applying a theory. Central to our model is a view of the relationship between cases, rules based on cases, and the social values which justify those rules. Having given our view of these relationships, we present our formal model of them, and explain how theories can be constructed, compared and evaluated. We then show how previous work can be described in terms of our model, and discuss extensions to the basic model to accommodate particular features of previous work. We conclude by identifying some directions for future work.
A reusable, academic-strength, metrics-based software engineering process for capstone courses and projects
Authors: Richard Conn
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

This paper describes a mature Software Engineering Process that may be applied to capstone courses, student projects, and research projects in a university environment. This process, based in part on the Team Software Process of the Software Engineering Institute, features mature software engineering best practices, including extensive use of metrics to gain insight into process effectiveness and product quality. It is designed to be executed in a single 16-week semester, and it can easily be modified for a longer time frame. It is also designed for the academic culture: (1) it executes as a communicating sequential process running in parallel with and passing information to a series of in-class course presentations and (2) it takes into account that the students cannot devote full time to this one project. This process is independent of the computer language used and any project-specific technology (so it may be applied to software-only projects, robotics projects, smart device projects, embedded programming projects, and any other kind of software-intensive system project). This process is reusable without modification, or it may be tailored. To support tailoring, the process is described using meta data in a format that may be analyzed by automated tools to generate a hypertext document. This process has been tested by using it in a capstone course.
User-Oriented Reliability Modeling for a Web System
Authors: Wen-Li Wang, Mei-Huei Tang
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

We develop a user-oriented reliability model, a simple yeteffective approach, to address huge amounts of Web contents,and more importantly tackle users' dynamic navigationbehaviors for a Web system. The users' intrinsic capabilitiesand behaviors, unlike programs' common recurringbehaviors, call for a new approach for modelingthe reliability of an organization's Web system. Our approachdiffers in the modeling scope of the Web systemand the means of modeling user behaviors. We exploit theidea of cyclomatic complexity to cover the maximumnumber of independent paths, which overcome the lesslikely repetitive user navigations, and still maintain thedynamic nature of Web surfing. The modeling processtakes Web servers' access, error, and referrer informationas inputs, and translates them into a flow graph. Atransition tree is then derived from the flow graph, basedon depth-first traversal and dynamic programming. Accordingly,the reliability of the Web system can be computedby excluding those unreliable paths. This model isfurther applied to prioritize the error removal sequence toassist in allocating resources and effort.