ppxscal/embedding_network huggingface dataset:
PDP: Programming A Programmable Design Process
Authors: Stanley M. Sutton Jr, Leon J. Osterweil
Venue: Proceedings of the 8th International Workshop on Software Specification and Design (1996)

We have been developing PDP, a system for programming the process of designing software that is based on Booch Object-Oriented Design. Because PDP allows tailoring and adaptation by participants, we consider it a programmable process. We believe that process programming can help in capturing and managing the inherent complexities of design processes and products, while programmability is necessary to accommodate the dynamic and creative aspects of design. PDP views the design process as comprising process steps, product artifacts, and execution resources. The process is multi-user and multi-role. The control model includes both proactive and reactive elements. Explicit consistency conditions interrelate product state and process control. Issues that arise in the programming of PDP include the integration of proactive and reactive control, the capturing of interrelations among steps, artifacts, and constraints, the identification of consistency conditions for design products and their implications for process control, and the accommodation of inconsistency and indeterminacy in evaluating design product state. Programmability is intended to provide organizations, managers, and developers with degrees of structured flexibility that are appropriate for their roles in the design process. PDP will make available variants of the design process; these will be tailorable through static and dynamic mechanisms. A number of issues arise with the introduction of programmability. For example, what distinguishes different design processes and their variants? What is a legal design process or product and to what extent can it be varied? What controls should be available to process managers and to design engineers?
A Complete Gentzen-style Axiomatization for Set Constraints
Authors: Allan Cheng, Dexter Kozen
Venue:  (1995)

Set constraints are inclusion relations between expressions denoting sets of ground terms over a ranked alphabet. They are the main ingredient in set-based program analysis. In this paper we provide a Gentzen-style axiomatization for sequents $\Phi\force\Psi$, where $\Phi$ and $\Psi$ are finite sets of set constraints, based on the axioms of termset algebra. Sequents of the restricted form $\Phi\force\bottom$ correspond to positive set constraints, and those of the more general form $\Phi\force\Psi$ correspond to systems of mixed positive and negative set constraints. We show that the deductive system is (i) complete for the restricted sequents $\Phi\force\bottom$ over standard models, (ii) incomplete for general sequents $\Phi\force\Psi$ over standard models, but (iii) complete for general sequents over set-theoretic termset algebras.
MCAD/MCSD Visual C# .Net Certification All-in-One Exam Guide: Exams 70-315, 70-316, 70-320, 1 edition
Authors: Marj Rempel, Marjorie Rempel
Venue:  (2002)

:All-in-One is all you need! This authoritative reference offers complete coverage of all material on the MCSD C# certification exam. You'll find exam objectives at the beginning of each chapter, helpful exam tips, end-of-chapter practice questions, and photographs and illustrations. The bonus CD-ROM contains a testing engine with questions found only on the CD. This comprehensive guide not only helps you pass this challenging exam, but will also serve as an invaluable on-the-job reference.
The Deadlock problem: a classifying bibliography
Authors: Dieter Zöbel
Venue: ACM SIGOPS Operating Systems Review (1983)

The desire for a better utilisation of resources and an acceleration of computing introduced the concept of parallelism with all its difficulties. Soon the danger of eternal delays of processes was discovered and called deadlock. For almost twenty years a lot of publications have dealt with problems considering deadlocks or their environment.Here we want to give a classification of our collected publications. We do not claim that this collection is complete in any sense, but we hope to have found essential articles (underlined) for nearly all the different topics fitting under the title "Deadlock".This classification regards different aspects of the problem and cannot always be given unambigiously so that many publications are listed several times. We would appreciate to get knowledge of other interesting articles or textbooks to this theme.
On the synthesis of MVL functions using input and output phase assignments
Authors: M. Abd-El-Barr, M. Hasan, G. A. Hamid
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

In this paper, a number of decomposition based mapping techniques are proposed. In these techniques, the synthesis problem is formulated as a mapping from an input matrix to an output matrix. The minimization is obtained by constructing a matching-count matrix. The entries of the matching-count matrix MC/sub i,j/ represent the number of entry matches between the input variable number i in the input matrix (X) and the output function number j in the output matrix (Y). It then selects those input-output pairings that give the maximum matching count, thus maximizing the number of switching operations which can be eliminated in the realization of MVL functions. The proposed techniques are classified as: output-phase with complement, input-phase with and without complement. Numerical results are presented to show that the proposed techniques result in significant reduction in the number of switching operators required for the implementation of 5000 randomly generated r-valued functions (for r=3, 4, and 5).
A Framework for ADS Application Software Development Based on CORBA
Authors: S. S. Yau, S. Mao
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

The concept of autonomous decentralized systems (ADS) which has the characteristics of online maintainability, online expandability and fault-tolerance has been successfully used in many distributed computing domains, such as: factory automation, traffic control, office automation, and nuclear power plants. In order to realize the benefits of object-oriented software development, a framework for ADS application software development based on the Common Object Request Broker Architecture (CORBA), a set of standards for object systems in heterogeneous distributed environments, is presented. In this framework, CORBA is extended and built over ADS system software. A CASE environment for ADS application software development based on CORBA is also presented.
Constraint Query Languages
Authors: Paris C. Kanellakis, Gabriel M. Kuper, Peter Z. Revesz
Venue:  (1992)

We investigate the relationship between programming with constraints and database query languages. We show that efficient, declarative database programming can be combined with efficient constraint solving. The key intuition is that the generalization of a ground fact, or tuple, is a conjunction of constraints over a small number of variables. We describe the basic constraint query language design principles and illustrate them with four classes of constraints: real polynomial inequalities, dense linear order inequalities, equalities over an infinite domain, and boolean equalities. For the analysis, we use quantifier elimination techniques from logic and the concept of data complexity from database theory. This framework is applicable to managing spatial data and can be combined with existing multi-dimensional searching algorithms and data structures. KEYWORDS: database queries, spatial databases, data complexity, quantifier elimination, constraint logic programming, relational calculus, Datalog.
A Graph Theoretic Approach for Design and Synthesis of Multiplierless FIR Filters
Authors: Khurram Muhammad, Kaushik Roy
Venue: Proceedings of the 12th international symposium on System synthesis (1999)

We present a novel approach which can be used to obtain multiplierless implementations of finite impulse response (FIR) digital filters. The main idea is to reorder filter coefficients such that an implementation based on differential coefficients requires only a few adders. We represent this problem using a graph in which vertices represent the coefficients and edges represent the resources required when the differential coefficient corresponding to the edge is used in a computation.We also present a graph model for an implementation based on second-order coefficient differences. The optimal solution to the coefficient reordering problem is the well known problem of finding the Hamiltonian path of smallest weight in this graph.We use two approaches to find the smallest weight Hamiltonian cycle; a greedy approach, and, the heuristic algorithm proposed by Lin and Kernighan. The power and potential of this approach is demonstrated by presenting results for large filters (lengths up to > 300) which show that, in general, for 16-bit coefficients, the total number of adders required per coefficient is less than 2. Hence, high performance and/or low power filters can be designed and synthesized using the proposed approach.
P_3-Connected Graphs of Minimum Size
Authors: David C. Fisher, Kathryn Fraughnaugh, Larry Langley
Venue:  (1994)

A graph is C4-free if it dose not contain any 4-cycles. A C4-free graph is C4-saturated if adding any edge creates a 4-cycle. Ollmann showed that an n-node C4-saturated graph has at least (3/2)(n-2) edges. A graph is P3 -connected if there is a path of length 3 between each pair of nonadjacent nodes. We show that an n-node P3 -connected graph has at least (3/2)(n-2) edges. Since all C4-saturated graphs are P3 -connected, this generalizes Ollmann''s results. We also find all n-node P3 -connected graphs with [(3/2)(n-2)) edges.
Trends in Epistemology
Authors: Peter Wegner
Venue:  (1991)

This paper has two primary objectives:\medskip (1) To review trends in epistemology, emphasizing twentieth-century developments but starting from Greek beginnings.\medskip (2) To reexamine the criticisms by Searle and Penrose of Turing''s hypothesis that machines can think. 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
Search by Shape Examples: Modeling Nonrigid Deformation
Authors: S. Sclaroff, A. P. Pentland
Venue:  (1994)

Abstract We describe our work on shape-based image database search using the technique of modal matching. Modal matching employs a deformable shape decomposition that allows users to select example objects and have the computer efficiently sort the set of objects based on the similarity of their shape. Shapes are compared in terms of the types of nonrigid deformations (differences) that relate them. The modal decomposition provides deformation ``control knobs'''' for flexible matching and thus allows for selecting weighted subsets of shape parameters that are deemed significant for a particular category or context. We demonstrate the utility of this approach for shape comparison in 2-D image databases; however, the general formulation is applicable to signals of any dimensionality.
Mumbling - User-Driven Cooperative Interaction
Authors: Jussi Karlgren
Venue:  (1994)

This paper suggests a scheme for raising the cooperativeness of natural language interfaces without changing either modality or system linguistic competence, but by heightening the level of interactivity and by aiding the user in maintaining the responsibility for the discourse. In short: hands-off-pragmatics at the computer interface.
Adaptive Wavelet Methods for Saddle Point Problems
Authors: Reinhard H Stephan Dahlke
Venue:  (1999)

Recently, adaptive wavelet strategies for symmetric, positive definite operators have been introduced that were proven to converge. This paper is devoted to the generalization to saddle point problems which are also symmetric, but indefinite. Firstly, we derive explicit criteria for adaptively refined wavelet spaces in order to fulfill the Ladyshenskaja-Babuska-Brezzi (LBB) condition and to be fully equilibrated. Then, we investigate a posteriori error estimates and generalize the known adaptive wavelet strategy to saddle point problems. The convergence of this strategy for elliptic operators essentially relies on the positive definite character of the operator. As an alternative, we introduce an adaptive variant of Uzawa''s algorithm and prove its convergence. Finally, we detail our results for two concrete examples of saddle point problems, namely the mixed formulation of the Stokes problem and second order elliptic boundary value problems where the boundary conditions are appended by Lagrange multipliers. EMAIL:: urban@dragon.ian.pv.cnr.it KEYWORDS:: Adaptive schemes, a posteriori error estimates, multiscale methods, wavelets, saddle point problems, Uzawa''s algorithm, Stokes problem, Lagrange multipliers. 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
Localization, Mapmaking, and Distributed Manipulation with Flexible, Robust Mobile Robots
Authors: Russell Brown
Venue:  (1995)

Current mobile robots (mobots) have extremely limited usefulness in real-world applications, due primarily to low capability and low reliability. Current mobots cannot navigate in environments which have not been extensively engineered to be mobot-friendly; they are also incapable of performing useful duties at their destination. They often have poorly designed hardware and primitive software-development environments, making the development of new mobile robot protocols slow and difficult. In this thesis, we describe three ways to make mobile robots more usable. We present algorithms for mobile robot self-localization, a design paradigm for reliable mobile robots, and protocols for cooperative large-scale manipulation by mobile robots. Localization is the process of determining the robot''s location within its environment. More precisely, it is a procedure which takes as input a geometric map, a current estimate of the robot''s pose, and sensor readings, and produces as output an improved estimate of the robot''s current pose (position and orientation). We describe an algorithm which performs mobile robot localization using a geometric model of the world and a point-and-shoot rang ing device. We also describe a rasterized version of this algorithm which we''ve implemented on a real mobile robot equipped with a laser rangefinder we designed. We next focus on the mobile robots themselves. We have designed and built several mobile robots at Cornell, that feature robustness, flexibility, and ease of programming. Using a modular design approach, we''ve attained an unusual state for a university robotics lab: our mobots are almost always functional. In their basic configuration, the robots can perform many tasks; also, it is easy to add sensors and actuators to our mobile robots, allowing their use in many different applications (e.g. manipulation). We are interested in protocols for manipulation of large objects (e.g., boxes, wheeled carts) by cooperating mobile robots, particularly protocols that are asynchronous, on-line, and use no communication between mobots. We''ve developed a Pusher-Steerer model for cooperative manipulation, which enables two mobots to manipulate objects through complex paths. We describe and anal yze the model and describe its performance in several real experiments.
Subpixel-Precise Extraction of Watersheds
Authors: Carsten Steger
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

An approach to extract watersheds and watercourses, as well as their corresponding valleys and hills, from images with subpixel precision is proposed. The critical points of the terrain are essential as the starting points for the construction of these separatrices. They are extracted efficiently with subpixel precision using an approach based on derivatives of Gaussian filters. The separatrices are extracted by integrating their defining differential equation.Finally, the hills and valleys are constructed by an efficient graph search algorithm. Examples show the quality of the results that can be achieved with the proposed approach.
Ensemble Security
Authors: Ohad Rodeh, Kenneth P. Birman, Mark Hayden, Zhen Xiao, Danny Dolev
Venue:  (1998)

Ensemble is a Group Communication System built at Cornell and the Hebrew Universities. It allows processes to create {\it process groups} in which scalable reliable fifo-ordered multicast and point-to-point communication are supported. The system also supports other communication properties, such as multicast causal and total ordering, flow control, etc.. This paper describes the security protocols and infrastructure of Ensemble. Applications using Ensemble with the extensions described here benefit from strong security properties. Assuming trusted authenticated members may not be corrupted, all communication is secured from tampering by outsiders. Our work extends previous work performed in the Horus system (Ensemble''s predecessor) adding support for multiple partitions, efficient rekeying, and application defined security policies. Unlike Horus, which used its own security infrastructure with non-standard key distribution and timing services, Ensemble''s security mechanism is based on a standard and very widely used security infrastructure: the PGP authentication engine.
Biometrics: Identity Verification in a Networked World
Authors: Samir Nanavati, Michael Thieme
Venue:  (2002)

:No longer a science fiction solution, biometric technologies are being deployed by thousands of companies and public agencies to increase security, protect personal information, and reduce fraud. Along with this broad-scale deployment comes a wide range of critical issues, including privacy risks, secure biometric system design, and the strengths and weaknesses of leading technologies such as finger-scan, iris-scan, facial-scan, voice-scan, and signature-scan. A full understanding of the biometric technologies, applications, and markets is required for successful utilization of biometrics in today's enterprise environment. Written by leading industry authorities, this book provides you with everything you need to know about the technology, the industry, the applications, and the challenges that define biometrics today. It explains why institutions are turning to biometrics to authenticate employees, customers, and citizens in mission-critical applications. It also provides a broad conceptual understanding of the technology, explains specialized terms and concepts, and concludes with an analysis of the factors you must consider when designing, deploying, and maintaining biometric systems.
Can Visibility Graphs be Represented Compactly? Pankaj K.Agarwal
Authors: Noga Alon, Boris Aronov, Subhash Suri
Venue:  (1993)

We consider the problem of representing the visibility graph of line segments as a union of cliques and bipartite cliques. Given a graph $G$, a family ${\cal G} = \{G_1, G_2, \ldots, G_k\}$ is called a {\em clique cover\/} of $G$ if $(i)$ each $G_i$ is a clique or a bipartite clique, and $(ii)$ the union of $G_i$ is $G$. The size of the clique cover ${\cal G}$ is defined as $\sum_{i=1}^k n_i$, where $n_i$ is the number of vertices in $G_i$. Our main result is that there exist visibility graphs of $n$ nonintersecting line segments in the plane whose smallest clique cover has size $\Omega(n^2/\log^2 n)$. An upper bound of $O(n^2 / \log n )$ on the clique cover follows from a well-known result in extremal graph theory. On the other hand, we show that the visibility graph of a simple polygon always admits a clique cover of size $O(n \log^3 n)$, and that there are simple polygons whose visibility graphs require a clique cover of size $\Omega (n \log n)$.
The Role of Formal Methods in Software Standards
Authors: Kathleen A. Kegley, Victoria Stavridou
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

The application of formal methods offers an opportunity to enhance the integrity of software standards through several distinct roles. During the development of standards, the final representation of the standard, and testing of implementations claiming conformance to the standard, formal methods can be applied to achieve more precise and testable standards.
Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs
Authors: Philip N. Klein
Venue:  (1990)

The problem of reachability in a directed graph has resisted attempts at efficient parallelization. Only for fairly dense graphs can we efficiently achieve significant parallel speed-ups, using known methods. We describe a technique allowing significant parallel speed-up even for moderately sparse graphs, following a sequential preprocessing step in which a representation of the graph is created.
Implementing the Multiprefix Operation on Parallel and Vector Computers
Authors: Thomas J. Sheffler
Venue:  (1992)

For an ordered set of n values, each with an associated integer label, the multiprefix operation calculates a partial sum for each value that is the sum of all preceding values with the same label. The multiprefix operation has been proposed as a parallel primitive because of its power for expressing many data parallel algorithms succinctly. However, most approaches to implementing this operation have used integer sorting to gather elements with the same label together or have suggested special hardware. In this paper we present a work efficient algorithm for the multiprefix operation on n elements that runs in __ __ S = O(V n parallel steps on a p = V n processor CRCW-ARB PRAM. The CRCW-ARB model ensures only that of multiple processors writing to the same location, an arbitrary one succeeds. We make use of this feature to resolve data dependencies in the first phase of the algorithm only so that all later steps guarantee EREW memory access. A fully vectorized version of our algorithm has been designed for the CRAY Y-MP and provides good performance for a number of important algorithms. For the integer sorting test of the NAS benchmarks, our multiprefix operation was used to create an algorithm that is competitive in performance with the current best algorithms for that machine. As another example, we show that by using the multiprefix operator for sparse-matrix dense-vector multiplication, we obtain performance exceding traditional FORTRAN-based approaches. Finally, our algorithm also makes possible the simultion of a CRCW-PLUS PRAM on a p processor CRCW-ARB PRAM with only constant slowdown for problem 2 sizes n < p .
A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems
Authors: Mary A Branch, Thomas F. Coleman, Yuying Li
Venue:  (1995)

A subspace adaptation of the Coleman-Li trust region and interior method is proposed for solving large-scale bound-constrained minimization problems. This method can be implemented with either sparse Cholesky factorization or conjugate gradient computation. Under reasonable conditions the convergence properties of this subspace trust region method are as strong as those of its full-space version. Computational performance on various large-scale test problems are reported; advantages of our approach are demonstrated. Our experience indicates our proposed method represents an efficient way to solve large-scale bound-constrained minimization problems.