ppxscal/embedding_network huggingface dataset:
Track 4 background and purpose
Authors: John Foreman, Richard R. Gross
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

Track 4 (Ada in Practice) was instituted as part of TRI-Ada '89 because few formal paper submissions had dealt with lessons learned from actual Ada usage in real-world, for-profit projects. The success of Track 4 sessions at TRI-Ada '89 led to continuation this year. The purpose of Track 4 is in-depth presentation of Ada development efforts from the perspective of systems engineering, software engineering, design, compiler implementations, tool capabilities/deficiencies, personnel, and policy decisions/rationale. The focus is on aggregate project decisions, tradeoffs, and rationale. Track 4 also differs from other conference sessions in that each presentation is 90 minutes long and extensive audience interaction is a part of each session. The Track 4 concept acknowledges that the current &ldquo;system&rdquo; for writing and clearing papers may place obstacles in the way of obtaining papers which are reflective of real experience. For example, personnel in front-line positions on critical programs are generally too busy to generate formal papers; the DoD/contractor approval cycle must be complied with, and companies must deal with the issue of competition sensitivity when putting activities and decisions into a formally written paper. Rather than describing programs, Track 4 presentations focus very strongly on alternatives/rationale for design decisions; in other words, the &ldquo;why,&rdquo; not the &ldquo;what.&rdquo; Track 4 presentations are selected based on the degree to which they contain specific rationale for decisions on the following subjects: Difficulties encountered Substantive technical issues Quantitative system data Hardware architecture Software architecture Tradeoffs among hardware, systems software and applications software System size and complexity determination Compiler and tool problems Usefulness of management techniques Why Ada was beneficial/not beneficial What would be done differently next time Each Track 4 presentation is the result of cooperative effort between the selected project and a member of the TRI-Ada '90 staff known as a rapporteur. The rapporteur works with the project over a period of months to: optimize the presentation's targeting of the criteria for these high-potential sessions, insure the potential for audience interaction, and moderate the session at the conference The success of Track 4 sessions is, in no small part, due to the work of the rapporteurs; their efforts are hereby acknowledged.
A relaxation time heuristic for reducing initialization bias in simulation of M/Ek/1 queueing systems
Authors: Emily Roth
Venue: Proceedings of the 17th conference on Winter simulation (1985)

In a previous paper, a heuristic technique was introduced for reducing initialization bias in Monte-Carlo simulation of stationary, infinite-capacity, Markovian queueing systems. The technique differs from many existing methods in that, rather than relying on a statistical analysis of output from preliminary simulation runs, it is based on characteristics of the underlying theoretical model. Experimental results presented earlier provide convincing evidence that use of the heuristic yields an unbiased estimate of the steady-state expected queue length in M/M/1 systems with virtually no cost added to the simulation. We now present results of experiments designed to validate the technique for estimating the steady-state expected number of customers in M/Ek/1 queueing systems.
Low power logic synthesis for XOR based circuits
Authors: Unni Narayanan, C. L. Liu
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

An abundance of research efforts in low power logic synthesis have so far been focused on AND/OR or NAND/NOR based logic. A typical approach is to first generate an initial multi- level AND/OR or NAND/NOR representation of a boolean function. Next, the representation is optimized in terms of power. However, there are major classes of circuits such as arithmetic functions which have sizable AND/OR representations but have very compact AND/XOR representations. For these functions AND/OR based optimization approach often yields poor results. In this paper, we put forth a paradigm for low power logic synthesis based on AND/XOR representations of boolean functions. Specifically, we propose transforming a boolean function into a Fixed Polarity Reed Muller form that allows us to efficiently synthesize XOR trees and AND trees with provably minimum switching activity. Preliminary experimental results show that we attain good power savings with negligible area overhead and often area reduction when compared to conventional AND/XOR based synthesis methods and the Berkeley SIS system.
Advance reservations for predictive service in the Internet
Authors: Mikael Degermark, Torsten Köhler, Stephen Pink, Olov Schelén
Venue: Multimedia Systems (1997)

We extend a measurement-based admission control algorithm suggested for predictive service to provideadvance reservations for guaranteed and predictive service.while retaining the attractive features of predictive service.The admission decision for advance reservations is based oninformation about flows that overlap in time. For flows thathave not yet started, the requested values are used, and forthose that have already started measurements are used. Thisallows us to estimate the network load accurately for thenear future. To provide advance reservations we ask usersto include durations in their requests. We present simulationresults to show that predictive service with advance reservations provides utilization levels significantly higher thanthose for guaranteed service, and comparable to those forpredicted service without advance reservations. Those utilization levels are reached without any preemption of otheradmitted flows. Finally, we discuss how to setup advancereservations over multiple hops in the Internet using resourcereservation setup protocols.
On the roles of simulation, analytical modeling, and measurement in solving complex problems (panel)
Venue: Proceedings of the 17th conference on Winter simulation (1985)

A variety of tools and techniques are used in the design phase of new products. Three major techniques used both to assess preliminary designs and to monitor progress from design to fruition include Analytic Modeling, Measurement, and Simulation. The three techniques can be viewed as a tripod of evidence supporting the realizability of a design. In this view, each complements and assists the others. Measurement data provides facts from a prototype that can be extrapolated to the product. This data can also provide valuable insight to interactions that may not be predicted from either analytical or simulation models. Simulation experiments can provide better understanding of interactions and relationships among system components. These experiments can show which areas of the design need further exploration via the other techniques. Analytic modeling can provide rapid answers to certain questions. It too can point to areas needing further design refinement and study. There are facets of the design process where each technique is the most appropriate for use and provides the best results. Conversely, each of the three techniques has its own specific drawbacks and limitations. Fortunately, the techniques complement one another and can interact in a synergistic fashion to provide a whole that is greater than the sum of the parts. The purpose of this panel presentation is to explore the roles and interrelationships of the three techniques. As of the proceedings publication deadline, the participants scheduled for this session include: Ms. Edie T. Stevenson A. T. and T. Information Systems Dr. Edward D. Lazowska Digital Systems Research Center Professor Paul F. Roth Computer Science Department Virginia Polytechnic Institute State University Dr. Domenico Ferrari Computer Science Department University of California, Berkeley Mr. Julian Reitman Norden Systems
A notation for describing multiple views of VLSI circuits
Authors: Jean-Loup Baer, Meei-Chiueh Liem, Larry McMurchie, Rudolf Nottrott, Lawrence Snyder, Wayne Winder
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

A declarative hierarchical notation is introduced that allows the parametric representation of entire families of VLSI circuits. Layout, schematic diagrams and network structure are all accommodated by the notation in a way that emphasizes common elements. The notation is the basis of a structured environment for developing design generators as well as capturing design expertise.
Consistency maintenance in multiresolution simulation
Authors: Paul F. Reynolds,  Jr., Anand Natrajan, Sudhir Srinivasan
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (1997)

Simulations that run at multiple levels of resolution often encounter consistency problems because of insufficient correlation between the attributes at multiple levels of the same entity. Inconsistency may occur despite the existence of valid models at each resolution level. Cross-Resolution Modeling (CRM) attempts to build effective multiresolution simulations. The traditional approach to CRM&mdash;aggregation-disaggregation&mdash;causes chain disaggregation and puts an unacceptable burden on resources. We present four fundamental observations that would help guide future approaches to CRM. These observations form the basis of an approach we propose that involves the design of Multiple Resolution Entities (MREs). MREs are the foundation of a design that incorporates maintaining internal consistency. We also propose maintenance of core attributes as an approach to maintaining internal consistency within an MRE..
Some suggestions on the implementation of reliable simulations
Authors: Yi-Ling F. Chiang
Venue: ACM SIGNUM Newsletter (1997)

We studied Several simulation programming codes. Based on our findings, the following suggestions may be necessary in the development of reliable simulation packages: 1) avoid global storage assignment in coding; 2) construct modular programming structure in implementation; 3) employ simple schemes in computation; 4) do not introduce pseudo-physical term in modeling; 5) engage reasonable time interval in run; and 6) establish solution verification in use.
CAD and foundries for microsystems
Authors: J. M. Karam, B. Courtois, H. Boutamine, P. Drake, A. Poppe, V. Szekely, M. Rencz, K. Hofmann, M. Glesner
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

Besides foundry facilities, Computer-Aided Design (CAD)tools are also required to move microsystems from researchprototypes to an industrial market. Currently available CADtools need extensions before they can be used for theautomated design of micromachined devices.This paper presents a low cost access to microsystemtechnology (MST), applied by the CMP service, and based onthe use of existing microelectronics production lines, withadditional post-processing for microsystem specific 2D and3D structures, and a global CAD approach for the design andsimulation of microsystems applied to currently availablecommercial CAD tools, e.g. Mentor Framework, in order toensure a continuous flow from the design to themanufacturing.
Partial dead code elimination using slicing transformations
Authors: Rastislav Bodík, Rajiv Gupta
Venue: ACM SIGPLAN Notices (1997)

We present an approach for optimizing programs that uncovers additional opportunities for optimization of a statement by predicating the statement. In this paper predication algorithms for achieving partial dead code elimination (PDE) are presented. The process of predication embeds a statement in a control flow structure such that the statement is executed only if the execution follows a path along which the value computed by the statement is live. The control flow restructuring performed to achieve predication is expressed through slicing transformations. This approach achieves PDE that is not realizable by existing algorithms. We prove that our algorithm never increases the operation count along any path, and that for acyclic code all partially dead statements are eliminated. The slicing transformation that achieves predication introduces into the program additional conditional branches. These branches are eliminated in a branch deletion step based upon code duplication. We also show how PDE can be used by acyclic schedulers for VLIW processors to reduce critical path lengths along frequently executed paths.
Differentiation-Based Edge DetectionUsing the Logarithmic Image Processing Model
Authors: Guang Deng, Jean-Charles Pinoli
Venue: Journal of Mathematical Imaging and Vision (1998)

The logarithmic image processing (LIP) model is a mathematical framework which provides a specific set of algebraic and functional operations for the processing and analysis of intensity images valued in a bounded range. The LIP model has been proved to be physically justified by that it is consistent with the multiplicative transmittance and reflectance image formation models, and with some important laws and characteristics of human brightness perception. This article addresses the edge detection problem using the LIP-model based differentiation. First, the LIP model is introduced, in particular, for the gray tones and gray tone functions, which represent intensity values and intensity images, respectively. Then, an extension of these LIP model notions, respectively called gray tone vectors and gray tone vector functions, is studied. Third, the LIP-model based differential operators are presented, focusing on their distinctive properties for image processing. Emphasis is also placed on highlighting the main characteristics of the LIP-model based differentiation. Next, the LIP-Sobel based edge detection technique is studied and applied to edge detection, showing its robustness in locally small changes in scene illumination conditions and its performance in the presence of noise. Its theoretical and practical advantages over several well-known edge detection techniques, such as the techniques of Sobel, Canny, Johnson and Wallis, are shown through a general discussion and illustrated by simulation results on different real images. Finally, a discussion on the role of the LIP-model based differentiation in the current context of edge detection is presented.
Analysis of Some Quadrilateral Nonconforming Elements for Incompressible Elasticity
Authors: Zhimin Zhang
Venue: SIAM Journal on Numerical Analysis (1997)

In this work, some nonconforming elements on arbitrary quadrilateral meshes in solving incompressible elastic equations are analyzed. A uniform optimal convergence rate is established at the incompressible limit $\nu = 0.5$ for both displacement and stresses (or pressure in the case of incompressible flow).
The Number of Coarse-Grid Iterations Every Cycle for the Two-Grid Method
Authors: Lars Ferm
Venue: SIAM Journal on Scientific Computing (1998)

The numerical solution of flow problems with multigrid techniques is considered. The use of extra iterations on coarser grids is investigated. The two-grid method is analyzed for model problems. It turns out that the optimum number of iterations depends on the mesh size of the fine grid. Numerical examples verify the results. A short discussion on more grid levels is also given. The results are applicable for problems with open boundaries.
EDA and the network
Authors: Mark D. Spiller, A. Richard Newton
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

Digital computer networks are playing an increasingly important role in the evaluation, distribution, integration and management of EDA systems. Tools, libraries, design data, and a variety of both design and manufacturing services are accessible today via networks. Networks are also playing a central role in the integration of system design teams, teams that involve a variety of both business and technical disciplines as well as widely distributed geographical locations. Throughout the history of EDA, the architectures used to integrate and distribute computation and interaction have played a central role in the overall design methodology and so have had a major, indirect impact on the choice of the most effective tools, algorithms, and data structures. In this paper, a number of the factors involved in the choice of a suitable architecture for EDA integration are reviewed and a number of ongoing developments and challenges are presented.
Report on the annual survey of departments offering CSAC/CSAB-accredited computer science degree programs
Authors: Renée A. McCauley, Bill Z. Manaris
Venue: ACM SIGCSE Bulletin (1997)

This paper presents results of a survey of departments offering accredited Computer Science degree programs. It discusses demographic information related to curricula, faculty, and students for all such programs, and identifies various trends based on this data. These results are of interest and use to all accredited and non-accredited departments alike, since it provides the information necessary to monitor and compare individual degree programs to other programs in the nation in terms of faculty composition, student enrollment and graduation rates, faculty salaries, and curriculum issues.
The use of animation to explain genetic algorithms
Authors: David Jackson, Andrew Fovargue
Venue: ACM SIGCSE Bulletin (1997)

Algorithm animation has been applied to a huge variety of algorithms, and has been found to be of enormous benefit in assisting with their comprehension. However, the radical nature of several classes of algorithm has caused them to be largely overlooked in this regard; noticeable among these are genetic algorithms. In addressing this, we have used the XTANGO software system to develop a set of animation sequences designed to illustrate the behaviour of a genetic algorithm applied to a real-world problem. The resulting package is general enough to be adapted easily to a range of problems.
The multilevel relational (MLR) data model
Authors: Ravi Sandhu, Fang Chen
Venue: ACM Transactions on Information and System Security (TISSEC) (1998)

Many multilevel relational models have been proposed; different models offer different advantages. In this paper, we adapt and refine several of the best ideas from previous models and add new ones to build the new Multilevel Relational (MLR) data model. MLR provides multilevel relations with element-level labeling as a natural extension of the traditional relational data model. MLR introduces several new concepts (notably, data-borrow integrity and the UPLEVEL statement) and significantly redefines existing concepts (polyinstantiation and referential integrity as well as data manipulation operations). A central contribution of this paper is proofs of soundness, completeness, and security of MLR. A new data-basedsemantics is given for the MLR data model by combining ideas from SeaView, belief-based semantics, and LDV. This new semantics has the advantages of both eliminating ambiguity and retaining upward information flow. MLR is secure, unambiguous, and powerful. It has five integrity properties and five operations for manipulating multilevel relations. Soundness, completeness, and security show that any of the five database manipulation operations will keep database states legal (i.e., satisfy all integrity properties), that every legal database state can be constructed, and that MLR is noninterfering. The expressive power of MLR also compares favorably with several other models.
Core Java 1.1: volume II&mdash;advanced features
Authors: Cay S. Horstmann, Gary Cornell
Venue:  (1998)

“Core Java is the best choice for experienced programmers. It is unmatched for technical depth, yet remains highly readable.” -K.N. King, Computer ReviewsComprehensive and up-to-date coverage of advanced topics including: input and output object serialization multithreading network programming distributed objects databases native methods Java BeansPut Java to work on real problems!Written for serious programmers who have mastered the fundamentals of the Java language, Core Java 1.1, Vol. II thoroughly explains the more advanced features and libraries you need to build real programs.New chapters on Java Beans, Advanced AWT, Security, and Internationalization focus on the features and functions added to Java with the release of JDK 1.1. Updated chapters on multithreading and networking include extensive examples and thoroughly tested sample code that illustrate some of the most powerful features of Java.Volume II also provides in depth coverage of the Java Enterprise API-JDBC, RMI, Native Methods-that demonstrates what objects everywhere can be realistically used for.The CD-ROM includes all Java source code examples from the book, the latest version of JDK 1.1.x and useful shareware as well as all of the example code from Core Java 1.1, Volume I.
Query Optimization in Multidatabase Systems
Authors: D. K. Subramanian, K. Subramanian
Venue: Distributed and Parallel Databases (1998)

Global query execution in a multidatabase system can be done parallelly, as all the local databases are independent. In this paper, a cost model that considers parallel execution of subqueries for a global query is developed. In order to obtain maximum parallelism in query execution, it is required to find a query execution plan that is represented in the form of a bushy tree and this query tree should be balanced to the maximal possible extent with respect to execution time. A new bottom up approach called Agglomerative Approach (AA) is proposed to construct balanced bushy trees with respect to execution time. By the deterministic nature of this approach, it generates local optimal solutions. This local minima problem will be severe in the case of graph queries, i.e., queries that are represented with a graph structure. A Simulated annealing Approach (SA) is employed to obtain a (near) optimal solution. These approaches (AA and SA) are suitable for handling on-line and off-line queries respectively. A Hybrid Approach (HA), that is an integration of AA and SA, is proposed to optimize queries for which the estimated time to be spent on optimization is known a priori. Results obtained with AA and SA on both tree and graph structured queries are presented.
Programming with Divide-and-Conquer Skeletons: A Case Study of FFT
Authors: Sergei Gorlatch
Venue: The Journal of Supercomputing (1998)

We demonstrate an approach to parallel programming, based on skeletons &ndash; parameterized program schemas with efficient implementations over diverse architectures. The contribution of the paper is two-fold: (1) we classify divide-and-conquer (DC) algorithms and provide a family of provably correct parallel implementations for a particular DC skeleton, called DH (distributable homomorphism); (2) we adjust the mathematical specification of the Fast Fourier Transform (FFT) to the DH skeleton and, thereby, obtain a generic SPMD program, well suited for implementation under MPI. The generic program includes the efficient FFT solutions used in practice &ndash; the binary-exchange and the 2D- and 3D-transpose implementations &ndash; as special cases.
Approximability by Weighted Norms of the Structured and VolumetricSingular Values of a Class of Nonnegative Matrices
Authors: Daniel Hershkowitz, Wenchao Huang, Hans Schneider, Hans Weinberger
Venue: SIAM Journal on Matrix Analysis and Applications (1997)

A known result about the spectral radius of an irreducible nonnegative matrix is extended to all nonnegative matrices. By means of this result, it is shown that the structured singular value and the volumetric singular value of a class of nonnegative matrices can be approximated with arbitrary accuracy by the matrix norm induced by a weighted $\ell_2$ vector norm and in the simplest case by a weighted $\ell_p$ vector norm for any $p$.