ppxscal/embedding_network huggingface dataset:
Membrane Systems for Robot Control Architectures
Authors: Rodrigo Montufar-Chaveznava
Venue: Proceedings of the 17th International Conference on Electronics, Communications and Computers (2007)

Membrane systems are computational models inspired in basic characteristics of biological membranes concerning the way they process chemical compounds, energy and information. They represent a new distributed parallel computation model where the cooperation between objects (membranes) is possible to solve complex problems. Membrane systems exhibit a hierarchical topology where well-delimited computer units coexist. On the other hand, there are several control architectures for robots, classified in according their characteristics. A special class is the behavior based architecture, represented by the dynamic schema hierarchy model, the subsumption architecture, DAMN, etc. The idea behind this class of architectures is developing autonomous robotic behaviors by means of hybridizing perception and control. In this paper we propose the use of membrane systems as a behavior based robot architecture to exploit the parallel computing characteristic of membranes. We try to map behaviors to membranes to build the proposed architecture. The developed architecture was tested in an educational robot.
A Superpeer-Based Two-Layer P2P Overlay Network with the CBF Strategy
Authors: Kenichi Watanabe, Naohiro Hayashibara, Makoto Takizawa
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

Peer-to-Peer (P2P) systems are now getting popular and are widely used in various types of applications. In this paper, we newly propose a superpeer-based two-layer P2P overlay network with the charge-based flooding (CBF) algorithm, a look-up protocol for distributed multimedia objects. The layers of normal peer and superpeer are composed of a set of normal peers and a set of superpeers, respectively. Multiple normal peers with some common properties, e.g. files, are interconnected with a superpeer. A collection of a superpeer and normal peers is referred to as a cluster. In a cluster, a normal peer tries to find a target peer without being helped by a superpeer. If the target file is not detected in the cluster, the normal peer asks the superpeer to find the target file on behalf of the normal peer. Then, the superpeer forwards the request to other superpeers by using the CBF algorithm at the superpeer layer.
Game2Learn: building CS1 learning games for retention
Authors: Tiffany Barnes, Heather Richter, Eve Powell, Amanda Chaffin, Alex Godwin
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

This paper presents Game2Learn, an innovative project designed to leverage games in retaining students in computer science (CS). In our two-pronged approach, students in integrative final-year capstone courses and summer research experiences develop games to teach computer science, which, in turn, will be used to improve introductory computing courses. Our successful model for summer undergraduate research and capstone projects engages students in solving the computing retention problem, allows them to quickly create games, and instructs students in user- and learner-centered design and research methods. Results show that this method of building games to teach engages students at multiple levels, inspiring newer students that one day their homework may all be games, and encouraging advanced students to continue on into graduate studies in computing.
New cache designs for thwarting software cache-based side channel attacks
Authors: Zhenghong Wang, Ruby B. Lee
Venue: Proceedings of the 34th annual international symposium on Computer architecture (2007)

Software cache-based side channel attacks are a serious new class of threats for computers. Unlike physical side channel attacks that mostly target embedded cryptographic devices, cache-based side channel attacks can also undermine general purpose systems. The attacks are easy to perform, effective on most platforms, and do not require special instruments or excessive computation power. In recently demonstrated attacks on software implementations of ciphers like AES and RSA, the full key can be recovered by an unprivileged user program performing simple timing measurements based on cache misses. We first analyze these attacks, identifying cache interference as the root cause of these attacks. We identify two basic mitigation approaches: the partition-based approach eliminates cache interference whereas the randomization-based approach randomizes cache interference so that zero information can be inferred. We present new security-aware cache designs, the Partition-Locked cache (PLcache) and Random Permutation cache (RPcache), analyze and prove their security, and evaluate their performance. Our results show that our new cache designs with built-in security can defend against cache-based side channel attacks in general-rather than only specific attacks on a given cryptographic algorithm-with very little performance degradation and hardware cost.
Evolutionary functional recovery in virtual reconfigurable circuits
Authors: Lukáš Sekanina
Venue: ACM Journal on Emerging Technologies in Computing Systems (JETC) (2007)

A virtual reconfigurable circuit (VRC) is a domain-specific reconfigurable device developed using an ordinary FPGA in order to easily implement evolvable hardware applications. While a fast partial runtime reconfiguration and application-specific programmable elements represent the main advantages of VRC, the main disadvantage of the VRC is the area consumed. This study describes experiments conducted to estimate how the use of VRC influences the dependability of FPGA-based evolvable systems. It is shown that these systems are not as sensitive to faults as their area-demanding implementations might suggest. An evolutionary algorithm is utilized to design fault tolerant circuits as well as to perform an automatic functional recovery when faults are detected in the configuration memory of the FPGA. All the experiments are performed on models of reconfigurable devices.
An algorithm for compression of wideband diverse speech and audio signals
Authors: T. R. Trinkaus
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

A compression scheme for diverse speech and audio signals is proposed. In this scheme, signals are analyzed with a 2-band QMF filter bank followed by the application of a modulated lapped biorthogonal transform (MLBT) to each of the filter bank channels. Subsequent encoding of transform coefficients is performed using Laplacian optimized scalar and vector quantizers, whose rates are determined by an estimated noise threshold, i.e., masking threshold. Listening tests show that the coder achieves a quality at 32 kbits/s that is preferred over the ITU G.722 coder at 64 kbits/s, for speech, music, and more diverse signals consisting of speech in the presence of eventful background sounds. Both the delay of the coder, at 40 ms, and the level of complexity are moderate.
Virtual teaming experiences
Authors: D. M. Etter
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

It is becoming widely accepted that the most successful teams for the design, analysis, and manufacturing of engineering systems will be formed from a geographically distributed pool of talent. To help prepare our students for this new reality, we have developed a two-course undergraduate sequence in digital signal processing in which students from the University of Colorado form "virtual" teams with students from George Mason University. In this paper we present the results of four semesters of experimenting with virtual teams of students from the University of Colorado and George Mason University.
Why use a fishing line when you have a net? an adaptive multicast data distribution protocol
Authors: Jeremy R. Cooperstock, Steve Kotsopoulos
Venue: Proceedings of the 1996 annual conference on USENIX Annual Technical Conference (1996)

The design and implementation of a system to provide reliable and efficient distribution of large quantities of data to many hosts on a local area network or internetwork is described. By exploiting the one-to-many transmission capabilities of multicast and broadcast, it is possible to transmit data to multiple hosts simultaneously, using less bandwidth and thus obtaining greater efficiency than repeated unicasting. Although performance measurements indicate the superiority of multicast, we dynamically select from available transmission modes so as to maximize efficiency and throughput while providing reliable delivery of data to all hosts. Our results demonstrate that file-distribution programs based on our protocol can benefit from a substantial speed-up over TCP-based programs such as rdist. For example, our system has been used to distribute a 133 Kbyte password file to 68 hosts in 20 seconds, whereas the equivalent rdist took 251 seconds.
Performance Evaluation of Real-Time Message Delivery in RDM Algorithm
Authors: Shabnam Mirshokraie, Mojtaba Sabeghi, Mahmoud Naghibzadeh, Koen Bertels
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Complexity of distributed real-time applications such as automotive electronics has increased dramatically over the last couple of years. As a result, developing communication protocols to address real-time requirements of these applications such as reliability, intime delivery of messages, priority support, and faulttolerance needs more sophisticated techniques. To satisfy these requirements, special communication architectures have been designed. The most important methods presented are TDMA (Time Division Multiple Access), Token Ring and CAN (Controller Area Network). Recently, a new algorithm called RDM (Round Data Mailer) has been presented. The focus of this paper is on the studying of the Round Data Mailer technique and evaluating its message delivery performance by making a comparison of the result of simulated RDM and CAN.
Multi-channel signal separation
Authors: D. C. B. Chan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

The separation of independent sources from mixed observed data is a fundamental and challenging problem. In many practical situations, observations may be modelled as linear mixtures of a number of source signals, i.e. a linear multi-input multi-output system. A typical example is speech recordings made in an acoustic environment in the presence of background noise and/or competing speakers. Other examples include EEG signals, passive sonar applications and cross-talk in data communications. We propose iterative algorithms to solve the n/spl times/n linear time invariant system under two different constraints. Some existing solutions for 2/spl times/2 systems are reviewed and compared.
Reconstruction of 3D Face from a Single 2D Image for Face Recognition
Authors: Yuankui Hu, Ying Zheng, Zengfu Wang
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

In this paper, a synthetic exemplar based framework for face recognition with variant pose and illumination is proposed. Our purpose is to construct a face recognition system only according to one single frontal face image of each person for recognition. The framework consists of three main parts. First, a deformation based 3D face modeling technique is introduced to create an individual 3D face model from a single frontal face image of a person with a generic 3D face model. Then, the virtual faces for recognition at various lightings and views are synthesized. Finally, an Eigenfaces based classifier is constructed where the virtual faces synthesized are used as training exemplars. The experimental results show that the proposed 3D face modeling technique is efficient and the synthetic face exemplars can significantly improve the accuracy of face recognition with variant pose and illumination.
Functional Classes Guide Use of Design Patterns in Implementing Mediators
Authors: Mikko Kontio, Hannu Mayra, Mauno Ronkko
Venue: Proceedings of the First International Conference on Complex, Intelligent and Software Intensive Systems (2007)

In this paper, we study how Functional Classes guide use of design patterns when implementing mediators. Functional Classes is a design style that merges both object-oriented and functional programming paradigms. A functional class is a class without variables having pure functions as methods. Therefore, method calls in Functional Classes are function calls also in the formal sense. As a result, a functional class is naturally a mediator. In this paper, as the main contribution, we show that Functional Classes lead to proper use of certain specific design patterns, like Singleton, Adapter, Abstract Factory, and Strategy. We exemplify this with a data mediator implementation called JavaTableFC.
Heuristic Approach of Optimal Code Allocation in High Speed Downlink Packet Access Networks
Authors: Hussein Al-Zubaidy, Jerome Talim, Ioannis Lambadaris
Venue: Proceedings of the Sixth International Conference on Networking (2007)

In this paper, we use the Markov Decision Process (MDP) technique to find the optimal code allocation policy in High-Speed Downlink Packet Access (HSDPA) networks. A discrete stochastic dynamic programming model for the HSDPA downlink scheduler is presented. The model then is solved numerically using value iteration. The system performance when using the resulted optimal policy as compared to Round Robin (RR) is studied using simulation. The behaviour of the value function was observed then used to develop a heuristic scheduling policy. The devised heuristic policy performs very close to the optimal policy. It has much less computational complexity which makes it easy to deploy and with only slight reduction in performance compared to the optimal policy.
Adaptation method based on HMM composition and EM algorithm
Authors: Y. Minami, S. Furui
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

A method for adapting HMMs to additive noise and multiplicative distortion at the same time is proposed. This method first creates a noise HMM for additive noise, then composes HMMs for noisy and distorted speech data from this HMM and speech HMMs so that these composed HMMs become the functions of signal-to-noise (S/N) ratio and multiplicative distortion. S/N ratio and multiplicative distortion are estimated by maximizing the likelihood of the HMMs to the input speech. To achieve this, we propose a new method that divides the maximization process into estimation of S/N ratio and estimation of cepstrum bias. The S/N ratio is estimated using the parallel model method. The cepstrum bias is estimated using the EM algorithm. To evaluate this method, two experiments in terms of phoneme recognition and connected digit recognition are performed. The guarantee of convergence of this algorithm is also discussed.
Computationally efficient DOA estimation based on linear prediction with Capon method
Authors: M. Hirakawa
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Of the several methods for estimating the direction of multiple signals with an array antenna, superresolution direction-of-arrival (DOA) estimation techniques, such as MUSIC and ESPRIT, have been in the spotlight. Although the performance of these techniques is reliable, their computational costs are considerable. We propose a new DOA estimation technique using the linear prediction (LP) method in conjunction with the Capon method. In our proposed technique, the LP method is used to estimate the true and spurious DOAs, and the true DOAs can be selected by evaluating the relative signal powers obtained by the Capon method. To estimate the number of true DOAs, we apply the values of Capon's array output power to the decision criterion, such as minimum description length (MDL). Simulation results showed that the proposed technique gives a maximum of about eighty-percent in computational cost reduction compared with MUSIC and that the technique accurately estimated the DOAs.
The development and use of an engineering visualization tool for longitudinal vibrations of structures
Authors: K. Slater, K. Gramoll
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Summary form only given. Visualization greatly enhances understanding in the study of vibrations and assists in the design of structures. The software program is used to help engineering students better understand free and forced longitudinal vibration through beam design. The user is able to select the beam configuration and once the beam configuration and loading are set, the program develops a series of pictures which can be animated to show the vibration. The user has the ability to select which modes of vibration to simulate. Only those modes selected are used in animation results. The sequence of pictures contains stress and strain field information throughout the beam. By using a color gradient scale related to the stress/strain the user can easily see the change is stress and strain throughout the beam during the vibration. The program gives maximum and minimum stress values and their location. On any particular frame, the user has the ability to get stress/strain information from any point on the beam through simple a mouse click. Animation sequences can be saved for comparison with other cases. The ability to view multiple animations concurrently is under consideration. Other options being considered include the introduction of modal damping. The program functions as a design tool since all stress and strain information is available to the user. As a study tool, the user is given the ability to change parameters which give visual results, not just new numbers. The program is used at Georgia Tech to assist in the understanding of vibrations in aerospace applications.
Introduction to the Minitrack on Data Warehousing and Business Intelligence
Authors: Barbara Wixom, Hugh J. Watson
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Data warehousing and business intelligence continues to evolve as a field to address new trends in the marketplace, such as compliance and privacy, managing and leveraging unstructured data, and real-time, tactical decision making. One set of papers in this year's Data Warehousing and Business Intelligence Minitrack investigates how the field is meeting changing business needs.
Curriculum integration at Arizona State University
Authors: D. L. Evans
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

The freshman and sophomore integrated curricula developed at Arizona State University under the auspices of the NSF-funded Foundation Coalition are briefly described. The freshman program is currently in a second generation pilot while the sophomore program is in a first generation pilot. Problems encountered in designing and implementing such curricula are discussed as are possible solutions where they have been found.
Hello World (Illuminated Script)
Authors: Margaret Dolinsky
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

"Hello World (Illuminated Script)" is projectionbased virtual reality art that illustrates the illumination of the eye over the surface of a painting. The painted surface is constructed and deconstructed as the visitor's gaze experiences the multiple aspects of a face on the screen. The facial images transform as if they are journeying forward into the eye and back again. The portraiture is based on Eastern Orthodox iconography.
Interactive presentation: Improving the fault tolerance of nanometric PLA designs
Authors: Federico Angiolini, M. Haykel Ben Jamaa, David Atienza, Luca Benini, Giovanni De Micheli
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Several alternative building blocks have been proposed to replace planar transistors, among which a prominent spot belongs to nanometric filaments such as Silicon Nano Wires (SiNWs) and Carbon Nano Tubes (CNTs). However, chips leveraging these nanoscale structures are expected to be affected by a large amount of manufacturing faults, way beyond what chip architects have learned to counter. In this paper, we show a design flow, based on software mapping algorithms, to improve the yield of nanometric Programmable Logic Arrays (PLAs). While further improvements to the manufacturing technology will be needed to make these devices fully usable, our flow can significantly shrink the gap between current and desired yield levels. Also, our approach does not need post-fabrication functional analysis and mapping, therefore dramatically cutting on verification costs. We check PLA yields by means of an accurate analyzer after Monte Carlo fault injection. We show that, compared to a baseline policy of wire replication, we achieve equal or better yields (8% over a set of designs) depending on the underlying defect assumptions.
Sketch-Based 3D-Shape Creation for Industrial Styling Design
Authors: Levent Burak Kara, Kenji Shimada
Venue: IEEE Computer Graphics and Applications (2007)

The authors describe a pen-based modeling system for the styling design of 3D objects. Their system is tailored toward the rapid and intuitive design of styling features such as freeform curves and surfaces. Basic wireframe and surfaces are constructed and modified using the strategy of curve creation, curve modification, surface creation, and finally surface modification.
Rectification of cross spectral matrices for arrays of arbitrary geometry
Authors: P. Forster
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

In high resolution methods applied to uniform linear arrays (ULA), the pre-processing that consists in forcing the estimated cross spectral matrix (CSM) to be Toeplitz by averaging its elements along its diagonals is known to increase drastically the resolving power: that is why it is always done in practice. However, this approach is limited to linear arrays because of the required Toeplitz structure for the CSM. This paper generalizes this technique to arrays of arbitrary geometry: the developed method is referred to as rectification. It proceeds by searching first for a vector subspace of Hermitian matrices that contains the manifold generated by the CSMs when the angle of arrival varies: this preliminary step is performed only one time for a given array geometry. Next, rectification of estimated CSMs is achieved by projecting them onto this subspace, resulting in denoising and increased resolving power of source localization methods at a very low computational cost. As a by product, the storage requirements for the CSMs are greatly reduced.
Promises, Expectations, and Realities of Interoperability: from COTS to Systems of Systems
Authors: Lisa Brownsword, James Smith
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

Commercial and government organizations are increasingly dependent on multiple systems that will operate seamlessly together both within their own enterprise as well as across organizational boundaries. Defining, building, fielding, and evolving these "systems of systems" is sufficiently different from traditional single system development that changes to engineering, management, and organizational practices is necessary. This tutorial explores the differences of systems of systems and leverage applicable lessons from acquiring, fielding, evolving COTS-based systems.