ppxscal/embedding_network huggingface dataset:
LVCSR-based language identification
Authors: T. Schultz
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

Automatic language identification is an important problem in building multilingual speech recognition and understanding systems. Building a language identification module for four languages we studied the influence of applying different levels of knowledge sources on a large vocabulary continuous speech recognition (LVCSR) approach, i.e. phonetic, phonotactic, lexical, and syntactic-semantic knowledge. The resulting language identification (LID) module can identify spontaneous speech input and can be used as a front end for the multilingual speech-to-speech translation system JANUS-II. A comparison of five LID systems showed that the incorporation of lexical and linguistic knowledge reduces the language identification error for the 2-language tests up to 50%. Based on these results we build a LID module for German, English, Spanish, and Japanese which yields 84% identification rate on the spontaneous scheduling task (SST).
SurfWave: an object-oriented class library for wavelet analysis
Authors: J. M. Adler
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

This paper addresses the design and development of a software environment for experimenting with filter banks, wavelets, and wavelet packets. An object-oriented class library, called SurfWave, is developed that provides a straightforward interface for experimenting and applying wavelet theory. SurfWave uses the power of C++ for efficiency and ease-of-use by isolating the user from distracting software and hardware peculiarities. It can be easily modified to provide new functionality, i.e., support for new cost functions, optimization algorithms, filter bank topologies, etc. SurfWave is available on several platforms (Unix, PC/Windows, Macintosh) and languages (C++, Matlab, CPX), presenting a uniform "point-of-departure" to the widest cross-section of wavelet enthusiasts.
Spontaneous dialogue speech recognition using cross-word context constrained word graphs
Authors: T. Shimizu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

This paper proposes a large vocabulary spontaneous dialogue speech recognizer using cross-word context constrained word graphs. In this method, two approximation methods "cross-word context approximation" and "lenient language score smearing" are introduced to reduce the computational cost for word graph generation. The experimental results using a "travel arrangement corpus" show that this recognition method achieves a word hypotheses reduction of 25-40% and a cpu-time reduction of 30-60% compared to without approximation, and that the use of class bigram scores as the expected language score for each lexicon tree node decreases the word error rate 25-30% compared to without approximation.
Teaching computer programming courses in a computer laboratory environment
Authors: A. Azemi
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

The usual approach in teaching introductory computer-programming courses is to have a classroom lecture component and a supervised laboratory module, where students will write simple programs reflective of the material that they have learned during the lecture. Although this method may work very well for some subjects, it may not be the best way to teach introductory computer courses. This work describes our new approach in teaching undergraduate computer programming courses in a computer laboratory environment at the Delaware County Campus of the Pennsylvania State University. It consists of putting typed lecture notes, and example programs in our local computer network and conducting the class lectures in the computer laboratory. We also discuss the advantages and disadvantages of conducting a computer programming course in the form that was described before, covering instructor's comments and students' reactions, as well as possible improvements.
Laptop Enabled Active Learning in the Software Engineering Classroom: An Experience Report
Authors: Dan Port, Rick Kazman
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

Over the past four years the University of Hawaii has been steadily moving towards an "active learning" approach to software engineering education by replacing passive slide-show lectures with a series of short lectures followed by in-class exercises, enabled though the use of wireless networked laptops. In this paper we report on our experiences and early results with this approach. The results suggest that students like this approach more, do better, and evaluate the courses more positively.
Assessing the Efficacy of Variable Compliance Tactile Displays
Authors: Michael A. Taylor, Aaron R. Ferber, J. Edward Colgate
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

Tactile displays based on pin arrays are challenging to design because they require a large number of individually controllable pins, or "tactors". A semiactive approach such as variable compliance could lead to improvements in tactor density, power consumption, size, and weight. However, the effectiveness of such an approach at conveying information to the user has not previously been studied. This paper presents an experiment that compares the performance of height varying and compliance varying pin arrays. It was found that users of a variable compliance pin array took at least 1.41 times longer to determine the shape of a displayed object than when using a variable height pin array, and this decision time increases with tactor stiffness.
Two Improved Single Pattern Matching Algorithms
Authors: Chuanhan Liu, Yongcheng Wang, Derong Liu, Danglin Li
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

In this paper, two single pattern matching algorithms are presented, each of which is composed by a smallest suffix automaton and a forward finite state automaton. Whatever the suffix automaton or the forward finite state automaton is running, the window shifts m-R characters and then the suffix automaton starts running if no pattern prefix is found (R is zero) in the first algorithm or R is not greater than half of m in the second algorithm, otherwise, the forward finite state automaton starts running. Their time complexities are all O(n) in the worst case and O(n/m) in the best case. The experimental results show that the average time complexities of two algorithms are less than that of RF and LDM for short patterns and that of BM for long patterns over small alphabets or short lengths over large alphabets.
An extended model for interactive learning systems
Authors: M. Scherer
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

Our main interest consists in developing a concept to formalize interactive learning systems (ILS). The development of such a formalism has been motivated by different learning systems which were produced in our department. These systems were developed for commercial application as well as for lectures held at our university. In computer science there are some formal methods available for creating an abstract representation of interactive systems. In the late 1980s and early 1990s there were a large amount of publications in this special field, but only a few techniques have been left over. One approach is the model-based Vienna Development Method. A representation according to VDM specifies all data objects, defined as nodes, structures and networks as well as the different operations on them. A standard specification language is available (VDM-SL). We decided to use this method as a starting point for further developments. Our work shows that it is possible to build an abstract model for modern interactive learning systems which is able to support the development process and the maintenance of the system by formal means. 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
VR-Based Simulators for Training in Minimally Invasive Surgery
Authors: Cagatay Basdogan, Mert Sedef, Matthias Harders, Stefan Wesarg
Venue: IEEE Computer Graphics and Applications (2007)

Simulation-based training using VR techniques is a promising alternative to traditional training in minimally invasive surgery (MIS). Simulators let the trainee touch, feel, and manipulate virtual tissues and organs through the same surgical tool handles used in actual MIS while viewing images of tool-tissue interactions on a monitor as in real laparoscopic procedures.
Worst-case narrow-band interference over noisy dispersive channels
Authors: N. Al-Dhahir
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

The effect of narrow-band interference (NBI) on the finite blocklength throughput of linear noisy dispersive channels is studied. Spectral characteristics (both shape and frequency location) of worst-case NBI and its associated minimum channel block throughput are derived. The performance of finite-length linear and decision feedback equalizers in the presence of worst-case NBI is presented.
Weighted ACMA [array processing algorithm]
Authors: A.-J. van der Veen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

The analytical constant modulus algorithm (ACMA) is a deterministic array processing algorithm to separate sources based on their constant modulus. It has been derived without detailed regard to noise processing. In particular, the estimates of the beamformer are known to be asymptotically biased. In the present paper, we investigate this bias, and obtain a straightforward weighting scheme that will whiten the noise and remove the bias. This leads to improved performance for larger data sets.
A measure of testing effort
Authors: John D. McGregor, Satyaprasad Srinivas
Venue: Proceedings of the 2nd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 2 (1996)

Accurate estimates of the time and resources needed for a project are difficult to achieve. Numerous metrics have been proposed and a few have proved reliable in making these estimates. With the increased emphasis on quality and testing, estimates of the amount of effort required to test a product are a necessary part of any complete project estimate. Estimates of the effort to test object-oriented components and systems are particularly important because these components are often added to repositories to be used many times. The amount of effort required to test the component is related to its complexity. We consider several measures of method and class complexity and relate them to testability. The main focus of this research is to estimate the effort that is needed to test a class, as early as possible in the development process. We investigate the testability of a method in a class and indirectly estimate the effort that is needed to test a class. We define a concept termed the visibility component of a method. It is a measure of the accessibility of the information that must be inspected to evaluate the correctness of the execution of a method. We show that the testability of the method is a function of its visiblity component.
Using Continuous Queries for Event Filtering and Routing in Sparse MANETs
Authors: Katrine Stemland Skjelsvik, Jarle Soberg, Vera Goebel, Thomas Plagemann
Venue: Proceedings of the 11th IEEE International Workshop on Future Trends of Distributed Computing Systems (2007)

In our project, we design middleware services for emergency and rescue scenarios in sparse Mobile Ad- Hoc Networks (SMANETs). One of these services is a distributed event notification service (DENS) for asynchronous communication. The DENS architecture allows several subscription languages for different kinds of subscriptions. To support complex subscriptions, we use a Data Stream Management System (DSMS) for filtering of the data streams and matching of filtered events and subscriptions. We have designed a simple rescue scenario to investigate the possibilities of using a DSMS together with the DENS middleware layer. In this paper we discuss the design of our implementation and first experimental results of our ongoing work.
Personal behavior and virtual fragmentation
Authors: Tobias Fritsch, Jochen Schiller, Benjamin Voigt
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

In the last few years the importance of multiplayer games has seen an immense growth. On par with that, the virtual environments (VEs) increased in their size. Today there exist more than 120 MMOGs (Massive Multiplayer Online Games) ranging from FPS (first person shooter) to classic RPG (role playing game) settings. Such an evolution leads to the fact that players start to "live" in a virtual world. Thus each player at least partially merges with his character (playing figure) and acts in the virtual world. Nevertheless there can be huge gaps between ones real and virtual behavior. This paper uses a well balanced set of questions based on the psychological big5 model to show the mentioned gaps between real world and virtual world attitude. The underlying online survey models 30 selected questions about online and real world behavior. The results are stored in a database in order to statistically interpret them afterwards. The analysis includes correlations between deterministic values (such as age, nationality and gender) and traits of the big5 model (like surgery, emotional stability and conscientiousness). Furthermore it contains other surprising conclusions about the difference in behavior.
Querying time indexed information in mobile Ad hoc networks
Authors: De-Kai Liu, Chaiporn Jaikaeo, Chien-Chung Shen, Ren-Hung Hwang
Venue: Ad Hoc Networks (2007)

Time indexed information refers to information whose instance producing time is used as the search key for its access. One common scenario of querying time indexed information is to discover the information instance whose producing time is the closest to a given queried time. However, in the context of mobile ad hoc networks (MANETs), lack of infrastructure support, node mobility, and potential packet loss in wireless communications make querying time indexed information a challenging task. This paper describes a Self-Organizing Mechanism for querying Time indexed Information in MANETs, termed SOMTI. Using SOMTI, each instance producer h discovers routes to a set of instance producers whose instance producing times are the closest to a set of computed time points both before and after h's instance producing time. These routes form a web of search indices, which allow queries received by any instance producer to be forwarded in the manner of n-ary search for the instance producer whose instance producing time is the closest to the queried time. Both mathematical analysis and simulation study show that SOMTI is scalable with the number of nodes and the query producing rate. In addition, simulations results demonstrate that the goodness, in terms of the closeness to the queried time, of the discovered instance is always better than competing approaches under various node mobility speeds, query generation rates, and the number of nodes in the network, which demonstrates the effectiveness of SOMTI.
A novel approach to FM interference suppression in DS spread-spectrum communication systems
Authors: H. W. Fung
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

A new recursive technique for the excision of FM interference in DS spread-spectrum communication system is introduced. The proposed algorithm tabulates the jammer-corrupted received samples as a matrix to model a time-varying process. Input vectors are sent into the matrix to produce upon multiplication output vectors from which the frequency information in the matrix is deduced. The scheme resembles the familiar closed-loop frequency response estimation procedures in classical control theories. The estimated frequency then tunes an adaptive notch filter for interference suppression. The method provides more accurate IF estimates than given by the Wigner-Ville distribution and a performance close to notch filtering at the exact IF at a significantly lower computational requirement.
Analysis of failure modes and mechanisms in thermally actuated micromachined relays for harsh environments space applications
Authors: A. Teverovsky, Ashok Sharma
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

This paper reports test results on electrical characteristics, evaluation of design, failure modes, and reliability of thermally actuated, commercially available micromachined relays. The selected parts have been characterized over a wide range of temperatures (from -100/spl deg/C to +180/spl deg/C) and varying load conditions (voltages from 10 V to 70 V, and currents from 5 mA to 200 mA). Mechanical integrity of the parts was evaluated by subjecting them to multiple mechanical shocks in the range from 100 G to 1000 G acceleration with up to 10,000 shocks. Operational life testing was performed at different contact voltages and current loads during 108 switching cycles. All components intended for space applications have to operate in vacuum conditions. To simulate space operation conditions, operational characteristics of the parts were monitored during vacuum testing. Typical failure modes associated with different test conditions are discussed in this paper.
Performance of a subspace based semi-blind technique in the UMTS TDD mode context
Authors: S. Lasaulce
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

We study the performance of a semi-blind subspace channel estimate in the particular context of the uplink of the UMTS time division duplexing (TDD) mode. The TDD mode of the third generation system UMTS is a multiuser DS-CDMA scheme of maximal spreading factor N=16. In the uplink, each slot corresponds to 2560 chips and the channel estimation is classically achieved by using a 512 training chips midamble. In this well defined context, we study the improvements (in terms of bit error rate) provided by a semi-blind channel estimation technique introduced in the context of the single user system of Gorokhov and Loubaton (see Proc. ICASSP, p.3905-3908, 1997) and studied in detail by Buchoux, Moulines, Cappe and Gorokhov (see SPAWC, 1999).
Mephisto I towards a formal theory
Authors: D. A. Lambert, C. Nowak
Venue: Proceedings of the second Australasian workshop on Advances in ontologies - Volume 72 (2006)

Mephisto is a framework that will enable ontology-based high-level information fusion. Within the framework, the name Mephisto can be used to refer to a conceptualisation, an ontology, an agent, a society, a formal theory, and an implementation. A Mephisto conceptualisation assumes that the world can be understood in terms of processes. A Mephisto ontology is a specification of the conceptualisation. A Mephisto agent employs the ontology. A Mephisto theory is a formal theory of processes. A Mephisto implementation implements the theory. A Mephisto theory plays a crucial role within the framework.
A robust shot transition detection method based on support vector machine in compressed domain
Authors: Jianrong Cao, Anni Cai
Venue: Pattern Recognition Letters (2007)

In this paper we propose a new algorithm for shot transition detection. A multi-class support vector machine (SVM) classifier is constructed to differentiate frames of a video into three categories: abrupt change, gradual change and non-change. This approach enables us to integrate many kinds of features into a uniform structure and to eliminate arbitrary selection of thresholds. To enhance the robustness of the algorithm, we form the feature vector from all frames within a temporal windows, each frame represented by six features in compressed domain. Experimental results on TREC-2001 video data set have shown that the result of our algorithm is 8% higher than the best result of 2001 TREC evaluation in F1 comparison when cut and gradual changes are both considered.
The Space of EDF Feasible Deadlines
Authors: Enrico Bini, Giorgio Buttazzo
Venue: Proceedings of the 19th Euromicro Conference on Real-Time Systems (2007)

It is well known that the performance of computer controlled systems is heavily affected by delays and jitter occurring in the control loops, which are mainly caused by the interference introduced by other concurrent activities. A common approach adopted to reduce delay and jitter in periodic task systems is to decrease relative deadlines as much as possible, but without jeopardising the schedulability of the task set. In this paper, we formally characterise the region of admissible deadlines so that the system designer can appropriately select the desired values to maximise a given performance index defined over the task set. Finally we also provide a sufficient region of feasible deadlines which is proved to be convex.
Enforcing isolation and ordering in STM
Authors: Tatiana Shpeisman, Vijay Menon, Ali-Reza Adl-Tabatabai, Steven Balensiefer, Dan Grossman, Richard L. Hudson, Katherine F. Moore, Bratin Saha
Venue: ACM SIGPLAN Notices (2007)

Transactional memory provides a new concurrency control mechanism that avoids many of the pitfalls of lock-based synchronization. High-performance software transactional memory (STM) implementations thus far provide weak atomicity: Accessing shared data both inside and outside a transaction can result in unexpected, implementation-dependent behavior. To guarantee isolation and consistent ordering in such a system, programmers are expected to enclose all shared-memory accesses inside transactions. A system that provides strong atomicity guarantees isolation even in the presence of threads that access shared data outside transactions. A strongly-atomic system also orders transactions with conflicting non-transactional memory operations in a consistent manner. In this paper, we discuss some surprising pitfalls of weak atomicity, and we present an STM system that avoids these problems via strong atomicity. We demonstrate how to implement non-transactional data accesses via efficient read and write barriers, and we present compiler optimizations that further reduce the overheads of these barriers. We introduce a dynamic escape analysis that differentiates private and public data at runtime to make barriers cheaper and a static not-accessed-in-transaction analysis that removes many barriers completely. Our results on a set of Java programs show that strong atomicity can be implemented efficiently in a high-performance STM system.
Transformations of fuzzy graphs specified by FD-grammars
Authors: I. N. Parasyuk, S. V. Ershov
Venue: Cybernetics and Systems Analysis (2007)

The categorical approach is proposed to formalize transformations of FD-graphs that consist of networks of distributed components whose nodes are specified by fuzzy graphs. Necessary and sufficient conditions are formally defined for FD-graph transformations that do not violate structure integrity and can be constructed componentwise. FD-grammars that generalize fuzzy graph grammars are proposed to describe the admissible transformations of FD-graphs.