ppxscal/embedding_network huggingface dataset:
Interprocedural conditional branch elimination
Authors: Rastislav Bodík, Rajiv Gupta, Mary Lou Soffa
Venue: Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation (1997)

The existence of statically detectable correlation among conditional branches enables their elimination, an optimization that has a number of benefits. This paper presents techniques to determine whether an interprocedural execution path leading to a conditional branch exists along which the branch outcome is known at compile time, and then to eliminate the branch along this path through code restructuring. The technique consists of a demand driven interprocedural analysis that determines whether a specific branch outcome is correlated with prior statements or branch outcomes. The optimization is performed using a code restructuring algorithm that replicates code to separate out the paths with correlation. When the correlated path is affected by a procedure call, the restructuring is based on procedure entry splitting and exit splitting. The entry splitting transformation creates multiple entries to a procedure, and the exit splitting transformation allows a procedure to return control to one of several return points in the caller. Our technique is efficient in that the correlation detection is demand driven, thus avoiding exhaustive analysis of the entire program, and the restructuring never increases the number of operations along a path through an interprocedural control flow graph. We describe the benefits of our interprocedural branch elimination optimization (ICBE). Our experimental results show that, for the same amount of code growth, the estimated reduction in executed conditional branches is about 2.5 times higher with the ICBE optimization than when only intraprocedural conditional branch elimination is applied.
OPTIMIST: state minimization for optimal 2-level logic implementation
Authors: Robert M. Fuhrer, Steven M. Nowick
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

We present a novel method for state minimization of incompletely-specified finite state machines. Where classic methods simply minimize the number of states, ours directly addresses the implementation's logic complexity, and produces an exactly optimal implementation under input encoding. The method incorporates optimal ``state mapping'', i.e., the process of reducing the symbolic next-state relation which results from state splitting to an optimal conforming symbolic function. Further, it offers a number of convenient sites for applying heuristics to reduce time and space complexity, and is amenable to implementation based on implicit representations. Although our method currently makes use of an input encoding model, we believe it can be extended smoothly to encompass output encoding as well.
Decoding Affine Variety Codes Using Gr&ouml;bner Bases
Authors: J. Fitzgerald, R. F. Lax
Venue: Designs, Codes and Cryptography (1998)

We define a class of codes that we call affine variety codes. These codes are obtained by evaluating functions in the coordinate ring of an affine variety on all the F_q-rational points of the variety. We show that one can, at least in theory, decode these codes up to half the true minimum distance by using the theory of Gr&ouml;bner bases. We extend results of A. B. Cooper and of X. Chen, I. S. Reed, T. Helleseth, and T. K. Truong.
Strategic layout planning and simulation for lean manufacturing: a LayOPT tutorial
Authors: Eric S. Grajo
Venue: Proceedings of the 28th conference on Winter simulation (1996)

LayOPT/sup TM/ is an innovative facilities layout analysis and optimization software package which can be used by layout planners and engineers in the optimal solution of single and multiple floor facility layout problems. LayOPT is ideal for the re-design of the overall layout for an existing facility or the development of a block layout for a new building. It can be applied to manufacturing, warehouse, office, and various service facility layout problems. This tutorial describes the LayOPT methodology and presents an overview of the software's features and capabilities.
Consistent Global Checkpoints that Contain a Given Set of Local Checkpoints
Authors: Yi-Min Wang
Venue: IEEE Transactions on Computers (1997)

In this paper, we consider the problem of constructing consistent global checkpoints that contain a given set of checkpoints. We address three important issues related to this problem. First, we define the maximum and minimum consistent global checkpoints containing a set S, and give algorithms to construct them. These algorithms are based on reachability analysis on a rollback-dependency graph. Second, we introduce a concept called "rollback-dependency trackability" that enables this analysis to be performed efficiently for a certain class of checkpoint and communication models. We define the least stringent of these models ("FDAS"), and put it in context with other models defined in the literature. Significant in this is a way to use FDAS to provide efficient rollback recovery for applications that do not satisfy perfect piecewise determinism. Finally, we describe several applications of the theorems and algorithms derived in this paper to demonstrate the capability of our approach to unify, generalize, and extend many previous works.
Optimization of manufacturing system simulations using perturbation analysis and SENSE
Authors: Rajan Suri, Gregory W. Diehl, Yu-Chi Ho
Venue: Proceedings of the 17th conference on Winter simulation (1985)

Perturbation Analysis (P/A) of discrete event systems is a recent technique which enables sensitivity analysis of decision parameters from a single simulation run. Thus, from a single simulation of a manufacturing design, one can estimate the effects of changing many different decisions such as adding more machines or fixtures, changing buffer sizes or changing lot sizes. The first part of this paper gives an overview of this new technique. The second part describes SENSE (SENSitivity Evaluator), a software package implementing the theories of P/A in easily usable form. Application of SENSE to GPSS/H simulations is described, with examples of its use for the design of flow lines at a major U.S. corporation. By using SENSE a simulation team is able to improve their designs in less time, and with less manpower and CPU-time, than previously required. The result is better designs and better turnaround time for simulation activities in general.
Parallel channel routing
Authors: Mehdi R. Zargham
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

A parallel algorithm is proposed for solving the problem of channel and switchbox routing in the design of VLSI chips. The algorithm is suitable for implementation on a shared-memory multiprocessor environment. Our approach does not impose restrictions on the channel type (such as fix or variable channel widths) and the number of available layers. The algorithm contains three major phases: 1) dividing the channel into several regions by selecting some columns, 2) assigning tracks to nets of the selected columns, and 3) assigning tracks to nets of the columns in each region.
A Note on Some Phase Differencing Algorithms for Disparity Estimation
Authors: Li-Dong Cai, John Mayhew
Venue: International Journal of Computer Vision (1997)

Disparity can be estimated from the local phase differences between a pair of stereo images after Gabor filterings. In this paper, some phase differencing algorithms are discussed from the point of view of numerical computation. They are all categorised as certain types of Newton iterations, hence are restricted by the preconditions of Newton iterations. Furthermore, a numerical sensitivity analysis is made for phase computation near its singularity points without referring to any specific filtering method. It makes clear that the numerical instability has its roots in the singularities of the phase functions themselves rather than in their derivatives, therefore severe errors cannot be properly reduced by Newton iterations. Hence, the singularity problem must be carefully treated for any disparity estimation using phase differencing techniques. In the case of foveal vision, such as target detection or vergence control, the central parts of scenes are of interest. A shift-trials algorithm is proposed to contain the effects of singularities instead of relying on detection and removal of singularity neighbourhoods through local computation. This algorithm directly tackles the singularity problem by posing the local disparity estimations as a minimisation of the phase differences of the left and right views in terms of a global matching residual norm. By a direct search for solution, no numerical derivative is needed, phase singularity can be tolerated and robust results are thus produced.
Designing an information retrieval interface based on user characteristics
Authors: Christine L. Borgman, Donald Case, Charles T. Meadow
Venue: Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval (1985)

With the increasing number of information retrieval systems and databases available and the increasing demand of end users to utilize the systems, a need exists for improved interfaces and improved training mechanisms. This paper reports on a project to develop an integrated online instruction and assistance system to be used as a &ldquo;front end&rdquo; to the U.S. Department of Energy's RECON retrieval system. The conceptual framework for the interface design is based on individual characteristics of its current and prospective users, predominantly scientists conducting energy research. We are building a prototype based on information gained from interviews with scientists using the system (either directly or through a search intermediary) and interviews with search intermediaries. The paper reports on research in progress, including the results of the interviews and the preliminary design of the interface. The conference presentation will include a fuller description of the interface than can be specified here.
State transformation in event driven explicit simulation
Authors: Tuyen V. Nguyen, Anirudh Devgan
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

This paper presents a general method for incorporating state transformation in event driven explicit simulation. One inherent assumption in this type of simulation algorithm is the state independence, which allows the algorithm to process the states independently in an event driven manner at the transistor level. Numerical problems arise when an inappropriate state representation of the circuit, in which the states are not truly independent, is chosen. In principle, any similarity transformation of the state equation can be employed to transform the circuit into a more convenient state space for numerical solution. This paper develops a systematic scheme to derive an appropriate state transformation, and to incorporate the state transformulation in such a way to maintain the efficiency of event driven explicit simulation algorithms.
Nondegeneracy Concepts for Zeros of Piecewise Smooth Functions
Authors: Roman Sznajder, Seetharama Gowda
Venue: Mathematics of Operations Research (1998)

A zero of a piecewise smooth function f is said to be nondegenerate if the function is Frechet differentiable at that point. Using this concept, we describe the usual nondegeneracy notions in the settings of nonlinear (vertical, horizontal, mixed) complementarity problems and the variational inequality problem corresponding to a polyhedral convex set. Some properties of nondegenerate zeros of piecewise affine functions are described. We generalize a recent result of Ferris and Pang on the existence of a nondegenerate solution of an affine variational inequality problem which itself is a generalization of a theorem of Goldman and Tucker.
A Control Method for Assimilation of Surface Data in a Linearized Navier--Stokes-Type Problem Related to Oceanography
Authors: Aziz Belmiloudi, Françoise Brossier
Venue: SIAM Journal on Control and Optimization (1997)

A method of control is developed in order to compute the variability of the velocity and pressure $(u, p)$ in an oceanic doman $\Omega$ during a time $T$. The observation is the variability of $p$ of $\Gamma_0 \times ]0, T[$, where $\Gamma_0$ is the upper surface of $\Omega$ and corresponds to the undisturbed sea surface. The observation is deduced from satellite data. The control is the variability of the wind-stress $f$, which acts as the forcing of the perturbation. The mean circulation in $\Omega$ is supposed to be known. The equations verified by $(u, p)$ are linearized around this mean circulation. The continuity of the application: $f \rightarrow (u(f), p(f))$ in convenient functional spaces is proved. We deduce from this result the existence and uniqueness of an optimal control, which is characterized by a set of equations including the direct problem of linearized Navier--Stokes type verified by $(u, p)$ and the adjoint problem. The cost function and consequently the optimal control depend on a real parameter $\alpha$. We prove the convergence of the sequence $(f_{\alpha})$, when $\alpha$ tends to 0, toward a wind-stress $f$ which minimizes the distance between the observed and computed pressures. This result is obtained by means of minimizing sequences.
Graphical representation of programs in a demonstrational visual shell&mdash;an empirical evaluation
Authors: Francesmary Modugno, Albert T. Corbett, Brad A. Myers
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (1997)

An open question in the area of Programming by Demonstration (PBD) is how to best represent the inferred program. Without a way to view, edit, and share programs, PBD systems will never reach their full potential. We designed and implemented two graphical representation languages for a PBD desktop similar to the Apple Macintosh Finder. Although a user study showed that both languages enabled nonprogrammers to generate and comprehend programs, the study also revealed that the language that more closely reflected the desktop domain doubled users' abilities to accurately generate programs. Trends suggest that the same language was easier for users to comprehend. These findings suggest that it is possible for a PBD system to enable nonprogrammers to construct programs and that the form of the representation can impact the PBD system's effectiveness. A paper-and-pencil evaluation of the two versions of the PBD desktop prior to the study supported these finding and provided interesting feedback on the interaction between usability evaluations and user studies. In particular, the comparison of the paper-and-pencil evaluation with the empirical evaluation suggested that nonempirical evaluation techniques can provide guidance into how to interpret empirical data and, in particular, that PBD systems need to provide support for programming-strategy selection in order to be successful.
A power modeling and characterization method for macrocells using structure information
Authors: Jing-Yuan Lin, Wen-Zen Shen, Jing-Yang Jou
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

To characterize a macrocell, a general method is to store the power consumption of all possible transition events at primary inputs in the lookup tables. Though this approach is very accurate, the lookup tables could be huge for the macrocells with many inputs. In this paper, we present a new power modeling method which takes advantage of the structure information of macrocells and selects minimum number of primary inputs or internal nodes in a macrocell as state variables to build a state transition graph (STG). Those state variables can completely model the transitions of all internal nodes and the primary outputs. By carefully deleting some state variables, we further introduce an incomplete power modeling technique which can simplify the STG without losing much accuracy. In addition, we exploit the property of the compatible patterns of a macrocell to further reduce the number of edges in the corresponding STG. Experimental results show that our modeling techniques can provide SPICE-like accuracy and can reduce the size of the lookup table significantly comparing to the general approach.
Partial Surface and Volume Matching in Three Dimensions
Authors: Gill Barequet, Micha Sharir
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

In this paper we present a new technique for partial surface and volume matching of images in three dimensions. In this problem we are given two objects in 3-space, each represented as a set of points, and the goal is to find a rigid motion of one object which makes a sufficiently large portion of its boundary lying sufficiently close to a corresponding portion of the boundary of the second object. This is an important problem in pattern recognition and in computer vision, with many industrial, medical, and chemical applications. Our method treats separately the rotation and the translation components of the Euclidean motion that we seek. The algorithm steps through a sequence of rotations, in a steepest-descent style, and uses a novel technique for scoring the match for any fixed rotation. Experimental results on various examples, involving data from industrial applications, medical imaging, and molecular biology, are presented, and show the accurate and robust performance of our algorithm.
Predictive engineering models based on the EPIC architecture for a multimodal high-performance human-computer interaction task
Authors: David E. Kieras, Scott D. Wood, David E. Meyer
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (1997)

Engineering models of human performance permit some aspects of usability of interface designs to be predicted from an analysis of the task, and thus they can replace to some extent expensive user-testing data. We successfully predicted human performance in telephone operator tasks with engineering models constructed in the EPIC (Executive Process-Interactive Control) architecture for human information processing, which is especially suited for modeling multimodal, complex tasks, and has demonstrated success in other task domains. Several models were constructed on an a priori basis to represent different hypotheses about how operators coordinate their activities to produce rapid task performance. The models predicted the total time with useful accuracy and clarified some important properties of the task. The best model was based directly on the GOMS analysis of the task and made simple assumptions about the operator's task strategy, suggesting that EPIC models are a feasible approach to predicting performance in multimodal high-performance tasks.
An intelligent backtracking schema in a logic programming environment
Authors: Ilyas Cicekli
Venue: ACM SIGPLAN Notices (1997)

We present a new method to represent variable bindings in the Warren Abstract Machine (WAM), so that the ages of variable bindings can be easily found using this new representation in our intelligent backtracking schema. The age of a variable bound to a non-variable term is the youngest choice point such that backtracking to that choice point can make that variable an unbound variable again. The procedure backtracking point is the choice point of the procedure currently being executed or the choice point of its first ancestor having a choice point. Variable ages and procedure backtracking points are used in the process of figuring out backtracking points in our intelligent backtracking schema. Our intelligent backtracking schema performs much better than the results of other intelligent backtracking methods in the literature for deterministic programs, and its performance for non-deterministic programs are comparable with their results.
Simulation of casualty sustainment during naval combat operations
Authors: Christopher G. Blood, Michael S. Odowick, Jeffrey S. Marks
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Accurate forecasts of the casualties likely to be sustained during naval warfare allow sufficient resources to be programmed to meet the medical demands of the operation while at the same time minimizing resource overallocation. A simulation tool called the shipboard casualty projection system (SHIPCAS) has recently been developed to assist planners in medical resource programming. SHIPCAS is a forecasting tool that projects WIA (wounded-in-action), KIA (killed-in action), and DNBI (disease and non-battle injuries) incidence among naval surface forces. By simulating ship strikes during naval operations, SHIPCAS provides medical planners with the injury and illness estimates required to assist in determining the needed medical resources. The SHIPCAS system models casualties afloat by allowing the user to define a specific scenario in terms of task force composition, expected battle intensity, and length of operation. The model then produces graphical and tabular information detailing the total number of casualties across the operation, the daily average number of casualties, the maximum daily number of casualties, and the casualty rates per 1000 strength per day. In addition to projecting the number of ships hit and the resulting casualties, SHIPCAS also provides estimates of the temporal points in the operation during which ship strikes are most likely.
Computer science for the artist
Authors: L. A. Smith King, John Barr
Venue: ACM SIGCSE Bulletin (1997)

Computers are faster and cheaper than ever before and at the same time user interface advances make powerful applications more accessible to the non-computer scientist. In a diverse range of industries, it is now essential for non-computer scientists to create, modify and interact with sophisticated computer applications. Although improved interfaces like high-level scripting languages and visual programming environments, have changed the skill set needed to use the computer, a conceptual understanding of computing and computer interfaces is still required. The very advances allowing direct computer use by non-computer scientists have actually increased the need for computer literacy. Thus computer science departments should expand and enhance course offerings to give non-majors the conceptual understanding and skills they need to become sophisticated users/developers in their particular fields. This paper describes a series of courses developed at Ithaca College that are designed to provide multimedia programming skills and concepts to liberal arts majors.
Minimization of MRF Energy with Relaxation Labeling
Authors: Stan Z. Li, Han Wang, Kap Luk Chan, Maria Petrou
Venue: Journal of Mathematical Imaging and Vision (1997)

Recently, there has been increasing interest in Markov random field (MRF) modeling for solving a variety of computer vision problems formulated in terms of the maximum a posteriori (MAP) probability. When the label set is discrete, such as in image segmentation and matching, the minimization is combinatorial. The objective of this paper is twofold: Firstly, we propose to use the continuous relaxation labeling (RL) as an alternative approach for the minimization. The motivation is that it provides a good compromise between the solution quality and the computational cost. We show how the original combinatorial optimization can be converted into a form suitable for continuous RL. Secondly, we compare various minimization algorithms, namely, the RL algorithms proposed by Rosenfeld et al., and by Hummel and Zucker, the mean field annealing of Peterson and Soderberg, simulated annealing of Kirkpatrick, the iterative conditional modes (ICM) of Besag and an annealing version of ICM proposed in this paper. The comparisons are in terms of the minimized energy value (i.e., the solution quality), the required number of iterations (i.e., the computational cost), and also the dependence of each algorithm on heuristics.