ppxscal/embedding_network huggingface dataset:
Fast Genetic Programming and Artificial Developmental Systems on GPUs
Authors: Simon Harding, Wolfgang Banzhaf
Venue: Proceedings of the 21st International Symposium on High Performance Computing Systems and Applications (2007)

In this paper we demonstrate the use of the Graphics Processing Unit (GPU) to accelerate Evolutionary Computation applications, in particular Genetic Programming approaches. We show that it is possible to get speed increases of several hundred times over a typical CPU implementation, catapulting GPU processing for these applications into the realm of HPC. This increase in performance also extends to artificial developmental systems, where evolved programs are used to construct cellular systems. Feasibility of this approach to efficiently evaluate artificial developmental systems based on cellular automata is demonstrated.
Wavelets in polar coordinates
Authors: O. Andric
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

The problems encountered in the development and implementation of two-dimensional orthonormal wavelet bases and their filter banks in polar coordinates are addressed. These wavelets and filter banks have possible applications in processing signals that are collected by sensors working in the polar coordinate system, such as biomedical and radar generated signals. Wavelet bases are developed in the convenient and familiar surrounding of the rectangular plane, and the theory is transported to the polar plane. Corresponding filter banks are developed and the implementation of wavelet analysis in the polar plane is discussed. Examples are provided.
Utilizing Averaged Configuations from Molecular Dynamics Simulation Trajectories
Authors: P. G. Kusalik, K. Gillis, J. Vatamanu
Venue: Proceedings of the 21st International Symposium on High Performance Computing Systems and Applications (2007)

One of the challenges in the large-scale simulations required for many molecular systems (such as those of biological interested) is the recording, monitoring and visualization of configurational information from molecular dynamics trajectories spanning millions, and sometimes billions, of timesteps. A detailed record of instantaneous configurations along the full trajectory can quickly become unmanageable. In this paper we will describe an alternative approach that utilizes time coarse-graining, where configurations averaged over trajectory segments are used to follow the detailed molecular behaviour of a system over multiple-nanosecond simulations. We will demonstrate that the sensitivity of structural measures (order parameters) can be dramatically enhanced when applied to averaged configurations. We then specifically discuss the successful application of this approach to molecular dynamics simulations of crystal growth.
ShaLTeRR: A contribution to short and long-term redundancy reduction in digital signals
Authors: Bachir Boucheham
Venue: Signal Processing (2007)

We suggest a novel time domain lossy compression method for digital signals. The method is composed of two main steps: Short-term redundancy reduction (STRR) and long-term redundancy reduction (LTRR). The STRR step uses a variant of the Douglas-Peucker line simplification algorithm. The LTRR step uses a combined block-sorting and curve simplification technique to reduce long-term redundancy. The proposed method is a general-purpose signals compression scheme, with more efficiency for quasi-periodic signals. In that respect, it has been applied to ECG signals selected from the MIT-BIH database and compared to existing recent time domain (CCSP), wavelet-based and TSVD methods. Results show that the proposed algorithm is in a comfortable competitive position with the most performant methods for moderate and near-lossless compression.
An operating system in java for the Lego Mindstorms RCX microcontroller
Authors: Pekka Nikander
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

The Lego Mindstorms is a Lego bricks based robotics toy series produced by the Lego Group, based on the ideas developed at the Massachusetts Institute of Technology in the Programmable Brick project. The heart of a Lego robot, the RCX microcontroller, hosts a Hitachi H8 microcontroller with 28 kilobytes of memory available for downloadable firmware and applications. In addition to the GUI based programming environment provided by Lego, a number of alternative programming environments have been developed for the RCX. However, these alternative programming environments are written in C, tightly bound to the hardware, and provide only relatively low level services. The strong hardware dependency makes it hard to debug programs; in practice, a hardware simulator is needed, and such a simulator does not yet exist in an open source form. In this paper we present a new type of operating system and new programming environments for the Lego RCX brick. The operating system is written almost completely in Java, and currently provides runtime support for Java, C and C++ programs. In the case of Java applications, simulation and debugging is relatively simple as it can be performed on a standard Java Virtual Machine with just a small hardware simulation package.
Let's Have a Conversation
Authors: Gregor Hohpe
Venue: IEEE Internet Computing (2007)

Using procedure call semantics for distributed systems is generally considered a bad idea, so systems should communicate in a more loosely coupled way--preferably by exchanging messages. Message-based communication results in a simple interaction model and, if used with message queues, temporal decoupling between sender and receiver. Defining a conversation policy--that is, a description of all legal conversations--is an important step in establishing service contracts between providers and consumers, but doing so can be a complicated task. Luckily, this problem hasn't escaped the various standards and specification committees, so we have several approaches from which to learn.
Letters: Optimal solution to crossbar packet-switch problems using a sequential binary Hopfield neural network
Authors: Sancho Salcedo-Sanz, Jose A. Portilla-Figueras
Venue: Neurocomputing (2007)

In this paper a sequential binary Hopfield network architecture to solve crossbar switch problems (CSP) is proposed. It is shown that the sequential Hopfield algorithm's performance on the CSP depends on the neurons' updating ordering, and also an optimal ordering for the CSP is proposed. Our sequential binary Hopfield network has been applied to the resolution of large and very large CSP instances, obtaining optimal solutions within less steps than previous approaches to this problem.
The Lombard effect: a reflex to better communicate with others in noise
Authors: J.-C. Junqua
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

To study the Lombard (1911) reflex, more realistic databases representing real-world conditions need to be recorded and analyzed. In this paper we (1) summarize a procedure to record Lombard data which provides a good approximation of realistic conditions, (2) present an analysis per class of sounds for duration and energy of words recorded while subjects are listening to noise through open-ear headphones (a) when speakers are in communication with a recognition device and (b) when reading a list, and (3) report on the influence of speaking style on speaker dependent and speaker-independent experiments. This paper extends a previous study aimed at analyzing the influence of the communication factor on the Lombard reflex. We also show evidence that it is difficult to separate the speaker from the environment stressor (in this case the noise) when studying the Lombard reflex. The main conclusion of our pilot study is that the communication factor should not be neglected because it strongly influences the Lombard reflex.
Circuit-level modeling and detection of metallic carbon nanotube defects in carbon nanotube FETs
Authors: Hamidreza Hashempour, Fabrizio Lombardi
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Carbon Nanotube Field Effect Transistors (CNTFET) are promising nano-scaled devices for implementing high performance, very dense and low power circuits. The core of a CNTFET is a carbon nanotube. Its conductance property is determined by the so-called chirality of the tube; chirality is difficult to control during manufacturing. This results in conducting (metallic) nanotubes and defective CNTFETs similar to stuck-on (SON or source-drain short) faults, as encountered in classical MOS devices. This paper studies this phenomenon by using layout information and presents modeling and detection methodologies for nano-scaled defects arising from the presence of metallic carbon nanotubes. For CNTFET-based circuits (e.g. intramolecular), these defects are analyzed using a traditional stuck-at fault model. This analysis is applicable to primitive and complex gates. Simulation results are presented for detecting modeled metallic nanotube faults in CNTFETs using a single stuck-at fault test set. A high coverage is achieved (~98%).
An Improved Real-Time Natural Feature Tracking Algorithm for AR Application
Authors: Jing Chen, Yongtian Wang, Yu Li, Wenze Hu, Xiaojun Zang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

A real-time camera registration algorithm using nature features for augmented reality applications is presented. The system uses a single camera for visual tracking of the nature features extracted from the real scene. A limited number of calibrated key-frames and a rough 3D model of the part of the real environment are required. Accurate camera registration can be achieved by matching the input image and the keyframe, whose viewpoint is as close as possible to each other. The problem of wide baseline correspondence is solved by rendering an intermediate image. Extended Kalman filter is applied for jitter correction. The performance of the algorithm is tested using real image sequences. Experimental results demonstrate that our registration algorithm is accurate and robust, and it can handle significant aspect changes.
Towards 3-query locally decodable codes of subexponential length
Authors: Sergey Yekhanin
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

A q-query Locally Decodable Code (LDC) encodes an n-bitmessage x as an n-bit codeword C(x), such that one canprobabilistically recover any bit xi of the message by queryingonly q bits of the codeword C(x), even after some constantfraction of codeword bits has been corrupted.We give new constructions of three query LDCs of vastly shorterlength than that of previous constructions. Specifically, givenany Mersenne prime p = 2t - 1, we design three query LDCs of length N=(n1/t), for every n. Based on thelargest known Mersenne prime, this translates to a length of less than exp(n10-7), compared to exp(n1/2) in the previous constructions. It hasoften been conjectured that there are infinitely many Mersenneprimes. Under this conjecture, our constructions yield three querylocally decodable codes of length N=exp(nO(1/(log log n))) forinfinitely many n. We also obtain analogous improvements for Private InformationRetrieval (PIR) schemes. We give 3-server PIR schemes withcommunication complexity of O(n10-7) to accessan n-bit database, compared to the previous best scheme withcomplexity O(n1/5.25). Assuming again that there areinfinitely many Mersenne primes, we get 3-server PIR schemes ofcommunication complexity nO(1/(log log n))for infinitely many n. Previous families of LDCs and PIR schemes were based on theproperties of low-degree multivariate polynomials over finitefields. Our constructions are completely different and areobtained by constructing a large number of vectors in a smalldimensional vector space whose inner products are restricted tolie in an algebraically nice set.
25 years of frontiers educational research: the call for action-oriented research
Authors: W. K. LeBold, S. K. Ward
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Since the first FIE conference a quarter of a century ago (1970), engineering educational research at Purdue has shifted from status quo oriented research to action oriented research. Earlier our emphasis was on providing information, examining relationships, identifying strengths and delineating problems. We analyzed the correlation of high school grades and test scores with college GPA. We documented trends in enrolment, grades, and retention. We surveyed students and graduates regarding the quality and relevance of their education. Sometimes we even defined areas requiring action. However after the first FIE Conference 25 years ago, our research efforts shifted to action oriented research. How could we use educational research information to change and improve engineering education? We describe action oriented research that has significantly improved placement in beginning courses, helped students make more informed career decisions, increased and retained more women and minority students, and enhanced our programs for honors and higher risk students. We also describe how we have extended our educational research efforts beyond our own campus and are sharing our educational research findings and action oriented programs with other institutional settings and colleagues all over the world. We also speculate on what direction institutional and collaborative engineering educational research is likely to take during the next quarter of a century.
On phase perception in speech
Authors: H. Pobloth
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

In this paper we define perceptual phase capacity as the size of a codebook of phase spectra necessary to represent all possible phase spectra in a perceptually accurate manner. We determine the perceptual phase capacity for voiced speech. To this purpose, we use an auditory model which indicates if phase spectrum changes are audible or not. The correct performance of the model was adjusted and verified by listening tests. The perceptual phase capacity in low pitched speech is found to be much higher than it is for high pitched speech. Our results are consistent with the well known fact that speech coding schemes which preserve the phase accurately work better for male voices, while coders which put more weight on the amplitude spectrum of the speech signal result in better quality for female speech.
High Quality Voice Conversion through Combining Modified GMM and Formant Mapping for Mandarin
Authors: Kun Liu, Jianping Zhang, Yonghong Yan
Venue: Proceedings of the Second International Conference on Digital Telecommunications (2007)

A novel voice conversion system using formant mapping based on modified GMM technique is proposed in this paper. Compared with the traditional GMM technique, our modified GMM technique selects the stable frames automatically in each vowel phoneme for parameter extraction to avoid using the parameters in the transition part. With the spectral parameters extracted from the stable frames, phoneme-based GMM model is built. In the transformation procedure, the transformed formant frequencies at the main vowel phonemes are obtained using the corresponding GMM model. After this, the spectrum of the test speech is warped in frequency axis using warping functions determined with the transformed formant frequencies and original ones. Besides, fundamental frequencies, average energy and speaking rate are also transformed. Finally the converted speech is re-synthesized with the transformed parameters by high quality speech manipulation framework STRAIGHT. Perceptual results for F-M and M-F conversion show that our MOS score of the converted voice is improved from 3.8 to 4.1 and ABX score from 3.3 to 3.8 compared with IBM's system. Comparisons with other systems are also given in this paper.
Correlating Social Interactions to Release History During Software Evolution
Authors: Olga Baysal, Andrew J. Malton
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

In this paper, we propose a method to reason about the nature of software changes by mining and correlating discussion archives. We employ an information retrieval approach to find correlation between source code change history and history of social interactions surrounding these changes. We apply our correlation method on two software systems, LSEdit and Apache Ant. The results of these exploratory case studies demonstrate the evidence of similarity between the content of free-form text emails among developers and the actual modifications in the code. We identify a set of correlation patterns between discussion and changed code vocabularies and discover that some releases referred to as minor should instead fall under the major category. These patterns can be used to give estimations about the type of a change and time needed to implement it.
Advances in confidence measures for large vocabulary
Authors: A. Wendemuth
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

This paper addresses the correct choice and combination of confidence measures in large vocabulary speech recognition tasks. We classify single words within continuous as well as large vocabulary utterances into two categories: utterances within the vocabulary which are recognized correctly, and other utterances, namely misrecognized utterances or (less frequent) out-of-vocabulary (OOV). To this end, we investigate the classification error rate (CER) of several classes of confidence measures and transformations. In particular, we employed data-independent and data-dependent measures. The transformations we investigated include mapping to single confidence measures and linear combinations of these measures. These combinations are computed by means of neural networks trained with Bayes-optimal, and with Gardner-Derrida-optimal criteria. Compared to a recognition system without confidence measures, the selection of (various combinations of) confidence measures, the selection of suitable neural network architectures and training methods, continuously improves the CER.
Supporting UML Sequence Diagrams Using a Processor Net Model
Authors: Tony Spiteri Staines
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

This paper describes how UML sequence diagrams can be supported using an executable processor net. Distributed real time transaction processing systems require validation, verification and performance analysis. A method for doing this is presented creating a processor net for a flight reservation. Some advantages of this approach are the creation of executable models, schemas, formalization and performance analysis .Other issues are discussed.
Low Input-Impedance Current-Mirror for High-Speed Data Communication
Authors: Ivo Lattenberg, Kamil Vrba
Venue: Proceedings of the Sixth International Conference on Networking (2007)

The paper deals with a novel low input impedance current mirror for analog high-speed data signal pre-processing as the basic building block of pure current mode filters. The principle of reducing the input impedance of current mirror is shown. A comparison of the features of the proposed current mirror with low input impedance and the other types of current mirror using both the symbolic and the numerical method is performed.
Mothers of Pipelines
Authors: Sava Krstić, Robert B. Jones, John O'Leary
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We present a method for pipeline verification using SMT solvers. It is based on a non-deterministic ''mother pipeline'' machine (MOP) that abstracts the instruction set architecture (ISA). The MOP vs. ISA correctness theorem splits naturally into a large number of simple subgoals. This theorem reduces proving the correctness of a given pipelined implementation of the ISA to verifying that each of its transitions can be modeled as a sequence of MOP state transitions.
LIVE:: a light-weight data workspace for computational science
Authors: Hasan Abbasi, Matthew Wolf, Karsten Schwan
Venue: Proceedings of the 16th international symposium on High performance distributed computing (2007)

We present the Lightweight Information Validation Environment, LIVE as asolution to the high complexity and data sizes of modern day computational science applications. LIVE is a data workspace that facilitates the creation of dynamic data processing overlays we call I/O graphs. We use LIVE as aplatform for dynamic extension of scientific applications using lightweight data extraction, runtime discovery and flexible data selection.
Statistical analysis of students' performance in new engineering science core courses with economic and design concepts
Authors: W. R. Callen, S. M. Jeter, A. Koblasz, G. J. Thuesen, H. R. Leep, H. R. Parsaei, T. A. Weigel, J. T. Luxhoi
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

This paper presents the results of statistical analysis conducted on the data collected from a four-year project funded by National Science Foundation. The primary objective of this multi-year, project involving five institutions was to determine the performance of the engineering students in a core of four integrated engineering science courses featuring advanced design and economic content.
Designing a Posture Analysis System with Hardware Implementation
Authors: J. G. Coutinho, M. P. Juvonen, J. L. Wang, B. L. Lo, W. Luk, O. Mencer, G. Z. Yang
Venue: Journal of VLSI Signal Processing Systems (2007)

Posture analysis is an active research area in computer vision for applications such as home care and security monitoring. This paper describes the design of a system for posture analysis with hardware acceleration, addressing the following four aspects: (a) a design workflow for posture analysis based on radial shape and projection histogram representations; (b) the implementation of different architectures based on a high-level hardware design approach with support for automating transformations to improve parallelism and resource optimisation; (c) accuracy evaluation of the proposed posture analysis system, and (d) performance evaluation for the derived designs. One of the designs, which targets a Xilinx XC2V6000 FPGA at 90.2 MHz, is able to perform posture analysis at a rate of 1,164 frames per second with a frame size of 320 by 240 pixels. It represents 3.5 times speedup over optimised software running on a 2.4 GHz AMD Athlon 64 3700+ computer. The frame rate is well above that of real-time video, which enables the sharing of the FPGA among multiple video sources.
Bounds on Redundancy in Constrained Delay Arithmetic Coding
Authors: Ofer Shayevitz, Eado Meron, Meir Feder, Ram Zamir
Venue: Proceedings of the 2007 Data Compression Conference (2007)

We address the problem of a ¯nite delay constraint in an arithmetic coding system. Due to the nature of the arithmetic coding process, source sequences causing arbitrarily large encoding or decoding delays exist. Therefore, to meet a ¯nite delay constraint, it is necessary to intervene with the normal °ow of the coding process, e.g., to insert ¯ctitious symbols. This results in an in- evitable coding rate redundancy. In this paper, we derive an upper bound on the achievable redundancy for a memoryless source. We show that this redun- dancy decays exponentially as a function of the delay constraint, and thus it is clearly superior to block to variable methods in that aspect. The redundancy- delay exponent is shown to be lower bounded by log (1=®), where ® is the probability of the most likely source symbol. Our results are easily applied to practical problems such as the compression of English text.