ppxscal/embedding_network huggingface dataset:
Evolutionary spectral analysis using a warped Gabor expansion
Authors: A. Akan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

In this paper, we present a Gabor representation based on a nonrectangular tiling of the time-frequency plane and use it to improve the time and frequency resolutions of evolutionary spectra. In the traditional Gabor expansion, a signal is decomposed into a weighted combination of sinusoidally modulated windows resulting in a rectangular time-frequency plane tiling. Poor time and frequency localizations occur in the evolutionary spectrum when the corresponding signal is not modeled well by this fixed-window analysis. We are thus proposing the warped Gabor representation based on a linear chirp model for the signal. By means of a frequency transformation we are able to use the previous sinusoidal representation and choose the Gabor coefficients according to either a frequency masking or an energy concentration measure. Examples are given to illustrate our procedures.
DS&#x002F;CDMA throughput of a multi-hop sensor network in a Rayleigh fading underwater acoustic channel: Research Articles
Authors: Choong Hock Mar, Winston K. G. Seah
Venue: Concurrency and Computation: Practice Experience (2007)

Asynchronous half-duplex Direct-Sequence Code-Division Multiple-Access (DS&#x002F;CDMA) is a suitable candidate for the MAC protocol design of underwater acoustic (UWA) sensor networks owing to its many attractive features. Our ad-hoc multi-hop network is infrastructureless in that it is without centralized base stations or power control. Hence, we develop an asynchronous distributed half-duplex control protocol to regulate between the transmitting and receiving phases of transmissions. Furthermore, multi-hop communications are very sensitive to the time variability of the received signal strength in the fading channel and the ambient noise dominated by snapping shrimp in harsh underwater environments, because a broken link in the multi-hop path is enough to disrupt communications and initiate new route searches. In our configuration, we use the Ad hoc On-demand Distance Vector (AODV) routing protocol optimized for UWA networks. Empirical studies show that we can model the channel as a slow-varying frequency non-selective Rayleigh fading channel. We theoretically analyze the throughput of our configuration by considering three salient features: the ability of the receiver to demodulate the data, the effect of our control protocol and the effect of disconnections on the generation of routing packets. The throughput under various operating conditions is then examined. It is observed that at optimal node separation, the throughput is improved by a factor of 10. Copyright &copy; 2007 John Wiley & Sons, Ltd.
On the Expressiveness of Mobile Synchronizing Petri Nets
Authors: Fernando Rosa-Velardo, David de Frutos-Escrig, Olga Marroquín-Alonso
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

In recent papers we have introduced Mobile Synchronizing Petri Nets, a new model for mobility based on coloured Petri Nets. It allows the description of systems composed of a collection of (possibly mobile) hardware devices and mobile agents, both modelled in a homogenous way and abstracting from middleware details. Our basic model introduced a colour to describe localities, but still lacked appropriate primitives to deal with security, and in fact it was equivalent to P/T nets. Then, we introduced the primitives to cope with security: a new colour for identifiers, basically corresponding to the natural numbers, that are created by means of a special transition. This mechanism allows us to deal with authentication issues. In this paper we discuss the expressiveness of the extended model with the authentication primitives. More specifically, we study several instances of the classical reachability and coverability problems. Finally, we also study a more abstract version of the mechanism to create identifiers, using abstract names, close to those in the @p-calculus or the Ambient Calculus. We have proved that both models are strictly in between P/T nets and Turing machines.
Server-assisted speech recognition over the Internet
Authors: A. Klautau
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

We propose a new architecture for deploying speech recognition over the Internet. The client performs the recognition, but is assisted by the server who computes the speech parameters. To demonstrate the architecture, we developed a Java-based Web-navigation system where the precomputed HMM models of the hyperlinked words are stored on the Web page and downloaded by the client. We tested the system on a digit-recognition example. The results show that with quantization and compression of the speech parameters, good recognition can be achieved in acceptable download and calculation time even on clients with modest connection speeds and computational powers.
Flexible Workflows for Digital Design in the Nano Era
Authors: Mirjam Minor, Andreas Koldehoff, Daniel Schmalen, Ralph Bergmann
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

This paper presents work in progress on an adaptive workflow management tool for digital design projects. The chip design follows standardized default processes which are adapted during an ongoing project by changing requirements from both design and application imponderabilities. Our approach focuses on flexible monitoring and authoring support of adaptive workflows in a real-world application.
Model-based hardware design for image processing systems
Authors: Shuvra S. Bhattacharyya
Venue:  (2006)

Model-based design has been touted as the most viable design methodology of the future for the design of embedded hardware/software systems. Due to the large complexity of modern embedded systems, it is more and more error-prone to design systems without having a formal model to support and verify the application at design time. Also, formal models generally capture broad classes of applications, and thus any innovation on a modeling technique has the potential to enhance every individual application in the associated class. Often, a formal model captures the high-level abstraction of an application, which is lost in the final implementation, and thus modeling gives an effective platform to perform high-level design optimizations. Dataflow graphs have been widely used as formal models in the signal processing domain for a long time, and various commercial tools have adopted dataflow semantics for model-based design methodology. In this thesis, we develop a new dataflow meta-modeling technique, called homogeneous parameterized dataflow (HPDF). HPDF is a meta-modeling technique in that it can be applied to a variety of underlying dataflow models of computation to enhance their expressive power, while maintaining much of the useful structure of the underlying models. HPDF addresses an important range of applications, especially in the image processing domain. We present various properties and capabilities of HPDF, including the notions of repetitions vector, valid schedule, derivation of looped schedules, single-rate equivalent graphs, and HPDF graph transformation methods. We also give three in-depth examples of complex systems that we have studied to demonstrate the capabilities of HPDF---a gesture recognition application, an image registration application, and a gait-DNA application. For hardware implementation, we target our applications onto Xilinx and Altera field programmable gate arrays (FPGAs), and we present results from the hardware mapping of the gesture recognition and the image registration application. To build a foundation for further broadening the impact of HPDF modeling, we present initial work on applying cyclo-static dataflow as an intermediate representation for mapping MATLAB programs into hardware implementations. Because of the compatibility between cyclo-static dataflow and the HPDF meta-modeling approach, which we demonstrate in Chapter 3 of this thesis, this is an important first step to exploiting HPDF techniques in the context of MATLAB-to-hardware synthesis. In particular, we focus on relating cyclo-static dataflow to Compaan process networks, which is a variant of the Kahn process network model of computation that has been shown to be useful in representing concurrency in MATLAB programs. In summary, this thesis develops a useful new meta-modeling approach for implementing an important class of image processing applications, and develops and extensively demonstrates a methodology for efficient hardware implementation from representations in the proposed new meta-model.
A PDA client for the computational Grid: Research Articles
Authors: M. Parkin, J. M. Brooke
Venue: Concurrency and Computation: Practice Experience (2007)

Access to the computational Grid is restricted to the laptop and desktop environment since Grid client development has been concentrated in this area. This paper presents the design and implementation of a new, lightweight computational Grid client that provides the same level of functionality and security as its desktop counterparts whilst conforming to the limitations and restrictions of a Personal Digital Assistant environment. A solution has been achieved by taking an architectural perspective of the problem and choosing a tiered, asymmetrical Grid middleware providing an asynchronous messaging model with uniform interface to all resources. The client opens up a new area of Grid computing access: secure and flexible job submission and monitoring to dependable, persistent, powerful and consistent computing services provided by a computational Grid has been freed from static environments into the mobile domain. This has been done without the modification of the underlying Grid middleware and using standards-based protocols and components: J2ME, X.509 certificates, Secure Socket Layer connections and IEEE 802.11b wireless networking. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Automatic configuration of internet services
Authors: Wei Zheng, Ricardo Bianchini, Thu D. Nguyen
Venue: Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007 (2007)

Recent research has found that operators frequently misconfigure Internet services, causing various availability and performance problems. In this paper, we propose a software infrastructure that eliminates several types of misconfiguration by automating the generation of configuration files in Internet services, even as the services evolve. The infrastructure comprises a custom scripting language, configuration file templates, communicating runtime monitors, and heuristic algorithms to detect dependencies between configuration parameters and select ideal configurations. To demonstrate our infrastructure experimentally, we apply it to a realistic online auction service. Our results show that the infrastructure can simplify operation significantly while eliminating 58% of the misconfigurations found in a previous study of the same service. Furthermore, our results show that the infrastructure can efficiently determine the configuration parameters that lead to high performance as the service evolves through a hardware upgrade and the scheduled maintenance of a few nodes.
Practical implementation of LMMSE demosaicing using luminance and chrominance spaces
Authors: Brice Chaix de Lavarène, David Alleysson, Jeanny Hérault
Venue: Computer Vision and Image Understanding (2007)

Most digital color cameras sample only one color at each spatial location, using a single sensor coupled with a color filter array (CFA). An interpolation step called demosaicing (or demosaicking) is required for rendering a color image from the acquired CFA image. Already proposed linear minimum mean square error (LMMSE) demosaicing provides a good tradeoff between quality and computational cost for embedded systems. In this paper we propose a modification of the stacked notation of superpixels, which allows an effective computing of the LMMSE solution from an image database. Moreover, this formalism is used to decompose the CFA sampling into a sum of a luminance estimator and a chrominance projector. This decomposition allows interpreting estimated filters in term of their spatial and chromatic properties and results in a solution with lower computational complexity than other LMMSE approaches for the same quality.
Perceptual bit allocation for low rate coding of narrowband audio
Authors: H. Najafzadeh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

In this work we consider adaptive bit allocation for perceptual coding of narrowband audio signals at low rates (down to 8 kbit/s). Two different strategies are used to shape the audible noise spectrum. In one approach, the quantization noise spectrum is shaped in parallel with the masking threshold curve. This way the noise is equally audible in different frequency bands. The other approach generates a flat noise spectrum above the masking threshold. The noise power is not equally distributed over the frequency range, hence it is audible to various extents at different frequencies.
Efficiency of real-time Gaussian transient detectors: comparing the Karhunen-Loeve and the wavelet decompositions
Authors: F. M. Garcia
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

In general, finite-dimensional discrete-time representations of continuous-time Gaussian transients is not complete. Such representations typically lead to suboptimal detectors, where the compromise between computational complexity and processor performance requires optimization, specially when real-time processing is mandatory. This paper proposes a procedure for the optimization of the processor parameters, using the Bhattacharyya distance to evaluate the resemblance between the original continuous-time signal and its finite dimensional discrete representation. Two different decompositions are analyzed and compared, namely the Karhunen-Loeve decomposition (KLD) and the discrete wavelet transform (DWT). It is shown that the DWT presents serious advantages when the signals to detect have a large number of important eigenvalues, which is often the case in some applications such as passive sonar.
Adaptive bimodal sensor fusion for automatic speechreading
Authors: U. Meier
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

We present work on improving the performance of automated speech recognizers by using additional visual information: (lip-/speechreading); achieving error reduction of up to 50%. This paper focuses on different methods of combining the visual and acoustic data to improve the recognition performance. We show this on an extension of an existing state-of-the-art speech recognition system, a modular MS-TDNN. We have developed adaptive combination methods at several levels of the recognition network. Additional information such as estimated signal-to-noise ratio (SNR) is used in some cases. The results of the different combination methods are shown for clean speech and data with artificial noise (white, music, motor). The new combination methods adapt automatically to varying noise conditions making hand-tuned parameters unnecessary.
Subband based MPEG audio mixing for Internet streaming applications
Authors: P. de Smet
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

We investigate a special-purpose application of MPEG-1 layer II audio streaming. First, we discuss how two or more already coded MPEG-audio bitstreams can be manipulated and mixed within the coded subband domain by using an appropriate algorithm for combining and recalculating the bit allocation. Next, we show that very significant speedups can be obtained compared with mixing in the temporal domain. We also illustrate that, at the same time, the system can act as a bit rate scaling device, using one of the bit allocation-combination algorithms which we implemented. The results obtained with these different algorithms are discussed and compared. Finally, we report on how the developed software was integrated into an Internet audio streaming system, which is now able to allow simple, yet efficient, real-time mixing of several MPEG-audio coded signals.
Parallel implementation of niched Pareto genetic algorithm code for X-ray plasma spectroscopy
Authors: I. E. Golovkin, S. J. Louis, R. C. Mancini
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

We use a Pareto optimal genetic algorithm to determine plasma temperature and density through X-ray spectroscopic diagnostics. Pareto selection provides better solutions compared with linear combinations of the two optimization criteria. Parallelizing the genetic algorithm achieves linear speed-up and allows larger populations resulting in improved reliability in reasonable running time.
The Neutrino Strikes Again
Authors: Norman Chonacky
Venue: Computing in Science and Engineering (2007)

The editor in chief describes how the conferences he's attended so far this year will affect our editorial calendar offerings in the latter half of 2007.
A dependence maximization view of clustering
Authors: Le Song, Alex Smola, Arthur Gretton, Karsten M. Borgwardt
Venue: Proceedings of the 24th international conference on Machine learning (2007)

We propose a family of clustering algorithms based on the maximization of dependence between the input variables and their cluster labels, as expressed by the Hilbert-Schmidt Independence Criterion (HSIC). Under this framework, we unify the geometric, spectral, and statistical dependence views of clustering, and subsume many existing algorithms as special cases (e.g. k-means and spectral clustering). Distinctive to our framework is that kernels can also be applied on the labels, which can endow them with particular structures. We also obtain a perturbation bound on the change in k-means clustering.
High-performance distributed objects over system area networks
Authors: Alessandro Forin, Galen Hunt, Li Li, Yi-Min Wang
Venue: Proceedings of the 3rd conference on USENIX Windows NT Symposium - Volume 3 (1999)

In this paper, we describe an approach to build high-performance, commercial distributed object systems over system area networks (SANs) with user-level networking. The specific platforms we use in this study are the Virtual Interface Architecture (VIA) and Microsoft's Distributed Component Object Model (DCOM). We give a detailed functional and performance analysis of DCOM and apply optimizations at several layers to take full advantage of modern high-speed networks. Our optimizations preserve the full set of DCOM features including security, alternative threading models, and Microsoft Transaction Server (MTS). Through extensive runtime, transport and marshaling optimization, our system achieves round-trip latencies of 72 microseconds for DCOM calls and 174 microseconds for MTS calls, and an application bandwidth of 86.1 megabytes per second. We also examine the performance gains in real applications.
Secure Spatial Authentication using Cell Phones
Authors: Arjan Durresi, Vamsi Paruchuri, Mimoza Durresi, Leonard Barolli
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

The latest estimates suggest that there are over 2 billion cell phone users worldwide [1] . The massive worldwide usage has prompted technological advances which have resulted in more features being packed in the same phone. New dual phones are being built which can connect to both the cellular network and other wireless devices. In this paper we propose to use the omnipresent cell phones and the secure cellular network for access and location control. Using the cellular network adds to the strength of the authentication process and makes the revocation of access for a user easy. Our scheme also provides spatial control of the entity seeking authentication. In a cell phone based authentication system, our scheme provides location based authentication using two different approaches. One approach uses a trusted hardware sensor placed at a location close to the cell phone to validate the presence of the cell phone. Another approach to obtain the desired spatial control is through the use of GPS. The cellular phones would present the authentication server and the cellular network with the GPS coordinates of its current location using a tamper proof GPS module. This approach also prevents wormhole attacks because the cell phone has to provide the same coordinates to both the authentication server and the cellular network.
Digital systems and electronics curricula proposal and tool integration
Authors: M. Castra
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

To transmit the teaching of digital electronics today, considerations are outlined which must be kept in mind. Digital electronics is evolving quickly and its techniques and tools have revolutionized the manner of analyzing simulating, synthesizing and verifying digital systems. Microelectronic development is more and more dependant on the technology and on design methodology. Standard hardware description languages (Verilog and VHDL), together with simulation and synthesis tools are some of the drivers behind microelectronic development. The "constructivist" model in the teaching-learning process proposes: significant learning as opposed to memorizing; structuring and sequencing of content; learning through guided discovery and a spiral or recurring procedure. These circumstances, together with pedagogical concern and the knowledge and experience that the authors have acquired as digital electronics teaching Professors have resulted in the formulation of a curricular proposal to transmit this updated teaching method. Using this teaching model as a base, the aim of the proposal is to have the student studying digital electronics acquire the theory and practices (know-how) from the beginning by using current design methodologies and CAD and EDA tools that the students will use in their professional future. Another objective of this method is to provide students with multimedia applications as a learning resource.
On the utilization of overshoot effects in low-delay audio coding
Authors: A. Harma
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

In low-delay audio coding (coding delay
SuGAR: A Framework to Support Mammogram Diagnosis
Authors: Marcela X. Ribeiro, Agma J. M. Traina, Andre G. R. Balan, Caetano Traina Jr., Paulo M. A. Marques
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

In this paper we present a framework based on association-rules to help diagnosis of mammogram abnormalities. Our framework - SuGAR - combines low-level features automatically extracted from images with high-level knowledge gotten from specialists to mine association rules, suggesting possible diagnoses. Our framework is optimized, in the sense that it combines, in a single step, feature selection and discretization, reducing the mining complexity. The framework was applied to real datasets and the results show high sensitivity (up to 95%) and accuracy (up to 92%), allowing us to claim that association rules can effectively aid in the diagnosing task.