ppxscal/embedding_network huggingface dataset:
Static prediction of heap space usage for first-order functional programs
Authors: Martin Hofmann, Steffen Jost
Venue: ACM SIGPLAN Notices (2003)

We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs.The analysis takes space reuse by explicit deallocation into account and also furnishes an upper bound on the heap usage in the presence of garbage collection. It covers a wide variety of examples including, for instance, the familiar sorting algorithms for lists, including quicksort.The analysis relies on a type system with resource annotations. Linear programming (LP) is used to automatically infer derivations in this enriched type system.We also show that integral solutions to the linear programs derived correspond to programs that can be evaluated without any operating system support for memory management. The particular integer linear programs arising in this way are shown to be feasibly solvable under mild assumptions.
A Search-Based Imaging System for Electromagnetic Nondestructive Testing
Authors: L. Udpa, W. Lord
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

A crucial aspect of nondestructive-testing research is the inverse problem (or imaging), which involves the reconstruction of flaws in test specimen interiors, given a probe response signal. A novel approach that uses the finite-element model to solve the forward problem is presented. It is based on first formulating defect reconstruction as a parameter estimation problem. The test system functions as mathematical mapping from parameter space to signal space. The two major parts of the method are described: problem representation and the search procedure. Results obtained by applying the basic algorithm to defects simulated using the finite-element model are discussed.
Information Aggregation in Double Auctions: Rational Expectations and the Winner's Curse
Authors: Serena Guarnaschelli, Anthony M. Kwasnica, Charles R. Plott
Venue: Information Systems Frontiers (2003)

This paper inquires about the ability of double auction institutions to aggregate information in the context of a &ldquo;common value&rdquo; information structure that is known to produce the winner's curse in sealed bid environments. While many fundamental features of the economic trading mechanism are different from those studied in the context of sealed bids, the pattern of information distributed to the population of traders is the same. This gives us an opportunity to determine if the behaviors reported in sealed bid environments can be detected in the more active market environment. As such, the experiments are also a test of the robustness of earlier experiments that demonstrate that in economies with homogeneous preferences single compound securities organized by double auctions are able to aggregate information. The basic result is that a severe winner's curse is not observed. The irrationality observed in sealed bids does not extend itself to the double auction environment. Information aggregation is observed and the rational expectations model receives support.
Software Reuse at Motorola
Authors: Rebecca Joos
Venue: IEEE Software (1994)

High initial costs and a slow return on investment can make software reuse a tough sell. The author chronicles the ups and downs of implementing software reuse in a corporation that, despite its bottom-up, grass-roots culture, enlisted top management's intervention to proceed. Based on experience, she recommends that any group trying to implement reuse should first get support from top management and provide reuse training for engineers; second, provide incentives to support the program until reuse becomes part of the culture; and third, provide tools to help engineers.
Efficient Query Processing in Integrated Multiple Object Databases with Maybe Result Certification
Authors: Jia-Ling Koh, Arbee L. P. Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Within integrated multiple object databases, missing data occurs due to the missing attribute conflict as well as the existence of null values. A set of algorithms is provided in this paper to process the predicates of global queries with missing data. For providing more informative answers to users, the maybe results due to missing data are presented in addition to the certain results. The local maybe results may become certain results via the concept of object isomerism. One algorithm is designed based on the centralized approach in which data are forwarded to the same site for integration and processing. Furthermore, for reducing response time, the localized approaches evaluate the predicates within distinct component databases in parallel. The object signature is also applied in the design to further reduce the data transfer. These algorithms are compared and discussed according to the simulation results of both the total execution and response times. Alternately, the global schema may contain multivalued attributes with values derived from attribute values in different component databases. Hence, the proposed approaches are also extended to process the global queries involving this kind of multivalued attribute
Implicit and Explicit Camera Calibration: Theory and Experiments
Authors: G. Q. Wei, S. D. Ma
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

By implicit camera calibration, we mean the process of calibrating a camera without explicitly computing its physical parameters. Implicit calibration can be used for both three-dimensional (3-D) measurement and generation of image coordinates. In this paper, we present a new implicit model based on the generalized projective mappings between the image plane and two calibration planes. The back-projection and projection processes are modelled separately to ease the computation of distorted image coordinates from known world points. A set of constraints of perspectivity is derived to relate the transformation parameters of the two calibration planes. Under the assumption of the radial distortion model, we present a computationally efficient method for explicitly correcting the distortion of image coordinates in frame buffer without involving the computation of camera position and orientation. By combining with any linear calibration techniques, this method makes explicit the camera physical parameters. Extensive experimental comparison of our methods with the classic photogrammetric method and Tsai's (1986) method in the aspects of 3-D measurement (both absolute and relative errors), the prediction of image coordinates, and the effect of the number of calibration points, is made using real images from 15 different depth values.
A Rewriting Machine and Optimization of Strategies of Term Rewriting
Authors: A. A. Letichevskii, V. V. Khomenko
Venue: Cybernetics and Systems Analysis (2002)

An algebraic specification of a new rewriting machine for fast rewriting of terms is considered. Theorems on the correctness of this specification are proved. A method for optimization of a strategy of iterative rewriting is proposed.
A Robust Spectral Element Method for Simulations of Time-Dependent Viscoelastic Flows, Derived from the Brownian Configuration Field Method
Authors: Cédric Chauvière, Robert G. Owens
Venue: Journal of Scientific Computing (2002)

This paper is an extension of previous work &lsqb;4&rsqb;, where a robust numerical method derived from the Brownian configuration field method &lsqb;8&rsqb; was introduced in order to simulate the flows of dilute polymeric solutions. In &lsqb;4&rsqb;, we limited our study to solutions of dumbbells having infinite extensibility (Oldroyd-B model), whereas in this paper, we tackle the more difficult problem of dumbbells having finite extensibility (FENE-P model).
Proof Reflection in Coq
Authors: Dimitri Hendriks
Venue: Journal of Automated Reasoning (2003)

We formalize natural deduction for first-order logic in the proof assistant Coq, using de Bruijn indices for variable binding. The main judgment we model is of the form &Gamma;&vdash;d&thinsp;[:]&thinsp;&phi;, stating that d is a proof term of formula &phi; under hypotheses &Gamma;; it can be viewed as a typing relation by the Curry&ndash;Howard isomorphism. This relation is proved sound with respect to Coq's native logic and is amenable to the manipulation of formulas and of derivations. As an illustration, we define a reduction relation on proof terms with permutative conversions and prove the property of subject reduction.
Silhouette-Based Isolated Object Recognition through Curvature Scale Space
Authors: Farzin Mokhtarian
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

A complete, fast and practical isolated object recognition system has been developed which is very robust with respect to scale, position and orientation changes of the objects as well as noise and local deformations of shape (due to perspective projection, segmentation errors and non-rigid material used in some objects). The system has been tested on a wide variety of three-dimensional objects with different shapes and material and surface properties. A light-box setup is used to obtain silhouette images which are segmented to obtain the physical boundaries of the objects which are classified as either convex or concave. Convex curves are recognized using their four high-scale curvature extrema points. Curvature Scale Space (CSS) Representations are computed for concave curves. The CSS representation is a multi-scale organization of the natural, invariant features of a curve (curvature zero-crossings or extrema) and useful for very reliable recognition of the correct model since it places no constraints on the shape of objects. A three-stage, coarse-to-fine matching algorithm prunes the search space in stage one by applying the CSS aspect ratio test. The maxima of contours in CSS representations of the surviving models are used for fast CSS matching in stage two. Finally, stage three verifies the best match and resolves any ambiguities by determining the distance between the image and model curves. Transformation parameter optimization is then used to find the best fit of the input object to the correct model.
Multiclass Replicated Data Management: Exploiting Replication to Improve Efficiency
Authors: P. Triantafillou, D. J. Taylor
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

Research efforts in replication-control protocols primarily use replication as a means ofincreasing availability in distributed systems. It is well-known, however, that replicationcan reduce the costs of accessing remotely-stored data in distributed systems. Wecontribute a classification of replicas and a replication-control protocol which introducethe availability benefits of replication and, at the same time, exploit replication to improve performance, by reducing response time. Each replica class has different consistency requirements. Metareplicas keep track of up-to-date replicas for recently-accessed objects and help exploit data-reference localities. Thus they allow many transaction operations to execute synchronously at only a single (and often local) replica.Pseudoreplicas are nonpermanent replicas that facilitate "localized execution" oftransaction operations. True replicas are ordinary, permanent replicas as used in otherreplication schemes. For many commonly occurring replication scenarios, the protocoloutperforms both replication-control protocols in the literature and nonreplicatedsystems, while offering the availability benefits of replication.
A Discontinuous Spectral Element Model for Boussinesq-Type Equations
Authors: C. Eskilsson, S. J. Sherwin
Venue: Journal of Scientific Computing (2002)

We present a discontinuous spectral element model for simulating 1D nonlinear dispersive water waves, described by a set of enhanced Boussinesq-type equations. The advective fluxes are calculated using an approximate Riemann solver while the dispersive fluxes are obtained by centred numerical fluxes. Numerical computation of solitary wave propagation is used to prove the exponential convergence.
Design Reuse through Frameworks and Patterns
Authors: Peter W. Fach
Venue: IEEE Software (2001)

The reuse of accepted software solutions that have proven to be usable is one of the key concepts of modern and successful software development. This contribution focuses on the reuse of good design and presents an approach that is based on over 10 years of experience. Like most modern methods, this approach relies on so-called frameworks and design patterns¿technical aids typically used in the heart of software labs. The approach presented here, however, goes much further in that it completely integrates frameworks and design patterns into the developmental process, where they have proven to be an excellent way to improve user participation throughout the developmental life cycle. Moreover, it even becomes possible to determine which units are suitable for reuse by a high degree of user participation thus achieving the aim of reusing "good design." Finally, these concepts provide elegant methods for adapting application systems.
Least-squares spectral elements applied to the Stokes problem
Authors: M. M. J. Proot, M. I. Gerrtisma
Venue: Journal of Computational Physics (2002)

Least-squares spectral element methods are based on two important and successful numerical methods: spectral/hp element methods and least-squares finite element methods. In this respect, least-squares spectral element methods seem very powerful since they combine the generality of finite element methods with the accuracy of the spectral methods and also have the theoretical and computational advantages of the least-squares methods. These features make the proposed method a competitive candidate for the solution of large-scale problems arising in scientific computing. In order to demonstrate its competitiveness, the method has been applied to an analytical problem and the theoretical optimal and suboptimal a priori estimates have been confirmed for various boundary conditions. Moreover, the exponential convergence rates, typical for a spectral element discretization, have also been confirmed. The comparison with the classical Galerkin spectral element method revealed that the least-squares spectral element method is as accurate as the Galerkin method for the smooth model problem.
Optimal Parallel Hypercube Algorithms for Polygon Problems
Authors: Danny Z. Chen, Mikhail J. Atallah
Venue: IEEE Transactions on Computers (1995)

We present parallel techniques on hypercubes for solving optimally a class of polygon problems. We thus obtain optimal O(log n)-time, n-processor hypercube algorithms for the problems of computing the portions of an n-vertex simple polygonal chain C that are visible from a given source point, computing the convex hull of C, testing an n-vertex simple polygon P for monotonicity, and other related problems as well. Previously it was not known how to achieve these complexity bounds on hypercubes, one of the main difficulties being that there is no known optimal sorting hypercube algorithm that achieves these bounds. In fact these are the first optimal geometric hypercube algorithms that do not assume that the input is given already sorted by x or y coordinates. The hypercube model we use is the standard one, with O(1) local memory per processor, and with one-port communication.
Direct measurement vs. indirect inference for determining network-internal delays
Authors: K. G. Anagnostakis, M. B. Greenwald
Venue: Performance Evaluation (2002)

We consider direct techniques for measuring network-internal delays that rely on network routers as measurement nodes, and indirect techniques that rely on end-to-end measurements and infer delay distributions on the common internal paths. The direct technique does not require any additional infrastructure support, and can thus be directly applied to the analysis of network performance and the study of the Internet. The use of routers for measurement also results in a simple mathematical formulation of the delay estimation problem, thereby providing robustness and accuracy. However, the irregularity of Internet routing somewhat limits the applicability of the direct technique. In contrast, indirect techniques are not sensitive to routes to internal nodes, but accumulate increased errors over longer paths. We use simulation to compare the direct and indirect methods and present results from network measurements exploring the applicability and limitations of these techniques.
Building Hypertext Links By Computing Semantic Similarity
Authors: Stephen J. Green
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Most current automatic hypertext generation systems rely on term repetition to calculate the relatedness of two documents. There are well-recognized problems with such approaches, most notably, a vulnerability to the effects of synonymy (many words for the same concept) and polysemy (many concepts for the same word). We propose a novel method for automatic hypertext generation that is based on a technique called lexical chaining, a method for discovering sequences of related words in a text. This method uses a more general notion of document relatedness, and attempts to take into account the effects of synonymy and polysemy. We also present the results of an empirical study designed to test this method in the context of a question answering task from a database of newspaper articles.
An Extensible DBMS for Small and Medium Systems
Authors: Mike P. Papazoglou
Venue: IEEE Micro (1989)

An extensible, relational database management system called Requiem is described that offers users a truly relational interface, and is independent of query language. Requiem (relational query and update interactive system) is an interactive system with facilities for querying and updating a database. The organization of Requiem, the structure of its query language RQL, and the structure of the database are discussed.
Boolean Similarity Measures for Resource Discovery
Authors: Shih-Hao Li, Peter B. Danzig
Venue: IEEE Transactions on Knowledge and Data Engineering (1997)

As the number of Internet servers increases rapidly, it becomes difficult to determine the relevant servers when searching for information. We develop a new method to rank Internet servers for Boolean queries. Our method reduces time and space complexity from exponential to polynomial in the number of Boolean terms. We contrast it with other known methods and describe its implementation.
Prototyping Bubba, A Highly Parallel Database System
Authors: H. Boral, W. Alexander, L. Clay, G. Copeland, S. Danforth, M. Franklin, B. Hart, M. Smith, P. Valduriez
Venue: IEEE Transactions on Knowledge and Data Engineering (1990)

Bubba is a highly parallel computer system for data-intensive applications. The basis of the Bubba design is a scalable shared-nothing architecture which can scale up to thousands of nodes. Data are declustered across the nodes (i.e. horizontally partitioned via hashing or range partitioning) and operations are executed at those nodes containing relevant data. In this way, parallelism can be exploited within individual transactions as well as among multiple concurrent transactions to improve throughput and response times for data-intensive applications. The current Bubba prototype runs on a commercial 40-node multicomputer and includes a parallelizing compiler, distributed transaction management, object management, and a customized version of Unix. The current prototype is described and the major design decisions that went into its construction are discussed. The lessons learned from this prototype and its predecessors are presented.
Modular Specification and Verification of Object-Oriented Programs
Authors: Gary T. Leavens
Venue: IEEE Software (1991)

A method for modular specification and verification using the ideas of subtype and normal type is presented. The method corresponds to informal techniques used by object-oriented programmers. The key idea is that objects of a subtype must behave like objects of that type's supertypes. An example program is used to show the reasoning problems that supertype abstraction may cause and how the method resolves them. Subtype polymorphism is addressed, and specification and verification update is discussed. A set of syntactic and semantic constraints on subtype relationships, which formalize the intuition that each object of a subtype must behave like some object of each of its supertypes, is examined. These constraints are the key to the soundness of the method. To state them precisely, a formal model of abstract type specifications is used.
A 3-D gravity inversion tool based on exploration of model possibilities
Authors: Antonio G. Camacho, Fuensanta G. Montesinos, Ricardo Vieira
Venue: Computers Geosciences (2002)

A computational tool for the development and implementation of a recently published method of 3-D (three dimensional) inversion for gravity data is presented. This method seeks to determine the geometry of an indefinite number of anomalous bodies with prescribed (fixed or variable) density contrasts, positive and negative values being indiscriminately accepted in the model. The approach is based on a prismatic partition of the subsurface and attempts to determine the anomalous bodies by means of a "growth" sequence, analysing (systematically or randomly) the several model possibilities and from that choosing the best for the growth progress. Moreover, a regional trend for the gravity data can be simultaneously adjusted. The non-uniqueness of the gravity inversion is avoided by means of a mixed condition about the residuals and the whole body anomalous mass. This inversion method has been applied with good results to simulation tests and to several real examples. Here, we present a main program that realises the inversion according to several possibilities for general application (scale of the survey, fixed or variable density contrasts, optional smoothing, optional trend adjustment, systematic or random exploration, optional a priori information, weighting, etc.). This program is presented along with a previous program for selection of unknowns and parameters and another program for visual presentation of the results. All three programs are written in Fortran 77 and completes the inversion tool.
Design Considerations for Shared Memory Multiprocessor Message Systems
Authors: N. Islam, R. H. Campbell
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

The comparative performance is studied of different message passing system designsexperimentally on a shared memory Encore Multimax multiprocessor. The systems aremeasured both by benchmarks and by running example parallel applications. To act as acontrol, the shared memory machine results are compared with the performance of thebenchmarks and applications on the Intel iPSC/2 running the NX/2 operating system. Thedesign alternatives considered are buffering, buffer organization, reference and valuesemantics, synchronization, coordination strategy and the location of the system in useror kernel space. The results include measurements of the effects of the designalternatives, memory caching, message sizes and copying.
A Differential Cryptanalysis of Tree-Structured Substitution-Permutation Networks
Authors: Luke O'Connor
Venue: IEEE Transactions on Computers (1995)

We propose a differential attack on tree-structured substitution-permutation networks. The number of chosen plaintexts required for the differential attack to succeed is called the complexity. Our main result is to show that the expected complexity of the attack is linear in the size of the network. This is the first rigorous result concerning the complexity of a differential attack for a general class of product ciphers.