ppxscal/embedding_network huggingface dataset:
Topics in Discourse Analysis
Authors: J. E. Davidson
Venue:  (1977)

This thesis deals with the theory and analysis of connected English discourse. The abstract theory of discourse, and its distinguishing characteristics, are discussed. Some problems in computer analysis of discourse are delineated; a method of analysis, based on a modified system of predictions, is introduced, and illustrated with examples from simple stories. A program embodying these concepts is described. Finally, possibilities for discourse, and its place in computational linguistics, are discussed, and directions for further work indicated. 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 Graphical Interval Logic for Specifying Concurrent Systems
Authors: L. K. Dillon, G. Kutty, L. E. Moser, P. M. Melliar-Smith, Y. S. Ramakrishna
Venue:  (1993)

The paper describes a graphical interval logic that is the foundation of a toolset supporting formal specification and verification of concurrent software systems. Experience has shown that most software engineers find standard temporal logics difficult to understand and to use. The objective of this work is to enable software engineers to specify and reason about temporal properties of concurrent systems more easily by providing them with a logic that has an intuitive graphical representation and with tools that support its use. To illustrate the use of the graphical logic, the paper provides some specifications for an elevator system and proves several properties of the specifications. The paper also describes the toolset and the implementation.
Reliable Group Rekeying: A Performance Analysis
Authors: Yang R Yang, Steve Li, X. B Zhang, Simon S. Lam
Venue:  (2001)

In secure group communications, users of a group share a common group key. A key server sends the group key to authorized new users as well as performs group rekeying for group users whenever the key changes. In this paper, we investigate scalability issues of reliable group rekeying, and provide a performance analysis of our group key management system (called keygem) based upon the use of key trees. Instead of rekeying after each join or leave, we use periodic batch rekeying to improve scalability and alleviate out-of-sync problems among rekey messages as well as between rekey and data messages. Our analyses show that batch rekeying can achieve large performance gains. We then investigate reliable multicast of rekey messages using proactive FEC. We observe that rekey transport has an eventual reliability and a soft real-time requirement, and that the rekey workload has a sparseness property, that is, each group user only needs to receive a small fraction of the packets that carry a rekey message sent by the key server. We also investigate tradeoffs between server and receiver bandwidth requirements versus group rekey interval, and show how to determine the maximum number of group users a key server can support.
A Linear Algorithm for Determining the Separation of Convex Polyhedra
Authors: David P. Dobkin, David G. Kirkpatrick
Venue:  (1983)

The separation of two convex polyhedra is defined to be the minimum distance from a point (not necessarily an extreme point) of one to a point of the other. We present a linear algorithm for constructing a pair of points that realize the separation of two convex polyhedra in three dimensions. Our algorithm is based on a simple hierarchical description of polyhedra that is of interest in its own right. .br Our result provides a linear algorithm for detecting the intersection of convex polyhedra. Separation and intersection detection algorithms have applications in clustering, the intersection of half-spaces, linear programming, and robotics.
Application Intrusion Detection
Authors: Robert S. Sielken
Venue:  (1999)

Intrusion detection has traditionally been performed at the operating system (OS) level by comparing expected and observed system resource usage. OS intrusion detection systems (OS IDS) can only detect intruders, internal or external, who perform specific system actions in a specific sequence or those intruders whose behavior pattern statistically varies from a norm. Internal intruders are said to comprise at least fifty percent of intruders [ODS99], but OS intrusion detection systems are frequently not sufficient to catch such intruders since they neither significantly deviate from expected behavior, nor perform the specific intrusive actions because they are already legitimate users of the system. We hypothesize that application specific intrusion detection systems can use the semantics of the application to detect more subtle, stealth-like attacks such as those carried out by internal intruders who possess legitimate access to the system and its data and act within their bounds of normal behavior, but who are actually abusing the system. To test this hypothesis, we developed two extensive case studies to explore what opportunities exist for detecting intrusions at the application level, how effectively an application intrusion detection system (AppIDS) can detect the intrusions, and the possibility of cooperation between an AppIDS and an OS IDS to detect intrusions. From the case studies, we were able to discern some similarities and differences between the OS IDS and AppIDS. In particular, an AppIDS can observe the monitored system with a higher resolution of observable entities than an OS IDS allowing tighter thresholds to be set for the AppIDS'' relations that differentiate normal and anomalous behavior thereby improving the overall effectiveness of the IDS. We also investigated the possibility of cooperation between an OS IDS and an AppIDS. From this exploration, we developed a high-level bi-directional communication interface in which one IDS could request information from the other IDS, which could respond accordingly. Finally, we explored a possible structure of an AppIDS to determine which components were generic enough to use for multiple AppIDS. Along with these generic components, we also explored possible tools to assist in the creation of an AppIDS.
Implications of Using the Event Scheduling World View for ParallelSimulation
Authors: Debra S. Richardson, Marc Abrams
Venue:  (1990)

Use of a particular world view, or conceptual framework, makes the programming of many simulations easier. Parallel simulation implementations generally have not been based on a particular world view. An open question is what impact a world view has on the execution of a simulation in parallel.
A GENERALIZATION OF SAUER''S LEMMA
Authors: David Haussler, Phil Long
Venue:  (1990)

We generalize Sauer''s lemma to multivalued functions. In addition, we give an application of this result, bounding the uniform rate of convergence of empirical estimates of the expectations of a set of random variables to their true expectations.
Describing Combinations of Strokes for OCR
Authors: Patrick C Hew, Christopher J S deSilva
Venue:  (1999)

We process strokes from pixel sequences to vector paths. The paths are formed over a \( 3 \times 3 \) grid oriented and sized to a single digit. While coarse, the stroke models allow us to infer how the strokes relate to each other.
Natural Language Grammatical Inference
Authors: Jason Hutchens, Mike Alder, Yianni Attikiouzel
Venue:  (1994)

This project is concerned with programming a computer to make predictions about which words are most likely to follow a small segment of English text. At first this may seem a strange problem, but I intend to show that there exist a wide range of applications that would benefit from such a program. Indeed, my motivation for approaching this problem was to provide a way of improving the accuracy of speech recognition systems. Additionally, I am interested with the problem of Grammatical Inference. In fact, the word prediction problem and the Grammatical Inference problem are intertwined, and it seems that approaching either one will lead to the other. Grammatical Inference entails inferring a grammar for an arbitrary language from a finite set of sample sentences in the language. It is quite easy to measure the performance of a word prediction system, providing that its prediction is given as a probability distribution. This allows us to compare our predictor with others, such as the trigram predictor developed at the IBM Thomas J. Watson Research Centre by Jelinek et al. A comparison between the IBM predictor and the algorithm presented in this dissertation indicates that the method I have used is able to make broader generalisations about the language under investigation, and produces more accurate predictions about texts generated by artificial grammars.
A Comparison of Template Matching with Neural Network Approaches in the Recognition of Numeric Characters Hand-Stamped in Aluminium
Authors: Anthony Zaknich, Yianni Attikiouzel
Venue:  (1992)

This paper investigates some methods of feature extraction and recognition of numeric digits stamped in aluminium from very poor gray-scale images. Comparisons are made between the traditional template matching method and other approaches incorporating neural networks. The best methods based on Neural Networks outperformed the template matching method as expected.
Entwurf und Implementierung des funktionalen Parser-Generators CoP
Authors: Juerg Faessler
Venue:  (1995)

CoP (A Combinator Based Parser Generator) ist ein funktionaler Parser- und Scanner-Generator, der vollstaendig in Standard ML implementiert wurde. Er verwendet Backtracking-Verfahren und ist dadurch in der Lage, Parser fuer nahezu alle kontextfreien Sprachen zu erzeugen.
TIME AND SPACE OPTIMAL DATA PARALLEL VOLUME RENDERING USING PERMUTATION WARPING
Authors: Craig Wittenbrink, Arun Somani
Venue:  (1996)

In this paper we present a data parallel volume rendering algorithm with numerous advantages over prior published solutions. Volume rendering is a three-dimensional graphics rendering algorithm that computes views of sampled medical and simulation data, but has been much slower than other graphics algorithms because of the data set sizes and the computational complexity. Our algorithm uses permutation warping to achieve linear speedup (run time is O(S/P) for P processors when P=O(S/logS) for S=n*n*n samples), linear storage ( O(S) ) for large data sets, arbitrary view directions, and high quality filters. We derived a new processor permutation assignment of five passes (our prior known solution was eight passes), and a new parallel compositing technique that is essential for scaling linearly on machines that have more processors than view rays to process (P<n*n). We show a speedup of 15.7 for a 16k processor over a 1k processor MasPar MP-1 (16 is linear) and two frames/second with a 128*128*128 volume and trilinear view reconstruction. In addition we demonstrate volume sizes of 256*256*256, constant run time over angles 5 to 75 degrees, filter quality comparisons, and communication congestion of just 19% to 29%.
Technology Independent Area and Delay Estimations for MicroprocessorBuilding Blocks
Authors: Shashank Gupta, Steven W. Keckler, Doug Burger
Venue:  (2001)

As technologies continue to shrink and sizes of chips continue to get larger, the transistor budget available for design is growing rapidly. Accurate area and delay estimates for the various structures would help in estimating the approximate area and delay estimates for blocks which could be used to make preliminary analysis of new designs. In this work, we identify some of the basic architecture building blocks and provide area and delay estimates for them. Published die photos of various processors were analyzed to make area estimates which were converted to technology independent units considering the process parameters used for the chip fabrication. Using those estimates, a number of design configurations have been analyzed and projections about the area and delay of future designs are made.
Error-resistant Implementation of DNA Computations
Authors: M. Amos, A. M. Gibbons, D. Hodgson
Venue:  (1996)

This paper introduces a new model of computation that employs the tools of molecular biology whose in vitro implementation is far more error-resistant than extant proposals. We describe an abstraction of the model which lends itself to natural algorithmic description, particularly for problems in the complexity class NP. In addition we describe a number of linear-time algorithms within our model, particularly for NP-complete problems. We describe an in vitro realisation of the model and conclude with a discussion of future work.
On the Integrity of Typed First Order Data Bases
Authors: Raymond Reiter
Venue:  (1980)

A typed first order data base is a set of first order formulae, each quantified variable of which is constrained to range over some type. Formally, a type is simply a distinguished monadic relation, or some Boolean combination of these. Assume that with each data base relation other than the types is associated an integrity constraint which specifies which types of individuals are permitted to fill the argument positions of that relation. The problem addressed in this paper is the detection of violations of these integrity constraints in the case of data base updates with universally quantified formulae. The basic approach is to first transform any such formula to its so-called reduced typed normal form, which is a suitably determined set of formulae whose conjunction turns out to be equivalent to the original formula. There are then simple criteria which, when applied to this normal form, determine whether that formula violates any of the argument typing integrity constraints.
Type Feedback vs. Concrete Type Inference: A Comparison of Optimization Techniques for Object-Oriented Languages
Authors: Ole Agesen, Urs Holzle
Venue:  (1995)

Two promising optimization techniques for object-oriented languages are type feedback (dynamic) and concrete type inference (static). We directly compare the two techniques, evaluating their effectiveness on a suite of 23 SELF programs while keeping other factors constant. Our results show that both systems inline <95% of all sends and deliver similar overall performance with one exception: SELF''s automatic coercion of machine integers to arbitrary-precision integers upon overflow confounds type inference and slows down arithmetic-intensive benchmarks. We discuss several other issues which, given the comparable run-time performance, may influence the choice between type feedback and type inference.
LEARNING COMMUTATIVE DETERMINISTIC FINITE STATE AUTOMATA IN POLYNOMIAL TIME
Authors: Naoki Abe
Venue:  (1990)

We consider the problem of learning the commutative subclass of regular languages in the on-line model of predicting {0,1}-valued functions from examples and reinforcements due to Littlestone. We show that the entire class of commutative deterministic finite state automata (CDFA''s) of an arbitrary alphabet size k is predictable in this model, with the worst case number of mistakes bounded above by a polynomial in the number of states s in the target DFA, and independent of the length of example strings. More precisely the mistake bound is of order O(s^{2k} k log s). By Littlestone''s result on converting a mistake bound in this model to a sample Complexity bound for PAC-learning, this result also implies that the class of CDFA''s is PAC-learnable from random labeled examples only in polynomial time with sample complexity O(1/epsilon (log 1/delta + s^{2k} k log s)), using a different class of representations. The class of CDFA''s is one of the few natural, non-trivial subclasses of DFA''s which have been shown to be polynomially predictable to date.
Optimizing Parallel Program Execution by Self-Organizing Maps
Authors: Jurgen W. Quittek
Venue:  (1995)

A complex problem in parallel processing is called the mapping problem. The parts of a parallel program are to be mapped to components of a parallel computer such that the total program execution time becomes minimal. This paper presents self-organizing feature maps as an efficient tool generating solutions of the mapping problem. Parallel program and parallel computer are modeled by graphs. Based on the Kohonen learning rule some adaptations are necessary to apply self-organizing maps. Special metrics reflecting properties of the parallel program respectively the parallel computer allows to map arbitrary parallel programs onto most of the common parallel architectures (two-dimensional lattice, three-dimensional torus, hypercube, etc.). Simulations and applications to reference problems show that self-organizing maps are more efficient than other optimizing methods (e.g. Simulated Annealing) applied to this NP-hard problem. The method can be adapted to a wide variety of further graph mapping problems (e.g. circuit design, production planning, scheduling).
Database Replication Using Epidemic Update
Authors: J. Holliday, D. Agrawal, A. E Abbadi
Venue:  (2000)

Due to severe performance penalties associated with synchronous replication, there is an increasing interest in asynchronous replica management protocols in which database transactions are executed locally, and the effects of these transactions are incorporated asynchronously on remote database copies. However, the asynchronous protocols currently in use either do not guarantee consistency and serializability as needed by transactional semantics or they impose restrictions on placement of data and on which data objects can be updated. In this paper we investigate an epidemic update protocol that guarantees consistency and serializability in spite of a write-anywhere capability. We conducted experiments on a detailed simulation of a distributed, replicated database to evaluate this protocol. Our results establish that this epidemic approach is indeed a viable alternative to traditional eager update protocols for a distributed database environment where consistency and full serializability are needed.
Generating Random Monotone Polygrams
Authors: Jack Snoeyink, Chong Zhu
Venue:  (1993)

We proposed an algorithm that generates x-monotone polygons for any given set of n points uniformly at random. The time complexity of our algorithm is O(K), where n >= K >= n^2 is the number edges of the visibility graph of the x-monotone chain whose vertices are the given n points. The space complexity of our algorithm is O(n).
Finite element predictions of centrifuge tests on liquefiable reinforced soils
Authors: O. O. R. Famiyesin, A. A. Rodger, A. Matheson
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

A fully implicit dynamic finite element (FE) program is used to predict the effect of reinforcement properties on the susceptibility of saturated soils to liquefaction. Two centrifuge test models with saturated sand, involved in previous experiments are modified by introducing respectively, a horizontal and a vertical layer of reinforcement with varying properties such as stiffness and permeability. Time dependent indicators, such as excess pore pressure and acceleration at various points within the soil, and the displacement of a supported structure, are used to monitor the effect of the reinforcement properties during the dynamic and consolidation phases of the analyses.
Circular Data-space Partitioning for Similarity Queries and Parallel Disk Allocation
Authors: Omer Egecioglu, Hakan Ferhatosmanoglu
Venue:  (1999)

In a multiple disk environment it is desirable to have techniques for efficient parallel execution of similarity queries. Usually many buckets that may have the query result are needed to be retrieved from secondary storage, which is a costly operation. To achieve efficiency, there are two major factors that need to be considered. These are the number of buckets retrieved by the query, and the degree of parallelism provided by the disk allocation method. In this paper, we develop efficient techniques for parallel similarity searching by optimizing these two factors defined for data-sets that are circular in nature, and similarity queries consisting of query disks centered at the query point. Our partitioning technique minimizes the expected number of buckets retrieved by a random query among a spectrum of partitioning schemes which have equi-area concentric rings and equi-area central wedges as its two extremes. A simple disk allocation technique for the proposed partitioning method that maximizes the degree of parallelism obtained is also described.
Bisimulation and Fault-Tolerance
Authors: Janowski,  T
Venue:  (1996)

In the area of concurrent, communicating systems, a common approach to verify the absence of design faults is in terms of an equivalence relation between a high-level and a low-level process. One such relation is bisimulation and this holds if two processes cannot be distinguished by observing them for a finite interval of time. However, the absence of design faults does not guarantee that the process will behave correctly in practice as it depends on various hardware devices which may be subject to physical faults themselves. Such faults cannot be avoided; they must be tolerated. The purpose of this thesis is to provide a formal framework, based on bisimulations and using the Calculus of Communicating Systems, by which we can specify, design and verify concurrent, fault-tolerant systems, with emphasis placed on reasoning and design under weak assumptions about faults. 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
Recognising Aircraft: Automatic Extraction of Structure by layers of Quadratic Neural Nets
Authors: Robert A. McLaughlin, Mike Alder
Venue:  (1993)

A method is described which can differentiate between silhouettes of a passenger aircraft and a fighter aircraft. This method is explained both as a syntactic process and in terms of the operations of a Quadratic Neural Network. Translation, rotation and scale invariance are not built into the system but are learnt by example. The resulting system proves to be highly accurate.
Immunology Viewed as the Study of an Autonomous Decentralized System
Authors: L. Segel, R. L Bar-Or
Venue:  (1998)

Arguments are given for the tenet that although the immune system has no long term goals, it does have short term goals-which are often contradictory. Simple models illustrate how feedbacks can (i) harmonize conflicting goals, (ii) improve the performance of a given type of effector cell, (iii) cause the preferential amplification of more potent effectors. It is shown that spatial organization can allow non-specific chemical signals to select specific immune elements that contribute to system goals. Comparison is made with other autonomous decentralized systems.
Pricing via Processing or Combatting Junk Mail
Authors: C. Dwork, M. Naor
Venue:  (1995)

We present a computational technique for combatting junk mail, in particular, and controlling access to a shared resource, in general. The main idea is to require a user to compute a moderately hard, but not intractable, function in order to gain access to the resource, thus preventing frivolous use. To this end we suggest several pricing functions, based on, respectively, extracting square roots modulo a prime, the Fiat-Shamir signature scheme, and the Ong-Schnorr-Shamir (cracked) signature scheme.