ppxscal/embedding_network huggingface dataset:
Using comparable corpora to solve problems difficult for human translators
Authors: Serge Sharoff, Bogdan Babych, Anthony Hartley
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

In this paper we present a tool that uses comparable corpora to find appropriate translation equivalents for expressions that are considered by translators as difficult. For a phrase in the source language the tool identifies a range of possible expressions used in similar contexts in target language corpora and presents them to the translator as a list of suggestions. In the paper we discuss the method and present results of human evaluation of the performance of the tool, which highlight its usefulness when dictionary solutions are lacking.
Analyzing and Systematizing Current Traceability Schemas
Authors: Angelina Espinoza, Pedro P. Alarcon, Juan Garbajosa
Venue: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop (2006)

The aim of this work is to produce a traceability model to enhance processes and tasks, which make extensive use of traceability information such as, V&V, change management and impact analysis, under the Roundtrip Engineering approach. This paper analyzes several current traceability approaches, in order to obtain their relevant features, to identify overlaps and inconsistencies between them, and to select the best traceability practices. It was identified that, several issues still make difficult the adoption of a widescale traceability activity, in the software\system engineering practice, such as, there is a lack of a commonly accepted traceability definition, a standard way of specifying traceability between artifacts, and a traceability type classification. Basing on these findings, an approach for a "Traceability Schema Specification" and a first implementation on a software/system engineering environment are provided. The schema attempts to systematize the definition, deployment and maintenance of a traceability implementation.
The slab allocator: an object-caching kernel memory allocator
Authors: Jeff Bonwick
Venue: Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1 (1994)

This paper presents a comprehensive design overview of the SunOS 5.4 kernel memory allocator. This allocator is based on a set of object-caching primitives that reduce the cost of allocating complex objects by retaining their state between uses. These same primitives prove equally effective for managing stateless memory (e.g. data pages and temporary buffers) because they are space-efficient and fast. The allocator's object caches respond dynamically to global memory pressure, and employ an object-coloring scheme that improves the system's overall cache utilization and bus balance. The allocator also has several statistical and debugging features that can detect a wide range of problems throughout the system.
Biological Experiments on the Grid: A Novel Workflow Management Platform
Authors: D. Laforenza, R. Lombardo, M. Scarpellini, M. Serrano, F. Silvestri, P. Faccioli
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Bioinformatics is one of the key application of this century. The attention received by all the current media is astonishing and both academics and industries are carrying on researches in many fields related to computational methods applied to life sciences. In this paper we present some results obtained within an Italian funded research project called ESCOGITARE. We present the design and implementation of a Grid-based architecture for scientific workflow management that, differently from others, allows the dynamic discovery of existing Web Services in combination to ad-hoc developed ones. The paper presents the main features of current scientific workflow management systems. Using a real-world case study (taken by the agricultural research domain), we show how we overcome the limitations of current approaches.
Interactive presentation: Peripheral-conscious scheduling on energy minimization for weakly hard real-time systems
Authors: Linwei Niu, Gang Quan
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

In this paper, we present a dynamic scheduling algorithm to minimize the energy consumption by both the DVS processor and peripheral devices in a weakly hard real-time system. In our approach, we first use a new static approach to partition real-time jobs into mandatory and optional part to meet the weakly hard real-time constraints. We then adopt an on-line approach that can effectively exploit the run-time variations and reduce the preemption impacts to leverage the energy saving performance. Extensive simulation studies demonstrate that our approach can effectively reduce the system-wide energy consumption while guaranteeing the weakly hard constraints.
Scalable predictive coding as the Wyner-Ziv problem
Authors: A. Sehgal, A. Jagmohan, N. Ahuja
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

An alternative to scalable predictive coding of first order Gauss-Markov processes is proposed in this paper. It is shown that conventional scalable predictive coding is inherently suboptimal. An alternative to scalable predictive coding, which achieves the rate-distortion performance of predictive coding for first-order Gauss-Markov processes is then proposed. The proposed approach is posed as a variant of the well-known Wyner-Ziv (1976) problem. By using coset codes with nested lattices, the present paper proves that the proposed approach achieves the predictive coding bound asymptotically at all scales while simultaneously providing the functionality of scalable coding.
An Empirical Investigation of the Customer Knowledge Creation Impact on NPD Performance
Authors: Nassim Belbaly, Hind Benbya, Regis Meissonier
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

New product development (NPD) projects require efficient strategies for reducing time to market and responding faster and better to the customer needs. While these strategies were mostly technology driven at the early stages, nowadays firms are adopting knowledge management systems (KMS) to enhance new customer knowledge creation and NPD performance. Despite their potential benefits, there is a variance in the extent of efforts that firms deploy for achieving NPD performance. This is because not all the firms can meet the KMS requirements to support the customer knowledge creation process. In this study, the authors develop a research model that identifies (1) the impact of KMS factors on customer knowledge creation process and NPD performance, (2) the elements that interconnects KMS factors, customer knowledge creation process, and NPD performance (3) the outcomes that are generated by this approach.
Algorithms for survivable routing and wavelength assignment in wdm wavelength-routed mesh networks
Authors: Abdelhamid Eswei Eshoul
Venue:  (2006)

Due to the huge amount of data that can be lost and the large number of users that can be disrupted during the times of failure in wavelength division multiplexing (WDM) optical networks, reliable optical layer that can quickly and efficiently respond to failures such as fiber cuts is a critical issue to users and service providers. The major challenge in survivable mesh networks is the design of resource allocation algorithms that allocate network resources efficiently while at the same time are able to recover from a failure quickly. This issue is particularly more challenging in optical networks operating under wavelength continuity constraint, where the same wavelength must be assigned on all links in the selected path. This thesis presents a number of schemes to solve the problem of survivable routing and wavelength assignment (RWA) in wavelength-routed WDM networks. The focus is on developing algorithms for survivable RWA in mesh networks that address both resource efficiency and restoration speed under static and dynamic traffic environments. Two different approaches (diverse routing and p-cycles) are pursued to solve the problem of survivable RWA. Their performances and complexities are also compared. Under static traffic, new algorithms have been developed to formulate the RWA as an Integer Linear programming problem using both diverse routing and p-cycles. Under dynamic traffic, new heuristic algorithms are developed to solve the survivable RWA using both approaches and their performances are evaluated and compared using simulations.
Robust noise reduction for speech and audio signals
Authors: S. J. Godsill
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

Statistical model-based methods are presented for the reconstruction of autocorrelated signals in impulsive plus continuous noise environments. Signals are modelled as autoregressive and noise sources as discrete and continuous mixtures of Gaussians, allowing for robustness in highly impulsive and non-Gaussian environments. Markov Chain Monte Carlo methods are used for reconstruction of the corrupted waveforms within a Bayesian probabilistic framework and results are presented for contaminated voice and audio signals.
User-level grid monitoring with Inca 2
Authors: Shava Smallen, Kate Ericson, Jim Hayes, Catherine Olschanowsky
Venue: Proceedings of the 2007 workshop on Grid monitoring (2007)

The primary goal in the creation of Grids is to provide unified and coherent access to distributed computing, data storage and analysis, instruments, and other resources to advance scientific exploration. Grids combine multiple complex and interdependent systems that span several administrative domains. This complexity poses challenges for both the administrators who build and maintain the Grid resources and the scientists who use them. While other Gridmonitoring tools provide system-level information on the utilization of Grid resources, the Inca system provides user-level Grid monitoring with periodic, automated user-level testing of the software and services required to support Grid operation. Inca can be used by Grid operators, system administrators,and application users to identify, analyze, and troubleshoot user-level Grid failures, thereby improving Grid stability. In this paper, we describe the new features of our current Inca release, Inca 2. We then describe the architecture of the Inca 2 system, in addition to use cases that describe two Inca 2 deployments in production environments.
PINCET - Process Integration of Collaborative Enterprises
Authors: Rik Eshuis, Heiko Ludwig
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Enterprises more and more collaborate with other enterprises in networked organizations. Such collaborations require the business processes of the partner companies to be aligned and integrated with each other, both on a process and data level in a dynamic, ad-hoc fashion. At the first International Workshop on Process Integration of Collaborative Enterprises (PINCET) at WETICE 2006 several approaches for achieving such flexible integration were presented and discussed. This paper gives a summary of the presented papers at the workshop and the final discussion.
SAPhyRA: Stream Analysis for Physiological Risk Assessment
Authors: Daniele Apiletti, Elena Baralis, Giulia Bruno, Tania Cerquitelli
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Advances in technology allow the continuous physiological monitoring of people using noninvasive sensors. An important issue in this context is the real-time analysis of physiological signals performed on mobile devices, which requires optimized power consumption and short processing response time. The SAPhyRA framework performs real-time stream analysis for physiological risk assessment. To this aim, the framework evaluates people's health conditions by analyzing different clinical signals in a sliding time window. Given historical physiological measures, different models of patients and diseases are built. The most suitable model for the current monitored patient is exploited in the real time stream classification phase. Preliminary experiments performed on public physiological data show the effectiveness and flexibility of the proposed approach.
On set-valued nonlinear equations in Menger probabilistic normed spaces
Authors: Dorel Miheţ
Venue: Fuzzy Sets and Systems (2007)

We introduce the concept of probabilistic (@f,@j)-contractor couple, which allows us to consider set-valued nonlinear operator equations in a large class of probabilistic normed spaces. Our results complete those from Cho et al. [Nonlinear equations for fuzzy mappings in probabilistic normed spaces, Fuzzy Sets and Systems 110 (2000) 115-122] and Fang [On nonlinear equations for fuzzy mappings in probabilistic normed spaces, Fuzzy Sets and Systems 131 (2002) 357-364].
Performance Evaluation of RFID Anti-Collision Algorithm with FPGA Implementation
Authors: Huansheng Ning, Yu Cong, Z.-Q. Xu, T. Hong, J.-C. Zhao, Yan Zhang
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Radio Frequency Identification (RFID) is an emerging wireless technology with highly promising applications in the future pervasive computing scenario. In an RFID system, the anti-collision algorithm is one of the primary mechanisms to address the issue of multi-object identification. This paper firstly introduces the basics of the anti-collision algorithm in RFID system. Then, Field Programmable Gate Array (FPGA) implementation for the algorithm is presented in detail for the sake of avoiding the disadvantage of pure software-based development. In particular, the Manchester coder and decoder for the RFID system have been realized and simulated by using FPGA simulator. The performance of the anti-collision algorithm is evaluated with respect to the metrics the largest number of identified tags per reading, the identification speed and the algorithm efficiency. The methodology and also the result are helpful for designing, deploying and implementing a practical RFID system.
Evolving lifelong learners for a visually guided arm
Authors: K. Rathbone, N. E. Sharkey
Venue: Integrated Computer-Aided Engineering (2002)

The primary objective was to develop a fast learning dynamic controller for uncalibrated visual guidance of a robotic arm. A combination of neural networks learning with an evolutionary method allowed for the study of the interaction of the two techniques in a non-trivial real world application. The neural network controller learned the relationship between changes to the image coordinates, in two cameras, of the arm's end effector due to observed movements, and the motor commands that caused these movements, during its lifetime. This eliminated the need for calibration and made the controller robust to repositioning of the equipment. Many parameters of the controller were evolved by an evolutionary algorithm but not the neural network weights. The aim was to produce a neural network that could rapidly learn the geometry of the arm space using the backpropagation (BP) weight training rule, rather than evolving the weights directly. This is the first time that such a combination of evolutionary neural computing research techniques have been used in the context of a robotic manipulator application. To reduce the time taken for the evolution to within practical limits a minimal simulation approach was used to evolve the learning parameters and the resulting networks were tested both on the simulator and on a physical robot arm in the real world.
Towards Generic On-the-Fly Reconfigurable Sensor Electronics for Embedded System- First Measurement Results of Reconfigurable Folded
Authors: Senthil Kumar Lakshmanan, Peter Tawdross, Andreas Konig
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

The adaptation and robust sensing capabilities of living organisms remain envy to engineers. Several research efforts have been started to mimic these capabilities and exploit them in technical devices, and systems. Embedded systems for sensor applications, comprise of irreplaceable analog and mixed signal components. The considered electronics and sensors themselves are prone to numerous static and dynamic influences and mismatches. Precise design methodology, trimming/ calibration is mandatory to restore the functionality. Recent block level granular approaches using field programmable analog array and the more recent approaches from evolutionary electronics providing transistor level granularity using field programmable transistor array offers considerable extensions. In our work, we started on a new medium level granular approach called Field Programmable Medium granular Mixed signal Array (FPMA) providing basic building blocks of heterogeneous array of active and passive devices to build established circuit structure which are adaptive, fault-tolerant, bio-inspired, and dynamically reconfigurable i.e., trimmable. FPMA also supports rapid prototyping. Our design objective is to create cells of clear compatibility to that of industrial standards having predictable behavior and maintaining quality along with the incorporation of design knowledge. In this paper, measurement results of our first dynamic reconfigurable operational amplifier in an extrinsic fashion are presented. Specific generic configurable cells under the control of optimization techniques are considered. The aspired embedded system architecture will be illustrated and finally the summary of results will be furnished.
Computer aided design of a radiometric system for material sheet production
Authors: H. Bolte, O. Nussen, D. Peters, R. Laur, D. Richter
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

Material sheet production speed and precision has increased in the former decades. This is partly due to improved monitoring of production process core data. Critical data in this respect are the material's edge position and the mass per unit area over the material's width. This paper demonstrates a new design that allows full monitoring of the whole material without moving parts. A model for this system, the multi electrode ionisation chamber (MEIC) is presented.
Numerical Sensitivity Analysis for the Quantity of Interest in PDE-Constrained Optimization
Authors: Roland Griesse, Boris Vexler
Venue: SIAM Journal on Scientific Computing (2007)

In this paper, we consider the efficient computation of derivatives of a functional (the quantity of interest) which depends on the solution of a PDE-constrained optimization problem with inequality constraints and which may be different from the cost functional. The optimization problem is subject to perturbations in the data. We derive conditions under with the quantity of interest possesses first and second order derivatives with respect to the perturbation parameters. An algorithm for the efficient evaluation of these derivatives is developed, with considerable savings over a direct approach, especially in the case of high-dimensional parameter spaces. The computational cost is shown to be small compared to that of the overall optimization algorithm. Numerical experiments involving a parameter identification problem for Navier-Stokes flow and an optimal control problem for a reaction-diffusion system are presented which demonstrate the efficiency of the method.
HMM-based speech recognition using state-dependent, linear transforms on Mel-warped DFT features
Authors: C. Rathinavelu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

We investigate the interactions of front-end feature extraction and back-end classification techniques in HMM based speech recognizer. This work concentrates on finding the optimal linear transformation of Mel-warped short-time DFT information according to the minimum classification error criterion. These transformations, along with the HMM parameters, are automatically trained using the gradient descent method to minimize a measure of overall empirical error count. The discriminatively derived state-dependent transformations on the DFT data are then combined with their first time derivatives to produce a basic feature set. Experimental results show that Mel-warped DFT features, subject to appropriate transformation in a state-dependent manner, are more effective than the Mel-frequency cepstral coefficients that have dominated current speech recognition technology. The best error rate reduction of 9% is obtained using the new model, tested on a TIMIT phone classification task, relative to conventional HMM.
Two-way unary temporal logic over trees
Authors: Mikolaj Bojanczyk
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

We consider a temporal logic EF + F^-1 for unranked, unordered finite trees. The logic has two operators: EF_\varphi , which says "in some proper descendant \varphi holds", and F^-1 \varphi , which says "in some proper ancestor \varphi holds". We present an algorithm for deciding if a regular language of unranked finite trees can be expressed in EF + F^-1. The algorithm uses a characterization expressed in terms of forest algebras.
Implementing real time packet forwarding policies using streams
Authors: Ian Wakeman, Atanu Ghosh, Jon Crowcroft, Van Jacobson, Sally Floyd
Venue: Proceedings of the USENIX 1995 Technical Conference Proceedings on USENIX 1995 Technical Conference Proceedings (1995)

This paper describes an implementation of the class based queueing (CBQ) mechanisms proposed by Sally Floyd and Van Jacobson to provide real time policies for packet forwarding. CBQ allows the traffic flows sharing a data link to be guaranteed a share of the bandwidth when the link is congested, yet allows flexible sharing of the unused bandwidth when the link is unloaded. In addition, CBQ provides mechanisms which give flows requiring low delay priority over other flows. In this way, links can be shared by multiple flows yet still meet the policy and Quality of Service (QoS) requirements of the flows. We present a brief description of the implementation and some preliminary preformance measurements. The problems of packet classification are addressed in a flexible and extensible, yet efficient manner, and whilst the Streams implementation cannot cope with very high speed interfaces, it can cope with the serial link speeds that are likely to be loaded.
Computationally Sound Mechanized Proofs of Correspondence Assertions
Authors: Bruno Blanchet
Venue: Proceedings of the 20th IEEE Computer Security Foundations Symposium (2007)

We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular for establishing authentication. Our technique produces proofs by sequences of games, as standard in cryptography. These proofs are valid for a number of sessions polynomial in the security parameter, in the presence of an active adversary. Our technique can handle a wide variety of cryptographic primitives, including shared- and public-key encryption, signatures, message authentication codes, and hash functions. It has been implemented in the tool CryptoVerif and successfully tested on examples from the literature.