ppxscal/embedding_network huggingface dataset:
A simplified model for simulation and transformation of speech
Authors: B. H. Story, I. R. Titze, D. Wong
Venue: Proceedings of the 1996 IEEE International Joint Symposia on Intelligence and Systems (1996)

This paper explores a model that reduces speech production to the specification of four time varying parameters; F1 and F2, voice fundamental frequency (Fo), and a relative amplitude of the voice. The trajectory of the first two formants, F1 and F2, is treated in a series of coordinate pairs that are mapped from the F1F2 plane into a two-dimensional plane of "coefficients". These coefficients are multipliers of two empirically-based orthogonal basis vectors which, when added to a neutral vowel area function, will produce a new area function with the desired locations of F1 and F2. Thus, area functions and voice parameters extracted at appropriate time intervals can be fed into a speech simulation model to recreate the original speech. A transformation of the speech can also be imposed by manipulating the area function and voice characteristics prior to the recreation of speech by simulation. The model has initially been developed for vowel-like speech utterances but the effect of consonants on the F1F2 trajectory is also briefly addressed.
A visual query interface for a customisable schema visualisation system
Authors: A. P. Madurapperuma, W. A. Gray, N. J. Fiddian
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

Resolving different levels of heterogeneity present in heterogeneous database environments is a subject that has been addressed in a number of research projects. Graphical user interfaces are becoming the de-facto form of user interface in many application areas, including database management systems. The use of a popular visualisation notation to present schemas at an abstract level and to permit direct user manipulation of this visualisation in formulating queries is one of the most widespread approaches to providing database graphical user interfaces. The existence of a variety of visualisation notations (which are in common use to visualise schemas) introduces additional heterogeneity to a distributed system, in visual representation at the end-user interface level. This paper describes the use of meta-programming techniques which are applied to resolve this visual model heterogeneity on existing databases, by allowing a user to select a preferred visualisation notation, both to view the schema and to query the database.
A Critical Look at Three of Parallel Computing's Maxims
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

This paper takes a critical look at the following three maxims.1. Parallel architecture is converging on a design based on commodity microprocessor chips. 2. Wormhole routing is decidedly more efficient than store-and-forward routing. 3. The PRAM is an unrealistically ideal model of computation.
External Sorting: Run Formation Revisited
Authors: Per-Ake Larson
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

External mergesort begins with a run formation phase creating the initial sorted runs. Run formation can be done by a load-sort-store algorithm or by replacement selection. A load-sort-store algorithm repeatedly fills available memory with input records, sorts them, and writes the result to a run file. Replacement selection produces longer runs than load-sort-store algorithms and completely overlaps sorting and I/O, but it has poor locality of reference resulting in frequent cache misses and the classical algorithm works only for fixed-length records. This paper introduces batched replacement selection: a cache-conscious version of replacement selection that works also for variable-length records. The new algorithm resembles AlphaSort in the sense that it creates small in-memory runs and merges them to form the output runs. Its performance is experimentally compared with three other run formation algorithms: classical replacement selection, Quicksort, and AlphaSort. The experiments show that batched replacement selection is considerably faster than classic replacement selection. For small records (average 100 bytes), CPU time was reduced by about 50 percent and elapsed time by 47-63 percent. It was also consistently faster than Quicksort, but it did not always outperform AlphaSort. Replacement selection produces fewer runs than Quicksort and AlphaSort. The experiments confirmed that this reduces the merge time whereas the effect on the overall sort time depends on the number of disks available.
Making Use of Ruby
Authors: Suresh Mahadevan
Venue:  (2002)

:A hands-on introduction to a powerful, easy-to-use scripting languageRuby's clear and clever syntax makes it an excellent choice for beginners, while its speed and extensibility makes it extremely useful for experienced developers. This up-and-coming scripting language is compact, fast, powerful, and yet, surprisingly simple to use. Suresh Mahadevan offers you a detailed introduction to this open source language and explains how it can save programmers considerable time during program development because no compilation and linking is necessary. With its built-in interfaces to Java, Perl, and Python, Ruby is well suited for writing text prototypes, mathematics, and many other everyday programming tasks. Packed with real-world examples and advice on how to move beyond the samples to tackle specific tasks, this excellent resource also includes end-of-chapter reviews and exercises to help you master the many possibilities of Ruby.With numerous real-world examples and expert advice, this book:Provides a concise and task-oriented introduction to RubyHelps you evaluate the suitability of Ruby for your projectIs a practical introduction to Ruby's syntax and fundamental strengthsIncludes numerous working scripts, with information on how to adapt and extend them to meet individual needsThe companion Web site contains:All source code from the bookFrequently asked questions, quizzes, and best practicesLinks to other Ruby sites
Design and implementation of a QoS capable switch-router
Authors: E. Basturk, A. Birman, G. Delp, R. Guerin, R. Haas, S. Kamar, D. Kandlur, P. Pan, D. Pendarakis, V. Peris, R. Rajan, D. Saha, D. Williams
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

An important challenge for the future growth of the Internet is to design routers that can forward the exponentially increasing volume of traffic, and at the same time provide the service differentiation needed by new applications. In this paper, we describe the architecture, implementation, and initial experiences with a system designed to meet this challenge. This system, which we call a QoS capable switch-router (QSR), combines the salient features of switching and routing technologies to provide high throughput and support the different classes of service being defined by the IETF. It consists of a core (ATM) switch fabric connecting intelligent adapters, each capable of both routing and switching pockets. A control engine is responsible for routing, RSVP signalling, and resource management. We have built a prototype network of 3 systems connected to several UNIX hosts, and have conducted preliminary performance measurements on this network.
Stochastic Differential Equations In Transport Moment Equations
Authors: D. W. Dean
Venue:  (2000)

In previous reports (cf. Dean and Russell, Dean), the application of stochastic differential equations to transport in porous media is discussed. The methods described in those reports can be used in a Monte Carlo setting to develop estimates of the statistical moments of the contaminant plumes''s probability distribution. A second method of developing this type of statistical information is to derive a system of partial differential equations in which the statistical moments appear as the independent variables to be determined. This report describes the application of the Ito theory to the development of a system of partial differential equations in terms of the first and second moments. As applications of this method, two examples are given. The first application uses the results of the theory to derive a system of moment equations as found in Graham And McLaughlin. For comparison purposes, this system is derived in an ad hoc manner in Section 2 using the method of distributed parameters. The second example uses the theoretical moment equations to incorporate the effects of measurement error in a concentration covariance equation.
Lego Mindstorms Masterpieces: Building and Programming Advanced Robots
Authors: Mario Ferrari, Giulio Ferrari, Kevin Clague, Hideaki Yabuki, Doug Carlson
Venue:  (2003)

:LEGO MINDSTORMS MASTERPIECES is composed of three fundamental sections. Part One is a review of the advanced robot-building concepts and theories.·Part Two consists of step-by-step building instructions for a series of complex models. The companion programming code is included, along with in-depth explanations of concepts needed for the specific models. Robots include Line Followers, Bipeds, Stair and Wall Climbers, a Joystick Controlled Cannon, a Robotic Game Player, a Plant Waterer, and a Drink Mixer. Part Three contains ideas for modifying the building instructions by expanding the pieces and kits. Topics covered include behavior, motion, interaction, automation, and calculus.
On Regularity-Preserving Functions
Authors: Dexter Kozen
Venue:  (1995)

We give a characterization of regularity-preserving functions.
Power-Aware Prefetch in Mobile Environments
Authors: Liangzhong Yin, Guohong Cao, Chita Das, Ajeesh Ashraf
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Most of the prefetch techniques used in the current cache management schemes do not consider the power constraints of the mobile clients and other factors such as the size of the data items, the data access rate, and the data update rate. In this paper, we address these issues by proposing a power-aware prefetch scheme, called value-based adaptive prefetch (VAP) scheme. The VAP scheme defines a value function which can optimize the prefetch cost to achieve better performance. Also, VAP dynamically adjusts the number of prefetches based on the current energy level to prolong the system running time. As stretch is widely adopted as a performance metric for variable-size data requests, we show by analysis that the proposed algorithm can indeed achieve the optimal performance in terms of stretch when power consumption is considered. Simulation results demonstrate that our algorithm significantly outperforms existing prefetching algorithms under various scenarios.
On the pagination of complex documents
Authors: Anne Brüggemann-Klein, Rolf Klein, Stefan Wohlfeil
Venue: Computer Science in Perspective: Essays Dedicated to Thomas Ottmann (2003)

The pagination problem of complex documents is in placing text and floating objects on pages in such a way that each object appears close to, but not before, its text reference. Current electronic formatting systems do not offer the pagination quality provided by human experts in traditional bookprinting.One reason is that a good placement of text and floating objects cannot be achieved in a single pass over the input. We show that this approach works only in a very restricted document model; but in a realistic setting no online algorithm can approximate optimal pagination quality.Globally computing an optimal pagination critically depends on the measure of quality used. Some measures are known to render the problem NP-hard, others cause unwanted side effects. We propose to use the total number of page turns necessary for reading the document and for looking up all referenced objects. This objective function can be optimized by dynamic programming, in time proportional to the number of text blocks times the number of floating objects. Our implementation takes less than one minute for formatting a chapter of 30 pages. The results compare favorably with layouts obtained by Word, FrameMaker, or LATEX, that were fine-tuned by expert users.
A Method for Deforming Polygonal Shapes into Smooth Spline Surface Models
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

This paper describes a new spline formulation that supports deformation of polygonal shapes into smooth spline surface models. Once a polygonal shape with underlying rectangular topology is specified by the user, it is deformed into a smooth surface that interpolates all the polygonal vertices. The user can then modify the default smooth surface by increasing or decreasing the amount of deformation, either globally or locally. This is accomplished by interactively controlling the shape parameters associated with the polygonal vertices. This modeling paradigm is conceptually simple, and allows C2 continuous surfaces to be easily designed, even by a novice user.
Timeliness of Service Discovery in DEAPspace
Authors: Michael Nidd
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

A new algorithm is presented, through which a computing device can detect the presence of neighboring devices, share configuration and service information with those devices, and notice when devices become unavailable. Targeted for wireless ad-hoc, single-hop networks, this solution reduces the number of transmissions required from individual devices. The effectiveness of this algorithm is demonstrated through comparison with others that achieve similar goals.
Multiprocessor File System Interfaces
Authors: David Kotz
Venue:  (1992)

Increasingly, file systems for multiprocessors are designed with parallel access to multiple disks, to keep I/O from becoming a serious bottleneck for parallel applications. Although file system software can transparently provide high-performance access to parallel disks, a new file system interface is needed to facilitate parallel access to a file from a parallel application. We describe the difficulties faced when using the conventional (Unix-like) interface in parallel applications, and then outline ways to extend the conventional interface to provide convenient access to the file for parallel programs, while retaining the traditional interface for programs that have no need for explicitly parallel file access. Our interface includes a single naming scheme, a multiopen operation, local and global file pointers, mapped file pointers, logical records, multifiles, and logical coercion for backward compatibility.
Fault Recovery for a Distributed QoS-Based Multicast Routing Algorithm
Authors: Hasan Ural, Keqin Zhu
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

This paper proposes a new minimum spanning tree (MST) based distributed QoS-based multicast routing algorithm which is capable of constructing a delay constrained multicast tree when node failures occur during the tree construction period and recovering from any node failure in a multicast tree during the on-going multicast session without interrupting the running traffic on the unaffected portion of the tree. The proposed algorithm performs the failure recovery efficiently, which gives better performance in terms of the number of exchanged messages and the convergence time than the existing MST based distributed multicast routing algorithms.
Determining WWW User''s Next Access and Its Application to Pre-fetching
Authors: Carlos R. Cunha, Carlos F.B. Jaccoud
Venue:  (1997)

Abstract World-Wide Web (WWW) services have grown to levels where significant delays are expected to happen. Techniques like pre-fetching are likely to help users to personalize their needs, reducing their waiting times. However, pre-fetching is only effective if the right documents are identified and if user''s move is correctly predicted. Otherwise, pre-fetching will only waste bandwidth. Therefore, it is productive to determine whether a revisit will occur or not, before starting pre-fetching. In this paper we develop two user models that help determining user''s next move. One model uses Random Walk approximation and the other is based on Digital Signal Processing techniques. We also give hints on how to use such models with a simple pre-fetching technique that we are developing. This is an extended version of the article with the same title presented in the International Symposium on Computers and Communication''97, Alexandria, Egypt, 1-3 July, 1997.
Characterizing NP and Measuring Instance Complexity
Authors: Stephen Judd
Venue:  (1990)

A generic NP-complete graph problem is described. The calculation of certain predicate on the graph is shown to be both necessary and sufficient to solve the problem and hence the calculation must be embedded in every algorithm solving NP problems. This observation gives rise to a metric on the difficulty of solving an instance of the problem. There appears to be an interesting phase transition in this metric when the graphs are generated at random in a "2-dimensional" extension. The metric is sensitive to 2 parameters governing the way graphs are generated: p, the density of edges in the graph, and K, related to the number of points in the graph. The metric seems to be finite in part of the (p,K)-space and infinite in the rest. If true, this phenomenon would demonstrate that NP-complete problems are truly monolithic and can easily exhibit strong intrinsic coupling of their variables throughout the entire instance.
Detection of access control flaws in a distributed database system with local site autonomy
Authors: Y. Temtanapat, D. L. Spooner
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

We address the authorization of access privileges to users in a local database management system (DBMS) that is interoperating in a distributed database system (DDBMS). Our focus is on the potential in a next generation security system for delegation access concepts such as role hierarchy delegation to violate the security policy in a local database system that is part of the distributed system. This kind of violation can be categorized as a violation of local autonomy. We propose a labeled graph model to detect such a problem.
Workshop on Graphical Documentation for Programmers: Assessing the Efficacy of UML Diagrams for Program Understanding
Authors: Shihong Huang, Scott Tilley
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

Programmers often use graphical forms of documentation that rely on software visualization techniques to make complicated information easier to understand. However, it is an open question exactly which types of graphical documentation are most suitable for which types ofprogram understanding tasks (and in which specific usage contexts). The Unified Modeling Language (UML) is the de facto standard for modeling modern software applications. This workshop (the fourth in a series on graphical documentation for programmers) focuses ondiscussing techniques for the efficacy of UML diagrams in aid of program understanding. The majority of the workshop will involve participants analyzing a series of UML diagrams and answering a detailed questionnaire concerning a hypothetical software system.
Applying the Local Computation Framework to Classical and Non-Classical Logics
Authors: Jerome Mengin, Nic Wilson
Venue:  (1997)

Algorithms to propagate uncertainty using Shenoy and Shafer''s Local Computation framework give rise to efficient computation in a number of spheres of reasoning, such as Bayesian probability, Dempster-Shafer Belief, infinitesimal probability functions, and Zadeh''s Possibility functions. Finite sets of possibilities (or constraints) can be propagated with this framework, and so deduction in a finite propositional calculus can be performed by considering sets of possible worlds. Recently Kohlas and Moral have shown how to use Local Computation to directly propagate sets of formulae in clausal form in a finite propositional calculus. In this report we explore the application of the Local Computation framework to other logics. We describe how a logic can be embedded in the framework, given that its semantics verifies certain properties. This is applied to first-order predicate calculus, modal and conditional logics. We also discuss its application to predicate circumscription.
Timing and Design Closure in Physical Design Flows
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

A physical design flow consists of producing a production-worthy layout from a gate-level netlist subject to a set of constraints. This paper focuses on the problems imposed by shrinking process technologies. It exposes the problems of timing closure, signal integrity, design variable dependencies, clock and power/ground routing, and design signoff. It also surveys some physical design flows, and outlines a refinement-based flow.
The Output Permutation for the Multiple-Valued Logic Minimization with Universal Literals
Authors: Takahiro Hozumi, Osamu Kakusho, Yutaka Hata
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

This paper shows the effectiveness of an output permutation for the implementation of current-mode CMOS circuits. A combination of a simple function and an output permutation can realize a difficult function and cost for the combination will be lower than the cost for a difficult function. The output permutation can be realized by a universal literal and we can calculate the cost. We first examine the all combinations of universal literals and output permutations and show that some combinations can realize one-variable functions with lower costs. Next, we minimize two-variable functions and compare the costs with the costs obtained by some output permutations. As the result, we show that about 70% functions can reduce the costs and their reduction ratio is about 12% on average.
Dynamic effects of high speed trains on underpasses
Authors: A. Fraile, L. Hermanns, F. Chirino, E. Alarcón
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The paper describes a simplified method to get the response of culverts to the moving loads due to the crossing of high-speed trains. Although the solution is technically advantageous to avoid certain resonance problems that can affect the ballast stability when other typologies are used, its analysis are relatively complicated due to the important dynamic interaction effects between the culvert and the surrounding soil.The main intention of the work is the validation of a simple procedure with which to develop parametric studies that could conduct to recommendations for design practice.
Wearable Computing Meets Ubiquitous Computing: Reaping the Best of Both Worlds
Authors: Bradley J. Rhodes, Nelson Minar, Josh Weaver
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

This paper describes what we see as fundamental difficulties in both the pure ubiquitous computing and pure wearable computing paradigms when applied to context-aware applications. In particular, ubiquitous computing and smart room systems tend to have difficulties with privacy and personalization, while wearable systems have trouble with localized information, localized resource control, and resource management between multiple people. These difficulties are discussed, and a peer-to-peer network of wearable and ubiquitous computing components is proposed as a solution. This solution is demonstrated through several implemented applications.