ppxscal/embedding_network huggingface dataset:
Evaluation of Worm Containment Algorithms and Their Effect on Legitimate Traffic
Authors: Mohamed Abdelhafez, George F. Riley
Venue: Proceedings of the Third IEEE International Workshop on Information Assurance (2005)

Internet worm attacks have become increasingly more frequent and have had a major impact on the economy, making the detection and prevention of these attacks a top security concern. Several counter-measures have been proposed and evaluated in recent literature. However, the effect of these proposed defensive mechanisms on legitimate competing traffic has not been analyzed. Clearly, a defensive approach that slows down or stops worm propagation at the expense of completely restricting any legitimatetraffic is of little value. Here we perform a comparative analysis of the effectiveness of several of these proposed mechanisms, including a measure of their effect on normal web browsing activities. In addition, we introduce a new defensive approach that can easily be implemented on existing hosts, and which significantly reduces the rate of spread of worms using TCP connections to perform the infiltration. Our approach has no measurable effect on legitimate traffic.
Eddy Tracking of Unsteady Flow Field
Authors: Hongyu Li, Li Teng, Wenbin Chen, I-Fan Shen
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Eddy tracking is just finding all vectors with similar motion in its influence region and recording its moving route. Virtually a flow field is able to be replaced with a scalar dataset, if its feature information can be faithfully preserved by the scalar dataset. Therefore, eddy tracking problem can be solved by tracking moving objects in an image sequence after a certain transformation. Here we propose a new method to track several moving eddies simultaneously and three main technologies are introduced: green function method, motion probability distribution and quadratic program.
Intermediate Frames of Reference in Haptically Perceived Parallelity
Authors: Astrid M. L. Kappers
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Haptically perceived space was investigated in eight experimental conditions. The task of the subjects was to make an extensive field of bars parallel to another at a variety of fixed positions, either on a horizontal plane or on the midsagittal plane, and either with their right hand or with their left hand. Settings were correlated with the orientations of the hand when placed at the same locations in a natural way. The parallelity settings deviated systematically from veridical. The patterns of the deviations were the same for all subjects. These haptically perceived parallelity settings can be considered as decided in a subject-dependent frame of reference intermediate to allocentric and egocentric reference frames.
Asymptotically Stable Running for a Five-Link, Four-Actuator, Planar Bipedal Robot
Authors: C. Chevallereau, E. R. Westervelt, J. W. Grizzle
Venue: International Journal of Robotics Research (2005)

Provably asymptotically stable running gaits are developed for the five-link, four-actuator bipedal robot, RABBIT. A controller is designed so that the Poincar&#233; return map associated with periodic running gaits can be computed on the basis of a model with impulse effects that, previously, had been used only for the design of walking gaits. This feedback design leads to the notion of a hybrid zero dynamics for running, which in turn allows the existence and stability of running gaits to be determined on the basis of a scalar map. The main results are illustrated via simulations performed on models with known parameters and on models with parameter uncertainty and structural changes. Animations of the resulting running motions are available on the web.
A Hierarchical Dynamic Monitoring Mechanism for Mobile Agent Location
Authors: Ying-Hong Wang, Huan-Chao Keh, Tsang-Ching Hu, Cheng-Horng Liao
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Mobile agent location monitoring is a necessary mechanism for mobile agent system. Most of mobile agent systems themselves do not certainly provide the mobile agent location monitoring mechanism, e.g. Mole, [1] D ' Agents [2], Concordia [3] and Grasshdoper [4]. Even though IBM Aglets [5] system provides the location monitoring mechanism, it is adopted the centralized monitoring mechanism. The centralized monitoring machine is not suitable for the huge mobile agents because the location information processing does exist bottleneck issue, as well as the system lacks the scalability. In this paper, the method proposed to use distributive mechanism for delivering MMA (Mobile Monitor Agent) to the network node (Agent Server) of mobile agent system. The MMA can be treated as a regional monitoring platform. It is responsible to collect the mobile agentýs information instantly in its monitoring area. Furthermore, the users can also inquire their own mobile agentýs current location and working status. The above mentioned mechanism is to distribute MMA dynamically to solve the hierarchical monitoring mechanism scalability issue, and still keeps the advantages of hierarchical monitoring mechanism to decrease information processing bottleneck issue which the centralized monitoring mechanism encounters.
Fourth-Order Time-Stepping for Stiff PDEs
Authors: Aly-Khan Kassam, Lloyd N. Trefethen
Venue: SIAM Journal on Scientific Computing (2005)

A modification of the exponential time-differencing fourth-order Runge--Kutta method for solving stiff nonlinear PDEs is presented that solves the problem of numerical instability in the scheme as proposed by Cox and Matthews and generalizes the method to nondiagonal operators. A comparison is made of the performance of this modified exponential time-differencing (ETD) scheme against the competing methods of implicit-explicit differencing, integrating factors, time-splitting, and Fornberg and Driscoll's "sliders" for the KdV, Kuramoto--Sivashinsky, Burgers, and Allen--Cahn equations in one space dimension. Implementation of the method is illustrated by short MATLAB programs for two of the equations. It is found that for these applications with fixed time steps, the modified ETD scheme is the best.
Computational aspects of discourse in the context of MUC-3
Authors: Lucja Iwańska, Douglas Appelt, Damaris Ayuso, Kathy Dahlgren, Bonnie Glover Stalls, Ralph Grishman, George Krupka, Christine Montgomery, Ellen Riloff
Venue: Proceedings of the 3rd conference on Message understanding (1991)

Discourse comprises those phenomena that usually do not arise when processing a single sentence. It appears to be the most difficult and probably the least understood aspect of automated message understanding. Five out of fifteen sites on a MUC-3 survey listed discourse as their main weakness and an area in which to concentrate future research. Virtually all systems presented here take a sentence-by-sentence approach to text understanding. Parsing and domain-dependent interpretation of sentences or sentence fragments (usually the latter) are followed by modules that attempt to connect these interpretations into a coherent whole. This paper gives an overview of the modules that make the transition from the interpretation of sentences to the interpretation of the text that contains these sentences. Systems presented in this paper exhibit various degrees of the following discourse understanding capabilities:&bull; identifying portions of text that describe different domain events; this includes the capability of recognizing a single event and the capability of distinguishing multiple events;&bull; resolving references:- pronoun references, e.g., finding the referent of It in the sentence It took place this morning,- proper name references, e.g., understanding that Luis Galan may be referred to as Senator Galan;- definite references, e.g., deciding what is the referent for The attack in the sentence The attack look us by surprise.&bull; discourse representation : representation at the message level.
Simplified Modeling of a Multipole Amplifier Using All-Pass Network Functions
Authors: Yihong Dai, Donald T. Comer, David J. Comer, Darren Korth
Venue: Analog Integrated Circuits and Signal Processing (2005)

This paper presents a system model for the representation of amplifiers that cannot be accurately characterized by a classical two pole transfer function. The effects of higher order poles are modeled by an all-pass function added to the conventional two pole model. The accuracy of the model is demonstrated by comparing the results for a typical CMOS amplifier to those obtained from device level simulations using SPICE. This model can be easily implemented in a standard simulator and is shown to achieve fast simulation time. This model is expected to have application in system level modelling of mixed-signal circuits using conventional SPICE simulators.
BEE2: A High-End Reconfigurable Computing System
Authors: Chen Chang, John Wawrzynek, Robert W. Brodersen
Venue: IEEE Design Test (2005)

The BEE2 project is developing a reusable, modular, and scalable framework for designing high-end reconfigurable computers, including a processing-module building block and several programming models. Using these elements, BEE2 can provide over 10 times more computing throughput than a DSP-based system with similar power consumption and cost, and over 100 times that of a microprocessor-based system.
Towards a simpler method of operational semantics for language definition
Authors: M. D. Derk
Venue: ACM SIGPLAN Notices (2005)

One of the needs of the computer science community is a simple, clear and generally accepted method of defining programming language semantics. Towards this end, the author presents a new approach to operational semantics based on binding, which is dubbed relational semantics. By grouping bound elements in tuples, the primary language functions are defined in a clear and concise manner. Relational semantics may be used together with BNF for a more complete yet simple language definition tool.
Towards providing distance learning students with a comparable learning experience
Authors: Karl O. Jones, R. Bartlett
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The Internet has become an additional strand in the teaching strategy of many courses, as students become increasingly able to make use of computers from their home. This has led to an increase in the range and number of Distance Learning courses: either entirely online or utilising an online element as teaching support. This paper highlights some issues and areas that should be addressed to ensure that Distance Learning Students have a learning experience comparable with 'traditional' students
Research on a system performance with parallel modes of execution in a multiprocessor computer system with Hyper-Threading Technology
Authors: Ognjan Nakov, Stefan Stojchev
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

This paper represents a research into the new Hyper-Threading Technology (TH) being introduced with the Intel Xeon family processors. Many applications expect maximum efficient exploitation of the hardware capability in the computer configuration. That depends on the ability of the operating system to manage concurrent executions of multiple instruction streams. The object of this paper is to provide results, analyses and conclusions from a research into the mechanism for managing threads of execution and common system performance.
In-Memory Storage and Search System for Event Management in Network Security
Authors: Yuan Fan, Xiao Su
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

The performance of network security applications greatly depends on the amount of network-related events that can be kept in memory. Storing a larger number of events in memory can facilitate tasks like correlation analysis in intrusion detection, locating traces of intrusions, and real-time packet analysis. In this paper, we present a patent provisioned storage and search system that can be used for efficient and flexible insertion, search, and management of network security events in memory. It was motivated by the ternary tree data structure and has been adapted to meet the needs of security-related applications. We have performed simulations to show that it outperforms traditional hash methods in terms of memory storage and search efficiency.
Integrative Early Requirements Analysis for Agent-Based Systems
Authors: Longbing Cao, Chengqi Zhang, Dan Luo, Wanli Chen, Neda Zamani
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Early requirements analysis (ERA) is quite significant for building agent-based systems. Goal-oriented requirements analysis is promising for the agent-oriented early requirements analysis. In general, either visual modeling or formal specifications is used for the ERA. This way cannot capture requirements precisely and completely. In this paper, we present an integrative modeling framework for agent-oriented early requirements analysis; this framework implements goal-oriented requirement analysis. The integrative modeling combines visual modeling and formal modeling together. Extended i* framework is used for building visual models; formal specifications complement the visual modeling to define and refine requirements. Both visual and formal models are outlined through a practical agent-based system F-TRADE. The integrative modelling seems to model early requirements comprehensively and concretely, and benefit refinement and conflict management in building agent systems.
When Methodology Interferes With Substance
Authors: Harald Schoen, Thorsten Faas
Venue: Social Science Computer Review (2005)

For campaigners, and also attendant researchers, the advent of the Internet has challenged established ways of doing their respective campaign business. Practitioners, used to running local and media campaigns, can nowadays also resort to elements of web campaigning, while electoral researchers, used to running election studies based on personal or telephone interviews, can now employ online surveys to do their business. However, e-campaigning and online polling suffer from severe deficiencies. Based on online and offline surveys conducted in the run-up to the 2002 German election, we show two things. First, online surveys yield biased results; second, e-campaigning reaches only a tiny fraction of the electorate, which is due to not only the imperfect dispersion of the Internet but also a lack of interest in political web sites among voters. Taken together, the Internet is--at least for time being--confined to adding supplementary elements to the established procedures of campaigning and polling.
Integration of Motion Fields through Shape
Authors: Hui Ji, Cornelia Fermuller
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Structure from motion from single flow fields has been studied intensively, but the integration of information from multiple flow field has not received much attention. Here we address this problem by enforcing constraints on the shape (surface normals) of the scene in view, as opposed to constraints on the structure (depth). The advantage of integrating shape is two-fold. First, we do not need to estimate feature correspondences over multiple frames, but we only need to match patches. Second, the shape vectors in the different views are related only by rotation. This constraint on shape can be combined easily with motion estimation, thus formulating motion and structure estimation from multiple views as a practical constrained minimization problem using a rank=3 constraint. Based on this constraint, we develop a 3D motion technique, which locates through color and motion segmentation, planar patches in the scene, matches patches over multiple frames, and estimates the motion between multiple frames and the shape of the selected scene patches using the image gradients. Experiments evaluate the accuracy of the 3D motion estimation and demonstrate the motion and shape estimation of the technique by super-resolving an image sequence.
Cooperative Game Theory within Multi-Agent Systems for Systems Scheduling
Authors: Derek Messie, Jae C. Oh
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Research concerning organization and coordination within multi-agent systems continues to draw from a variety of architectures and methodologies. The work presented in this paper combines techniques from game theory and multi-agent systems to produce self-organizing, polymorphic, lightweight, embedded agents for systems scheduling within a large-scale real-time systems environment. Results show how this approach is used to experimentally produce optimum real-time scheduling through the emergent behavior of thousands of agents. These results are obtained using a SWARM simulation of systems scheduling within a High Energy Physics experiment consisting of 2500 digital signal processors.
Formal and computational linguistics: University of Michigan
Authors: Joyce Friedman
Venue: Issue 79 (January 1982) (1982)

The Computational Linguistics Project at the University of Michigan is concerned with formal linguistic models and with the representation of information in logic and in natural language. The project is headed by Joyce Friedman; important contributions have been made by graduate research assistants, notably by David S. Warren (now at SUNY Stony Brook) and Douglas B. Moran (Oregon State University).
CAD-based automated robot programming in adhesive spray systems for shoe outsoles and uppers
Authors: J. Y. Kim
Venue: Journal of Robotic Systems (2004)

Most shoe manufacturing processes are not yet automated; it puts restrictions on increasing productivity. Among them, adhesive application processes particularly are holding the most workers and working hours. In addition, the working environment is very poor due to the toxicity of adhesive agents. In the case of automating an adhesive application process by using a robot, robot teaching by playback is difficult to produce high productivity because the kinds of shoes to be taught mount up to several thousands. To cope with it, it is necessary to generate robot working paths automatically according to the kind, the size, or the right and the left of shoes, and also to teach the generated paths to a robot automatically. This paper presents a method to generate three-dimensional robot working paths off-line based on CAD data in an automatic adhesive spray system for shoe outsoles and uppers. First, this paper describes how to extract the three-dimensional data of an outsole outline from a two-dimensional CAD drawing file. Second, it describes how to extract the three-dimensional data of an upper profiling line from the three-dimensional scanning data that is opened in a three-dimensional CAD program. Third, it describes how to generate robot working paths based on the extracted data and the nozzle setting parameters for adhesive spray. Also, a series of experiments for adhesive spray is performed to verify the effectiveness of the presented methods. This study will do much for increasing productivity in shoe manufacturing as a core work of a robotic adhesive spray system. &copy; 2004 Wiley Periodicals, Inc.
Making an impression: force-controlled pen input for handheld devices
Authors: Sachi Mizobuchi, Shinya Terasaki, Turo Keski-Jaskari, Jari Nousiainen, Matti Ryynanen, Miika Silfverberg
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The properties of force-based input on a handheld device were examined. Twenty-one participants used force input to set 10 different target levels representing consecutive force ranges (0 to 4N) with visual feedback (digits or bar graphs) or no feedback. Both accuracy and speed were greater with analog feedback (bar graph). Statistical comparisons of adjacent targets/digits indicated that subjects differentiated roughly seven input levels within the set of ten force ranges actually used. Time taken to input the target force increased significantly with the size of the target force, suggesting that smaller force ranges should be considered in future implementations of force input. The results are discussed in terms of the design of appropriate feedback for force input.
Optimal scheduling using priced timed automata
Authors: Gerd Behrmann Kim G. Larsen Jacob I. Rasmussen
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

This contribution reports on the considerable effort made recently towards extending and applying well-established timed automata technology to optimal scheduling and planning problems. The effort of the authors in this direction has to a large extent been carried out as part of the European projects VHS [20] and AMETIST [16] and are available in the recently released UPPAAL CORA [12], a variant of the real-time verification tool UPPAAL [18, 5] specialized for cost-optimal reachability for the extended model of so-called priced timed automata.
Link-Time Path-Sensitive Memory Redundancy Elimination
Authors: Manel Fernandez, Roger Espasa
Venue: Proceedings of the 10th International Symposium on High Performance Computer Architecture (2004)

Optimizations performed at link-time or directly applied to final program executables have received increased attention in recent years. This paper discusses the discovery and elimination of redundant memory operations in the context of a link-time optimizer, an optimization that we call Memory Redundancy Elimination (MRE). Previous research showed that existing MRE techniques are mainly based on path-insensitive information, which causes many MRE opportunities to be lost. We present a new technique for eliminating redundant loads in a path-sensitive fashion, by using a novel alias analysis algorithm that is able to expose path-sensitive memory redundancies. The paper also extends our previous work by removing both redundant and dead stores. Our experiments show that around 75% of load and 10% of store references in a program can be considered redundant, because they are accessing memory locations that have been referenced less than 256 memory instructions away. By combining our previous optimizations for eliminating load redundancies with the new techniques developed in this paper, we show that around 18% of the loads and 8% of the stores can be detected and eliminated, which translates into a 10% reduction in execution time.
A chart parser for GPSG: U. of Edinburgh, U.K.
Authors: Henry Thompson
Venue: Issue 79 (January 1982) (1982)

Taking advantage of the recent swing in interest within theoretical linguistics away from transformational formalisms (back) to context-free formalisms, this project is concerned with putting computational tools to work for linguists.