ppxscal/embedding_network huggingface dataset:
Maximum-take-precedence ACELP: a low complexity search method
Authors: Fu-Kun Chen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

The ACELP method makes use of multipulse structure to represent the excitation pulses of residual signal. With the purpose of computational complexity reduction, this paper provides the maximum-take-precedence ACELP (MTP-ACELP) search method under the acceptable degradation in performance. Because the maximum of target signal is preferentially compensated, the degradation of performance would be diminished. By predicting the locations of pulses, the computational complexity would be reduced. We not only reduce the possible pulse combinations in the search procedure but also avoid the computation of useless correlation functions before the search procedure. Furthermore, the proposed method is compatible to any ACELP type vocoder, e.g. the G.723.1, G.729, GSM- EFR standards.
Sensitivity analysis for fault-analysis and tolerance in RF front-end circuitry
Authors: Tejasvi Das, P. R. Mukund
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

RFIC reliability is fast becoming a major bottleneck in the yield and performance of modern IC systems, as process complexity and levels of integration continually increase. Due to high frequencies involved, testing these chips is both complicated and expensive. While the areas of Automated testing and Self-test have received significant attention over the past few years, no formal framework of fault-models or sensitivity-models exists in the RF domain. This paper describes a Sensitivity Analysis methodology as a first step towards such a framework. It is applied towards a Low Noise Amplifier, and a case-study application is discussed by using design and experimental results of an adaptive LNA designed in the IBM6RF 0.25 &mu;m CMOS process.
An R || Cmax Quantum Scheduling Algorithm
Authors: Feng Lu, Dan C. Marinescu
Venue: Quantum Information Processing (2007)

Grover's search algorithm can be applied to a wide range of problems; even problems not generally regarded as searching problems, can be reformulated to take advantage of quantum parallelism and entanglement, and lead to algorithms which show a square root speedup over their classical counterparts. In this paper, we discuss a systematic way to formulate such problems and give as an example a quantum scheduling algorithm for an R||Cmax problem. R||Cmax is representative for a class of scheduling problems whose goal is to find a schedule with the shortest completion time in an unrelated parallel machine environment. Given a deadline, or a range of deadlines, the algorithm presented in this paper allows us to determine if a solution to an R||Cmax problem with N jobs and M machines exists, and if so, it provides the schedule. The time complexity of the quantum scheduling algorithm is $${\mathcal{O}(\sqrt{M^N})}$$ while the complexity of its classical counterpart is $${\mathcal{O}(M^N)}$$ .
A Transactional Framework for Programming Wireless Sensor/Actor Networks
Authors: Murat Demirbas
Venue: Proceedings of the 11th IEEE International Workshop on Future Trends of Distributed Computing Systems (2007)

Effectively managing concurrent execution is one of the biggest challenges for future wireless sensor/actor networks (WSANs): For safety reasons concurrency needs to be tamed to prevent unintentional nondeterministic executions, on the other hand, for real-time guarantees concurrency needs to be boosted to achieve timeliness. We propose a transactional, optimistic concurrency control framework for WSANs that enables understanding of a system execution as a single thread of control, while permitting the deployment of actual execution over multiple threads distributed on several nodes. By exploiting the properties of wireless broadcast communication, we propose a lightweight and fault-tolerant implementation of our transactional framework.
Feasibility of smart cards in silicon-on-insulator (SOI) technology
Authors: Amaury Nève, Denis Flandre, Jean-Jacques Quisquater
Venue: Proceedings of the USENIX Workshop on Smartcard Technology on USENIX Workshop on Smartcard Technology (1999)

Applications involving smart cards have rapidly emerged since a few years. Up to now, chips are realized in conventional bulk technology. But as the need for performance rises, alternative technologies must be investigated. In this paper we study the feasibility of realizing the blocks for a smart card chip in Silicon-On-Insulator (SOI) technology. For most of the circuit blocks, SOI realization already exists and may be adapted for this application. However, we identified two circuits never fabricated in SOI: a charge pump and the random number generator. The charge pump has been realized in SOI and tested. A random signal source has also been realized. The circuit to create random bits, based on this source, is exposed.
WiMAX Performance Evaluation
Authors: Pavel Mach, Robert Bestak
Venue: Proceedings of the Sixth International Conference on Networking (2007)

In recent time, new advanced wireless systems emerged at the world markets. One of the most promising is undoubtedly IEEE 802.16 standard, also known as WiMAX. For both, service providers and potential customers, is necessary to know its basic capabilities, such as the number of supported subscriber per BS or transferred data rate that may be delivered. This paper is aimed at 802.16-2004 standard that is intend to fixed broadband wireless access.
Anisotropic Curvature Motion for Structure Enhancing Smoothing of 3D MR Angiography Data
Authors: Oliver Nemitz, Martin Rumpf, Tolga Tasdizen, Ross Whitaker
Venue: Journal of Mathematical Imaging and Vision (2007)

We propose a novel concept of shape prior for the processing of tubular structures in 3D images. It is based on the notion of an anisotropic area energy and the corresponding geometric gradient flow. The anisotropic area functional incorporates a locally adapted template as a shape prior for tubular vessel structures consisting of elongated, ellipsoidal shape models. The gradient flow for this functional leads to an anisotropic curvature motion model, where the evolution is driven locally in direction of the considered template. The problem is formulated in a level set framework, and a stable and robust method for the identification of the local prior is presented. The resulting algorithm is able to smooth the vessels, pushing solution toward elongated cylinders with round cross sections, while bridging gaps in the underlying raw data. The implementation includes a finite-element scheme for numerical accuracy and a narrow band strategy for computational efficiency.
Infinite sets that admit fast exhaustive search
Authors: Martin Escardo
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

Perhaps surprisingly, there are infinite sets that admit mechanical exhaustive search in finite time. We investigate three related questions: What kinds of infinite sets admit mechanical exhaustive search in finite time? How do we systematically build such sets? How fast can exhaustive search over infinite sets be performed?
A FrameNet-based semantic role labeler for Swedish
Authors: Richard Johansson, Pierre Nugues
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

We present a FrameNet-based semantic role labeling system for Swedish text. As training data for the system, we used an annotated corpus that we produced by transferring FrameNet annotation from the English side to the Swedish side in a parallel corpus. In addition, we describe two frame element bracketing algorithms that are suitable when no robust constituent parsers are available. We evaluated the system on a part of the FrameNet example corpus that we translated manually, and obtained an accuracy score of 0.75 on the classification of presegmented frame elements, and precision and recall scores of 0.67 and 0.47 for the complete task.
Predictive multiple description coding using coset codes
Authors: A. Jagmohan, A. Sehgal, N. Ahuja
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

Multiple Description (MD) coding of predictively coded sources is of practical interest in several multimedia applications such as redundant storage of video/audio data, and real-time video/audio telephony. A key problem associated with predictive MD coding is the occurrence of predictive mismatch. In the present paper, we pose the problem of predictive MD coding as a variant of the Wyner-Ziv decoder side-in formation problem. We propose an approach based on the use of coset codes for predictive MD coding, which avoids predictive mismatch without requiring restrictive channel assumptions or high latency. We specifically consider two-channel predictive MD coding of a first-order Gauss-Markov process. Results indicate that the proposed approach significantly out-performs alternative approaches in terms of rate-distortion performance.
Casting Preemptive Time Petri Nets in the Development Life Cycle of Real-Time Software
Authors: Laura Carnevali, Luigi Sassoli, Enrico Vicario
Venue: Proceedings of the 19th Euromicro Conference on Real-Time Systems (2007)

We describe a methodology for the construction of real-time tasking sets, which smoothly integrates a formal approach in both development and verification processes of the software life cycle. In the design stage, a timeline schema is used to specify concurrent processes with their dependencies and their expected temporal parameters. The schema is automatically translated into an equivalent preemptive Time Petri Net, which supports verification of the process architecture with respect to timeliness and sequencing requirements through state space analysis. The speci fication model drives the implementation stage enabling a disciplined coding of the process architecture on top of conventional primitives of a real-time operating system. At the same time, the preemptive Time Petri Net specification and the results of its state space analysis support functional testing enabling the construction of a time-sensitive Oracle and providing a metrics for coverage analysis. Computational experience in the Linux RTAI environment is reported to demonstrate the capability of the method to be effectively integrated in a practical approach.
Boosting Ethernet Performance by Segment-Based Routing
Authors: A. Mejia, J. Flich, J. Duato, Sven-Arne Reinemo, Tor Skeie
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

Ethernet is turning out to be a cost-effective solution for building Cluster networks offering compatibility, simplicity, high bandwidth, scalability and a good performanceto- cost ratio. Nevertheless, Ethernet still makes inefficient use of network resources (links) and suffers from long failure recovery time due to the lack of a suitable routing algorithm. In this paper we embed an efficient routing algorithm into 802.3 Ethernet technology, making it possible to use off-the-shelf equipment to build high-performance and costeffective Ethernet clusters, with an efficient use of link bandwidth and with fault tolerant capabilities. The algorithm, referred to as Segment-Based Routing (SR), is a deterministic routing algorithm that achieves high performance without the need for virtual channels (not available in Ethernet). Moreover, SR is topology agnostic, meaning it can be applied to any topology, and tolerates any combination of faults derived from the original topology when combined with static reconfiguration. Through simulations we verify an overall improvement in throughput by a factor of 1.2 to 10.0 when compared to the conventional Ethernet routing algorithm, the Spanning Tree Protocol (STP), and other topology agnostic routing algorithms such as Up*/Down* and Tree-based Turn-prohibition, the last one being recently proposed for Ethernet.
A high performance text independent speaker recognition system based on vowel spotting and neural nets
Authors: N. Fakotakis
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

We present a text independent speaker recognition system based on vowel spotting and feed forward multilayer perceptrons (MLPs). The perceptual linear predictive (PLP) speech analysis technique was used for parameter estimation, a feed forward MLP for vowel spotting and a simple MLP for the classification procedure. To train and test the system we used the TIMIT database. We conclude with results of the speaker verification and identification process, showing that the system described has a high recognition accuracy (/spl sim/98%) using short test utterances (2.5 sec). It also has a real-time response, is easily adapted to new speakers and requires a small amount of data for training purposes (three sentences per speaker).
Performance bounds on bearing and symbol estimation for communication signals with side information
Authors: B. M. Sadler
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

In this paper we develop Cramer-Rao bounds (CRBs) for bearing, symbol, and phase estimation of communications signals in flat fading channels. We do this using the constrained CRB formulation of Gorman and Hero (1999), and Stoica and Ng (1998). This provides a general framework for a large variety of cases, including semi-blind, constant modulus (CM), known cumulants, and others. These may be combined arbitrarily, e.g., we may develop CRBs for bearing estimation of constant modulus signals when a subset of the symbols are known (semi-blind, CM case). The results establish the value of side information in a large variety of communications scenarios, and may be used to compare performance of various blind and semi-blind algorithms.
MARTE: Also an UML Profile for Modeling AADL Applications
Authors: Madeleine Faugere, Thimothee Bourbeau, Robert de Simone, Sebastien Gerard
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

Marte (A UML Profile for Modeling and Analysis of Real-Time and Embedded systems) is a new UML profile extension for real-time and embedded systems, which is going to be standardized by mid 2007 at OMG (Object Management Group). This standard has been proposed by the "ProMarte" consortium, which consists of OMG end-users, tool providers and academics. Marte defines concepts in terms of UML extensions needed to model and analyze real-time and embedded systems (RT/ES). The Marte specification provides an annex which handles its relation to AADL-based models, and the way it may represent them.. Our purpose in this paper is to describe this relation. Our constructions will be presented and illustrated through some examples.
Compression as Data Transformation
Authors: Kiem-Phong Vo
Venue: Proceedings of the 2007 Data Compression Conference (2007)

Conventional compression techniques exploit general redundancy features in data to compress them. For example, Huffman or Lempel-Ziv techniques compresses data by statistical modeling or string matching while the Burrows-Wheeler Transform simply sorts data by context to improve compressibility. On the other hand, data can often be compressed better by exploiting their specific features. For example, columns or fields in a database table tend to be sparse, but not rows. Techniques have been developed to either group related table columns or compute dependency among them to transform data and enhance compressibility. For example, see the paper Using Column Dependency to Compress Tables by B.D. Vo and K.-P. Vo presented at DCC 2004 and references thereof.
Integrating AJAX and Web Services for Cooperative Image Editing
Authors: Lihui Lei, Zhenhua Duan
Venue: IT Professional (2007)

Message exchange delays and browser security limitations have slowed Web-based cooperative image editing's progress. An integrated system resolves these issues and offers a framework for building generic cooperative business processes.
A user's and programmer's view of the new JavaScript security model
Authors: Vinod Anupam, David M. Kristol, Alain Mayer
Venue: Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2 (1999)

In this paper we introduce a new security model for JavaScript in Mozilla, as well as its programming interface. We present important concepts via examples from electronic commerce applications. We also describe our experience of implementing the model in the publicly available Mozilla source code. This model is likely to be integrated into Navigator 5.0, which, as of this writing, is scheduled to be released in late fall, 1999.
Halfspace Matrices
Authors: Alexander A. Sherstov
Venue: Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity (2007)

A halfspace matrix is a Boolean matrix A with rows indexed by linear threshold functions f , columns indexed by inputs x \in {-1,1}^n, and the entries given by A_f ,x = f (x). We demonstrate the potential of halfspace matrices as tools to answer nontrivial open questions. 1. (Communication complexity) We exhibit a Boolean function f with discrepancy \Omega(1/n^4) under every product distribution but O(\sqrt n /2^{n/4}) under a certain non-product distribution. This partially solves an open problem of Kushilevitz and Nisan [25]. 2. (Complexity of sign matrices) We construct a matrix A \in {-1,1}^N×N^logN with dimension complexity logN but margin complexity \Omega(N^{1/4}/ \sqrt {log N}). This gap is an exponential improvement over previous work. As an application to circuit complexity, we prove an \Omega(2^{n/4}/(d\sqrt n)) circuit lower bound for computing halfspaces by a majority of an arbitrary set of d gates. This complements a result of Goldmann, Hastad, and Razborov [15]. In addition, we prove new results on the complexity measures of sign matrices, complementing recent work by Linial et al. [27-29]. 3. (Learning theory) We give a short and simple proof that the statistical-query (SQ) dimension of halfspaces in n dimensions is less than 2(n+1)^2 under all distributions (with n+1 being a trivial lower bound). This improves on the n^O(1) estimate from the fundamental paper of Blum et al. [5]. Finally, we motivate our learning-theoretic result for the complexity community by showing that SQ dimension estimates for natural classes of Boolean functions can resolve major open problems in complexity theory. Specifically, we show that an exp(2^(logn)^o(1) ) upper bound on the SQ dimension of AC^0 would imply an explicit language in PSPACE^cc \PH^cc.
A High Throughput Atomic Storage Algorithm
Authors: Rachid Guerraoui, Dejan Kostic, Ron R. Levy, Vivien Quema
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

This paper presents an algorithm to ensure the atomicity of a distributed storage that can be read and written by any number of clients. In failure-free and synchronous situations, and even if there is contention, our algorithm has a high write throughput and a read throughput that grows linearly with the number of available servers. The algorithm is devised with a homogeneous cluster of servers in mind. It organizes servers around a ring and assumes point-to-point communication. It is resilient to the crash failure of any number of readers and writers as well as to the crash failure of all but one server. We evaluated our algorithm on a cluster of 24 nodes with dual fast ethernet network interfaces (100 Mbps). We achieve 81 Mbps of write throughput and 8×90 Mbps of read throughput (with up to 8 servers) which conveys the linear scalability with the number of servers.
Automatic code recognition for smart cards using a Kohonen neural network
Authors: Jean-Jacques Quisquater, David Samyde
Venue: Proceedings of the 5th conference on Smart Card Research and Advanced Application Conference - Volume 5 (2002)

A processor can leak information by different ways. Although, the possibility of attacking smart cards by analyzing their power consumption [Kocher] or their electromagnetic radiations is now commonly accepted [Gandolfi]. A lot of publications recognize the possibility to recover the signature of an instruction in a side channel trace. It seems that no article demonstrate how to automate reverse engineering of software code, using this assumption. Our work describes a method to recognize the instructions carried out by the processor. In a general way, a classifier permits to identify the right or wrong value during the comparison of a pin code or large parts of a software code. On a few micro-controllers, using a classical correlation between the power trace and a dictionary, we show how to identify the CPU's actions. Sometimes, silicon manufacturers hide specific opcodes deliberately. The EM investigation and the template attack demonstrated by IBM, at Cryptographic Hardware and Embedded Systems 2002, rely on multivariate signal processing for electromagnetic and power traces. The method presented in this article is based on a self organizing map. On a CISC processor, it is then obvious to find a hidden instruction looking for a hole or a bad construction of the map. The case of pipelined processors is a little bit different: as they decode, execute, fetch, several parts of different opcodes at the same time, it is more difficult to recognize a specific signature.
Developing real-time multi-agent systems
Authors: V. Julian, V. Botti
Venue: Integrated Computer-Aided Engineering (2004)

The application of multi-agent systems to real-time environments is an interesting line of work that can provide new solutions to very complex and restrictive systems such as real-time systems. A suitable method for real-time multi-agent system development must take into account the intrinsic characteristics of systems of this type. This work presents an approach for the development of real-time multi-agent systems. The proposed method is called rt-Message and is based on the Message methodology.
Audio data hiding by use of band-limited random sequences
Authors: M. Ikeda
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

This paper proposes the use of band-limited random sequences to introduce further flexibility in the spread spectrum based audio data hiding. To realize the sub-band data hiding, a systematic method is developed in order to generate band-limited and orthonormal random sequences of any length. In experiments, we evaluated the selective use of frequency channels to be used for information embedding, and the robustness against the MPEG1 layer 3 encoding and decoding. From the results, it is clarified that the proposed method is robust against more than 160 kbps MPEG1 coding and decoding when the center frequency of the sub-band is lower than 11 kHz.