ppxscal/embedding_network huggingface dataset:
IEMC 96 Proceedings. International Conference on Engineering and Technology Management. Managing Virtual Enterprises: A Convergence of Communications, Computing, and Energy Technologies
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

The following topics are discussed: intelligent software agents as tools for managing ethical issues; research administration; human resources management in a virtual organisation; corporate downsizing; multimedia; technology development; virtual supply chain; technological life cycles; facility flexibility; software development management; product development and research and development management. 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
Implementation of a hands-free car phone with echo cancellation and noise-dependent loss control
Authors: H. Puder
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

An implementation of a complete hands-free telephone system on a low-cost DSP with 16-bit fixed-point arithmetic is presented. The prototype, consisting of an adaptive echo canceller, was developed for an industrial customer. The main emphasis is laid on the control unit of the system being necessary for a reliable performance in all environments and the attenuation introduced by the loss control unit. Keeping the loss as small as possible, which is most important for a natural communication including full double-talk capabilities, requires exact knowledge of the current system performance and the background noise level. In case of background noise the applied total loss is adjusted to the power of the noise. The measures we used and their application to our system control are discussed.
Inversion of block matrices with block banded inverses: application to Kalman-Bucy filtering
Authors: A. Asif
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

We investigate the properties of block matrices with block banded inverses to derive efficient matrix inversion algorithms for such matrices. In particular, we derive the following: (1) a recursive algorithm to invert a full matrix whose inverse is structured as a block tridiagonal matrix; (2) a recursive algorithm to compute the inverse of a structured block tridiagonal matrix. These algorithms are exact. They reduce the computational complexity respectively by two and one orders of magnitude over the direct inversion of the associated matrices. We apply these algorithms to develop a computationally efficient approximate implementation of the Kalman-Bucy filter (KBf) that we refer to as the local KBf. The computational effort of the local KBf is reduced by a factor of I/sup 2/ over the exact KBf while exhibiting near-optimal performance.
Improving UNIX kernel performance using profile based optimization
Authors: Steven E. Speer, Rajiv Kumar, Craig Partridge
Venue: Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference (1994)

Several studies have shown that operating system performance has lagged behind improvements in application performance. In this paper we show how operating systems can be improved to make better use of RISC architectures, particularly in some of the networking code, using a compiling technique known as Profile Based Optimization (PBO). PBO uses profiles from the execution of a program to determine how to best organize the binary code to reduce the number of dynamically taken branches and reduce instruction cache misses. In the case of an operating system, PBO can use profiles produced by instrumented kernels to optimize a kernel image to reflect patterns of use on a particular system. Tests applying PBO to an HP-UX kernel running on an HP9000/720 show that certain parts of the system code (most notably the networking code) achieve substantial performance improvements of up to 35% on micro benchmarks. Overall system performance typically improves by about 5%.
A Node Selection Algorithm for Many-to-Many Mappings in Peer-to-Peer Networks
Authors: Seung Chul Han, In Kwan Yu, Ye Xia, Richard Newman
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

To achieve high performance and resilience to failures, many Peer-to-Peer (P2P) systems have begun to use striping and collaborative downloading, where each peer can download the file or pieces of the file from a number of peers in parallel, and at the same time, serve them to some other peers. These P2P systems intrinsically involve many-to- many mappings from the servers to the clients (or peers to peers) as well as many-to-one mappings from the clients to the server. In this paper, we present a node selection algorithm that generates an optimal server set with respect to the worst link stress (WLS) criterion for a single client and evaluates its network performance metrics for many-to- many mappings and many-to-one mappings. Simulation results show that our system is simple yet effective in achieving the design goals. In particular, it minimizes the level of congestion at the bottleneck link, and it consumes less network resources in terms of total bandwidth usage. The objectives of this in-depth examination are to raise awareness and concern for these issues and to provide alternatives or improved designs that can be incorporated into many P2P systems.
iMouse: An Integrated Mobile Surveillance and Wireless Sensor System
Authors: Yu-Chee Tseng, You-Chiun Wang, Kai-Yang Cheng, Yao-Yu Hsieh
Venue: Computer (2007)

Incorporating the environment-sensing capability of wireless sensor networks into video-based surveillance systems can provide advanced services at a lower cost than traditional surveillance systems. The integrated mobile surveillance and wireless sensor system (iMouse) uses static and mobile wireless sensors to detect and then analyze unusual events in the environment.
Color image histogram equalization by absolute discounting back-off
Authors: Nikoletta Bassiou, Constantine Kotropoulos
Venue: Computer Vision and Image Understanding (2007)

A novel color image histogram equalization approach is proposed that exploits the correlation between color components and it is enhanced by a multi-level smoothing technique borrowed from statistical language engineering. Multi-level smoothing aims at dealing efficiently with the problem of unseen color values, either considered independently or in combination with others. It is applied here to the HSI color space for the probability of intensity and the probability of saturation given the intensity, while the hue is left unchanged. Moreover, the proposed approach is extended by an empirical technique, which is based on a hue preserving non-linear transformation, in order to eliminate the gamut problem. This is the second method proposed in the paper. The equalized images by the two methods are compared to those produced by other well-known methods. The better quality of the images equalized by the proposed methods is judged in terms of their visual appeal and objective figures of merit, such as the entropy and the Kullback-Leibler divergence estimates between the resulting color histogram and the multivariate uniform probability density function.
Charting the behavioural state of a person using a backpropagation neural network
Authors: Janet Rothwell, Zuhair Bandar, James O&#x2019;Shea, David McLean
Venue: Neural Computing and Applications (2007)

This paper describes the application of a backpropagation artificial neural network (ANN) for charting the behavioural state of previously unseen persons. In a simulated theft scenario participants stole or did not steal some money and were interviewed about the location of the money. A video of each interview was presented to an automatic system, which collected vectors containing nonverbal behaviour data. Each vector represented a participant&#x2019;s nonverbal behaviour related to &#x201c;deception&#x201d; or &#x201c;truth&#x201d; for a short period of time. These vectors were used for training and testing a backpropagation ANN which was subsequently used for charting the behavioural state of previously unseen participants. Although behaviour related to &#x201c;deception&#x201d; or &#x201c;truth&#x201d; is charted the same strategy can be used to chart different psychological states over time and can be tuned to particular situations, environments and applications.
SOLj: A Domain-Specific Language (DSL) for Secure Service-Based Systems
Authors: Ramesh Bharadwaj, Supratik Mukhopadhyay
Venue: Proceedings of the 11th IEEE International Workshop on Future Trends of Distributed Computing Systems (2007)

We present SOLj (Secure Operations Language-Java), an event-driven domain-specific synchronous programming extension of Java for developing secure service-based systems. The language has capabilities for handling service invocations asynchronously, includes strong typing for the enforcement of information flow and security policies, and exception handling mechanisms to deal with failures of components or services (both benign and Byzantine). Applications written in SOLj are formally verifiable using static analysis techniques. SOLj programs may be deployed, con- figured, and run on SINS (Secure Infrastructure for Networked Systems) under development at the Naval Research Laboratory.
Comparative Study of Supervised Machine Learning Techniques for Intrusion Detection
Authors: Farnaz Gharibian, Ali A. Ghorbani
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

Intrusion detection is an effective approach for dealing with various problems in the area of network security. This paper presents a comparative study of using supervised probabilistic and predictive machine learning techniques for intrusion detection. Two probabilistic techniques Naive Bayes and Gaussian and two predictive techniques Decision Tree and Random Forests are employed. Different training datasets constructed from the KDD99 dataset are employed for training. The ability of each technique for detecting four attack categories (DoS,Probe,R2L and U2R) have been compared. The statistical results to show the sensitivity of each technique to the population of attacks in a dataset have also been reported. We compare the performance of the techniques and also investigate the robustness of each technique by calculating their standard deviations with respect to the detection rate of each attack category.
ReSpecT Nets: Towards an Analysis Methodology for ReSpecT Specifications
Authors: Mirko Viroli, Andrea Omicini
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

A key feature for infrastructures providing coordination services is the ability to define the behaviour of coordination abstractions according to the requirements identified at design-time. We take as a representative for this scenario the logic-based language ReSpecT (Reaction Specification Tuples), used to program the reactive behaviour of tuple centres. ReSpecT specifications are at the core of the engineering methodology underlying the TuCSoN infrastructure, and are therefore the ''conceptual place'' where formal methods can be fruitfully applied to guarantee relevant system properties. In this paper we introduce ReSpecTnets, a formalism that can be used to describe reactive behaviours that can succeed and fail, and that allows for an encoding to Petri nets with inhibitor arcs. ReSpecT nets are introduced to give a core model to a fragment of the ReSpecT language, and to pave the way for devising an analysis methodology including formal verification of safety and liveness properties. In particular, we provide a semantics to ReSpecT specifications through a mapping to ReSpecT nets. The potential of this approach for the analysis of ReSpecT specifications is discussed, presenting initial results for the analysis of safety properties.
The robust Wigner distribution
Authors: L. Stankovic
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

The standard short-time Fourier transform and the Wigner distribution can be obtained as solutions of the minimization problem, with the absolute square error as a loss function. It has been shown that some other loss functions, like for example the absolute error, can produce more robust results in the case of signals corrupted with impulse, heavy-tailed, noise. This paper presents robust time frequency-signal analysis of nonstationary signals, corrupted with heavy-tailed noise. For this purpose the robust Wigner distribution is introduced, as an extension of the robust M-periodogram concept. The theory is illustrated on several examples, including application of the proposed distribution on the instantaneous frequency estimation.
A Manageable and Bandwidth Effective Solution for Traffic Grooming in IP-over-WDM Networks
Authors: N. S. C. Correia, J. Coimbra, M. C. R. Medeiros
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Traffic grooming can be used in IP-over-WDM networks to efficiently utilize the bandwidth of wavelength channels. In grooming networks, however, the number of lightpaths that need to be managed is high and empty time-slots may be switched together with time-slots taken by traffic. These empty time-slots add an induced connectivity to the network and, to use this induced bandwidth, quite complex induced topologies need to be managed, increasing the computation time. In this paper we present an approach to efficiently use the induced bandwidth while alleviating the management of complex topologies. A network operating dynamically is used to test the effectiveness of such approach.
On Understanding How to Introduce an Innovation to an Open Source Project
Authors: Christopher Oezbek, Lutz Prechelt
Venue: Proceedings of the First International Workshop on Emerging Trends in FLOSS Research and Development (2007)

We propose to research the introduction of Software Engineering inventions into Open Source projects (1) to help researchers with creating opportunities for evaluating their tools, methods and process designs in real-life settings, and (2) to help Open Source projects with improving their processes based on state-of-the-art knowledge. Such research will go beyond diffusion and dissemination of inventions to active introduction, and thus increase the chances of adoption. We will discuss the research approach, our preliminary insights, limitations of the approach, and why researchers interested in evaluating their own inventions should be interested in this research.
Hardware atomicity for reliable software speculation
Authors: Naveen Neelakantam, Ravi Rajwar, Suresh Srinivas, Uma Srinivasan, Craig Zilles
Venue: Proceedings of the 34th annual international symposium on Computer architecture (2007)

Speculative compiler optimizations are effective in improving both single-thread performance and reducing power consumption, but their implementation introduces significant complexity, which can limit their adoption, limit their optimization scope, and negatively impact the reliability of the compilers that implement them. To eliminate much of this complexity, as well as increase the effectiveness of these optimizations, we propose that microprocessors provide architecturally-visible hardware primitives for atomic execution. These primitives provide to the compiler the ability to optimize the program's hot path in isolation, allowing the use of non-speculative formulations of optimization passes to perform speculative optimizations. Atomic execution guarantees that if a speculation invariant does not hold, the speculative updates are discarded, the register state is restored, and control is transferred to a non-speculative version of the code, thereby relieving the compiler from the responsibility of generating compensation code. We demonstrate the benefit of hardware atomicity in the context of a Java virtual machine. We find incorporating the notion of atomic regions into an existing compiler intermediate representation to be natural, requiring roughly 3,000 lines of code (~3% of a JVM's optimizing compiler), most of which were for region formation. Its incorporation creates new opportunities for existing optimization passes, as well as greatly simplifying the implementation of additional optimizations (e.g., partial inlining, partial loop unrolling, and speculative lock elision). These optimizations reduce dynamic instruction count by 11% on average and result in a 10-15% average speedup, relative to a baseline compiler with a similar degree of inlining.
On the Safety and Efficiency of Firewall Policy Deployment
Authors: Charles C. Zhang, Marianne Winslett, Carl A. Gunter
Venue: Proceedings of the 2007 IEEE Symposium on Security and Privacy (2007)

Firewall policy management is challenging and error-prone. While ample research has led to tools for policy specification, correctness analysis, and optimization, few researchers have paid attention to firewall policy deployment: the process where a management tool edits a firewall's configuration to make it run the policies specified in the tool. In this paper, we provide the first formal definition and theoretical analysis of safety in firewall policy deployment. We show that naive deployment approaches can easily create a temporary security hole by permitting illegal traffic, or interrupt service by rejecting legal traffic during the deployment. We define safe and most-efficient deployments, and introduce the shuffling theorem as a formal basis for constructing deployment algorithms and proving their safety. We present efficient algorithms for constructing most-efficient deployments in popular policy editing languages. We show that in certain widelyinstalled policy editing languages, a safe deployment is not always possible. We also show how to leverage existing diff algorithms to guarantee a safe, mostefficient, and monotonic deployment in other editing languages.
Coefficient quantization in nearly perfect-reconstruction cosine-modulated filter banks
Authors: J. Alhava
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

This paper presents one possible implementation structure for nearly perfect-reconstruction (NPR) cosine-modulated filter banks (CMFBs). The effect of straightforward coefficient quantization on the performance of the filter bank systems is studied. In multicarrier systems, these filter banks can be used in the transmultiplexer (TMUX) configuration. The performance is evaluated by using parameters like intercarrier interference (ICI), intersymbol interference (ISI), and stopband attenuation.
On-chip samplers for test and debug of asynchronous circuits
Authors: Frankie Liu, Ron Ho, Robert Drost, Scott Fairbanks
Venue: Proceedings of the 13th IEEE International Symposium on Asynchronous Circuits and Systems (2007)

On-chip high-bandwidth sampling circuits supplement traditional test and debug techniques by non-invasively probing analog voltages for off-chip measurement. Existing circuits rely on sub-sampling techniques and thus require a synchronous clock. We extend these ideas to asynchronous circuits by combining an analog sampling head with a variable delay element and activating this circuit with an asynchronously triggered event. Repeated triggering events with different delays emulate sub-sampling. Simulations in a 180nm technology of SRAM timing margins and GasP control failure modes show this technique can probe asynchronous signals with high fidelity.
Equalization of satellite UMTS channels using neural network devices
Authors: S. Bouchired
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

The presence of nonlinear devices in several communication channels, such as satellite channels, causes distortions of the transmitted signal. These distortions are more severe for non-constant envelope modulations such as 16-QAM. Over the last years neural networks (NN) have emerged as competitive tools for linear and nonlinear channel equalization. However, their main drawback is often slow convergence speed which results in poor tracking capabilities. The present paper combines simple NN structures with conventional equalizers. The NN techniques are shown to efficiently approximate the optimal decision boundaries which results in good symbol error rate (SER) performance. The paper gives simulation examples (in the context of satellite mobile channels) and compares neural network approaches to classical equalization techniques.
An Iterative Empirical Strategy for the Systematic Selection of a Combination of Verification and Validation Technologies
Authors: Margaret A. Wojcicki, Paul Strooper
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

The rapid development of verification and validation (V&V) has resulted in a multitude of V&V technologies, making V&V selection difficult for practitioners. Since most V&V technologies will be combined it is important to be aware of how they should be combined and the cost-effectiveness of these combinations. This paper presents a strategy for selecting and evaluating particular V&V combinations that focuses on maximising completeness and minimising effort. The strategy includes a systematic approach for applying empirical information regarding the costs and capabilities of V&V technologies.
Teaching operating systems with ruby
Authors: Robert J. Sheehan
Venue: ACM SIGCSE Bulletin (2007)

Dynamic languages have regained enormous popularity in recent years. One of the principal dynamic programming languages, Ruby, has been used as the language for assignment work and the presentation of concepts in an introductory Operating Systems course. This was a strange choice for a systems course but there were several good reasons for the choice including the ease with which Ruby provides access to Unix commands and system calls. After some initial problems, the change has been very successful and demonstrates that even in the core courses of a Computer Science curriculum dynamic programming languages have benefits.