ppxscal/embedding_network huggingface dataset:
Nonbinary Quantum Goppa Codes Exceeding the Quantum Gilbert-Varshamov Bound
Authors: Annika Niehage
Venue: Quantum Information Processing (2007)

An explicit construction for nonbinary quantum Goppa codes exceeding the quantum Gilbert-Varshamov bound is given. First, we introduce a weighted symplectic inner product and show a method how to transform weighted codes into quantum codes with respect to the standard symplectic inner product. Then an algorithm to construct a quantum code out of any hyperelliptic curve is presented and implemented in Magma. Finally, we apply a generalization of this algorithm to a tower of function fields by Stichtenoth and show that these codes lie above the quantum Gilbert-Varshamov bound.
Development of multimedia course modules for engineering education at Tuskegee University
Authors: R. E. Hodges, J. Krishnagopalan
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Tuskegee University has been a participant in the eight university Engineering Education Coalition, Synthesis, funded by the National Science Foundation. One of the objectives of this coalition is to establish functional multimedia courseware development studios in the member schools, such that effective course modules may be developed and subsequently made available through the National Engineering Education Delivery System (NEEDS). Two multimedia courseware modules developed for enhancing the presentation of engineering concepts in the area of fluid mechanics and thermodynamics are presented.
Benefits Management and Strategic Alignment in an IT Outsourcing Context
Authors: Joost van Lier, Ton Dohmen
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

It is important to understand the factors that influence the success of IT outsourcing, since IT outsourcing touches the core of organizations. The hypothesis in this article is that benefits management and strategic alignment influence the success of IT outsourcing. The research question is "do strategic alignment and benefits management contribute to the success of IT outsourcing relationships?' To answer this question, a multiple case study strategy is used. The results support the research hypothesis; benefits management and strategic alignment have a positive effect on the success of IT outsourcing.
A study in using neural networks for anomaly and misuse detection
Authors: Anup K. Ghosh, Aaron Schwartzbard
Venue: Proceedings of the 8th conference on USENIX Security Symposium - Volume 8 (1999)

Current intrusion detection systems lack the ability to generalize from previously observed attacks to detect even slight variations of known attacks. This paper describes new process-based intrusion detection approaches that provide the ability to generalize from previously observed behavior to recognize future unseen behavior. The approach employs artificial neural networks (ANNs), and can be used for both anomaly detection in order to detect novel attacks and misuse detection in order to detect known attacks and even variations of known attacks. These techniques were applied to a large corpus of data collected by Lincoln Labs at MIT for an intrusion detection system evaluation sponsored by the U.S. Defense Advanced Research Projects Agency (DARPA). Results from applying these techniques for both anomaly and misuse detection against the DARPA evaluation data are presented.
Introduction to algorithms and problem solving
Authors: M. L. Nelson
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Language and paradigm choice for teaching computer programming is an on-going debate. We have been using Visual Basic for the introductory course and C++ for the advanced course. Unfortunately, many of our students struggle in the introductory course. We are currently re-engineering our degree. While our introductory course should ideally be language-independent, we feel that students will gain a better understanding if their algorithms are executable. Therefore, we have decided to use the procedural paradigm, with C++ as the implementation language for this course.
Exploring Motion Sequence of Virtual Characters: Experimenting Motion Capture Variables
Authors: Jong Sze Joon, Soon Eu Hui, Ahmad Rafi
Venue: Proceedings of the Geometric Modelling and Imaging (2007)

The purpose of the research is to study the detail of motion of various subjects with differences in physical attributes. The research outlines how different physique produces different behavioural patterns based upon mass and proportion. This research focuses on "walk motion' to identify the differences in each subject's physical attributes by sampling subjects of physical differences. This experiment employs Vicon8i® Optical Motion Capture system (MOCAP) to study the detail of human motion by extracting the subjects' core motions for analysis with pre-defined actions. The research used the findings to establish the relationship between height and weight against motion frequencies in 3D space.
Defining Strong Privacy for RFID
Authors: Ari Juels, Stephen A. Weis
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

In this work, we consider privacy in Radio Frequency IDentification (RFID) systems. Our contribution is twofold: (1) We propose a simple, formal definition of strong privacy useful for basic analysis of RFID systems, as well as a different (weaker) definition applicable to multi-verifier systems; and (2) We apply our definition to reveal vulnerabilities in proposed privacy-enhancing RFID protocols. This paper is a highly abbreviated version of [15].
Joint probability density function estimation by spectral estimate methods
Authors: A. Pages-Zamora
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

The estimation of probability density functions (PDFs) of a given random variable (r.v.) is involved in topics related to codification, speech or whenever a short record of data is available but a greater amount is needed. Existing methods go from the so-called minimum description-length method, up to others based on the maximisation of the differential entropy imposing constraints on the moments of the r.v. In this paper we propose to estimate a PDF function by means of spectral estimate methods, since the positiveness and the real character of any PDF function allow us to deal with it as a power spectrum density function. Particularly, the minimum variance method is focused on because it can be generalised to multidimensional problems, being used in this paper to estimate the joint-PDF function of a multidimensional r.v.
An analysis of compare-by-hash
Authors: Val Henson
Venue: Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9 (2003)

Recent research has produced a new and perhaps dangerous technique for uniquely identifying blocks that I will call compare-by-hash. Using this technique, we decide whether two blocks are identical to each other by comparing their hash values, using a collision-resistant hash such as SHA-1[5]. If the hash values match, we assume the blocks are identical without further ado. Users of compare-by-hash argue that this assumption is warranted because the chance of a hash collision between any two randomly generated blocks is estimated to be many orders of magnitude smaller than the chance of many kinds of hardware errors. Further analysis shows that this approach is not as risk-free as it seems at first glance.
Track Introduction
Authors: Jay F. Jr. Nunamaker, Robert O. Briggs
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Teams, Organizations, and, indeed, societies exist to create value that their stakeholders cannot create as individuals. Collaboration means joint effort toward a goal. This minitracks seeks to advance knowledge of the individual, organizational, societal, and technical issues that affect the outcomes attained through collaboration. The papers in this track cut across many application domains industry, academia, military, and government. The papers span the range of scientific enquiry, from the most theoretical to the most applied. The authors take a variety of epistemological perspectives -- logical positivist, interpretivist, criticalist, and engineering approaches all appear in this year's track. This track began a number of years ago with the increased interest in both Group Support Systems and Negotiation Support Systems minitracks. Out of this interest, the Collaboration Systems and Technology Track emerged. It consists of minitracks in eight areas.
PKCS #15 - a cryptographic token information format standard
Authors: Magnus Nyström
Venue: Proceedings of the USENIX Workshop on Smartcard Technology on USENIX Workshop on Smartcard Technology (1999)

We identify the need for a portable format for storage of user credentials (certificates, keys) on cryptographic tokens such as integrated circuit cards (IC cards). Given this need, a recent proposal in the area, RSA Laboratories' PKCS #15 is described and compared with previous and related work.
Wireless Networking for Home Users
Authors: Beran Necat
Venue: IEEE Distributed Systems Online (2007)

A review of Jim Doherty and Neil Anderson's "Wireless Home Networking Simplified"
An interactive GUI-based tool for signal and speech processing courses
Authors: H. Bhagatwala
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

In this paper, the authors present interactive, graphical software for introducing speech coding in undergraduate and graduate courses on digital signal processing (DSP) and speech processing. The software facilitates students in understanding and experimentation for practical applications of signal processing concepts introduced in DSP courses. It consists of two complementary components. The first is a MATLAB-based graphical simulation of a state-of-the-art speech coder. This component of the software is designed to complement the theoretical aspects of speech coding with practical exposure to the algorithms using hands-on simulations. The second component is an application that provides a framework for evaluation of different speech coding algorithms for a variety of applications. With this tool, students can easily categorize the performance of different speech coding algorithms through objective measurements as well as subjective listening tests. These tools could be used in entry-level graduate courses in DSP and speech coding.
Establishing the foundations for engineering education in K-5
Authors: D. Wilson, T. Hudson, S. Fletcher, B. Harris, C. Knight, T. Morris, G. Patel, S. DeWeerth
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

We have developed a volunteer program designed to enhance physical science education within elementary schools in the metropolitan Atlanta area (US). Elementary Science for Elementary Students (ES/sup 2/) brings demonstrations into the classroom that reach fundamental concepts in electricity, machines, structures, and sound. Each demonstration has the same basic format, beginning with a brief interactive lecture and visually based demonstration that emphasizes at most two fundamental concepts and ending with a hands on activity that allows students to experiment with these concepts. This format is a particularly effective teaching method, because it combines the three major learning techniques (visual, auditory, tactile) into a single presentation. In this way, each child is able to learn the concepts in their most natural mode of learning, reinforced by the two remaining modes. It is not only the students, but also the teachers that gain a better understanding of science through our demonstrations, improving their confidence in the material which enables them to teach more effectively in the future. In the first phase of ES/sup 2/, volunteers go into the classrooms and do physical science demonstrations themselves. Once we have gained familiarity and trust in the schools, however we seek to maximize our educational impact in elementary school curricula by providing demonstration materials to the individual schools and training teachers to do these demonstrations independently.
Stochastic packing-market planning
Authors: Daniel Golovin
Venue: Proceedings of the 8th ACM conference on Electronic commerce (2007)

Motivated by the problem of centralized market clearing in a market with probabilistic supply and demand, we introduce the Stochastic Packing-Market Planning problem (SPMP), which is a stochastic generalization of the Maximum k-Set Packing problem. We provide an O(k) approximation algorithm for SPMP, as well as a O(k) approximation mechanism that is truthful in expectation. This matches up to constants the best approximation ratio known for Maximum k-Set Packing. Along the way, we develop techniques for obtaining sparse subhypergraphs of an input hypergraph that preserves Ep(•) up to an O(k) factor, where Ep(G) measures the expected weight of a maximum weight set packing in a random subhypergraph of G. We also give a linear programming based approximation for Ep(G). These techniques may be of independent interest.
Automating Parallelism of Regular Computations for Distributed-Memory Multicomputers in the Paradigm Compiler
Authors: Ernesto Su, Daniel J. Palerrno, Prithviraj Banerjee
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

Distributed-memory multicomputers such as Intel iPSC/860, the NCUBE/2. The Intel Paragon and Connection Machine CM-5 offers significant advantages over shared-memory multiprocessors in terms of costs and scalability.
Speaker recognition using G.729 speech codec parameters
Authors: T. F. Quatieri
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

Experiments in Gaussian-mixture-model speaker recognition from mel-cepstra, derived from mel-filter bank energies (MFBs) of the G.729 codec all-pole spectral envelope, showed significant performance loss relative to the standard mel-cepstral coefficients of G.729 synthesized (coded) speech (Quatieri et al. 1999). In this paper, we investigate two approaches to recover speaker recognition performance from G.729 parameters. The first is a parametric approach that makes explicit use of G.729 parameters, rather than deriving cepstra from MFBs of an all-pole spectrum. Specifically, the G.729 LSFs are converted to "direct" cepstral coefficients for which there exists a one-to-one correspondence with the LSFs. The G.729 residual is also considered; in particular, appending G.729 pitch as a single parameter to the direct cepstral coefficients gives further performance gain. The second nonparametric approach uses the original MFB paradigm, but adds harmonic striations to the G.729 all-pole spectral envelope. Although obtaining considerable performance gains with these methods, we have yet to match the performance of G.729 synthesized speech, motivating the need for representing additional fine structure of the G.729 residual.
Conflict-aware scheduling for dynamic content applications
Authors: Cristiana Amza, Alan L. Cox, Willy Zwaenepoel
Venue: Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4 (2003)

We present a new lazy replication technique, suitable for scaling the back-end database of a dynamic content site using a cluster of commodity computers. Our technique, called conflict-aware scheduling, provides both throughput scaling and 1-copy serializability. It has generally been believed that this combination is hard to achieve through replication because of the growth of the number of conflicts. We take advantage of the presence in a database cluster of a scheduler through which all incoming requests pass. We require that transactions specify the tables that they access at the beginning of the transaction. Using that information, a conflictaware scheduler relies on a sequence-numbering scheme to implement 1-copy serializability, and directs incoming queries in such a way that the number of conflicts is reduced. We evaluate conflict-aware scheduling using the TPCW e-commerce benchmark. For small clusters of up to eight database replicas, our evaluation is performed through measurements of a web site implementing the TPC-W specification. We use simulation to extend our measurement results to larger clusters, faster database engines, and lower conflict rates. Our results show that conflict-awareness brings considerable benefits compared to both eager and conflict-oblivious lazy replication for a large range of cluster sizes, database speeds, and conflict rates. Conflict-aware scheduling provides near-linear throughput scaling up to a large number of database replicas for the browsing and shopping workloads of TPC-W. For the write-heavy ordering workload, throughput scales, but only to a smaller number of replicas.
Utilizing the World Wide Web and the Internet to facilitate learning in large classes
Authors: G. Bjedov
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Teaching large classes is often a difficult and unwelcome assignment. A majority of large universities offer a portion of their required freshman classes in lectures of a hundred or more students. There are several problems that a professor must deal with in teaching a large class that are not commonly encountered in small classes. This paper addresses some of these issues, suggests improvements and solutions, and shows some of the results obtained at Purdue University. The Internet and the World Wide Web have proven to be two tools available to instructors to improve communications, shorten response time to questions, and increase overall learning. These tools can be utilized to facilitate communication between the instructional staff and standardize grading and information sharing practices between the staff. In particular, we have utilized network information sharing capabilities to post lecture notes, programs and old exams, as well as provide answers to submitted questions for student use. We have also used this medium to provide teaching assistants with answer keys for assignments and exams. These approaches, which have been tested on over 3000 students, have resulted in a greatly improved student performance on the exams and their perception of the course.
Formulation of a general imaging algorithm for high-resolution synthetic aperture radar
Authors: E. Feig
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

We consider the application of an alternative imaging algorithm to the inversion of strip-mapping synthetic aperture radar (SAR) data. The algorithm was originally developed and successfully applied in the area of geophysics to estimate the conductivity distribution from wellbore induction measurements. The SAR measurement relation satisfies the same form of integral equation describing the wellbore problem. By exploiting the form of the measurement kernel, we derive a SAR image formation algorithm involving deconvolution-backprojection. Unlike correlation-based SAR image formation, our approach is more general, without simplifying assumptions on the range function, and is robust to measurement noise, at the expense of increased computational complexity. Simulation results are presented that demonstrate the effectiveness of the proposed algorithm.
Nonlinear dynamic modeling of the voiced excitation for improved speech synthesis
Authors: K. Narasimhan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

This paper describes the implementation of a waveform-based global dynamic model with the goal of capturing vocal folds variability. The residue extracted from speech by inverse filtering is pre-processed to remove phoneme dependence and is used as the input time series to the dynamic model. After training, the dynamic model is seeded with a point from the trajectory of the time series, and iterated to produce the synthetic excitation waveform. The output of the dynamic model is compared with the input time series. These comparisons confirmed that the dynamic model had captured the variability in the residue. The output of the dynamic models is used to synthesize speech using a pitch-synchronous speech synthesizer, and the output is observed to be close to natural speech.
Cross entropy guided ant-like agents finding dependable primary/backup path patterns in networks
Authors: O. Wittner, B. E. Helvik
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Telecommunication network owners and operators have for half a century been well aware of the potential loss of revenue if a major trunk is damaged, thus dependability at high cost has been implemented. A simple, effective and common dependability scheme is 1:1 protection with 100% capacity redundancy in the network. A growing number of applications in need of dependable connections with specific requirements to bandwidth and delay have started using the internet (which only provides best effort transport) as their base communication service. In this paper we adopt the 1:1 protection scheme and incorporate it as part of a routing system applicable for internet infrastructures. 100% capacity redundancy is no longer required. A distributed stochastic path finding (routing) algorithm based on Rubinstein's Cross Entropy method for combinatorial optimisation is presented. Early results from Monte Carlo simulations indeed indicate that the algorithm is capable of finding pairs of independent primary and backup paths satisfying specific bandwidth constraints.
Partitioning of Variables for Multiple-Register-File VLIW Architectures
Authors: Andrea Capitanio, Nikil Dutt, Alexandru Nicolau
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

Recent trends in microprocessor design heavily rely on large register files with large I/O bandwidths for sustaining performance; a possible solution to relieve this bottleneck is the adoption of multiple register files. In this paper we show how the problem of assigning variables to multiple register banks can be reduced to that of a hypergraph coloring and, also, propose a technique to perform this coloring; this technique is applied to the problem of variable partitioning for rnultipltregister- file VLIW architectures.
EEG evidence for mirror neuron activity during the observation of human and robot actions: Toward an analysis of the human qualities of interactive robots
Authors: Lindsay M. Oberman, Joseph P. McCleery, Vilayanur S. Ramachandran, Jaime A. Pineda
Venue: Neurocomputing (2007)

The current study investigated the properties of stimuli that lead to the activation of the human mirror neuron system, with an emphasis on those that are critically relevant for the perception of humanoid robots. Results suggest that robot actions, even those without objects, may activate the human mirror neuron system. Additionally, both volitional and nonvolitional human actions also appear to activate the mirror neuron system to relatively the same degree. Results from the current studies leave open the opportunity to use mirror neuron activation as a 'Turing test' for the development of truly humanoid robots.