ppxscal/embedding_network huggingface dataset:
A Flexible, Extensible Simulation Environment for Testing Real-Time Specifications
Authors: Monica Brockmeyer, Farnam Jahanian, Constance Heitmeyer, Elly Winner
Venue: IEEE Transactions on Computers (2000)

This paper describes MTSim, an extensible, customizable simulation platform for the Modechart toolset (MT). MTSim provides support for ¿plugging in¿ user-defined viewers useful in simulating system behavior in different ways, including application-specific ways. MTSim also supports full user participation in the generation of simulations by allowing users to inject events into the execution trace. Moreover, MTSim provides monitoring and assertion checking of execution traces and the invocation of user-specified handlers upon assertion violation. This paper also introduces an MTSim component called WebSim, a suite of simulation tools for MT, and an application-specific component of MTSim which displays the cockpit of an F-18 aircraft and which responds to user inputs to model a bomb release function.
Middleware For Building Adaptive Systems Via Configuration
Authors: Sanjai Narain, Ravichander Vaidyanathan, Stanley Moyer, William Stephens, Kirthika Parmeswaran, Abdul Rahim Shareef
Venue: Proceedings of the ACM SIGPLAN workshop on Languages, compilers and tools for embedded systems (2001)

COTS (commercial off-the-shelf) devices, including middleware components, are capable of executing powerful, distributed algorithms. Very large, adaptive systems can be created by simply integrating these devices, not by creating new devices, algorithms or external control systems. The principal integration method is configuration: every device is designed to have a finite set of configuration parameters that can be set to definite values. These parameters are static in that, unlike the device's dynamic state, these do not change during the device's normal operation. Inspite of the ubiquity of the configuration method, there is no "science" for it. There are no tools which let one specify global, end-to-end system functionality requirements at a high level, reason about these, and have these compiled into device configurations. On the other hand, it is inherently difficult to develop this science because of the large conceptual gap between global, end-to-end requirements and device configurations. A middleware is needed to bridge this gap in the form of specification, reasoning, compilation and diagnostic tools.This position paper sketches a technique called Service Grammar for developing such middleware for a given domain. It is based on the idea that algorithms for implementing end-to-end functional requirements can be expressed as the enforcement of a set of fundamental requirements. These are upon the existence of definite high-level relationships between configuration parameters of various devices. We can collect these into a Requirements Library. By mixing and matching items from it we can define algorithms for implementing a very wide range of end-to-end functional requirements. This Library can also simplify design of the reasoning, compilation and diagnostic tools. This plan is illustrated by analyzing how realistic service requirements are implemented in a Virtual Private Network via configuration steps.First, a network of "resilient", secure tunnels is set up by composing capabilities of protocols OSPF, GRE and IPSec. Then, quality of service guarantees are established by composing capabilities of MPLS, RSVP and DiffServ. Finally, as an example of configuring middleware components themselves, an example is presented from CORBA security.
Digital synthesis of correlated stationary noise
Authors: P. R. Peabody, D. S. Adorno
Venue: Communications of the ACM (1962)

In this note we propose a method of generating stationary noise with a prescribed auto-covariance function by digital methods. The need for such a technique often arises in testing the performance of data processing and engineering systems, where inputs corrupted with correlated noise (of a known form) are required. The technique is quite simple and produces strict-sense stationary noise which agrees approximately with R(&tgr;), the prescribed auto-covariance function (acf), over an interval [- T0, T0]. The method consists of approximating the spectral density by a periodic process with spectral lines, and then synthesizing the periodic noise with random phases and appropriate amplitudes. In order to simplify discussion of the statistical properties of the noise generated, the technique is first presented in terms of exact harmonic analysis. In practice, discrete harmonic analysis as presented in the third section is used.
An algorithm for optimized Boolean evaluation in information management systems
Authors: Gerard D. Finn
Venue: Communications of the ACM (1984)

In cases where simple data validation techniques are inadequate and optimization policies relatively complex (e.g., in health and medical systems), a Boolean optimization algorithm can be used to report errors accurately and unambiguously. The algorithm is presented in the context of a data-validating software module that uses an LR(1)-parser. The algorithm's precision makes it of potential use for the retrieval of records that nearly satisfy a query.
Logic Design Validation via Simulation and Automatic Test Pattern Generation
Authors: Hussain Al-Asaad, John P. Hayes
Venue: Journal of Electronic Testing: Theory and Applications (2000)

We investigate an automated design validation scheme for gate-level combinational and sequential circuits that borrows methods from simulation and test generation for physical faults, and verifies a circuit with respect to a modeled set of design errors. The error models used in prior research are examined and reduced to five types: gate substitution errors (GSEs), gate count errors (GCEs), input count errors (ICEs), wrong input errors (WIEs), and latch count errors (LCEs). Conditions are derived for a gate to be testable for GSEs, which lead to small, complete test sets for GSEs&semi; near-minimal test sets are also derived for GCEs. We analyze undetectability in design errors and relate it to single stuck-line (SSL) redundancy. We show how to map all the foregoing error types into SSL faults, and describe an extensive set of experiments to evaluate the proposed method. These experiments demonstrate that high coverage of the modeled errors can be achieved with small test sets obtained with standard test generation and simulation tools for physical faults.
The simplex method of linear programming using LU decomposition
Authors: Richard H. Bartels, Gene H. Golub
Venue: Communications of the ACM (1969)

Standard computer implementations of Dantzig's simplex method for linear programming are based upon forming the inverse of the basic matrix and updating the inverse after every step of the method. These implementations have bad round-off error properties. This paper gives the theoretical background for an implementation which is based upon the LU decomposition, computed with row interchanges, of the basic matrix. The implementation is slow, but has good round-off error behavior. The implementation appears as CACM Algorithm 350.
UTSi CMOS: A Complete RF SOI Solution
Authors: R. Reedy, J. Cable, D. Kelly, M. Stuber, F. Wright, G. Wu
Venue: Analog Integrated Circuits and Signal Processing (2000)

Fully integrated frequency synthesizers are comprised of three major blocks: a voltage controlled oscillator (VCO), a phase locked loop (PLL) and a loop filter between them. In this paper we discuss the technology and design issues necessary to make fully integrated synthesizers capable of meeting the demanding specifications of GSM and CDMA systems. All elements of the synthesizer will be discussed. Two of the most difficult elements to integrate are the inductor and varactor in the resonant circuit of the VCO; we will discuss these devices at length. CMOS/SOI on a sapphire substrate has shown to significantly improve RF device characteristics. Reduced floating body effects; achievement of high Q on chip components; excellent isolation; and high performance RF circuits enable high performance fully integrated synthesizers on SOS substrates.
Enhanced operational semantics: a tool for describing and analyzing concurrent systems
Authors: Pierpaolo Degano, Corrado Priami
Venue: ACM Computing Surveys (CSUR) (2001)

This article surveys the definition and application of an enhancement of structural operational semantics in the field of concurrent systems, and also addresses issues of distribution and mobility of code. The focus is on how enriching the labels of transitions with encodings of their deduction trees is sufficient to derive qualitative and quantitative information on the systems in hand simply by relabeling the transitions of a unique concrete model.
Stability preserving transformations: packet routing networks with edge capacities and speeds
Authors: Allan Borodin, Rafail Ostrovsky, Yuval Rabani
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

In the context of an adversarial input model, we consider the effect on stability results when edges in packet routing networks can have capacities and speeds/slowdowns. In traditional packet routing networks, every edge is considered to have the same unit capacity and unit speed. We consider both static modifications (i.e. where the capacity or speed of an edge is fixed) and dynamic modifications where either the capacity or the speed of an edge can be dynamically changing over time. Amongst our results, we show that the universal stability of LIS is not preserved when either the capacity or the speed is changing dynamically whereas many other common scheduling protocols do maintain their universal stability. In terms of universal stability of networks, stability is preserved for dynamically changing capacities and speeds. The situation for static modifications, is not as clear but we are able to show that (in contrast to the dynamic case) that any &ldquo;well defined&rdquo; universally stable scheduling rule maintains its universality under static capacities, and common scheduling rules also maintain their universal stability under static speeds.
Interrupt driven programming
Authors: Marvin Zelkowitz
Venue: Communications of the ACM (1971)

This note is an extension of the ideas expressed by Morgan [1]. He suggests a new form of interrupt which he proposes to use to control the execution of a program, in his case a file management system called DPL [2]. Simply stated, he has attached to every subroutine a Boolean expression which, if true, would cause that subroutine to be executed. Since his implementation is via software, a relatively time-consuming check must be made whenever some condition in the program changes (e.g. some variable has a value changed). A rather simple hardware addition to existing machines can easily implement this interrupt. The following is such a proposal.
Program organization and record keeping for dynamic storage allocation
Authors: Anatol W. Holt
Venue: Communications of the ACM (1961)

The material presented in this paper is part of the design plan of the core allocation portion of the ACSI-MATIC Programming System. Project ACSI-MATIC is concerned with the application of computer techniques to the activities of certain headquarters military intelligence operations of the U.S. Army. In describing features of organization and record keeping there has been no attempt at completeness, but rather an exploration of the salient aspects of the system to some reasonable level of technical detail.1
Quality estimation of test vectors and functional validation procedures based on fault and error models
Authors: T. Riesgo, Y. Torroja, E. de la Torre, J. Uceda
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper presents a method to estimate the quality of a set of test vectors and the validation procedures from pre-synthesised descriptions in VHDL. The method is based on the definition of fault models, for test features evaluation, and error models, for quality validation estimation.
Hint-based cooperative caching
Authors: Prasenjit Sarkar, John H. Hartman
Venue: ACM Transactions on Computer Systems (TOCS) (2000)

This article presents the design, implementation, and measurement of a hint-based cooperative caching file system. Hints allow clients to make decisions based on local state, enabling a loosely coordinated system that is simple to implement. The resulting performance is comparable to that of existing tightly coordinated algorithms that use global state, but with less overhead. Simulations show that the block access times of our system are as good as those of the existing algorithms, while reducing manager load by more than a factor of seven, block lookup traffic by nearly a factor of two-thirds, and replacement traffic a factor of five. To verify our simulation results in a real system with real users, we implemented a prototype and measured its performance for one week. Although the simulation and prototype environments were very different, the prototype system mirrored the simulation results by exhibiting reduced overhead and high hint accuracy. Furthermore, hint-based cooperative caching reduced the average block access time to almost half that of NFS.
On the parallel simulation of fixed channel allocation algorithms
Authors: Peter Alleyne, Carl Tropper
Venue: Mobile Networks and Applications (2000)

We present, in this paper, several channel allocation algorithms for use in cellular communications networks or mobile networks. The channel allocation algorithms make use of fixed allocation of channels and channel reorganization. The channel reorganization algorithms are used to free channels within a neighborhood of the cell in which the requesting call originates. The performance of these algorithms was evaluated via distributed simulation, making use of the Chandy&ndash;Misra&ndash;Bryant NULL message algorithm, on a BBN Butterfly multiprocessor. In addition to evaluating the performance of the channel allocation algorithms, we examine the efficiency of the NULL message algorithm as a tool for our simulations. The reason for making use of parallel simulation was to avoid the long simulation times and large memory consumption characteristic of sequential &lpar;uniprocessor&rpar; simulations. Our results indicate that our channel allocation algorithms performed efficiently. Upwards of 20% of the calls which were not initially connected by the borrowing schemes were connected after channel reorganization. The NULL message approach proved to be efficient when the message traffic was not extremely low.
Extending Graham-Glanville techniques for optimal code generation
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2000)

We propose a new technique for constructing code-generator generators, which combines the advantages of the Graham-Glanville parsing technique and the bottom-up tree parsing approach. Machine descriptions are similar to Yacc specifications. The construction effectively generates a pushdown automaton as the matching device. This device is able to handle ambigious grammars, and can be used to generate locally optimal code without the use of heuristics. Cost computations are performed at preprocessing time. The class of regular tree grammars augmented with costs that can be handled by our system properly includes those that can be handled by bottom-up systems based on finite-state tree parsing automata. Parsing time is linear in the size of the subject tree. We have tested the system on specifications for some systems and report table sizes.
Programming systems and languages 1965-1975
Authors: Saul Rosen
Venue: Communications of the ACM (1972)

In spite of impressive gains by PL/I, Fortran and Cobol remain the languages in which most of the world's production programs are written and will remain so into the foreseeable future. There is a great deal of theoretical interest in Algol 68 and in extensible languages, but so far at least they have had little practical impact. Problem-oriented languages may very well become the most important language development area in the next five to ten years. In the operating system area all major computer manufacturers set out to produce very ambitious multiprogramming systems, and they all ran into similar problems. A number of university projects, though not directly comparable to those of the manufacturers, have contributed greatly to a better understanding of operating system principles. Important trends include the increased interest in the development of system measurement and evaluation techniques, and increased use of microprogramming for some programming system functions.
Collaboration with Lean Media: how open-source software succeeds
Authors: Yutaka Yamauchi, Makoto Yokozawa, Takeshi Shinohara, Toru Ishida
Venue: Proceedings of the 2000 ACM conference on Computer supported cooperative work (2000)

Open-source software, usually created by volunteer programmers dispersed worldwide, now competes with that developed by software firms. This achievement is particularly impressive as open-source programmers rarely meet. They rely heavily on electronic media, which preclude the benefits of face-to-face contact that programmers enjoy within firms. In this paper, we describe findings that address this paradox based on observation, interviews and quantitative analyses of two open-source projects. The findings suggest that spontaneous work coordinated afterward is effective, rational organizational culture helps achieve agreement among members and communications media moderately support spontaneous work. These findings can imply a new model of dispersed collaboration.
Adversarial queuing theory
Authors: Allan Borodin, Jon Kleinberg, Prabhakar Raghavan, Madhu Sudan, David P. Williamson
Venue: Journal of the ACM (JACM) (2001)

We consider packet routing when packets are injected continuously into a network. We develop an adversarial theory of queuing aimed at addressing some of the restrictions inherent in probabilistic analysis and queuing theory based on time-invariant stochastic generation. We examine the stability of queuing networks and policies when the arrival process is adversarial, and provide some preliminary results in this direction. Our approach sheds light on various queuing policies in simple networks, and paves the way for a systematic study of queuing with few or no probabilistic assumptions.
Images from computers and microfilm plotters
Authors: M. R. Schroeder
Venue: Communications of the ACM (1969)

Digital computers are widely used for the processing of information and data of all kinds, including the pictorial information contained in photographs and other graphical representations. Efficient conversion facilities for putting graphical information into the computer and retrieving it in graphical form are therefore much needed. One of the most commonly employed devices for obtaining permanent graphical output from digital computers is the microfilm plotter. Regrettably, present models have no provision for producing images with a continuous gray scale or &ldquo;halftones.&rdquo; In this note several programming techniques are described for obtaining halftone pictures from a microfilm plotter under the control of a digital computer. Illustrative examples of several methods are given.
Incorporating origin shifts into the QR algorithm for symmetric tridiagonal matrices
Authors: G. W. Stewart
Venue: Communications of the ACM (1970)

The QR iteration for the eigenvalues of a symmetric tridiagonal matrix can be accelerated by incorporating a sequence of origin shifts. The origin shift may be either subtracted directly from the diagonal elements of the matrix or incorporated by means of an implicit algorithm. Both methods have drawbacks: the direct method can unnecessarily degrade small eigenvalues, while the implicit method can effectively loose the shift and thereby retard the convergence. This paper presents a new method which has neither drawback.
Scalable multicast security with dynamic recipient groups
Authors: Refik Molva, Alain Pannetrat
Venue: ACM Transactions on Information and System Security (TISSEC) (2000)

In this article we propose a new framework for multicast security based on distributed computation of security transforms by intermediate nodes. The involvement of intermediate nodes in the security process causes a new type of dependency between group membership and the topology of the multicast network. Thanks to this dependency, the containment of security exposures in large multicast groups is ensured. The framework also ensures both the scalability for large dynamic groups and the security of individual members. Two different key distribution protocols complying with the framework are introduced: an extension of the EIGamal encryption scheme, and one based on a multiexponent version of RSA.
Constraints space management for the layout of analog IC's
Authors: B. G. Arsintescu, R. H. J. M. Otten
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

An automated technique to narrow down the number of parameters for linear constraint transformation models of analog circuits is described. The sets of more important circuit parameters and specifications are confined in an efficient constraint transformation model. The method is based on least square approximation and principal component analysis of the sensitivity matrix of the transformation. The resulting model encompass the constraints confined using designers' expertize for approximated circuit calculations.
Video Endoscopic Database on WWW Linking with ISDN
Authors: Norio Kimura, Isao Nakajima, Hiroshi Juzoji, Takeshi Miwa
Venue: Journal of Medical Systems (2001)

We report here on a study of creating medical an image library comprised of simple but digitized gastrointestinal video-scope images, which were digitally compressed using MPEG-1 compression, and on the use of this library for clinical and educational applications. We have designed and installed a test-bed database (WWW) for gastrointestinal video-scope images linking with ISDN at 128 Kbps enables Internet access. This paper discusses its development, operation, problems, and educational and clinical use. A test-bed operation of the database was conducted by going on-line on the Internet and through an ISDN circuit (point-to-point connection) at a speed of 128 Kbps. This dynamic image database proved to be effective in diagnostic imaging for endoscopic diagnosis and treatment. It also proved to be useful for improving the clinical levels of geographically isolated physicians.
UTIS (Urban Transportation Information System) a geo-spatial transport database
Authors: Adam Etches, David Parker, Sean Ince, Philip James
Venue: Proceedings of the 8th ACM international symposium on Advances in geographic information systems (2000)

This paper proposes the design of an extended DBMS as required for integrated management of urban transportation systems. We introduce an extended `lowest common denominator' database model that supports a wide and varied range of urban transport tasks, which include management, simulation and planning. This paper is the result of research being carried out and is formulated by database expertise and transport knowledge. There has been a full analysis of transport data objects and attributes. The database schema is based on an object-relationship model extended to the representation of spatial data types and spatial and temporal events.