ppxscal/embedding_network huggingface dataset:
Error recovery in a blended style eye gaze and speech interface
Authors: Yeow Kee Tan, Nasser Sherkat, Tony Allen
Venue: Proceedings of the 5th international conference on Multimodal interfaces (2003)

In the work carried out earlier [1][2], it was found that an eye gaze and speech enabled interface was the most preferred form of data entry method when compared to other methods such as mouse and keyboard, handwriting and speech only. It was also found that several non-native United Kingdom (UK) English speaking speakers did not prefer the eye gaze and speech system due to the low success rate caused by the inaccuracy of the speech recognition component. Hence in order to increase the usability of the eye gaze and speech data entry system for these users, error recovery methods are required. In this paper we present three different multimodal interfaces that employ the use of speech recognition and eye gaze tracking within a virtual keypad style interface to allow for the use of error recovery (re-speak with keypad, spelling with keypad and re-speak and spelling with keypad). Experiments show that through the use of this virtual keypad interface, an accuracy gain of 10.92% during first attempt and 6.20% during re-speak by non-native speakers in ambiguous fields (initials, surnames, city and alphabets) can be achieved [3]. The aim of this work is to investigate whether the usability of the eye gaze and speech system can be improved through one of these three multimodal blended multimodal error recovery methods.
Additive Tree Spanners
Authors: Dieter Kratsch, Hoàng-Oanh Le, Haiko Müller, Erich Prisner, Dorothea Wagner
Venue: SIAM Journal on Discrete Mathematics (2004)

A spanning tree of a graph is a k-additive tree spanner whenever the distance of every two vertices in the graph differs from that in the tree by at most k. In this paper we show that certain classes of graphs, such as distance-hereditary graphs, interval graphs, asteroidal triple-free graphs, allow some constant k such that every member in the class has some k-additive tree spanner. On the other hand, there are chordal graphs without a k-additive tree spanner for arbitrarily large k.
Partial Functions in ACL2
Authors: Panagiotis Manolios, J. Strother Moore
Venue: Journal of Automated Reasoning (2003)

We describe a method for introducing &ldquo;partial functions&rdquo; into ACL2, that is, functions not defined everywhere. The function &ldquo;definitions&rdquo; are actually admitted via the encapsulation principle: the new function symbol is constrained to satisfy the appropriate equation. This is permitted only when a witness function can be exhibited, establishing that the constraint is satisfiable. Of particular interest is the observation that every tail recursive definition can be witnessed in ACL2. We describe a macro that allows the convenient introduction of arbitrary tail recursive functions, and we discuss how such functions can be used to prove theorems about state machine models without reasoning about &ldquo;clocks&rdquo; or counting the number of steps until termination. Our macro for introducing &ldquo;partial functions&rdquo; also permits a variety of other recursive schemes, and we briefly illustrate some of them.
Automating Checking of Models Built Using a Graphically Based Formal Modelling Language
Authors: Robert John Walters
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

RDT is a graphical formal modelling language inwhich the modeller works by constructing diagrams of theprocesses in their model which they then join together toform complete systems. Aside from the benefits whichaccrue as a side effect of building a formal model of aproposed system, these diagrammatic models can be usefulas a means of communication between the developmentteam and the users. However one of the greatestbenefits of a formal model is that it can be subjected torigorous examination to ensure that it satisfies propertiesrequired of the system.This paper describes the transformation used by theRDT toolset to generate Promela code (the input languageof the SPIN model-checker) automatically from amodel.
Lattice path matroids: enumerative aspects and Tutte polynomials
Authors: Joseph Bonin, Anna de Mier, Marc Noy
Venue: Journal of Combinatorial Theory Series A (2003)

Fix two lattice paths P and Q from (0,0) to (m, r) that use East and North steps with P never going above Q. We show that the lattice paths that go from (0,0) to (m, r) and that remain in the region bounded by P and Q can be identified with the bases of a particular type of transversal matroid, which we call a lattice path matroid. We consider a variety of enumerative aspects of these matroids and we study three important matroid invariants, namely the Tutte polynomial and, for special types of lattice path matroids, the characteristic polynomial and the β invariant. In particular, we show that the Tutte polynomial is the generating function for two basic lattice path statistics and we show that certain sequences of lattice path matroids give rise to sequences of Tutte polynomials for which there are relatively simple generating functions. We show that Tutte polynomials of lattice path matroids can be computed in polynomial time. Also, we obtain a new result about lattice paths from an analysis of the β invariant of certain lattice path matroids.
Scalable sender access control for bi-directional multicast routing
Authors: Ning Wang, George Pavlou
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

Bi-directional shared tree is an efficient routing scheme for interactive multicast applications with multiple sources. Given the open-group IP multicast service model, it is important to support sender access control in order to prevent group members from receiving irrelevant data, and also to protect the multicast tree from denial-of-service (DoS) attacks. Compared with source specific and uni-directional shared trees, where information sources can be authorized or authenticated at the single root or rendezvous point (RP), in bi-directional trees this problem is more pronounced since hosts can send data to the shared tree from any point in the network. In this paper we propose a scalable sender access control policy mechanism for bi-directional shared trees so that irrelevant data is policed and discarded once it arrives at an on-tree router. We consider both intra- and inter-domain routing, so that the mechanism can cope with large-scale multicast applications or many concurrent multicast sessions across multiple administrative domains.
Using a high level language as a cross assembler
Authors: Paul Rutter
Venue: ACM SIGPLAN Notices (1981)

This paper describes how existing high level languages can be used to simplify assembling moderate size programs for new machines. A cross assembler for the Motorola 68000 has been built using these ideas. 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
From the Editors: New World Order
Authors: Edward Grossman
Venue: Queue (2003)

It seems that wherever you turn these days you read another headline about the increasing popularity of outsourcing software development. On a whim, I stopped by Google’s news page where a search of “outsourcing software development” produced eight stories on the first page written in the last 24 hours (with the remaining two not significantly older than that). No surprise, the headlines include such frenzied folly as “outsourcing craze,” “job fears,” and the latest entrant—“backlash.” That last one is enough to trip my sensors that global software development outsourcing is a cemented new feature of the landscape. Once there’s a backlash to something, you know it has fully arrived.
Fuzzy modeling of manufacturing and logistic systems
Authors: P. V. Sevastjanov, P. Róg
Venue: Mathematics and Computers in Simulation (2003)

The basic paradigm of simulation is the probabilistic approach to describing real world uncertainty. However, in many cases we do not have an information that would be precise enough to build the corresponding probabilistic model or there are some human factors that prevent doing so. In such situations the mathematical tools of fuzzy set theory may be successfully used. It seems that the simplest and natural way to do this is to replace in our model the probability densities by the similar fuzzy intervals, but some inherent problems of fuzzy arithmetic must be resolved first to build adequate fuzzy models. The main problem is the comparison of fuzzy intervals. The paper presents a new method of crisp and fuzzy interval comparison (ordering), based on the probabilistic approach. We assume that the fuzzy numbers are represented as ordered α-level set. This makes it possible to take into account all the cases of intervals location and intersection as well as the case of ordering of interval and real number. The probabilistic approach is used only to infer the set of formulae for deterministic quantitative estimation of degree in which an interval is less than or equal to another interval. The measure of such a degree may be formally treated as probability, but the term "possibility" can also be used, as it good reflects the sense of interval relation in practical cases. On the basis of the proposed crisp and fuzzy interval comparison method and the usual fuzzy extension procedure, the technique for fuzzy modeling was elaborated. To illustrate its efficiency, the simple examples of fuzzy modeling of manufacturing and logistic systems are considered in comparison with the usual simulation results.
Coverage Criteria for Logical Expressions
Authors: Paul Ammann, Jeff Offutt, Hong Huang
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

A large number of coverage criteria to generate testsfrom logical expressions have been proposed. Althoughthere have been large variations in the terminology, thearticulation of the criteria and the original source ofthe expressions, many of these criteria are fundamentallythe same. The most commonly known and widelyused criterion is that of Modified Condition DecisionCoverage (MCDC), but some articulations of MCDChave had some ambiguities. This has led to confusionon the part of testers, students, and tool developers onhow best to implement these test criteria. This paperpresents a complete comprehensive set of criteriathat incorporate all the existing criteria, and eliminatesthe ambiguities by introducing precise definitions of thevarious possibilities.
Rule-based crowds: generation, animation, cloth and rendering of 15.000 unique human characters
Authors: Stephan Trojansky
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

Scanline is currently developing the proprietary crowd-simulation tool "Sheep". It is designed to generate mass scenes with 15.000 different characters, animate them by an unlimited amount of rules, supply presimulated cloth and render a whole shot in a single layer taking less than 45 minutes. This will disclose completely new dimensions for the realization of Visual Effects with mass sequences.
A generative approach to framework instantiation
Authors: Vaclav Cechticky, Philippe Chevalley, Alessandro Pasetti, Walter Schaufelberger
Venue: Proceedings of the 2nd international conference on Generative programming and component engineering (2003)

This paper describes the <i>OBS Instantiation Environment</i>, which demonstrates a generative approach to automating the instantiation process of a component-based framework. The process is automated in the sense that designers configure and assemble the framework components using intuitive visual operations in a GUI-based environment. Their configuration actions are then used to automatically generate the framework instantiation code. Generative techniques for framework instantiation are not new but tend to rely on domain-specific languages or on bespoke specification encoding and compilation techniques. Though effective and powerful, they are comparatively complex and present a high barrier to entry for general users. The distinctive feature of the approach proposed here is instead its simplicity and its reliance on mainstream technology and tools.
Automated test pattern generation for the Cathedral-II/2nd architectural synthesis environment
Authors: Jos van Sas, Francky Catthoor, Peter Vandeput, Frank Rossaert, Hugo De Man
Venue: Proceedings of the conference on European design automation (1991)

The CAD implementation of a testability strategy for chips as designed with the Cathedral-II/2nd silicon compilation environment is presented. Emphasis will be on the software tools accomplishing the test assembly. These tools are fully integrated with synthesis, place and route and module generation programs. The hierarchy present in the design has been exploited to assemble the test patterns in an hierarchical way. Our approach allows to arrive at a fully testable chip, with a very high fault coverage.
A Fast Two-Way IP Lookup Algorithm Based Multibit-Trie
Authors: Jinpeng Jia, Chuang Lin, Weidong Liu
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Due to the rapid growth of traffic in the Internet, backbone links of several gigabits per second are commonly deployed, which means backbone routers must be able to forward millions of packets per second. One of the most important steps of routing is lookup in the routing table, which is also the bottleneck in high-speed routing process. Some traditional IP lookup algorithms are focused at memory consumption, searching speed or update complexity respectively, with which we design an evaluation function to make this tradeoff. This evaluation function provides a new method to measure the integrated performance of routing lookup algorithm. Finally we provide a fast Two-Way IP lookup algorithm based multibit-trie, which makes one single lookup to the IP address to be processed in parallelism. In this article,we have analyzed the algorithm complexity in two aspects: memory using and lookup speed. Furthermore, we compare the performance of our Two-Way IP lookup algorithm with some former classic algorithms. The analytical result indicates the Two-Way algorithm has more superiority than other software lookup algorithms in integrated performance.
Application of a content-based percussive sound synthesizer to packet loss recovery in music streaming
Authors: Lonce Wyse, Ye Wang, Xinglei Zhu
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

This paper presents a novel method to recover lost packets in music streaming using a synthesizer to generate percussive sounds. As an improvement of the state-of-the-art system that uses a content-based audio codebook, the new method can greatly reduce the redundant information needed to recover perceptually critical lost packets.
Comparing Program Phase Detection Techniques
Authors: Ashutosh S. Dhodapkar, James E. Smith
Venue: Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture (2003)

Detecting program phase changes accurately is an importantaspect of dynamically adaptable systems. Threedynamic program phase detection techniques are compared- using instruction working sets, basic block vectors(BBV), and conditional branch counts. Because programphases are difficult to define, we compare the techniquesusing a variety of metrics.BBV techniques perform better than the other techniquesproviding higher sensitivity and more stablephases. However, the instruction working set techniqueyields 30% longer phases than the BBV method, althoughthere is less stability within phases. On average, the methodsagree on phase changes 85% of the time. Of the 15%of time they disagree, the BBV method is more efficient atdetecting performance changes. The conditional branchcounter technique provides good sensitivity, but is lesseffective at detecting major phase changes. Nevertheless,the branch counter technique correlates 83% of the timewith the BBV based technique. As an auxiliary result, weshow that techniques based on procedure granularities donot perform as well as those based on instruction or basicblock granularities. This is mainly due to their inability todetect changes within procedures.
View planning for BRDF acquisition
Authors: Jochen Lang, Hans-Peter Seidel, Hendrik P. A. Lensch
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

The estimation of the bi-directional reflectance distribution function (BRDF) of a 3D object requires reflectance measurements under numerous viewing and lighting directions. This sketch summarizes our method to select advantageous directions. Uncertainty minimization of the estimated BRDF parameters forms the theoretical underpinning of our acquisition planner. Our hardware-accelerated planner can aid manual and automatic measurement, reduces measurement effort and increases the quality of the acquired models.
Accelerated test pattern generation by cone-oriented circuit partitioning
Authors: T. Grüning, U. Mahlstedt, W. Daehn, C. Özcan
Venue: Proceedings of the conference on European design automation (1990)

In this paper an efficient cone oriented circuit partitioning method is presented, which significantly speeds up automatic test pattern generation for combinational circuits. The advantages gained by the proposed partitioning method are based on the increase in the number of dominators in the circuit graph. In contrast to conventional ATPG working on the unpartitioned circuit test generation is less time consuming now and redundancies can often be identified without any backtracks. Experimental results illustrate the superiority of the cone oriented partitioning approach. Independent of the underlying ATPG algorithm the cone oriented partitioning results on average in a performance increase by more than a factor of 2.
The power-method: a comprehensive estimation technique for multi-dimensional queries
Authors: Yufei Tao, Christos Faloutsos, Dimitris Papadias
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Existing estimation approaches for multi-dimensional databases often rely on the assumption that data distribution in a small region is uniform, which seldom holds in practice. Moreover, their applicability is limited to specific estimation tasks under certain distance metric. This paper develops the Power-method, a comprehensive technique applicable to a wide range of query optimization problems under various metrics. The Power-method eliminates the local uniformity assumption and is accurate even in scenarios where existing approaches completely fail. Furthermore, it performs estimation by evaluating only one simple formula with minimal computational overhead. Extensive experiments confirm that the Power-method outperforms previous techniques in terms of accuracy and applicability to various optimization scenarios.
A Multi-View Tool for Checking the Security Semantics of Router Configurations
Authors: Holger Peine, Reinhard Schwarz
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

Routers are critical components of IP networks, buthardly any tool support for analyzing their security exists todate. We have developed such a tool, named CROCODILE,that tracks the security implications of related configurationdirectives that may be scattered all over the router's configuration,instead of analyzing only isolated configurationclauses like other tools do. Our tool offers several novel evaluationcapabilities and presents its findings as a collectionof multi-view displays, enabling the user to focus on selectedaspects, and to navigate deeper and deeper into specificdetails. We demonstrate the practical use of CROCODILE,and a comparison with the well-known RAT tool illustratesCROCODILE's remarkable capabilities.
Impact Studies and Sensitivity Analysis in Medical Data Mining with ROC-based Genetic Learning
Authors: Michèle Sebag, Jérôme Azé, Noël Lucas
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

ROC curves have been used for a fair comparison of machinelearning algorithms since the late 90's. Accordingly,the area under the ROC curve (AUC) is nowadays considereda relevant learning criterion, accommodating imbalanceddata, misclassification costs and noisy data.This paper shows how a genetic algorithm-based optimizationof the AUC criterion can be exploited for impactstudies and sensitivity analysis.The approach is illustrated on the Atherosclerosis Identificationproblem, PKDD 2002 Challenge.
Integrating a simulation-visualisation environment in a basic distributed systems course: a case study using LYDIAN
Authors: Boris Koldehofe, Marina Papatriantafilou, Philippas Tsigas
Venue: ACM SIGCSE Bulletin (2003)

Distributed algorithms can be difficult to understand as well as to teach. A way to provide students with an experience of the execution of a distributed algorithm is the use of a simulation-visualisation environment. In this work we present a case study of integrating a simulation-visualisation environment into a distributed system course. We evaluate a distributed system assignment in which students used LYDIAN, an extensible library for distributed algorithms and animations, to implement their algorithms. In our study neither the teachers nor the students had earlier class experience with LYDIAN. The feedback received gives valuable information on what simulation-visualisation environments for distributed algorithms need to provide in order to be successfully used in class. We are not aware of any similar study in the area of distributed computing. However, the feedback we have received shows the significance of such evaluations to help users improve their performance and help them to acknowledge the wealth of tools they are provided.
Differential volume rendering: a fast volume visualization technique for flow animation
Authors: Han-Wei Shen, Christopher R. Johnson
Venue: Proceedings of the conference on Visualization '94 (1994)

We present a direct volume rendering algorithm to speed up volume animation for flow visualizations. Data coherency between consecutive simulation time steps is used to avoid casting rays from those pixels retaining color values assigned to the previous image. The algorithm calculates the differential information among a sequence of 3D volumetric simulation data. At each time step the differential information is used to compute the locations of pixels that need updating and a ray-casting method is utilized to produce the updated image. We illustrate the utility and speed of the differential volume rendering algorithm with simulatin data from computational bioelectric and fluid dynamics applications. We can achieve considerable disk-space savings and nearly real-time rendering of 3D flows using low-cost, single processor workstations* for models which contain hundreds of thousands of data points.