ppxscal/embedding_network huggingface dataset:
JPVM: Network Parallel Computing in Java
Authors: Adam J. Ferrari
Venue:  (1997)

The JPVM library is a software system for explicit message-passing based distributed memory MIMD parallel programming in Java. The library supports an interface similar to the C and Fortran interface provided by the Parallel Virtual Machine (PVM) system, but with syntax and semantics modifications afforded by Java and better matched to Java programming styles. The similarity between JPVM and the widely used PVM system supports a quick learning curve for experienced PVM programmers, thus making the JPVM system an accessible, low-investment target for migrating parallel applications to the Java platform. At the same time, JPVM offers novel features not found in standard PVM such as thread safety, multiple communication end-points per task, and default-case direct message routing. JPVM is implemented entirely in Java, and is thus highly portable among platforms supporting some version of the Java Virtual Machine. This feature opens up the possibility of utilizing resources commonly excluded from network parallel computing systems such as Macintosh and Windows-NT based systems. Initial applications performance results achieved with a prototype JPVM system indicate that the Java-implemented approach can offer good performance at appropriately coarse granularities.
A Proposed Framework for Characterization of Robotic Systems
Authors: Jane Mulligan
Venue:  (1992)

The plethora of approaches to planning and action in robotic systems calls for a unified framework onto which we can map various systems and compare their structure and performance. We propose such a thinking framework which allows us to examine these systems in a uniform way and discuss their adequacy for robotic problems. The inclusion of an environment specification in problem specifications is proposed as a means of clarifying a robot''s abilities and creating a notion of context. Robotic systems are described as a set of {\em $$} strategies combined with a set of actuators.
Anaphoria in natural Language Understanding: A Survey
Authors: Graeme Hirst
Venue:  (1979)

A problem that all computer-based natural language understanding (NLU) systems encounter is that of linguistic reference, and in particular anaphora (abbreviated reference). For example, in a text as simple as: \begin{quote} Nadia showed Sue her new car. The seats were Day-Glo orange. \end{quote} knowing that ``her'''' probably means Nadia and not Sue and that ``the seats'''' means the seats of Nadia''s new car is not a simple task. .br This thesis is an extensive review of the reference and anaphor problem, and the approaches to it that NLU systems have taken, from early systems such as STUDENT through to current discourse-oriented ones such as PAL. .br The problem is first examined in detail, and examples are given of many different types of anaphor, some of which have been ignored by previous authors. The approaches taken in traditional systems are then described and abstracted and it is shown why they were inadequate, and why discourse theme and anaphoric focus need to be taken into account. The strengths and weaknesses of current anaphora theories and approaches are evaluated. The thesis closes with a list of some remaining research problems. .br The thesis has been written so as to be as comprehensible as possible to both AI workers who know no linguistics, and linguists who have not studied artificial intelligence.
Storm: using P2P to make the desktop part of the web
Authors: Benja Fallenstein, Tuomas J. Lukka, Hermanni Hyytiälä, Toni Alatalo
Venue: Proceedings of the fourteenth ACM conference on Hypertext and hypermedia (2003)

We present Storm, a storage system which unifies the desktop and the public network, making Web links between desktop documents more practical. Storm assigns each document a permanent unique URI when it is created. Using peer-to-peer technology, we can locate documents even though our URIs do not include location information. Links continue to work unchanged when documents are emailed or published on the network. We have extended KDE to understand Storm URIs. Other systems such as GNU Emacs are able to use Storm through an HTTP gateway.
Finding Extrema With Unary Predicates
Authors: Feng Gao, Leonidas J. Guibas, David G. Kirkpatrick, William T. Laaser, James Saxe
Venue:  (1990)

We consider the problem of determining the maximum and minimum elements {x_{1}, \ldots ,x_{n}}$, drawn from some finite universe $\cal U$ of real numbers, using only unary predicates of the inputs. It is shown that $\Theta (n + \log |{\cal U} |) $ unary predicate evaluations are necessary and sufficient, in the worst case. Results are applied to i) the problem of determining approximate extrema of a set of real numbers, in the same model, and ii) the multiparty broadcast communication complexity of determining the extrema of an arbitrary set of numbers held by distinct processors.
Computer simulation and video for consolidation testing
Authors: U. F. A. Karim, J. de Goeijen
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

The development and structure of a novel simulation and video package (CTM) on the topics of consolidation and laboratory consolidation testing is discussed in this paper. A courseware tool called Authorware proved to be versatile for building the package and the paper shows in details how the file structure of CTM is implemented within Authorware. In the video background information, animations on consolidation testing and theory in practice as well as a standard and large-scale model consolidation tests, are shown. Running the package in a multi-user examination-type setting proved to be effective for learning and control of the process. To simulate real-life situations users can pick a soil sample from a location-sensitive map of the Netherlands with options for randomly generated parameters. Content-oriented multiple-choice questions on the theoretical and professional aspects of the test are posed, and users response is evaluated and reported on log files. Student users have responded positively to this development indicating minor future improvements.
Automated Second Echelon Commitments for the C3EVAL Model
Authors: David W Roberson
Venue:  (1988)

The C3EVAL model is being developed by the Institute for Defense Analyses (IDA) for the Joint Chiefs of Staff (JCS/J6). The model is to provide one element of a workstation being developed for JCS that is to be used to evaluate theater level command, control and communications (C3) in terms of combat consequences. The red commander enhancement to the C3EVAL model provides a red side that is independent of the blue side. The enhancement also automates the commitment of second echelon forces on the red side. This research report describes the foundation for this enhancement. 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
Vincent and the Split Cell
Authors: Bart J. Geraci
Venue:  (1988)

Current VLSI layout editors and other design tools have used a model where each logic circuit is represented by a single object called a cell. This paper proposes that the cell be divided into two parts: the input and output wires of the cell, the interface, and the body of the cell, the implementation Some of the advantages of the split cell model are major: each cell has many versions which are easily interchangeable, hierarchical design rule checks are bounded by the scope of the current cell, a design methodology is provided to reduce errors, matrices of cells are easy to generate and correct, and large teams can build large designs more easily. The restrictions on cells built with the split cell model are listed, and it is shown that many of these restrictions are already used for unsplit cells. The practicality of the split cell model is demonstrated by Vincent, a VLSI editor that manipulates split cells. Like other modern VLSI editors, Vincent has a design rule checker, keeps track of electrical connectivity, and is technology independent.
Model-Guided Grouping for 3-D Motion Tracking
Authors: Xun Li, David G. Lowe
Venue:  (1991)

The objective of this paper is to develop a robust solution to the correspondence problem in model-based motion tracking even when the frame-to-frame motion is relatively fast. A new approach called Model-Guided Grouping, which is used to derive intermediate-level structures as our matching tokens, is introduced. The groupings are guided and derived locally, with the contemporary use of model structures, around the predicted model during the object tracking. We choose junctions and parallel pairs as our matching tokens, thus the information coded in these structures is relatively invariant in consecutive frames. The matching strategy is coarse-to-fine, and partial matching will also be allowed when occlusions are present. The method for evaluation of probability of accidental match based on junction groupings will be discussed. Systematic testing shows that matches based on these new methods improve correspondence reliability by about an order of magnitude over previous method based on matching individual line segments.
A FINITE-SOURCE MULTISERVER QUEUE WITH PREEMPTIVE PRIORITIES
Authors: Alexandre Brandwajn
Venue:  (1996)

We consider systems with finite sources of requests, multiple servers, and an arbitrary number of preemptive priority classes. The service times and the source idle times are assumed to be exponentially distributed. We present an efficient approach based on marginal state description. The approach allows a recurrent analysis of priority levels where the usage of servers by higher priority requests is accounted for through server vanishing and reappearance rates. We first consider systems with fixed priorities. The method is then extended to cases where sources can issue requests at several priority levels.
Application Semantics for Active Monotonic Database Applications
Authors: Lane Warshaw, Daniel P. Miranker
Venue:  (2000)

We refine an active-database application taxonomy, proposed by Stonebraker, to include monotonic log monitoring applications (MLM). MLMs are a subclass of hard rule systems where triggering events are restricted to monotonic relations. We develop a formal semantic model for the MLM class. We then prove the correctness of concurrency schemes for applications within the model. Our results demonstrate that only minimal coupling mode support is necessary for the database integration of hard rule systems obeying the MLM restrictions.
COMPARING TWO GARBAGE COLLECTORS FOR C++
Authors: Daniel R. Edelson
Venue:  (1992)

Our research is concerned with compiler-independent, tag-free garbage collection for the C++ programming language. This paper presents a mark-and-sweep collector, and explains how it ameliorates shortcomings of a previous copy collector. The new collector, like the old, uses C++''s facilities for creating abstract data types to define a *tracked reference* type, called _roots_, at the level of the application program. A programmer wishing to utilize the garbage collection service uses these roots in place of normal, raw pointers. We present a detailed study of the cost of using roots, as compared to both normal pointers and reference counted pointers, in terms of instruction counts. We examine the efficiency of a small C++ application using roots, reference counting, manual reclamation, and conservative collection. Coding the application to use garbage collection, and analyzing the resulting efficiency, helped us identify a number of memory leaks and inefficiencies in the original, manually reclaimed version. We find that for this program, garbage collection using roots is much more efficient than reference counting, though less efficient than manual reclamation. It is hard to directly compare our collector to the conservative collector because of the differing efficiencies of their respective memory allocators.
Component state model and its application in constructablity analysis of construction schedules
Authors: D. K. H. Chua, Y. Song
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

The complexity of modern building project makes it necessary to employ several constructors into one project. The segmented project schedules often include conflicts when they are merged together. The main challenge for the different constructors in their communication with each other lies in the dependency between their activities which is affected by many factors like the state of the building component, the availability of information, and the construction space. The relationships between components and activities, between components, between resources, and between components and resources all exert extra constraints on the dependency between activities. The Component Sate Model integrates the building product, construction process and resource. The activity type library in the model links the activities with both the states of the building components and those of the space resources, and forms the constructability criteria for the analysis. The model has an inference engine that can perform a simulation of the project schedule to determine the potential constructability conflicts. The application of CSM is illustrated using an example to show the interaction of the pipe installation and wall plastering activities.
A Theory of Wormhole Routing in Parallel Computers
Authors: S. Felperin, P. Raghavan, E. Upfal
Venue:  (1993)

Virtually all theoretical work on message routing in parallel computers has dwelt on packet routing : messages are conveyed as packets, an entire packet can reside at a node of the network, and a packet is sent from the queue of one node to the queue of another node until it reaches its destination. A trend in multicomputer architecture, however, is to use wormhole routing. In wormhole routing a message is transmitted as a continguous stream of bits, physically occupying a sequence of nodes/edges in the network. Thus, a message resembles a worm burrowing through the network. In this paper we give theoretical analyses of simple wormhole routing algorithms, showing them to be nearly optimal for butterfly and mesh connected networks. Our analysis required initial random delays in injecting messages to the network. We report simulation results suggesting that the idea of random initial delays may have an impact beyond theoretical analysis.
The Rectilinear Crossing Number of K_10 is 62
Authors: Alex Brodsky, Stephane Durocher, Ellen Gethner
Venue:  (2000)

A drawing of a graph G in the plane is said to be a rectilinear drawing of G if the edges are required to be line segments (as opposed to Jordan curves). We assume no three vertices are collinear. The rectilinear crossing number of G is the fewest number of edge crossings attainable over all rectilinear drawings of G. Thanks to Richard Guy, exact values of the rectilinear crossing number of K_n, the complete graph on n vertices, for n = 3,...,9, are known (Guy 1972, White and Beineke 1978). Since 1971, thanks to the work of David Singer, the rectilinear crossing number of K_10 has been known to be either 61 or 62, a deceptively innocent and tantalizing statement. The difficulty of determining the correct value is evidenced by the fact that Singer''s result has withstood the test of time. In this paper we use a purely combinatorial argument to show that the rectilinear crossing number of K_10 is 62. Moreover, using this result, we improve an asymptotic lower bound for a related problem. Finally, we close with some new and old open questions that were provoked, in part, by the results of this paper, and by the tangled history of the problem itself.
Building Bridges and Interfaces: Toward the Next Generation of UIMS
Authors: H. R Hartson, Deborah Hix
Venue:  (1987)

User interface management systems (UIMS) have established themselves in both research and commercial arenas. We present several generations in UIMS evolution and discuss some problems of the early generations. In particular, we discuss the problems of a gap between methods used by behavioral scientists and computer scientists during the process of building interfaces. We present an empirical approach to begin bridging this gap and results of our preliminary observations: a human-computer interface development life cycle and recording techniques for interface development, as well as UIMS needed to support them. We conclude with future directions for the evolution of UIMS.
Determining the Similarity of Deformable Shapes
Authors: R. Basri, L. Costa, D. Geiger, D. Jacobs
Venue:  (1998)

Determining the similarity of two shapes is a significant task in both machine and human vision systems that must recognize or classify objects. The exact properties of human shape similarity judgments are not yet well understood, and this task is particularly difficult in domains where the shapes are not related by rigid transformations. In this paper we identify a number of possibly desirable properties of a shape similarity method, and determine the extent to which these properties can be captured by approaches that compare local properties of the contours of the shapes, through elastic matching. Special attention is devoted to objects that possess articulations, i.e., articulated parts. Elastic matching evaluates the similarity of two shapes as the sum of local deformations needed to change one shape into another. We show that similarities of part structure can be captured by such an approach, without the explicit computation of part structure. This may be of importance, since although parts appear to play a significant role in visual recognition, it is difficult to stably determine part structure. We also show novel results about how one can evaluate smooth and polyhedral shapes with the same method. Finally, we describe shape similarity effects that cannot be handled by current approaches.
Homotopy Approaches to the H2 Reduced Order Model Problem
Authors: Dragan Zigic, Layne T. Watson, Emmanuel G. Collins, Dennis S. Bernstein
Venue:  (1991)

The optimal projection approach to solving the H2 reduced order model problem produces two coupled, highly nonlinear matrix equations with rank conditions as constraints. The algorithms proposed herein utilize probability-one homotopy theory as the main tool. It is shown that there is a family of systems (the homotopy) that make a continuous transformation from some initial system to the final system. With a carefully chosen initial system all the systems along the homotopy path will be asymptotically stable, controllable and observable. One method, which solves the matrix equations in their original form, requires a decomposition of the projection matrix using the Drazin inverse of a matrix. An effective algorithm for computing the derivative of the projection matrix that involves solving a set of Sylvester equations is given. Several strategies for choosing the homotopy maps and the starting points (initial systems) are discussed and compared, in the context of some reduced order model problems from the literature. Numerical results are included for ten test problems, of sizes 2 through 17.
Behaviour of pre-damaged T-shaped reinforced concrete beams
Authors: M. B. Emara, A. G. Sherif
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

Eight reinforced concrete T-shaped simple beams with a cantilever were tested under a monotonically increasing central point load to failure. The beams had variable flange widths and flexural and shear reinforcement ratios and were tested under positive bending conditions (sagging moments). The beams had been subjected to extensive shear damage near the internal support due to pre-loading of the cantilever. The purpose here was to study the effects of pre-damage on the behaviour of the beams under service loads as well as their capacity at ultimate conditions.The study concentrated on trying to evaluate the effects of shear induced deformations in the damaged zone on the deflections of the beams at service loads. In addition, the combined effects of shear-induced deformations and flexural deformations due to plastification of the beam in its central zone were considered. Experimentally measured deflections were compared to the theoretical deflections computed according to CEB-FIP code at service loads. Nonlinear moment-curvature diagrams for the beam were computed and used to evaluate flexural deformations at ultimate conditions.The study revealed that shear-induced deformations resulting from the increased flexibility in the damaged zone contributed significantly to the overall deflections of the beams at service load levels however did not affect the ultimate capacity of the beams.
Sequential Regularization Methods for higher index DAES with constraint singularities: I Linear Index-2 Case
Authors: Uri Ascher, Ping Lin
Venue:  (1993)

Sequential regularization methods for higher index DAEs with constraint singularities: I. Linear index-2 case Standard stabilization techniques for higher index DAEs often involve elimination of the algebraic solution components. This may not work well if there are singularity points where the constraints Jacobian matrix becomes rank-deficient. This paper proposes instead a sequential regularization method (SRM) -- a functional iteration procedure for solving problems with isolated singularities which have smooth differential solution components. For linear index-2 DAEs we consider both initial and boundary value problems. The convergence of the SRM is described and proved in detail. Various aspects of the subsequent numerical discretization of the regularized problems are discussed as well and some numerical verifications are carried out.
A Lifecycle Which Incorporates Software Metrics
Authors: Wei Li, Sallie M. Henry
Venue:  (1990)

The traditional waterfall life cycle model of software development provides a systematic method to separate the development process into different stages with explicit communication boundaries between each subsequent stage. But the waterfall model does not provide quantitative measurements for the products of each phase in the software life cycle. The model provides a base to develop methodologies which emphasize the completeness of the documents, the use of certain disciplines, and the consistency among documents. On the other hand, it is very hard to use the model to develop methodologies which provide 1) the quantitative evaluation of the quality of the documents (products) from each phase, 2) feedback information to help the manager make management decisions, and 3) criteria for redesigning or recoding a system. To ensure the quality of software products, a common basis for more meaningful evaluation leading to better understanding of software quality must be provided.
TYPE-SPECIFIC STORAGE MANAGEMENT (shortened version)
Authors: Daniel Edelson
Venue:  (1993)

This report is a shorter version of UCSC-CRL-93-26. Extensive source code in appendices is omitted from this version.
An Empirical Study of Maintenance Activities in Two Object OrientedSystems
Authors: Wei Li, Sallie M. Henry
Venue:  (1993)

Decades of research on maintenance activities in the procedural paradigm has produced several conclusions. Among these conclusions are recommendations that a reduction in maintenance cost could be achieved by a more controlled design process, by more rigorous testing of potential problem areas earlier in the life cycle. With the increasing emphasis on the object oriented paradigm, the authors performed an empirical study of the maintenance patterns in two commercial object oriented systems. Although this is a preliminary study, intuition is presented as insight into the object oriented maintenance activities.