ppxscal/embedding_network huggingface dataset:
Optimizing away C++ exception handling
Authors: Jonathan L. Schilling
Venue: ACM SIGPLAN Notices (1998)

A high performance implementation of C++ exception handling is crucial, because exception handling overhead is distributed across all code. The commonly-used table-driven approach to implementing exception handling can be augmented by an optimization that seeks to identify functions for which (contrary to first appearance) no exception handling tables need be generated at all. This optimization produces modest but useful gains on some existing C++ code, but produces very significant size and speed gains on code that uses empty exception specifications, avoiding otherwise serious performance losses.
Strong Minimax Lower Bounds for Learning
Authors: András Antos, Gábor Lugosi
Venue: Machine Learning (1998)

Minimax lower bounds for concept learning state, for example, that for each sample size n and learning rule g_n , there exists a distribution of the observation X and a concept C to be learnt such that the expected error of g_n is at least a constant times V/n, where V is the vc dimension of the concept class. However, these bounds do not tell anything about the rate of decrease of the error for a fixed distribution-concept pair.In this paper we investigate minimax lower bounds in such a (stronger) sense. We show that for several natural k-parameter concept classes, including the class of linear halfspaces, the class of balls, the class of polyhedra with a certain number of faces, and a class of neural networks, for any sequence of learning rules g_n, there exists a fixed distribution of X and a fixed conceptC such that the expected error is larger than a constant timesk/n for infinitely many n. We also obtain such strong minimax lower bounds for the tail distribution of the probability of error, which extend the corresponding minimax lower bounds.
Singular and Plural Nondeterministic Parameters
Authors: Michal Walicki, Sigurd Meldal
Venue: SIAM Journal on Computing (1997)

The article defines algebraic semantics of singular (call-time-choice) and plural (run-time-choice) nondeterministic parameter passing and presents a specification language in which operations with both kinds of parameters can be defined simultaneously. Sound and complete calculi for both semantics are introduced. We study the relations between the two semantics and point out that axioms for operations with plural arguments may be considered as axiom schemata for operations with singular arguments.
Program adaptation based on program transformation
Authors: Charles Consel
Venue: ACM SIGPLAN Notices (1997)

Much research effort in program transformation has traditionally been devoted to better compile programs. Key examples include program optimization and program parallelization. Program transformation has sometimes been used in program development to derive implementations from high-level specifications.This position paper advocates another promising application of program transformation: program adaptation. That is, the ability for a program to adapt to the context in which it is used. We claim that program adaptation is a key technique in the program development process and is applicable to real size systems.In the following sections, we first explain why program adaptation is important and what this process involves. Then, we discuss how program adaptation can be achieved. Finally, we outline research directions which can contribute to this line of work.
Computing Local Surface Orientation and Shape from Texture forCurved Surfaces
Authors: Jitendra Malik, Ruth Rosenholtz
Venue: International Journal of Computer Vision (1997)

Shape from texture is best analyzed in two stages, analogous to stereopsis and structure from motion: (a) Computing the &rsquo;texture distortion&lsquo; from the image, and (b) Interpreting the &rsquo;texture distortion&lsquo; to infer the orientation and shape of the surface in the scene. We model the texture distortion for a given point and direction on the image plane as an affine transformation and derive the relationship between the parameters of this transformation and the shape parameters. We have developed a technique for estimating affine transforms between nearby image patches which is based on solving a system of linear constraints derived from a differential analysis. One need not explicitly identify texels or make restrictive assumptions about the nature of the texture such as isotropy. We use non-linear minimization of a least squares error criterion to recover the surface orientation (slant and tilt) and shape (principal curvatures and directions) based on the estimated affine transforms in a number of different directions. A simple linear algorithm based on singular value decomposition of the linear parts of the affine transforms provides the initial guess for the minimization procedure. Experimental results on both planar and curved surfaces under perspective projection demonstrate good estimates for both orientation and shape. A sensitivity analysis yields predictions for both computer vision algorithms and human perception of shape from texture.
Dynamic class loading in the Java virtual machine
Authors: Sheng Liang, Gilad Bracha
Venue: ACM SIGPLAN Notices (1998)

Class loaders are a powerful mechanism for dynamically loading software components on the Java platform. They are unusual in supporting all of the following features: laziness, type-safe linkage, user-defined extensibility, and multiple communicating namespaces.We present the notion of class loaders and demonstrate some of their interesting uses. In addition, we discuss how to maintain type safety in the presence of user-defined dynamic class loading.
Utilizing an expert system for conflict resolution in a &ldquo;train siding selection&rdquo; simulation model
Authors: Gregory J. Allen, Khaled M. Mabrouk, Michael L. Weigel
Venue: Proceedings of the 28th conference on Winter simulation (1996)

Simulation is an excellent tool for evaluating alternative configurations for system flow and/or logic. Occasionally, the complexity of a system presents problems with respect to simulating and improving the performance of that system. When confronted with these complexities, the logic requirements can easily become more difficult to develop than the effort to understand the actual system logic. Expert systems, on the other hand, are better suited for reflecting complex decision making. Many times this means solving complex problems which can only be stated in written words, therefore extending computing power beyond the mathematical and statistical constructs of simulation and conventional programming. As a result, expert systems can be significantly easier to modify, for experimentation purposes, than a set of complex "IF-THEN" statements. Through the development of an expert system and its interface to a simulation, the problem of modeling complex systems can be encountered with improved efficiency. The end result is an increased level of simulation performance and customer satisfaction.
Software for simulation
Authors: Jerry Banks
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This tutorial describes software for conducting computer simulation other software that supports simulation.
CIMGS: An Incomplete Orthogonal Factorization Preconditioner
Authors: Xiaoge Wang, Kyle A. Gallivan, Randall Bramley
Venue: SIAM Journal on Scientific Computing (1997)

A new preconditioner for symmetric positive definite systems is proposed, analyzed, and tested. The preconditioner, compressed incomplete modified Gram--Schmidt (CIMGS), is based on an incomplete orthogonal factorization. CIMGS is robust both theoretically and empirically, existing (in exact arithmetic) for any full rank matrix. Numerically it is more robust than an incomplete Cholesky factorization preconditioner (IC) and a complete Cholesky factorization of the normal equations. Theoretical results show that the CIMGS factorization has better backward error properties than complete Cholesky factorization. For symmetric positive definite M-matrices, CIMGS induces a regular splitting and better estimates the complete Cholesky factor as the set of dropped positions gets smaller. CIMGS lies between complete Cholesky factorization and incomplete Cholesky factorization in its approximation properties. These theoretical properties usually hold numerically, even when the matrix is not an M-matrix. When the drop set satisfies a mild and easily verified (or enforced) property, the upper triangular factor CIMGS generates is the same as that generated by incomplete Cholesky factorization. This allows the existence of the IC factorization to be guaranteed, based solely on the target sparsity pattern.
A Low-Power 3V Lowpass OTA-C Filter for Megahertz Range
Authors: E. Tiiliharju, K. Koli, K. Halonen
Venue: Analog Integrated Circuits and Signal Processing (1997)

By applying a signal-flow graph (SFG) based filter synthesis an active OTA-C topology for integration of a 5-degree elliptic lowpass (LP) filter has been designed. The dynamic range has been maximized for this single-ended OTA-C filter, which has floating capacitors. This has been done through the use of an optimizing circuit simulator. Thus low-voltage (3V) operation despite high signal amplitudes ({\rm 1V}_{PP}) has been achieved. A linearized operational transconductance amplifier (OTA) has been designed and optimized for the filter. For comparison purposes the single-ended design has been converted to a fully differential one with an additional &plus;6dB of gain. Integrated filters realized with a 1.2 &mu;m CMOS process have been thoroughly measured. The filters are especially applicable for mobile communications because of low power consumption.
Reachability analysis using partitioned-ROBDDs
Authors: Amit Narayan, Adrian J. Isles, Jawahar Jain, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

In this paper, we address the problem of finite state machine (FSM) traversal, a key step in most sequential verification and synthesis algorithms. We propose the use of partitioned-ROBDDs to reduce the memory explosion problem associated with symbolic state space exploration techniques. In our technique, the reachable state set is represented as a partitioned-ROBDD Different partitions of the Boolean space are allowed to have different variable orderings and only one partition needs to be in memory at any given time. We show the effectiveness of our approach on a set of ISCAS89 benchmark circuits. Our techniques result in a significant reduction in total memory utilization. For a given memory limit, partitioned-ROBDD based method can complete traversal for many circuits for which monolithic ROBDDs fail. For circuits where both partitioned-ROBDDs as well as monolithic-ROBDDs cannot complete traversal, partitioned-ROBDDs can reach a significantly larger set of states.
Some Modified Runge-Kutta Methods for the Numerical Solution of Initial-Value Problems with Oscillating Solutions
Authors: T. E. Simos
Venue: Journal of Scientific Computing (1998)

Two new modified Runge-Kutta methods with minimal phase-lag are developed for the numerical solution of initial-value problems with oscillating solutions which can be analyzed to a system of first order ordinary differential equations. These methods are based on the well known Runge-Kutta RK5(4)7FEq1 method of Higham and Hall (1990) of order five. Also, based on the property of the phase-lag a new error control procedure is introduced. Numerical and theoretical results show that this new approach is more efficient compared with the well known Runge-Kutta Dormand-Prince RK5(4)7S method &lsqb;see Dormand and Prince (1980)&rsqb; and the well known Runge-Kutta RK5(4)7FEq1 method of Higham and Hall (1990).
Applications of non-Markovian stochastic Petri nets
Authors: Ricardo M. Fricks, Antonio Puliafito, Miklós Telek, Kishor S. Trivedi
Venue: ACM SIGMETRICS Performance Evaluation Review (1998)

Petri nets represent a powerful paradigm for modeling parallel and distributed systems. Parallelism and resource contention can easily be captured and time can be included for the analysis of system dynamic behavior. Most popular stochastic Petri nets assume that all firing times are exponentially distributed. This is found to be a severe limitation in many circumstances that require deterministic and generally distributed firing times. This has led to a considerable interest in studying non-Markovian models. In this paper we specifically focus on non-Markovian Petri nets. The analytical approach through the solution of the underlying Markov regenerative process is dealt with and numerical analysis techniques are discussed. Several examples are presented and solved to highlight the potentiality of the proposed approaches.
Customization and composition of distributed objects: middleware abstractions for policy management
Authors: Mark Astley, Gul A. Agha
Venue: Proceedings of the 6th ACM SIGSOFT international symposium on Foundations of software engineering (1998)

Current middleware solutions such as CORBA and Java's RMI emphasize compositional design by separating functional aspects of a system (e.g. objects) from the mechanisms used for interaction (e.g. remote procedure call through stubs and skeletons). While this is an effective solution for handling distributed interactions, higher-level requirements such as heterogeneity, availability, and adaptability require policies for resource management as well as interaction. We describe the Distributed Connection Language (dcl): an architecture description language based on the Actor model of distributed objects. System components and the policies which govern an architecture are specified as encapsulated groups of actors. Composition operators are used to build connections between components as well as customize their behavior. This customization is realized using a meta-architecture. We describe the syntax and semantics of dcl, and illustrate the language by way of several examples.
Doing quality work: the role of software process definition in the computer science curriculum
Authors: Thomas B. Hilburn, Massood Towhidnejad
Venue: ACM SIGCSE Bulletin (1997)

This paper discusses the role of personal software process definition in the education of computing professionals and the importance of emphasizing quality in the development of software. After examining recent government and industry efforts in introducing and instituting effective software development processes, there is a description of the Capability Maturity Model (CMM) and Watts Humphrey's Personal Software Process (PSP) and its use in industry and academia. The rest of the paper reports on a recent project that introduced PSP concepts into CS1 and CS2. Project methods and activities are described and the results of the project are analyzed. Finally, future enhancements and extensions of the project are discussed.
Reactive search, a history-sensitive heuristic for MAX-SAT
Authors: Roberto Battiti, Marco Protasi
Venue: Journal of Experimental Algorithmics (JEA) (1997)

The Reactive Search (RS) method proposes the integration of a simple history-sensitive (machine learning) scheme into local search for the on-line determination of free parameters. In this paper a new RS algorithm is proposed for the approximated solution of the Maximum Satisfiability problem: a component based on local search with temporary prohibitions (Tabu Search) is complemented with a reactive scheme that determines the appropriate value of the prohibition parameter by monitoring the Hamming distance along the search trajectory. The proposed algorithm (H-RTS) can therefore be characterized as a dynamic version of Tabu Search.In addition, the non-oblivious functions recently introduced in the framework of approximation algorithms are used to discover a better local optimum in the initial part of the searchThe algorithm is developed in two phases. First the bias-diversification properties of individual candidate components are analyzed by extensive empirical evaluation, then a reactive scheme is added to the winning component, based on Tabu Search.The final tests on a benchmark of random MAX-3-SAT and MAX-4-SAT problems demonstrate the superiority of H-RTS with respect to alternative heuristics.
The Vector-Gradient Hough Transform
Authors: Rita Cucchiara, Fabio Filicori
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1998)

The paper presents a new transform, called Vector-Gradient Hough Transform, for identifying elongated shapes in gray-scale images. This goal is achieved not only by collecting information on the edges of the objects, but also by reconstructing their transversal profile of luminosity. The main features of the new approach are related to its vector space formulation and the associated capability of exploiting all the vector information of the luminosity gradient.
An APL production environment
Authors: Gösta Olavi
Venue: ACM SIGAPL APL Quote Quad (1985)

Production usage of an APL application has further requirements than test execution by the programmer. Normally, each application implements its own production-environment features. This paper discusses the advantages of separating such features from the applications, and to supply them via a standardized production environment. One specific such environment, implemented at Skandinaviska Enskilda Banken, is described.
Texture Classification Using Windowed Fourier Filters
Authors: Robert Azencott, Jia-Ping Wang, Laurent Younes
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

We define a distance between textures for texture classification from texture features based on windowed Fourier filters. The definition of the distance relies on an interpretation of our texture attributes in terms of spectral density when the texture can be considered as a Gaussian random field. The distance between textures is then defined as a symmetrized Kullback distance which is a simple function of the attributes and does not require any normalization. An experimental analysis using Gabor filters, and in particular a comparison to quadratic distances, shows the efficiency and robustness of the method.
Automating the design of electronic packaging (tutorial)
Authors: Barry Whalen
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

With the reduced IC design times provided by today's DA tools, it is no longer sufficient for the tools to end with a set of masks and a tester program; they must also participate in the design of associated electronic packaging technologies. The increased performance of today's IC's also demands new, high-performance packaging technologies if the speed of the chips is to be utilized effectively at the system level. However, can these goals be achieved at low added cost to the system? 'Flip-chip,' solder-bump, and tab-attach substrates, high-density multi-chip boards, and wafer-scale interconnect present many new challenges to present CAD technologies. Multi-layer place-and-route at IC densities, modeling and analysis of transmission-line effects, noise problems and the supply of clean power across the system are just a few of the new challenges facing the DA engineer. In addition, mechanical stress and vibration analysis, as well as thermal analysis techniques, are of increasing importance.
TeleNotes: managing lightweight interactions in the desktop
Authors: Steve Whittaker, Jerry Swanson, Jakov Kucan, Candy Sidner
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (1997)

Communication theories and technology have tended to focus on extended, formal meetings and have neglected a prevalent and vital form of workplace communication&mdash;namely, lightweight communication. Unlike formal, extended meetings, lightweight interaction is brief, informal, unplanned, and intermittent. We analyze naturalistic data from a study of work-place communication and derive five design criteria for lightweight interaction systems. These criteria require that systems for lightweight interaction support conversational tracking, rapid connection, the ability to leave a message, context management, and shared real-time objects. Using these criteria, we evaluate existing interpersonal communications technologies. We then describe an implementation of a system (TeleNotes) that is designed to support lightweight interaction by meeting these criteria. The interface metaphor allows communications to be based around desktop objects, resembling &ldquo;sticky notes.&rdquo; These objects are also organized into &ldquo;desktop piles&rdquo; to support conversational threads and provide mechanisms for initiating real-time audio, video, and application sharing. We conducted informal user testing of several system prototypes. Based on our findings, outstanding issues concerning theory and systems design for communication systems are outlined&mdash;in particular, with regard to the issue of managing conversations over time.
Electronic component information exchange (ECIX)
Authors: Donald R. Cottrell
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

A number of industry trends are shaping the requirements for ICand electronic equipment design. The density and complexity ofcircuit technologies have increased to a point where design cannotbe performed without EDA tools. The availability of completelydesigned and verified reusable design components has become amajor impediment to meeting required design productivity goals.Design reuse is moving down the package hierarchy to includechip design in addition to PCA design.At the same time, the widespread use of Internet and WorldwideWeb technologies offer component suppliers global access tocustomers, and component users access to suppliers, worldwide.To realize the full potential of modern technology, it is necessarythat a level of consistency be defined and used to representcomponent information. Standard formats for datasheets andstandard terminology within datasheets aids customers in theiranalysis and value-comparison of components from multiplesuppliers. Additionally, standards are required to facilitatesoftware tools than can help automate current manual processes topopulate customer's Component Information System (CIS)databases and generate CAD libraries from this componentinformation.Electronic Component Information Exchange (ECIX) is a multi-companyproject that is focused on the development of standardsand architecture that supports the flow of component informationfrom suppliers to all potential customers in a manner thatimproves productivity for:¿ Component suppliers¿ Information suppliers¿ Component engineering¿ CAD library development¿ Product designersBy working collaboratively, these companies are able to tackle aproblem that is too large for any individual company, yetminimizes development cost. Even though they are all businesscompetitors, they are committed to cooperation for thedevelopment of ECIX as its success will provide industry-widebenefits to all.
CSIM18&mdash;the simulation engine
Authors: Herb Schwetman
Venue: Proceedings of the 28th conference on Winter simulation (1996)

A simulation engine is the collection of components, features and support functions which are crucial to the implementation of an efficient discrete event simulation model. Furthermore, this model can be embedded in a larger application. A good simulation engine combines efficiency, functionality and completeness to enable a model builder to construct a comprehensive, customized model of either a specific system or a class of systems. This paper presents CSIM18, a simulation engine which supports development of applications with efficient, em bedded simulation models on a variety of system plat forms.