ppxscal/embedding_network huggingface dataset:
Using Pragmatic and Semantic Knowledge to Correct Parsing of Spoken Language Utterances
Authors: Sheryl R. Young, Michael Matessa
Venue:  (1992)

This paper describes the structure and operation of SOUL, or Semantically-Oriented Understanding of Language. SOUL is a knowledge intensive reasoning system which is opportunistically used to provide a more thorough, fine grained analysis of an input utterance following its processing by a case-frame speech parser. The SOUL postprocessor relies upon extensive semantic and pragmatic knowledge to correct, reject and/or clarify the outputs of the CMU PHOENIX case-frame parser for speech and speech transcripts. We describe briefly both some of the linguistic phenomena which SOUL addresses and how SOUL works to correct inaccurate interpretations produced by the PHOENIX parser. Finally, we present the results six non-overlapping test sets, each evaluated for both speech and speech transcription processing. These test sets evaluate the systems ability to enhance performance in both highly restricted and completely unrestricted input data. Further, some test sets capitalize upon the unique linguistic features of spontaneous speech. These evaluations illustrate that the decrease in incorrect interpretations and total error rate resulting from SOUL''s postprocessing are most pronounced in unrestricted transcript data and all forms of speech data, as opposed to carefully constrained test sets. For example, in processing transcription data incorrect interpretations are reduced by 53% in constrained sets, as opposed to 81% in unrestricted sets. In other words, the more difficult the processing and/or interpretation, the more there was to be gained by using extensive reasoning abilities.
Self-Games and Body-Play: Personhood in Online Chat and Cybersex
Authors: Dennis D. Waskul
Venue:  (2003)

:Based on over 150 interviews with online chat and cybersex participants, Self-Games and Body-Play is an empirically grounded analysis of how these unique experiences provide a lens for better understanding the nature of personhood in everyday life.
Application of Genetic Algorithm to Decentralized Control of Robot Manipulators
Authors: Hamid Reza Miryazdi, Hamid Khaloozadeh
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

This paper discusses the genetic algorithm to improve a decentralized adaptive control scheme to reduce tracking errors of robot manipulators. A simple PD conventional controller is used together a cubic feedback and an adaptive controller to ensure about its global stability. Then a genetic algorithm is proposed to determine coefficients of PD, nonlinear and adaptive controller such that tracking errors of robot that is fitness function of genetic algorithm, to be minimized. In order to show the performance of the proposed method, computer simulation are implemented on a simple two link robot manipulator.
Improved Approximation Guarantees for Packing and Covering Integer Programs
Venue:  (1995)

Several important NP-hard combinatorial optimization problems can be posed as {\em packing/covering integer programs}; the {\em randomized rounding} technique of Raghavan \& Thompson is a powerful tool to approximate them well. We present one elementary unifying property of all these integer programs (IPs), and use the FKG correlation inequality to derive an improved analysis of randomized rounding on them. This also yields a {\em pessimistic estimator}, thus presenting deterministic polynomial-time algorithms for them with approximation guarantees significantly better than those known. 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
Single-model method for specifying multi-agent systems
Authors: Arnon Sturm, Dov Dori, Onn Shehory
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Multiple modeling methods for constructing agent-based systems have been suggested, however none of them has been accepted as a standard. A prominent reason for this is the gap that exists between agent-oriented methods and the modeling needs of agent-based systems. This gap is, in large part, due to lack of an agreed-upon set of building blocks for modeling Multi-Agent Systems (MAS) and standalone agents, and lack of support for essential software engineering properties. To bridge the gap, we suggest a set of building blocks and an agent-based modeling method. The building blocks should be useful as a basis for developing modeling methods for MAS, and as a benchmark for comparison between such methods. Our proposed modeling method, which is based on the building blocks, is novel in its ability to capture the different aspects of MAS in a single unifying framework. It further excels in providing accessibility, expressiveness and flexibility, which are major lacking software engineering properties in other methods. We demonstrate the usage of the method for modeling MAS, optionally, in conjunction with an existing MAS infrastructure. Thus, our method enhances both the utilization of existing infrastructure and the development of agent-oriented models.
ORION: An Adaptive Home-Based Software Distributed Shared Memory System
Authors: M. C. Ng, W. F. Wong
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

In this paper, we describe a multithreaded software distributed shared memory (DSM) system named Orion. It has been developed to provide POSIX-thread (pthread) like interface. We believe this will avoid creating another unique set of application programming interface and ease the porting of pthread programs to a distributed environment. Orion implements home-based consistency model. In this paper, we also present 2 adaptive schemes for home-based DSM systems: home migration and dynamic adaptation between write-invalidation and write-update protocols. The two fully automatic schemes aim to involve minimal user intervention and yet deliver good performances with some speedups ranging from 2% to 79% observed in some 8 benchmarks tested.
Evaluating a Visualization of Image Similarity as a Tool for Image Browsing
Authors: Kerry Rodden, Wojciech Basalaj, David Sinclair, Kenneth Wood
Venue: Proceedings of the 1999 IEEE Symposium on Information Visualization (1999)

A similarity metric based on the low-level content of images can be used to create a visualization in which visually similar images are displayed close to each other. We are carrying out a series of experiments to evaluate the usefulness of this type of visualization as an image browsing aid. The initial experiment, described in this paper, considered whether people would find a given photograph more quickly in a visualization than in a randomly arranged grid of images. The results show that the subjects were faster with the visualization, although in post-experiment interviews many of them said that they preferred the clarity and regularity of the grid. We describe an algorithm with which the best aspects of the two layout types can be combined.
Automated Capture, Integration, and Visualization of Multiple Media Streams
Authors: Jason A. Brotherton, Janak R. Bhalodia, Gregory D. Abowd
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

In this paper, we discuss our efforts in building a system for the automatic generation, integration, and visualization of media streams- independent information sources that define rich interactive experiences. This research is done in the context of a project called Classroom 2000, an experiment in ubiquitous computing for education. We view teaching and learning as a form of multimedia authoring and have developed a system that generates much of the educational content that occurs naturally in university lectures. We have developed a taxonomy for characterizing different media streams that can be captured during or after a live session and we present solutions to two research issues that affect the access of a rich multimedia record. The first issue deals with the granularity of stream integration. The second issue deals with methods of visualizing a set of integrated media streams that is scalable and that supports a user's desire to search by browsing.
On the Reachability Problem for 5-Dimensional Vector Addition Systems
Authors: John E. Hopcroft, J. Pansiot
Venue:  (1976)

The reachability set for vector addition systems of dimension less than or equal to five are shown to be effectively computable semilinear sets. Thus reachability, equvalence and containment are decidable up to dimension 5. An example of a non-semilinear reachability set is given for dimension 6. Keywords and phrases: Vector addition system, Petri net, semilinear set, algorithms, decidability.
Update on Tools for Parallel Programming at the CNSF
Authors: Donna Bergmark
Venue:  (1993)

Not many CNSF users undertake the arduous task of parallelizing their programs. Of course, training, education, and available hardware will have a lot to do with changing this situation, but we feel that tools also have an important role to play. In 1989, we wrote: "At the present time, the general lack of parallel programming tools is an inhibitor to parallel programming at the Cornell National Supercomputer Facility (CNSF). The Technology Integration Group (TIG) is evaluating a number of tools designed to make parallel programming easier, including tools for source analysis, program development and execution analysis. The more effective tools will be ''mainstreamed'', i.e. turned over to users, integrated into workshops and consulted on by staff." This provides an update to that status report. The major section of this paper describes Tools for Parallel Programming, divided into 12 categories. Each category is summarized in pretty much the same way as in 1989, and then new status and prospects are discussed. The paper concludes with some comments on hybrid program development systems and the workstation environment. The appendices contain a table of all the tools and list acronyms, names, and institutions.
Deadlock-free routing in an optical interconnect for high-speed wormhole routing networks
Authors: P. Palnati, M. Gerla, E. Leonardi
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

The Supercomputer SuperNet (SSN) is a two-level hierarchical high-speed network. The lower level is a high speed electronic mesh fabric; the higher level is a WDM optical backbone network interconnecting the high-speed fabrics distributed across a campus or metropolitan area. The salient characteristics of this architecture are the use of wormhole routing and backpressure hop-by-hop flow control mechanism. Because of these features, deadlocks are possible in SSN. In this paper, we address the issue of deadlock-free routing which is an essential prerequisite for the proper operation of SSN. To this end, we first present a deadlock free routing scheme for the WDM backbone which is implemented with a shufflenet multihop virtual topology. We use the notion of virtual channels to obtain mappings of virtual channels to physical channels such that deadlock-free routing is achieved for any (p,k) shufflenet (uni and bidirectional). Then, we compare the virtual channels scheme with the more conventional up/down deadlock free routing scheme for the bidirectional shufflenet and show that the former yields much better performance. Finally, we address the problem of deadlock prevention across the entire network (i.e., lower level fabric as well as the optical backbone) and develop an integrated solution combining different schemes best suited for the different levels.
The Molecular Problem: Determining Conformation from Pairwise Distances
Authors: Bruce A. Hendrickson
Venue:  (1990)

The molecule problem is that of determining the coordinates of a set of points in space from a (usually sparse) set of pairwise distance measurements. As its name implies, it has applications in the determination of molecular conformation. Unfortunately, the molecule problem is NP-hard. We present an approach to the molecule problem that uses a very specialized divide-and-conquer technique. Instead of solving a single large problem, we try to solve a sequence of smaller, presumably easier ones. These smaller problems consist of subsets of points whose relative locations can be determined uniquely. Once such a subset is positioned, its points can collectively be treated as a rigid body. This can greatly reduce the number of degrees of freedom in the problem. Identifying subsets of points whose relative locations can be uniquely determined requires exploiting some very special structure inherent in the molecule problem. We reduce this identification to a purely combinatoric characterization that ignores the actual distances. We develop necessary graph theoretic conditions for a set of points to have an unique solution, along with efficient algorithms to find subgraphs with these properties. These characterizations and algorithms combine ideas from matching theory, differential topology and matrix computations. These ideas have been implemented in ABBIE, a program to solve three-dimensional instances of the molecule problem. ABBIE combines the recursive decomposition described above with a nonlinear global optimizer to perform the coordinate determinations. Details of this implementation are described, and numerical results of simulated chemical data are presented.
A Case Study in Algorithm Engineering for Geometric Computing
Authors: Roberto Tamassia, Luca Vismara
Venue:  (1997)

The goal of this paper is to prove the applicability of some advanced software design concepts to geometric computing through a vertical case study. The work is presented within the framework of the GeomLib project, aimed at developing an easy to use, reliable, open library of robust and efficient geometric algorithms. We present the criteria that have inspired the preliminary design of GeomLib and discuss the guidelines that we have followed in the initial implementation.
Are Decomposition Slices Clones?
Authors: Keith Gallagher, Lucas Layman
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

When computing program slices on all variables in a system, we observed that many of these slices are the same. This leads to the question: Are we looking at software clones? We discuss the genesis of this phenomena and present some of the data observations that led to the question. The answer to our query is not immediately clear. We end by presenting arguments both pro and con. Supporting the affirmative, we observed that some slice-clones are evidently the result of the usual genesis of software clones: failure to note appropriate abstractions. Also, slice-clones assist in program comprehension by coalescing into one program fragment the computations on many different variables. Opposing the proposition, we note that slice-clones do not arise due to programmer intent or the copying of ex-isting idioms.
Metadata Representation in XML for Internet-Based Electronic XML Application from Business to Government
Authors: Makoto Imamura, Ryuuji Nagahama, Katsushi Suzuki, Akehiro Watabe, Hidekazu Tsuji
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

In government-to-business Internet application as in business-to-business Internet commerce, XML (eXtensible Markup Language) is attracting attention as a format to encode information and services with meaningful structure and semantics that computers can readily understand. In this paper, first we propose a model to represent metadata about a set of application documents in Resource Description Framework (RDF). Secondly, we newly introduce Document Rules Description Language (DRDL) in order to describe the document rules of metadata. Thirdly we propose a DRDL processor, which validate whether a set of application documents satisfy the document rules or not. We have used a DRDL processor to support applicants to apply export license to government in JETRAS (Japan Electronic open network TRAde control System). The effects of a DRDL processor are as follows. (i) To improve development efficiency by unified management of document rules for XML processing software's. (ii) To support applicants for making electronic application documents by document content validation of a set of application documents.
Improved construction of negation-limited circuits
Authors: Robert Beals
Venue:  (1995)

A theorem of Markov states that any system of boolean functions on n variables may be computed by a boolean circuit containing at most log(n+1) negation gates. We call such a circuit negation limited. A circuit with inputs x_1, ..., x_n and outputs neg(x_1), ..., neg(x_n) is called an inverter. Fischer has constructed negation-limited inverters of size 0(n^2 log n) and depth 0(log n). Recently, Tanaka and Nishino have reduced the circuit size to 0(n log^2 n) at the expense of increasing the depth to log^2 n. We construct negation-limited inverters of size 0(n log n), with depth only 0(log n). We also improve a technique of Valiant for constructing monotone circuits for slice functions (introduced by Berkowitz).
LLR routing in homogeneous VP-based ATM networks
Authors: Ren-Hung Hwang
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

In ATM networks, a virtual path (VP) concept has been proposed to simplify traffic control and resource management. As a consequence, cell routing becomes more flexible and significant call setup processing can be reduced when resources are reserved on VP's. In this paper, we study the routing problem in homogeneous VP-based ATM networks in which VP's are used for traffic segregation such that all VC's in a VP have the same traffic characteristics and QOS requirement. Four adaptive routing algorithms based on the least loaded routing (LLR) concept are designed and evaluated. Our simulation results show that network blocking probability can be significantly reduced by LLR routing.
A Configurable Event Service for Distributed Systems
Authors: Masoud Mansouri-Samani, Morris Sloman
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

Event services are needed for control systems, implementing management of networks and distributed and for many event based applications. In all these applications it is necessary to filter out unwanted events and combine low-level event sequences into a higher level, more abstract event to trigger an action. In this paper we present a flexible and powerful distributed event service which can be used to process and disseminate events for many different applications. The service can be configured dynamically at two levels. Composite events can be defined as rules in terms of event sequences using the GEM notation. These rules can be loaded, removed, enabled and disabled dynamically within event monitoring interpreters. Interpreters and event disseminator components can then be dynamically configured onto physical nodes within the system using the Darwin configuration environment to distribute the monitoring close to where events are generated. This reduces network traffic caused by event generation in large systems.
Application-Layer Group Communication Server for Extending Reliable Multicast Protocols Services
Authors: Ehab Al-Shaer, Hussein Abdel-Wahab, Kurt Maly
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

Reliable multicast protocols are becoming an essential element in distributed applications such as interactive distance learning applications. However, the existing implementations of reliable multicast protocols are not sufficient to satisfy the group communications requirements of some distributed applications. Our experience of using number of multicast protocols in IRI distance learning applications shows the necessity of providing an application-layer Reliable Multicast Server (RMS) to extend the primitive group communication services provided by such multicast protocols. Examples of such services include handling heterogeneous environments (such as LAN vs. WAN networks and different reliable multicast protocols), automatic fault recovery and simple application interface. In this paper, we motivate and describe the design and the implementation of RMS architecture which has been used in IRI learning sessions for two semesters. We also show how RMS improves the reliability, performance and flexibility of IRI sessions via supporting extended group communication services.
Comparing the Effectiveness of Testing Methods in Improving Programs: the Effect of Variations in Program Quality
Authors: Michele Pizza, Lorenzo Strigini
Venue: Proceedings of the The Ninth International Symposium on Software Reliability Engineering (1998)

We compare the efficacy of different testing methods for improving the reliability of software. Specifically, we use modelling to compare "operational" testing, in which test cases are chosen according to their probability of occurring in actual use of the software, against "debug" testing methods, in which the testers look for test cases which they consider likely to cause failure, or that satisfy some coverage criterion. We base our comparisons on the reliability reached by the program at the end of testing. Differently from previous studies, we consider the probability distribution of the achieved reliability, and thus the probability of satisfying specific requirements, rather than just the average reliability achieved. We take account of two sources of variation: the variation between the actual test histories that are possible for a given program and a given test method; and the fact that different programs start testing with different faults and initial reliability levels. By necessity, we use very simplified models of reality. Yet, we can show some interesting conclusions with important practical consequences. In general, there are stronger arguments in favor of operational testing than previous studies have shown.
Aspects to visualising reusable components
Authors: Stuart Marshall, Kirk Jackson, Craig Anslow, Robert Biddle
Venue: Proceedings of the Asia-Pacific symposium on Information visualisation - Volume 24 (2003)

We are interested in helping developers reuse software by providing visualisations of reusable code components. These visualisations will help determine if and how a given code component can be reused in the developer's new context. To provide these visualisations, we need both formatted information and tools. We need a format to describe the visualisations in. We need tools to create the visualisations. We need a format to describe information about the component and its runtime usage, and we need a tool to gather this information in the first place.In this paper, we discuss our two wish-lists for the required information formats. We set this against the background of software visualisation and code reuse research. Currently we are working with components from object oriented languages, specifically Java.