ppxscal/embedding_network huggingface dataset:
Simulated quenching: a new placement method for module generation
Authors: Shinji Sato
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

This paper addresses a placement method good for module generation. Conventional partitioning based method can not guarantee the best quality in consecutive partitioning, even if it can find a sequence of the minimum partitioning of a circuit into two subcircuits. Also, when size of cells varies very much, which is often seen in module generation as leaf cells, it is sometimes too strong constraint for them to get the minimum partitioning under ``partitioning into two similar size of subcircuits''. On the other hand, although conventional Simulated Annealing (SA) based method gives a better result, it requires extremely long computation time, since they do not employ any divide and conquer technique. It is the purpose of this paper to propose an algorithm which is based on SA method and employs the divide and conquer technique so that it gives better quality than partitioning based method and also it gives drastically faster computation time than SA method. As the first step, we applied this idea to the linear placement. Our algorithm is based on sorting inside subgroups, and this subgroup generation is done by plural cut-lines with a constant pitch. This constant pitch will be decreased from sufficiently large value to small value gradually, and this decreasing schedule is similar to the cooling schedule of SA method. And also, since there is a variation of offset in applying cut-lines even with the same pitch value, we randomly select one of them like SA method chooses a pair of components to be switched at random. Sorting inside subgroups is only a rearrangement depending on the connection between subgroups and is very fast. It is found that the total wiring length is improved about 10% compared to that of spectral method which was recognized to be the best (SLPC2). Also, computation time was dramatically reduced over the SA method.
Three-Dimensional Finite Element Methods for the Stokes Problem
Authors: Daniele Boffi
Venue: SIAM Journal on Numerical Analysis (1997)

The tetrahedral finite element approximation of the Stokes problem is analyzed by means of polynomials piecewise of degree k+1 for the velocity and continuous piecewise of degree k for the pressure. A stability result is given for every $k\ge 1$.
The under-appreciated unfold
Authors: Jeremy Gibbons, Geraint Jones
Venue: Proceedings of the third ACM SIGPLAN international conference on Functional programming (1998)

Folds are appreciated by functional programmers. Their dual, unfolds, are not new, but they are not nearly as well appreciated. We believe they deserve better. To illustrate, we present (indeed, we calculate) a number of algorithms for computing the breadth-first traversal of a tree. We specify breadth-first traversal in terms of level-order traversal, which we characterize first as a fold. The presentation as a fold is simple, but it is inefficient, and removing the inefficiency makes it no longer a fold. We calculate a characterization as an unfold from the characterization as a fold; this unfold is equally clear, but more efficient. We also calculate a characterization of breadth-first traversal directly as an unfold; this turns out to be the 'standard' queue-based algorithm.
Analytical Derivatives for Markov Switching Models
Authors: Jeff Gable, Simon Van Norden, Robert Vigfusson
Venue: Computational Economics (1997)

This paper presents analytical gradients for a broad class of regime-switching models with Markovian state-transition probabilities. Such models are usually estimated by maximum likelihood methods, which require the derivatives of the likelihood function with respect to the parameter vector. These gradients are usually calculated by means of numerical techniques. The paper shows that analytical gradients considerably speed up maximum-likelihood estimation.
Improved methods of simulating RLC couple and uncoupled transmission lines based on the method of characteristics
Authors: Carol V. Gura, Jacob A. Abraham
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

This paper describes new techniques for simulating lossy (RLC) transmission lines based on the method of characteristics. For uncoupled lossy transmission lines a method is presented which speeds up the simulation time by a factor of two compared with existing techniques. A method is also presented for the transient analysis of coupled lossy lines in an inhomogeneous medium. Previously, simulation techniques were limited to coupled lossy lines in a homogeneous medium.
Dispatching on the function result
Authors: Mordechai Ben-Ari
Venue: ACM SIGAda Ada Letters (1998)

This paper is a tutorial on dynamic dispatching of functions with a controlling result. A case shows how to use this construct to replicate a value extracted from a heterogeneous data structure.
A Note on Learning from Multiple-Instance Examples
Authors: Avrim Blum, Adam Kalai
Venue: Machine Learning (1998)

We describe a simple reduction from the problem of PAC-learning from multiple-instance examples to that of PAC-learning with one-sided random classification noise. Thus, all concept classes learnable with one-sided noise, which includes all concepts learnable in the usual 2-sided random noise model plus others such as the parity function, are learnable from multiple-instance examples. We also describe a more efficient (and somewhat technically more involved) reduction to the Statistical-Query model that results in a polynomial-time algorithm for learning axis-parallel rectangles with sample complexity&Otilde;(d^2r/&epsiv;^2) , saving roughly a factor of r over the results of Auer et al. (1997).
A brief introduction to regions
Authors: Mads Tofte
Venue: Proceedings of the 1st international symposium on Memory management (1998)

The paper gives an overview of region-based memory management. The emphasis of the paper is on the dynamic aspects of execution, specifically memory management. We illustrate how three static program analyses can be used for inferring memory management directives. They are region inference, physical size inference, and storage mode analysis. We describe these analyses for a skeletal language inspired by Standard ML. We also describe a region-based runtime system for the skeletal language, based on the runtime system of the ML Kit with Regions.
Tournament play in CS1
Authors: Roy P. Pargas, Joe C. Lundy, John N. Underwood
Venue: ACM SIGCSE Bulletin (1997)

This paper describes the fifth programming assignment given to three CS1 sections in the Fall semester of 1995. The assignment was to design and implement in Ada a program that plays the game of Nim. The students' programs were to accomplish two goals: (1) play and defeat the instructor's Nim playing program, and (2) participate in a course-wide computer-Nim tournament. This paper explains how the assignment was presented to the students, how the game playing programs were developed and evaluated, how the tournament was conducted, the results of the tournament, and an evaluation of the whole exercise.
The Robot Localization Problem
Authors: Leonidas J. Guibas, Rajeev Motwani, Prabhakar Raghavan
Venue: SIAM Journal on Computing (1997)

We consider the following problem: given a simple polygon ${\cal P}$ and a star-shaped polygon ${\cal V}$, find a point (or the set of points) in ${\cal P}$ from which the portion of ${\cal P}$ that is visible is translation-congruent to ${\cal V}$. The problem arises in the localization of robots equipped with a range finder and a compass---${\cal P}$ is a map of a known environment, ${\cal V}$ is the portion visible from the robot's position, and the robot must use this information to determine its position in the map. We give a scheme that preprocesses ${\cal P}$ so that any subsequent query ${\cal V}$ is answered in optimal time O(m + log n + A), where m and n are the number of vertices in ${\cal V}$ and ${\cal P}$ and A is the number of points in ${\cal P}$ that are valid answers (the output size). Our technique uses O(n5) space and preprocessing in the worst case; within certain limits, we can trade off smoothly between the query time and the preprocessing time and space. In the process of solving this problem, we also devise a data structure for output-sensitive determination of the visibility polygon of a query point inside a polygon ${\cal P}$. We then consider a variant of the localization problem in which there is a maximum distance to which the robot can "see"---this is motivated by practical considerations, and we outline a similar solution for this case. We finally show that a single localization query ${\cal V}$ can be answered in time O(mn) with no preprocessing.
Reengineering the United States Army's tactical command and control operational architecture for information operations
Authors: Robert G. Phelan,  Jr., Michael L. McGinnis
Venue: Proceedings of the 28th conference on Winter simulation (1996)

During the past few years, the Army has undertaken a major effort to integrate computer, information, and communication technologies throughout the force. These technologies have made a profound impact on the Army's tactical command and control (C/sup 2/) processes, especially at division and below. This paper presents a computer simulation model to support the reengineering of the United States Army's staff organization at division and below for information operations. The simulation model under development will provide force planners with a tool for methodically conducting comparative analyses of specific alternatives for reengineering tactical level Army staffs to improve efficiency and effectiveness of staff work related to information operations.
Best-effort versus reservations: a simple comparative analysis
Authors: Lee Breslau, Scott Shenker
Venue: Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication (1998)

Using a simple analytical model, this paper addresses the following question: Should the Internet retain its best-effort-only architecture, or should it adopt one that is reservation-capable? We characterize the differences between reservation-capable and best-effort-only networks in terms of application performance and total welfare. Our analysis does not yield a definitive answer to the question we pose, since it would necessarily depend on unknowable factors such as the future cost of network bandwidth and the nature of the future traffic load. However, our model does reveal some interesting phenomena. First, in some circumstances, the amount of incremental bandwidth needed to make a best-effort-only network perform as well as a reservation capable one diverges as capacity increases. Second, in some circumstances reservation-capable networks retain significant advantages over best-effort-only networks, no matter how cheap bandwidth becomes. Lastly, we find bounds on the maximum performance advantage a reservation-capable network can achieve over best-effort architectures.
Strategic directions in research in theory of computing
Authors: Anne Condon, Faith Fich, Greg N. Frederickson, Andrew V. Goldberg, David S. Johnson, Michael C. Loui, Steven Mahaney, Prabhakar Raghavan, John E. Savage, Alan L. Selman, David B. Shmoys
Venue: ACM SIGACT News (1997)

This report focuses oll two core areas of theory of computing: discrete algorithms and computational complexity theory. The report reviews the purposes and goals of theoretical research, summarizes selected past and recent achievements, explains the importance of sustaining core research, and identifies promising opportunities for filture research. Some research opportunities build bridges between theory of computing and other areas of computer science, and other science and engineering disciplines.
Sequential Updating of Projective and Affine Structure from Motion
Authors: P. A. Beardsley, A. Zisserman, D. W. Murray
Venue: International Journal of Computer Vision (1997)

A structure from motion algorithm is described which recovers structure and camera position, modulo a projective ambiguity. Camera calibration is not required, and camera parameters such as focal length can be altered freely during motion. The structure is updated sequentially over an image sequence, in contrast to schemes which employ a batch process. A specialisation of the algorithm to recover structure and camera position modulo an affine transformation is described, together with a method to periodically update the affine coordinate frame to prevent drift over time. We describe the constraint used to obtain this specialisation.Structure is recovered from image corners detected and matched automatically and reliably in real image sequences. Results are shown for reference objects and indoor environments, and accuracy of recovered structure is fully evaluated and compared for a number of reconstruction schemes. A specific application of the work is demonstrated&mdash;affine structure is used to compute free space maps enabling navigation through unstructured environments and avoidance of obstacles. The path planning involves only affine constructions.
Realistic scheduling: compaction for pipelined architectures
Authors: Alexandru Nicolau, Roni Potasman
Venue: Proceedings of the 23rd annual workshop and symposium on Microprogramming and microarchitecture (1990)

This paper presents an approach for the development of microcode for parallel and pipelined machines. The approach is geared towards mapping programs with real-time constraints and/or massive time requirements onto synchronous parallel computers (VLIW's, superscalars and microengines). In order to exploit the maximal parallelism from such machines, both spatial (multiple functional units) and temporal (pipelined) capabilities of the architecture need to be exploited. Until now, parallelizing compilers for parallel machines have not fully taken advantage of pipelining capabilities: they have either assumed that all operations take one cycle or have added pipelining as an after thought. These approaches restrict the speed-up. We built a system which is based on a set of low-level transformations called Pipelined Percolation Scheduling (PPS). The transformations integrate the exploitation of temporal and spatial parallelism. Although these low-level transformations are integrated into our system they are self-contained and may be used separately by applying 'higher level' transformations (on top of PPS) to optimize performance for a target architecture.
Analyzing and measuring reusability in object-oriented design
Authors: Margaretha W. Price, Steven A. Demurjian,  Sr.
Venue: Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications (1997)

In this paper, we present a technique to analyze and measure the reusability of object-oriented (OO) designs. The metrics can be incorporated into a design/development environment, so that reusability measurements, analysis, and improvements can be part of "business as usual" for an organization. Design reusability measurements also enable early identification of poor reuse potential, when it is still possible to modify/refine the design. The essential components of our approach are two reuse-specific characterizations of classes and hierarchies, and a set of metrics which objectively measures the dependencies among design components based on those reuse-specific characterizations.
Matrix Analysis of a Two-Stage-Splitting Iteration for Maximum Penalized Likelihood Estimation
Authors: S. Yu, G. A. Latham, R. S. Anderssen
Venue: SIAM Journal on Matrix Analysis and Applications (1997)

Motivated by operator splitting, a new two-stage-splitting iteration is proposed for the solution of maximum penalized likelihood estimation (MPLE) problems. The resulting algorithm, called two-step-late (TSL), is as practical and as easily implemented as the one-step-late (OSL) algorithm. Matrix analysis is applied to compare the rates of convergence of the TSL and OSL algorithms. It is proved that under quite general conditions for which OSL and TSL converge to the same solution the rate of convergence of TSL exceeds that of two steps of OSL, which is its computational counterpart. Numerical experimentation can then be used to check the range of the smoothing parameter for which these proofs hold.
COSMOS-A Representation Scheme for 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 representing and recognizing 3D free-form objects when 1) the object viewpoint is arbitrary, 2) the objects may vary in shape and complexity, and 3) no restrictive assumptions are made about the types of surfaces on the object. We assume that a range image of a scene is available, containing a view of a rigid 3D object without occlusion. We propose a new and general surface representation scheme for recognizing objects with free-form (sculpted) surfaces. In this scheme, an object is described concisely in terms of maximal surface patches of constant shape index. The maximal patches that represent the object are mapped onto the unit sphere via their orientations, and aggregated via shape spectral functions. Properties such as surface area, curvedness, and connectivity, which are required to capture local and global information, are also built into the representation. The scheme yields a meaningful and rich description useful for object recognition. A novel concept, the shape spectrum of an object is also introduced within the framework of COSMOS for object view grouping and matching. We demonstrate the generality and the effectiveness of our scheme using real range images of complex objects.
Simulation Techniques for the Manufacturing Test of MCMs
Authors: Mick Tegethoff, Tom Chen
Venue: Journal of Electronic Testing: Theory and Applications (1997)

Simulation techniques used in the Manufacturing Test SIMulator (MTSIM) are described. MTSIM is a Concurrent Engineering tool used to simulate the manufacturing test and repair aspects of boards and MCMs from design concept through manufacturing release. MTSIM helps designers select assembly process, specify Design For Test (DFT) features, select board test coverage, specify ASIC defect level goals, establish product feasibility, and predict manufacturing quality and cost goals. A new yield model for boards and MCMs which accounts for the clustering of solder defects is introduced and used to predict the yield at each test step. In addition, MTSIM estimates the average number of defects per board detected at each test step, and estimates costs incurred in test execution, fault isolation and repair. MTSIM models were validated with high performance assemblies at Hewlett-Packard (HP).
A high performance multi-structured file system design
Authors: Keith Muller, Joseph Pasquale
Venue: ACM SIGOPS Operating Systems Review (1991)

File system I/O is increasingly becoming a performance bottleneck in large distributed computer systems. This is due to the increased file I/O demands of new applications, the inability of any single storage structure to respond to these demands, and the slow decline of, disk access times (latency and seek) relative to the rapid increase in CPU speeds, memory size, and network bandwidth.We present a multi-structured file system designed for high bandwidth I/O and fast response. Our design is based on combining disk caching with three different file storage structures, each implemented on an independent and isolated disk array. Each storage structure is designed to optimize a different set of file system access characteristics such as cache writes, directory searches, file attribute requests or large sequential reads/writes.As part of our study, we analyze the performance of an existing file system using trace data from UNIX disk I/O-intensive workloads. Using trace driven simulations, we show how performance is improved by using separate storage structures as implemented by a multi-structured file system.
Exact Learning of Formulas in Parallel
Authors: Nader H. Bshouty
Venue: Machine Learning (1997)

We investigate the parallel complexity of learning formulas from membership and equivalence queries. We show that many restricted classes of boolean functions cannot be efficiently learned in parallel with a polynomial number of processors.
On the Positive Definite Solutions to the 2-D Continuous-timeLyapunov Equation
Authors: Chengshan Xiao, P. Agathoklis, David J. Hill
Venue: Multidimensional Systems and Signal Processing (1997)

The very strict positive real lemma is further developed for nonminimal 1-D continuous-time systems and is used to study the 2-D continuous-time Lyapunov equation. Based on it, an extended condition for the bivariate characteristic polynomial of a matrix to be very strict Hurwitz is proposed for general 2-D analog systems with characteristic polynomials involving 1-D factor polynomials. It is also shown that in such a case the bivariate polynomial can be decomposed into a 2-D bivariate polynomial with the corresponding matrix satisfying certain controllability and observability conditions and into up to two 1-D polynomials. Further, two algorithms for computing the positive definite solutions to the 2-D Lyapunov equation are presented.
Feedback Stabilizability of MIMO n-D Linear Systems
Authors: Zhiping Lin
Venue: Multidimensional Systems and Signal Processing (1998)

The problem of output feedback stabilizability of multi-input-multi-output (MIMO) multidimensional (n-D) linear systems is investigated using n-D polynomial matrix theory. A simple necessary and sufficient condition for output feedback stabilizability of a given MIMO n-D linear system is derived in terms of the generating polynomials associated with any matrix fraction descriptions of the system. When a given unstable plant is feedback stabilizable, constructive method is provided for obtaining a stabilizing compensator. Moreover, a strictly causal compensator can always be constructed for a causal (not necessarily strictly causal) plant. A non-trivial example is illustrated.
A Mixed Integer Programming Model for Solving a Layout Problem in the Fashion Industry
Authors: Zeger Degraeve, Martina Vandebroek
Venue: Management Science (1998)

The cutting operation in the high fashion clothing industry essentially involves putting several layers of cloth on a long cutting table and fixing templates of the parts of several articles on top of the stack before the actual cutting can be initiated. This is a very time-consuming task giving raise to high setup costs in addition to waste production resulting from the cutting process. Total production costs can then be optimized by minimizing the number of these setups while at the same time producing little or no waste. In this paper a mixed integer programming model is proposed that searches for an optimal set of cutting patterns, each giving a combination of articles to be cut in one operation, and corresponding stack heights.
Subdivision Direction Selection in Interval Methods for Global Optimization
Authors: T. Csendes, D. Ratz
Venue: SIAM Journal on Numerical Analysis (1997)

The role of the interval subdivision-selection rule is investigated in branch-and-bound algorithms for global optimization. The class of rules that allows convergence for the model algorithm is characterized, and it is shown that the four rules investigated satisfy the conditions of convergence. A numerical study with a wide spectrum of test problems indicates that there are substantial differences between the rules in terms of the required CPU time, the number of function and derivative evaluations, and space complexity, and two rules can provide substantial improvements in efficiency.