ppxscal/embedding_network huggingface dataset:
Dynamic Scheduling in the Presence of Faults: Specification and Verification
Authors: T. Janowski, M. Joseph
Venue:  (1996)

A distributed real-time program is usually executed on a limited set of hardware resources and is required to satisfy timing constraints, despite anticipated hardware failures. Static analysis of the timing properties of such programs is often infeasible. This paper shows how to formally reason about these programs when scheduling decisions are made on-line and take into account deadlines, load and hardware failures. We use Timed CCS as a process description language, define a language to describe anticipated faults and apply a version of 5-calculus to specify and verify timing properties. This allows the property of schedulability to be the outcome of an equation-solving problem. And unlike conventional reasoning, the logis is fault-monotonic: if correctness is proved for a number of faults, correctness for any subset of these faults is guaranteed.
Derivation and parametric study of a damaged reinforced concrete element
Authors: Y. Liu, C. K. Soh, Y. X. Dong
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

In this paper, the derivation of a 3-D 12-node reinforced concrete element is presented. The element comprises a 2-node rod element, a 4-node interface element and a 10-node concrete element. The latter is developed from an 8-node isoparametric element with an additional displacement mode introduced to account for the shear deformation of concrete around the rebar. The material performances of concrete, reinforcement bar (rebar), and concrete-rebar interface are described using damage mechanics, and three damage scalars are defined for the different materials. The interaction between the concrete weakening and the bond deterioration is also taken into account. Finally, the parameters of these damage scalars are discussed.
On the Serializability Theorem for Nested Transactions
Authors: Rodolfo F. Resende, Amr El Abbadi
Venue:  (1994)

The fundamental theorem of the classical serializability theory states the necessary and sufficient conditions for the conflict serializability of an execution. In this paper, we extend the correctness criteria of the classical theory by presenting a definition of conflict serializability for concurrency control of nested transactions. We define a serialization graph for nested transactions and we prove that its acyclicity is a sufficient and necessary condition for conflict serializability.
Scatter search
Authors: Fred Glover, Manuel Laguna, Rafael Martí
Venue: Advances in evolutionary computing: theory and applications (2003)

The evolutionary approach called scatter search originated from strategies for creating composite decision rules and surrogate constraints. Recent studies demonstrate the practical advantages of this approach for solving a diverse array of optimisation problems from both classical and real--world settings. Scatter search contrasts with other evolutionary procedures, such as genetic algorithms, by providing unifying principles for joining solutions based on generalised path constructions in Euclidean space and by utilising strategic designs where other approaches resort to randomisation. Additional advantages are provided by intensification and diversification mechanisms that exploit adaptive memory, drawing on foundations that link scatter search to tabu search. The main goal of this chapter is to demonstrate the development of a scatter search procedure by demonstrating how it may be applied to a class of non-linear optimisation problems on bounded variables. We conclude the chapter by highlighting key ideas and research issues that offer the promise of yielding future advances.
EXPERIENCE-BASED CREATIVITY
Authors: Robert Levinson
Venue:  (1991)

This paper argues for a computational model of creativity as the unique and favorable combining of past experiences. It is hypothesized that the inner process that combines the experiences is universal and largely syntactic, i.e. it is only the emotional associations that are attached to encoded experience and not the semantic content of experience that is used by the inner creative process. A chess system, "Morph", has been developed that can be viewed as exploring this model. Morph is limited to 1-ply of search, little domain knowledge and no supervised training. It is only through playing another program, and encoding its experience (as "pattern-weight" pairs) that it can improve. Morph''s learning system is a combination of machine learning methods that have been successful in other settings - and is covered in depth. Part of Morph''s strength comes from a powerful representation for chess patterns that allows generalizations across positions (experiences). Performance results, including displays of creativity by Morph, are also presented.
Efficient Determination of Shape from Multiple Images Containing Partial Information
Authors: R. Basri, A. Grove, D. Jacobs
Venue:  (1997)

We consider the problem of reconstructing the shape of a 2-D object from multiple partial images related by scaled translations, in the presence of occlusion. Lindenbaum and Bruckstein have considered this problem in the specific case of a translating object seen by small sensors, for application to the understanding of insect vision. Their solution is limited by the fact that its run time is exponential in the number of images and sensors. We generalize the problem to allow for arbitrary types of occlusion of objects that translate and change scale. We show that this more general version of the problem can be solved in time that is polynomial in the number of sensors, but that even the original problem posed by Lindenbaum and Bruckstein is in fact NP-hard when the number of images is unbounded. Finally, we consider the case where the object is known to be convex. We show that Lindenbaum and Bruckstein''s version of the problem is then efficiently solvable even when many images are used, as is the general problem in certain more restricted cases.
On the Recurrence f>sub/subsub/subsub/subsub/sub< and Applications
Authors: A. S. Fraenkel
Venue:  (1999)

We point out that a natural and direct way of analyzing the recurrence f>sub<m+1>/sub< = b>sub<m>/sub<f>sub<m>/sub<-f>sub<m-1>/sub< is by means of continued fractions theory. Applications to exotic numeration systems and to games are given, and previous examinations of the special case f>sub<m+1>/sub< = 6f>sub<m>/sub<-f>sub<m-1>/sub< are pointed out.
Synthesizers and their Application to Parallel Construction of Pseudo-Random Functions
Authors: M. Naor, O. Reingold
Venue:  (1995)

We present a new cryptographic primitive called pseudo-random synthesizer and show how to use it in order to get a parallel construction of a pseudo-random function. We show an NC1 implementation of synthesizers based on the RSA or the Diffie-Hellman assumptions. This yields the first parallel (NC2) pseudo-random function and the only alternative to the original construction of Goldreich, Goldwasser and Micali (GGM). The security of our constructions is similar to the security of the underlying assumptions. We discuss the connection with problems in Computational Learning Theory.
Geometric Performance Analysis of Mutual Exclusion: The ModelSolution
Authors: Marc Abrams, Ashok Agrawala
Venue:  (1990)

This paper presents an analytic solution to progress graphs used for performance analysis. It derives the exact sequence of blocking and running times experienced by two processes sharing mutually exclusive, reusable resources. A novel application of Dijkstra''s progress graphs yields the complex relationship between the waiting times at each synchronization point. The problem of solving progress graphs is formulated in terms of finding the minimum solution of each of a set of Diophantine equations. An algorithm is presented to find all steady state behaviors involving blocking that emerge from any initial condition.
0-1 LAWS FOR INFINITARY LOGICS
Authors: Phokion G. Kolaitis, Moshe Y. Vardi
Venue:  (1990)

We investigate asymptotic probabilities of properties expressible in the infinitary logic L^omega_{infinity omega} on finite structures. Sentences in this logic may have arbitrary disjunctions and conjunctions, but they involve only a finite number of distinct variables. We show that the 0-1 law holds for L^omega_{infinity omega}, i.e., the asymptotic probability of every sentence in this logic exists and is equal to either 0 or 1. This result subsumes earlier work on asymptotic probabilities for various fixpoint logics and reveals the boundary of 0-1 laws for infinitary logics.
A Basic Interpolation Problem
Authors: H. Dym
Venue:  (1998)

The purpose of this paper is to present a largely self-contained expository introduction to a number of problems in interpolation theory for matrix valued functions which includes the classical problems of Schur, Nevanlinna-Pick (NP) and Caratheodory-Fejer (CF) as special cases. The development will use little more than the elementary properties of vector-valued Hardy spaces of exponent 2. 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
Specification-Modeling Methodologies for Reactive-System Design
Authors: Ambar Sarkar, Ronald Waxman, James P. Cohoon
Venue:  (1995)

The goal of this paper is to investigate the state-of-the-art in specification-modeling methodologies applicable to reactive-system design. By combining the specification requirements of a reactive system and the desirable characteristics of a specification-modeling methodology, we develop a unified framework for evaluating any specification-modeling methodology applicable to reactive-system design. A unified framework allows the designer to look at the spectrum of choices available and quickly comprehend the suitability of a methodology to the specific application. Using the unified framework, we study a number of representative methodologies, identifying their respective strengths and weaknesses when evaluated for the desired characteristics. The differences and relationships between the various methodologies is high lighted. We find our framework to be quite useful in evaluating each methodology. A summary of our observations is presented, together with recommendations for areas needing further research in specification modeling for reactive systems. Two such areas are improving model continuity and providing better complexity control, especially across different abstraction levels and modeling domains. We also present a description of each methodology studied in the unified framework.
Collage, composites, construction
Authors: Mark Bernstein
Venue: Proceedings of the fourteenth ACM conference on Hypertext and hypermedia (2003)

Tinderbox, a hypertext tool for making, analyzing, and sharing notes, explores the use of collage to build and share linked conceptual structures. Adopting a simple, regular data structure that exploits prototype inheritance and transclusion, Tinderbox helps build malleable, personal documents that are partially self-organizing.
Beyond Samuel: evolving a nearly expert checkers player
Authors: David B. Fogel
Venue: Advances in evolutionary computing: theory and applications (2003)

Evolutionary algorithms can be used to learn how to play complex games of strategy without relying on human expertise. Here I discuss the use of evolutionary computation and artificial neural networks in learning how to play checkers. Starting from neural networks that were created randomly, an evolutionary algorithm has been able to craft a network that can play checkers at a nearly expert level. No features beyond the positions of pieces on the board and the piece differential were provided. The evolutionary algorithm learned everything else on its own, simply by playing the game.
Tracing the Efficient Curve for Multi-objective Control-Structure Optimization
Authors: Joanna Rakowska, Robert T. Haftka, Layne T. Watson
Venue:  (1991)

A recently developed active set algorithm for tracing parametrized optima is adapted to multi-objective optimization. The algorithm traces a path of Kuhn-Tucker points using homotopy curve tracking techniques, and is based on identifying and maintaining the set of active constraints. Second order necessary optimality conditions are used to determine nonoptimal stationary points on the path. In the bi-objective optimization case the algorithm is used to trace the curve of efficient solutions (Pareto optima). As an example, the algorithm is applied to the simultaneous minimization of the weight and control force of a ten-bar truss with two collocated sensors and actuators, with some interesting results.
Design of Laminated Plates for Maximum Buckling Load
Authors: Yung S. Sing, Robert T. Haftka, Layne T. Watson, Raymond H. Plaut
Venue:  (1988)

The buckling load of laminated plates having midplane symmetry is maximized for a given total thickness. The thicknesses of the layers are taken as the design variables. Buckling analysis is carried out using the finite element method. The optimality equations are solved by a homotopy method which permits tracing optima as a function of total thickness. It is shown that for any design with a given stacking sequence of ply orientations, there exists a design associated with any other stacking sequence which possesses the same bending stiffness matrix and same total thickness. Hence, from the optimum design for a given stacking sequence, one can directly determine the optimum design for any rearrangement of the ply orientations, and the optimum buckling load is independent of the stacking sequence.
Preconditioned Iterative Methods for Sparse Linear Algebra Problems Arising in Circuit Simulation
Authors: William D. McQuain, Calvin J. Ribbens, Layne T. Watson, Robert C. Melville
Venue:  (1992)

The DC operating point of a circuit may be computed by tracking the zero curve of an associated artificial-parameter homotopy. Homotopy algorithms exist that are globally convergent with probability one for the DC operating point problem. These algorithms require computing the one-dimensional kernel of the Jacobian matrix of the homotopy mapping at each step along the zero curve, and hence the solution of a linear system of equations at each step. These linear systems are typically large, highly sparse, non-symmetric and indefinite. Several iterative methods which are applicable to such problems, including Craig''s method, GMRES(k), BiCGSTAB, QMR, KACZ, and LSQR, are applied to a suite of test problems derived from simulations of actual bipolar circuits. Preconditioning techniques considered include incomplete LU factorization (ILU), sparse submatrix ILU, and ILU allowing restricted fill in bands or blocks. Timings and convergence statistics are given for each iterative method and preconditioner.
Attainable Resource Allocation Bounds
Authors: Emile K. Haddad
Venue:  (1990)

Upper and lower bounds attained by the variables of a generalized resource allocation problem are distinguished from the a priori specified bounds defining the feasible set. General theoretical criteria directly relating the attainable bounds to the specified bounds are presented, which are computationally superior to the traditional "modified simplex method". An efficient algorithm is presented, and its computational complexity is analyzed.
The Availability of Quorum Systems
Authors: D. Peleg, A. Wool
Venue:  (1993)

A quorum system is a collection of sets (quorums) every two of which have a nonempty intersection. Quorum systems have been used for a number of applications in the area of distributed systems. In this paper we study the fault-tolerance properties of quorum systems, and their implications on quorum based distributed protocols.
More About Recursive Structures: Descriptive Complexity and Zero-One Laws
Authors: T. Hirst, D. Harel
Venue:  (1996)

This paper continues our work on infinite, recursive structures. We investigate the descriptive complexity of several logics over recursive structures, including first-order, second-order, and fixpoint logic, exhibiting connections between expressibility of a property and its computational complexity. We then address 0-1 laws, proposing a version that applies to recursive structures, and using it to prove several non-expressibility results.
Retracts of Numerations --- out of print
Authors: K, Akira a
Venue:  (1986)

In this paper we study some important properties of numerations which can be passe to their retracts. Furthermore we show a sufficient condition for a category $Ret(\alpha)$ of retracts of a numeration $\alpha$ and morphisms to be Cartesian closed, in terms of $\alpha$.
Edge-Packing Planar Graphs by Cyclic Graphs
Authors: Heath Lenwood S., Vergara John Paul C.
Venue:  (1996)

Maximum G Edge-Packing is the problem of finding the maximum number of edge-disjoint isomorphic copies of a fixed guest graph G in a host graph H. This paper considers the cases where G and H are planar and G is cyclic. Recent work on the general problem is surveyed, inadequacies and limitations in these results are identified, and NP-completeness proofs for key cases are presented.
A NOTE ON DESIGNING TWO-LEVEL CARRY-SKIP ADDERS
Authors: Pak K. Chan, Martine D. F. Schlag
Venue:  (1990)

The worst-case carry propagation delays in carry-skip adders depend on how the full adders are grouped together (into blocks). We report an algorithm to configure 2-level carry-skip adders. The worst-case carry propagation delay of the carry-skip adder configurations determined by our algorithm are consistently *less* than the ones currently reported in the literature. Previous methods are applicable only to constant skip delay models and either do not guarantee an optimal configuration or suffered from a potentially exponential worst-case time complexity.
A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction
Authors: D. Peleg, Vitaly Rubinovich
Venue:  (1999)

This paper presents a lower bound of [(W)\tilde](D+On) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of diameter D = W(logn), in the bounded message model. This establishes the asymptotic near-optimality of existing time-efficient distributed algorithms for the problem, whose complexity is O(D + On log* n).
Vision Servers and Their Clients
Authors: James J. Little
Venue:  (1994)

Robotic applications impose hard real-time demands on their vision components. To accommodate the real-time constraints, the visual component of robotic systems are often simplified by narrowing the scope of the vision system for a particular task. Another option is to build a generalized vision (sensor) processor and provides multiple interfaces, of differing scales and content, to other modules in the robot. Both options can be implemented in many ways, depending on computational resources. The tradeoffs among these alternatives become clear when we study the vision process as a server whose clients request information about the world. We model the interface on client-server relations in user interfaces and operating systems. We examine the relation of this model to robot and vision sensor architecture and explore its application to a variety of vision sensor implementations.
A POOR MAN''S WATCHPOINTS
Authors: Max Copperman, Jeff Thomas
Venue:  (1994)

Bugs that result from corruption of program data can be very difficult to track down without specialized help from a debugger. If the debugger cannot help the user find the point at which data gets corrupted, the user may have a long iterative debugging task. If the debugger is able to stop execution of the program at the point where data gets corrupted, as with watchpoints (also known as data breakpoints), it may be a very simple task to find a data corruption bug. In this paper, we discuss a method of implementing watchpoints on a system without hardware watchpoint support. By instrumenting the program code to check memory accesses, and supplying an interface to the instrumentation in the debugger, we provide an efficient, general method of implementing watchpoints. (Supersedes ucsc-crl-93-12)
Simulation Model Development: The Multidimensionality of the Computing Technology Pull
Authors: Osman Balci, Richard E. Nance
Venue:  (1988)

Recent computing advances in artificial intelligence, computer graphics, human-computer inter-face, networking, parallel processing, and software engineering pull simulation model development in different directions. This paper discusses the impacts of significant advances in these areas on simulation model development, overviews how our Simulation Model Development Environment design is influenced by the recent advances, and speculates on the impacts of predicted future advances in these areas on simulation model development. The paper concludes that the computing advances in the six areas can be integrated under a simulation environment to provide an extremely powerful platform for simulation model development and execution.
Optimal and Approximate Stochastic Planning using Decision Diagrams
Authors: Robert S Jesse Hoey
Venue:  (2000)

Structured methods for solving factored Markov decision processes (MDPs) with large state spaces have been proposed recently to allow dynamic programming to be applied without the need for complete state enumeration. We present algebraic decision diagrams (ADDs) as efficient data structures for solving very large MDPs. We describe a new value iteration algorithm for exact dynamic programming, using an ADD input representation of the MDP. We extend this algorithm with an approximate version for generating near-optimal value functions and policies with much lower time and space requirements than the exact version. We demonstrate our methods on a class of large MDPs (up to 34 billion states). We show that significant gains can be had with our optimal value iteration algorithm when compared to tree-structured representations (with up to a thirty-fold reduction in the number of nodes required to represent optimal value functions). We then demonstrate our approximate algorithm and compare results with the optimal ones. Finally, we examine various variable reordering techniques and demonstrate their use within the context of our methods.
Decomposing Rectilinear Figures into Rectangles
Authors: Ritu Chadha, Donald C. S. Allison
Venue:  (1988)

We discuss the problem of decomposing rectilinear regions, with or without holes, into a minimum number of rectangles. There are two different problems considered here: decomposing a figure into non-overlapping parts, called partitioning, and decomposing a figure into possibly overlapping parts, called covering. A method is outlined and proved for solving the above two problems, and algorithms for the solutions of these problems are presented. The partitioning problem can be solved in time O(n-to the 5/2), where n is the number of vertices of the figure, whereas the covering problem is exponential in its time complexity.