ppxscal/embedding_network huggingface dataset:
Fundamentals of using Micro Saint in manufacturing, health care, human factors and business process reengineering
Authors: Catherine E. Drury, K. Ronald Laughery
Venue: Proceedings of the 27th conference on Winter simulation (1995)

Computer simulation is becoming a common tool in the engineer's toolkit but the move to simulation is slow in coming. There are still many people in manufacturing, health care, process reengineering and human factors industries who are not using any sort of simulation software and see no advantage to using this powerful tool. Even in the information age of the 1990's it is still hard for the potential user of simulation to find the necessary facts to keep up with the changing market of computers and simulation software. We focus on the changes in simulation software over the years, the ease of use of the 1990's simulation software, the broadening market for simulation software, along with a step by step approach to using Micro Saint simulation software in several key areas.
Microsoft certification
Authors: Pak L. Kwan
Venue: ACM SIGICE Bulletin (1995)

The Microsoft Certified Professional program is the best way to prove your ability of mastering of current Microsoft products and technologies. Computer professionals who become Microsoft Certified are recognized as experts and are sought after industry.
Configurable flow control mechanisms for fault-tolerant routing
Authors: Binh Vien Dao, Jose Duato, Sudhakar Yalamanchili
Venue: ACM SIGARCH Computer Architecture News (1995)

Fault-tolerant routing protocols in modern interconnection networks rely heavily on the network flow control mechanisms used. Optimistic flow control mechanisms such as wormhole routing (WR) realize very good performance, but are prone to deadlock in the presence of faults. Conservative flow control mechanisms such as pipelined circuit switching (PCS) insures existence of a path to the destination prior to message transmission, but incurs increased overhead. Existing fault-tolerant routing protocols are designed with one or the other, and must accommodate their associated constraints. This paper proposes the use of configurable flow control mechanisms. Routing protocols can then be designed such that in the vicinity of faults, protocols use a more conservative flow control mechanism, while the majority of messages that traverse fault-free portions of the network utilize a WR like flow control to maximize performance. Such protocols are referred to as two-phase protocols, where routing decisions are provided some control over the operation of the virtual channels. This ability provides new avenues for optimizing message passing performance in the presence of faults. A fully adaptive two-phase protocol is proposed and compared via simulation to those based on WR and PCS. The architecture of a network router supporting configurable flow control is described, and the paper concludes with avenues for future research.
Algorithm 750: CDT: a subroutine for the exact solution of large-scale, asymmetric traveling salesman problems
Authors: G. Carpaneto, M. Dell'Amico, P. Toth
Venue: ACM Transactions on Mathematical Software (TOMS) (1995)

The Fortran code CDT, implementing an algorithm for the asymmetric traveling salesman problem, is presented. The method is based on the Assignment Problem relaxation and on a subtour elimination branching scheme. The effectiveness of the implementation derives from reduction procedures and parametric solution of the relaxed problems associated with the nodes of the branch-decision tree.
On structured data handling in parallel processing
Authors: Jean-Louis Lafitte
Venue: ACM SIGARCH Computer Architecture News (1995)

The model we have developed at Universit eacute; de Gen egrave;ve allows one to handle irregular data in parallel processing. It achieves much smoother data-driven parallel processing allowing far less discontinuities of the well-known pipeline "bubbles" type. This model is presented, along with some pre-liminary results.
Generating a new recurrence relations system for elliptic Hansen coefficients by means of computer algebra
Authors: Andrej G. Sokolsky, Akmal A. Vakhidov, Nickolay N. Vasiliev
Venue: ACM SIGSAM Bulletin (1995)

Problem to obtain a new system of recurrence relations for elliptic Hansen coefficients is solved by means of computer algebra system MAPLE. Possibilities for generation of new recurrence relations by means of the MAPLE-package LINALG are shown for the case of linear relations. As an example, advantages to use the obtained recurrence relations in an artificial satellite motion theory within elliptic functions are described.
Using Mathematica to aid simulation analysis
Authors: Paul A. Savory
Venue: Proceedings of the 27th conference on Winter simulation (1995)

As computer power has increased, so has the capability of software developers to write programs that assist people with time-consuming tasks. Mathematica is such a program. The objective of this paper is to demonstrate how Mathematica, a symbolic programming environment, can be used to aid simulation analysis. In addition to a general discussion of Mathematica's uses, advantages, and disadvantages, several examples are presented. The examples include using Mathematica for distribution fitting, queueing analysis, random number generation, and creating a surface plot for optimization.
Do Gophers have WWWebbed feet?
Authors: Albert DeSimone,  Jr.
Venue: ACM SIGUCCS Newsletter (1995)

I like the word "complements" much more than the word "versus," and I like the way Gopher complements the World Wide Web. If you are a current or aspiring information provider, you have probably been involved in discussions which place these two Internet-based information discovery tools in direct opposition. It's almost like a B-grade movie --- Gopher versus World Wide Web --- the audience being treated to the slaying of text-based information delivery by global hypermedia with its entourage of pictures, movies, and sounds. All this played out before our eyes to the sad strains of that increasingly popular tune "As the Bandwidth Played on."
A modification of Talbot's method for the simultaneous approximation of several values of the inverse Laplace transform
Authors: Mariarosaria Rizzardi
Venue: ACM Transactions on Mathematical Software (TOMS) (1995)

In recent years many results have been obtained in the field of the numerical inversion of Laplace transforms. Among them, a very accurate and general method is due to Talbot: this method approximates the value of the inverse Laplace transform f(t), for t fixed, using the complex values of the Laplace transform F(s) sampled on a suitable contour of the complex plane. On the basis of the interest raised by Talbot's method implementation, the author has been induced to investigate more deeply the possibilities of this method and has been able to generalize Talbot's method, to approximate simultaneously several values of f(t) using the same sampling values of the Laplace transform. In this way, the only unfavorable aspect of the classical Talbot method, that is, that of recomputing all of the samples of F(s) for each t, has been eliminated.
Fast algorithms for universal quantification in large databases
Authors: Goetz Graefe, Richard L. Cole
Venue: ACM Transactions on Database Systems (TODS) (1995)

Universal quantification is not supported directly in most database systems despite the fact that it adds significant power to a system's query processing and inference capabilities, in particular for the analysis of many-to-many relationships and of set-valued attributes. One of the main reasons for this omission has been that universal quantification algorithms and their performance have not been explored for large databases. In this article, we describe and compare three known algorithms and one recently proposed algorithm for relational division, the algebra operator that embodies universal quantification. For each algorithm, we investigate the performance effects of explicit duplicate removal and referential integrity enforcement, variants for inputs larger than memory, and parallel execution strategies. Analytical and experimental performance comparisons illustrate the substantial differences among the algorithms. Moreover, comparisons demonstrate that the recently proposed division algorithm evaluates a universal quantification predicate over two relations as fast as hash (semi-) join evaluates an existential quantification predicate over the same relations. Thus, existential and universal quantification can be supported with equal efficiency by adding the recently proposed algorithm to a query evaluation system. A second result of our study is that universal quantification should be expressed directly in a database query language, because most query optimizers do not recognize the rather indirect formulations available in SQL as relational division and therefore produce very poor evaluation plans for many universal quantification queries.
Uniqueness Of Steady-State Solutions For Difference Equations On Overlapping Grids
Authors: Zi-Niu Wu
Venue: SIAM Journal on Numerical Analysis (1996)

The uniqueness of continuous and discontinuous steady-state solutions is studied for difference approximations of hyperbolic problems on a strip with overlapping grids. In the continuous case, an easily verifiable uniqueness criterion is obtained from a normal mode analysis. This criterion is applied to examine the uniqueness of commonly used interface treatments. In the discontinuous case, a shock is assumed to be contained in the overlap. Analysis for this case is developed on a linear model equation. Most of the results are further confirmed by computing smooth and shocked flows in a divergent duct. The present theory can also be applied to analyze uniqueness for more general boundary value problems.
Material flow analysis of automotive assembly plants using FactoryFlow
Authors: David P. Sly
Venue: Proceedings of the 27th conference on Winter simulation (1995)

When designing a new assembly plant or retrofitting an existing plant, it is critical to determine where all the materials will be received, stored and used. Variable width and color material flow diagrams created by FactoryFLOW are especially useful for presenting this information. FactoryFLOW automatically finds the shortest route from origin to destination along an aisle network for all materials/parts involved. Once routes are determined. FactoryFLOW draws the routes, outputs travel distances, times, and costs to report files and scales the thickness of flow lines according to the flow intensity of each part. The input data required by FactoryFLOW is the kind of basic from-to information typically already available in a database or spreadsheet. Among other output reports, FactoryFLOW generates detailed reports on manpower requirements by equipment type. FactoryFLOW's from-to chart shows the flow intensities and distances between ail from-to locations analyzed. The distance intensity chart plots each part's move intensity against its travel distance on an X-Y graph. With the help of powerful personal computer systems and user friendly graphical environments, material flow studies of over 10,000 parts within facilities of over 5 million square feet can be accomplished by a novice user in under an hour.
Load balancing and fault tolerance in workstation clusters migrating groups of communicating processes
Authors: S. Petri, H. Langendörfer
Venue: ACM SIGOPS Operating Systems Review (1995)

In the past, several process migration facilities for distributed systems have been developed. Due to the complex nature of the subject, all those facilities have limitations that make them usable for only limited classes of applications and environments. We discuss some of the usual limitations and possible solutions. Specifically, we focus on migration of groups of collaborating processes between Unix systems without kernel modifications, and from this we derive the design for a migration system. First experiences with our implementation show that we reach performance figures for the migration that are close to those of real distributed operating system.
Attitudes toward the teaching of formal methods of software development in the undergraduate computer science curriculum: a survey
Authors: Thomas V. Palmer, James C. Pleasant
Venue: ACM SIGCSE Bulletin (1995)

This paper reports on a survey related to current views concerning the feasibility and importance of teaching formal methods of software development at the undergraduate level. Principle areas of interest considered include formal logic, formal specification, and formal proofs of correctness of programs. After alluding to several points of contact with current literature on this topic, the paper reports on a questionnaire designed by the authors that was mailed to computer science departments of selected colleges and universities in the United States and Canada. The principle goal of the survey is to determine attitudes of computer science faculty concerning the teaching of formal methods at the undergraduate level.
Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
Authors: Thomas Andreae, Hans-Jurgen Bandelt
Venue: SIAM Journal on Discrete Mathematics (1995)

The worst-case analyses of heuristics in combinatorial optimization are often far too pessimistic when confronted with performance on real-world problems. One approach to partially overcome this discrepancy is to resort to average-case analyses by stipulating realistic distributions of input data. Another way is to incorporate a priori information on the potential domain of the input data, for instance, assuming the triangle inequality for input matrices is in some cases instrumental for establishing approximation algorithms with fixed performance guarantee. Now, a parametrized form of the triangle inequality has a considerably larger range of applicability and allows the prediction of the heuristics performance, where otherwise no bound could be provided. For example, it is interesting to observe that two well-known approximation algorithms for the Traveling Salesman Problem (TSP), assuming the triangle inequality, behave differently when one relaxes the imposed triangle inequality. The double-spanning-tree heuristic can be adjusted (by suitably extracting a Hamilton circuit from a Eulerian walk) to yield an approximation algorithm with performance guarantee increasing quadratically with the parameter governing the relaxed triangle inequality. The Christofides algorithm cannot be modified in this way and hence does not tolerate a relaxation of the standard triangle inequality without loosing the bound on its relative performance.
Enhanced THOREAU traffic simulation for intelligent transportation systems (ITS)
Authors: Paul T. R. Wang, Richard A. Glassco
Venue: Proceedings of the 27th conference on Winter simulation (1995)

Traffic and Highway Objects for Research, Analysis and Understanding (THOREAU) is an object-oriented microscopic and mesoscopic traffic simulation tool for traffic engineers. It emphasizes the simulation of advanced traveler information systems (ATIS) and advanced traffic management systems (ATMS) as components of intelligent transportation systems (ITS). This paper describes recent enhancements to THOREAU in the area of ATMS, namely the microsimulation of actuated signals and corridor-wide signal optimization in conjunction with route guidance and incident management. There are strong coupling effects among various trip time control parameters including signal cycle times, green wave offsets, and ATMS control strategies. Using sample urban traffic networks, the impacts of actuated signal controllers, the adaptive Webster-Cobbe (1966) algorithm for isolated intersection, traffic detector placement strategies and coordinated corridor-wide optimization can be quantified. Consequently, traffic engineers may use THOREAU to explore alternative ITS technologies or architectures for optimal signal control and to validate network performance estimates obtained through analytic or rule-of-thumb approaches.
Proposed icons for Ada 95
Authors: Bard S. Crawford
Venue: ACM SIGAda Ada Letters (1995)

Several graphical icons, representing new features introduced during the Ada 95 language-update process, are proposed. Uses of the proposed icons, in combination with traditional forms already familiar to Ada developers, are illustrated in various contexts. The new forms and illustrated uses are offered in the hope that de-facto notational standards will emerge and provide assistance in documentation, teaching and the development of visual design and browsing tools.
A delay model for logic synthesis of continuously-sized networks
Authors: Joel Grodstein, Eric Lehman, Heather Harkness, Bill Grundmann, Yosinatori Watanabe
Venue: Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design (1995)

Abstract: We present a new delay model for use in logic synthesis. A traditional model treats the area of a library cell as constant and makes the cell's delay a linear function of load. Out model is based on a different, but equally fundamental linearity in the equation relating area, delay, and load: namely, we may keep a cell's delay constantly making its area a linear function of load. This allows us to technology map using a library with continuous device sizing, satisfies certain electrical noise and power constraints, and in certain cases is computationally simpler than a traditional model. We give results to support these claims. A companion paper uses the computational simplicity to explore a wide search space of algebraic factorings in a mapped network.
A modular and hybrid connectionist system for speaker identification
Authors: Younès Bennani
Venue: Neural Computation (1995)

This paper presents and evaluates a modular/hybrid connectionist system for speaker identification. Modularity has emerged as a powerful technique for reducing the complexity of connectionist systems, and allowing a priori knowledge to be incorporated into their design. Text-independent speaker identification is an inherently complex task where the amount of training data is often limited. It thus provides an ideal domain to test the validity of the modular/hybrid connectionist approach. To achieve such identification, we develop, in this paper, an architecture based upon the cooperation of several connectionist modules, and a Hidden Markov Model module. When tested on a population of 102 speakers extracted from the DARPA-TIMIT database, perfect identification was obtained.
Private Computations Over the Integers
Authors: Benny Chor, Mihaly Gereb-Graus, Eyal Kushilevitz
Venue: SIAM Journal on Computing (1995)

The subject of this work is the possibility of private distributed computations of $n$-argument functions defined over the integers. A function $f$ is $t$-private if there exists a protocol for computing $f$, so that no coalition of at most $t$ participants can infer any additional information from the execution of the protocol. It is known that over finite domains, every function can be computed $\left\lfloor{(n-1)/2}\right\rfloor$-privately. Some functions, like addition, are even $n$-private. We prove that this result cannot be extended to infinite domains. The possibility of privately computing $f$ is shown to be closely related to the communication complexity of $f$. Using this relation, we show, for example, that $n$-argument addition is $\left\lfloor{(n-1)/2}\right\rfloor$-private over the nonnegative integers, but not even $1$-private over all the integers. Finally, a complete characterization of $t$-private Boolean functions over countable domains is given. A Boolean function is $1$-private if and only if its communication complexity is bounded. This characterization enables us to prove that every Boolean function falls into one of the following three categories: It is either $n$-private, $\left\lfloor{(n-1)/2}\right\rfloor$-private but not $\left\lceil{n/2}\right\rceil $-private, or not $1$-private.
On the complexity of dataflow analysis of logic programs
Authors: Saumya K. Debray
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1995)

It is widely held that there is a correlation between complexity and precision in dataflow analysis, in the sense that the more precise an analysis algorithm, the more computationally expensive it must be. The details of this relationship, however, appear to not have been explored extensively. This article reports some results on this correlation in the context of logic programs. A formal notion of the &ldquo;precision&rdquo; of an analysis algorithm is proposed, and this is used to characterize the worst-case computational complexity of a number of dataflow analyses with different degrees of precision. While this article considers the analysis of logic programs, the technique proposed, namely the use of &ldquo;exactness sets&rdquo; to study relationships between complexity and precision of analyses, is not specific to logic programming in any way, and is equally applicable to flow analyses of other language families.
Precision and approximate flatness in artificial neural networks
Authors: Maxwell B. Stinchcombe
Venue: Neural Computation (1995)

Several of the major classes of artificial neural networks' output functions are linear combinations of elements of approximately flat sets. This gives a tool for understanding the precision problem as well as providing a rationale for mixing types of networks. Approximate flatness also helps explain the power of artificial neural network techniques relative to series regressions---series regressions take linear combinations of flat sets, while neural networks take linear combinations of the much larger class of approximately flat sets.
Utilizing CD-ROM in large science classes
Authors: Paul F. Ramp, Carolyn I. Staples
Venue: ACM SIGGRAPH Computer Graphics (1996)

Higher education is experiencing a period of both external and internal evaluation of its efficiency. For the most part the external reviews are outcome based, comparing expenditures to some measure of student performance. In contrast, internal evaluations are largely focused on curriculum and how well the current curriculum reflects the current state of knowledge in the field.For many departments, colleges and universities, the outcome of these internal and external reviews has created a situation in which the faculty is expected to do more for a larger student body, usually with fewer resources. In response to this situation, we have developed and placed into use an interactive CD for students of the general biology courses at the University of Tennessee. The underlying premise of this project is that while the student's ability to directly interact with faculty or to have class or lab time for learning through mistake and repetition is diminishing, an interactive CD has the potential to provide much of that inquisitive experience.There are several advantages to working in a multimedia environment. First is the ability to utilize graphics, text and video to reinforce a single concept. Second is the viewer's ability to organize information in a way that is individually meaningful. The parallel/attendant problem is the potential for the viewer to become lost in the information as well as requiring that all of the links need to be programmed, whether they are useful or not.
Sweden: survey of computer graphics and visualization education
Authors: Lars Kjelldahl
Venue: ACM SIGGRAPH Computer Graphics (1996)

This short overview of education in computer graphics and visualization in Sweden was compiled through contact with all the main universities in Sweden. Although we don't know of any "pure" visualization course in Sweden, some visualization material is included in many of the computer graphics courses. There are also courses on related topics, such as multimedia and human computer interaction. Computer graphics teachers in Sweden meet every other year. Also education is one of the interest areas for the Swedish computer graphics society, Sigrad, and we are working with the Eurographics Working Group on Education.