ppxscal/embedding_network huggingface dataset:
SEW representation for low rate WI coding
Authors: J. Lukasiak
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper considers low-rate waveform interpolation (WI) coding. It compares the existing, common slowly evolving waveform (SEW) quantisation scheme with two new schemes for representing and quantising the SEW. The first scheme uses a minimum phase estimate to reconstruct the SEW whilst the second scheme uses a pulse model whose parameters are implicitly transmitted in the quantised rapidly evolving waveform (REW). These new schemes maintain or reduce the bit rate required for transmission of the SEW. Results indicate that, for low rate WI coding, necessarily coarse SEW magnitude spectrum quantisation limits the contribution of the SEW to perceptual quality. Perceptual tests indicate that avoiding coarse spectral shape quantisation and using a fixed shape model that lends itself to smooth interpolation, maintains the perceptual quality of the synthesized speech. The proposed fixed shape model requires no bits for transmission, allowing a 12 percent reduction in the overall coder bit rate.
Unknown blocking scheme for low control data volume and high observability
Authors: Seongmoon Wang, Wenlong Wei, Srimat T. Chakradhar
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

This paper presents a new blocking logic to block unknowns for temporal compactors. The proposed blocking logic can reduce data volume required to control the blocking logic and also increase the number of scan cells that are observed by the temporal compactors. Control patterns, which describe values required at the control signals of the blocking logic, are compressed by LFSR reseeding. In this paper, the blocking logic gates for some groups of scan chains that do not capture unknowns are bypassed. Since all the scan cells in these scan chain groups are observed without specifying the corresponding bits in control patterns, fewer specified bits are required and more scan cells are observed. The seed size is further reduced by reducing numbers of specified bits in the densely specified control patterns. The proposed method can always achieve the same fault coverage that can be achieved by direct observation of scan chains. Experiments with large industrial designs clearly demonstrate that the proposed method is scalable to large circuits. Hardware overhead for the proposed blocking logic is very low.
Nonlinear Equalization for RF Receivers
Authors: Brandon Kam, Benjamin Miller, Joel Goodman, Gil Raz
Venue: Proceedings of the HPCMP Users Group Conference (2006)

This paper describes the need for High Performance Computing (HPC) to facilitate the development and implementation of a nonlinear equalizer that is capable of mitigating and/or eliminating nonlinear distortion to extend the dynamic range of radar front-end receivers decades beyond the analog state-of-the-art. The search space for the optimal nonlinear equalization (NLEQ) solution is computationally intractable using only a single desktop computer. However, we have been able to leverage a combination of an efficient greedy search with the high performance computing technologies of LLGrid and MatlabMPI to construct an NLEQ architecture that is capable of extending the dynamic range of Radar front-end receivers by over 25dB.
Compensating for variable recording conditions in frontal face authentication algorithms
Authors: A. Tefas
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

This paper addresses the problem of compensating for variable recording conditions such as changes in illumination, scale differences, and varying face position. It is well known that the performance of any face authentication/recognition algorithm deteriorates significantly in the presence of the aforementioned conditions as well as the expression variations. The use of simple and powerful pre-processing techniques aiming at compensating for variable recording conditions prior to the application of any authentication algorithm is proposed. It is shown that such an approach overcomes indeed the image variations and guarantees an almost stable performance for the Morphological Dynamic Link Architecture developed within the European research project M2VTS.
Minitrack: Mobile Technologies and Collaboration
Authors: Joseph S. Valacich, Clayton A. Looney
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This minitrack focuses on rapidly changing and evolving issues related to the use of mobile computing technologies for both human-to-human and human-to-machine collaboration. The minitrack intends to provide a forum for reporting the results of research focusing on system and application development and technology usage as well as for the reporting of user adoption, deployment, acceptance, and diffusion. Our goal is to provide a forum for idea exchange between both academicians and practitioners in the computer-based system sciences. As such, the Mobile Technologies and Collaboration minitrack focuses on the conceptual design, implementation, use, and evaluation of mobile computing technologies in controlled, organizational, and broader societal settings.
Design of A Fully Pipelined Single-Precision Multiply-Add-Fused Unit
Authors: Gongqiong Li, Zhaolin Li
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

The floating point multiply-add operation A+BxC is fundamental in many scientific and multimedia applications. This paper presents a fully pipelined single-precision multiply-add fused unit, which is based on the combination of the final addition with rounding. Normalization is performed before the final addition to determine the rounding position. A three-step normalization method is proposed for attaining latency reduction. Moreover, this paper presents a method to eliminate a one-bit error of the multiply result for increasing the precision. Finally, a new technique to deal with the number of 1, which is added in the LSB of the operand to get 2's complement, is proposed to reduce logic complexity and time delay. The overall MAF unit has a latency of 5 cycles, a throughput of 1 cycle, and a cycle time of 1.82ns in 0.18um CMOS technology.
Automatic partitioning and mapping of stream-based applications onto the Intel IXP Network processor
Authors: Sjoerd Meijer, Bart Kienhuis, Johan Walters, David Snuijf
Venue: Proceedingsof the 10th international workshop on Software compilers for embedded systems (2007)

When studying the IXP Network processor architecture from Intel, we found quite some interesting aspects that make the IXP attractive for stream-based applications. The architecture is highly optimized for streaming data, albeit in the form of internet packets. Furthermore, the architecture has Gigabit Ethernet connectors for handling incoming and outgoing traffic and can process this data at real-time using dedicated microengines. In this paper, we try to answer three questions; 1) Can we use the IXP architecture for stream-based applications? 2) can we map applications written as a KPN onto an IXP? 3) can we integrate the generation of KPNs using the Compaan compiler with a tool flow that maps the KPN to an IXP, thereby make the programming of IXP much simpler? As will be shown, all three steps can be performed and we show that we can map automatically two non-internet stream-based applications (QR and DWT) onto the IXP.
Evaluating the Design of Biological Cells Using a Computer Workbench
Authors: Tessa E. Pronk, Simon Polstra, Andy D. Pimentel, Timo M. Breit
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

For embedded systems as well as for biological cell sys- tems, design is a feature that defines their identity. The as- sembly of different components in designs of both systems can vary widely. Given the similarities between computers and cellular systems, methods and models of computation from the domain of computer systems engineering might be applied to modeling cellular systems. Our aim is to con- struct a framework that focuses on understanding the design options and consequences within a cell, taking an in sil- ico (forward-) engineering approach rather than a reverse engineering approach that is used in this domain as a de- fault now. We take our ideas from the domain of embedded computer systems. The most important features of our ap- proach, as taken from this domain, are a variable abstrac- tion level of components that allows for addition of compo- nents when detailed information is lacking, and a separa- tion of concerns between function and performance by com- ponents in the design. This allows for efficient and flexible modeling. Also, there is a strict separation between com- putation within- and communication between components, reducing complexity. As a proof of principle, we show that we can make a statement regarding the design of the gene expression machinery of the cell to produce a protein, using such a method.
A Two-stage Algorithm for Shoreline Detection
Authors: Xiaojin Gong, Anbumani Subramanian, Christopher L. Wyatt
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

Shoreline detection plays an important role in vision based navigation for autonomous surface vehicles (ASVs). It is a challenging task because of the diversity in near-bank scenarios. In this paper, we present a two-stage algorithm to find the shoreline by employing multiple features. First, we classify images into two types: reflection-unidentifiable and reflection-identifiable. Based on this classification, images are further analyzed with suitable techniques respectively. In the reflection-unidentifiable case, the surface reflection is subtle and so the water region can be separated from land by an adaptive thresholding method. The points along the edge of the water region are then identified and the shoreline is estimated through a line-fitting technique. In the reflection-identifiable case, we aim to discriminate water regions from the land by means of a two-category region classifier. Images are oversegmented into small regions based on color homogeneity. Then the characteristic features of land-water scenes like symmetry and brightness are extracted and applied to classify a region into land or water categories. Experimental results show the efficacy of our approach and robustness in diverse situations.
Warped linear time invariant systems and their application in audio signal processing
Authors: J. Garas
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

The main goal behind coordinate transformation (warping) of a linear time invariant (LTI) system is to represent its signals in terms of new basis functions that better suit the application in hand. Unitary operators simplify the analysis considerably; therefore, they are used to derive the relations between variables in the original and warped domains. These relations show that an LTI system can be warped by processing its input signals with a unitary warping transformation. An efficient implementation of this warping transformation, that is based on a nonuniform sampling theorem, is given; which allows applying the warping principle in real-time applications. As an example of exploiting this technique, it is shown that sampling an audio signal at exponentially spaced moments changes the underlying coordinates of its signal processing system to suit those of the human auditory system.
Supporting Multi-Dimensional Range Query for Sensor Networks
Authors: Yu-Chi Chung, I-Fang Su, Chiang Lee
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

This paper presents the design of Pool, an efficient and scalable data storage scheme for supporting multidimensional queries. The foundation of the work that makes the Pool approach superior in executing multi-dimensional queries is that it provides a novel and elegant higher dimension to two-dimensional data mappingmechanism. Our performance study proves the efficiency of the design.
Teaching introduction to electric circuits using computer-based instruction for manufacturing engineering students
Authors: N. Al-Holou
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

We are developing an electro-physics curriculum which integrates the fundamental contents of conventional physics with electric circuits. We discuss the difficulties and the challenges associated with using CBI to replace some aspects of traditional classroom learning.
An optimized architecture for classification combining data fusion and data-mining
Authors: George Gigli, íloi Bossé, George A. Lampropoulos
Venue: Information Fusion (2007)

This paper presents a new architecture to integrate a library of feature extraction, Data-mining, and fusion techniques to automatically and optimally configure a classification solution for a given labeled set of training patterns. The most expensive and scarce resource in any detection problem (feature selection/classification) tends to be the acquiring of labeled training patterns from which to design the system. The objective of this paper is to present a new Data-mining architecture that will include conventional Data-mining algorithms, feature selection methods and algorithmic fusion techniques to best exploit the set of labeled training patterns so as to improve the design of the overall classification system. The paper describes how feature selection and Data-mining algorithms are combined through a Genetic Algorithm, using single source data, and how multi-source data are combined through several best-suited fusion techniques by employing a Genetic Algorithm for optimal fusion. A simplified version of the overall system is tested on the detection of volcanoes in the Magellan SAR database of Venus.
A case study of Grid Computing and computer algebra: parallel Gröbner Bases and Characteristic Sets
Authors: Iyad A. Ajwa
Venue: The Journal of Supercomputing (2007)

This paper describes a parallel implementation of the Gröbner Bases algorithm and the Characteristic Sets method using a grid environment. The two algorithms, their parallelization, and grid-enabled implementations are presented. The performance of the implementations has been evaluated and the experiments have demonstrated considerable speedups.
Novel blind source separation algorithms using cumulants
Authors: S. Cruces
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

This paper investigates new algorithms for blind source separation that use cumulants instead of nonlinearities matched to the probability distribution of the sources. It is demonstrated that separation is a saddle point of a cumulant-based entropy cost function. To determine this point we propose two quasi-Newton algorithms whose convergence is isotropic and does not depend on the sources distribution. Moreover, convergence properties remain the same when there is Gaussian noise in the mixture.
Particle swarm and bayesian networks applied to attribute selection for protein functional classification
Authors: Elon S. Correa, Alex A. Freitas, Colin G. Johnson
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

The Discrete Particle Swarm (DPSO) algorithm is an optimizationmethod that belongs to the fertile paradigm of Swarm Intelligence. The DPSO was designed for the task of attribute selection and it deals with discrete variables in a straightforward manner. This work extends the DPSO algorithm in two ways. First, we enable the DPSO to select attributes for a Bayesian network algorithm, which is a much more sophisticated algorithm than the Naive Bayes classifier previously used by this algorithm. Second, we apply the DPSO to a challenging protein functional classification data set, involving a large number of classes to be predicted. The performance of the DPSO is compared to the performance of a Binary PSO on the task of selecting attributes in this challenging data set. The criteria used for comparison are: (1) maximizing predictive accuracy; and (2) finding the smallest subset of attributes.
Developing a dissemination plan
Authors: J. Froyd
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

Each proposal to the National Science Foundation (NSF) seeking support for improving engineering education must include a plan for disseminating the innovations and results that a funded project will generate. Authors may select from a variety of tactics: papers published in archival journals, conference papers, workshops, web sites, multimedia CD-ROMs, books, conference exhibits, etc. Despite the wide variety of available tactics, dissemination plans often fail to account for the behavior of the faculty members that dissemination plans are designed to reach. Faculty members, like all people, make changes in stages instead of moving from pre-awareness to action in one giant step. Various models with different numbers of stages and a diverse selection of names and characteristics of the various stages have been offered. Despite the assortment of individual change models, the kernel truth that faculty members change in stages and that effective dissemination plans are designed to facilitate transitions one stage at a time should not be overlooked. The paper presents a six-stage model for individual change that has been employed in several industrial marketing plans: pre-awareness, awareness, interest, search, decision, and action. Characteristics of an individual at each stage in the change model are presented. Once the nature of an individual at each stage is better understood, then appropriate dissemination tools that can help an individual move from one stage to the next are explored. Exploration of tools will emphasize the observation that tools that are appropriate at one stage may be ineffective for individuals at a different stage. Hopefully, the individual change model and exploration of appropriate dissemination tools will help faculty members develop more effective dissemination plans.
A grouping scheme for reliable multicast congestion control
Authors: H. Ramamurthy, A. Karandikar, R. Verma
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

Receiver heterogeneity severely constrains the performance of multicast congestion control schemes. In the typical TCP-like schemes employed for congestion control in reliable multicast, the performance is dictated by the slowest receiver. Intuitively, in the case where one bottleneck receiver is constraining the performance of other receivers, it would seem that isolating this receiver and carrying out a separate unicast conversation with it will improve the performance of the multicast transmission. In Verma et al. (2002), we formalized this notion of isolation and proposed an algorithm to partition the receivers into disjoint groups based on their bottleneck bandwidth and RTT. The sender then carries out separate conversation with each sub-group formed. In our earlier formulation, an a priori knowledge of multicast tree was assumed and hence topology was not considered while forming groups. However, simulation results have shown that topology indeed plays an important role in the performance of grouping. In this paper, we extend our grouping formulation to include the effects of topology and formulate the problem of joint routing-grouping.
Conflict-directed A* and its role in model-based embedded systems
Authors: Brian C. Williams, Robert J. Ragno
Venue: Discrete Applied Mathematics (2007)

Artificial Intelligence has traditionally used constraint satisfaction and logic to frame a wide range of problems, including planning, diagnosis, cognitive robotics and embedded systems control. However, many decision making problems are now being re-framed as optimization problems, involving a search over a discrete space for the best solution that satisfies a set of constraints. The best methods for finding optimal solutions, such as A^*, explore the space of solutions one state at a time. This paper introduces conflict-directed A^*, a method for solving optimal constraint satisfaction problems. Conflict-directed A^* searches the state space in best first order, but accelerates the search process by eliminating subspaces around each state that are inconsistent. This elimination process builds upon the concepts of conflict and kernel diagnosis used in model-based diagnosis [J. de Kleer, B.C. Williams, Diagnosing multiple faults, Artif. Intell. 32(1) (1987) 97-130; J. de Kleer, A. Mackworth, R. Reiter, Characterizing diagnoses and systems, Artif. Intell. 56 (1992) 197-222] and in dependency-directed search [R. Stallman, G.J. Sussman, Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis, Artif. Intell. 9 (1977) 135-196; J. Gaschnig, Performance measurement and analysis of certain search algorithms, Technical Report CMU-CS-79-124, Carnegie-Mellon University, Pittsburgh, PA, 1979; J. de Kleer, B.C. Williams, Back to backtracking: controlling the ATMS, in: Proceedings of AAAI-86, 1986, pp. 910-917; M. Ginsberg, Dynamic backtracking, J. Artif. Intell. Res. 1 (1993) 25-46]. Conflict-directed A^* is a fundamental tool for building model-based embedded systems, and has been used to solve a range of problems, including fault isolation [J. de Kleer, B.C. Williams, Diagnosing multiple faults, Artif. Intell. 32(1) (1987) 97-130], diagnosis [J. de Kleer, B.C. Williams, Diagnosis with behavioral modes, in: Proceedings of IJCAI-89, 1989, pp. 1324-1330], mode estimation and repair [B.C. Williams, P. Nayak, A model-based approach to reactive self-configuring systems, in: Proceedings of AAAI-96, 1996, pp. 971-978], model-compilation [B.C. Williams, P. Nayak, A reactive planner for a model-based executive, in: Proceedings of IJCAI-97, 1997] and model-based programming [M. Ingham, R. Ragno, B.C. Williams, A reactive model-based programming language for robotic space explorers, in: Proceedings of ISAIRAS-01, 2001].
On operators providing shift-invariant uncertainty limit
Authors: M. Doroslovacki
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

The uncertainty relation is introduced by using operators which are not necessarily self-adjoint. In general, the uncertainty (lower) limit is different for different functions. Operators are found that define the second moments and the uncertainty limit for their product such that the limit is the same for functions obtained from each other by applying unitary support-size preserving operators, e.g. by shifting in time and frequency. In this case, for all functions of finite energy the limit is related to the minimum support size in the time-frequency domain. Moreover, it is possible to find the discrete-time counterpart of the classical uncertainty relation for continuous-time functions. The operator calculus presents results from signal analysis in a more standard form extensively used in quantum mechanics.