ppxscal/embedding_network huggingface dataset:
A Temporal Approach to Requirements Specification of Real-Time Systems
Authors: Yogesh Naik
Venue:  (1991)

This paper describes a specification notation of temporal logic to describe the requirements of real-time systems. The notation is extended by a calculus of occurrences of predicates. Using the logic and the calculus we show that common real-time properties such as durations, number of occurrences, precedence and other properties can be described. It is then used to describe the IEEE 802 Token Bus specification. 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
A Comparison of Three Cursor Control Devices on a Cursor Control Benchmark Task
Authors: Joseph D. Chase, Sherry P. Casali
Venue:  (1991)

A number of past studies have compared performance of cursor control devices. Conclusions regarding the "best" device for a particular application are difficult to draw because the tasks used in previous comparisons have differed from one another and have not included all of the factors affecting performance with the devices. The present study used a target acquisition task whose components were derived from analyzing the cursor control device movements of users while performing actual tasks. The components of the task were target size, target distance, direction, and mode (i.e., point-and-click vs. drag). Three cursor control devices, cursor keys, mouse, and trackball, were each used by 12 subjects to perform the task. Results indicate the mouse and trackball perform similarly in most cases. The cursor keys always performed more poorly than the other devices. Hence, the mouse and trackball are preferable to the cursor keys based on objective measure of user performance. In conditions where cursor keys are necessary, careful attention should be paid to aspects of the interface listed above in order to attain the highest level of performance possible.
A visual environment for dynamic web application composition
Authors: Kimihito Ito, Yuzuru Tanaka
Venue: Proceedings of the fourteenth ACM conference on Hypertext and hypermedia (2003)

HTML-based interface technologies enable end-users to easily use various remote Web applications. However, it is difficult for end-users to compose new integrated tools of both existing Web applications and legacy local applications such as spreadsheets, chart tools and database. In this paper, the authors propose a new framework where end-users can wrap remote Web applications into visual components called pads, and functionally combine them together through drag & drop-paste operations. The authors use, as the basis, a meme media architecture IntelligentPad that was proposed by the second author. In the IntelligentPad architecture, each visual component called a pad has slots as data I/O ports. By pasting a pad onto another pad users can integrate their functionalities. The framework presented in this paper allows users to visually create a wrapper pad for any Web application by defining HTML nodes within the Web application to work as slots. Examples of such a node include input-forms and text strings on Web pages. Users can directly manipulate both wrapped Web applications and wrapped local legacy tools on their desktop screen to define application linkages among them. Since no programming expertise is required to wrap Web applications or to functionally combine them together, end-users can build new integrated tools of both wrapped Web applications and local legacy applications.
ON WEAK LEARNING
Authors: David P. Helmbold, Manfred K. Warmuth
Venue:  (1992)

An algorithm is a weak learning algorithm if with some small probability it outputs a hypothesis with error slightly below 50%. This paper presents relationships between weak learning, weak prediction (where the probability of being correct is slightly larger than 50%), and consistency oracles (which decide whether or not a given set of examples is consistent with a concept in the class). Our main result is a simple polynomial prediction algorithm which makes only a single query to a consistency oracle and whose predictions have a polynomial edge over random guessing. We compare this prediction algorithm with several of the standard prediction techniques, deriving an improved worst case bound on Gibbs Algorithm in the process. We use our algorithm to show that a concept class is polynomially learnable if and only if there is a polynomial probabilistic consistency oracle for the class. Since strong learning algorithms can be built from weak learning algorithms, our results also characterizes strong learnability.
Formalization and Analysis of the Separation Minima for the North Atlantic Region: Complete Specification and Analysis Results
Authors: Nancy A. Day, Jeffrey J. Joyce, Gerry Pelletier
Venue:  (1997)

This report describes work to formalize and validate a specification of the separation minima for aircraft in the North Atlantic (NAT) region completed by researchers at the University of British Columbia in collaboration with Hughes International Airspace Management Systems. Our formal representation of these separation minima is given in a mixture of a tabular style of specification and textual predicate logic. We analyzed the tables for completeness, consistency and symmetry. This report includes the full specification and complete analysis results.
Real-time network-based anomaly intrusion detection
Authors: Ravindra Balupari, Brett Tjaden, Shawn Ostermann, Marina Bykova, Aaron Mitchell
Venue: Real-time system security (2003)

The global internet has made computer systems world-wide vulnerable to an ever-changing array of attacks. A new approach to perform real-time network-based anomaly intrusion detection is presented in this paper. Real-time Tcptrace generates data streams which are analysed to detect network-based attacks. Real-time Tcptrace periodically reports statistics on all the open TCP/IP connections in the network. Then, using the Abnormality Factor method, statistical profiles are built for the normal behavior of the network services. Abnormal activity is then flagged as an intrusion. This approach has the advantage of being able to monitor any service without the prior knowledge of modelling its behavior. The paper presents interesting results and evaluation of the approach by conducting experiments using the MIT Lincoln lab evaluation data.
Load-Time Adaptation: Efficient and Non-Intrusive Language Extension for Virtual Machines
Authors: Andrew Duncan, Urs Holzle
Venue:  (1999)

The advantages of virtual machine (VM) execution (dynamically loaded, portable object files with high-level information) also permit changing the semantics of executables. Load-time adaptation (LTA) intercepts the VM''s file operations and modifies object code on the fly, without changing the VM implementation, without needing access to source code, and without changing the actual files. We introduce a new technique, library-based LTA, and show how it can extend languages in such ways as adding contracts or mixins to existing classes, providing default code for interfaces, and instantiating parameterized types. We discuss an implementation of library-based LTA and its application to extending Java semantics.
Analysing communication in the context of a software production organisation
Authors: M. Cecilia, C. Baranauskas, Juliana P. Salles, Kecheng Liu
Venue: Enterprise information systems IV (2003)

While quality has been widely stressed in literature as a goal of the software design methodologies, quality as a result of the interaction among the actors involved in the design and development processes has not received the same attention. This work aims to investigate the software production process by addressing the communication among work groups in the organisation. Our focus is on understanding the communication process that takes place among the groups, considering that the computational artefact emerges as a result of the communicational acts issued between people with different roles in the process. We base our understanding of communication in semiotic foundations, to propose a framework for analysing communication in the whole process of system design and development. The design process of a real organisation that produces commercial software illustrates our main ideas.
Modifying Shortest Path Routing Protocols to Create Symmetrical Routes
Authors: Rajib Ghosh, George Varghese
Venue:  (2001)

We describe a new mechanism to deal with asymmetries that arise in routing protocols. We show how to avoid route asymmetries (due to non-unique shortest paths) for any shortest path protocol by adding random integer link costs. We show in detail how RIP can be modified to avoid route asymmetry with high probability, without affecting either its efficiency or performance metrics such as convergence time.
ACL2 Workshop 2000 Proceedings, Part A
Authors: Matt Kaufmann, J S Moore
Venue:  (2000)

ACL2 stands for "A Computational Logic for Applicative Common Lisp." It is a programming language, a formal mathematical logic, and a mechanical theorem proving system. ACL2 is used primarily in the formal verification of computer hardware and software, but also finds use as a programming environment and in the checking of proofs from more traditional areas of mathematics. See the ACL2 home page (http://www.cs.utexas.edu/users/moore/acl2) for more details on the system. This technical reports contains the proceedings of the second ACL2 Workshop. See http://www.cs.utexas.edu/users/moore/acl2/workshop-2000 for more information. Supporting scripts for many of the papers may be found at this site.
Social, ethical and legal issues of data mining
Authors: Jack S. Cook, Laura L. Cook
Venue: Data mining: opportunities and challenges (2003)

This chapter highlights both the positive and negative aspects of Data Mining (DM). Specifically, the social ethical, and legal implications of DM are examined through recent case law, current public opinion, and small industry-specific examples. There are many issues concerning this topic. Therefore, the purpose of this chapter is to expose the reader to some of the more interesting ones and provide insight into how information systems (IS) professionals and businesses may protect themselves from the negative ramifications associated with improper use of data. The more experience with and exposure to social ethical and legal concerns with respect to DM, the better prepared you will be to prevent trouble down the road.
An Integrated Synchronization and Consistency Protocol for the Implementation of a High-Level Parallel Programming Language
Authors: Martin Rinard
Venue:  (1995)

This paper presents the integrated synchronization and consistency protocol used in the implementation of Jade, an implicitly parallel language for coarse-grain parallel computation. The consistency protocol tags each replica of shared data with a version number. The synchronization algorithm computes the correct version numbers of the replicas of shared data that the computation will access. Because the integrated protocol piggybacks the version number information on the synchronization messages, it eliminates the excess message traffic characteristic of standard update and invalidate protocols. This paper characterizes the performance impact of the consistency protocol by presenting experimental results for several Jade applications running on the iPSC/860 under several different Jade implementations. We believe that implementors of other parallel software systems will be able to improve the efficiency of their systems by using similar integrated protocols.
An Intensity-Based Cooperative Bidirectional Stereo Matching withSimultaneous Detection of Discontinuities and Occlusions
Authors: An Luo, Hans Burkhardt
Venue:  (1995)

This paper presents a new intensity-based stereo algorithm using cooperative bidirectional matching with a hierarchical multilevel structure. Based on the piecewise smooth model and the consistency constraint of depth fields, the algorithm can then estimate the 3-D structure and detect its discontinuities and occlusion reliably with low computational costs. In order to find the global optimal estimates, we utilize a simplified graduated non-convexity algorithm minimizing the nonconvex cost functions, which is equivalent to the MAP estimation. This computational framework computing 3-D structure from binocular stereo images has been extended to the trinocular stereo vision for the further improvement of performance. A few examples for the binocular and trinocular stereo problems are given to illustrate the performance of this new algorithm.
A Methodology for Integrating Maintainability Using Software Metrics
Authors: John A. Lewis, Sallie M. Henry
Venue:  (1989)

Maintainability must be integrated into software early in the development process. But for practical use, the techniques used must be as unobtrusive to the existing software development process as possible. This paper defines a methodology for integrating maintainability into large-scale software and describes an experiment which implemented the methodology into a major commercial software development environment.
THE JPEG AND IMAGE DATA COMPRESSION ALGORITHMS
Authors: Manyun Zhang
Venue:  (1990)

A set of still image compression algorithms JPEG (Joint Photographic Experts Group) is becoming an international standard. Here we investigate the algorithms and explore why these algorithms were chosen by JPEG among many other comparable algorithms. We also present our results, observations and analysis on simulating the JPEG sequential baseline system. Based on our simulator, a comparison of Huffman coder, arithmetic coder and LZW algorithm is also included. 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
SWIFT: A STORAGE ARCHITECTURE FOR VERY LARGE OBJECTS\
Authors: Luis Cabrera, Darrell Long
Venue:  (1989)

Managing large objects with high performance requirements is difficult for current computing systems. The increasing disparity between the fastest network transfer rate and the fastest disk transfer rate requires resolution. We describe an architecture, called Swift, that solves the problem of storing and retrieving very large data objects from slow secondary storage at very high data rates. Applications requiring very high data rates range from visualization of scientific computations to storage and retrieval of color video. Swift successfully addresses this issue by exploiting the available interconnection capacity and by using several slower storage devices concurrently. We study the performance characteristics of a local-area implementation of Swift using a parametric simulation model. Our analysis considers a system composed of several high-performance work stations connected to multiple storage agents via a high-speed local area network. Swift compares favorably with other concurrent I/O architectures, such as disk arrays, in terms of maximum aggregate data rate, reliability, and resource requirements.
Visualizing Adora Models
Authors: Stefan Berner, Stefan Joos, Martin Glinz, Martin Arnold
Venue:  (2000)

Most current object modeling methods and tools have weaknesses both in the concepts of hierarchical composition and in the visualization of these hierarchies. Some methods do not support hierarchical composition at all. Those methods which do, employ tools that provide explosive zoom as the only means for the visualization of hierarchies.
A New Notation for Derivations
Authors: J. L Baker
Venue:  (1977)

Ordered directed graphs (generalizing ordered trees) are defined and used in a new formal definition of grammatical derivation. The latter is shown equivalent to the currently accepted definition. The new scheme is illustrated by detailed proofs of two familiar results: the equivalence of the notions ``context-sensitive'''' and ``length-nondecreasing'''' as applied to grammars, and an important lemma in the theory of deterministic context-free parsing. 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
TGen: Programmer''s Reference Manual
Authors: D. A.B. Weikle, Wm Wulf
Venue:  (1997)

The TGen (Trace Generation) Processor is a VLIW (Very Long Instruction Word) machine designed to generate general memory references to an arbitrary memory sys tem. The first version, called STAG (Smc TrAce Generation) in the Electrical Engineering Department, is being implemented with an SMC (Stream Memory Controller) and a path for simulating memory accesses to a generic hierarchical caching system.
Semantics-based Time Warp Protocols
Authors: Hong V Leong, Divyakant Agrawal
Venue:  (1993)

The time warp mechanism is one of the useful paradigms to carry out a distributed discrete event simulation, where the synchronization of events can be determined a priori when the program is being executed. The forward computation performed optimistically has to be rolled back when an out-of-order synchronization message is received. This excessive amount of rollback seriously jeopardizes the performance of a time warp mechanism. Semantics of the synchronization messages being sent in a time warp execution can be exploited to reduce the amount of rollback. In particular, the commutativity and dependency properties of messages can be used to avoid certain types of rollback. For example, two commutative messages can be processed in any order and the resultant computation remains valid. In this paper, the semantics on the messages are defined and the protocols for handling such kinds of messages in the time warp mechanism and several optimizations are presented.
Recognition of Infra Red Images of Aircraft Rotated in Three Dimensions
Authors: Robert A. McLaughlin, Mike Alder
Venue:  (1995)

This paper explores the problem of recognising infra red images of four model aircraft that are rotated in three dimensional space. It compares two methods, the UpWrite method, which is a syntactic method, and Geometric Moments, which are a standard method in Pattern Recognition.
On the Security of Modular Exponentiation
Authors: V. Rosen
Venue:  (2000)

Assuming the inractability of factoring, we show that the output of the exponentiation modulo a composite function f>sub<N,g>/sub<(x) = gx mod N (where N = P?Q) is pseudorandom, even when its input is restricted to be half the size. This result is equivalent to the simultaneous hardness of the upper half of the bits of f>sub<N,g>/sub<, proven by H?stad, Schrift and Shamir. Yet, we supply a different proof that is significantly simpler than the original one. In addition, we suggest a pseudorandom generator which is more efficient than all previously known factoring based pseudorandom generators. Our work provides also an evidence for the difficulty of the Decisional Diffie-Hellman problem, when considered modulo a composite. 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
A PATTERN-WEIGHT FORMULATION OF SEARCH KNOWLEDGE
Authors: Robert Levinson, Gil Fuchs
Venue:  (1994)

Pattern-weight pairs (pws) are a new form of search and planning knowledge. Pws are predicates over states coupled with a least upper bound on the distance from any state satisfying that predicate to any goal state. The relationship of pws to more traditional forms of search knowledge is explored with emphasis on macros and subgoals. It is shown how pws may be used to overcome some of the difficulties associated with macro-tables and lead to shorter solution paths without replanning. An algorithm is given for converting a macro-table to a more powerful pw set. Superiority over the Squeeze algorithm is demonstrated. It is also shown how pws provide a mechanism for achieving dynamic subgoaling through the combination of knowledge from multiple alternative subgoal sequences. The flexibility and execution time reasoning provided by pws may have significant use in reactive domains. The main cost associated with pws is the cost of applying them at execution time. An associative retrieval algorithm is given that expedites this matching-evaluation process.
Recovering Shape \& Determining Attitude from Extended Gaussian Images
Authors: James J Little
Venue:  (1985)

This dissertation is concerned with surface representations which record surface properties as a function of surface orientation. The Extended Gaussian Image (EGI) of an object records the variation of surface area with surface orientation. When the object is polyhedral, the EGI takes the form of a set of vectors, one for each face, parallel to the outer surface normal of the face. The length of a vector is the area of the corresponding face. The EGI uniquely represents convex objects and is easily derived from conventional models of an object. An iterative algorithm is described which converts an EGI into an object model in terms of coordinates of vertices, edges, and faces. The algorithm converges to a solution by constrained optimization. There are two aspects to describing shape for polyhedral objects: first, the way in which faces intersect each other, termed the adjacency structure, and, second, the location of the faces in space The latter may change without altering the former, but not vice versa. The algorithm for shape recovery determines both elements of shape. The continuous support function is described in terms of the area function for curves, permitting a qualitative companson of the smoothness of the two functions. The next Section describes a method of curve segmentation based on extrema of the support function. Because the support function varies with translation, its behaviour under translation is studied, leading to proposals for several candidate centres of support. The study of these ideas suggests some interesting problems in computational geometry. The EGI has been applied to determine object attitude, the rotation in 3-space bringing a sample object into correspondence with a prototype. The methods developed for the inversion problem can be applied to attitude determination. Experiments show attitude determination using the new method to be more robust than area matching methods. The method given here can be applied at lower resolution of orientation, so that it is possible to sample the space of attitudes more densely, leading to increased accuracy in attitude determination. The discussion finally is broadened to include non-convex objects, where surface orientation is not unique. The generalizations of the EGI do not support shape reconstruction for arbitrary non-convex objects. However, surfaces of revolution do allow a natural generalization of the EGI The topological structure of regions of constant sign of curvature is invariant under Euclidcan motion and may be useful for recognition tasks.
Dynamic Environment Generations for an ASTRAL Process
Authors: Z. Dang, R. A. Kemmerer
Venue:  (2000)

ASTRAL is a high-level formal specification language for real-time systems. It includes structuring mechanisms that allow one to build modularized specifications of complex real-time systems with layering. Based upon the ASTRAL symbolic model checker reported in [DK99b], an approximation technique to speed-up the ASTRAL symbolic model checker for debugging a specification is presented. The technique, called dynamic environment generation, randomly generates a sequence of concrete environments for an ASTRAL process instance along each execution path in the execution tree of the ASTRAL process. Doing this greatly reduces the time for finding an error in a specification, as demonstrated by a number of mutation tests, while still ensuring reasonable coverage of the search procedure. The results of the tests show that the techniques presented in the paper are effective.