ppxscal/embedding_network huggingface dataset:
Host Identification in Reliable Distributed Kernels
Authors: Samuel T. Chanson, Ravindran K.
Venue:  (1986)

Acquisition of a host identifier (id) is the first and foremost network level activity initiated by a machine joining a network. It allows the machine to assume an identity in the network and build higher levels of abstraction that may be integrated with those on other machines. In order that the system may work properly, host id''s must satisfy certain properties such as uniqueness. In recent years, distributed systems consisting of workstations connected by a high speed local area network have become popular. Hosts in such systems interact with one another more frequently and in a manner much more complex than is possible in the long haul network environment. The kernels in such systems are called upon to support various inter-host operations, requiring additional properities for host id''s. This paper discusses the implications of these properties with respect to distributed kernel reliability. A new scheme to generate and manage host id''s satisfying the various properties is also presented. The scheme is distributed and robust, and works even under network partitioning.
Protocol Specification and Verification using the Significant Event Temporal Logic
Authors: George K. Tsiknis, Son T. Vuong
Venue:  (1988)

In this report we discuss the Significant Event Temporal Logic specification technique (SIGETL), a method for protocol specification and verification using a temporal logic axiomatic system. This technique is based on the idea that the state and the behaviour of a module can be completely described by the sequence of the significant events with which the module was involved in communicating with its environment till the present time. The behaviour of a module at any time is specified by simple temporal logic formulas, called transition axioms or properties of the module. Both, the safety and liveness properties of a module, as well as the global properties of a system, can be proven from its axioms using the axiomatic temporal logic system. As an example, we apply SIGETL to specify and verify a simple data transfer protocol. The general correspondence between SIGETL and ESTELLE FDT is also discussed.
An Incremental Method for Generating Prime Implicants/Implicates
Authors: Alex Kean, George K. Tsiknis
Venue:  (1988)

Given the recent investigation of clause management systems(CMSs) for Artificial Intelligence applications, there is an urgent need for an efficient incremental method for generating prime implicants. Given a set of clauses $\cal F$, a set of prime implicants $\Pi$ of $\cal F$ and a clause $C$, the problem can be formulated as finding the set of prime implicants for $\Pi \bigcup \{ C \} $. Intuitively, the property of implicants being prime implies that any effort to generate prime implicants from a set of prime implicants will not yield any new prime implicants but themselves. In this paper, we exploit the properties of prime implicants and propose an incremental method for generating prime implicants from a set of existing prime implicants plus a new clause. The correctness proof and complexity analysis of the incremental method are presented, and the intricacy of subsumptions in the incremental method is also examined. Additionally, the role of prime implicants in the CMS is also mentioned.
TEST PATTERN GENERATION FOR REALISTIC BRIDGE FAULTS IN CMOS ICs
Authors: F. J Ferguson, Tracy Larrabee
Venue:  (1991)

Two approaches have been used to balance the cost of generating effective tests for ICs and the need to increase the ICs'' quality level. The first approach favors using high-level fault models to reduce test generation costs at the expense of test quality, and the second approach favors the use of low-level, technology-specific fault models to increase defect coverage but lead to unacceptably high test generation costs. In this report we (1) present the results of simulations of complete single stuck-at test sets against a low-level model of bridge defects showing that an unacceptably high percentage of such defects are not detected by the complete stuck-at test sets; (2) show how low-level bridge fault models can be incorporated into high-level test generation; and (3) describe our system for generating effective tests for bridge faults and report on its performance.
MetaSystems: An Approach Combining Parallel Processing and Heterogeneous Distributed Computing Systems
Authors: Andrew S. Grimshaw, Jon B. Weissman, Emily A. West, Ed Loyot,  Jr.
Venue:  (1992)

Large metasystems comprised of a variety of interconnected high-performance architectures are becoming available to researchers. To fully exploit these new systems, software must be provided that is easy to use, supports large degrees of parallelism in applications code, and manages the complexity of the underlying physical architecture for the user. This paper describes our approach to constructing and exploiting metasystems. Our approach inherits features of earlier work on parallel processing systems and heterogeneous distributed computing systems. In particular, we build on Mentat, an object-oriented parallel processing system developed at the University of Virginia that provides large amounts of easy-to-use parallelism for MIMD architectures.
The Effects of Scaling on Neural Network Classification
Authors: Mylene Pijpers, Mike Alder, Roberto Togneri
Venue:  (1993)

Artificial Neural Networks are often looked upon as black boxes that can be used for classification tasks. Regarding the ANN as a simple tool to do a final classification, the research efforts tend to be concentrated on preprocessing stages, to improve the quality of the input to the neural network. One such preprocessor is the MSECT algorithm by Zahorian and Jagharghi [1]. It improves vowel classification. Since MSECT applies an affine transformation to the data, it is hard to see why this should make any difference to the end result. By implementing and testing the MSECT algoritm, using a simple backpropagation neural network as a tool or standard to measure the amount of neural network training needed to correctly classify two data clusters we confirmed the results of Zahorian and Jagharghi [2]. The simple ANN we used to classify the vowel data was not that simple at all. The preprocessing algorithm changes not only the dimension but also the scale of the vowel data. To perform optimal on the original data and on the preprocessed data the ANN would need different optimal parameters. But because the parameters of the ANN were not modified this preprocessing could result in better results for one of the data sets. An experiment was done with different scalings of the same data sets. For the parameters of the ANN we used, the optimal results in terms of speed of convergence and accuracy were obtained for data scaled to have their input range between 5 and 18.
Who Reuses What? C++ Libraries and Programmer''s Traits
Authors: Mark Lattanzi, Sallie M. Henry
Venue:  (1994)

Software Reuse is one key to increasing productivity within the software development process. By reusing existing software, time and effort are saved in the coding, testing, and maintenance phases of a software product. The goals of this research involve examining the process of software reuse and attempt to characterize it. A set of experiments have been run to determine the effects of software reuse in the object oriented paradigm. This paper focuses on the traits of reusers, what type of reuse they perform, and the common characteristics of the classes being reused. In particular, the traits of programmers who reuse often are identified as well as the traits of those who reuse infrequently. Also, do programmers perform black box reuse (reusing library classes without modification) or do they perform white box reuse (using inheritance to modify a library class to the desired functionality) or do they reuse at all? Lastly, a first attempt at characterizing the reusability of a C++ class is presented. Several traits are identified as making a class more reusable to programmers.
The ADAMS Language: A Tutorial and Reference Manual
Authors: John L. Pfaltz
Venue:  (1993)

This report describes the ADAMS language as it would be used by an applications programmer. It does not describe how ADAMS is implemented. The first three sections assume no knowledge of ADAMS whatever, and are quite tutorial in nature. Only basic, introductory concepts are covered. The remaining sections, although still tutorial, presume some familiarity, e.g. having coded simple programs of the same complexity as those in Section 3. The treatment in these sections is definitive, so that the report can be also used as a reference manual.
Partial Metric Spaces
Authors: S. G. Matthews
Venue:  (1992)

Scott models are topological models of complete partial orders used for Tarskian fixed point semantics of the lambda calculus. As of yet there are no methods for deriving Scott models from specifications of the "complete" objects beyond an arbitrary choice. This paper introduces "partial metrics" for generalising a theory of complete objects into a Scott model including partial objects. 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
Addressing Heterogeneity and Scalability in Layered Multicast CongestionControl
Authors: Sergey Gorinsky, K. K. Ramakrishnan, Harrick Vin
Venue:  (2001)

In this paper, we design SIM, a protocol that integrates three distinct mechanisms - Selective participation, Intra-group transmission adjustment, and Menu adaptation - to solve the general multicast congestion control problem. We argue that only a solution that includes elements of each mechanism can scale and adapt to heterogeneity in network and receiver characteristics. In our protocol, these mechanisms operate at different time scales and distribute the responsibility of adaptation to different entities in the network. Per our knowledge, SIM is the first protocol for layered multicast that adjusts not only the subscription levels of the receivers but also the transmission rates of the layers. We show that SIM is efficient and stable in the presence of heterogeneous receivers and dynamic changes in the bottlenecks and session membership. SIM also outperforms RLM in terms of stability and efficiency.
Managing geotechnics in a mega-project: the Egnatia motorway case in Greece
Authors: S. Lambropoulos, E. Sakoubenta
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

This paper deals with the management of geotechnics in the 680 km long Egnatia motorway project in Greece. It identifies the difficulties in this field and presents the strategic decisions taken by the owner, Egantia Odos S.A., to overcome them and achieve high quality results within the time and budget constraints. It outlines the activities, main and control, of the geotechnics process their pertinent tasks and the various entities involved in each activity in the established management system. It analyses the improvement actions undertaken with respect to the system of the Greek Ministry of Public Works (in the domain of geotechnical investigation, design, and monitoring) and discusses their effectiveness. Finally, it describes a GIS application developed to manage the large amount of technical and contractual data.
Structural optimisation of an orthotropic plate
Authors: D. Tran
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

This paper investigates the optimisation problem of minimizing weight of an orthotropic plate, which consists of a thin plate stiffened by stiffeners arranged symmetrically in two orthogonal directions, such that the maximum Mises stress in the whole structure does not exceed a specified value. The design variables are the thickness of the plate and stiffeners, the positions of stiffeners and depths of stiffeners. Three techniques were used: Subproblem Approximation (SAM), First Order (FOM) and Finite Element Simulation of Durelli's method (FESD). The first two algorithms are available in ANSYS5.7; the third is an adaptation of a shape optimisation technique to this sizing optimisation problem. FESD was shown to take less iteration cycles and give the least optimum mass.
On Closed World Data Bases
Authors: R. Reiter
Venue:  (1977)

Deductive question-answering system generally evaluate queries under one of two possible assumptions which we in this paper refer to as the open and closed world assumptions. The open world assumption corresponds to the usual first order approach to query evaluation: Given a data base DB and a query Q, the only answers to Q are those which obtain from proofs of Q given DB as hypotheses. Under the closed world assumption, certain answers are admitted as a result of failure to find a proof. More specifically, if no proof of a positive ground literal exists, then the negation of that literal is assumed true. In this paper, we show that closed world evaluation of an arbitrary query may be reduced to open world evaluation of so-called atomic queries. We then show that the closed world assumption can lead to inconsistencies, but for Horn data bases no such inconsistencies can arise. Presented at the Workshop on Logic and Data Bases, Toulouse, France, November 16-18, 1977. 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
Transparent Mobility with Minimal Infrastructure
Authors: Praveen Yalagandula, Amit Garg, Mike Dahlin, Lorenzo Alvisi, Harrick Vin
Venue:  (2001)

In this paper, we introduce VIP -- a virtual IP layer -- that applies the principle of virtual addressing to Internet naming. VIP''s goal is to support mobility in a way that is incrementally deployable and that requires little installation or configuration effort. VIP achieves this goal by following two design principles (1) transparent mobility: the system virtualizes the IP level of the protocol stack -- the "neck (of the protocol hourglass" to avoid modifying higher-level network protocols and applications, and (2) minimal infrastructure: the system takes advantage of and minimizes changes to existing network infrastructure. In particular, VIP relies on widely-deployed infrastructure -- DHCP for dynamic IP assignment, Dynamic Secure DNS for updating name-to-IP mappings, and IPSec for secure communication -- rather than requiring deployment of new translation infrastructure. Overall, we find that VIP efficiently supports transparent mobility in a way that an individual
Communicational Measurement
Authors: Kevin A. Mayo, Sallie M. Henry
Venue:  (1991)

A software system is an aggregate of communicating modules. The interfaces supporting module (procedure, etc.) communication characterize the system. Therefore, understanding these interfaces (areas of communication) gives a better description of system complexity. Understanding in an empirical sense implies measuring, and measuring interfaces involves examining both the communicational environment and the exchanged data. There are several different measures associated with the communication environment. Obviously, the structure or nesting level at the communication ping is very interesting. The need to measure the data communicated also raises some very interesting questions concerned with data type and expressional form. This paper reports on the efforts at Virginia Tech to measure, and thus capture, the complexities of software interfaces. Analyzing an Ada system of 85,000 lines of code validated the measures proposed here. The results of this research are very encouraging.
Determination of Intensity Thresholds via Shape Gradients
Authors: Roger Tam, Alain Fournier
Venue:  (2000)

Shape analysis is a vital aspect of medical imaging. The shapes of objects in an image provide high-level information that is essential for many image processing tasks. Accurate analysis of medical images is often dependent upon an appropriate greyscale thresholding of the image for reliable feature extraction. The determination of object thresholds can be a time-consuming task because the thresholds can vary greatly depending upon the quality and type of image. Thus, an efficient method for determining suitable thresholds is highly desirable. This paper presents a method that uses shape information to accurately determine the intensity ranges of objects present in a greyscale image. The technique introduced is based on the computation of the \emph{shape gradient}, a numerical value for the difference in shape. In this case, the difference in shape is caused by the change in threshold value applied to the image. The use of this gradient allows us to determine significant shape change \emph{events} in the evolution of object forms as the threshold varies. The gradient is computed using \emph{Union of Circles} matching, a method previously shown to be effective in computing shape differences. We show the results of applying this method to artificially computed images and to real medical images. The quality of these results shows that the method is potentially viable in practical applications.
Two-Player Games on Cellular Automata
Authors: A. S. Fraenkel
Venue:  (2000)

Cellular automata games have traditionally been solitaire games. We define a two-player cellular automata game played on a finite cyclic digraph G = (V,E). Each vertex assumes a weight w I {0,1}. A move consists of selecting a vertex u with w(u) = 1 and firing it, i.e., complementing its weight and that of a selected neighborhood of u. The player first making all weights 0 wins, and the opponent loses. If there is no last move, the outcome is a draw. The main part of the paper consists of constructing a polynomial strategy. The 3-fold motivation for exploring these games stems from complexity considerations in combinatorial game theory, transforming the hitherto solitaire cellular automata games into two-player games, and the theory of linear error correcting codes.
A Methodology for Using a Default and Abductive Reasoning System
Authors: David Poole
Venue:  (1989)

This paper investigates two different activities that involve making assumptions: predicting what one expects to be true and explaining observations. In a companion paper, a logic-based architecture for both prediction and explanation is proposed and an implementation is outlined. In this paper, we show how such a hypothetical reasoning system can be used to solve recognition, diagnostic and prediction problems. As part of this is the assumption that the default reasoner must be ``programmed'''' to get the right answer and it is not just a matter of ``stating what is true'''' and hoping the system will magically find the right answer. A number of distinctions have been found in practice to be important: between predicting whether something is expected to be true versus explaining why it is true; and between conventional defaults (assumptions as a communication convention), normality defaults (assumed for expediency) and conjectures (assumed only if there is evidence). The effects of these distinctions on recognition and prediction problems are presented. Examples from a running system are given.
Globally Convergent Parallel Algorithm for Zeros of Polynomial Systems
Authors: Alexander P. Morgan, Layne T. Watson
Venue:  (1986)

Certain classes of nonlinear systems of equations, such as polynomial systems, have properties that make them particularly amenable to solution on distributed computing systems. Some algorithms, considered unfavorably on a single processor serial computer, may be excellent on a distributed system. This paper considers the solution of polynomial systems of equations via a globally convergent homotopy algorithm on a hypercube. Some computational results are reported.
Enhanced Schema-Based Transformations for Logic Programs and theirOpportunistic Usage in Program Analysis and Optimisation
Authors: Wamberto W. Vasconcelos, Norbert E. Fuchs
Venue:  (1996)

A program schema is a generic description of a program in a suitable language were its important features can be highlighted and irrelevant details disregarded. In this research note we introduce some enhancements made to the proposal of using program schemata to guide program transformations. These transformations are syntactic alterations carried out in logic programs preserving the meaning of the initial program and improving its execution. By allowing the reference to any argument position within a predicate and introducing extra facilities to address common constructs in a generic fashion a greater number of programs can be abstracted by the same schema. We also describe in this note a realistic context to perform program transformations in which an opportunistic approach is taken during the analysis of a program: every possible way to improve it is attempted, either by examining each procedure in an isolated fashion, or by checking for conjunctions within clauses that can be used as joint specifications.
The Generation of Phrase-Structure Representation from Principles
Authors: David C. LeBlanc
Venue:  (1990)

Implementations of grammatical theory have traditionally been based upon Context-Free Grammar (CFG) formalisms which all but ignore questions of learnability. Even implementations which are based upon theories of Generative Grammar (GG), a paradigm which is supposedly motivated by learnability, rarely address such questions. In this thesis we will examine a GG theory which has been formulated primarily to address questions of learnability and present an implementation based upon this theory. The theory argues from Chomsky''s definition of epistemological priority that principles which match elements and structures from prelinguistic systems with elements and structures in linguistic systems are preferable to those which are defined purely linguistically or non-linguistically. A procedure for constructing phrase-structure representations from prelinguistic relations using principles of node percolation (rather than the traditional $ \overline{X}$-theory of GG theories or phrase-structure rules of CFG theories) is presented and this procedure integrated into a left-right, primarily bottom-up parsing mechanism. Specifically, we present a parsing mechanism which derives phrase-structure representations of sentences from Case- and $\Theta $-relations using a small number of Percolation Principles. These Percolation Principles simply determine the categorial features of the dominant node of any two adjacent nodes in a representational tree, doing away with explicit phrase structure rules altogether. The parsing mechanism also instantiates appropriate empty categories using a filler-driven paradigm for leftward argument and non-argument movement. Procedures modelling learnability are not implemented in this work, but the applicability of the presented model to a computational model of language is discussed. 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