ppxscal/embedding_network huggingface dataset:
Improving the reliability of internet paths with one-hop source routing
Authors: Krishna P. Gummadi, Harsha V. Madhyastha, Steven D. Gribble, Henry M. Levy, David Wetherall
Venue: Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6 (2004)

Recent work has focused on increasing availability in the face of Internet path failures. To date, proposed solutions have relied on complex routing and path-monitoring schemes, trading scalability for availability among a relatively small set of hosts. This paper proposes a simple, scalable approach to recover from Internet path failures. Our contributions are threefold. First, we conduct a broad measurement study of Internet path failures on a collection of 3,153 Internet destinations consisting of popular Web servers, broad-band hosts, and randomly selected nodes. We monitored these destinations from 67 PlanetLab vantage points over a period of seven days, and found availabilities ranging from 99.6% for servers to 94.4% for broadband hosts. When failures do occur, many appear too close to the destination (e.g., last-hop and end-host failures) to be mitigated through alternative routing techniques of any kind. Second, we show that for the failures that can be addressed through routing, a simple, scalable technique, called one-hop source routing, can achieve close to the maximum benefit available with very low overhead. When a path failure occurs, our scheme attempts to recover from it by routing indirectly through a small set of randomly chosen intermediaries. Third, we implemented and deployed a prototype one-hop source routing infrastructure on PlanetLab. Over a three day period, we repeatedly fetched documents from 982 popular Internet Web servers and used one-hop source routing to attempt to route around the failures we observed. Our results show that our prototype successfully recovered from 56% of network failures. However, we also found a large number of server failures that cannot be addressed through alternative routing. Our research demonstrates that one-hop source routing is easy to implement, adds negligible overhead, and achieves close to the maximum benefit available to indirect routing schemes, without the need for path monitoring, history, or a-priori knowledge of any kind.
Adaptation and specialization for high performance mobile agents
Authors: Dong Zhou, Karsten Schwan
Venue: Proceedings of the 5th conference on USENIX Conference on Object-Oriented Technologies & Systems - Volume 5 (1999)

Mobile agents as a new design paradigm for distributed computing potentially permit network applications to operate across dynamic and heterogeneous systems and networks. Agent computing, however, is subject to inefficiencies. Namely, due to the heterogeneous nature of the environments in which agents are executed, agent-based programs must rely on underlying agent systems to mask some of those complexities by using system-wide, uniform representations of agent code and data and by 'hiding' the volatility in agents' 'spatial' relationships. This paper explores runtime adaptation and agent specialization for improving the performance of agent-based programs. Our general aim is to enable programmers to employ these techniques to improve program performance without sacrificing the fundamental advantages promised by mobile agent programming. The specific results in this paper demonstrate the beneficial effects of agent adaptation both for a single mobile agent and for several cooperating agents, using the adaptation techniques of agent morphing and agent fusion. Experimental results are attained with two sample high performance distributed applications, derived from the scientific domain and from sensor-based codes, respectively.
Object classification using mixed color feature
Authors: Y. Y. Gao
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

This paper proposes a color feature called mixed color feature (MCF) to describe the image contents in terms of human visual perception. Construction and distance measurement of MCF is interpreted in detail. A nonlinear quantizer is proposed to improve the efficiency of MCF. To evaluate the effect and accuracy of MCF in practice, a practical implementation of MCF in object classification is carried out. First, the major histogram (MH) is extracted from MCF as the basic feature in the classification processing; second, weighted nearest matching (WNM) is presented and applied to accomplish the classification. A comparison experiment is carried out and the results show the advantage and efficiency of the proposed method.
Widening 6-DOF haptic devices workspace with an additional degree of freedom
Authors: Florian Gosselin, Claude Andriot, Florian Bergez, Xavier Merlhiot
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

The aim of haptic interfaces is to enhance the user's immersion in a virtual environment through the stimulation of the haptic sense. In the context of scale one applications in immersive environments, the haptic interface must provide a very large workspace without degrading transparency. To reach this goal, we investigated the addition of a 7th axis with larger range to a 6-DOF haptic device. This way, the workspace is increased while with a proper control scheme the dynamic properties of the initial device are saved. To ensure good control on this redundant system we use the notion of generalised dynamically consistent inverse of the Jacobian within a positionposition control approach.
Building a time machine for efficient recording and retrieval of high-volume network traffic
Authors: Stefan Kornexl, Vern Paxson, Holger Dreger, Anja Feldmann, Robin Sommer
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

There are times when it would be extraordinarily convenient to record the entire contents of a high-volume network traffic stream, in order to later "travel back in time" and inspect activity that has only become interesting in retrospect. Two examples are security forensics--determining just how an attacker compromised a given machine--and network trouble-shooting, such as inspecting the precursors to a fault after the fault. We describe the design and implementation of a Time Machine to efficiently support such recording and retrieval. The efficiency of our approach comes from leveraging the heavy-tailed nature of network traffic: because the bulk of the traffic in high-volume streams comes from just a few connections, by constructing a filter that records only the first N bytes of each connection we can greatly winnow down the recorded volume while still retaining both small connections in full, and the beginnings of large connections (which often suffices). The system is designed for operation in Gbps environments, running on commodity hardware. It can hold a few minutes of a high volume stream in RAM, and many hours to days on disk; the user can flexibly configure its operation to suit the site's nature. We present simulation and operational results from three distinct Gbps production environments exploring the feasibility and efficiency of a Time Machine implementation. The system has already proved useful in enabling analysis of a break-in at one of the sites.
Interface synthesis in heterogeneous system-level DSP design tools
Authors: J. L. Pino
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

We describe a framework that constructs interfaces between simulation tools and real-time prototyping hardware in a high-level DSP synthesis environment. A goal of this work is to abstract the concept of the interface so that customized links are not required between each simulation and hardware engine. To support a new engine, the DSP system designer must define two pairs of communication primitives between the new tool and host workstation. The interface construction mechanism provides incremental compilation of subsystems in a system specification into the high-level DSP synthesis environment. We illustrate this framework with practical examples that have been constructed in Ptolemy.
An RF-Based System for Tracking Transceiver-Free Objects
Authors: Dian Zhang, Jian Ma, Quanbin Chen, Lionel M. Ni
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications (2007)

In traditional radio-based localization methods, the target object has to carry a transmitter (e.g., active RFID), a receiver (e.g., 802.11x detector), or a transceiver (e.g., sensor node). However, in some applications, such as safe guard systems, it is not possible to meet this precondition. In this paper, we propose a model of signal dynamics to allow tracking of transceiver- free objects. Based on Radio Signal Strength Indicator (RSSI), which is readily available in wireless communication, three tracking algorithms are proposed to eliminate noise behaviors and improve accuracy. The midpoint and intersection algorithms can be applied to track a single object without calibration, while the best-cover algorithm has potential to track multiple objects but requires calibration. Our experimental test-bed is a grid sensor array based on MICA2 sensor nodes. The experimental results show that the best side length between sensor nodes in the grid is 2 meters and the best-cover algorithm can reach localization accuracy to 0.99m.
Dynamic detection and prevention of race conditions in file accesses
Authors: Eugene Tsyrklevich, Bennet Yee
Venue: Proceedings of the 12th conference on USENIX Security Symposium - Volume 12 (2003)

Race conditions in filesystem accesses occur when sequences of filesystem operations are not carried out in an isolated manner. Incorrect assumptions of filesystem namespace access isolation allow attackers to elevate their privileges without authorization by changing the namespace bindings. To address this security issue, we propose a mechanism for keeping track of all filesystem operations and possible interferences that might arise. If a filesystem operation is found to be interfering with another operation, it is temporarily suspended allowing the first process to access a file object to proceed, thereby reducing the size of the time window when a race condition exists. The above mechanism is shown to be effective at stopping all realistic filesystem race condition attacks known to us with minimal performance overhead.
Indirect Coupling As a Criteria for Modularity
Authors: Hong Yul Yang, Ewan Tempero
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Assessment of a modularisation technique should involve some form of measurement as to how modular the code becomes as a result of applying the technique. One problem we face is that there is a lack of a precise definition of modularity. The IEEE glossary of software engineering terminology defines modularity as "the degree to which a system or computer program is composed of discrete components such that a change to one component has minimal impact on other components" [1]. While this is not an operational definition, especially as the notion of discreteness, or independence, needs to be further defined, it provides a good starting point for discussion. To measure according to this definition we need to measure "degree of independence". We are interested in a particular form of dependence, namely indirect dependence and believe this is an important criteria for assessing modularity.
Dimensionality Reduction for the Control of Powered Upper Limb Prostheses
Authors: Klaus Buchenrieder
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Myoelectric prosthesis control is difficult to achieve, because the optimal selection of features from a set, extracted from a myoelectric signal, is known as being a very challenging problem in prosthetic control. Dimensionality reduction means to retain MES information, that is important for class discrimination and to discard irrelevant data. Dimensionality reduction strategies can be categorized into feature selection and feature projection methods according to their objective functions. This work brings forward a statistical cluster analysis technique, which we call the "Guilin Hills Selection Method". The goal of our efforts is to control electrically powered upper limb prostheses with a minimum number of sensors and a low-power processor. The paper introduces the method and brings forward exemplar results for the selection of two time-domain features. With the proposed method, we can clearly distinguish four hand-positions from myoelectric signals of two sensors. The method also suggests feature combinations, that lead to less robust classifications but require fewer sensors.
Contributions to research on machine translation
Authors: Charles Elkan
Venue:  (2006)

In the past few decades machine translation research has made major progress. A researcher now has access to many systems, both commercial and research, of varying levels of performance. In this thesis, we describe different methods that leverage these pre-existing systems as tools for research in machine translation and related fields. We first examine techniques for improving a translation system using additional text. The first method uses a monolingual corpus. Discrepancies are identified by translating a word list to a foreign language and back again. Entries where the original word and its double translation differ are used to learn word-level correction rules. The second method uses parallel bilingual data consisting of source language/target language sentence pairs. The source sentences are translated using a translation system, and a partial alignment is identified between the machine-translated sentences and the corresponding human-translated sentences in the target language. This alignment is used to generate phrase-level correction rules. Experimentally, both word-level and phrase-level correction rules result in improved translation performance. The learned word-level correction rules make 24,235 corrections on 20,000 Spanish to English translated sentences, with high accuracy. The learned phrase-level rules improve the translation performance (as measured by BLEU) of a French to English commercial system by 30%, and of a state of the art phrase-based system in a statistically significantly way. To train current statistical machine translation systems, bilingual examples of parallel sentences are used. Generating this data is costly, and currently feasible only in limited domains and languages. A fundamental question is whether every potential example is equally useful. We describe a ranking method for examples that scores individual sentence pairs based on the performance of translation systems trained on random subsets of the examples. When used to train a translation system, the top ranking examples result in a significantly better performing system than random selection of examples. Given these ranked examples, a model of example usefulness can potentially be learned to select the most useful unlabeled examples. Initial experiments show two previously used example features are good candidates for identifying useful examples. In the last part of this thesis we describe how automatic paraphrasing methods can be used to improve the accuracy of evaluation measures for machine translation. Given a human-generated reference sentence and a machine-generated translated sentence, we present a method that finds a paraphrase of the reference sentence that is closer in wording to the machine output than the original reference is. We show that using paraphrased reference sentences for evaluating a translation system output results in better correlation with human judgement of translation adequacy than using the original reference sentences.
Integrating Probability with Time and Shared-Variable Concurrency
Authors: Huibiao Zhu, Shengchao Qin, Jifeng He, Jonathan P. Bowen
Venue: Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop (2006)

Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formalize languages comprising all these features. In this paper, we integrate probability, time and concurrency in one single model, where the concurrency feature is modelled using shared-variable based communication. The probability feature is represented by a probabilistic nondeterministic choice, probabilistic guarded choice and a probabilistic version of parallel composition. We formalize an operational semantics for such an integration. Based on this model we define a bisimulation relation, from which an observational equivalence between probabilistic programs is investigated and a collection of algebraic laws are explored. We also implement a prototype of the operational semantics to animate the execution of probabilistic programs.
Generating customized yet factually consistent information: a constraint satisfaction approach
Authors: Syed Sibte Raza Abidi, Yong Han Chong, Yan Zeng
Venue: International Journal on Digital Libraries (2006)

We present an information customization framework that leverages a hybrid of adaptive hypermedia and intelligent techniques, in particular constraint satisfaction methods, to generate customized and factually consistent information based on a user profile. Information customization is modeled as a constraint satisfaction problem, whereby a solution is derived by (a) satisfying user-model constraints to select a user-specific set of &#x2018;information snippets&#x2019;; and (b) establishing inter-snippet consistency to ensure that all snippets are compatible with each other. Our approach takes the unique step of establishing factually consistency &#x2013; via the satisfaction of inter-snippet constraints &#x2013; between heterogeneous information snippets. A customized information package is generated by systematically synthesizing the set of user-specific and factually consistent information snippets. The featured information customization framework incorporates variations of various search and constraint satisfaction methods. The work is applied in an E-Healthcare setting leading to the generation of customized healthcare information.
Engineering As An Art
Authors: H. H. Rosenbrock
Venue: AI Society (2007)

Scientific knowledge and mathematical analysis enter into engineering in an indispensable way, and their role will continually increase. But engineering contains elements of experience and judgment, of tacit knowledge, and regard for social considerations and the most effective way of using human labour. If we accept this element of &#x2018;art&#x2019; in engineering, we should design our systems, not to reject human skill, but rather to cooperate with it and make it more protective.
Derivative Particles for Simulating Detailed Movements of Fluids
Authors: Oh-young Song, Doyub Kim, Hyeong-Seok Ko
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

We present a new fluid simulation technique that significantly reduces the nonphysical dissipation of velocity. The proposed method is based on an apt use of particles and derivative information. We note that a major source of numerical dissipation in the conventional Navier-Stokes equations solver lies in the advection step. Hence, starting with the conventional grid-based simulator, when the details of fluid movements need to be simulated, we replace the advection part with a particle simulator. When swapping between the grid-based and particle-based simulators, the physical quantities such as the level set and velocity must be converted. For this purpose, we develop a novel dissipation-suppressing conversion procedure that utilizes the derivative information stored in the particles, as well as in the grid points. For the fluid regions where such details are not needed, the advection is simulated using an octree-based constrained interpolation profile (CIP) solver, which we develop in this work. Through several experiments, we show that the proposed technique can reproduce the detailed movements of high-Reynolds-number fluids such as droplets/bubbles, thin water sheets, and whirlpools. The increased accuracy in the advection, which forms the basis of the proposed technique, can also be used to produce better results in larger scale fluid simulations.
Low-power bit-serial Viterbi decoder for next generation wide-band CDMA systems
Authors: H. Suzuki
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

This paper presents a low-power bit-serial Viterbi decoder chip with the coding rate r=1/3 and the constraint length K=9 (256 states). This chip has been implemented using 0.5 /spl mu/m three-layer metal CMOS technology and is targeted for high speed convolutional decoding for next generation wireless applications such as wide-band CDMA mobile systems and wireless ATM LANs. The chip is expected to operate at 20 Mbps under 3.3 V and at 2 Mbps under 1.8 V. The add-compare-select (ACS) units have been designed using bit-serial arithmetic, which has made it feasible to execute 256 ACS operations in parallel. For trace-back operations, we have developed a novel power-efficient trace-back scheme and an application-specific memory, which was designed considering that 256 bits should be written simultaneously for write operations but only one bit needs to be accessed for read operations. We have estimated that the chip dissipates only 10 mW at 2 Mbps operation under 1.8 V.
Managing eBusiness Continuity: Formulating an Appropriate Strategy to Manage System Scalability
Authors: Roman M. Wong, Cretson L. Dalmadge, Anne M. Fiedler
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Scalability has been identified in the information systems literature as one of the most prominent risk factors for discontinuity. In this study we performed experiments on a series of simulated network models to quantitatively evaluate the effectiveness of three infrastructural methods for improving system scalability. Furthermore, we studied the relative effectiveness of the various strategies for managing scalability of an eBusiness network system. The results of the simulations support the common beliefs that (a) system scalability has direct associations with performance quality, and (b) the three infrastructurally based methods are effective in improving the scalability of the networked systems. In addition the simulation results revealed that combinations of the three infrastructurally based methods did not always result in improved system scalability. This information will help managers to invest their effort and resources in an effective scalability strategy.
Modeling and Analysis of Active Benign Worms and Hybrid Benign Worms Containing the Spread of Worms
Authors: Hanxun Zhou, Yingyou Wen, Hong Zhao
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Worms are a serious and growing threat to network and traditional antivirus technologies do not currently scale to deal with the worm threat. Benign worms, especially active benign worms and hybrid benign worms, become a new active countermeasure. In this paper, we classify active benign worms and hybrid benign worms into three sub types respectively. Based on two-factor worm model, we model each sub type of active benign worms and hybrid benign worms under the circumstance of no time delay and time delay. Finally, we simulate the models and discuss the effect of each type containing the spread of worms based on the results. These models of benign worms lead to a better understanding and prediction of the scale and speed of benign worms countering against the propagation of worms.