ppxscal/embedding_network huggingface dataset:
Rare event simulation in stochastic models
Authors: Perwez Shahabuddin
Venue: Proceedings of the 27th conference on Winter simulation (1995)

We review fast simulation techniques used for estimating probabilities of rare events and related quantities in different types of stochastic models.
Shape Modeling with Front Propagation: A Level Set Approach
Authors: Ravikanth Malladi, James A. Sethian, Baba C. Vemuri
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

Shape modeling is an important constituent of computer vision as well as computer graphics research. Shape models aid the tasks of object representation and recognition. This paper presents a new approach to shape modeling which retains some of the attractive features of existing methods and overcomes some of their limitations. Our techniques can be applied to model arbitrarily complex shapes, which include shapes with significant protrusions, and to situations where no a priori assumption about the object¿s topology is made. A single instance of our model, when presented with an image having more than one object of interest, has the ability to split freely to represent each object. This method is based on the ideas developed by Osher and Sethian to model propagating solid/liquid interfaces with curvature-dependent speeds. The interface (front) is a closed, nonintersecting, hypersurface flowing along its gradient field with constant speed or a speed that depends on the curvature. It is moved by solving a ¿Hamilton-Jacobi¿ type equation written for a function in which the interface is a particular level set. A speed term synthesized from the image is used to stop the interface in the vicinity of object boundaries. The resulting equation of motion is solved by employing entropy-satisfying upwind finite difference schemes. We present a variety of ways of computing evolving front, including narrow bands, reinitializations, and different stopping criteria. The efficacy of the scheme is demonstrated with numerical experiments on some synthesized images and some low contrast medical images.
From data distributions to regularization in invariant learning
Authors: Todd K. Leen
Venue: Neural Computation (1995)

Ideally pattern recognition machines provide constant output when the inputs are transformed under a group G of desired invariances. These invariances can be achieved by enhancing the training data to include examples of inputs transformed by elements of G, while leaving the corresponding targets unchanged. Alternatively the cost function for training can include a regularization term that penalizes changes in the output when the input is transformed under the group. This paper relates the two approaches, showing precisely the sense in which the regularized cost function approximates the result of adding transformed examples to the training data. We introduce the notion of a probability distribution over the group transformations, and use this to rewrite the cost function for the enhanced training data. Under certain conditions, the new cost function is equivalent to the sum of the original cost function plus a regularizer. For unbiased models, the regularizer reduces to the intuitively obvious choice---a term that penalizes changes in the output when the inputs are transformed under the group. For infinitesimal transformations, the coefficient of the regularization term reduces to the variance of the distortions introduced into the training data. This correspondence provides a simple bridge between the two approaches.
Estimation and simulation of nonhomogeneous Poisson processes having multiple periodicities
Authors: Michael E. Kuhl, James R. Wilson, Mary A. Johnson
Venue: Proceedings of the 27th conference on Winter simulation (1995)

We develop and evaluate procedures for estimating and simulating nonhomogeneous Poisson processes (NHPPs) having an exponential rate function, where the exponent may include a polynomial component or some trigonometric components or both. Maximum likelihood estimates of the unknown continuous parameters of the rate function are obtained numerically, and the degree of the polynomial rate component is determined by a likelihood ratio test. The experimental performance evaluation for this estimation procedure involves applying the procedure to 100 independent replications of nine selected point processes that possess up to four trigonometric rate components together with a polynomial rate component whose degree ranges from zero to three. On each replication of each process, the fitting procedure is applied to estimate the parameters of the process; and then the corresponding estimates of the rate and mean value functions are computed over the observation interval. Evaluation of the fitting procedure is based on plotted tolerance bands for the rate and mean value functions together with summary statistics for the maximum and average absolute estimation errors in these functions over the observation interval. The experimental results provide substantial evidence of the numerical stability and usefulness of the fitting procedure in simulation applications.
Taylor II manufacturing simulation software
Authors: William B. Nordgren
Venue: Proceedings of the 27th conference on Winter simulation (1995)

Taylor II is a menu driven simulation package mainly used in manufacturing and logistics. It is developed for the analysis and quantitative evaluation of complex processes especially of those with a dynamic character. A lot of applications in different industries show that there is an increasing need for simulation tools. The paper demonstrates the process of building, analyzing and presenting models of real world systems with Taylor II.
Beyond objects: a response
Authors: Bill Appelbe, Gregory Abowd
Venue: ACM SIGSOFT Software Engineering Notes (1995)

In a recent article [5], Shaw puts forth the argument that a process control paradigm for structuring software is more natural, and hence most appropriate for process control applications. However, we believe that there are other considerations, such as scalability and maintainability, that need to be addressed when choosing a design paradigm. Our experience, and a re-examination of Shaw's models, suggests that object modeling is more appropriate for large scale process control applications.
Code reuse in an optimizing compiler
Authors: Ali-Reza Adl-Tabatabai, Thomas Gross, Guei-Yuan Lueh
Venue: ACM SIGPLAN Notices (1996)

This paper describes how the cmcc compiler reuses code---both internally (reuse between different modules) and externally (reuse between versions for different target machines). The key to reuse are the application frameworks developed for global data-flow analysis, code generation, instruction scheduling, and register allocation.The code produced by cmcc is as good as the code produced by the native compilers for the MIPS and SPARC, although significantly less resources have been spent on cmcc (overall, about 6 man years by 2.5 persons). cmcc is implemented in C++, which allowed for a compact expression of the frameworks as class hierarchies. The results support the claim that suitable frameworks facilitate reuse and thereby significantly improve developer effectiveness.
Delegation versus concatenation or cloning is inheritance too
Authors: Antero Taivalsaari
Venue: ACM SIGPLAN OOPS Messenger (1995)

In this paper a simple prototype-based model of object-oriented programming is introduced. Unlike previous prototype-based systems, which use delegation to achieve incremental modification of objects, the suggested model is based on concatenation: linear composition of object interfaces. The model eliminates the notions of delegation and parent slots from prototype-based programming, and shows that the essence of object-oriented programming can be captured using only a small number of user-level language constructs.
The role of compression in document databases
Authors: Alistair Moffat, Justin Zobel, Ian H. Witten, Timothy C. Bell
Venue: ACM SIGWEB Newsletter (1995)

The extensive use of compression means that the MG retrieval system is capable of managing multi-gigabyte document collections in an effective and efficient manner. This article reviews the main features of MG and notes its relevance to large hypermedia collections.
A cache approach for supporting life-time UPT number
Authors: Yi-Bing Lin
Venue: Wireless Networks (1996)

A life-time Universal Personal Telecommunication (UPT) number allows a user to change the Personal Communications service provider without changing his/her UPT number. Since a translation from the life-time UPT number to a routing address must be done for every call placed, it is essential to make this process efficient. Two general approaches are the table lookup method and the database query method. The life-time UPT number can be easily implemented in the database query method. However, the UPT-routing address translation cost in the database query method is much higher than in the table lookup method. Address translation can be done efficiently in the table lookup method, but pointer forwarding is required to support a life-time UPT number. To reduce the pointer forwarding cost, we modify the table lookup method by adding a cache at each cellular switch (in Taiwan, the number of cellular switches that need to equip with the caches is 8 for AMPS and 7 for GSM). We show that the cache scheme can remove most pointer forwarding operations for an originating switch if some PCS users are accessed more frequently than others.
Distributed visualization in the command and control environment for constructive simulations
Authors: Dennis V. Brockway, Cheryl A. Ammann, Marsha J. Boggs, Cindy S. Sievers, J. Wayne Anderson
Venue: Proceedings of the 27th conference on Winter simulation (1995)

GIAC, the Graphical Input Aggregate Control System is a distributed visualization and command and control environment for constructive simulations. The GIAC system creates a distributed environment utilizing distributed databases to capture and distribute simulation objects. GIAC provides an interactive visual representation of simulation objects from multiple constructive simulations. GIAC allows command and control of the simulation objects from anywhere in the world.
A system-based sequence of closed labs for computer systems organization
Authors: Brenda C. Parker, Peter G. Drexel
Venue: ACM SIGCSE Bulletin (1996)

The closed-lab environment has been used successfully in the Computer Science curriculum. This paper proposes a set of laboratories, that combine the use of hands-on techniques and logic simulation. During a semester, students in Computer Systems Organization classes design and implement a working model of a complete system: OBC.
Measured performance of data transmission over cellular telephone networks
Authors: Timo Alanko, Markku Kojo, Heimo Laamanen, Mika Liljeberg, Marko Moilanen, Kimmo Raatikainen
Venue: ACM SIGCOMM Computer Communication Review (1994)

Recent developments in mobile communication and personal computer technology have laid a new foundation for mobile computing. Performance of the data communication system as seen by an application program is a fundamental factor when communication infrastructure at the application layer is designed. This paper provides results of performance measurements of data transmission over two different cellular telephone networks, a digital GSM-network and an analogue NMT-network. Since our emphasis is on performance as seen by application programs, we use the standard TCP/IP protocols in the measurements. The performance is measured using three basic operations: establishment of a wireless dial-up connection, exchange of request-reply messages, and bulk data transfer. The external conditions under which the measurements were carried out present a normal office environment when the field strength of the cellular link is good or fairly good.
Telework: an innovation where nobody is getting on the bandwagon?
Authors: Cynthia P. Ruppel, Susan J. Harrington
Venue: ACM SIGMIS Database (1995)

Despite predictions over the years that many employees would soon be teleworking from their homes, neither employees in general nor information systems (IS) professionals in particular, whose work is especially appropriate for telework, have begun teleworking to any large extent. The reasons for this lack of telework growth are empirically untested. Yet an understanding of why organizations and IS departments are not joining the telework bandwagon is critical if predictions of improved flexibility and productivity through telework are to be realized.This study used innovation theory to suggest key variables that may be related to telework use among IS programmer/analysts. A national survey of IS executives was used to obtain information on the variables relevant to IS telework assimilation. The survey resulted in responses from 252 IS departments describing their telework arrangements.Key variables related to both the adoption stage and the infusion stage of IS teleworking were middle management support for telework, administrative intensity, and professionalism. A variable significantly related only to the adoption decision was centralization. The key variable related only to the infusion stage was size. The variables that were not related to either adoption or infusion were specialization and formalization, suggesting that bureaucracy alone is not an obstacle to telework.Overall, the findings suggest a bottom-up initiation of telework; i.e., that programmer/analysts are initiating telework arrangements. Lack of middle management support for telework has a strong negative effect on the assimilation of telework. Thus, this study suggests that future research may wish to investigate further the reasons for lack of managerial support. Moreover, the lack of organizations getting on the telework bandwagon, together with the variables found significant in this study, suggest fruitful areas for future research may be an analysis of the type of publicity describing telework arrangements, managerial knowledge of telework arrangements, the nature of IS work appropriate for telework, and the managerial skills demanded by telework.
Why should you use a personal software process?
Authors: Watts S. Humphrey
Venue: ACM SIGSOFT Software Engineering Notes (1995)

The Personal Software Process (PSP) is a structured set of forms, standards, and procedures that is designed to help you do better work. Data on the PSP's early use shows that engineers achieve average reductions of 75% in numbers of injected defects, make more accurate plans, and have higher productivity. To date, the PSP has been used to write more than 1000 small programs with a total of over 100,000 LOC. C is the language most commonly used but C++, Ada, Pascal, FORTRAN, and Visual Basic have also been used. This note describes the PSP, why it was developed, and how it can help you to be a better software engineer.
Collaborative computing: a multi-client multi-server environment
Authors: Ming C. Hao, Alan H. Karp, Daniel Garfinkel
Venue: Proceedings of conference on Organizational computing systems (1995)

Most people think that collaboration implies that several people are sharing work on a single application with shared displays. In fact, collaboration is more. It includes the concurrent control of multiple applications by a collaborative group. To enable this more powerful form of collaboration, we show how to combine earlier mechanisms for single client, multiple server computing with a new mechanism called ESP (Event Sense Protocol) for multiple client, multiple server computing. We describe two extended examples &mdash; a working prototype of a multi-user, heterogeneous, distributed debugger and a commercial banking application.
Accurate Computation of the Fundamental Matrix of a Markov Chain
Authors: Daniel P. Heyman
Venue: SIAM Journal on Matrix Analysis and Applications (1995)

Associated with every stochastic matrix is another matrix called the fundamental matrix. The fundamental matrix can be used to obtain mean first-passage-times and other interesting operating characteristics. The fundamental matrix is defined as a matrix inverse, and computing it from the definition can be fraught with numerical errors. We establish a new representation of the fundamental matrix where matrix inversion is replaced by multiplying and then adding a pair of matrices. The representation requires the solution of a system of linear equations, and we show that that can be done via back and forward substitution from numbers that have already been calculated when the GTH algorithm is used to compute the steady-state probabilities. An algorithm based on this representation is given. The time complexity of the faster implementation is 75% of the time complexity of using Gaussian elimination.
Implementing FORTRAN77 support in the GNU gdb debugger
Authors: Farooq Butt
Venue: ACM SIGPLAN Notices (1995)

Commercially available source-level debuggers in the Unix world often shortchange FORTRAN77 users. While C and C++ are usually well-supported languages, FORTRAN77 has not been given the attention it deserves. Given the current interest in performance-measurement via the popular SPEC benchmarks (many of which are coded in FORTRAN77) as well as the large installed-base of mathematical/scientific FORTRAN77 software, it is imperative for system software vendors to provide FORTRAN77 users with the same sort of fast, effective and powerful source-level debugging environment that C and C++ users enjoy. This paper details the addition of FORTRAN77 features to the GNU gdb[2] debugger in order to better support users of the highly-optimizing Motorola PowerPC1 mf77 compiler. These FORTRAN77 features currently (as of version 4.10) only target the native PowerPC mf77 compiler distributed by Motorola.
Egret: a framework for advanced CSCW applications
Authors: Philip Johnson
Venue: ACM SIGSOFT Software Engineering Notes (1996)

Egret is a publically available, advanced framework for construction of computer-supported cooperative work applications. Egret provides an approach to multi-user, interactive application development that differs markedly from other frameworks or infrastructures, such as Groupkit, WWW, or Lotus Notes. This short paper introduces Egret, its architecture, design philosophy, selected applications, and interest groups within the software engineering community. It concludes with information on how Egret's sources, binaries, and documentation may be obtained free of charge using the Internet.
The Median Procedure in a Formal Theory of Consensus
Authors: F. R. McMorris, R. C. Powers
Venue: SIAM Journal on Discrete Mathematics (1995)

A consensus rule on a finite set $X$ is a function $c$ from the set of $k$-tuples for all $k > 0$ into the set of nonempty subsets of $X$. Elements in the image of $c$ represent a consensus, or agreement, of the input. Axioms for consensus rules are presented, and when $X$ is partially ordered, some consequences of these axioms are determined. A generalization of the median consensus rule is given when $X$ is a distributive semilattice and is based on a weighting of the least move metric on the covering graph of $X$. It is characterized under the assumption that every join irreducible of $X$ is an atom.
Altshuler's Sphere $m^9_{963}$ Revisited
Authors: Jurgen Bokowski, Peter Schuchert
Venue: SIAM Journal on Discrete Mathematics (1995)

We show that a minimal nonpolytopal matroid polytope, the unique oriented matroid ${\cal M }$, characterized by requiring its Las Vergnas face lattice to be isomorphic to Altshuler's $3$-sphere $M^9_{963},$ has no polar ${\cal M}^\Delta,$ i.e., there is no oriented matroid ${\cal M}^\Delta$ such that its Las Vergnas lattice ${\cal F}_{\rm lv} ({\cal M}^\Delta)$ equals the opposite (antiisomorphic or order-dual) lattice ${\cal F}_{\rm lv} ({\cal M})^{op}.$ This provides the minimal rank in which polarity for oriented matroids, i.e., ${\cal F}_{\rm lv} ({\cal M}^\Delta)\,=\,{\cal F}_{\rm lv} ({\cal M})^{op},$ fails to hold, thus answering a problem posed by Billera.
Scheduling and resource binding for low power
Authors: E. Musoll, J. Cortadella
Venue: Proceedings of the 8th international symposium on System synthesis (1995)

Abstract: Decisions taken at the earliest steps of the design process may have a significant impact on the characteristics of the final implementation. This paper illustrates how power consumption issues can be tackled during the scheduling and resource-binding steps of high-level synthesis. Algorithms for these steps targeting at low-power data-paths and trading off, in some cases, speed and area for low power are presented. The algorithms focus on reducing the activity of the functional units (adders, multipliers) by minimizing the transitions of their input operands. The power consumption of the functional units accounts for a large fraction of the overall data-path power budget.
Developing domain knowledge through the reuse of project experiences
Authors: Scott Henninger
Venue: ACM SIGSOFT Software Engineering Notes (1995)

Software development is no longer a homogenous field. Software is being developed for an increasingly diverse set of applications and user populations, each with different characteristics and development constraints. As a consequence, researchers and practitioners have begun to realize the importance of identifying and understanding the characteristics and special development needs of application domains. This paper presents a method for developing and refining knowledge about application domains by creating a repository of project experiences. Subsequent projects can then benefit from these experiences by locating similar projects and reusing the knowledge accumulated in the repository. We develop a framework for a system to capture relationships between development projects and resources for developing software, including process models, methods, technologies, and tools. We then show how this information can be reused to improve the productivity and quality of software development efforts.
Stating security requirements with tolerable sets
Authors: Dale M. Johnson, F. Javier Thayer
Venue: ACM Transactions on Computer Systems (TOCS) (1988)

This paper introduces and develops the concept of tolerable sets for analyzing general security requirements. Tolerable sets, and corresponding purging functions and invisibility based on the sets, are used to state and test such requirements. The approach used in this paper resulted from our attempt to apply the noninterference ideas of Goguen and Meseguer to the problem of stating special security requirements in the case of so-called trusted subjects. It turns out that the conditional purging function defined by Goguen and Meseguer is only one example, though an important one, of a conditional purging function. This paper provides a definition and characterization of a general class of purging functions similar to the purging function of Goguen and Meseguer. Furthermore, it relates purging and invisibility to security requirements. Some particular applications are described toward the end of the paper. At the end there are some critical remarks about purging functions.