ppxscal/embedding_network huggingface dataset:
Working with students and parents to improve the freshman retention
Authors: D. D. Budny
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

The transition from high school to college can be very difficult for many students. The authors believe that students can advocate on their own behalf by educating themselves on challenges they may potentially face, as well as establishing realistic educational and social goals. Concurrently, parents can assist their children by becoming more aware of, and learning how to help anticipate transitions. This paper acquaints the reader with three key transitional challenges new college students face, as well as offer a preliminary approach to productive interactions with both students and their parents. As evidenced in steadily improving persistence rates, the University of Pittsburgh has found by educating new students and parents in realistically anticipating first year challenges, students are able to productively work through their freshman year university experience.
Very quick audio searching: introducing global pruning to the Time-Series Active Search
Authors: A. Kimura
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Previously, we proposed a histogram-based quick signal search method called Time-Series Active Search (TAS). TAS is a method of searching through long audio or video recordings for a specified segment, based on signal similarity. TAS is fast; it can search through a 24-hour recording in 1 second after a query-independent preprocessing. However, an even faster method is required when we consider a huge amount of audio archives, for example a month's worth of recordings. Thus, we propose a preprocessing method that significantly accelerates TAS. The core part of this method comprises a global histogram clustering of long signals and a pruning scheme using those clusters. Tests using broadcast recording indicate that the proposed algorithm achieves a search speed approximately 3 to 30 times faster than TAS. In these tests, the search results are exactly the same as with TAS.
Towards an artificial immune system for network intrusion detection: an investigation of dynamic clonal selection
Authors: P. J. Bentley
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

One significant feature of artificial immune systems is their ability to adapt to continuously changing environments, dynamically learning the fluid patterns of 'self' and predicting new patterns of 'non-self'. This paper introduces and investigates the behaviour of dynamiCS, a dynamic clonal selection algorithm, designed to have such properties of self-adaptation. The effects of three important system parameters: tolerisation period, activation threshold, and life span are explored. The abilities of dynamiCS to perform incremental learning on converged data, and to adapt to novel data are also demonstrated.
SPP - low tech, practical, UNIX software portability
Authors: John Sellens
Venue: Proceedings of the USENIX Applications Development Symposium Proceedings on USENIX Applications Development Symposium Proceedings (1994)

The great number of UNIX variants and the huge amount of good, freely available software makes simple software portability a very worthwhile and useful goal. Portability has traditionally been obtained with software package specific solutions, configuration scripts, #ifdef's and so on. This paper describes SPP, a small collection of include files, library routines and utilities that can be installed once and utilized by many, different software packages. SPP does not require that a software author change his or her programming style or techniques, and frees the author from worrying about the variations among machines, allowing him or her to concentrate on the program instead of the operating system.
Transient behavior of fixed point LMS adaptation
Authors: R. Gupta
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

We relate the distinguishing features of the fixed point power-of-two step size LMS algorithm's learning curve to the precision of its data and coefficient variables. In particular, we show that the increase in the steady state MSE floor due to finite precision effects is determined primarily by data quantization while the decrease in convergence rate due to finite precision is determined by both data and coefficient quantization. We also derive a condition under which the slowdown phenomenon can be eliminated, given the reference variance and lower bounds on the minimum MSE and optimal weight vector magnitude. 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
Speaker normalization on conversational telephone speech
Authors: S. Wegmann, D. McAllaster, J. Orloff, B. Peskin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

This paper reports on a simplified system for determining vocal tract normalization. Such normalization has led to significant gains in recognition accuracy by reducing variability among speakers and allowing the pooling of training data and the construction of sharper models. But standard methods for determining the warp scale have been extremely cumbersome, generally requiring multiple recognition passes. We present a new system for warp scale selection which uses a simple generic voiced speech model to rapidly select appropriate frequency scales. The selection is sufficiently streamlined that it can moved completely into the front-end processing. Using this system on a standard test of the Switchboard Corpus, we have achieved relative reductions in word error rates of 12% over unnormalized gender-independent models and 6% over our best unnormalized gender-dependent models.
Coarray analysis of wideband pulse-echo imaging systems
Authors: F. Ahmad
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

We derive an analytic expression for the point spread function, using the concept of coarrays, for wideband pulse-echo imaging of targets. We analyze the performance of the imaging system under finite and infinite range conditions. The results provide a better understanding of the interplay between bandwidth, element locations, weighting of the elements, pulse shape within the bandwidth, and imaging performance. This leads to new insights on array and pulse design. We support our results through computer simulations.
A Characterisation Model for Visual Interaction Interfaces
Authors: Grant Osborne, G Stewart Von Itzstein, Rudi Vernik
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

This paper focuses on enhancing the effectiveness of information visualisation approaches through the use of Visual Interaction Interfaces (VIIs). We define VIIs as being graphical components which help users understand and interact with visual representations of a target environment (or data space). These types of components have been effectively used in computer-based games to enhance user experience. However, few such techniques are used in visualisation approaches designed to support decision-makers in real-world domains. A characterisation model, based on the capture and analysis of some 200 VIIs, has been developed to help describe and understand these types of visualisation components and hence support the transitioning of these techniques into future visualisation systems.
Economic modeling of global test strategy II: Software system and examples: Research Articles
Authors: Eric S. Fisher, Steven Fortune, Martin K. Gladstein, Suresh Goyal, William B. Lyons, James H. Mosher Jr., Gordon Wilfong
Venue: Bell Labs Technical Journal (2007)

A mathematical model for general manufacturing test strategies is described in a companion paper in this issue. Any given test strategy, or test and repair network, is represented as a directed graph with various node attributes. The nodes represent test and repair stations with attributes pertaining to accuracy, effectiveness, time, and costs&semi; edges represent potential flow between the stations. In this paper we describe a preliminary software system based on the structure described. Such a system can be used as a test strategy evaluator that allows the explicit computation of incurred test costs and expected field return rates and allows for the investigation of trade-offs between the two. By using practical insights into the testing process, the computational complexity of the implemented algorithm has been reduced to polynomial. Several examples are then presented to illustrate the flexibility of the model and software. &copy; 2007 Alcatel-Lucent.
Experiments for an approach to language identification with conversational telephone speech
Authors: Yonghong Yan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper presents work on language identification research using conversational speech (the LDC Conversational Telephone Speech Database). The baseline system used in this study is based on language-dependent phone recognition and phonotactic constraints. The system was trained using monologue data and obtained an error rate of around 9% on a commonly used nine-language monologue test set. While the system was used to process conversational speech from the same nine-language task, dramatic performance degradation (with an error rate of 40%) was observed. Based on our analysis of conversational speech, two methods: (1) pre-processing and, (2) post-processing, were proposed. Without the presence of training data from conversational speech database, the final system (the baseline system enhanced by the two proposed methods) obtained an error rate of 24%, a substantial improvement (with 41% error reduction) compared with the baseline system.
Cache-Analyzer: Design Space Evaluation of Configurable-Caches in a Single-Pass
Authors: Andre Silva, Guilherme Esmeraldo, Edna Barros, Pablo Viana
Venue: Proceedings of the 18th IEEE/IFIP International Workshop on Rapid System Prototyping (2007)

Today's digital systems design requires extensive systemlevel simulation to ensure that the right architectural tradeoffs are made. In platform based designs a large number of platforms models must be executed for tuning the platform for the application. In order to run these simulations with adequate performance, design architects have increasingly employed abstract transaction-level models instead of RTL models to perform such analysis. Memory hierarchy is a major bottleneck for performance and energy consumption. Trying out every supported cache configuration to evaluate a given platform may become a very time consuming task. This paper proposes an approach for memory cache tuning, which is based on single-pass simulation. The proposed single-pass cache evaluation mechanism is 70 times faster than a simulation-based mechanism for the ADPCM application from Mediabench.
Undoing Code Transformations in an Independent Order
Authors: Chyi-Ren Dow, Mary Lou Soffa, Shi-Kuo Chang
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

A transformation applied to optimize or parallelize a program may be found to be ineffective, or may be made invalid by code changes. In this paper, we present a technique to remove such transformations. The order of undoing the transformations is independent of the application order. The technique uses post conditions of a transformation to determine whether the transformation can be immediately removed. Transformations that affect the immediate removal of a transformation must be identified and removed. Other transformations made invalid by the removal of a transformation must also be undone. The technique employs inverse primitive actions, making the technique transformation independent. The enabling and disabling interactions of transformations are used to drive the process, thereby reducing redundant analysis when undoing transformations.
Direction finding and array calibration based on maximal set of nonredundant cumulants
Authors: Huan Wu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

An algorithm for direction finding and array calibration based on the maximal set of nonredundant cumulants (MSNC) is presented in this paper. The algorithm utilizes all nonredundant information of the spatial fourth-order cumulants. It has been shown that the algorithm is insensitive to additive Gaussian noise and superior to conventional covariance-based DOA algorithms with reduced estimation variances and enhanced resolvability. The algorithm also circumvents the iteration between direction finding and array calibration, without the problem of convergence and with improved robustness. Simulation experiments demonstrate the potential performance of the proposed algorithm.
Visualisation of Parallel Data Streams with Temporal Mosaics
Authors: Saturnino Luz, Masood Masoodian
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Despite its popularity and widespread use, timeline vi- sualisation suffers from shortcomings which limit its use for displaying multiple data streams when the number of streams increases to more than a handful. This paper presents the Temporal Mosaic technique for visualisation of parallel time-based streams which addresses some of these shortcomings. Temporal mosaics provide a compact way of representing parallel streams of events by allocating a fixed drawing area to time intervals and partitioning that area according to the number of concurrent events. A user study is presented which compares this technique to a stan- dard timeline representation technique in which events are depicted as horizontal bars and multiple streams are drawn in parallel along a vertical axis. Results of this user study show that users of the temporal mosaic visualisation per- form significantly better at detecting concurrency, interval overlaps and inactivity than users of standard timelines.
Can Scheduling with Error Rate Consideration Support TCP Performance Comparable to Packet Combining HARQ in Evolved UTRA and UTRAN Networks?
Authors: Yan Zhang, Masato Uchida, Masato Tsuru, Yuji Oie
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

As a key technology of evolved UTRA and UTRAN, hybrid ARQ with packet combining (HARQ with PC) can effectively improve the throughput performance for poor channel condition users without doing unacceptable level of harm to the system transmission efficiency or the throughput performance of good condition users. In the present study, we attempt to apply scheduling with error rate consideration as an alternative method by which to realize a comparable TCP performance to HARQ with PC. Scheduling with error rate consideration introduces the transmission failure possibility (error rate) in order to modify the existing channel-aware scheduling schemes to avoid high-risk transmissions, and thus improves TCP performance. Simulations show that scheduling with error rate consideration can realize a TCP performance comparable to HARQ with PC when no user continuously experiences a nearly zero successful transmission possibility environment. Moreover, it is shown herein that a synergistic improvement can be achieved by applying scheduling with error rate consideration to HARQ with PC.
The safe-Tcl security model
Authors: Jacob Y. Levy, Laurent Demailly, John K. Ousterhout, Brent B. Welch
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1998)

Safe-Tcl is a mechanism for controlling the execution of programs written in the Tcl scripting language. It allows untrusted scripts (applets) to be executed while preventing damage to the environment or leakage of private information. Safe-Tcl uses a padded cell approach: each applet is isolated in a safe interpreter where it cannot interact directly with the rest of the application. The execution environment of an applet is controlled by a trusted script running in a master interpreter. Safe-Tcl supports applets using multiple security policies within an application. These policies determine what an applet can do, based on the degree to which the applet is trusted. Safe-Tcl separates security management into well-defined phases that are geared towards the party responsible for each aspect of security.
Total recall: system support for automated availability management
Authors: Ranjita Bhagwan, Kiran Tati, Yu-Chung Cheng, Stefan Savage, Geoffrey M. Voelker
Venue: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1 (2004)

Availability is a storage system property that is both highly desired and yet minimally engineered. While many systems provide mechanisms to improve availability - such as redundancy and failure recovery - how to best configure these mechanisms is typically left to the system manager. Unfortunately, few individuals have the skills to properly manage the trade-offs involved, let alone the time to adapt these decisions to changing conditions. Instead, most systems are configured statically and with only a cursory understanding of how the configuration will impact overall performance or availability. While this issue can be problematic even for individual storage arrays, it becomes increasingly important as systems are distributed - and absolutely critical for the wide-area peer-to-peer storage infrastructures being explored. This paper describes the motivation, architecture and implementation for a new peer-to-peer storage system, called TotalRecall, that automates the task of availability management. In particular, the TotalRecall system automatically measures and estimates the availability of its constituent host components, predicts their future availability based on past behavior, calculates the appropriate redundancy mechanisms and repair policies, and delivers user-specified availability while maximizing efficiency.
Optimal design of transmitter and receiver filters with mixed performance objectives
Authors: W. M. Campbell
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

Nonsmooth optimization is applied to the design of transmitter and receiver filters for data transmission. This optimization method allows tradeoffs between several performance measures-ISI, transmitter filter average power output, and receiver filter power gain. An FCC mask constraint on the transmitter filter is imposed. An example illustrates the design method.
Continuous and discrete fractional Fourier domain decomposition
Authors: I. S. Yetik
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

We introduce the fractional Fourier domain decomposition for continuous and discrete signals and systems. A procedure called pruning, analogous to truncation of the singular-value decomposition, underlies a number of potential applications, among which we discuss the fast implementation of space-variant linear systems.
Towards 21st century China's higher education of engineering
Authors: Li Yanbao
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

Southeast University is one of the oldest institutions of higher learning in China. In this paper, we summarize the experience China gained in the field of higher education of engineering, make an assessment of the current situation and set objectives for the reform and development of higher education. One is China's 211 project, another is the reform and construction of teaching and curriculum design.
Autonomous authoring tools for hypertext
Authors: Mark Truran, James Goulding, Helen Ashman
Venue: ACM Computing Surveys (CSUR) (2007)

Autonomous authoring tools are routinely used to expedite the translation of large document collections into functioning hypertexts. They are also used to add hyperlinks to pre-existing hypertext structures. In this survey we describe a taxonomy of autonomous hypertext authoring tools. The classification of any given system is determined by the type and nature of the document analysis it performs.
Asymptotic behavior of ACMA
Authors: A.-J. van der Veen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

The algebraic constant modulus algorithm (ACMA) is a noniterative blind source separation algorithm. It computes jointly beamforming vectors for all constant modulus sources as the solution of a joint diagonalization problem. In this paper we analyze its asymptotic properties and show that (unlike the iterative CMA) it converges to the Wiener solution in samples or SNR. We also sketch its connection to the related JADE algorithm.
Pago: pelvic analysis and gait output
Authors: Norman I. Badler
Venue:  (2006)

Human locomotion is one of the most fundamental and routine human actions we perform and, at the same time, we see every day. It is natural therefore to expect good synthesized virtual human walking in virtual reality, computer games, animation, and training. However, human walking is not such a simple motion even if its basic structure is cyclic. It is not easy to synthesize robust and realistic human walking only using patterns or rules without using empirical data stored in a motion capture library. It is even more difficult to select proper subsequences of motion from large motion (capture) library. We introduce a new locomotion system, PAGO (Pelvis Analysis and Gait Output), which reuses motion capture data by accepting the pelvic motion stream as a control input. PAGO explores a solution to synthesize natural locomotion based on a minimal control motion which has at least pelvic movements. PAGO analyze and obtain a pelvic cycle with high accuracy and search pelvic cycles from stored motion. The final motion re-creates precisely synthesized leg movements.
Fast detection of masses in digitized mammograms
Authors: I. Christoyianni
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

A novel method for fast detection of regions of suspicion (ROS) that contain circumscribed lesions in mammograms is presented. The position and the size of ROS are first recognized with the aid of a radial-basis-function neural network (RBFNN) by performing windowing analysis. Then a set of criteria is employed to these regions to make the final decision concerning the abnormal ones. Accelerated estimation of the high-order statistical features decreases the computational complexity 55 times in multiplication operations. The proposed method detects the exact location of the circumscribed lesions with accuracy of 72.7% (overlap between groundtruthed and detected regions greater than 50%) for mammograms containing masses, while the recognition rate for the normal ones reaches 77.7% in the MIAS database.