ppxscal/embedding_network huggingface dataset:
WAD: A Feasibility study using the Wicked Audio Debugger
Authors: Andreas Stefik, Roger Alexander, Robert Patterson, Jonathan Brown
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

Contemporary programmers have a predominately visual experience. Computer code is read from sophisticated text editors, analyzed using visual tools, designed using UML, and debugged using a watch window. Little research has attempted to create tools for the non-sighted programmer, using either haptic or aural feedback. In this paper, we present WAD, the Wicked Audio Debugger, a new debugger for Microsoft Visual Studio 2005 that sonifies computer code as an aid to the programmer. This paper has two primary contributions, namely the tool itself and the results of a feasibility study. We conducted this feasibility study to test participants' ability to comprehend dynamic program behavior, including tracking the value of state variables and control flow. Results of our feasibility study show that participants were able to comprehend approximately 86% of dynamic program behavior using audio only.
A theoretical study of information transmission in the auditory system using signal detection theory: frequency discrimination by normal and impaired systems
Authors: L. G. Huettel
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We have investigated the differences between normal and impaired auditory processing for a frequency discrimination task by analyzing the responses of a computational auditory model using signal detection theory. Two detectors, one using all of the information in the signal, the other using only the number of neural responses, were implemented. An evaluation of the performance differences between the two theoretical detectors and experimental data may provide insight into quantifying the type of information present in the auditory system as well as whether the human auditory system uses this information efficiently. Results support previous hypotheses that, for lowand mid-range frequencies, the auditory system is able to use temporal information to perform frequency discrimination (see Moore, B.C.J., J. Acoust. Soc. Am., vol.54, p.610-19, 1973). The results also suggest that some temporal information is represented in the neural spike train, even at high frequencies However, the ability of the auditory system to use this information deteriorates at higher frequencies.
Modeling of a Two-Wheeled Vehicle Compensated for Exact Contact of the Wheel to the Ground Plane and Simulation
Authors: Hideaki Kanoh, Tsubasa Uchida
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

This research proposes a kinematics and a dynamics models of a two-wheeled vehicle, such as a bicycle or a motorcycle. The modeling of the two-wheeled vehicle has been studied extensively for many years, this paper derives a more exact kinematic model by adding a holonomic condition which compensates exact contact of the front wheel to the ground plane against the handle operation. Using the Lagrange equation subject to the holonomic condition and five non-holomomic conditions for the rear and front wheels, a dynamic model of the two-wheeled vehicle is also derived. Simulation results are given for the kinematic motion and dynamic motion.
Surface reconstructions on Sb-irradiated GaAs(001) formed by molecular beam epitaxy
Authors: Naoki Kakuda, Shiro Tsukamoto, Akira Ishii, Katsutoshi Fujiwara, Toshikazu Ebisuzaki, Koichi Yamaguchi, Yasuhiko Arakawa
Venue: Microelectronics Journal (2007)

Reconstructed surfaces on Sb-irradiated GaAs(001) formed by molecular beam epitaxy have been studied by in-situ scanning tunneling microscopy (STM). The reflection high-energy electron diffraction patterns showed (2x3) [or weak (4x3)] structure. The step density was about five times higher than that of GaAs(001)-c(4x4) surface. It was found that there were swinging dimer rows along to the [11@?0] direction, which seemed not to consist of a specified reconstruction. We proposed two (2x3)-structure models for these swinging dimers. By first-principles calculation, we found that the proposed models were stable and with energy difference was 0.17eV, indicating the coexistence of the two structures. Moreover, we proposed three (4x3) reconstruction models based on these (2x3) models. The electron counting rule was applied for these models, indicating that there was an excessive amount of electrons. By two bias-alternative STM images, it was found that the many spots appear only in empty-state. These might be segregated Ga or Sb cluster and strongly relate to the excessive amount of electrons.
A DSR Extension for Connection Stability Assessment in Mobile Ad-Hoc Networks
Authors: Stefan Penz
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

The efficient assessment of connection stability in pervasive wireless environments is a crucial yet insufficiently explored problem. Existing stability assessment approaches for mobile networks focus rather on link stability and are based on unrealistic assumptions. In this paper, we propose an extension for the prevalent DSR routing protocol that allows for simple and efficient yet fairly accurate connection stability assessment based solely on routing information.
New results on observation selection in signal reconstruction
Authors: S. J. Reeves
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

Some signal reconstruction problems allow for flexibility in the selection of observations and hence the signal formation equation. In such cases, we have the opportunity to determine the best combination of observations before acquiring the data. In previous work, we defined a mean-squared error (MSE) selection criterion based on the known signal formation equation. Furthermore, we proposed the use of sequential backward selection (SBS) to optimize this criterion. Although SBS is suboptimal, it performs consistently well. In this paper, we analyze the performance of SBS and develop an upper bound on the MSE of the SBS-optimized solution. This upper bound provides analytical justification for the claim that SBS performs well in spite of being suboptimal. Furthermore, we derive a lower bound on the MSE of preliminary combinations of rows. This lower bound can be used as a point of reference for evaluating the upper performance bound of the SBS algorithm.
Data and instruction memory exploration of embedded systems for multimedia applications
Authors: M. Dasigenis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

A methodology for power optimization of the data memory hierarchy and instruction memory, is introduced. The effect of the methodology on a set of widely used multimedia application kernels, namely full search, hierarchical search, and parallel hierarchical one dimension search, is demonstrated. Three different target architecture models are used. The issues of the data memory power reduction and instruction memory are tackled separately. We find the power optimal data memory hierarchy applying the appropriate data-use transformation, while the instruction power optimization is done using suitable cache memory. Using data-reuse transformations, performance optimization techniques, and instruction-level transformations, we perform exhaustive exploration of all the possible alternatives to reach power efficient solutions. The experimental results prove the efficiency of the methodology in terms of power for all the multimedia kernels.
High-Resolution Flux-Based Level Set Method
Authors: Peter Frolkovic&caron;, Karol Mikula
Venue: SIAM Journal on Scientific Computing (2007)

A new high-resolution flux-based finite volume method for general advection equations in nondivergent form including a level set equation for moving interfaces is introduced. The method is applicable to the case of nondivergence free velocity and to general unstructured grids in higher dimensions. We show that the method is consistent and that the numerical solution fulfills the discrete minimum/maximum principle. Numerical experiments show its second order accuracy for smooth solutions as well as for solutions with discontinuous derivatives and on general unstructured meshes. Numerical examples for passive transport and shrinking of dynamic interfaces, including examples with topological changes, are presented using locally adapted two-dimensional and three-dimensional grids.
Non-data-aided frequency offset and symbol timing estimation for binary CPM: performance bounds
Authors: J. Riba
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

The use of (spectrally efficient) CPM modulations may lead to a serious performance degradation of the classical non-data-aided (NDA) frequency and timing estimators due to the presence of self noise. The actual performance of these estimators is usually much worse than that predicted by the classical modified Cramer-Rao bound. We apply some well known results in the field of signal processing to these two important problems of synchronization. In particular we propose and explain the meaning of the unconditional CRB in the synchronization task. Simulation results for MSK and GMSK, along with the performance of some classical and previously proposed synchronizers, show that the proposed bound (along with the MCRB) is useful for a better prediction of the ultimate performance of the NDA estimators.
Study of Different Replica Placement and Maintenance Strategies in Data Grid
Authors: Rashedur M. Rahman, Ken Barker, Reda Alhajj
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Data replication is an excellent technique to move and cache data close to users. By replication, data access performance can be improved dramatically. One of the challenges in data replication is to select the candidate sites where replicas should be placed. We use a multi-objective model to address the replica placement problem. The multi-objective model considers the objectives of p-median and p-center models simultaneously to select the candidate sites that will host replicas. The objective of the p-median model is to find the locations of p possible candidate replication sites by optimizing total (or average) response time; where the p-center model finds p candidate sites by optimizing maximum response time. A Grid environment is highly dynamic so user requests and network latency vary constantly. Therefore, candidate sites currently holding replicas may not be the best sites to fetch replica on subsequent requests. We propose a dynamic replica maintenance algorithm that re-allocates to new candidate sites if a performance metric degrades significantly over last K time periods. Simulation results demonstrate that the dynamic maintenance algorithm with multi-objective static placement decision performs best in dynamic environments like Data Grids.
SNR-normalisation for robust speech recognition
Authors: T. Claes, D. Van Compernolle
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

A new normalisation technique for speech recognition in adverse conditions is presented. Specifically the influence of additive noise in combination with convolutive distortions is considered. In the proposed method a masking constant is added to the outputs of a mel scale triangular filterbank. This is done for testing and training samples. The goal is to normalize the signal-to-noise ratio (SNR) in each frequency band by adapting the masking constant depending on the measured SNR or dynamic range in each band. This makes the extracted parameters less sensitive to the noise level, but also the influence of channel distortions is suppressed. The method is easy to implement and works on-line. Experimental results are given on the NOISEX-92 database and on real car data.
Session state: beyond soft state
Authors: Benjamin C. Ling, Emre Kiciman, Armando Fox
Venue: Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1 (2004)

The cost and complexity of administration of large systems has come to dominate their total cost of ownership. Stateless and soft-state components, e.g. Web servers or network routers, are easy to manage: capacity can be scaled incrementally by adding more nodes, rebalancing of load after failover is easy, and reactive or proactive ("rolling") reboots can be used to handle transient failures. We show that it is possible to achieve the same ease of management for the state-storage subsystem by subdividing persistent state according to the specific guarantees needed by each type. While other systems [19,17] have addressed persistent-until-deleted state, we describe SSM, a store for a previously unaddressed class of state - user-session state - that exhibits the same manageability properties as stateless nodes while providing firm storage guarantees. Any node can be proactively or reactively rebooted at any time to recover from transient faults, without impacting online performance or losing data. We exploit this simplified manageability by pairing SSM with an application-generic, statistical-anomaly-based framework that detects crashes, hangs, and performance failures, and automatically attempts to recover from them by rebooting faulty nodes. Although the detection techniques generate some false positives, the cost of recovery is so low that the false positives have low impact. We provide microbenchmarks to demonstrate SSM's built-in overload protection, failure management and self-tuning. We benchmark SSM integrated into a production enterprise-scale interactive service to demonstrate that these benefits need not come at the cost of significantly decreased throughput or response time.
Structured and unstructured overlays under the microscope: a measurement-based view of two P2P systems that people use
Authors: Yi Qiao, Fabián E. Bustamante
Venue: Proceedings of the annual conference on USENIX '06 Annual Technical Conference (2006)

Existing peer-to-peer systems rely on overlay network protocols for object storage and retrieval and message routing. These overlay protocols can be broadly classified as structured and unstructured - structured overlays impose constraints on the network topology for efficient object discovery, while unstructured overlays organize nodes in a random graph topology that is arguably more resilient to peer population transiency. There is an ongoing discussion on the pros and cons of both approaches. This paper contributes to the discussion a multiple-site, measurement-based study of two operational and widely-deployed file-sharing systems. The two protocols are evaluated in terms of resilience, message overhead, and query performance. We validate our findings and further extend our conclusions through detailed analysis and simulation experiments.
Automatic speech recognition: a communication perspective
Authors: B. S. Atal
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

Speech recognition is usually regarded as a problem in the field of pattern recognition, where one first estimates the probability density function of each pattern to be recognized and then uses Bayes theorem to identify the pattern which provides the highest likelihood for the observed speech data. In this paper, we take a different approach to this problem. In speech recognition, the goal is communication of information by voice and we discuss the basics of speech recognition from a communication perspective. The speech signal at the acoustic level has a bit rate of 64 kb/s but the underlying sound patterns have an information rate of less than 100 b/s. What is the role of this high bit rate at the acoustic level? We discuss the principles of decoding patterns that are submerged in an ocean of seemingly irrelevant information.
Teaching IT in Health Care and Nursing Program--Experiences
Authors: Tatjana Welzer, Peter Kokol, Ana Habjanic, Bostjan Brumen, Marjan Druzovec, Aida Kamisalic
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

From buying transport tickets (railway, bus, metro, airplane) up to shopping (books, tourist trips, clothes, food,..) and visiting cultural events (theater, cinema, concerts) or medical doctors (medicine prescriptions, illness, regular examination) activities connected to the information technology (IT) are needed and requested from professionals, participating in one or another above mentioned process. We would like to point out that every visit to the medical doctor nowadays requests the cooperation of IT. But are medical doctors and nurses really sufficiently equipped with knowledge about IT -- which is in part their working environment? Without doubt, more knowledge about the possibilities, benefits, possible mistakes and their consequences related to IT is needed for being used adequately in the health services. In the paper we will present experiences which aim at moving those possible obstacles and targets in this field. In general, we will shortly present the health care and nursing study program. Additionally, we will focus on different for health care important IT areas. The paper will also discuss the experiences and assessments which are acquired during the last years by students.
Fundamental studies on a decompositional and hybrid approach to automatic verification of component-based systems
Authors: Zhe Dang
Venue:  (2005)

This work introduces a decompositional and hybrid approach for the automatic verification of component-based systems and studies some fundamental issues on the approach. By using a formal verification technique like model checking or automata operations, the approach first derives from the system specification and some system property a verification condition for each individual component in the system, such that the system satisfies the property if and only if all the components satisfy their verification conditions. Then the approach checks the validity of an individual component's verification condition either by model checking or automata operations when the component's specification is available, or by traditional black-box testing when the component's specification is not available. We first study the possibility of verifying a system with black-box components through testing by introducing a theoretic tool called Oracle Automata. Then we study specific model checking (both LTL and CTL) algorithms for systems with only one finite-state black-box. Next, we show a decompositional technique on testing a system with multiple black-boxes. We also consider the problem of verifying a system with only one component but against non-temporal properties, as well as verifying a system with only one infinite-state component.
MOBIDIS: A Pervasive Architecture for Emergency Management
Authors: Massimiliano de Leoni, Fabio De Rosa, Massimo Mecella
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Current mobile and pervasive technologies (e.g., PDAs, GPRS/UMTS and WiFI connections, etc.) enable the development of adaptive peer-to-peer software infrastructures for supporting collaborative work of human operators in emergency/disaster scenarios. In this paper, we present a novel architecture, named MOBIDIS (Mobile @ DIS), currently under development in the context of an IST research project, in which operators, equipped with hand-held devices, are coordinated by a workflow management system able to adaptively change the process schema in order to cope with anomalies. Some preliminary experimental results are also presented.
Using Tcl to script CORBA interactions in a distributed system
Authors: Michael L. Miller, Srikumar Kareti
Venue: Proceedings of the 6th conference on Annual Tcl/Tk Workshop, 1998 - Volume 6 (1998)

In this paper we present the extensive use of a scripting language (Tcl) to run human readable/editable scripts in a CORBA distributed batch environment. The developed system is the "Advanced Process Control Framework" as outlined in the "APC Framework Initiative" which is a research and development project undertaken by AMD and Honeywell under the support of the U.S. Department of Commerce, National Institute of Standards and Technology. The APC Framework System has been deployed in AMD's fab 25 and is fully functional. The paper discusses the issues involved in developing scripting mechanism which is capable of both interacting with other CORBA components and handling various data structures which are otherwise not addressable by the underlying scripting language. The flexibility and extendibility of the Tcl scripting language makes it easy to extend the core language. The paper also establishes the need for thread-safeness of Tcl. Examples of various data manipulation operations, calls to different CORBA components, and calls that help in synchronization are discussed.
A rate-distortion optimal scalable vertex based shape coding algorithm
Authors: G. Melnikov
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

We present a rate-distortion (RD) optimized scalable vertex-based shape coding algorithm. Following the base layer, each successive enhancement layer refines a given shape approximation by optimally (within a layer) placing new vertices and perturbing existing vertices. An efficient low entropy distortion adaptive vertex coding strategy is employed to take advantage of information available from coarser layers. Based on the chosen vertex rate and distortion definitions, a resulting enhancement layer topology is solved by executing a directed acyclic graph (DAG) shortest path algorithm. Finally, an iterative VLC optimization scheme is employed to find both the optimized scalable code and the most efficient set of parameter VLC tables.