ppxscal/embedding_network huggingface dataset:
An Overview of Computer Viruses in a Research Environment
Authors: Matt Bishop
Venue:  (1991)

The threat of attack by computer viruses is in reality a very small part of a much more general threat, specifically attacks aimed at subverting computer security. This paper examines computer viruses as malicious logic in a research and development environment, relates them to various models of security and integrity, and examines current research techniques aimed at controlling the threats viruses in particular, and malicious logic in gerneral, pose to computer systems. Finally, a brief examination of the vulnerabilities of research and development systems that malicious logic and computer viruses may exploit is undertaken.
Distributing the control of a temporal network among multiple agents
Authors: Luke Hunsberger
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Agents collaborating on a set of tasks subject to temporal constraints must coordinate their activities to ensure that all of the temporal constraints are ultimately satisfied. Simple Temporal Networks (STNs) can be used to concisely represent temporal constraints; however, most algorithms for manipulating such networks presume that a single agent controls the network. Although recent research considers the controllability of networks in which Nature independently controls some temporal intervals, it nonetheless presumes that a single agent controls the rest of the network.This paper makes the following contributions. First, it argues for STNs augmented to accommodate the real-time execution of tasks. Although borrowing from existing approaches, it differs by sharply distinguishing between constraints in the network and the distribution of control over that network. Second, it introduces a more general conception of distributing control of a temporal network, one that is able to accommodate not only networks partially controlled by Nature, but also networks controlled by multiple agents. Third, it construes an existing algorithm for partitioning temporal networks into independent subnetworks as an algorithm for distributing control of a temporal network among multiple agents, each agent having sole control over one subnetwork. It then presents a more general algorithm that allows one of the subnetworks to remain dependent on the rest, thereby enabling the overall network to be less constrained. Restrictions on the control of the dependent subnetwork, specified in terms of necessary and sufficient bounds, guarantee an effective distribution of control over the network.
The Midway Distributed Shared Memory System
Authors: Brian N. Bershad, Matthew J. Zekauskas, Wayne A. Sawdon
Venue:  (1993)

This paper describes the motivation, design and performance of Midway, a programming system for a distributed shared memory multicomputer (DSM) such as an ATM-based cluster, a CM-5, or a Paragon. Midway supports a new memory consistency model called entry consistency. Entry consistency guarantees that shared data becomes consistent at a processor when the processor acquires a synchronization object known to guard the data. Entry consistency is weaker than other models described in the literature, such as processor consistency and release consistency, but it makes possible higher performance implementations of the underlying consistency protocols. Midway programs are written in C, and the association between synchronization objects and data must be made with explicit annotations. As a result, pure entry consistent programs can require more annotations than programs written to other models. In addition to entry consistency, Midway also supports the stronger release consistent and processor consistent models at the granularity of individual data items. Consequently, the programmer can tradeoff potentially reduced performance for the additional programming complexity required to write an entry consistent parallel program.
A Constructive Alternative to Axiomatic Data Type Definitions
Authors: Robert Cartwright
Venue:  (1980)

Many computer scientists advocate using axiomatic methods (such as algebraic specification) to specify a program data domain the universe of abstract data objects and operations manipulated by a program. Unfortunately, correct axiomatizations are difficult to write and to understand. Furthermore, their non-constructive nature precludes automatic implementation by a language processor. In this paper, we present a more disciplined, purely constructive alternative to axiomatic data domain specification. Instead of axiomatizing the program data domain, the programmer explicitly constructs it by using four type construction mechanisms: constructor generation, union generation, subset generation, and quotient generation. These mechanisms are rich enough to define all of the abstract data objects that programmers commonly use: integers, sequences, trees, sets, arrays, functions, etc. In contrast to axiomatic definitions, constructive definitions are easy to write and to understand. An unexpected advantage of the constructive approach is a limited capacity to support non-deterministic operations. As an illustration, we define a non-deterministic "choose" operation on sets.
Structural health monitoring of offshore structures
Authors: S. A. Mourad, A. W. Sadek, A. F. Batisha
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

Neural networks are a computational model composed of a highly interconnected mesh of nonlinear elements and whose structure is inspired by the biological nervous system. Two neural network architectures are proposed to assess the structural integrity of offshore fixed platforms. The first network depends on monitoring of the natural frequencies of the structure to determine its status. The second accounts for the structural response - represented by the deck drift due to environmental loading - to judge the performance of the structure. The networks were trained using samples generated by a finite element package. The two neural networks are used for decisions regarding inspection and repair of offshore structures. Application may be extended into an integral system for automatic damage detection and for classification and identification of multiple defects.
Risk Aversion: A Qualitative Approach and Quantitative Estimates
Authors: A. A. Novoselov
Venue: Automation and Remote Control (2003)

The qualitative concept of the risk aversion is defined in terms of a preference relation on a set of probability distributions. Risk aversion is quantitatively expressed in terms of representing functionals (risk measure). The relationship between risk aversion and stochastic dominance is investigated. Formulas for computing risk aversion in a perturbed probability model are derived and numerical examples are given.
Concurrent Event Recognition
Authors: Patrick Hill
Venue:  (1993)

Event recognition in concurrent systems in more difficult due to the indeterminacy of program events. Program events are specified using data path expressions. An efficient method of concurrent event recognition is presented that uses Augmented Transition Networks to represent the language of data path expressions. The implementation of this method is discussed and examples are shown.
Table extraction using conditional random fields
Authors: David Pinto, Andrew McCallum, Xing Wei, W. Bruce Croft
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

The ability to find tables and extract information from them is a necessary component of data mining, question answering, and other information retrieval tasks. Documents often contain tables in order to communicate densely packed, multi-dimensional information. Tables do this by employing layout patterns to efficiently indicate fields and records in two-dimensional form.Their rich combination of formatting and content present difficulties for traditional language modeling techniques, however. This paper presents the use of conditional random fields (CRFs) for table extraction, and compares them with hidden Markov models (HMMs). Unlike HMMs, CRFs support the use of many rich and overlapping layout and language features, and as a result, they perform significantly better. We show experimental results on plain-text government statistical reports in which tables are located with 92% F1, and their constituent lines are classified into 12 table-related categories with 94% accuracy. We also discuss future work on undirected graphical models for segmenting columns, finding cells, and classifying them as data cells or label cells.
Medical Word Recognition Using a Computational Semantic Lexicon
Authors: Robert Milewski, Venu Govindaraju
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

Artificial Intelligence(AI) plays the following two crucial roles in medical form analysis: recognition, as an input, of the New York State (NYS) Prehospital Care Report(PCR), and data inferences as an output. The PCR provides medical, legal, and quality assurance (QA) data (approximately 2-3 years behind in storage and analysis) that needs to be efficiently centralized to aid health care. Automating NYS PCR analysis will facilitate a more efficient and useful description of a patient being admitted to a hospital emergency room (ER). ER environments can be highly stressful on the human body given the time constraints of bioterrorism, trauma and/or disease. The recognition task will allow these ER health care professionals to evaluate all data and emergency techniques performed by paramedics and emergency medical technicians (EMT's). A computer screen, presenting diagrams,descriptions and inferences of a human body, representing the patient, will be updated with the corresponding handwritten PCR information. This information can then be transported to a central data bank where other hospitals can determine if there are possible outbreaks due to bio-terrorism, disease, hazardous materials incident or other non-obvious mass casualty incidents (MCI). Currently, it may take several days or even weeks, when it is clearly too late, to discover a massive atrocity. The recognition process will involve a method for reducingthe size of the lexicon by integrating semantic knowledge with pattern recognition data.
Transmission function models of finite population genetic algorithms
Authors: Cees H.M. Kemenade, Joost N. Kok, J. A. L Poutre, D. Thierens
Venue:  (1998)

Infinite population models show a deterministic behaviour. Genetic algorithms with finite populations behave non-deterministicly. For small population sizes, the results obtained with these models differ strongly from the results predicted by the infinite population model. When the population size is increased towards infinity, a convergence to the results predicted by the infinite population models is observed. In real GA''s random decisions are used during the run of the GA. These random decisions can lead to a behaviour that results in a deviation of the GA from the expected path of evolution. In this report four sources of non-determinism are identified. Finite population models are generated by explicitly modelling two of these sources. When comparing the results to runs of actual genetic algorithms, similar results are obtained. Hence, this model shows what are the most important sources of non-determinism in the GA for the problem at hand.
Gigantic Pairs of Minimal Clones
Authors: Ivo G. Rosenberg, Hajime Machida
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

In 1992, L. Szabo asked for the minimal number n = n(|A|) such that the clone of all operations on A can be generated as the join of n minimal clones. He showed, e.g., n(p) = 2 for any prime p, and later G. Czedli proved in 1998 that if k has a divisor \geq 5 then n(k) = 2. \\In this paper, a pair (f,g) of operations is called gigantic if each of f and g generates a minimal clone and the set \{f,g\} generates the clone of all operations. First, we give a general theorem to characterize a gigantic pair. Then we show that n(k) = 2 for every k which is not a power of 2. \\
A Data Structure for Arc Insertion and Regular Path Finding
Authors: Adam L. Buchsbaum, Paris C. Kanellakis, Jeffrey S Vitter
Venue:  (1989)

If $G$ is a directed graph with labeled edges and $L$ is a fixed regular language, the {\em regular path problem}, given two nodes, $u$ and $v$, in $G$, is to find a path between $u$ and $v$ such that the labels on the arcs along that path form a string which is a member of $L$. We consider a dynamic version of this problem, adding arcs to and performing regular path queries on $G$ over $L$, and present a data structure that solves both problems in average time per operation linear in the number of nodes of the graph for any fixed regular language.
Power Comparison of Throughput Optimized IC Busses
Authors: E. Malley, A. Salinas, K. Ismail, L. Pileggi
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

Globally asynchronous bus designs are consideredtheoretically attractive for saving power. In this work wedesign and compare asynchronous and synchronousbusses in 0.13um and 0.10um technologies based onbus-wires that are optimized for throughput per unitchannel area. At high frequency the synchronous datab s wire power exceeds that for the asynchronous designdue to the higher latch-repeater power In contrast,theasynchronous bus control power is greater than the localsynchronous clock power until a sufficient number of buslines share the control line.Based on a reasonableswitching activity factor for the lines (e.g.~15%),however, a shared control line can be considered asswitching continuously for 32 bits or more,while the busis being utilized. The power benefits of asynchronous,therefore,are questionable for applications such asglobally asynchronous locally synchronous (GALS)methodologies. Moreover,the distinction betweenasynchronous and synchronous is marginal if we furtherconsider a synchronous control line with a localpulse-generation circuit to drive half-latch repeaters inthe data bus path.
Non-Intrusive Gaze Tracking Using Artificial Neural Networks
Authors: Shumeet Baluja, Dean Pomerleau
Venue:  (1994)

We have developed an artificial neural network based gaze tracking system which can be customized to individual users. A three layer feed forward network, trained with standard error back propagation, is used to determine the position of a user''s gaze from the appearance of the user''s eye. Unlike other gaze trackers, which normally require the user to wear cumbersome headgear, or to use a chin rest to ensure head immobility, our system is entirely non-intrusive. Currently, the best intrusive gaze tracking systems are accurate to approximately 0.75 degrees. In our experiments, we have been able to achieve an accuracy of 1.5 degrees, while allowing head mobility. In its current implementation, our system works at 15 hz. In this paper we present an empirical analysis of the performance of a large number of artificial neural network architectures for this task. Suggestions for further explorations for neurally based gaze trackers are presented, and are related to other similar artificial neural network applications such as autonomous road following.
Data Network Design, 3 edition
Authors: Darren L. Spohn, Tina Brown, Scott Grau
Venue:  (2002)

:Design a successful data network with help from this definitive guide. Covering all the key processes and technologies  including packet switching, wave division multiplexing, ATM, frame relay, and more, this book walks you through the entire network design process.
Research report: Interacting with huge hierarchies: beyond cone trees
Authors: J. Carriere, R. Kazman
Venue: Proceedings of the 1995 IEEE Symposium on Information Visualization (1995)

The paper describes an implementation of a tool for visualizing and interacting with huge information hierarchies, and some preliminary empirical evaluation of the tool's efficacy. Existing systems for visualizing huge hierarchies using cone trees "break down" once the hierarchy to be displayed exceeds roughly 1000 nodes, due to increasing visual clutter. The paper describes a system called fsviz which visualizes arbitrarily large hierarchies while retaining user control. This is accomplished by augmenting cone trees with several graphical and interaction techniques: usage-based filtering, animated zooming, hand-coupled rotation, fish-eye zooming, coalescing of distant nodes, texturing, effective use of colour for depth cueing, and the applications of dynamic queries. The fsviz system also improves upon earlier cone tree visualization systems through a more elaborate node layout algorithm. This algorithm enhances the usefulness of cone tree visualization for large hierarchies by all but eliminating clutter.
The Representation and Transformation of Functions
Authors: Peter Wegner
Venue:  (1968)

A new approach to the study of programming languages is developed, which emphasized the sequence of information structures generated by a program during its execution. In section 1 a class of models called information structure models is developed for characterizing computations as sequences of transformations of information structures. The notion of binding time is introduced and different binding strategies for programming languages are considered. Section 2 considers the representation of functions by symbol tables and analyzes a number of examples of such functions, such as assemblers and macro systems. Section 3 introduces a very simple programming language for funcitn evaluation known as the lambda calculus, and considers information structure models for alternative evaluation strategies in the lambda calculus. Section 4 shows that ALGOL computations can be specified as information structure models with the same basic characteristics as lambda calculus computations but with a richer set of primitives, and indicates how languages such as PL/I can be characterized as information structure models. 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
CCNA: Cisco Certified Network Associate Study Guide,Deluxe Edition, 2 edition
Authors: Todd Lammle
Venue:  (2002)

:The CCNA: Cisco Certified Network Associate Study Guide has always been the most affordable, effective way to prepare for the CCNA exam. But now you also have to be ready for Cisco's new simulation question format found in the new version of the exam, 640-607. This Deluxe Edition provides you with the information and skills you need, offering updated content and two CDs packed with invaluable software tools. Written by a Cisco Internetworking expert who knows exactly what it takes to pass the test, this study guide provides: Preliminary assessment testing that helps direct your preparation Focused coverage of critical CCNA issues Written and hands-on labs that reinforce your knowledge More than 700 challenging review questions, with answers and explanations Authoritative coverage of all exam objectives, including: Understanding the OSI reference model Using Cisco IOS commands Adding RIP and IGRP routing protocols Working with TCP/IP Configuring Frame Relay, LMIs, maps, and subinterfaces Understanding WAN configurations and services Configuring and verifying IP addresses Working with ISDN protocols, function groups, reference points, and channels Controlling router passwords Creating and managing standard and extended access lists Logging into a router Backing up and loading a Cisco IOS software image Featured on the CD The enclosed CD is packed with vital preparation tools and materials, beginning with the Sybex EdgeTest testing engine for the new CCNA exam, 640-607. To help you prepare for Cisco's simulation questions, we've included the best-selling CCNA Virtual Lab, which simulates a network consisting of three routers and a switch. You'll also find an advanced testing engine loaded with hundreds of practice questions, including simulation questions, and 10 bonus exams--it lets you test yourself chapter by chapter or according to objective areas. Finally, we've added over 300 electronic flashcards for your PC, Pocket PC and Palm handhelds, as well as an electronic version of the entire book. About the Author Todd Lammle is a world-renowned Cisco authority with over twenty years experience working with LANs and WANs. He is president of GlobalNet Training Inc., a networking training firm based in Dallas, and of RouterSim LLC, a Colorado software company.
Generation of Software Renovation Factories from Compilers
Authors: Alex Sellink, Chris Verhoef
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

When a compiler is designed carefully, it is possible to extract its grammar. We reengineer the extracted grammar to one that is geared towards reengineering. From this reengineering grammar we generate an architecture called a software renovation factory. This includes: generic analysis and transformation functionality and a native pattern language using the concrete syntax of the language for which the renovation is necessary. Moreover, we generate the grammar in HTML format so that reengineers can quickly understand the language. We applied our approach successfully to an exceptionally complex and large proprietary language. Our approach enables rapid development of software renovation factories. We believe that our approach can partly solve the lack of Year 2000 tool support for many languages.
Permutations and the APL Grade Down Function
Authors: L. Cammack, G. Schrag
Venue:  (1980)

The APL gradeup (gradedown) function (denoted by $\uparrow \{respectively \downarrow \}$) aapplied to a vector $v \in R^{n}$ `grades'' the elements of $v$ in ascending (descending) order. (Among equal elements of $v$ the ranking is determined by their position). For example, if $v=(2.3,4.7,6.8,0.6,3.7,4.7)$ then $\uparrow v$ is (4,1,5,2,6,3) and $\downarrow v$ is (3,2,6,5,1,4). An immediate consequence of the versatility of this functional form is that the expression $v[\uparrow v] (v[\downarrow v])$ `sorts'' the elements of $v$ in ascending (descending) order. The question of characterizing all vectors $v \in R^{n}$ such that $\uparrow v=v$ was answered in a paper by Cooper, Best and Kennedy [see Cooper, et al.(1)]. The results there are essentially determined by scrutinizing the selection property of $\uparrow v$; that is, if $v=(x_{1}, x_{2},\ldots, x_{n})$ then $\uparrow v$ can be visualized as the unique permutation $P \in S_{n}$ such that $x_{P(1)},x_{P(2),\ldots,x_{P(n)$ is a list of the elements f $v$ in ascending order. Two straightforward consequences of this interpretation are: 1) if $P \in S_{n}$, then $\uparrow P$ is the inverse of $P$ and 2) the `fixed'' points of the mapping $\uparrow$ are precisely the involutions of $S_{n}$. IN this note we continue this investigation for the gradedown function and also resolve the open questions posed in that paper.
CRM: Redefining Customer Relationship Management
Authors: Jeffrey Peel, Mike Gancarz
Venue:  (2002)

:In CRM, Jeffrey Peel defines Customer Relationship Management in a radical new way by putting communications at the center. In the past, CRM was mostly about the technology, not about the customer. In this book, Peel talks about a new ethos that is beginning to fundamentally change the way organizations do business. At a technology level, CRM is increasingly about conjoined best-of-breed applications delivered via portal technologies. At a business level, it is beginning to invade traditional territories occupied by brand management or customer support. Peel shows companies how to make the shift to the new paradigm.