ppxscal/embedding_network huggingface dataset:
An Analysis of Conjunctive Goal Planning
Authors: David E. Joslin, John W. Roach
Venue:  (1986)

This thesis develops a formal theory of planning, using a simple paradigm of planning that has been previously explored in work such as GPS, HACKER, STRIPS and NOAH. This thesis analyzes the goal interactions that occur when the goal is stated as a conjunction of subgoals. In this analysis we assume that the problem has a finite state space, and that operators are reversible. Graph theory can be used to characterize these subgoal interactions. The entire state space is treated as a graph, and each subgoal or conjunction of subgoals defines a subgraph. Each subgraph is composed of one or more connected components. Solving each subgoal by choosing a connected component that contains a final goal state is a necessary and sufficient condition for solving any planning problem. In the worst case, analyzing goal interactions is shown to be no more effective than enumerating the state space and searching. This complexity proves that no complete algorithm can solve all planning problems in linear time. The technique of goal ordering is analyzed, along with several extensions to that technique. While a generalization of goal ordering is possible, in the worst case generating the goal order requires as much computation as solving the problem by a brute-force search. A technique called capability analysis, derived from the connect component results, uses first-order logic to find the constraints that must apply as subgoals are achieved. A partial implementation uses counterfactual logic to identify the components of a world state that prevent the remaining subgoals from being achieved.
Documentation Production Under Next Generation Technologies
Authors: Richard E. Nance, Benjamin J. Keller, Dave B. Boldery
Venue:  (1989)

This paper describes the development of the Abstraction Refinement Model as a basis for linking the development and maintenance tasks in software systems. Documentation is critical in both efforts, and the reliance on development documentation during maintenance is characterized by the model and through a characterization of the development documentation requirement stipulated under DoD-STD-2167A. The Abstraction Refinement Model enables a coherent characterization of the reverse engineering requirements generally caused by a faulty or inadequately documented development process. Within the context of the model, the Automated Document Design System (ADDS) is characterized, and the system is evaluated with regard to its current capabilities versus future potential. A set of recommendations regarding ADDS concludes the report.
Transformations of Antimatroid Closure Spaces
Authors: John L. Pfaltz, John E. Karro
Venue:  (1998)

Investigation of the transformations of vector spaces, whose most abstract formulations are called matroids, is basic in mathematics; but transformations of discrete spaces have received relatively little attention. This paper develops the concept of transformations of discrete spaces in the context of antimatroid closure spaces. The nature of these transformations are quite different from those encountered in linear algebra because the underlying spaces are strikingly different. The transformation properties of "closed", "continuous" and "order preserving" are defined and explored. The classic graph transformations, homomorphism and topological sort, are examined in the context of these properties. Then we define a deletion which we believe plays a central role in discrete transformations. Antimatroid closure spaces, when partially ordered, can be interpreted as lattices. We show that deletions induce lower semihomomorphisms between the corresponding lattices. 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
EFFICIENT FAIR-QUEUEING ALGORITHMS FOR ATM AND PACKET NETWORKS
Authors: Dimitrios Stiliadis, Anujan Varma
Venue:  (1995)

Although Weighted Fair Queueing is regarded as an ideal scheduling algorithm in terms of its delay and fairness properties, its computation complexity is asymptotically linear in the number of connections serviced by the scheduler, thus making its implementation prohibitively expensive in high-speed networks. An algorithm that combines the delay and fairness bounds of Weighted Fair Queueing with 0(1) timestamp computations had remained elusive so far. In this paper, we present two novel scheduling algorithms that have 0(1) complexity for timestamp computations, and provide the same bounds on end-to-end delay and buffer requirements as those of Weighted Fair Queueing. The first algorithm, Frame-based Fair Queueing, uses a framing mechanism to periodically re-calibrate a global variable tracking the progress of work in the system, limiting any short-term unfairness to within a frame-period. The second algorithm, Starting Potential-based Fair Queueing (SPFQ), performs the re-calibration at packet boundaries, resulting in a fairness bound that is equal to that of Weighted Fair Queueing, still maintaining the 0(1) timestamp computations. This improved fairness bound is achieved at the expense of a slightly higher implementation cost. Thus, SPFQ is attractive over FFQ in those applications where its improved fairness properties justify the additional implementation cost. The algorithms may be used in both general packet networks with variable packet sized and in Asynchronous Transfer Mode (ATM) networks. Both algorithms are based on the general framework of rate-proportional servers (RPS) introduced in [11]. Details of hardware implementation of both algorithms are presented for use in an ATM network.
Assessment of an Architectural Approach to Large-Scale Systematic Reuse
Authors: Kevin J. Sullivan, John C. Knight
Venue:  (1995)

Large-scale systematic reuse promises rapid development of significant systems through straightforward composition of large-scale existing assets. The realization of this promise would provide major benefits in many areas. For example, sophisticated software-engineering tools could be developed rapidly and inexpensively to deliver promising software engineering research results into practice. To date the promise of large-scale reuse remains largely unrealized. Although some successes have been achieved, barriers remain in a variety of areas: technical, managerial, cultural, and legal. In this paper we address an important technical barrier: architectural mismatch. Architectural mismatch has been identified as an important barrier to large-scale reuse. Recently architectural frameworks that purport to enable large-scale reuse have been developed. Among them is Microsoft''s OLE technology, comprising both an architectural framework and a suite of reusable component applications. The manufacturer presents this technology as a toolkit for the rapid development of applications from components. In reviewing these component applications, we observed that they offer rich features applicable to a number of domains, and not merely management information systems or data processing. The components are both designed for reuse and also seem to span the spectrum of capabilities required to build a wide variety of applications. The capabilities include relational database management, graphical user interface construction, compound document design and storage, constraint-based structured interactive graphics, and diverse computational models, including spreadsheets and general-purpose imperative programming in languages such as C++. In this paper we evaluate the approach to large-scale systematic reuse represented by OLE. We conclude that, although difficulties remain, such an approach is practical now in many domains, that it substantially overcomes the architectural impediments that have hindered some previous attempts at large-scale reuse, and that it represents significant progress towards realizing the promise of rapid development of sophisticated systems. We report on our prototyping approach to the evaluation of this technology. Our evaluation focused on the ability of the technology to support the development of software engineering tools. We define our evaluation framework, describe our experience developing a specific tool, and present conclusions of our evaluation.
Design: Educational Multi-Player Games A Literature Review
Authors: Joanna McGrenere
Venue:  (1996)

Over the past two decades electronic games have become ingrained in our culture Children''s fixation with these games initially alarmed parents and educators, but educational researchers soon questioned whether the motivation to play could be tapped and harnessed for educational purposes. A number of educational electronic games have been developed and their success has been mixed. The great majority of these games are designed for singler players; it there is more than one player, the players are usually required to take turns playing. Althought learning within a cooperative group setting has been found to be extremely effective, designing educational games to support multiple players working together has received little atention. using a multi-player game format could provide the motivation that children need to learn and at the same time enhance both the achievement and the social interactions of the children. In order to design multiplayer educational games we must understand what motivates children to play electronic games, how to incoporate educational content into electronic games, and how to develop appropriate multi-person educational tasks. An understanding of design issues for multi-user software is also required. This essay is a literature review that addresses the issues involved in the design of educational electronic multi-player games. The relevant bodies of literature include human-computer interaction, electronic games, educational electronic games, electronic multi-player games. Two of the most relevant areas of the human-computer interaction literature are Computer-Supported Cooperative Work (CSCW) and Computer-Supported Collaborative Learning (CSCL). All of the bodies of literature are discussed with respect to educational electronic multiplayer games, areas where further research is required are noted, and gegneral design guidelines for educational eelectronic multi-player games are offered.
A METHODOLOGY FOR CHARACTERIZING CELL TESTABILITY (Ph.D. Thesis)
Authors: Alvin L Jee
Venue:  (1996)

Integrated circuits (ICs) are continually increasing in complexity. As IC complexity increases, the cost of testing the IC also increases. As a result, IC designers are expending greater amounts of effort on designing the ICs to be more easily tested. Most of the work done in measuring the testability of ICs and modifying the ICs to improve testability has been focused at the schematic level. This dissertation defines a metric for measuring the testability of cells used in ICs at the physical design level. This testability metric takes into account the three major influences on testability: the physical design, the circuit schematic, and the methods used to test the circuit. IC designers can use this testability metric as a guide for modifying the physical design of logic cells to increase their testability. This dissertation shows that, for standard cell designs, designing the cells to be more testable will have a larger impact on the testability of the circuit than designing other parts of the circuit. Thus, the testability metric described here concentrates on the cells used in standard cell designs. This dissertation describes an implementation of the testability metric. This dissertation applies the metric to two cells from a standard cell library to demonstrate how cell testability can be used to guide the modification of the cell''s physical design to improve its testability.
EFFICIENT LEARNING WITH VIRTUAL THRESHOLD GATES
Authors: Wolfgang Maass, Manfred Warmuth
Venue:  (1995)

We reduce learning simple geometric concept classes to learning disjunctions over exponentially many variables. We then apply an on-line algorithm called Winnow whose number of prediction mistakes grows only logarithmically with the number of variables. The hypotheses of Winnow are linear threshold functions with one weight per variable. We find ways to keep the exponentially many weights of Winnow implicitly so that the time for the algorithm to compute a prediction and update its ``virtual'''' weights is polynomial. Our method can be used to learn d-dimensional axis-parallel boxes when d is variable, and unions of d-dimensional axis-parallel boxes when d is constant. The worst-case number of mistakes of our algorithms for the above classes is optimal to within a constant factor, and our algorithms inherit the noise robustness of Winnow. We think that other on-line algorithms with multiplicative weight updates whose loss bounds grow logarithmically with the dimension are amenable to our methods.
Complexity classes in models of cellular computing with membranes
Authors: Mario J. Péerez Jiménez, álvaro Romero Jiménez, Fernando Sancho Caparrini
Venue: Natural Computing: an international journal (2003)

In this paper we introduce four complexity classes for cellular computing systems with membranes: the first and the second ones contain all decision problems solvable in polynomial time by a family of deterministic P systems, without and with an input membrane, respectively; the third and fourth classes contain all decision problems solvable in polynomial time by a family of non-deterministic P systems, without and with an input membrane, respectively. We illustrate the usefulness of these classes by solving two NP&ndash;complete problems, namely HPP and SAT, in both variants of P systems.
A REPLICATED MONITORING TOOL
Authors: Darrell D. E. Long
Venue:  (1992)

Modeling the reliability of distributed systems requires a good understanding of the reliability of the components. Careful modeling allows highly fault-tolerant distributed applications to be constructed at the least cost. Realistic estimates can be found by measuring the performance of actual systems. An enormous amount of information about system performance can be acquired with no special privileges via the Internet. A distributed monitoring tool called a tattler is described. The system is composed of a group of tattler processes that monitor a set of selected hosts. The tattlers cooperate to provide a fault-tolerant distributed data base of information about the hosts they monitor. They use weak-consistency replication techniques to ensure their own fault-tolerance and the eventual consistency of the data base that they maintain. 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 Comparative Study of Two Whole Program Slicers for C
Authors: Leeann Bent, Darren C. Atkinson, William G. Griswold
Venue:  (2001)

Recently, a few whole-program static slicers for the C programming language have been developed, permitting a variety of hypotheses about time--precision tradeoffs in program analysis for software engineering to be tested. This paper reports an initial investigation into these claims through GrammaTech''s CodeSurfer and UCSD''s Sprite research prototype, which represent two very different approaches in the program analysis tool design space. First, it was found that algorithmic superiority tended to provide large improvements in relative precision in select cases. Second, a number of non-algorithmic design choices had a substantial and sometimes unintuitive influence on slice results. Third, considerable expertise and time was required to discern the reasons why a particular statement appeared in a slice, diminishing the slice''s probable usefulness. These results provide recommendations for future tool design.
Automatically Generated Test Frames from a Q Specification of ICAO Flight Plan Form Instructions
Authors: Michael R. Donat
Venue:  (1998)

A partially automated process for generating tests has been experimentally applied to a portion of a real world system-level requirements specification. This paper discusses the problems addressed by this process along with how and why this automation was achieved. The requirements were formalized using a notation designed to be readable by a large proportion of requirements stakeholders. This report also addresses traceability of requirements to tests and introduces the requirements specification language Q.
The Immune System as a Reactive System: Modeling T Cell Activation with Statecharts,
Authors: N. Kam, I. R. Cohen, D. Harel
Venue:  (2001)

The construction of reliable reactive systems is considered to be one of the most challenging goals in the fields of software and system engineering. The definition of a reactive system suits biological systems at different levels, ranging from gene networks, developing embryos and the immune system. We report here the application of a tool developed for constructing computerized systems to the modeling and analysis of a biological system, the immune system. We use the language of statecharts within the framework of object-oriented modeling. The results described here indicate that this modeling strategy can contribute to the transition of biology from the phase of analysis to the phase of synthesis.
A study of the effect of crack propagation and fracturing on rock slope stability analysis by discontinuous deformation analysis
Authors: R. Naderi
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

This paper presents a method for determining the effect of crack propagation and fracturing in rock slope stability analysis. Discontinuous Deformation Analysis is a newly developed method and was first introduced by Shi in 1988.In this work for determining the effect of fracturing in dynamic stability analysis of slopes some modification to the original method have been developed and implemented to the program. Now this modified DDA program can evaluate the effect of fracturing and cracking of rock blocks on failure analysis of this sort of problem. Finally with some simple examples the capability of this new method has been showed.
An Extensional Treatment of Lazy Data Flow Deadlock
Authors: S. G. Matthews
Venue:  (1993)

In An Extensional Treatment of Dataflow Deadlock [Wa81] Wadge introduced an elegant non operational test for proving that many of Kahn''s data flow message passing networks [Ka74] must be free of deadlock; a test that "should extend to a much wider context" in the study of program correctness. Such a context has now been provided with the introduction of partial metric spaces [Ma92]. These spaces can be used to describe semantic domains such as those used in lazy data flow languages [W &A85]. This paper develops Wadge''s ideas on establishing an extensional theory of program correctness by using partial metric spaces to give a non operational treatment of lazy data flow deadlock. 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
Steady Viscous Flow in a Trapezoidal Cavity
Authors: William D. McQuain, Calvin J. Ribbens, C. Y. Wang, Layne T. Watson
Venue:  (1992)

The flow in a trapezoidal cavity (including the rectangular and triangular cavities) with one moving wall is studied numerically by finite differences with special treatment in the corners. It is found that streamlines and vorticity distributions are sensitive to geometric changes. The mean square law for core vorticity is valid for the rectangle but ceases to be valid for the triangular cavity.
Calvin and Hobbes
Authors: Sok G Lim, Mike Alder
Venue:  (1995)

The work described in this paper originated in a syntactic method for recognising moving human heads in video images, as described in Lim, Alder and deSilva : Syntactic Pattern Classification of Moving Objects in a Domestic Environment, pp75-90 of Pattern Recognition in Practice IV, Elsevier, 1994. In order to test the generality of the method, it was employed, without essential change, to the problem of distinguishing between the outlines of the well known cartoon characters Calvin and Hobbes. The significant point is that the method abstracts the features used in classification automatically, with human intervention limited to a few parameter choices, which were in any case determined by quite different data.
Impact of Media Exchanges in Robotic Libraries
Authors: Sunil Prabhakar, Divyakant Agrawal, Amr El Abbadi
Venue:  (1997)

The large storage requirements of many commerical and scientific applications cannot be met by magnetic disks due to their high cost and low storage density. Consequently, cheaper and more dense tertiary storage systems are being intergrated into the storage hierarchies of these applications. Although tertiary storage can accomodate large amounts of data, the access latency is very high due to the need to load and unload media from the read/write drives. These media exchanges are very slow with typical times in the order of tens of seconds. In order to reduce this high latency research efforts have focussed on minimizing media exchanges under the assumption that it is always beneficial to eliminate exchanges. We analyze the validity of this assumption. It is shown that there are instances when the assumption does not hold. It is further shown that various factors influence the effect of an exchange, making it difficult to establish simple heuristics for scheduling media exchanges. Simulation is used to validate the theoretical results.
Curve and Corner Extraction using the Multiresolution Fourier Transform
Authors: A. R. Davies, R. G. Wilson
Venue:  (1991)

A novel method of segmenting images into regions which contain linear or circular arc features is presented. The feature models are based upon spectral properties, local estimates of which are provided, over a range of scales, by the Multiresolution Fourier Transform (MFT). The algorithm ensures that detected features both accurately model the data and are consistent across scale. A method of combining the primitive line and arc segments into more complex features is also considered. Some results from application of the algorithm to a number of natural and synthetic images are presented to illustrate its effectiveness in practical applications.
Scalable Measurement: Finding some Elephants in a Swarm of Ants
Authors: Cristian Estan, George Varghese
Venue:  (2001)

While the number of concurrent flows passing through backbone routers is large (more than 250,000), measurements show a small number of flows (say 10%) represent a large fraction of the traffic. Thus a desirable goal for a measurement algorithm at a backbone router is to identify (say) the top 10% of the flows using not much more than 10% of the memory needed to keep track of all flows. A similar goal would be to determine any flows that use more than (say) 1% of the link bandwidth (to catch hot spots) using only a small amount of high speed memory. Keeping state for each flow (to tell whether a flow is ``large'''') is ruled out. Our paper describes an algorithm for identifying large flows using small memory and small per packet processing bounds. Our algorithm scales well even with increases in bandwidth and number of flows.