ppxscal/embedding_network huggingface dataset:
Introduction overview of &ldquo;artificial life&rdquo;&mdash;evolving intelligent agents for modeling simulation
Authors: A. Martin Wildberger
Venue: Proceedings of the 28th conference on Winter simulation (1996)

"Artificial Life," despite its biological analogy and the hyperbole that its name implies, is really a collection of methods for building discrete event simulations with evolving multiple agents. It consists mainly of representing parts of systems or natural phenomena as individual active objects that may be both persistent and self-modifiable, operating on them with genetic algorithms or other evolutionary computing techniques and treating their multi-dimensional parameter (state) space discretely, by using cellular automata or similar coupled map lattices. The attractiveness of these methods for general purpose modeling and simulation lies in their ability to produce complex emergent phenomena out of a small set of relatively simple rules, constraints and relationships couched in either quantitative or qualitative terms. This tutorial includes brief introductions to both GA and CA, a description of a tool kit for building multi-agent simulations, and an outline of a current application to electric power systems and to the evolution of the electric power industry itself References are included to demonstration software and source code available on the internet.
Parameterized schematics
Authors: Richard Barth, Bertrand Serlet, Pradeep Sindhu
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

This paper presents a design capture system that allows parameterized schematics and code to be intermixed freely to produce annotated net lists. A key feature of the system is its extensibility. It provides a small set of powerful abstractions for design description that can easily be extended by users. The system also allows convenient graphical specification of layout generators, and has been used to produce several large VLSI chips.
Statistical Approaches to Feature-Based Object Recognition
Authors: William M. Wells,  III
Venue: International Journal of Computer Vision (1997)

This paper examines statistical approaches to model-based object recognition.Evidence is presented indicating that, in some domains, normal (Gaussian) distributions are more accurate than uniform distributions for modeling feature fluctuations. This motivates the development of new maximum-likelihood and MAP recognition formulations which are based on normal feature models. These formulations lead to an expression for the posterior probability of the pose and correspondences given an image.Several avenues are explored for specifying a recognition hypothesis. In the first approach, correspondences are included as a part of the hypotheses. Search for solutions may be ordered as a combinatorial search in correspondence space, or as a search over pose space, where the same criterion can equivalently be viewed as a robust variant of chamfer matching. In the second approach, correspondences are not viewed as being a part of the hypotheses. This leads to a criterion that is a smooth function of pose that is amenable to local search by continuous optimization methods. The criteria is also suitable for optimization via the Expectation-Maximization (EM) algorithm, which alternates between pose refinement and re-estimation of correspondence probabilities until convergence is obtained.Recognition experiments are described using the criteria with features derived from video images and from synthetic range images.
Safe stratified Datalog with integer order does not have syntax
Authors: Alexei P. Stolboushkin, Michael A. Taitslin
Venue: ACM Transactions on Database Systems (TODS) (1998)

Stratified Datalog with integer (gap)-order (or Datalog &not;,<z ) is considered. A Datalog &not;,<z -program is said to be safe if its bottom-up processing terminates on all valid inputs. We prove that safe Datalog &not;,<z programs do not have effective syntax in the sense that there is no recursively enumerable set S of safe Datalog &not;,<z programs such that every safe Datalog &not;,<z program is equivalent to a program in S.
Interconnect design for deep submicron ICs
Authors: Jason Cong, Zhigang Pan, Lei He, Cheng-Kok Koh, Kei-Yong Khoo
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

In this paper, we study the interconnect layout optimization problem under a higher-order RLC model to optimize not just delay, but also waveform for RLC circuits with non-monotone signal response. We propose a unified approach that considers topology optimization, wiresizing optimization, and waveform optimization simultaneously. Our algorithm considers a large class of routing topologies, ranging from shortest-path Steiner trees to bounded-radius Steiner trees and Steiner routings. We construct a set of required-arrival-time Steiner trees or RATS-trees, providing a smooth trade-off among signal delay, waveform, and routing area. Using a new incremental moment computation algorithm, we interleave topology construction with moment computation to facilitate accurate delay calculation and evaluation of waveform quality. Experimental results show that our algorithm is able to construct a set of topologies providing a smooth trade-off among signal delay, signal settling time, voltage overshoot, and routing cost.
Recent Results in Solving Index-2 Differential-Algebraic Equations in Circuit Simulation
Authors: Roswitha März, Caren Tischendorf
Venue: SIAM Journal on Scientific Computing (1997)

In electric circuit simulation the charge-oriented modified nodal analysis may lead to highly nonlinear DAEs with low smoothness properties. They may have index 2 but they do not belong to the class of Hessenberg form systems that are well understood.In the present paper, on the background of a detailed analysis of the resulting structure, it is shown that charge-oriented modified nodal analysis yields the same index as does the classical modified nodal analysis.Moreover, for index 2 DAEs in the charge-oriented case, a further careful analysis with respect to solvability, linearization, and numerical integration is given.
Merging Computational Elements in Vortex Simulations
Authors: Louis F. Rossi
Venue: SIAM Journal on Scientific Computing (1997)

This paper analyzes the process of merging groups of many Gaussian basis functions into a single basis function in vortex simulations. Analysis of the equations governing this process yields fundamental parameters and uniform estimates of the merger-induced error. In a merging event, the uniform error bound depends only on relationships between nearby computational elements permitting fast and effective merging schemes. In this paper, one such algorithm is proposed and demonstrated.
Dytest: a self-learning algorithm using dynamic testability measures to accelerate test generation
Authors: Weiwei Mao, Micheal D. Ciletti
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

This paper presents a self-learning algorithm using a dynamic testability measure to accelerate test generation. It also introduces the concepts of full logic value label backward implication, the dependent backtrack and K-limited backtracks. Results indicating a high fault coverage are also presented for ten benchmark combinational circuits.
Strongly typed flow-directed representation transformations (extended abstract)
Authors: Allyn Dimock, Robert Muller, Franklyn Turbak, J. B. Wells
Venue: ACM SIGPLAN Notices (1997)

We present a new framework for transforming data representations in a strongly typed intermediate language. Our method allows both value producers (sources) and value consumers (sinks) to support multiple representations, automatically inserting any required code. Specialized representations can be easily chosen for particular source/sink pairs.The framework is based on these techniques:1. Flow annotated types encode the "flows-from" (source) and "flows-to" (sink) information of a flow graph.2. Intersection and union types support (a) encoding precise flow information, (b) separating flow information so that transformations can be well typed, (c) automatically reorganizing flow paths to enable multiple representations.As an instance of our framework, we provide a function representation transformation that encompasses both closure conversion and inlining. Our framework is adaptable to data other than functions.
Teaching programming through paperless assignments: an empirical evaluation of instructor feedback
Authors: Blaine Price, Marian Petre
Venue: Proceedings of the 2nd conference on Integrating technology into computer science education (1997)

This paper considers how facilities afforded by electronic assignment handling can contribute to the quality of Internet-based teaching of programming. It reports a study comparing the nature, form, and quality of feedback provided by instructors on 90 paper and electronic assignments in an introductory Computing course and notes effective strategies for electronic marking.
Response to the Comment on "Geodesic Saliency of Watershed Contours and Hierarchical Segmentation"
Authors: Michel Schmitt
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1998)

This paper presents in details the algorithm of the watershed, which we have sketched in Transactions on Pattern Analysis and Machine Intelligence, vol. 18, no. 12, pp 1,163-1,173 and criticized in this issue. First, the formal definition of the flooding list, the key data structure of the algorithm, is given. Then, the construction of this flooding list and of the watershed are described and proved.
Predicting data cache misses in non-numeric applications through correlation profiling
Authors: Todd C. Mowry, Chi-Keung Luk
Venue: Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture (1997)

To maximize the benefit and minimize the overhead of software-based latency tolerance techniques, we would like to apply them precisely to the set of dynamic references that suffer cache misses. Unfortunately, the information provided by the state-of-the-art cache miss profiling technique (summary profiling) is inadequate for references with intermediate miss ratios - it results in either failing to hide latency, or else inserting unnecessary overhead. To overcome this problem, we propose and evaluate a new technique - correlation profiling - which improves predictability by correlating the caching behavior with the associated dynamic context. Our experimental results demonstrate that roughly half of the 22 non-numeric applications we study can potentially enjoy significant reductions in memory stall time by exploiting at least one of the three forms of correlation profiling we consider.
Process and products for software reuse in Ada
Authors: Sholom Cohen
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

The large scale application of reuse to support software development is not a new concept. Over twenty years ago, M. D. McIlroy expressed the need for: &ldquo;&hellip; standard catalogues of routines, classified by precision, robustness, time-space performance, size limits, and binding time of parameters.&rdquo; [McIlroy 68] He also provided insight that is still valid into: &ldquo;&hellip; the kinds of variability necessary in software components, ways of producing useful inventories, types of components that are ripe for such standardization, and methods of instituting pilot production.&rdquo; McIlroy emphasized the importance of abstraction of common principles in developing these routines, the need for automatic generators, and uniformity of engineering. He also enumerated the degree of parameterization needed for successful reusable software: Choice of precision Choice of robustness, trading off reliability and time-space performance Choice of time-space behavior Choice of algorithm Choice of interfaces with standards for types of error conditions Choice of storage accessing method Choice of data structures within a given algorithm or within different related algorithms In the utility and tool area, these concerns have been met with stable, understandable and supported reusable software subsystems to support applications development. Examples of this software are collections of abstract data structures, data base management systems, development environments, and network managers. Requirements for new applications that depend on reuse of such general subsystems software are specified in light of the existence of that software. The development can achieve significant productivity gains when the software subsystems are reused. Except in reusing these subsystems, reusable software practice has not had the same level of success in specific application areas, with few exceptions. For domains such as command and control, communications, avionics, and shipboard systems, reusable software must address specific application requirements particular to the given domain. The development of a reusable air traffic control architecture by Thomson-CSF is an example of reuse that addresses the requirements of a specific application. [Andribet 90] The details of the architectures and components developed by Thomson-CSF remain within the company, and may have limited applicability for other organizations that develop similar systems but use alternate design strategies. The Common Ada Missile Packages (CAMP) project has also produced reusable software components, primarily for missile operational software, but this software has seen only limited application. [McNicholl 88]
The interaction of software prefetching with ILP processors in shared-memory systems
Authors: Parthasarathy Ranganathan, Vijay S. Pai, Hazim Abdel-Shafi, Sarita V. Adve
Venue: Proceedings of the 24th annual international symposium on Computer architecture (1997)

Current microprocessors aggressively exploit instruction-level parallelism (ILP) through techniques such as multiple issue, dynamic scheduling, and non-blocking reads. Recent work has shown that memory latency remains a significant performance bottleneck for shared-memory multiprocessor systems built of such processors.This paper provides the first study of the effectiveness of software-controlled non-binding prefetching in shared memory multiprocessors built of state-of-the-art ILP-based processors. We find that software prefetching results in significant reductions in execution time (12% to 31%) for three out of five applications on an ILP system. However, compared to previous-generation system, software prefetching is significantly less effective in reducing the memory stall component of execution time on an ILP system. Consequently, even after adding software prefetching, memory stall time accounts for over 30% of the total execution time in four out of five applications on our ILP system.This paper also investigates the interaction of software prefetching with memory consistency models on ILP-based multiprocessors. In particular, we seek to determine whether software prefetching can equalize the performance of sequential consistency (SC) and release consistency (RC). We find that even with software prefetching, for three out of five applications, RC provides a significant reduction in execution time (15% to 40%) compared to SC.
The bits between the lambdas: binary data in a lazy functional language
Authors: Malcolm Wallace, Colin Runciman
Venue: ACM SIGPLAN Notices (1999)

For the programmer, storage media are usually assumed to have a minimum atomic unit of transfer of one byte. However, sometimes it is useful to have an even finer storage granularity of one bit, for instance in order to compress data.This paper describes an API in the lazy functional language Haskell for treating storage media as arbitrary-length streams of bits without byte-alignment constraints. So far as possible, storage media are treated uniformly. In particular, bit-stream memory and binary files share the same API -- a new and useful abstraction over memory management and file management. This uniformity of access leads to a novel technique for lazy random-access to files in a purely functional manner. We also describe a technique for automatically deriving compressed binary representations of user-defined data structures, whose operations provide both in-heap data compression and convenient high-level binary I/O.Of many possible applications, we illustrate the processing of Huffman-encoded image data, and a bibliographic information system which uses lazy B-trees for efficient storage management.
Buffer minimization and time-multiplexed I/O on dynamically reconfigurable FPGAs
Authors: Douglas Chang, Malgorzata Marek-Sadowska
Venue: Proceedings of the 1997 ACM fifth international symposium on Field-programmable gate arrays (1997)

We investigate the hardware implications when combinational logic is implemented on Dynamically Reconfigurable FPGAs (DRFPGAs). We first investigate the number of communication buffers needed by a DRFPGA. These buffers are needed because the time-multiplexednature of DRFPGAs means that only a portion of the circuit implemented on the chip is present at any given time instance. Thus there is a need to store OT buffer signals until they are no longer needed. The hardware cost in a DRFPGA is the maximum number of buffers (plus associated routing) needed at any given time. We show experimentally that this number is almost as large as the number of computation nodes needed at any given time, and in some circuits twice as large. We also give a heuristic algorithm based on rescheduling nodes that reduces the number of buffers needed by 23%. Next we investigate time-multiplexed I/0 on a DRFPGA. We show that by using time-multiplexed 1/0pins, the number of physical I/0pins needed can be reduced by up to 83%.
Finite Element Approximation of the Transport of Reactive Solutes in Porous Media. Part 1: Error Estimates for Nonequilibrium Adsorption Processes
Authors: John W. Barrett, Peter Knabner
Venue: SIAM Journal on Numerical Analysis (1997)

In this paper we analyze a fully practical piecewise linear finite element approximation involving numerical integration, backward Euler time discretization, and possibly regularization of the following degenerate parabolic system arising in a model of reactive solute transport in porous media: find $\{u(x,t),v(x,t)\}$ such that \begin{eqnarray*} &\partial_t u + \partial_t v - \Delta u =f \quad\mbox{in } \Omega \times(0,T] \qquad u=0\quad\mbox{on } \partial\Omega\times(0,T]&\\ &\partial_tv=k(\varphi(u)-v) \quad\mbox{in }\Omega\times(0,T]&\\ &u(\cdot\,,0)=g_1(\cdot)\quad v(\cdot\,,0) =g_2(\cdot)\quad\mbox{in } \Omega\subset \Real^d,\quad 1\le d\le 3& \end{eqnarray*} for given data $k\in \Real^+$, $f$, $g_1$, $g_2$ and a monotonically increasing $\varphi\in C^0(\Real)\cap C^1(-\infty,0]\cup(0,\infty)$ satisfying $\varphi(0)=0$, which is only locally H&ouml;lder continuous with exponent $p\in(0,1)$ at the origin, e.g., $\varphi(s)\equiv[s]_+^p$. This lack of Lipschitz continuity at the origin limits the regularity of the unique solution $\{u,v\}$ and leads to difficulties in the finite element error analysis.
The Differentiability of the Drag with Respect to the Variations of a Lipschitz Domain in a Navier--Stokes Flow
Authors: Juan Antonio Bello, Enrique Fernández-Cara, Jérôme Lemoine, Jacques Simon
Venue: SIAM Journal on Control and Optimization (1997)

This paper is concerned with the computation of the drag $T$ associated with a body traveling at uniform velocity in a fluid governed by the stationary Navier--Stokes equations. It is assumed that the fluid fills a domain of the form $\Omega+u$, where $\Omega\subset\reels^3$ is a reference domain and $u$ is a displacement field. We assume only that $\Omega$ is a Lipschitz domain and that $u$ is Lipschitz-continuous. We prove that, at least when the velocity of the body is sufficiently small, $u\mapsto T(\Omega+u)$ is a $C^{\infty}$ mapping (in a ball centered at $0$). We also compute the derivative at $0$.
Using online seminars to demonstrate the social psychological impacts of computer-mediated communication systems
Authors: Jacqueline Taylor
Venue: ACM SIGCSE Bulletin (1997)

This paper reports an evaluation of students' experiences when seminars were conducted asynchronously using a text-based computer-conferencing system. The primary aim was for students to experience and consider the effects of Computer-Mediated Communication (CMC) on inter-personal interaction. Specifically, students were encouraged to consider how an understanding of these effects could be used to inform the design and implementation of CMC systems. Students were also encouraged to think about the differences between users in communication skills and preferences and to consider how these impact on the use and perception of CMC. The results showed that students experienced some of the effects of CMC (e.g. flaming and more balanced participation) and 79% indicated that participating in the seminars had helped them to understand the potential impact of CMC on interaction. Also, individual communication differences significantly correlated with perceptions of the seminars. For example, extrovert students perceived the seminar discussions as less satisfying and less enjoyable than traditional seminars, while self-conscious students perceived the seminars as more involving. Some recommendations are suggested for conducting future computer-mediated seminars and for further research.
A prototype implementation of the Ada binding to POSIX
Authors: David Emery
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

The IEEE P1003.5 Working Group is developing a standard Ada Binding to POSIX Operating System services. This paper describes the basic approach and some of the techniques used in developing a prototype implementation of this POSIX Ada Binding. The primary goal of the prototype is to provide a &ldquo;proof of concept&rdquo; implementation of the Ada binding on top of an existing C binding to POSIX, and to provide a basis for trial use of the Ada binding. In particular, the paper demonstrates a set of techniques for interfacing to existing C software, and discusses issues in building an Ada binding on top of an existing C binding.
A portable communication facility for distributed client/server architectures
Authors: T. James Cannaliato, F. Michael Thomas
Venue: Proceedings of the conference on TRI-ADA '90 (1990)

This paper describes the Delivery Processing Undercarriage (DPU) which is a communication facility to support systems with distributed computer architectures. Communication and synchronization are supported via the client/server model, and the issues of implementation portability, communication portability, and data portability are addressed. The portability advantages of the DPU allow Ada programs running on multiple heterogeneous computer systems to communicate in a standard and straightforward manner.
The JUDY theater surveillance and strike simulation model
Authors: Douglas R. Brouse, William A. Cann
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This paper describes an architecture for an intelligent interactive instructional simulation modelling environment. It revolves around the production of tutorial and courseware authoring for different simulation software packages with a generic user interface shell. The generic shell is a 'front end' which provides a uniform graphical user interface to diverse simulation modelling software tutorials. An object oriented perspective is combined with tutorial activities based on the task classification structure to form the interactions between objects. The development environment brings together objects that are functionally coherent and allows them to share common resources within the shell.