ppxscal/embedding_network huggingface dataset:
Combining Static Analysis and Dynamic Learning to Build Accurate Intrusion Detection Models
Authors: Zhen Liu, Susan M. Bridges, Rayford B. Vaughn
Venue: Proceedings of the Third IEEE International Workshop on Information Assurance (2005)

Anomaly detection based on monitoring of sequences of system calls has been shown to be an effective method for detection of previously unseen, potentially damaging attacks on hosts. This paper presents a new model for profiling normal program behavior for use in detection of intrusions that change application execution flow. This model is compact and efficient to operate and can be acquired using a combination of static analysis and dynamic learning. Our model (hybrid push down automata, HPDA) incorporates call stack information in the automata model and effectively captures the control flow of a program. Several important properties of the model are based on a unique correspondence relation between addresses and instructions within the model. These properties allow the HPDA to be acquired by dynamic analysis of an audit of the call stack log. Our strategy is to use static analysis to acquire a base model and then to use dynamic learning as a supplement to capture those aspects of behavior that are difficult to capture with static analysis due to techniques commonly used in modern programming environments. The model created by this combinationmethod is shown to have a higher detection capability than models acquired by static analysis alone and a lower false positive rate than models acquired by dynamic learning alone.
Mobility Modeling of Outdoor Scenarios for MANETs
Authors: Illya Stepanov, Pedro Jose Marron, Kurt Rothermel
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

Mobility of users significantly impacts performance of a mobile ad-hoc network. Most existing simulation tools offer only a few random mobility models, which poorly reflect user movements in outdoor scenarios. For example, they do not consider restrictions of a spatial environment. In this paper, we describe a comprehensive and extensible approach to model mobility of users in outdoor scenarios. It reflects the main factors that influence user movement: spatial environments, user travel decisions, and user movement dynamics. We identify model parameters and show how to set them for concrete scenarios. We provide a simulation environment implementing our approach. For concrete scenarios, the environment supports automatic derivation of some parameters from user position traces.
Adaptive video transcoding and streaming over wireless channels
Authors: Zhijun Lei, Nicolas D. Georganas
Venue: Journal of Systems and Software (2005)

In this work, we investigate the problem of bit rate adaptation transcoding for transmitting pre-encoded VBR video over burst-error wireless channels, i.e., channels such that errors tend to occur in clusters during fading periods. In particular, we consider a scenario consisting of packet-based transmission with Automatic Repeat ReQuest (ARQ) error control and a feedback channel. With the acknowledgements received through the feedback channel and a statistical channel model, we have an estimate of the current channel state, and effective channel bandwidth. In this paper, we analyze the constraints of buffer and end-to-end delay, and derive the conditions that the transcoder buffers have to meet for preventing the end decoder buffer from underflowing and overflowing. Furthermore, we also investigate the source characteristics and scene changes of the pre-encoded video stream. Based on the channel constraints and source video characteristics, we propose an adaptive bit rate adaptation algorithm for transcoding and transmitting pre-encoded VBR video stream over wireless channel. Our experimental results demonstrate that. by reusing the source characteristics and scene change information, transcoding high quality video can produce better video picture quality than that produced by directly encoding the uncompressed video at the same low bit rate. Moreover, by controlling the frame bit budget according to the channel conditions and buffer occupancy, the initial startup delay of streaming pre-encoded video can be significantly reduced.
Stereo Correspondence by Dynamic Programming on a Tree
Authors: Olga Veksler
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Dynamic programming on a scanline is one of the oldest and still popular methods for stereo correspondence. While efficient, its performance is far from the state of the art because the vertical consistency between the scanlines is not enforced. We re-examine the use of dynamic programming for stereo correspondence by applying it to a tree structure, as opposed to the individual scanlines. The nodes of this tree are all the image pixels, but only the "most important" edges of the 4 connected neighbourhood system are included. Thus our algorithm is truly a global optimization method because disparity estimate at one pixel depends on the disparity estimates at all the other pixels, unlike the scanline based methods. We evaluate our algorithm on the benchmark Middlebury database. The algorithm is very fast, it takes only a fraction of a second for a typical image. The results are considerably better than that of the scanline based methods. While the results are not the state of the art, our algorithm offers a good trade off in terms of accuracy and computational efficiency.
Neurolinguistics and psycholinguistics as a basis for computer acquisition of natural language
Authors: D. M. W. Powers
Venue: Issue 84 (April 1983) (1983)

Research into Natural Language Understanding systems for computers has concentrated on implementing particular grammars and grammatical models of the language concerned. This paper presents a rationale for research into Natural Language Understanding systems based on Neurological and Psychological principles.Important features of the approach are that it seeks to place the onus of Learning the language on the computer, and that it seeks to make use of the vast wealth of relevant Psychollngulstic and Neurollnguistic theory.
Distributed Simulation and Simulation Practice
Authors: Stewart Robinson
Venue: Simulation (2005)

The possibilities of distributed simulation have been discussed for well over a decade, yet there is only limited evidence of its implementation, particularly within industry. The reasons for this are discussed by identifying the potential applications of distributed simulation and linking these to the ways in which simulation is practiced. The extent to which distributed simulation is a demand led or technology led innovation is discussed. A possible contradiction between distributed simulation and good modeling practice is also identified, that is, the ability to develop large/complex models against the recommendation to develop simple models. This leads to three conclusions: not everyone needs distributed simulation, distributed simulation is both demand and technology led, and the possibilities of distributed simulation are both beneficial and dangerous to modeling practice.
An Alert Fusion Framework for Situation Awareness of Coordinated Multistage Attacks
Authors: Sunu Mathew, Chintan Shah, Shambhu Upadhyaya
Venue: Proceedings of the Third IEEE International Workshop on Information Assurance (2005)

Recent incidents in the cyber world strongly suggest that coordinated multistage cyber attacks are quite feasible and that effective countermeasures need to be developed. Attack detection by correlation and fusion of intrusion alerts has been an active area of current research. However, most of these research efforts focus on ex post facto analysis of alert data to uncover related attacks. In this paper, we present an approach for dynamically calculating ýScenario Credibilitiesý based on the state of a live intrusion alert stream. We also develop a framework for Attack Scenario representation that facilitates real-time fusion of intrusion alerts and calculation of the scenario credibility values. Our approach provides a usable mechanism for detecting, predicting and reasoning about multistage goal-oriented attacks in real time. The details of the fusion framework and a description of multistage attack detection using this framework are presented in this paper.
From the Editor in Chief: Days of Miracle and Wonder
Authors: Robert Filman
Venue: IEEE Internet Computing (2004)

Like public health, telecommunications, and the automobile before them, sensor nets will be a vehicle of social transformation. What technologies will make developing a sensor net as easy as, for example, building an Internet application? What must we do to make installing a network of sensors as simple as creating a wireless home network?
A Replacement Policy to Save Energy for Data Cache
Authors: Saibhushan Musalappa, Shivakumar Sundaram, Yul Chu
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

For a current processor, it has been reported that more than 50% of power has been consumed by an on-chip cache memory. To reduce power consumption for the cache memory, it is required to develop an effective replacement policy and mapping function, which would decide the cache memory accesses. In this paper, we introduce an ELRU-SEQ replacement policy with skewed mapping function to save energies for data caches. In addition, we develop an integrated power model by using Spectre and Cacti simulator to produce the experimental results. Our experimental results show that ELRU-SEQ with skewed mapping function works well in reducing power consumption compared to other conventional data caches.
Adaptive Distributed Traffic Control Service for DDoS Attack Mitigation
Authors: Thomas Dubendorfer, Matthias Bossardt, Bernhard Plattner
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 17 - Volume 18 (2005)

Frequency and intensity of Internet attacks are rising with an alarming pace. Several technologies and concepts were proposed for fighting distributed denial of service (DDoS) attacks: traceback, pushback, i3, SOS and Mayday. This paper shows that in the case of DDoS reflector attacks they are either ineffective or even counterproductive. We then propose a novel concept and system that extends the control over network traffic by network users to the Internet using adaptive traffic processing devices. We safely delegate partial network management capabilities from network operators to network users. All network packets with a source or destination address owned by a network user can now also be controlled within the Internet instead of only at the network user's Internet uplink. By limiting the traffic control features and by restricting the realm of control to the "owner" of the traffic, we can rule out misuse of this system. Applications of our system are manifold: prevention of source address spoofing, DDoS attack mitigation, distributed firewall-like filtering, new ways of collecting traffic statistics, traceback, distributed network debugging, support for forensic analyses and many more.
Summary of research activity at ICASE
Authors: Robert G. Voigt
Venue: ACM SIGNUM Newsletter (1981)

The Institute for Computer-Applications in Science and Engineering (ICASE) is operated at the Langley Research Center of NASA by the Universities Space Research Association, a nonprofit consortium of major U.S. colleges and universities, under a contract with the Center. The Institute conducts unclassified basic research in applied mathematics, numerical analysis and computer science in order to extend and improve problem solving capabilities in science and engineering, particularly in aeronautics and space.
Reconfigurable magnetoelectronic circuits for threshold logic: Research Articles
Authors: Nicholas P. Carter, Steve P. Ferrera
Venue: International Journal of Circuit Theory and Applications (2004)

Magnetoelectronic devices, which combine ferromagnetic materials with conventional silicon structures, offer the potential to add non-volatile storage to electronic systems, eliminating their vulnerability to data loss due to power supply interruptions. We present a set of circuits, based on the Hybrid Hall Effect device, that combine logic with non-volatile storage. These circuits can be configured on a cycle-by-cycle basis to compute different functions of their inputs, store their outputs indefinitely even in the absence of system power, and can be easily integrated into CMOS systems to provide non-volatile operation without requiring additional supply voltages or other global signals. They exploit the properties of the Hybrid Hall Effect device to efficiently implement threshold logic functions and thereby reduce the number of gates required to implement most Boolean expressions.In this paper, we describe our reconfigurable magnetoelectronic circuits and the interfaces that make them compatible with CMOS systems. The results presented are based on data from fabricated experimental devices, and we discuss how they can be expected to improve as devices scale to nanometer dimensions. Finally, we consider how magnetoelectronic circuits might be integrated into system designs to deliver high performance while tolerating power supply interruptions. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Tasks, domains, and languages
Authors: Boyan Onyshkevych, Mary Ellen Okurowski, Lynn Carlson
Venue: Proceedings of the 5th conference on Message understanding (1993)

The Fifth Message Understanding Conference (MUC-5) involved the same tasks, domains and languages as the information extraction portion of the ARPA TIPSTER program. These tasks center on automatically filling object-oriented data structures, called templates, with information extracted from free text in news stories (for discussion of templates and objects, see "Template Design for Information Extraction" in this volume). For each task, a generic type of information that is specified for extraction corresponds to each of the slots in the templates. With text as input, the MUC-5 systems first detect whether the text contains relevant information. If available, the systems extract specific instances of the generic types from the text and output that information by filling the template slots with the appropriately formatted data representations. These slots are then scored by using an automatic scoring program with analyst-produced templates as the keys. Human analysts also prepared development set templates for each domain, which served as training models for system developers (for discussion of the data preparation effort, see "Corpora and Data Preparation" in this volume).
Adaptive Smoothed Aggregation ($\alpha$SA) Multigrid
Authors: M. Brezina, R. Falgout, S. MacLachlan, T. Manteuffel, S. McCormick, J. Ruge
Venue: SIAM Review (2005)

Substantial effort has been focused over the last two decades on developing multilevel iterative methods capable of solving the large linear systems encountered in engineering practice. These systems often arise from discretizing partial differential equations over unstructured meshes, and the particular parameters or geometry of the physical problem being discretized may be unavailable to the solver. Algebraic multigrid (AMG) and multilevel domain decomposition methods of algebraic type have been of particular interest in this context because of their promises of optimal performance without the need for explicit knowledge of the problem geometry. These methods construct a hierarchy of coarse problems based on the linear system itself and on certain assumptions about the smooth components of the error. For smoothed aggregation (SA) multigrid methods applied to discretizations of elliptic problems, these assumptions typically consist of knowledge of the near-kernel or near-nullspace of the weak form. This paper introduces an extension of the SA method in which good convergence properties are achieved in situations where explicit knowledge of the near-kernel components is unavailable. This extension is accomplished in an adaptive process that uses the method itself to determine near-kernel components and adjusts the coarsening processes accordingly.
BBN: description of the PLUM system as used for MUC-3
Authors: Ralph Weischedel, Damaris Ayuso, Sean Boisen, Robert Ingria, Jeff Palmucci
Venue: Proceedings of the 3rd conference on Message understanding (1991)

Traditional approaches to the problem of extracting data from texts have emphasized handcrafted linguistic knowledge. In contrast, BBN's PLUM system (Probabilistic Language Understanding Model) was developed as part of a DARPA-funded research effort on integrating probabilistic language models with more traditional linguistic techniques. Our research and development goals are&bull; more rapid development of new applications,&bull; the ability to train (and re-train) systems based on user markings of correct and incorrect output,&bull; more accurate selection among interpretations when more than one is found, and&bull; more robust partial interpretation when no complete interpretation can be found.
Mobile Agent Based TDMA Slot Assignment Algorithm for Wireless Sensor Networks
Authors: Ranjeet Kumar Patro, Balamurugan Mohan
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

In this paper we propose an on-line TDMA slot assignment/graph coloring algorithm forwireless sensor networks with the help of a mobile agent. It is known that graph coloring problem is NP-complete and several heuristics have been developed. Many of them are centralized algorithms and assume global knowledge of the network. We developed a mobile agent based slot assignment (MASA) algorithm in which a mobile agent moves from node to node and assigns a slot to nodes using two-hop neighborhood information. MASA is close to degree based lower bound (d + 1). It requires d + 1 number of colors or slightly more than d + 1 number of colors depending upon the topology, where d is the maximum nodal degree of the graph.
The development of ontology driven multi-agent systems: a case study in the financial services domain
Authors: Anjalee Sujanani, Pradeep Ray, N. Paramesh, Ramprasad Bhar
Venue: Proceedings of the IEEE EEE05 international workshop on Business services networks (2005)

This paper details the processes undertaken to create an application utilising ontologies, for financial domain end-users. It describes our approach and experiences in developing an ontology-based tool that facilitates user and agent interaction within the domain of financial services. To date, agent models have predominantly been developed to analyse financial markets. Most of the agents in these models have their knowledge specified through low level programming. We propose an alternative approach where domain knowledge is decoupled from agents through the use of ontologies. Agents sharing a financial ontology are able to communicate within the domain without possessing the same initial knowledge set. This approach contributes towards the building of semantically aware intelligence services, utilising ontologies rather than low level programming to dictate the characteristics of domains of utilisation and experimentation.
Securing Route Optimisation in NEMO
Authors: Maria Calderon, Carlos J. Bernardos, Marcelo Bagnulo, Ignacio Soto
Venue: Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (2005)

The Network Mobility (NEMO) Basic Support protocol enables mobile networks to change their point of attachment to the Internet, while preserving established sessions of the nodes within the mobile network. When only a non-nested mobile network is considered, the so-called triangle routing is the main problem that should be faced. In Mobile IPv6, the Route Optimisation mechanism solves this problem, and the Return Routability mechanism aims to limit the security concerns originated because of the Route Optimisation. Nowadays Return Routability is considered a weak solution (i.e., based on strong assumptions). In this article we explore different approaches to Route Optimisation in NEMO and we devise how to adapt some of the Terminal Mobility solutions to a NEMO environment, where, as we will propose, a delegation of signalling rights from the Mobile Network Node to the Mobile Router is necessary.
To the construction of spatial distribution of electron concentration over Kazakhstan, using the IRI model corrected by ionospheric data
Authors: Z. S. Zhantaev, J. K. Postoev, T. B. Stepanova, V. S. Khachikyan
Venue: Mathematics and Computers in Simulation (2004)

Using the IRI model, corrected by ionospheric data measured in Almaty, the N(h)-profiles in Karaganda and Novo-Kazalinsk are estimated. Comparison with available experimental data shows that the precision of profile reconstruction is about 10%.
Untestable fault identification through enhanced necessary value assignments
Authors: Vishnu C. Vimjam, Manan Syal, Michael S. Hsiao
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

In this paper, we propose novel low-cost methods that combine static logic implications and binary resolution to significantly increase the number of non-trivial signal relations learned from the circuit. The proposed method first applies resolution techniques to learn new static single-node implications and then uses them to learn powerful multi-node implications. All the newly learned relations help in extracting more necessary assignments for a given fault, potentially increasing the chance for a conflict to occur among the necessary assignments. Experimental results on ISCAS89 and ITC99 benchmarks show that our method can identify significantly more untestable faults compared to existing non branch-and-bound based techniques.
Laptop Music Performance Power!
Authors: Catherine Karayanis
Venue:  (2005)

Coverage includes- John von Seggern has worked in the international music industry for the past fifteen years as a bassist, computer DJ, producer, remixer, researcher, writer, and commentator. John has lived and worked in Tokyo, Hong Kong, and now Los Angeles, where he is currently employed by leading computer music technology company M-Audio (http://www.m-audio.com). John has been performing music live with computers since 1999 and has DJed techno electro jazz mixes on his laptop at numerous clubs and festivals in Asia and the US, often with some incarnation of his Hong Kong-based band Digital Cutup Lounge (http://www.digitalcutuplounge.com). Offers in-depth coverage of the basics of how to perform music live with laptop computers as well as some more advanced performance techniques. Written in a fun and entertaining yet highly-informative style, this book offers value to both beginning and experienced users of computer audio equipment. Provides a close up look at the industry through interviews with today's top performers. With consideration of the many different types of musicians, this book uses a number of different approaches to explain how to use computers effectively to perform live. Covers some important specific hardware and software, such as the selection of the right laptop computer, audio interface, and MIDI controller for playing live, as well as which software to use, and the musical possibilities of each.