ppxscal/embedding_network huggingface dataset:
Considering (de)centralization in a Web Services World
Authors: Frank G. Goethals, Monique Snoeck, Wilfried Lemahieu, Jacques Vandenbulcke
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

Web services standards are interesting to realize Business-to-Business integration (B2Bi). However, in the Web services domain too little attention has been paid to the importance of centralizing and decentralizing some data and process issues. This paper shows that these issues should get additional attention if Web services standards are to become more powerful and useful for real-life integration.
Estimating the parameters of a random amplitude sinusoid from its sample covariances
Authors: O. Besson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

In this paper, we consider the best asymptotic accuracy that can be achieved when estimating the parameters of a random-amplitude sinusoid from its sample covariances. An estimator, based upon matching in a weighted least-squares sense the sample correlation sequence to the theoretical sequence is presented. The asymptotic properties of the estimator are analyzed. A lower bound on the estimation of the parameters from sample covariances is derived. This bound is shown to be attainable by appropriately choosing the weighting matrix. Numerical simulations illustrate the performance of the proposed estimator and the validity of the theoretical analysis. Finally, a comparison with Yule-Walker methods is given.
Software process improvement&mdash;A personal view: How it started and where it is going: Research Sections
Authors: Watts S. Humphrey
Venue: Software Process: Improvement and Practice (2007)

While the software process improvement movement is relatively recent, the need for improvement is not new. In this paper, the author reviews his personal experiences with software process improvement and describes some of the key events that led to such current widely-used methods as the CMMI, the PSP, and the TSP. He summarizes the principles behind these methods and explains the principal reasons that these highly effective development methods have not been adopted more rapidly. In closing, he notes that their ultimate adoption is inevitable. Copyright &copy; 2007 John Wiley & Sons, Ltd.
SWIG: an easy to use tool for integrating scripting languages with C and C++
Authors: David M. Beazley
Venue: Proceedings of the 4th conference on USENIX Tcl/Tk Workshop, 1996 - Volume 4 (1996)

I present SWIG (Simplified Wrapper and Interface Generator), a program development tool that automatically generates the bindings between C/C++ code and common scripting languages including Tcl, Python, Perl and Guile. SWIG supports most C/C++ datatypes including pointers, structures, and classes. Unlike many other approaches, SWIG uses ANSI C/C++ declarations and requires the user to make virtually no modifications to the underlying C code. In addition, SWIG automatically produces documentation in HTML, LaTeX, or ASCII format. SWIG has been primarily designed for scientists, engineers, and application developers who would like to use scripting languages with their C/C++ programs without worrying about the underlying implementation details of each language or using a complicated software development tool. This paper concentrates on SWIG's use with Tcl/Tk.
Enterprise, Systems, and Software Engineering--The Need for Integration
Authors: Paul Joannou
Venue: Computer (2007)

The emerging field of enterprise engineering must integrate with established disciplines.
A low-complexity waveform interpolation coder
Authors: W. B. Kleijn, Y. Shoham, D. Sen, R. Hagen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

A recent independent survey found a 2.4 kbit/s waveform-interpolation (WI) algorithm to perform better than other state-of-the-art speech coders. However, this coder had a very high level of computational complexity. The introduction of various techniques, including a time-varying waveform sampling rate and a cubic B-spline waveform representation, has reduced the computational complexity by an order of magnitude. The new implementation allows full-duplex real-time operation on a single DSP device and on an average workstation (the latter using non-optimized compiled C source code). The new coder also contains a number of new features which improve the quality of the reconstructed speech signal.
Mythbusters: event stream processing versus complex event processing
Authors: Tim Bass
Venue: Proceedings of the 2007 inaugural international conference on Distributed event-based systems (2007)

There has been significant event processing controversy in the use of the terms event stream processing (ESP) and complex event processing (CEP). CEP was originally envisioned as a technology to extract new information from message-based systems; while ESP was designed to extract new information from database-oriented systems. One school of thought is that ESP is analogous to signal processing and CEP is more aligned with higher level situational inferencing. Another school of thought is that CEP and ESP are one in the same! This talk explores the relationship between CEP and ESP in the context of event processing, and in particular to an event processing reference architecture derived from earlier distributed blackboard computing models. After introducing the model, we explore where ESP and CEP "fit" by applying ESP and CEP concepts to practical use cases for event processing, drawing from signal processing, decision theory, control theory, and stochastic processing. The basis of the talk is derived from established thinking in the domain of multi-sensor data fusion, applying traditional concepts to today's commercial view of event processing. The talk will be controversial and provocative, stimulating discussion and thought on areas for further research and development. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
StackGuard: automatic adaptive detection and prevention of buffer-overflow attacks
Authors: Crispin Cowan, Calton Pu, Dave Maier, Heather Hintony, Jonathan Walpole, Peat Bakke, Steve Beattie, Aaron Grier, Perry Wagle, Qian Zhang
Venue: Proceedings of the 7th conference on USENIX Security Symposium - Volume 7 (1998)

This paper presents a systematic solution to the persistent problem of buffer overflow attacks. Buffer overflow attacks gained notoriety in 1988 as part of the Morris Worm incident on the Internet. While it is fairly simple to fix individual buffer overflow vulnerabilities, buffer overflow attacks continue to this day. Hundreds of attacks have been discovered, and while most of the obvious vulnerabilities have now been patched, more sophisticated buffer overflow attacks continue to emerge. We describe StackGuard: a simple compiler technique that virtually eliminates buffer overflow vulnerabilities with only modest performance penalties. Privileged programs that are recompiled with the StackGuard compiler extension no longer yield control to the attacker, but rather enter a fail-safe state. These programs require no source code changes at all, and are binary-compatible with existing operating systems and libraries. We describe the compiler technique (a simple patch to gcc), as well as a set of variations on the technique that trade-off between penetration resistance and performance. We present experimental results of both the penetration resistance and the performance impact of this technique.
Two Bayesian methods for multipath propagation parameters estimation
Authors: F. Poree
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

We propose a Bayesian approach for multipath channel time delay estimation when the signal is received by a square-law detector. Two different methods are presented. The first one is applied when the signal is supplied at the output of the detector. On certain approximations, the derivation of the MAP (maximum a posteriori) estimator leads to optimize a l/sub 1/-norm criterion. In the second method, the signal is observed after demodulation and matched-filtering. We introduce a Bernoulli-Gaussian model to account for the sparse properties of the channel impulse response and solve the deconvolution problem using Monte-Carlo simulations. Comparisons between both algorithms are presented on simulations. They show that the second method leads to more accurate estimators, while justifying the validity of the approximations used in the first one.
Efficient Routing and Broadcasting in Recursive Interconnection Networks
Authors: Ronald Fernandes, Donald K. Friesen, Arkady Kanevsky
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

The WK-Recursive Network (WKRN) is a hierarchical interconnection network that is recursively defined and has excellent properties for scalable message-passing multicomputer systems. In this paper, we present efficient routing and broadcasting schemes in a WKRN. For efficient routing, we define the MP-graph between the source and destination nodes of the message. For efficient broadcasting, we define the EDHP-graph and the NDST-graph. The MP-graph can also be used for message routing in the presence of faulty nodes. Similarly, the EDHP-graph (the NDST-graph) can be used for message broadcast in the presence of faulty links (nodes). Fault-tolerant communication schemes using these graphs have the advantage that no information about the presence or location of faulty components is required. Moreover, the MP-graph and the NDSTgraph can be used under different fault models. We analyze the communication delays for message routing (broadcast) along MP-graphs (EDHP-graphs and NDST-graphs) under fault-free and faulty conditions.
ALMI: an application level multicast infrastructure
Authors: Dimitrios Pendarakis, Sherlia Shi, Dinesh Verma, Marcel Waldvogel
Venue: Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3 (2001)

The IP multicast model allows scalable and efficient multi-party communication, particularly for groups of large size. However, deployment of IP multicast requires substantial infrastructure modifications and is hampered by a host of unresolved open problems. To circumvent this situation, we have designed and implemented ALMI, and application level group communication middleware, which allows accelerated application deployment and simplified network configuration, without the need of network infrastructure support. ALMI is tailored toward support of multicast groups of relatively small size (several 10s of members) with many to many semantics. Session participants are connected via a virtual multicast tree, which consists of unicast connections between end hosts and is formed as a minimum spanning tree (MST) using application-specific performance metric. Using simulation, we show that the performance penalties, introducted by this shift of multicast to end systems, is a relatively small increase in traffic load and that ALMI multicast trees approach the efficiency of IP multicast trees. We have also implemented ALMI as a Java based middleware package and performed experiments over the Internet. Experimental results show that ALMI is able to cope with network dynamics and keep the multicast tree efficient.
Cross-modal prediction in audio-visual communication
Authors: R. R. Rao
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

We present a novel means for predicting the shape of a person's mouth from the corresponding speech signal and explore applications of this prediction to video coding. The prediction is accomplished by modeling the probability distribution of the audiovisual features by a Gaussian mixture density. The optimal estimate for the visual features given the acoustic features can then be computed using this probability distribution. The ability to predict a person's mouth shape from the corresponding audio leads to a number of interesting joint audio-video coding strategies. In the cross-modal predictive coding system described, a model-based video coder compares measured visual parameters with predicted visual parameters, and sends the difference between the two to the receiver. Since the decoder also receives the acoustic data, it can form the prediction and then reconstruct the original parameters by adding the transmitted error signal.
Argon: performance insulation for shared storage servers
Authors: Matthew Wachs, Michael Abd-El-Malek, Eno Thereska, Gregory R. Ganger
Venue: Proceedings of the 5th USENIX conference on File and Storage Technologies (2007)

Services that share a storage system should realize the same efficiency, within their share of time, as when they have the system to themselves. The Argon storage server explicitly manages its resources to bound the inefficiency arising from inter-service disk and cache interference in traditional systems. The goal is to provide each service with at least a configured fraction (e.g., 0.9) of the throughput it achieves when it has the storage server to itself, within its share of the server--a service allocated 1/nth of a server should get nearly 1/nth (or more) of the throughput it would get alone. Argon uses automaticallyconfigured prefetch/write-back sizes to insulate streaming efficiency from disk seeks introduced by competing workloads. It uses explicit disk time quanta to do the same for non-streaming workloads with internal locality. It partitions the cache among services, based on their observed access patterns, to insulate the hit rate each achieves from the access patterns of others. Experiments show that, combined, these mechanisms and Argon's automatic configuration of each achieve the insulation goal.
From Reality to Programs and (Not Quite) Back Again
Authors: Daniel Ratiu, Florian Deissenboeck
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

Making explicit the mappings between real-world concepts and program elements that implement them is an essential step in understanding, using or evaluating the public interface of programs, libraries and other collections of classes that model core domain concepts. Unfortunately, due to the big abstraction gap between the modeled domain and today's programming languages, the mapping is most of the times ambiguous as concepts and relations from the real world are distorted and diffused in the code. In this paper we present a comprehensive formal framework for describing the many-to-many mappings between domain concepts and the program elements, real-world relations and program relations and the real-world concept names and program identifiers. This framework allows us to describe and discuss typical classes of diffusion of the domain knowledge in code. Based on our formal framework we describe an algorithm to recover the mappings between entities from an ontology and program elements. We illustrate the framework by using examples from the Java standard library.
TAPER: tiered approach for eliminating redundancy in replica synchronization
Authors: Navendu Jain, Mike Dahlin, Renu Tewari
Venue: Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4 (2005)

We present TAPER, a scalable data replication protocol that synchronizes a large collection of data across multiple geographically distributed replica locations. TAPER can be applied to a broad range of systems, such as software distribution mirrors, content distribution networks, backup and recovery, and federated file systems. TAPER is designed to be bandwidth efficient, scalable and content-based, and it does not require prior knowledge of the replica state. To achieve these properties, TAPER provides: i) four pluggable redundancy elimination phases that balance the trade-off between bandwidth savings and computation overheads, ii) a hierarchical hash tree based directory pruning phase that quickly matches identical data from the granularity of directory trees to individual files, iii) a content-based similarity detection technique using Bloom filters to identify similar files, and iv) a combination of coarse-grained chunk matching with finer-grained block matches to achieve bandwidth efficiency. Through extensive experiments on various datasets, we observe that in comparison with rsync, a widely-used directory synchronization tool, TAPER reduces bandwidth by 15% to 71%, performs faster matching, and scales to a larger number of replicas.
A communication protocol using a Markov type function for stations in a wireless local area network
Authors: N. Natchimuthu, A. S. M. Sajeev
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

The IEEE 802.11 medium access control protocol uses the distributed coordination function that supports asynchronous data transfer and an optional point coordination function that supports connection-oriented time-bounded data transfer. A new protocol based on the exponential distribution function of the Markov type is integrated with the distributed coordination function that supports high and low access priority for a particular station to use the channel bandwidth. The main benefit of this protocol is that it is simple and allows for dynamic reservation of bandwidth. Preliminary results of simulations on the bandwidth access of this protocol is given and analysed.
Attack-resistant trust metrics for public key certification
Authors: Raph Levien, Alexander Aiken
Venue: Proceedings of the 7th conference on USENIX Security Symposium - Volume 7 (1998)

This paper investigates the role of trust metrics in attack-resistant public key certification. We present an analytical framework for understanding the effectiveness of trust metrics in resisting attacks, including a characterization of the space of possible attacks. Within this framework, we establish the theoretical best case for a trust metric. Finally, we present a practical trust metric based on network flow that meets this theoretical bound.
Advanced Urban Transport: Automation Is on the Way
Authors: Michel Parent
Venue: IEEE Intelligent Systems (2007)

The automobile became the world's dominant transport mode in the last century. As the demand for automobile transport continues togrow, so do toxic emissions and accidents. One solution is to remove the driver from the control loop by fully automating vehicle drivingfunctions. The European CityMobil project is implementing various solutions in several European cities to demonstrate this approach. Theproject includes various forms of automation in car-sharing vehicles, buses, and cybercars.
The application of Walsh transform for forward error correction
Authors: F. Marvasti
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

We present a novel class of forward error correcting codes constructed using the discrete Walsh transform. They are a class of double-error correcting codes defined on the field of real numbers. An iterative decoding algorithm for Walsh transform codes is developed and implemented. The error correcting performance of Walsh transform codes over an AWGN channel is evaluated. Selected Walsh transform code parameters are compared to those of the well-known BCH and RS codes.
Is Transaction Cost Economics Theory Able to Explain Contracts Used for and Success of Firm-Wide IT-Infrastructure Outsourcing?
Authors: Mari Nyrhinen, Tomi Dahlberg
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Transaction cost economics (TCE) is much used in outsourcing research. We applied two TCE attributes - asset specificity and frequency - to characterise IT infrastructure services and to indicate what type of outsourcing contracts should be concluded. We classified outsourcing contracts of 213 enterprises to determine if TCE contracting recommendations were followed, and if outsourcing succeeded better when the contract type matched the IT infrastructure service characteristics. Results reveal that enterprises do not follow TCE contract recommendations. They probably should. In application services the match of contract type and service characteristics was positively related to absolute IT outsourcing success.
Automated colour grading using colour distribution transfer
Authors: François Pitié, Anil C. Kokaram, Rozenn Dahyot
Venue: Computer Vision and Image Understanding (2007)

This article proposes an original method for grading the colours between different images or shots. The first stage of the method is to find a one-to-one colour mapping that transfers the palette of an example target picture to the original picture. This is performed using an original and parameter free algorithm that is able to transform any N-dimensional probability density function into another one. The proposed algorithm is iterative, non-linear and has a low computational cost. Applying the colour mapping on the original picture allows reproducing the same 'feel' as the target picture, but can also increase the graininess of the original picture, especially if the colour dynamic of the two pictures is very different. The second stage of the method is to reduce this grain artefact through an efficient post-processing algorithm that intends to preserve the gradient field of the original picture.
Using BPM Technologies for Material Balances Modelling
Authors: Alexandra Fortis, Florin Fortis
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

The purpose of this paper is to offer a novel approach for modelling and simulation of material balances by using workflow technologies. The work in this paper is concentrated around BPMN as a modelling language, sustained by BPEL as an execution language, and different supporting technologies, to complete the tool chain. We are analyzing here the modelling of a simple chemical process, starting from the ideal material balance, as one can deduce from the fundamental laws of conservation, and developing then more complex models, conforming with most of the technological flow specification.
Using student-created multimedia programs to teach design and communications
Authors: S. B. Fellows
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

The authors describe a visit by elementary school children to a computer laboratory at Binghampton University where freshmen engineering students in the Design, Technology, and Communications Program (DTeC) use multimedia programs to teach the children. The focus of DTeC, an introductory course sequence, is the integration of instruction in the basic skills used by the practicing engineer: graphical representation, computer usage, communication, and design. Since multimedia programs utilize all of these skills, the creation of multimedia programs by the students is a logical activity to incorporate into the program.