ppxscal/embedding_network huggingface dataset:
Definitive VoiceXML
Authors: Adam Hocek, David Cuddihy
Venue:  (2003)

From the Book:ForewordSpeech is the most human of human interfaces. No written text has the impact of a baby’s cry, a lover’s whisper … or your boss calling you into his office!But until recently, the cost and complexity of implementation meant that there was no freedom of speech where software interface design is concerned.Voice applications required a special purpose computer equipped with telephony and voice synthesis hardware. The software to program these machines was proprietary, complex, and arcane.Now XML is changing all that — as it has so many other aspects of computing — in the form of a markup language for describing and controlling conversations. VoiceXML, in conjunction with advances in speech recognition and synthesis, is rapidly making the Web a vocal medium.Adam Hocek and David Cuddihy are just the people to teach you how to take advantage of this new technology. They are professional engineers with decades of telephony and audio experience, and they work with VoiceXML every day.XML may not be a spoken language, but with VoiceXML and this book you can bring the power and freedom of speech to your applications and Web sites.— Charles F. Goldfarb, Saratoga, CA, November 15, 2002
Dynamic routing for multimedia traffic over ATM networks
Authors: Tao Zhu, Changming Liu, H. T. Mouftah
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

ATM networks support multimedia traffic where diverse services have to be provided and various QoS requirements have to be met. Routing plays an important role in guaranteeing the QoS. However conventional routing will cause a significant overhead when the network size gets very large or rerouting occurs frequently due to the varying link state. The objective of our dynamic routing scheme is to perform more efficient routing over a more effective and simpler topology which is abstracted from the original full topology based on the dynamic link state. Only those links with high probability to satisfy the QoS of the call are included in the effective topology. It is an efficient way to prevent rerouting from occurring too often because the blocking probability over this effective topology is significantly low. A hierarchical routing model is also proposed to further reduce the amount of information that has to be stored and exchanged for routing. We present the simulation results of our dynamic routing scheme along with the hierarchical routing model and its implementation over QUARTS, a simulation testbed for ATM networks.
A Useful Application of CMOS Ternary Logic to the Realization of Asynchronous Circuits
Authors: R. Mariani, R. Roncella, R. Saletti, P. Terreni
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

This paper shows how the application of a CMOS ternary logic is useful in the realization of Delay Insensitive (DI) asynchronous circuits. It is shown that fully DI asynchronous circuits are obtained with a ternary handshake protocol which employs the third logic level as idle state of the asynchronous interface. The advantages obtained are a dramatic reduction of the communication requirement and a lower power consumption as compared to other asynchronous solutions. It is then discussed how general purpose delay-insensitive circuits can be designed with ternary logic elements and finally an asynchronous sequence recognition circuit is described as application of the approach.
Investigations for Minimum Invasion Digital Only Built-In &ldquo;Ramp&rdquo; Based Test Techniques for Charge Pump PLL's
Authors: Martin John Burbidge, Frederic Poullet, Jim Tijou, Andrew Richardson
Venue: Journal of Electronic Testing: Theory and Applications (2003)

Due to a number of desirable operational and design characteristics, CP-PLL's (Charge Pump Phase locked loops) have, in recent years become a pervasive PLL architecture. CP-PLL architectures are exploited for a variety of applications such as on chip clock generation, CRC (clock recovery circuits) and Radio frequency synthesis applications. This paper describes a simple, digital only, minimally invasive and fully automated test approach for high performance CP-PLL's that can be used to provide more information about the CP-PLL function beyond that obtained through the commonly used FLT (Frequency Lock Test). The test strategy described here allows the estimation of forward path (FP) gain and relative leakage in the forward path loop components. Applications of the test are focussed towards digital only testing of fully embedded CP-PLL's, however further test modifications could yield marked test time improvements for embedded and board level CP-PLL's incorporating multiple CP currents and or multiple loop filter (LF) configurations.
BLAS Based on Block Data Structures
Authors: Greg Henry
Venue:  (1992)

The optimization of the BLAS is discussed, with examples given for the IBM superscalar RISC S/6000. The approach suggested is to use block data structures based on store-by-block schemes. We give results and analysis of the optimization of DGEMM. We also suggest how these results can be applied to the higher level factorizations and the other BLAS. Results are given to show the advantages of using block data structures.
Supporting Parallel Processing on the RHODOS Cluster of Workstations
Authors: M. Hobbs, A. Goscinski
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

With the move towards parallel processing on Clusters of Workstations (COWs) the ability to fully utilize the computational resources of all workstations through the initial placement and movement of workload is desirable by the user of the system, to improve the overall performance. This is a critical task when many users run their parallel pro grams simultaneously. The ability to have an even spread of load over an entire COW can be achieved through the employment of Global Scheduling. This paper introduces the concept of global scheduling exploiting static allocation and dynamic load balancing along with the implementation of such a facility and support services, remote process creation and process migration, respectively, on the RHODOS distributed operating system. The suitability of the RHO DOS implementation is demonstrated by results obtained from initial test runs of a SPMD parallel application.
Resource sharing for multi-party real-time communication
Authors: A. Gupta, Wingwai Howe, M. Moran, Quyen Nguyen
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

Approaches to supporting real-time communication allocate network resources either to individual connections, or to aggregates of connections. Resource sharing is a new approach that exploits known relationships between related connections to allow network resources to be shared between them without sacrificing well-defined guarantees. The authors present a fully distributed technique for using resource sharing to provide guaranteed performance communication in a heterogeneous internetwork. Results show that resource sharing leads to a large gain in the connection acceptance rate, and a significant reduction in the computational overhead associated with admission control. Thus, resource sharing is an important tool for providing real-time performance guarantees for large conferences.
Introducing SCSI-to-IP Cache for Storage Area Networks
Authors: Xubin He, Qing Yang, Ming Zhang
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

Data storage plays an essential role in today's fast-growing data-intensive network services. iSCSI is one of the most recent standards that allow SCSI protocols to be carried out over IP networks. However, the disparities between SCSI and IP prevent fast and efficient deployment of SAN (Storage Area Network) over IP. This paper introduces STICS (SCSI-To-IP Cache Storage), a novel storage architecture that couples reliable and high-speed data caching with low-overhead conversion between SCSI and IP protocols. Through the efficient caching algorithm and localization of certain unnecessary protocol overheads, STICS significantly improves performance over current iSCSI system. Furthermore, STICS can be used as a basic plug-and-play building block for data storage over IP. We haveimplemented software STICS prototype on Linux operating system. Numerical results using popular PostMark benchmark program and EMC's trace have shown dramatic performance gain over the current iSCSI implementation.
Numerical Data Fitting in Dynamical Systems: A Practical Introduction with Applications and Software
Authors: Klaus Schittkowski
Venue:  (2002)

:Audience: Mathematicians working on numerical analysis, optimization, and differential equations. Professionals from all areas of natural and engineering sciences working with mathematical dynamical models, especially in the areas of chemical engineering, pharmaceutics, biology, physics, earth sciences, ecology, electrical engineering, mechanical engineering, and food technology, among many others.
Modes, Values and Expressions
Authors: Marvin Solomon
Venue:  (1974)

NO SUPPLIED The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
An MS-DOS File System for UNIX
Authors: Alessandro Forin, Gerald R. Malan
Venue:  (1993)

We have written DosFs, a new file system for UNIX that uses MS-DOS data structures for permanent storage. DosFs can be used anywhere a traditional UNIX file system can be used, and it can mount disks written by MS-DOS as regular UNIX partitions. DosFs can be used as the root partition, and exported by an NFS server. Our motivation for this work was efficient disk space utilization; DosFs provides from 10% to 13% better disk utilization than the 4.3 BSD Fast File System (FFS). In addition, we found that the disk block allocation algorithm used by DosFs lets us exploit large contiguous disk operations, providing a five-fold improvement over FFS for uncached operations. To the best of our knowledge, this is the first file system implementation that allows the user to specify the logical block size at mount time. A user can mount the same file system with a larger block size when file accesses tend to be sequential and a smaller one when they tend to be scattered. The MS-DOS structures were designed for a single-user system and do not support access control. We solved this problem with simple extensions that are backward-compatible with MS-DOS.
C++: A Beginner's Guide
Authors: Herbert Schildt
Venue:  (2002)

:Learn C++ programming fundamentals from the world's leading programming author Herb Schildt. Filled with easy-to-follow tutorials and hands-on examples,this book covers all key topics and will help you write practical,real-world programs. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
An Approach to Designing Fault-Tolerant Computing Systems
Authors: Richard D. Schlichting, Fred B. Schneider
Venue:  (1981)

A methodology that facilitates the design of fault-tolerant computing systems is presented. It is based on the notion of a fail-stop processor. Such a processor automatically halts in response to any internal failure and does so before the effects of that failure become visible. The problem of implementing processors that, with high probability, behave like fail-stop processors is addressed. Axiomatic program verification techniques are described for use in developing provably correct programs for fail-stop processors. The design of a process control system illustrates the use of our methodology.
Classes of Functions and Feasibility Conditions in Nonlinear Complimentarity Problems
Authors: Jorge J. More
Venue:  (1973)

Given a mapping $F$ from real Euclidean n-space into itself, we investigate the connection between various known classes of functions and the nonlinear complementarity problem: Find and $x^{*} \geq 0$ such that $ F x^{*} \geq 0$ and is orthogonal to $x^{*}$. In particular, we study the extent to which the existence of a $u \geq 0$ with $F $u \geq 0$ (feasible point) implies the existence of a solution to the nonlinear complementarity problem, and extend, to nonlinear mappings, known results in the linear complementarity problem on P-matrices, diagonally dominant matrices with nonnegative diagonal elements, matrices with off-diagonal non-positive entries, and positive semidefinite matrices.
Criteria for Testing Polymorphic Relationships
Authors: Roger T. Alexander, A. Jefferson Offutt
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

The emphasis in object-oriented programs is on defining abstractions that have both state and behavior. This emphasis causes a shift in focus from software units to the way software components are connected. Thus, we are finding that we need less emphasis on unit testing and more on integration testing. The compositional relationships of inheritance and aggregation, especially when combined with polymorphism, introduce new kinds of integration faults. This paper presents results from an ongoing research project that has the goal of improving the quality of object-oriented software. New testing criteria are introduced that take the effects of inheritance and polymorphism into account. These criteria are based on the new analysis technique of quasi-interprocedural data flow analysis. These testing criteria can improve the quality of object-oriented software by ensuring that integration tests are high quality.
Using Simulation for Assessing the Real Impact of Test Coverage on Defect Coverage
Authors: Lionel Briand, Dietmar Pfahl
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

The use of test coverage measures (e.g., block coverage) to control the software test process has become an increasingly common practice. This is justified by the assumption that higher test coverage helps achieve higher defect coverage and therefore improves software quality. In practice, data often shows that defect coverage and test coverage grow over time, as additional testing is performed. However, it is unclear whether this phenomenon of concurrent growth can be attributed to a causal dependency, or if it is coincidental, simply due to the cumulative nature of both measures. Answering such a question is important as it determines whether a given test coverage measure should be monitored for quality control and used to drive testing.Although this is no general answer to the problem above, we propose a procedure to investigate whether any test coverage criterion has a genuine additional impact on defect coverage when compared to the impact of just running additional test cases. This procedure is applicable in typical testing conditions where the software is tested once, according to a given strategy, and where coverage measures are collected as well as defect data. We then test the procedure on published data and compare our results with the original findings. The study outcomes do not support the assumption of a causal dependency between test coverage and defect coverage, a result for which several plausible explanations are provided.
Extending Fault Trees with an AND-THEN Gate
Authors: Pathirage Gamini Wijayarathna, Mamoru Maekawa
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

Fault trees have been used for software safety analysis in various safety critical systems. The PRIORITY-AND gate was proposed because the conventional AND gate cannot be used to represent the sequential order of the events. This paper shows that even PRIORITY-AND gate is not expressive enough to represent the relative temporal order of the events precisely. We extend the Fault Trees with an AND-THEN gate that is the corresponding gate of the logical connective TAND. This increases the expressive power of the fault trees. The AND-THEN gate can represent relative temporal relations precisely.
Proofs as Programs
Authors: Joseph L. Bates, Robert L. Constable
Venue:  (1983)

The significant intellectual cost of programming is for problem solving and explaining and not for coding. Yet, programming systems offer mechanical assistance exclusively with the coding process. Here we describe an implemented program development system, called PRL (``pearl''''), that provides automated assistance with the hard part. The program and its explanation are seen as formal objects in a constructive logic of the data domains. These formal explanations can be executed at various stages of completion. The most incomplete explanations resemble applicative programs, the most complete are formal proofs.
Location management for mobile commerce applications in wireless Internet environment
Authors: Upkar Varshney
Venue: ACM Transactions on Internet Technology (TOIT) (2003)

With recent advances in devices, middleware, applications and networking infrastructure, the wireless Internet is becoming a reality. We believe that some of the major drivers of the wireless Internet will be emerging mobile applications such as mobile commerce. Although many of these are futuristic, some applications including user-and location-specific mobile advertising, location-based services, and mobile financial services are beginning to be commercialized. Mobile commerce applications present several interesting and complex challenges including location management of products, services, devices, and people. Further, these applications have fairly diverse requirements from the underlying wireless infrastructure in terms of location accuracy, response time, multicast support, transaction frequency and duration, and dependability. Therefore, research is necessary to address these important and complex challenges. In this article, we present an integrated location management architecture to support the diverse location requirements of m-commerce applications. The proposed architecture is capable of supporting a range of location accuracies, wider network coverage, wireless multicast, and infrastructure dependability for m-commerce applications. The proposed architecture can also support several emerging mobile applications. Additionally, several interesting research problems and directions in location management for wireless Internet applications are presented and discussed.
Intelligent assistants for handicapped people's independence: case study
Authors: N. G. Bourbakis, D. Ravraki
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

This paper presents the first stage of the development of two intelligent assistants for handicapped people's independence. The first intelligent assistant, called Tyflos, will help a blind user to be independent and able to walk and work alone in a 3-D dynamic environment. The system captures images from the surrounding 3-D environment, either by the user's command or in a continued mode, and converts the visual description of each image into a verbal (low or high level) descriptions. With other words the system plays the role of human assistant, who describes to the user the 3-D visual environment. The second assistant, called Koufos, will help a deaf person to be more independent in the living environment by making him/her to visually hear sounds and spoken natural language and assisting him/her to visually learn to speak as well.
Partial Hyperclones on a Finite Set
Authors: B. A. Romov
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

The composition-closed sets of partial multi-valued operations, calledpartial hyperclones, defined on a finite set E(k)={0,1,...,k-1} (k=2,3,...)are investigated. It is shown that the lattice of all partial hyperclones isdually atomic and has only a finite number of dual atoms (maximal partialhyperclones). Some of them are presented in this paper. The full list ofmaximal restriction-closed partial hyperclones is obtained and so thecompleteness problem with respect to compositions and restrictions of partialhyperoperations is solved.
Automatic Scal Selection as a Pre-Processing Stage to Interpreting Real-World Data
Authors: Troy Lindeberg
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

We perceive objects in the world as meaningful entities only over certain ranges of scale. A simple example is the concept of a branch of a tree, which makes sense only at a scale from, say, a few centimeters to at most a few meters, It is meaningless to discuss the tree concept at the nanometer or kilometer level. At those scales, it is more relevant to talk about the molecules that form the leaves of the tree, and the forest in which the tree grows, respectively. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Concurrent dynamic epistemic logic for MAS
Authors: H. P. van Ditmarsch, W. van der Hoek, B. P. Kooi
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

When giving an analysis of knowledge in multiagent systems, one needs a framework in which higher-order information and its dynamics can both be represented. A recent tradition starting in original work by Plaza treats all of knowledge, higher-order knowledge, and its dynamics on the same foot. Our work is in that tradition. It also fits in approaches that not only dynamize the epistemics, but also epistemize the dynamics: the actions that (groups of) agents perform are epistemic actions. Different agents may have different information about which action is taking place, including higher-order information. We demonstrate that such information changes require subtle descriptions. The contribution of our paper is that it provides a complete axiomatization for an action language of van Ditmarsch, where an action is interpreted as a relation between states and sets of states. The applicability of the framework is found in every context where multiagent strategic decision making is at stake, and already demonstrated in game-like scenarios such as Cluedo and card games.
Bringing 3D to Teleradiology
Venue: Proceedings of the International Conference on Information Visualisation (2000)

The NOVICE project (Network-Oriented Visualization in a Clinical Environment) is developing a system for medical image data analysis and visualization through the web with the intention of demonstrating the effectiveness of such a system in a clinical environment. One element being addressed by NOVICE is the provision of teleradiology tools. This paper describes how three-dimensional models can be included in a teleradiology application by utilizing the Virtual Reality Modeling Language (VRML) and multi-user extensions, including annotation tools. The result is the world's first web-based system for 3D teleradiology! We will present a detailed overview of the implementation and operation of this system, and indicate results from early use.
Visual Data Flow Language Based on Iterative Constructs
Authors: Mikhail Auguston
Venue: Proceedings of the 8th Israeli Conference on Computer-Based Systems and Software Engineering (1997)

Iterative control constructs in data flow programming languages have always been a challenging part of language design. We suggest a solution for iterative processing in data flow diagrams based on the notion of a conditional data flow switch, and a specialized iterative constructs based on pattern matching for vectors, matrices, and multisets. All of these constructs can be seamlessly incorporated into a data flow visual programming language. We demonstrate how these constructs may be used to reveal the spatial/temporal dualism of data streams.