ppxscal/embedding_network huggingface dataset:
An Introduction to Formal Hardware Verification
Authors: Carl Seger
Venue:  (1992)

Formal hardware verification has recently attracted considerable interest. The need for ``correct'''' designs in safety-critical applications, coupled with the major cost associated with products delivered late, are two of the main factors behind this. In addition, as the complexity of the designs increase, an ever smaller percentage of the possible behaviors of the designs will be simulated. Hence, the confidence in the designs obtained by simulation is rapidly diminishing. This paper provides an introduction to the topic by describing three of the main approaches to formal hardware verification: theorem-proving, model checking and symbolic simulation. We outline the underlying theory behind each approach, we illustrate the approaches by applying them to simple examples and we discuss their strengths and weaknesses. We conclude the paper by describing current on-going work on combining the approaches to achieve multi-level verification approaches.
Automated Identification of Southern Right Whales
Authors: Bruce Cooper, Mike Alder
Venue:  (1994)

In this dissertation, we look at the problem of automated identification of Southern Right Whales. This is intended as a feasibility study, to see if a commercial system is viable. We look at several different methods for creating a program to achieve this, with special interest being paid to structural methods, which use the relationships between features to aid in the search. Other commercial systems rely on human interaction to achieve satisfactory success rates. Our project attempts to create a fully automated system, requiring no human input. Although initial results are somewhat less than that gained by human assisted systems, the results are encouraging. It is expected that, given more time to research, a successful system could be created.
Issues Related to the Explication of Process-Product Relationships in DoD-Std-21677 and DoD-Std-2168
Authors: Gregory R. Lavender
Venue:  (1988)

This paper is a discussion of issues related to the thesis entitled, "The Explication of Process-Product Relationships in DoD-STD-2167 and DoD-STD-2168 via an Augmented Data Flow Diagram Model." In particular, the major results of the above thesis are viewed in light of the draft standards DoD-STD-2167 and DoD-STD-2168 (both dated 1 April 1987), and the issue of development objectives is explored. The ideas presented in this paper represent the author''s opinion and are speculative in nature due to the fact that, at present, the revised DoD standards are in draft form, and the issue of development objectives has not yet been thoroughly investigated.
Three-Dimensional Analysis of Scoliosis Surgery Using Stereophotogrammetry
Authors: Stanley B. Jang, Kellogg S. Booth, Chris W. Reily, Bonita J. Sawatzky, Stephen J. Tredwell
Venue:  (1994)

Scoliosis is a deformity characterized by coronal, sagittal and axial rotation of the spine. Surgical instrumentation (metal pins and rods) and eventual fusion are required in severe cases. Assessment of the correction requires enough accuracy to allow rational proactive planning of individual interventions or implant design. Conventional 2-D radiography and newer 3-D CT scanning do not provide this accuracy. A new stereophotogrammetric analysis and 3-D visualization allow accurate assessment of the scoliotic spine during instrumentation. Stereophoto pairs taken at each stage of the operation and robust statistical techniques are used to compute 3-D transformations of the vertebrae between stages. These determine rotation, translation, goodness of fit, and overall spinal contour. A polygonal model of the spine using a commercial 3-D modeling package is used to produce an animation sequence of the transformation. The visualizations have provided some important observations. Correction of the scoliosis is achieved largely through vertebral translation and coronal plane rotation, contrary to claims that large axial rotations are required. The animations provide valuable qualitative information for surgeons assessing the results of scoliotic correction. A detailed study of derotation provided by different instrumentation systems and the assessment of hook position patterns is underway.
Determining Object Orientations from Run Length Encodings
Authors: Visvanathan Ramesh, Roger W. Ehrich
Venue:  (1987)

Run length codes are widely used for image compression, and efficient algorithms have been devised for identifying objects and calculating geometric features directly from these codes. However, if the image objects are rotated it can be difficult to determine their orientation and position so that they can be grasped by manipulators. This paper describes a method for structural determination of object orientation directly from the run length codes of successive image scan lines. An algorithm is described that makes use of the equations of object boundary segments to form hypotheses about object orientations that are refined as scanning progresses. 2-dimensional polygonal objects are discussed, and it is assumed that objects do not touch or overlap, although the algorithm could be extended to include those situations.
Complexity Results for Multi-Pebble Automata and their Logics
Authors: N. Globerman, D. Harel
Venue:  (1994)

Multi-pebble automata are considered, appropriately restricted to accept only regular languages, and enriched with additional features, such as nondeterminism and concurrency. We investigate the succinctness of such machines, and the extent to which this succinctness carries over to make the reasoning problem in propositional dynamic logic (PDL) more difficult. The two main results establish that each additional pebble provides inherent exponential power on both fronts.
The Effect of Task Uncertainty and Decentralization on Project Team Performance
Authors: Jisung Kim, Richard M. Burton
Venue: Computational Mathematical Organization Theory (2002)

This paper investigates relationships among task uncertainty, level of centralization, and project team performance. Team performance is measured in three dimensions: cost, time, and quality. Adopting an information processing view and contingency theory, the authors discuss tradeoffs among the three performance dimensions of a project team. Results from the simulation study indicate that, under high task uncertainty, a decentralized team performs better in terms of cost and time, but a centralized team performs better in terms of quality. Under low task uncertainty, there is no performance difference between a centralized team and a decentralized team in terms of cost and time, but a centralized team performs better in terms of quality. The paper suggests that researchers pay attention to the relative impact of centralization and decentralization on different dimensions of organizational performance, and managers adopt an organizational structure that performs better in a performance dimension that counts more to enhance overall performance.
Typed Recursion Theorems --- out of print
Authors: K, Akira a
Venue:  (1985)

In recursion theory, recursion theorems are usually considered for effective functions over an effective universal set, like the set $N$ of all natural numbers or the set $RE$ of all recursively enumerable sets. We observe that certain effective subsets of these effective universes have rich structure, and we study recursion theorems for these effective subsets.
Quadratic Neural Networks
Authors: Mike Alder, Sok G Lim, Paul Hadingham, Yianni Attikiouzel
Venue:  (1990)

This paper offers a new model for neural nets and a new^C algorithm for training them. It produces results several orders to magnitude better than backpropagation. It is shown how it can plausibly be regarded as a second order appoximation to biological neurons.
Software Security Using Software Dynamic Translation
Authors: Kevin Scott, Jack Davidson
Venue:  (2001)

Software dynamic translation (SDT) is a technology that allows programs to be modified as they are running. Researchers have used SDT with good success to build a variety of useful software tools (e.g., binary translators, operating system simulators, low-overhead profilers, and dynamic optimizers). In this paper, we describe how SDT can be used to address the critical problem of providing software security. The paper shows how SDT can simply and effectively implement arbitrary user-specified software safety policies. Unlike static analysis techniques which typically process source code, SDT is applied to binary code. Consequently, SDT can handle untrusted binaries and unsecured libraries from any source. To demonstrate and validate that SDT provides additional security, we have implemented a software security API for Strata, our software dynamic translation infrastructure. The API, while simple, allows clients to implement powerful policies to prevent potential security violations. To illustrate the use of Strata and the security API, the paper provides implementations of several interesting and useful security policies.
Feedback Control Real-Time Scheduling: Framework, Modeling, and Algorithms
Authors: Chenyang Lu, John A. Stankovic, Gang Tao, Sang H. Son
Venue:  (2001)

This paper presents a feedback control real-time scheduling (FCS) framework for adaptive real-time systems. An advantage of the FCS framework is its use of feedback control theory (rather than ad hoc solutions) as a scientific underpinning. We apply a control theory based design methodology to systematically design FCS algorithms to satisfy their transient and steady state performance specifications. In particular, we establish a dynamic model and performance analysis of several feedback control scheduling algorithms, which is a major challenge and key step for the control design of adaptive real-time systems. We also generalize a FCS architecture that allows plug-ins of different real-time scheduling policies and QoS optimization algorithms. Based on our model, we identify different types of real-time applications where each FCS algorithm can be applied. Performance evaluation results demonstrate that our analytically tuned FCS algorithms provide robust steady and transient state performance guarantees for periodic and aperiodic tasks even when the task execution time varied considerably from the estimation.
Automatic Optimisation of the Modified Probabilistic Neural Network for Pattern Classification and Time Series Analysis
Authors: Anthony Zaknich, Yianni Attikiouzel
Venue:  (1993)

Abstract unavailable.
Evolution of Organizational Performance and Stability in a Stochastic Environment
Authors: Bennett Levitan, José Lobo, Richard Schuler, Stuart Kauffman
Venue: Computational Mathematical Organization Theory (2002)

In this study of optimal organizational performance, we explore how the extent of interactions, both within and among other organizations, affects group performance and stability in a stochastic environment. We have refined a modeling framework (Kauffman and Johnsen's NKC model) so that group size and connections among groups (externalities) can be finely tuned. The search for improved group configurations is modeled as a random walk on a space of possible configurations whereby agents in a group periodically have the opportunity to accept or reject random changes in their characteristics. By controlling which groups have external connections with which other groups, and the magnitude of such connections, we can manipulate the topology of the problem&mdash;the web of interactions within and between groups. We present numerical results showing that optimal group size relates to the magnitude of externalities and the accumulated number of random trials. Our main result suggests that for short periods with few trials, large organizations perform best, while for longer time horizons, the advantage accrues to small sized groups with a small number of externalities. However, over these long time horizons, as the extent of external connections increases, modest increases in group size enhances their performance. Under all circumstances, organizations that perform best in the long run fall into a regime of largely stable responses to perturbations, which however, borders on a region of instability.
An Introduction to Visualizing Program Execution Dynamics with Chitra
Authors: Marc Abrams, Naganand Doraswamy
Venue:  (1992)

We describe a tool called Chitra, which serves two purposes. First, Chitra visualizes program execution sequences (PES''s) collected by monitoring parallel and distributed program execution in the time, event, and frequency domains. Second, Chitra produces an empirical model of a PES. A case study applies Chitra to predict and evaluate the efficiency and fairness of a resource sharing algorithm at a range of parameter values, given observations of a few parameter values. Inefficient behavior is explained by examining the states that constitute the stochastic process model constructed by Chitra.
Prescriptions: A Language for Describing Software Configurations
Authors: Jim Thornton
Venue:  (1994)

Automation of software configuration management is an important practical problem. Any automated tool must work from some specifications of correct or desired configurations. This report introduces a language for describing acceptable configurations of common systems, so that automated management is possible. The proposed language is declarative, while at the same time there are efficient algorithms for modifying a system to conform to a specification in many cases of practical importance.
Optimal Load Allocation for Parallel and Distributed Processing
Authors: Emile K. Haddad
Venue:  (1989)

The problem of minimizing the execution completion time of a given total load, to be partitioned into interacting tasks and allocated to run on a generalized model of a heterogeneous centralized or distributed multiprocessing system, is examined. The problem is formulated as a nonlinear, nonconvex nonseparable, minimax resource- allocation, continuous, mathematical programming problem. It is assumed that the quantitative functional dependence of the individual processor execution time on the partitioned load allocation is known and specified in analytical or graphical formats of a fairly general nature with no a priori restrictions of differentiability, monotonicity, convexity, and unimodality commonly imposed in previous investigations of the problem. A Theorem stating the necessary and sufficient condition for minimum concurrent processing completion time is derived. The new result represents an analytical breakthrough applicable to a wide class of hitherto analytically unsolved optimization problems in various application disciplines. The derivation starts from a precise representation of the parallel execution time and proceeds through an exact analysis that does not resort to the simplifying assumptions or analytical approximations found in analogous previous investigations. The load partitioning is considered to vary over a continuum, thus allowing the achievement of ideal optimization through one-step repartitioning of the given load. The optimization procedure determines the set of all global minimum points of the completion time function as well as all its local minima, thus allowing further lexicographic optimization and suboptimal trade-offs. The conditions of the Theorem admit a straightforward graphical interpretation which facilitates its implementation and readily extends its applicability to empirically or simulationally determined models of the system.
SMART POINTERS: THEY''RE SMART, BUT THEY''RE NOT POINTERS
Authors: Daniel R. Edelson
Venue:  (1992)

There are numerous times when a C++ user could benefit from a pointer variant that has more functionality than is provided by the basic, language-defined pointer. For example, type-accurate garbage collection, reference counting, or transparent references to distributed or persistent objects, might be implemented with classes that provide pointer functionality. The C++ language directly supports one kind of pointer substitute, the smart pointer, in the form of overloadable indirection operators: -< and *. In this paper we evaluate how *seamlessly* smart pointers can replace raw pointers. The ideal is for client code not to care whether it is using raw pointers or smart pointers. For example, if a typedef selects whether raw or smart pointers are used throughout the program, changing the value of the typedef should not introduce syntax errors. Unfortunately, C++ does not support pointer substitutes well enough to permit seamless integration. This paper presents the desired behavior of smart pointers in terms of the semantics of raw pointers that the smart pointers try to emulate. Then, we describe several ways of implementing smart pointers. For each, we show cases in which the smart-pointers fail to behave like raw pointers. From among the choices, we explain which is the best for emulating the standard pointer conversions. *Accessors* are similar to smart pointers, but have certain advantages. This paper discusses the differences between accessors and smart pointers, and shows why our conclusions about type conversion behavior also apply to accessors. Whether a programmer prefers smart pointers or accessors, this paper shows the limitations and recommends an implementation.
AHA! The adaptive hypermedia architecture
Authors: Paul De Bra, Ad Aerts, Bart Berden, Barend de Lange, Brendan Rousseau, Tomi Santic, David Smits, Natalia Stash
Venue: Proceedings of the fourteenth ACM conference on Hypertext and hypermedia (2003)

AHA!, the "Adaptive Hypermedia Architecture", was originally developed to support an on-line course with some user guidance through conditional (extra) explanations and conditional link hiding. This paper describes the many extensions and tools that have turned AHA! into a versatile adaptive hypermedia platform. It also shows how AHA! can be used to add different adaptive "features" to applications such as on-line courses, museum sites, encyclopedia, etc. The architecture of AHA! is heavily inspired by the AHAM reference model.
Geometric non-linear analysis of general shell structures using a flat triangular shell element
Authors: M. H. Jang, J. Y. Kim, T. J. Kwun
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

Finite element for geometrical non-linear analysis of general shells using a three-node flat triangular shell element is presented. The flat shell element is obtained by combining the DKT plate bending element of Discrete Kirchhoff Theory and a membrane element derived from the Linear Strain Triangular (LST) element. The geometrically non-linear analysis is performed using an Updated Lagrangian Formulation. An incremental iterative method based on the arc length method in conjunction with Newton-Raphson method is implemented in the present study for static analysis. In order to estimate the accuracy of the present formulation in predicting the nonlinear response of large structures, diverse models are analyzed. The present results are in good agreement with the results available in the existing literature and those obtained using the commercial finite element software.
Plane Cover Multiple Access: A New Approach to Maximizing Cellular System Capacity
Authors: Paul Blair, George Polyzos
Venue:  (2000)

We develop the Media Access Control strategy Plane Cover Multiple Access (PCMA) that provides a means of allocating wireless bandwidth in a packet based cellular system. PCMA seeks to maximize the number of parallel transmissions among cells by defining virtual cells in which users transmit using a given reuse factor. By keeping reuse factors low, system throughput can be maximized. We show that the throughput of a simple system designed using PCMA is up to 82% more efficient than the best known alternative.
Modelling Checkpointing and Recovery within UNITY
Authors: Zhiming Liu
Venue:  (1989)

Following the method for developing programs proposed in UNITY [CM88], this paper presents a general model for checkpointing and recovery within which the consistency of checkpoints, error propagation and the domino-effect of recovery from faults are formally characterized. Based on this model and UNITY, a solution is developed for checkpointing and recovery which describes what should be done for checkpointing and recovery but imposes no restrictions on when it should, where it should be done (e.g. on which processors), or how it should be done. This supports the idea that the introduction of checkpointing and recovery can be treated systematically as transformations which convert a program into a fault-tolerant program. Such fault-tolerant transformations and their correctness are defined in this paper. 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
Results and Questions in Combinatorial Game Complexities
Authors: A. S. Fraenkel
Venue:  (1998)

Aim : Present a systematic development of part of the theory of combinatorial games from the ground up.&#x00A0;&#x00A0;&#x00A0;Approach : Computational complexity. Combinatorial games are completely determined; the questions of interest are efficiencies of strategies. &#x00A0;&#x00A0;&#x00A0; Methodology : Divide and conquer. Isolate the various difficulties separating hard from easy games, and attack them individually.&#x00A0;&#x00A0;&#x00A0; Presentation : Informal; examples of games sampled from various levels illustrate the theory, with emphasis on formulating and motivating new and old research problems.
On the State of the Art in Requirements-based Validation and Test ofSoftware
Authors: Johannes Ryser, Stefan Berner, Martin Glinz
Venue:  (1999)

Validation of requirements and verification of software are crucial activities in the software development process since they essentially determine the quality of the software product and account for a big part of the overall development cost and use of resources. Only these activities can ensure that user requirements - whether they be explicit or only implicit - are met. This report overviews current methods and approaches towards validation of requirements and requirements-based testing.
CARAFE: AN INDUCTIVE FAULT ANALYSIS TOOL FOR CMOS VLSI CIRCUITS
Authors: Alvin L Jee
Venue:  (1991)

Traditional fault models for testing CMOS VLSI circuits do not take into account the actual mechanisms that precipitate faults. As a result, the failure modes of a circuit as predicted by these fault models may not reflect the realistic failure modes of the circuit. This thesis reports on the Carafe software which determines the realistic bridge faults of the CMOS circuit based on its layout. Each fault found by Carafe is assigned a relative probability based on the geometry of the fault site and defect distributions of the fabrication process. Carafe improves upon previous software in that it is easier to use, more robust, and more time and memory efficient so that larger circuits can be analyzed.