ppxscal/embedding_network huggingface dataset:
Partitioning around roadblocks: tackling constraints with intermediate relaxations
Authors: Shantanu Dutt, Halim Theny
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

Constraint satisfaction during partitioning and placement of VLSI circuits is an important problem, and effective techniques to address it lead to high-quality physical design solutions. This problem has, however, been cursorily treated in previous partitioning and placement research. Our work presented here addresses the balance-ratio constraint, and is a crucial first step to an effective solution to the general constraint-satisfaction problem. In current iterative-improvement mincut partitioners, the balance-ratio constraint is tackled by disallowing moves that violate it. These methods can lead to sub-optimal solutions since the process is biased against the movement of large cells and clusters of cells. We present techniques for an informed relaxation process that attempts to estimate whether relaxing the constraint temporarily will ultimately benefit the mincut objective. If so, then a violating move is allowed, otherwise it is disallowed. The violations are corrected in future moves so that the final solution satisfies the given constraint. On a set of ACM/SIGDA PROUD benchmark circuits with actual cell sizes, we obtained up to 38% and an average of 14.5% better cutsizes with as little as 13% time overhead using our techniques compared to the standard method of not allowing any relaxation.
Active Learning with Local Models
Authors: Martina Hasenjäger, Helge Ritter
Venue: Neural Processing Letters (1998)

In this contribution, we deal with active learning, which gives the learner the power to select training samples. We propose a novel query algorithm for local learning models, a class of learners that has not been considered in the context of active learning until now. Our query algorithm is based on the idea of selecting a query on the borderline of the actual classification. This is done by drawing on the geometrical properties of local models that typically induce a Voronoi tessellation on the input space, so that the Voronoi vertices of this tessellation offer themselves as prospective query points. The performance of the new query algorithm is tested on the two-spirals problem with promising results.
Fast Implementation of 3-D Digital Filters Via SystolicArray Processors
Authors: B. G. Mertzios, A. N. Venetsanopoulos
Venue: Multidimensional Systems and Signal Processing (1997)

In this paper a fast implementation architecture of three-dimensional (3-D) FIR or IIR digital filters via systolic VLSI array processors is described. The modular structure presented is comprised of similar processing elements in a linear cascade configuration with local interconnections. High speed throughput rates are attained due to high concurrency, which is achieved by exploiting both pipelining and parallelism. The considered 3-D FIR and IIR filters may be used for the processing of reconstructed 3-D images and in medical imaging applications.
Multi-Scale Blur Estimation and Edge Type Classification for Scene Analysis
Authors: Wei Zhang, Fredrik Bergholm
Venue: International Journal of Computer Vision (1997)

Signatures, in this work, are multi-scale representations of local gray-level information, tied to places in gray scale images where regional differences are locally maximal. The information may involve the regional differences themselves (called Gaussian differences or signed normalized gradient magnitudes, (Korn, 1988)), or, distance relations between edges (apparent width measurements), or, absence of edges in pulse edge pairs, at coarser scales. Using signatures involves the classical problem mentioned by Marr and others of relating information across scales. A novel result is that a fruitful way of doing this is to build scale paths from coarse-to-fine exploiting edge focusing and associate with pixel positions, along these paths, the three quantities Gaussian differences, apparent width and the binary information absence/presence of edges (in edge-pairs). Such a structure, if used together with proper conditional tests, serves the purpose of classifying edges with respect to profile-type, and can also be used for measuring global contrast, degree of diffuseness, deblurred line width, and qualitative labels such as diffuse versus sharp. The structure is used simultaneously for labelling tasks and quantitative measurements. Theory on apparent widths, absence/presence of edges in pulse edge pairs is developed. For measuring diffuseness and global contrast from Gaussian difference signatures a linear least squares approach is suggested. Extensive experimental results are presented. Possible applications are in image segementation, junction analysis, and depth-from-defocus. For the purpose of distinguishing between objects and illumination phenomena, such as diffuse shadow edges, classification of contours with respect to diffuseness seems useful.
Enterprise modeling within an enterprise engineering framework
Authors: Donald H. Liles, Adrien R. Presley
Venue: Proceedings of the 28th conference on Winter simulation (1996)

The role of abstraction, or modeling, is a major element in Enterprise Engineering. Enterprise engineering deals with the analysis, design, implementation and operation of an enterprise. The Enterprise Engineer addresses a fundamental question: "how to design and improve all elements associated with the total enterprise through the use of engineering and analysis methods and tools to more effectively achieve its goals and objectives". This paper describes a describes a multi-view reference architecture for modeling an enterprise. It presents a modeling scheme under development which supports the architecture and acts as a tool for Enterprise Engineering.
Parallel Algorithms for Relational Coarsest Partition Problems
Authors: Sanguthevar Rajasekaran, Insup Lee
Venue: IEEE Transactions on Parallel and Distributed Systems (1998)

Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are ${\cal P}-{\rm complete}$ and hence it may not be possible to design polylog time parallel algorithms for these problems. In this paper, we present two efficient parallel algorithms for RCPP in which its associated label transition system is assumed to have m transitions and n states. The first algorithm runs in $O(n^{1+\epsilon})$ time using ${\textstyle{m \over {n^\epsilon}}}$ CREW PRAM processors, for any fixed $\epsilon
Navigating C++ and object-oriented design
Authors: Paul Anderson, Gail Anderson
Venue:  (1997)

Learn ANSI C++ right from the start!If you're going to learn C++, learn it right from the start! Navigating C++ and Object-Oriented Design is the first book that teaches ANSI C++ and the object-oriented techniques that make C++ a software development breakthrough.This comprehensive tutorial reflects the authors' extensive experience teaching C++ to professional developers. Start with the clearest introduction to object modeling you'll ever read. Then learn all the essentials of C++ and more advanced topics such as exceptions, namespaces, and dynamic memory allocation.Next, discover C++ classes, the basic building block of object-oriented design. Through proven analogies and examples, the authors introduce containment and inheritance, overloading, templates, RTTI, and exception handling. And, the authors' unique presentation on multiple inheritance will give you invaluable insights into this complex topic.Learn to apply C++ and object-oriented techniques to real-world development. Discover how to design classes effectively using the authors' class design boilerplate. Understand how to design container classes. Walk through class designs using the powerful OMT methodology. Along the way, try out the book's extensive exercises and take advantage of the exercise solutions and library of sample code on the accompanying CD-ROM.Navigating C++ and Object-Oriented Design is one of the first C++ tutorials that covers in detail powerhouse ANSI C++ features like: Namespaces, bool, member templates, and RTTI Explicit, export, and nothrow versions of new and delete The IOStream Library and Standard Template LibraryWhy learn C++ simply as a "better C" when you can write C++ code that really meets its potential? One book shows you how: Navigating C++ and Object-Oriented Design!
Clocked Dosimeter Compatible with Digital CMOS Technology
Authors: E. Garcia-Moreno, B. Iñiguez, M. Roca, J. Segura, E. Isern
Venue: Journal of Electronic Testing: Theory and Applications (1998)

We present two versions of a radiation dosimeter, they are CMOS circuits built around a PMOSFET radiation sensor, compatible with standard technology. These dosimeters are intended to be used as built-in sensors in integrated circuits to signal misfunction danger due to radiation exposure, and so they have a binary output which changes its state when the total radiation dose exceeds a prefixed level. The first circuit is an improved version of a previously developed dosimeter which has less power consumption and sharper transfer characteristics. It has been built in ES2 1.0 &micro;m technology and we present experimental results. The second circuit is under development, it is a clocked dosimeter which samples the dose only during a very short time at each clock period and then remains at rest, to further reduce the power consumption.
Fast power estimation for deterministic input streams
Authors: Luca Benini, Giovanni De Micheli, Enrico Macii, Massimo Poncino, Riccardo Scarsi
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

The power dissipated by digital systems under realistic input stimuli is not accurately described by a single average value, but by a waveform that shows how power consumption varies over time as the system responds to the inputs. We face the problem of obtaining accurate power waveforms for combinational and sequential circuits under typical usage patterns. We propose a multi level simulation engine that achieves high accuracy in estimating the average power as well as the time domain power waveform with high computational efficiency.
An information retrieval system based on artificial intelligence techniques
Authors: Dario De Jaco, Gianluca Garbolino
Venue: Proceedings of the 9th annual international ACM SIGIR conference on Research and development in information retrieval (1986)

This paper describes a possible use of Artificial Intelligence models and techniques in the design of a small Information Retrieval system. In particular, some knowledge representation models, such as semantic networks and frame-like structures, are viewed as interesting tools for the implementation of a thesaurus, and also for a description of the stored documents' contents. In addition, a parser based on the ATN (Augmented Transition Network) model which can analyze Italian sentences concerning a legal domain is described. We are including it in an user/system interface whose goal is to provide the user with the possibility of expressing search topics by using noun phrases or other linguistic expressions, rather than single words or Boolean combinations of them. Finally, some tasks requiring automated reasoning facilities are outlined. The Kernel of the system, i.e. the component which both performs traditional information retrieval and allows the insertion of new documents, is described in an appendix. It was first applied to a bibliographic database containing about a thousand references (with abstracts) of both papers and books concerned with Artificial Intelligence; now we are working on its application to a legal domain, with a database of laws, decrees and sentences concerning pollution and environmental protection.
Scalable simulation models for construction operations
Authors: Photios G. Ioannou, Julio C. Martinez
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Construction operations are often repetitive not only in terms of time (the same tasks are performed over and over) but also in terms of space (the same tasks are repeated at several places, such as different floors in a high-rise building). Thus, construction simulation models in general must be cyclic to represent temporal repetitions, but also scaleable to represent spatial repetitions. This paper presents the mechanisms for preprocessor replacement and automatic code generation that have been designed and implemented to facilitate the development of scaleable simulation models in STROBOSCOPE, a general-purpose discrete-event simulation system developed by the authors. A relatively complex simulation model for the vertical transportation of people serves as an example to illustrate how to develop a completely scaleable model for the operation of an elevator in a building with any number of floors.
Compaction with incremental over-constraint resolution
Authors: W. L. Schiele
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

The occurrence and resolution of over-constraints in one-dimensional layout compaction will be discussed. A new algorithm is given which solves the longest path problem in the constraint graph and resolves all positive cycles either by constraint relaxation or by jog generation. The presented algorithm eliminates the positive cycles one at a time and reuses the intermediate results, which had been obtained up to the point when the cycle was detected. Thus, the amount of additional effort required for the over-constraint resolution is very low. Some typical over-constrained situations and their solutions are shown. The algorithm has been implemented in a mask compaction program that is currently in use for process migration and design rule error correction at SIEMENS. CPU-times gained during the process migration of a microcontroller layout are given.
A General Motion Model and Spatio-Temporal Filters forComputing Optical Flow
Authors: Hongche Liu, Tsai-Hong Hong, Martin Herman, Rama Chellappa
Venue: International Journal of Computer Vision (1997)

Traditional optical flow algorithms assume local image translational motion and apply simple image filtering techniques. Recent studies have taken two separate approaches toward improving the accuracy of computed flow: the application of spatio-temporal filtering schemes and the use of advanced motion models such as the affine model. Each has achieved some improvement over traditional algorithms in specialized situations but the computation of accurate optical flow for general motion has been elusive. In this paper, we exploit the interdependency between these two approaches and propose a unified approach. The general motion model we adopt characterizes arbitrary 3-D steady motion. Under perspective projection, we derive an image motion equation that describes the spatio-temporal relation of gray-scale intensity in an image sequence, thus making the utilization of 3-D filtering possible. However, to accommodate this motion model, we need to extend the filter design to derive additional motion constraint equations. Using Hermite polynomials, we design differentiation filters, whose orthogonality and Gaussian derivative properties insure numerical stability; a recursive relation facilitates application of the general nonlinear motion model while separability promotes efficiency. The resulting algorithm produces accurate optical flow and other useful motion parameters. It is evaluated quantitatively using the scheme established by Barron et al. (1994) and qualitatively with real images.
Generalization of Clauses Relative to a Theory
Authors: Peter Idestam-Almquist
Venue: Machine Learning (1997)

Plotkin&lsquo;s notions of relative &thetas;-subsumption and relative least general generalization of clauses are defined for full clauses, and they are defined in terms of a kind of resolution derivations called C-derivations. Techniques for generalization of clauses relative to a theory, based on the V-operators or saturation in its original form, have primarily been developed for Horn clauses. We show that these techniques are incomplete for full clauses, which is due to the restricted form of resolution derivations considered. We describe a technique for generalization of clauses relative to a theory, which is based on a generalization of the original saturation technique. We prove that our technique properly inverts C-derivations, and that it is complete for full clauses w.r.t. relative &thetas;-subsumption.
Microsystems and Smart Sensor Interfaces: A Review
Authors: Franco Maloberti, Piero Malcovati
Venue: Analog Integrated Circuits and Signal Processing (1998)

Future integrated microsystems will benefit significantly from progress in the VLSI field. Two key elements will boost the implementation of new micro-integrated architectures: progress in batch-manufactured silicon sensors and the introduction of new circuit techniques for designing interface circuits. These two factors will be essential in favoring the transition from the present &rsquo;&rsquo;research driven speculations&lsquo;&lsquo; to &rsquo;&rsquo;customer driven activities&lsquo;&lsquo;. This paper discusses the key issues in realizing microsensors and the most suitable circuit techniques for interfacing and processing their output signals. A number of examples of integrated structures will illustrate present problems and possible solutions.
Security risks in computer-communication systems
Authors: Peter Neumann
Venue: ACM SIGSAC Review (1997)

This section provides a few highlights from the Risks-Forum Digest relating to security and privacy. Pointers '(R i j)' to items in the on-line Risks Forum denote RISKS vol i number j. The RISKS archives are available on ftp.sri.com, cd risks. Please send RISKS-related items to risks@CSL.sri.com. Read RISKS as a newsgroup (comp.risks), or subscribe via the automated listserv at risks-request@CSL.sri.com. Peter G. Neumann, SRI International EL-243,333 Ravenswood Ave., Menlo Park CA 94025-3493 (1-415-859-2375; neumann@csl.sri.com).
Shape Spectrum Based View Grouping and Matching of 3D Free-Form Objects
Authors: Chitra Dorai, Anil K. Jain
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

We address the problem of constructing view aspects of 3D free-form objects for efficient matching during recognition. We introduce a novel view representation based on "shape spectrum" features, and propose a general and powerful technique for organizing multiple views of objects of complex shape and geometry into compact and homogeneous clusters. Our view grouping technique obviates the need for surface segmentation and edge detection. Experiments on 6,400 synthetically generated views of 20 free-form objects and 100 real range images of 10 sculpted objects demonstrate the good performance of our shape spectrum based model view selection technique.
In Search of Controlled Evidence for Health Care Quality Improvement
Authors: E. Andrew Balas, Marcia G. Stockham, Joyce A. Mitchell, Mary Ellen Sievert, Bernard G. Ewigman, Suzanne Austin Boren
Venue: Journal of Medical Systems (1997)

The purpose of this study was to measure the efficiency of simple searches in retrieving controlled evidence about specific primary health care quality improvement interventions and their effects. Searches were conducted to retrieve evidence on seven interventions and seven effect variables. Specific words and the closest Medical Subject Headings (MeSH) recommended by professional librarians were used to search the MEDLINE database. Searches were restricted to the MeSH publication type &ldquo;randomized controlled trial.&rdquo; Two reviewers independently judged retrieved citations for relevancy to the selected interventions and effects. In selecting MeSH terms, the average agreement among librarians was 64.3% (&plusmn;26.1) for interventions and 57.1% (&plusmn;19.9) for effects. Analysis of the 755 retrieved reports showed that MeSH term searches had an overall recall rate of 58% while the same rate for textword searches was significantly lower (11%, p < .001). The difference in overall precision rates was nonsignificant (26% versus 33%, p &equals; .15). In the group of MeSH searches, overall precision and recall was significantly lower for effects than for interventions (12% versus 52%, p < .001 and 41% versus 69%, p < .001). Two textwords appeared in more than 25% of the benchmark collection: reminder (25.7%) and cost (25.0%). The results of this study indicate that information needs for health care quality improvement cannot be met by simple literature searches. Certain MeSH terms and combinations of textwords yield moderately efficient recall and precision in literature searches for health care quality improvement. Clinicians and physician executives gaining direct access to bibliographic database could probably be better served by structured indexing of critical aspects of randomized controlled clinical trials: design, sample, interventions, and effects.
Statistical considerations in simulation on a network of microcomputers
Authors: William E. Biles, Cheryl M. Daniels, Tamilea J. O'Donnell
Venue: Proceedings of the 17th conference on Winter simulation (1985)

Statistical considerations in simulating complex systems on a hierarchical network of low-cost microcomputers are discussed. Network configurations, allocation of computer tasks to nodes of the network, and assignment of simulation trials are examined. The binary tree and its X-tree variant are found to be especially attractive network configurations in simulation applications with simulation tasks assigned to nodes according to a model-frame/experiment-frame/output-frame trichotomy. Procedures for performing designed simulation experiments, including factor screening experiments, and for conducting variance reduction through manipulation of random number streams are presented.
DCASR data input workload capacity study: interim report
Authors: Lance M. Roark
Venue: Proceedings of the 17th conference on Winter simulation (1985)

Each DCASR headquarters is responsible for the Mechanization of Contract Administration Services (MOCAS). This is an automated data system which provides management and operational data on delivery schedules, shipments, contractual changes and disbursements to contractors. At each DCASR, information is extracted from contractual and delivery documents by data input clerks and entered into the MOCAS system. One recent enhancement of MOCAS is the development of an on-line capability for data input. The response time of this new on-line capability is the factor of interest in this study. The purpose of this project was to perform an operations research study on developing standards or threshold values for response times for the on-line input of contractual and delivery documents. Such standards would be the maximum allowable values of response time consistent with the size of document backlogs being within an acceptable range. By establishing standards for response time, it is then possible to determine the level of ADP capacity necessary to meet the needs of the functional users of the new MOCAS Phase II System. This is far preferable to sizing ADP requirements based on an arbitrary level of CPU utilization. This interim report documents the study results to date for DCASR-Atlanta and DCASR-Cleveland. This report also describes the specific tasks and milestones to be accomplished for the remainder of this project. To provide the earliest possible identification of any potential workload capacity problems, emphasis will be placed on the largest DCASRs (Los Angeles, Boston, Philadelphia, and New York).