ppxscal/embedding_network huggingface dataset:
Making better manufacturing decisions with AIM
Authors: Julie N. Ehrlich, William R. Lilegdon
Venue: Proceedings of the 28th conference on Winter simulation (1996)

FACTOR/AIM (AIM) is a simulation system designed specifically for use in manufacturing decision support. AIM has been successfully applied to engineering design, scheduling, and planning problems within numerous manufacturing organizations. Unlike language-based simulation products which require you to learn specific syntax and then abstract your system to fit this syntax, AIM uses the language of manufacturing. Example AIM components include machines, operators, materials, parts, jobsteps, process plans (routings), and conveyors. In addition, a comprehensive set of pre-defined manufacturing rules is available to you. Using AIM you can quickly and accurately build a model of any manufacturing process on your PC. Spending less time on modeling means more time to use the model to help you make decisions to improve your manufacturing operations. This paper provides an introduction to AIM including AIM modeling constructs, the use of AIM for capacity engineering, planning and scheduling, and costing with AIM.
Micro-preemption synthesis: an enabling mechanism for multi-task VLSI systems
Authors: Kyosun Kim, Ramesh Karri, Miodrag Potkonjak
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

Task preemption is a critical enabling mechanism in multi-task VLSI systems. On preemption, data in the register files must be preserved in order for the task to be resumed. This entails extra memory to preserve the context and additional clock cycles to save and restore the context. In this paper, we present techniques and algorithms to incorporate micro-preemption constraints during multi-task VLSI system synthesis. Specifically, we have developed: (i) Algorithms to insert and refine preemption points in scheduled task graphs subject to preemption latency constraints. (ii) Techniques to minimize the context switch overhead by considering the dedicated registers required to save the state of a task on preemption and the shared registers required to save the remaining values in the tasks. (iii) A controller based scheme to preclude preemption related performance degradation. The effectiveness of all approaches, algorithms, and software implementations is demonstrated on real examples.
Statistical estimation of average power dissipation in sequential circuits
Authors: Li-Pen Yuan, Chin-Chi Teng, Sung-Mo Kang
Venue: Proceedings of the 34th annual Design Automation Conference (1997)

In this paper, we present a new statistical techniquefor estimating average power dissipation in sequential circuits.Due to the feedback mechanism, in sequential circuitspower dissipation in consecutive clock cycles are temporallycorrelated, which violates the basic requirement ofstatistical mean inference procedures. We overcome thisproblem by using a randomness test and a sequential procedureto select a proper independence interval, which in turnis used to generate random power samples. A distribution-independentstopping criterion is applied to analyze thesample data and terminate the simulation upon achievementof the accuracy specification. The technique is successfullyapplied to a set of benchmark circuits.
Towards a knowledge-based network simulation environment
Authors: Sergio Ruiz-Mier, Joseph Talavage, David Ben-Arieh
Venue: Proceedings of the 17th conference on Winter simulation (1985)

Since their introduction, network simulation languages have provided modelling concepts which are both powerful and easy to use. Yet current implementations of these languages are limited in that they do not provide explicit concepts for representing complex behavior such as decision-making encountered in many real-world systems. This lack of flexibility comes from the poor programming environments into which network simulation languages are embedded rather than being a limitation of the network approach. This paper describes an experimental simulation system which lets network simulation concepts flourish in a rich, AI-based programming environment.
Bounded Inconsistency for Type-Specific Concurrency Control
Authors: Man Hon Wong, Divyakant Agrawal, Hang Kwong Mak
Venue: Distributed and Parallel Databases (1997)

The traditional correctness criterion of serializability in databases is considered too restrictive especially when databases are used to model advanced applications. In general, two approaches are adopted to address this problem. The first approach considers placing more structure on data objects to exploit type specific properties while keeping serializability as the correctness criterion. The other approach uses explicit semantics of transactions and databases to permit interleaved executions of transactions that are non-serializable. In this paper, we attempt to bridge the gap between the two approaches by using the notion of serializability with bounded inconsistency. Users are free to specify the maximum level of inconsistency that can be allowed in the executions of operations dynamically. In particular, if no inconsistency is allowed in the execution of any operation, the protocol will be reduced to a standard strict two phase locking protocol based on type-specific semantics of data objects. On the other hand, if inconsistency is not bounded, the execution of transactions is unrestricted in the proposed model. The proposed protocols have been implemented and the paper includes a performance comparison with the two-phase locking protocol. The results demonstrate that the associated overhead in the proposed protocol is not overwhelming and the gains in transition throughput can be significant for object based systems. Bounded inconsistency can be applied to many areas which do not require exact values of the data such as for gathering information for statistical purpose, for decision support systems, and for reasoning in expert systems which can tolerate uncertainty in input data.
Advances in functional abstraction from structure
Authors: Richard H. Lathrop, Robert J. Hall, Gavan Duffy, K. Mark Alexander, Robert S. Kirk
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

FUNSTRUX has been extended to extract behavioral level models for a commercial simulator directly from a circuit netlist. Recent advances include: a retargetable code generation mechanism; an object-oriented control structure; handling of initialization values; and improved run-time and space requirements of the abstraction process. We discuss some of the issues that arise in translating from LISP to 'C' and from one functional paradigm to another.
Effects of delay models on peak power estimation of VLSI sequential circuits
Authors: Michael S. Hsiao, Elizabeth M. Rudnick, Janak H. Patel
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

Previous work has shown that maximum switching density at a given node is extremely sensitive to a slight change in the delay at that node. However, when estimating the peak power for the entire circuit, the powers estimated must not be as sensitive to a slight variation or inaccuracy in the assumed gate delays because computing the exact gate delays for every gate in the circuit during simulation is expensive. Thus, we would like to use the simplest delay model possible to reduce the execution time for estimating power, while making sure that it provides an accurate estimate, i.e., that the peak powers estimated will not vary due to a variation in the gate delays. Results for four delay models are reported for the ISCAS85 combinational benchmark circuits, ISCAS89 sequential benchmark circuits, and several synthesized circuits.
A Model for Adaptive Information Retrieval
Authors: Fabio Crestani, Cornelis J. Van Rijsbergen
Venue: Journal of Intelligent Information Systems (1997)

The paper presents a network model that can be used to produce conceptual and logical schemas for Information Retrieval applications. The model has interesting adaptability characteristics and can be instantiated in various effective ways. The paper also reports the results of an experimental investigation into the effectiveness of implementing associative and adaptive retrieval on the proposed model by means of Neural Networks. The implementation makes use of the learning and generalisation capabilities of the Backpropagation learning algorithm to build up and use application domain knowledge in a sub-symbolic form. The knowledge is acquired from examples of queries and relevant documents. Three different learning strategies are introduced, their performance is analysed and compared with the performance of a traditional Information Retrieval system.
PP-MESS-SIM: A Flexible and Extensible Simulator for Evaluating Multicomputer Networks
Authors: Jennifer Rexford, Wu-chang Feng, James Dolter, Kang G. Shin
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

This paper presents pp-mess-sim, an object-oriented discrete-event simulation environment for evaluating interconnection networks in message-passing systems. The simulator provides a toolbox of various network topologies, communication workloads, routing-switching algorithms, and router models. By carefully defining the boundaries between these modules, pp-mess-sim creates a flexible and extensible environment for evaluating different aspects of network design. The simulator models emerging multicomputer networks that can support multiple routing and switching schemes simultaneously; pp-mess-sim achieves this flexibility by associating routing-switching policies, traffic patterns, and performance metrics with collections of packets, instead of the underlying router model. Besides providing a general framework for evaluating router architectures, pp-mess-sim includes a cycle-level model of the PRC, a programmable router for point-to-point distributed systems. The PRC model captures low-level implementation details, while another high-level model facilitates experimentation with general router design issues. Sample simulation experiments capitalize on this flexibility to compare network architectures under various application workloads.
Using J as expository language in the teaching of computer science to liberal arts students
Authors: John E. Howland
Venue: Proceedings of the conference on Designing the future (1996)

APL and J are seldom, if ever, used in the teaching of college or university courses. Recently, the author has developed a new laboratory based computer science course for liberal arts students in which students are introduced to 13 core computer science topics. Programming language is used in an expository fashion to describe each topic by building simple working models of each topic. These models are then used as the basis of laboratory experiments in a co-requisite laboratory course. Students are not taught programming in this course, but rather, are taught just enough of the syntax and semantics of the language to be able to read and understand the exposition and models. Initially, Scheme was used in the lecture notes and laboratory materials developed for this course. Recently, however, an experiment is under way to replace the use of Scheme in this course by J. The development of this course and laboratory was funded by the Meadows Foundation and NSF grant DUE 9452050.
Computer simulation of bacterial survival data from a complex dilution experiment
Authors: Jack Hachigian
Venue: Proceedings of the 17th conference on Winter simulation (1985)

A computer simulation is provided to generate bacterial survival data using the Weibull model (the exponential being an option). The simulation provides data when serial dilution is used before or after exposure to a bactericide allows for incubation as well. The simulation should be useful in all sterilization studies - whether of medical services, food, pharmaceuticals, or space vehicles. The algorithm, upon which the simulation is based, adheres faithfully to the probabilistic description of the experiment. The simulation should also be useful to both statisticians and microbiologists.
A denotational semantics for a process-based simulation language
Authors: Chris Tofts, Graham Birtwistle
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (1998)

In this article, we present semantic translations for the actions of &mgr;Demos, a proocess-based, discrete event simulation language. Our formal translation schema permits the automatic construction of a process algebraic representatioon of the underlying simulation model which can then be checked for freedom from deadlock and livelock, as well as system-specific safety and liveness properties. As simulation methodologies are increasingly being used to design and implement complex systems of interaction objects, the ability to perform such verifications in of increasing methodological importance. We also present a normal form for the syntactic construction of &mgr;Demos programs that allows for the direct comparison of such programs (two programs with the same normal form must execute in identical fashion), reduces model proof obligations by minimizing the number of language constructs, and permits an implementer to concentrate on the basic features of the language (since any program implementation that efficiently evaluates normal forms will be an efficient evaluator for the complete language).
Multilevel Solution of Cell Vertex Cauchy--Riemann Equations
Authors: A. Borzì, K. W. Morton, E. Süli, M. Vanmaele
Venue: SIAM Journal on Scientific Computing (1997)

In this paper a multilevel algorithm for the solution of the cell vertex finite volume Cauchy--Riemann equations is developed. These equations provide a linear algebraic system obtained by the finite volume cell vertex discretization of the inhomogeneous Cauchy--Riemann equations. Both square and triangular cells are employed. The system of linear equations resulting from the cell vertex discretization is overdetermined and its solution is considered in the least squares sense. By this approach a consistent algebraic problem is obtained which differs from the original one by O(h2) perturbation of the right-hand side. A suitable cell-based convergent smoothing iteration is presented which is naturally linked to the least squares formulation. Hence a standard multilevel scheme is presented and discussed which combines the given smoother and a cell-based transfer operator of the residuals and a node-based prolongation operator of the unknown variables. Some remarkable reduction properties of these operators are shown. A full multilevel algorithm is constructed which solves the discrete problem to the level of truncation error by employing one multilevel cycle at each current level of discretization.
On the Glivenko-Cantelli Problem in Stochastic Programming: Linear Recourse and Extensions
Authors: Georg Ch. Pflug, Andrzej Ruszczynski, Rudiger Schultz
Venue: Mathematics of Operations Research (1998)

Integrals of optimal values of random optimization problems depending on a finite dimensional parameter are approximated by using empirical distributions instead of the original measure. Under fairly broad conditions, it is proved that uniform convergence of empirical approximations of the right hand sides of the constraints implies uniform convergence of the optimal values in the linear and convex case.
Comparisons in Evolution and Engineering: The Collective Intelligence of Sorting
Authors: Sam Scholes, Matt Wilson, Ana B. Sendova-Franks, Chris Melhuish
Venue: Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems (2004)

Collaboration between biologists and roboticists can facilitate the creation of new behavioral algorithms by roboticists and help biologists by exposing the underlying mechanisms that allow the algorithms to function (for a review see Webb, 2000). This paper makes a direct comparison between robot annular puck sorting using real robots (Wilson, Melhuish, Sendova-Franks & Scholes, 2004) and brood sorting in the ant Leptothorax albipennis (Franks & Sendova-Franks, 1992). We compared the ants' and robots' structures in terms of radial displacement, shape, compactness, completeness and separation. This showed the effectiveness and limitations of using metrics developed for robots to quantify structures built by ants and helped relate common aspects of the structures to possible common aspects of the underlying algorithms. The ant behavioral rule set is still under investigation and a better understanding of the structure it creates has proved a very useful tool to examine aspects of the algorithm. We draw the conclusions that firstly, the size of the area available for sorting affects the robot algorithm and ant algorithm in opposite ways, secondly, the metrics have proved very useful in aiding discrimination between the robot and ant structures and thirdly, application of the metrics to the ant structure has offered biologists new ideas and a better understanding of the structure and how it is built.
Flexible time management in data stream systems
Authors: Utkarsh Srivastava, Jennifer Widom
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

Continuous queries in a Data Stream Management System (DSMS) rely on time as a basis for windows on streams and for defining a consistent semantics for multiple streams and updatable relations. The system clock in a centralized DSMS provides a convenient and well-behaved notion of time, but often it is more appropriate for a DSMS application to define its own notion of time---its own clock(s), sequence numbers, or other forms of ordering and times-tamping. Flexible application-defined time poses challenges to the DSMS, since streams may be out of order and uncoordinated with each other, they may incur latency reaching the DSMS, and they may pause or stop. We formalize these challenges and specify how to generate heartbeats so that queries can be evaluated correctly and continuously in an application-defined time domain. Our heartbeat generation algorithm is based on parameters capturing skew between streams, unordering within streams, and latency in streams reaching the DSMS. We also describe how to estimate these parameters at run-time, and we discuss how heartbeats can be used for processing continuous queries.
Real-time cooperative multi-target tracking by communicating active vision agents
Authors: Norimichi Ukita, Takashi Matsuyama
Venue: Computer Vision and Image Understanding (2005)

This paper presents a real-time cooperative multi-target tracking system. The system consists of a group of Active Vision Agents (AVAs, in short) representing a logical model of a network-connected computer with an active camera. All AVAs track their target objects cooperatively by interacting dynamically with each other. As a result, the system as a whole can track multiple moving objects simultaneously under complicated dynamic situations in the real world. To implement real-time cooperation among AVAs, we designed a three-layered interaction architecture. In each layer, parallel processes mutually exchange a variety of information for effective cooperation. We employed the dynamic memory architecture to achieve real-time information exchange. Experimental results demonstrated that AVAs track their target objects cooperatively in real-time while adaptively changing their roles.
Art, digitality and consciousness
Authors: Guy Birkin
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

This paper is intended as an accompaniment to digital artworks, and forms a concise outline of the practical and theoretical elements of my research into digital processes.It begins by describing the processes used to create the artworks, then the scientific paradigm shift from which these processes are derived. This new kind of science begins with or leads to the question, 'What if space and time are digital?' My research prompted a reassessment of the meaning of 'digital', which in turn re-defined the potential 'digital media' and, therefore, what may be called 'digital art'.Lastly, it is shown that this new science relates to the older field of Process Philosophy. That these fields share an emphasis on the importance of the concepts of time, change and process can be seen as supporting evidence for Jean Gebser's model of evolutionary consciousness. This model enables cohesion of the scientific ideas and is the context in which the artworks were conceived.
PROC: Process ReOrdering-Based Coscheduling on Workstation Clusters
Authors: Jung-Lok Yu, Driss Azougagh, Jin-Soo Kim, Seung-Ryoul Maeng
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Workstation clusters are emerging as a platform for the execution of general-purpose workloads. To use clusters as shared computing servers, scheduling techniques able to effectively handle workloads with diverse characteristics on demands, are required. Implicit coscheduling is known to be an effective technique to improve the performance of parallel workloads in time-sharing clusters. However, implicit coscheduling still does not take into consideration the system behavior like load imbalance that affects cluster utilization. In this paper, we propose the use of global information to enhance the existing implicit coscheduling schemes. We also introduce a novel coscheduling approach based on process reordering exploiting global load imbalance information to coordinate communicating processes. The results obtained from a detailed simulation study show that our approach significantly decreases the average job response time (by up to 21.4%) by reducing the idle time (by up to 55.6%) and spin time (by up to 31.8%) caused by the load imbalance.
A Cellular Automata System with FPGA
Authors: Tomoyoshi Kobori, Tsutomu Maruyama, Tsutomu Hoshino
Venue: Proceedings of the the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2001)

In cellular automata, a single update rule is applied simultaneously to each cell on the lattice. Therefore, many approaches with parallel and distributed systems have been researched. In this paper, we propose a cellular automata system which consists of only one desktop computer and one PCI board with one FPGA. In the system, users need to write only the update rule using a dedicated language (a simple extension of C), and then, the rule is compiled and linked with the hardware libraries based on a new computation method for the systems with limited memory bandwidth. In the computation method, cells on large size lattice can be efficiently processed in parallel and in pipeline. Experiments on lattice-gas model (2048 × 1024 cells) and Life Game (2048 × 1024) showed good results. The speedup by the system is 155 times and 250 times compared with Pentium-III 700MHz respectively.
On Concurrence and Entanglement of Rank Two Channels
Authors: Armin Uhlmann
Venue: Open Systems Information Dynamics (2005)

Concurrence and further entanglement quanti.ers can be computed explicitly for channels of rank two if representable by just two Kraus operators. Almost all details are available for the subclass of rank two 1-qubit channels. There is a simple geometric picture beyond, explaining nicely the role of anti-linearity.
Knowledge transformation and fusion in diagnostic systems
Authors: Mingsheng Ying
Venue: Artificial Intelligence (2005)

Diagnostic systems depend on knowledge bases specifying the causal, structural or functional interactions among components of the diagnosed objects. A diagnostic specification in a diagnostic system is a semantic interpretation of a knowledge base. We introduce the notion of diagnostic specification morphism and some operations of diagnostic specifications that can be used to model knowledge transformation and fusion, respectively. The relation between diagnostic methods in the source system and the target system of a specification morphism is examined. Also, representations of diagnostic methods in a composed system modelled by operations of specifications are given in terms of the corresponding diagnostic methods in its component systems.