ppxscal/embedding_network huggingface dataset:
An ad hoc routing protocol providing short backup routes
Authors: N. Ventura, Li-Hsing Yen, Kun-Ming Yu
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

When the rate of topological changes in the network is high, most of existing ad hoc routing protocols are not able to react fast enough to maintain routing. TORA is thus designed to minimize reaction to topological change, but it does not take routing optimality into consideration. In this paper, we propose a routing protocol that not only reacts fast but also adopts short routes. In the protocol, backup routes are constructed to surround the main route. When links go down, our protocol intelligently selects a short route among the backup routes and replaces these failed links with it. Note that in our protocol backup routes are constructed and updated to the present network topology.
Feasible reactivity in a synchronous Π-calculus
Authors: Roberto M. Amadio, Frédéric Dabrowski
Venue: Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming (2007)

Reactivity is an essential property of a synchronous program. Informally, it guarantees that at each instant the program fed with an input will"react" producing an output. In the present work, we consider a refined property that we call feasible reactivity. Beyond reactivity, this property guarantees that at each instant both the size of the program and its reaction time are bounded by a polynomial in the size of the parameters at the beginning of the computation and the size of the largest input. We propose a method to annotate programs and we develop related static analysis techniques that guarantee feasible reactivity for programs expressed in the SΠ-calculus. The latter is a synchronous version of the Π-calculus based on the SL synchronous programming model.
Latency analysis of TCP on an ATM network
Authors: Alec Wolman, Geoff Voelker, Chandramohan A. Thekkath
Venue: Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference (1994)

In this paper we characterize the latency of the BSD 4.4 alpha implementation of TCP on an ATM network. Latency reduction is a difficult task, and careful analysis is the first step towards reduction. We investigate the impact of both the network controller and the protocol implementation on latency. We find that a low latency network controller has a significant impact on the overall latency of TCP. We also characterize the impact on latency of some widely discussed improvements to TCP, such as header prediction and the combination of the checksum calculation with data copying.
A design exercise for electives in control systems
Authors: M. S. Fadali
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

At the University of Nevada, Reno, we strongly believe that effective control system education must include experimental exercises that complement the theory presented in lectures. Preferably, the exercises should include the design and implementation of a control system. Limited resources and a cap on the number of credit hours required for the undergraduate degree make it impossible to offer a laboratory course with every control class in most electrical engineering curricula. We have solved this problem by including a laboratory project in each of our two senior electives. Each project is a comprehensive modeling, analysis, design and implementation of a physical control system. The students are divided into groups and each group must independently complete the design project and submit a formal report summarizing their results and experiences. Each student must submit an individual commentary on the exercise and the experimental results obtained. Student feedback indicates an increased appreciation of the lecture material and an awareness of the limitations of the theory and simulation that was lacking prior to the introduction of laboratory exercises.
Eliminating receive livelock in an interrupt-driven kernel
Authors: Jeffrey C. Mogul, K. K. Ramakrishnan
Venue: Proceedings of the 1996 annual conference on USENIX Annual Technical Conference (1996)

Most operating systems use interface interrupts to schedule network tasks. Interrupt-driven systems can provide low overhead and good latency at low offered load, but degrade significantly at higher arrival rates unless care is taken to prevent several pathologies. These are various forms of receive livelock, in which the system spends all its time processing interrupts, to the exclusion of other necessary tasks. Under extreme conditions, no packets are delivered to the user application or the output of the system. To avoid livelock and related problems, an operating system must schedule network interrupt handling as carefully as it schedules process execution. We modified an interrupt-driven networking implementation to do so; this eliminates receive livelock without degrading other aspects of system performance. We present measurements demonstrating the success of our approach.
Co-channel interference canceller to improve spectral efficiency in P-P wireless systems for last mile access networks
Authors: N. Izuka, Y. Daido, T. Watanabe
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

This paper discusses tolerances of impairment factors in a proposed co-channel interference canceller that is applied to a point-to-point (P-P) wireless system using quasi-millimeter frequency band (22 GHz and 26 GHz). The interference canceller can double a data rate of the system using two P-P wireless links. which are deployed in parallel. The two links use the same frequency band and the same polarization. We analytically estimate the proposed canceller performance when a replica of an interfering signal has static phase and amplitude errors. The calculation results show that the proposed canceller could improve an error rate performance in the presence of the errors.
Particle swarm optimization for minimax problems
Authors: E. C. Laskari, K. E. Parsopoulos, M. N. Vrahatis
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper investigates the ability of the Particle Swarm Optimization (PSO) method to cope with minimax problems through experiments on well-known test functions. Experimental results indicate that PSO tackles minimax problems effectively. Moreover, PSO alleviates difficulties that might be encountered by gradient-based methods, due to the nature of the minimax: objective function, and potentially lead to failure. The performance of PSO is compared with that of other established approaches, such as the sequential quadratic programming (SQP) method and a recently proposed smoothing technique.
Minitrack: Engineering and Economics Interactions
Authors: Shmuel S. Oren
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In this minitrack we address two important aspects characterizing the restructuring of the electric power industry in the US. The first is that reliability is now affected substantially by the fact that resources needed for grid operations are purchased from many independent participants in wholesale markets, each with its own profit motive. Thus the reliability obtained from the previous "command and control" system is degraded by a new dependence on market mechanisms that bring their own sources of unreliability and volatility. The effects are both short-term, as in day-ahead and real-time markets for energy, reserves, and congestion relief; and long-term, as in investments in transmission and generation capacity. The severity of these effects is heightened by the fact that in the U.S. the Transmission System Operator must adhere rigorously to the rules established in its tariff approved by FERC, thus eliminating much of the role for operators' judgment and discretion that was implicit in vertically integrated systems.
FormatGuard: automatic protection from printf format string vulnerabilities
Authors: Crispin Cowan, Matt Barringer, Steve Beattie, Greg Kroah-Hartman, Mike Frantzen, Jamie Lokier
Venue: Proceedings of the 10th conference on USENIX Security Symposium - Volume 10 (2001)

In June 2000, a major new class of vulnerabilities called "format bugs" was discovered when an vulnerability in WU-FTP appeared that acted almost like a buffer overflow, but wasn't. Since then, dozens of format string vulnerabilities have appeared. This paper describes the format bug problem, and presents FormatGuard: our proposed solution. FormatGuard is a small patch to glibc that provides general protection against format bugs. We show that FormatGuard is effective in protecting several real programs with format vulnerabilities against live exploits, and we show that FormatGuard imposes minimal compatibility and performance costs.
Supporting Resource-Constrained Collaboration Environments
Authors: Sean M. Price
Venue: Computer (2007)

Using an approach that incorporates a directory structure helps collaborative group members find information while protecting their work's integrity.
Partial Linear Gaussian Models for Tracking in Image Sequences Using Sequential Monte Carlo Methods
Authors: Elise Arnaud, Etienne Mémin
Venue: International Journal of Computer Vision (2007)

The recent development of Sequential Monte Carlo methods (also called particle filters) has enabled the definition of efficient algorithms for tracking applications in image sequences. The efficiency of these approaches depends on the quality of the state-space exploration, which may be inefficient due to a crude choice of the function used to sample in the associated probability space. A careful study of this issue led us to consider the modeling of the tracked dynamic system with partial linear Gaussian models. Such models are characterized by a non linear dynamic equation, a linear measurement equation and additive Gaussian noises. They allow inferring an analytic expression of the optimal importance function used in the diffusion process of the particle filter, and enable building a relevant approximation of a validation gate. Despite of these potential advantages partial linear Gaussian models have not been investigated. The aim of this paper is therefore to demonstrate that such models can be of real interest facing difficult usual issues such as occlusions, ambiguities due to cluttered backgrounds and large state space. Three instances of these models are proposed. After a theoretical analysis, their significance is demonstrated by their performance for tracking points and planar objects in challenging real-world image sequences.
Interactive sonification of abstract data: framework, design space, evaluation, and user tool
Authors: Ben Shneiderman, Catherine Plaisant
Venue:  (2006)

For people with visual impairments, sound is an important information channel. The traditional accommodation for visually impaired users to access data is to rely on screen readers to speak the data in tabular forms. While speech can accurately describe information, such data presentation tends to be long and hard to realize complex information. This is particularly true in exploratory data analysis in which users often need to examine the data from different aspects. Sonification, the use of non-speech sound, has shown to help data comprehension. Previous data sonifications focus on data to sound attribute mapping and typically lack support for task-oriented data interaction. This dissertation makes four contributions. (1) An Action-by-Design-Component (ADC) framework guides auditory interface designs for exploratory data analysis. The framework characterizes data interaction in the auditory mode as a set of Auditory Information Seeking Actions (AISA). It also discusses design considerations for a set of Design Components to support AISAs, contrasted with actions in visualizations. (2) Applying the framework to geo-referenced statistical data, I explore its design space. Through user evaluations, effective design options were identified and insights were obtained regarding human ability to perceive complex information, especially those with spatial structures, from interactive sounds. (3) A tool, iSonic, was developed, with synchronized visual and auditory displays. Forty-two hours of case studies with seven blind users show that iSonic enables them to effectively explore data in highly coordinated map and table views without special devices, to find facts and discover data trends even in unfamiliar geographical contexts. Preliminary algorithms are also described to automatically generate geographical region spatial sweep orders for arbitrary maps. (4) The application to geo-referenced data demonstrated that the ADC framework provided a rich set of task-oriented actions (AISAs) that were effective for blind users to accomplish complex tasks with multiple highly coordinated data views. It also showed that some widely used techniques in visualization can adapt to the auditory mode. By applying the framework to scatterplots and line graphs, I show that the framework could be generalized and lead to the design of a unified auditory workspace for general exploratory data analysis.
Real-time sound synthesis and propagation for games
Authors: Nikunj Raghuvanshi, Christian Lauterbach, Anish Chandak, Dinesh Manocha, Ming C. Lin
Venue: Communications of the ACM (2007)

Simulating the complete process of sound synthesis and propagation by exploiting aural perception makes the experience of playing games much more realistic and immersive.
A Seed-Selection Method to Increase Defect Coverage for LFSR-Reseeding-Based Test Compression
Authors: Zhanglei Wang, Krishnendu Chakrabarty, Michael Bienek
Venue: Proceedings of the 12th IEEE European Test Symposium (2007)

LFSR reseeding forms the basis for many test compres- sion solutions. A seed can be computed for each test cube by solving a system of linear equations based on the feedback polynomial of the LFSR. Despite the availability of numerous LFSR-reseeding-based compression methods in the literature, relatively little is known about the effectiveness of these seeds for unmodeled defects. We use the recently proposed output deviation measure of the resulting patterns as a metric to select appropriate LFSR seeds. Experimental results are reported using test patterns for stuck-at faults derived from selected seeds. These patterns achieve higher coverage for stuck-open and transition faults than patterns obtained using other methods.
Approximation of coalescence integrals in population balance models with local mass conservation
Authors: Wolfgang Hackbusch
Venue: Numerische Mathematik (2007)

The solution of population balance equations is a function f (t, r, x) describing a population density of particles of the property x at time t and space r. For instance, the additional independent variable x may denote the mass of the particle. The describing equation contains additional sink and source terms involving integral operators. Since the coordinate x adds at least one further dimension to the spatial directions and time coordinate, an efficient numerical treatment of the integral terms is crucial. One of the more involved integral terms appearing in population balance models is the coalescence integral, which is of the form $$\int_{0}^{x} \kappa(x-y,y)f(y) f(x-y)\mathrm{d}y.$$ The discretisation may use a locally refined grid. In this paper we describe an algorithm which (i) is efficient (the cost is $$\mathcal{O}(N\log N)$$, N: data size) and (ii) ensures local mass conservation.
Organizational learning and network adaptation in multi-agent systems
Authors: Marie Desjardins
Venue:  (2005)

In both real and artificial societies, successful organizations are highly dependent upon a structure that fosters effective and efficient behavior at both the individual and the organizational levels. In multi-agent systems, groups of agents must coordinate effectively in order to solve problems, allocate tasks across a distributed organization, collectively distribute knowledge and information, and achieve collective goals. The organizational structure of a multi-agent system dictates the interactions among the agents, and can play a significant role in the overall performance of a society of agents. Given the importance of organizational network structures for multi-agent systems, distributed network adaptation is a promising approach for organizational learning. After reviewing related work in multi-agent learning, the structure and dynamics of networks, and organizational learning in multi-agent systems, I present the concept of agent-organized networks as an approach for organizational learning by distributed network adaptation. Supported by theoretical evidence of the complexity of organizational network design, a general learning-based agent-organized network framework is proposed and applied to two general environments: multi-agent team formation and a production and exchange economy. In addition, the general framework is used to develop distributed network adaptation strategies for specific applications in supply network formation and wireless sensor networks. Experimental results for both the general and specific multi-agent environments support the hypothesis that distributed management and adaptation of organizational network structure leads to improved collective performance in nulti-agent systems. Analyses of the structural characteristics of the networks as they evolve are used to aid in understanding the behavior of agent-organized networks and further support the utility of distributed network adaptation for organizational learning in multi-agent systems.
Spatio-temporal filters for downlink processing in FDD systems
Authors: P. Forster
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

This paper deals with downlink space-time processing for FDD (frequency division duplex) radiocommunication systems whose base stations are equipped with antenna arrays. We show how space-time filters can be appropriately designed for the downlink in order to both combat co-channel interference and reduce fading effects. These filters, which can be estimated from uplink data only, are an extension of previous schemes which considered only space processing for the downlink.
Scientific visualization in the circuits curriculum: enhancing student insight
Authors: E. R. Doering
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Scientific visualization techniques translate large and/or multidimensional numerical data sets into images. Properly prepared images enable the user to more readily correlate information, determine cause-and-effect relationships, and gain insight into the underlying principles embodied in the data. Concepts from scientific visualization have been used to develop CircuitViz, a tool for visualizing the behavior of dynamic circuits. This circuit visualization technique places a 2D circuit schematic in a 3D coordinate system. The third spatial dimension displays circuit variables (current, voltage, power, stored energy) directly on the schematic diagram, and animation displays the temporal dimension. The visual cues are designed to be intuitively appealing and to reinforce understanding of device operation. The technique, implemented as a Mathematica package, was pilot-tested for two weeks in a second-quarter sophomore circuits class studying the transient response of first- and second-order circuits. The animated imagery stimulated student interest in the material, and students made insightful observations about how circuits work as a result of viewing the global operation of the circuits. 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
Minitrack: Web Effectiveness: The User Perspective
Authors: Carolyn Watters, Amanda Spink
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The Measuring Web Effectiveness: The User Perspective minitrack is a multidisciplinary forum for considering issues related to the effectiveness of Web searching from the user's perspective. The minitrack examines the behavior of users seeking information on the Web. This is allows us to bring into the discussion, considerations of the impact that design choices in the development of new Web systems and tools have on Web users engaging a wide range of expertise, including human computer interface design, information seeking behavior, and information management.
Manifold learning for natural image sets
Authors: Robert Pless
Venue:  (2006)

The field of manifold learning provides powerful tools for parameterizing high-dimensional data points with a small number of parameters when this data lies on or near some manifold. Images can be thought of as points in some high-dimensional image space where each coordinate represents the intensity value of a single pixel. These manifold learning techniques have been successfully applied to simple image sets, such as handwriting data and a statue in a tightly controlled environment. However, they fail in the case of natural image sets, even those that only vary due to a single degree of freedom, such as a person walking or a heart beating. Parameterizing data sets such as these will allow for additional constraints on traditional computer vision problems such as segmentation and tracking. This dissertation explores the reasons why classical manifold learning algorithms fail on natural image sets and proposes new algorithms for parameterizing this type of data.
A robust approach for the single machine scheduling problem
Authors: Cyril Briand, H. Trung La, Jacques Erschler
Venue: Journal of Scheduling (2007)

This paper describes a robust approach for the single machine scheduling problem 1|r i |L max¿. The method is said to be robust since it characterizes a large set of optimal solutions allowing to switch from one solution to another, without any performance loss, in order to face potential disruptions which occur during the schedule execution. It is based on a dominance theorem that characterizes a set of dominant sequences, using the interval structure defined by the relative order of the release and the due dates of jobs. The performance of a set of dominant sequences can be determined in polynomial time by computing the most favorable and the most unfavorable sequences associated with each job, with regard to the lateness criterion. A branch and bound procedure is proposed which modifies the interval structure of the problem in order to tighten the dominant set of sequences so that only the optimal sequences are conserved.