ppxscal/embedding_network huggingface dataset:
Statistical characterisation of an ISDN channel for the probability of error estimation
Authors: S. M. Berber
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

The general expressions for the density function, mean and variance of a random variable characterising the error sequence of a cascaded digital channel, composed of N elementary channels, are derived. The expressions are applied to develop accurate and reliable methods and techniques for the probability of error estimation in cascaded channels with and without memory. For this purpose, the expressions for the sample size are derived as a function of the memory parameter and the number of elementary channels in a cascade.
Tolerance to Small Delay Defects by Adaptive Clock Stretching
Authors: Swaroop Ghosh, Patrick NDai, Swarup Bhunia, Kaushik Roy
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

Bridging defects typically manifest themselves as increased path delays instead of stuck-at failures. On the other hand, parametric variations (both inter- and intra-die) increase the spread of the circuit delay. Low power design techniques such as voltage scaling, dual-Vth etc. deteriorate the delay spread further. These mechanisms for delay variations in nanoscaled technologies significantly affect the parametric yield. We propose a new design methodology to tolerate subtle delay failures that arise both due to manufacturing defects and parameter fluctuations. We synthesize the circuit to (a) isolate and predict the critical paths of a circuit; (b) create timing slack between critical and off-critical paths and ensure that they are activated rarely; and, (c) avoid the delay failures in these paths by adaptively stretching the clock period. Since critical paths are the most sensitive section of the circuit in terms of delay defects, we ensure fault-free operation by isolating them and providing extra computation time by predicting their activation. This allows us to achieve the required yield with small performance penalty (due to occasional clock stretching under critical path activation). We present application of the proposed methodology for both linear and non-linear pipeline designs. We also suggest two possible circuit-level implementations of clock stretching using clock gating and handshaking, respectively. Simulations on MCNC benchmark circuits with BPTM 70nm devices show that the proposed technique can achieve good yield by tolerating increased path delays (under variations and bridging defects of various sizes) with small overhead in performance and ~14% die-area compared to the conventional design. For performance analysis, we have implemented the proposed methodology in simple in-order pipeline in Simplescalar. Simulation results on SPEC2000 benchmarks show less that 2% of IPC (instructions-per-cycle) degradation.
A Tailored Design Partitioning Method for Hardware Emulation
Authors: R. Beckert, T. Fuchs, St. Ruelke, W. Hardt
Venue: Proceedings of the 18th IEEE/IFIP International Workshop on Rapid System Prototyping (2007)

Partial run time reconfiguration (pRTR) enables a dynamic replacement of design modules to optimize the resource utilization of FPGA-based hardware emulation. This requires an appropriate partitioning of the entire design into particular hardware modules. There exist various methods to partition a design at functional as well as at structural level. In this paper, an adapted functional method to partition the design into independent modules is proposed. In consideration of typical functional modules (e.g. controller, DSP1 parts, memory) of a System-on-Chip (SoC), the design is partitioned. The method is especially suited if the design consists of regular structures (multiprocessor design, vector-DSP). The results of the design partitioning are used to determine significant parameters of a generic emulator environment implemented on a state-ofthe- art FPGA2 platform. The benefits are a decreasing number of run time reconfigurations and an improved utilization of the FPGA resources.
Multi-pitch and periodicity analysis model for sound separation and auditory scene analysis
Authors: M. Karjalainen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

A model for multi-pitch and periodicity analysis of complex audio signals is presented that is more efficient and practical than the Meddis and O'Mard (see J. Acoust. Soc. Am., vol.102, p.1811-20, 1997) unitary pitch perception model, yet exhibits very similar behavior. We also demonstrate how to apply this model to source separation of complex audio signals such as polyphonic and multi-instrumental music and mixtures of simultaneous speakers. Such analysis techniques are important for automatic transcription of music and structural representation of audio signals.
Concept-based phrase spotting approach for spontaneous speech understanding
Authors: T. Kawahara, N. Kitaoka, S. Doshita
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

In order to realize robust speech understanding, we present a phrase spotting approach. The use of concept-based phrases as the core unit for understanding is advantageous because the phrase-level constraint realizes wider coverage and stable matching and they are directly mapped to semantic cases. The phrase spotting and the sentence-level parsing are formulated as a progressive search. It realizes an optimal search to spot phrase candidates with Viterbi scoring and A* search to combine the phrase candidates into optimal sentence hypotheses. The approach achieved higher detection rates and robust interpretation of ill-formed utterances. We also examined the effect of the background language model. It is shown that lexical knowledge in the background is vital for spotting and the use of the acoustic score of the filler model is significant for parsing.
Reduced complexity equalizers for zero-padded OFDM transmissions
Authors: B. Muquet
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

The widespread application of OFDM for local area mobile wireless broadband systems is strongly motivated by the simple equalization it affords. OFDM's bottleneck of channel-dependent performance was only previously addressed by replacing the cyclic prefix (CP) with trailing zeros (TZ). Such zero-padded OFDM transmissions enable FIR channel-irrespective symbol recovery which results in significant BER gains. The price paid is increased receiver complexity compared to the classical CP-OFDM. To reduce complexity, this paper proposes two novel equalizers for TZ-OFDM. One is based on an overlap and add approach and exhibits exactly the same performance and complexity as CP-OFDM. The second offers BER performance close to the TZ-OFDM MMSE equalizer and incurs a moderate complexity increase. An extension of an existing CP-OFDM pilot-based channel estimation method is also derived for the proposed equalization schemes. Simulations are conducted in a realistic HiperLAN/2 scenario comparing the various OFDM transceivers.
Discovering the events expert practitioners extract from dynamic data streams: the modified unit marking technique
Authors: Klaus Christoffersen, David D. Woods, George T. Blike
Venue: Cognition, Technology and Work (2007)

One of the cornerstones of expert performance in complex domains is the ability to perceive problem situations in terms of their task-relevant semantic properties. One such class of properties consists of phenomena that are defined in terms of patterns of change over time, i.e., events. A basic pre-requisite for working towards tools to support event recognition is a method for understanding the events that expert practitioners find meaningful in a given field of practice. In this article we present the modified unit marking procedure (mUMP), a technique adapted from work on social perception to facilitate identification of the meaningful phenomena which observers attend to in a dynamic data array. The mUMP and associated data analysis techniques are presented with examples from a first of a kind study where they were used to elicit and understand the events practitioners found meaningful in a scenario from an actual complex work domain.
Global Ocean Prediction Using HYCOM
Authors: E. Joseph Metzger, Harley E. Hurlburt, Alan J. Wallcraft, James A. Cummings, Eric P. Chassignet, Ole Martin Smedstad
Venue: Proceedings of the HPCMP Users Group Conference (2006)

One important aspect of ocean model design is the choice of the vertical coordinate system. Traditional ocean models use a single coordinate type to represent the vertical, but model comparison exercises performed in Europe (DYnamics of North Atlantic MOdels - DYNAMO) (Willebrand et al., 2001) and in the United States (Data Assimilation and Model Evaluation Experiment - DAMEE) (Chassignet et al., 2000) have shown that none of the three main vertical coordinates presently in use (depth [z-levels], density [isopycnal layers], or terrain-following [Ð-levels]) can by itself, be optimal everywhere in the ocean. The HYbrid Coordinate Ocean Model (HYCOM) (Bleck, 2002) is configured to combine all three of these vertical coordinate types.
Teaching new software skills and business processes to Q&R engineers
Authors: J. Samota
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

Summary form only given. Q&R Engineers are being asked to adapt to new technologies and business processes at an ever increasing rate. The challenge to program managers who own these changes is how to deploy the knowledge and skills effectively. There is an ever increasing dependence on training groups to deliver the information fast and effectively. We present two cases where Q&R engineers at a high tech corporation were trained on new tools and business processes. Each case uses reference based instruction and electronic support systems to deploy the new information. Each case involves a new software deployment across international sites. The cases demonstrate how training is designed developed and deployed internationally to support the new software tools and business processes they support. Referenced based PC Lab instruction is a method of instruction. First, a reference manual focused on the processes and tasks the users must perform is developed. The manual documents the software procedures in relation to the business processes. Simulation exercises are developed and documented in the manual to provide practice with the software procedures following the business process flow. The manual continues to support mastery of the software and the business processes and rules after the instruction. 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
Roundtable: Envisioning the Future for Multiprocessor SoC
Authors: Ahmed Amine Jerraya, Olivier Franza, Markus Levy, Masao Nakaya, Pierre Paulin, Ulrich Ramacher, Deepu Talla, Wayne Wolf
Venue: IEEE Design Test (2007)

Multiprocessor SoCs are no longer an advanced research topic for academia. Ninety percent of SoCs designed in 130-nm technology include at least one CPU. Most popular multimedia platforms are already multiprocessor SoCs. This roundtable brings together key players from the semiconductor industry and academia to discuss the challenges and opportunities involved with this new technology.
On the complexity of deciding connectedness and computing Betti numbers of a complex algebraic variety
Authors: Peter Scheiblechner
Venue: Journal of Complexity (2007)

We extend the lower bounds on the complexity of computing Betti numbers proved in [P. Burgisser, F. Cucker, Counting complexity classes for numeric computations II: algebraic and semialgebraic sets, J. Complexity 22 (2006) 147-191] to complex algebraic varieties. More precisely, we first prove that the problem of deciding connectedness of a complex affine or projective variety given as the zero set of integer polynomials is PSPACE-hard. Then we prove PSPACE-hardness for the more general problem of deciding whether the Betti number of fixed order of a complex affine or projective variety is at most some given integer.
A new active queue management algorithm for real-time interactive communication in TCP/IP networks
Authors: Jin Wu, K. Djemame
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

Recent research has shown that the deployment of active queue management (AQM) would alleviate problems related to high packet loss and long transmission delays and also provide some notion of quality of service (QoS) by intelligent packet marking or dropping. We analyze the relationship between the end-to-end performance and switch nodes' operation state in the current TCP/IP architecture. Based on this analysis, guidelines for performing control actions at gateways are given. A new AQM algorithm, adaptive optimized marking (AOM), is also introduced. We then compare AOM with RED (random early detection) by simulation using ns-2 to show that AOM does improve the end-to-end performance for interactive communications. We also show that a significant performance enhancement for interactive applications in TCP/IP networks is possible, even using the conventional AQM architecture.
Assuring separation of safety and non-safety related systems
Authors: Bruce Hunter
Venue: Proceedings of the eleventh Australian workshop on Safety critical systems and software - Volume 69 (2007)

Safety standards call for the separation of safety and non-safety related systems. Although good guidance is provided in these standards on how to achieve the required hazard analysis, safety integrity assignment and validation to prove a safe system, there is little available on establishing safety boundaries around the critical components and the proof of isolation from non-safety functions. Delineation between safety and non-safety systems is particularly important where it is impractical to substantiate a Safety Integrity Level of the overall system due to the complexity of some components. In this case it is better to assume high failure probability of the non-safety system and prove isolation from the safety-related system. This paper explores a conceptual methodology (including the use of Fault Tree Analysis and Common Cause Failure Analysis) for establishing and assuring separation of systems and some examples from training simulators that are an example of this situation drawn from real-life.
Using the Fisher kernel method for Web audio classification
Authors: P. J. Moreno
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

As the multimedia content of the Web increases techniques to automatically classify this content become more important. We present a system to classify audio files collected from the Web. The system classifies any audio file as belonging to one of three categories: speech, music and other. To classify the audio files, we use the technique of Fisher kernels. The technique as proposed by Jaakkola (1998) assumes a probabilistic generative model for the data, in our case a Gaussian mixture model. Then a discriminative classifier uses the GMM as an intermediate step to produce appropriate feature vectors. Support vector machines are our choice of discriminative classifier. We present classification results on a collection of more than 173 hours of Web audio randomly collected. We believe our results represent one of the first realistic studies of audio classification performance on found data. Our final system yielded a classification rate of 81.8%.
Topological optimization of the large-scale data transmission networks
Authors: V. M. Vishnevskii, A. O. Leonov, N. I. Levchenko, A. M. Stepanov
Venue: Automation and Remote Control (2007)

Consideration was given to the design of the topological structure of the doubly connected large-scale networks by the cost criterion and constraints on the diameter. An exact combinatorial algorithm to solve the problem and a parallel algorithm to carry out calculations on the multiprocessor data-flow computer system were proposed. Parallelization was shown to provide a substantial gain in the time of computations in the optimal topological structure of the large-scale networks.
Pen Based Graphical Annotation in Medical Education
Authors: Dorian Gorgan, Teodor Stefanut, Bogdan Gavrea
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

The paper presents conceptual definitions, interaction techniques and experiments on the 2D and 3D graphical annotations. The 2D annotation is independent of the type, content and format of the annotated 2D documents and 3D objects. The user performs the 3D annotation by drawing directly onto the surface of the 3D objects. All the annotation techniques are experimented through an eLearning framework and exemplified by medicine case lessons.
Comment: A note on determination of oscillation startup condition
Authors: Hung-Yu Wang, Chun-Yueh Huang, Ying-Chuan Liu
Venue: Analog Integrated Circuits and Signal Processing (2007)

The comment is related to the recently published papers given in [Singh, V. (2006). Analog Integrated Circuits and Signal Processing, 48, 251---255; Singh, V. (2007). Analog Integrated Circuits and Signal Processing, 50, 127---132.] which depict the failure of Barkhausen oscillation building up criterion. Many counterexamples have been given in order to substantiate such viewpoint. We would like to review these reported circuit examples and present the treatment of Barkhausen oscillation criterion.
Broadband maximum likelihood estimation of shallow ocean parameters using shipping noise
Authors: C. F. Mecklenbrauker
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Environmental parameter estimation for a shallow ocean is addressed by using wideband shipping noise as a source of acoustic energy. Unknown locations of the broadband acoustic sources are estimated simultaneously with the ocean depth using the approximate conditional maximum likelihood estimator (CMLE). This procedure is tested via computer simulations and applied to the experimental hydrophone towed array data.
Exploiting hypergraph partitioning for efficient Boolean satisfiability
Authors: V. Duraira, P. Kalla
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

This paper presents hypergraph partitioning based constraint decomposition procedures to guide Boolean satisfiability search. Variable-constraint relationships are modeled on a hypergraph and partitioning based techniques are employed to decompose the constraints. Subsequently, the decomposition is analyzed to solve the CNF-SAT problem efficiently. The contributions of this research are two-fold: 1) to engineer a constraint decomposition technique using hypergraph partitioning; 2) to engineer a constraint resolution method based on this decomposition. Preliminary experiments show that our approach is fast, scalable and can significantly increase the performance (often orders of magnitude) of the SAT engine.
Real-Time Continuous Collision Detection Based on Swept Volume and Depth Texture
Authors: Ji Wang, Zhengjun Zhai, Xiaobin Cai
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

We present a novel algorithm to perform continuous collision detection in distributed virtual environment. Our algorithm consists of four stages: (1) generating depth texture of model; (2) computing depth texture of swept volume by model depth texture; (3) mapping depth image of swept volume on a face of bounding box; (4) Comparing depth of swept volume with depth of another object to detect collisions. We have implemented the algorithm and the results show that our algorithm is able to perform fast and accurate continuous collision detection and have fixed executing time to suit for real-time applications.
Search for the upper bound of Bayesian estimates of the parameter in an exponential failure model with two known quantiles of an a priori distribution function
Authors: A. N. Golodnikov
Venue: Cybernetics and Systems Analysis (2007)

A fast exact algorithm of searching for the upper bound of Bayesian estimates for the parameter of the exponential distribution under the condition that an a priori distribution belongs to the class of all distribution functions with two equal quantiles. This problem arises in analyzing the sensitivity of Bayesian estimates to the choice of an a priori distribution in an exponential failure model.
A. Richard Newton: Technologist with a Mission
Authors: Aart J. de Geus
Venue: IEEE Design Test (2007)

A. Richard Newton recently passed away with pancreatic cancer. Looking back on the past 25 years, Aart de Geus pays tribute to Richard Newton's life and contributions as a technological visionary, a beacon of optimism, and a close friend. Over the years, Richard Newton's focus matured from technology for its own sake to a something much greater: a love of technology for its positive impact on people's lives.
Bounds on filters by reconstruction
Authors: J. Crespo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

This paper treats the problem of establishing bounds for the morphological filter by reconstruction class. Morphological filters by reconstruction, which are composed of openings and closings by reconstruction, are useful filters for image processing because they do not introduce discontinuities. The main contributions of this paper are: (a) to establish when the combination of openings by reconstruction is an opening by reconstruction (similarly for closing by reconstruction), and (b) to establish, for any filter by reconstruction, upper and lower bounds that are respectively a closing by reconstruction and an opening by reconstruction.
A Hybrid Shared Memory/Message Passing Parallel Machine
Authors: Matthew I. Frank, Mary K. Vernon
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

Current and emerging high-performance parallel com puter architectures generally implement one of two types of communication mechanisms: shared memory (SM) or message passing (MP). In this paper we propose a hybrid SM/MP architecture together with a hybrid SM/MP programming model, that we believe effectively combines the advantages of each system. The SM/MP architecture contains both a high-performance coherence protocol for shared memory, and message-passing primi tives that coexist with the coherence protocol but have no coherence overhead. The SM/MP programming model provides a framework for safely and effectively using the SM/MP communication primitives. We illustrate the use of the model and primitives to reduce communication overhead in SM systems.