ppxscal/embedding_network huggingface dataset:
Audio parsing and rapid speaker adaptation in speech recognition for spoken document retrieval
Authors: Bowen Zhou
Venue:  (2003)

The focus of this thesis is to address a number of research issues in developing an effective large vocabulary continuous speech recognition (LVCSR) based on-line spoken document retrieval system. Within this framework, the primary thesis contributions include the following distinct yet related areas: The first thesis contribution addresses the problem of efficient audio stream parsing. Here, an extension to the previously proposed Bayesian Information Criterion (BIC) based algorithm is formulated as T 2-BIC, by integrating the Hotelling's T2-Statistic into BIC. Using the proposed algorithm, a significant computational speed improvement is demonstrated with superior parsing performance. Second, novel rapid model adaptation techniques, entitled Eigenspace Mapping, represent a primary contribution from this thesis. The idea of Eigenspace Mapping is to construct discriminative acoustic models for the test speaker by preserving the dominant discriminating power from the baseline model along the test speaker's first primary eigendirections. The adaptation process is accomplished through a linear transformation in the model space. Based on this key idea, a number of algorithms can be formulated such as EigMap, and extensions using different objective functions including the Structural Maximum Likelihood Eigenspace Mapping. Unsupervised adaptation experiments show that the proposed algorithms are effective using very limited amounts of adaptation data. Furthermore, the proposed algorithms are highly additive to other traditional methods such as MLLR by bringing additional discrimination information. Finally, the last contribution focuses on an experimental on-line spoken document retrieval system, SpeechFind, which is designed and implemented by incorporatitig state-of-the-art LVCSR and information retrieval (IR) technologies. In addition to system development efforts, contributions have been made to enhance the quality of automatic transcripts and several methods such as query and document expansions have been developed to overcome the issue of IR over corrupted transcripts. Collectively, the contributions made in these three related areas have resulted in an effective and integrated on-line spoken document retrieval system. Moreover, the proposed audio parsing and novel rapid speaker adaptation algorithms have helped advance the state of the art in robust speech recognition.
Sentient Data Access via a Diverse Society of Devices
Authors: George W. Fitzmaurice, Azam Khan, William Buxton, Gordon Kurtenbach, Ravin Balakrishnan
Venue: Queue (2003)

It has been more than ten years since such “information appliances” as ATMs and grocery store UPC checkout counters were introduced. For the office environment, Mark Weiser began to articulate the notion of UbiComp (ubiquitous computing) and identified some of the salient features of the trends in 1991.1, 2 Embedded computation is also becoming widespread.
A Globally Convergent Filter Method for Nonlinear Programming
Authors: Clóvis C. Gonzaga, Elizabeth Karas, Márcia Vanti
Venue: SIAM Journal on Optimization (2003)

In this paper we present a filter algorithm for nonlinear programming and prove its global convergence to stationary points. Each iteration is composed of a feasibility phase, which reduces a measure of infeasibility, and an optimality phase, which reduces the objective function in a tangential approximation of the feasible set. These two phases are totally independent, and the only coupling between them is provided by the filter. The method is independent of the internal algorithms used in each iteration, as long as these algorithms satisfy reasonable assumptions on their efficiency. Under standard hypotheses, we show two results: for a filter with minimum size, the algorithm generates a stationary accumulation point; for a slightly larger filter, all accumulation points are stationary.
Interorganizational relationships, strategic alliances, and networks: the role of communication systems and information technologies
Authors: Keiichi Yamada
Venue: Managing IT in government business & communities (2003)

This chapter deals with roles and ways of interorganizational communication systems. Prior to the subject, author refers to three topics related to the subject: what are interorganizational relationships, strategic alliances, and interorganizational networks.In order to understand interorganizational networks, the author utilizes Barnard's theory of cooperative system and formal organization, in which communication plays a significant role to formulate and to maintain interorganizational networks as organization of organizations. Furthermore, there are some problems for effective interorganizational communication systems - both human and machine: standardization of communication systems, impact of IT development, and interorganizational strategy using IT.
Conceptual modelling for configuration: A description logic-based approach
Authors: Deborah L. McGuinness Jon R. Wright
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1998)

Representing objects and their interactions can be quite challenging when an application requires many complicated, interconnected objects that are restricted in how they can be instantiated. In this paper, we present our approach to conceptual modelling. We have used this approach with success in a number of applications, the largest of which is the PROSE family of configurators. PROSE was first deployed in 1990 and has been used to configure over 4 billion dollars worth of AT&T and Lucent telecommunications equipment. We will discuss our approach to conceptual modelling, which is based on knowledge representation, show how it meets our representation and reasoning needs, and then discuss the relative merits of the approach.2
New frontiers for embedded computing
Authors: Victor Yodaiken
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Until recently, embedded computing was a niche discipline,but it is now part of standard industrial practice.The increasing sophistication of embedded applications ismatched by new demands on system performance, especiallyreal-time, and on both interoperability and developmentprocess. In this note, I will describe some of the challengesand some new applications for real-time outside traditionalareas.
A Tuturial on the Emerging Nanotechnology Devices
Authors: Tezaswi Raja, Vishwani D. Agrawal, Michael L. Bushnell
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

This paper provides an overview of the research onnanometer scale electronic switching devices.Suchdevices are likely to be used for building ultra-densityintegrated electronic computers of the future.Wefirst describe the problems faced by the downscalingof FET devices and then discuss the emerging alternatives:1) Carbon Nanotube transistors 2) Quantumeffect and single-electron devices and 3) Molecularelectronic devices.We discuss the basic operatingprinciple of each type of device.Here mathematicaldetails have been suppressed in favor of simpler understanding.The present state of the art for eachnew device is given, outlining the open problems forresearch.Finally, a possible time-line for their large-scaleimplementation is given.
Poster abstract: an energy-balanced transmission scheme for sensor networks
Authors: Weihua Guo, Zhaoyu Liu, Guangbin Wu
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

Low energy consumption is one of the design challenges for data transmission for sensor networks. We identify the drawbacks of two conventional data transmission protocols, in terms of balance of energy consumption. We propose an approach to balance energy consumption, and present the theoretical analysis and approximate methods of our approach. Preliminary simulation results show that our approach can achieve a longer overall lifetime of a sensor network.
Assessing the benefits from e-business transformation through effective enterprise management
Authors: Colin G. Ash, Janice M. Burn
Venue: European Journal of Information Systems (2003)

This paper reports on research carried out in 1999-2001 on the use of e-business applications in enterprise resource planning (ERR)-based organisations. Multiple structured interviews were used to collect data on 11 established organisations from a diverse range of industries. The findings are analysed according to the level of sophistication of e-business models and their transformational impact on the organisation. Early adopters of e-business show a trend towards cost reductions and administrative efficiencies from e-procurement and self-service applications used by customers and employees. More mature users focus on strategic advantage and generate this through an evolutionary model of organisational change. Two complex case studies of e-business integration with global suppliers and their corporate customers are analysed to identify specific stages of benefits accrual through the e-business transformation process. Collectively, the set of case studies is used to demonstrate the increased benefits derived from an e-business architecture based on a network of ERP-enabled organisations.
Gradient Vector Flow Fast Geometric Active Contours
Authors: Nikos Paragios, Olivier Mellina-Gottardo, Visvanathan Ramesh
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--In this paper, we propose an edge-driven bidirectional geometric flow for boundary extraction. To this end, we combine the geodesic active contour flow [CHECK END OF SENTENCE] and the gradient vector flow external force for snakes [CHECK END OF SENTENCE]. The resulting motion equation is considered within a level set formulation [CHECK END OF SENTENCE], can deal with topological changes and important shape deformations. An efficient numerical schema is used for the flow implementation that exhibits robust behavior and has fast convergence rate [CHECK END OF SENTENCE], [CHECK END OF SENTENCE]. Promising results on real and synthetic images demonstrate the potentials of the flow.
Personal video recorder basics
Authors: Christian A. Herzog
Venue: Linux Journal (2004)

Create a custom PVR thatworks your way and even burns archive copies.
HCI and MIS: shared concerns
Authors: Ping Zhang, Andrew Dillon
Venue: International Journal of Human-Computer Studies (2003)

The fields of HCI and MIS share many concerns but have traditionally not shared literatures, theories and results. This special issue is a first attempt at bridging the disciplinary divide. In this paper, the history of both fields is briefly outlined and reasons for the independence of each are examined. The criteria for paper inclusion are outlined and each paper is briefly introduced.
A weighted essentially non-oscillatory numerical scheme for a multi-class Lighthill-Whitham-Richards traffic flow model
Authors: Mengping Zhang, Chi-Wang Shu, George C. K. Wong, S. C. Wong
Venue: Journal of Computational Physics (2003)

In this paper, we present a high-order weighted essentially non-oscillatory (WENO) scheme for solving a multiclass extension of the Lighthill-Whitham-Richards (LWR) model. We first review the multi-class LWR model and present some of its analytical properties. We then present the WENO schemes, which were originally designed for computational fluid dynamics problems and for solving hyperbolic conservation laws in general, and demonstrate how to apply these to the present model. We found through numerical experiments that the WENO method is vastly more efficient than the low-order Lax-Friedrichs scheme, yet both methods converge to the same solution of the physical model. It is especially interesting to observe the small staircases in the solution which are completely missed out, because of the numerical viscosity, if a lower-order method is used without a sufficiently refined mesh. To demonstrate the applicability of this new, efficient numerical tool, we study the multi-class model under different parameter regimes and traffic stream models. We consider also the convergence of the multi-class LWR model when the number of classes goes to infinity. We show that the solution converges to a smooth profile without staircases when the number of classes increases.
Oxygen vacancies in tetragonal ZrO2: ab initio embedded cluster calculations
Authors: Andrey A. Safonov, Alexander A. Bagatur'yants, Anatoli A. Korkin
Venue: Microelectronic Engineering (2003)

Formation of oxygen vacancies in bulk tetragonal ZrO2 and at its (101) and (001) surfaces was studied using ab initio embedded cluster calculations. A new technique was proposed for generating a set of point charges that represents the Coulomb field of the crystal environment both for bulk and surface cluster structures. This technique provides the rapid convergence of the calculated Madelung potential to the unique true value. The estimated bulk vacancy formation energy in tetragonal ZrO2 is 8.8 eV, while surface vacancy energy formation depends on the type of the surface and position of removed oxygen atom and varies from 8.3 to 9.3 eV. The calculated activation energy of oxygen vacancy migration in bulk ZrO2 is 1.95 eV.
Reasoning on regular path queries
Authors: D. Calvanese, G. De Giacomo, M. Lenzerini, M. Y. Vardi
Venue: ACM SIGMOD Record (2003)

Current information systems are required to deal with more complex data with respect to traditional relational data. The database community has already proposed abstractions for these kinds of data, in particular in terms of semistructured data models. A semistructured model conceives a database essentially as a finite directed labeled graph whose nodes represent objects, and whose edges represent relationships between objects. In the same way as conjunctive queries form the core of any query language for the relational model, regular path queries (RPQs) and their variants are considered the basic querying mechanisms for semistructured data.Besides the basic task of query answering, i.e., evaluating a query over a database, databases should support other reasoning services related to querying. One of the most important is query containment, i.e., verifying whether for all databases the answer to a query is a subset of the answer to a second query. Another important reasoning service that has received considerable attention in the recent years is view-based query processing, which amounts to processing queries based on a set of materialized views, rather than on the raw data in the database.The goal of this paper is to describe basic results and techniques concerning query containment and view based query processing for the class of two-way regular-path queries (which extend RPQs with the inverse operator). We will demonstrate that the basic services for reasoning about two way regular path queries are decidable, thus showing that the limited form of recursion expressible by these queries does not endanger the decidability of reasoning. Besides the specific results, our methods show the power of two-way automata in reasoning on complex queries.
Inference of Protein-Protein Interactions by Unlikely Profile Pair
Authors: Byung-Hoon Park, George Ostrouchov, Gong-Xin Yu, Al Geist, Andrey Gorin, Nagiza F. Samatova
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

We note that a set of statistically "unusual" protein-profilepairs in experimentally determined database ofprotein-protein interactions can typify protein-proteininteractions, and propose a novel method calledPICUPP that sifts such protein-profile pairs using astatistical simulation. It is demonstrated that unusualPfam and InterPro profile pairs can be extracted fromthe DIP database using a bootstrapping approach. Weparticularly illustrate that such protein-profile pairs canbe used for predicting putative pairs of interactingproteins. Their prediction accuracies are around 86%and 90% when InterPro and Pfam profiles are used,respectively at 75% confidence level.
A road less traveled: deciphering the genome of a differently evolved eukaryote
Authors: Terry M. Gaasterland, George A. Cross
Venue:  (2003)

Trypanosoma brucei, the causative agent of African sleeping sickness, is a protist that presents numerous challenges to computational genome analysis. Its divergence from well-studied organisms limits the ability to identify true protein-coding regions and assign functions to these coding regions. Further, the limited resources available for the study of non-model organisms slows the pace of research into this important pathogen. Therefore, the application of computational methods that can facilitate the selection of likely coding regions for further investigation is critical to furthering our understanding of this unusual organism. This dissertation describes the development of computational methods for the identification and characterization of true protein-coding regions in T. brucei. To select likely coding regions, a method based on statistical profiles of known coding regions and their upstream, non-coding regions has been developed. This approach has been evaluated both computationally and experimentally and demonstrates high accuracy and confidence in individual predictions. To further refine the identification of likely coding regions, signals associated with a key post-transcriptional processing step known as trans-splicing have been characterized as well. As a result of this analysis, for the first time, trans-splicing sites can be predicted with reasonable accuracy and specificity. An automated annotation system has also been developed to suggest putative function based on sequence similarity to known proteins. When compared to the manual annotation, the system identifies the same or similar function for over three-quarters of coding regions that would be annotated by a human curator. The work presented here provides a powerful suite of methods for identifying, evaluating and annotating protein-coding genes in T. brucei. Further, the methods may be extended to other members of the trypanosomatid family or to organisms that share aspects of trypanosomatid biology. As such, this work offers an organism-specific paradigm for genome analysis that can complement other, generalized solutions for sequence review and annotation.
Implications on the learning of programming through the implementation of subsets in program development environments
Authors: Peter Joseph Depasquale,  III
Venue:  (2003)

The undergraduate Computer Science program at Virginia Tech is the largest in the Commonwealth of Virginia, of which a key component is &ldquo;CS 1044: Introduction to Programming&rdquo;, and is typical of a first course in computer programming throughout the USA. While the student access to learning resources has improved considerably with the development of web-based assets, students are still expected to use the same sophisticated program development tools as are used in industry. The perceived complexity of the learning environment currently in use drives many women and minority students from the Computer Science program. A great deal of attention has been paid to the need to administer the student assignments and the grading system for this course, so as to minimize the teaching/grading load, but little attention has been paid to the methodologies of learning the material through practice. The work reported herein is intended to improve the pedagogy of this course by creating and integrating teaching/learning tools that better manage the student's engagement in the use of program development; activities. Following the implementation of a three-element software system involving an interpreter for the C-language, a program development environment, and a data-monitoring/collection device, the system was deployed in support of the freshman course in parallel to the commercial system commonly used. The experiment concentrated on examining the impact of the simplified development environment and the effort required for students to complete assigned programming projects.
Networked music: bridging real and virtual space
Authors: John P. Young
Venue: Organised Sound (2001)

This paper describes an exploration of utilising the World Wide Web for interactive music. The origin of this investigation was the intermedia work Telemusic #1, by Randall Packer, which combined live performers with live public participation via the Web. During the event, visitors to the site navigated through a virtual interface, and while manipulating elements, projected their actions in the form of triggered sounds into the physical space. Simultaneously, the live audio performance was streamed back out to the Internet participants. Thus, anyone could take part in the collective realisation of the work and hear the musical results in real time. The underlying technology is, to our knowledge, the first standards-based implementation linking the Web with Cycling '74 MAX. Using only ECMAScript/JavaScript, Java, and the OTUDP external from UC Berkeley CNMAT, virtually any conceivable interaction with a Web page can send data to a MAX patch for processing. The code can also be readily adapted to work with Pd, jMAX and other network-enabled applications.
Animated statues
Authors: Jonathan Starck, Gordon Collins, Raymond Smith, Adrian Hilton, John Illingworth
Venue: Machine Vision and Applications (2003)

In this paper we present a layered framework for the animation of high-resolution human geometry captured using active 3D sensing technology. Commercial scanning systems can now acquire highly accurate surface data across the whole-body. However, the result is a dense, irregular, surface mesh without any structure for animation. We introduce a model-based approach to animating a scanned data-set by matching a generic humanoid control model to the surface data. A set of manually defined feature points are used to define body and facial pose, and a novel shape constrained matching algorithm is presented to deform the control model to match the scanned shape. This model-based approach allows the detailed specification of surface animation to be defined once for the generic model and re-applied to any captured scan. The detail of the high-resolution geometry is represented as a displacement map on the surface of the control model, providing smooth reconstruction of detailed shape on the animated control surface. The generic model provides animation control over the scan data-set, and the displacement map provides control of the high-resolution surface for editing geometry or level of detail in reconstruction or compression.
Z-Sets and Z-Detections: Circuit Characteristics that Simplify Fault Diagnosis
Authors: Irith Pomeranz, Srikanth Venkataraman, Sudhakar M. Reddy, Bharath Seshadri
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

We define the concepts of z-sets and z-detections for combinational circuits (or the combinational logic of scan circuits). Based on these concepts we define structural characteristics and characteristics based on fault simulation. We show that these characteristics determine the numbers of fault pairs that are guaranteed to be distinguished by a given fault detection test set. These fault pairs do not need to be considered during diagnostic fault simulation or test generation. We demonstrate that benchmark circuits as well as industrial circuits have these characteristics to a larger extent than may be expected. As a result, only small percentages of fault pairs need to be considered during diagnostic fault simulation or test generation once a fault detection test set is available. In addition, these fault pairs can be identified efficiently.