ppxscal/embedding_network huggingface dataset:
On the use of MANOVA in the analysis of multiple-response simulation experiments
Authors: Linda Weiser Friedman
Venue: Proceedings of the 17th conference on Winter simulation (1985)

The purpose of this paper is to demonstrate the applicability of multivariate analysis of variance (MANOVA) to simulation analysis. The paper discusses an illustrative simulation experiment of an M/M/s queueing system, in which three system configurations are crossed with two queue disciplines to produce a 3 x 2 factorial design. Since there are several output variables of interest, namely average number of waiting demands, average time in system, and the proportion of demands forced to wait more than a specified amount of time, a multivariate statistical technique must be used. The necessity and advantage of using this multivariate tool, rather than treating the simulation experiment as several univariate-response experiments, is discussed.
Computing Maximum Task Execution Times &mdash; A Graph-BasedApproach
Authors: Peter P. Puschner, Anton V. Schedl
Venue: Real-Time Systems (1997)

The knowledge of program execution times is crucial for the development and the verification of real-time software. Therefore, there is a need for methods and tools to predict the timing behavior of pieces of program code and entire programs. This paper presents a novel method for the analysis of program execution times. The computation of MAximum eXecution Times (MAXTs) is mapped onto a graph-theoretical problem that is a generalization of the computation of a maximum cost circulation in a directed graph. Programs are represented by T-graphs, timing graphs, which are similar to flow graphs. These graphs reflect the structure and the timing behavior of the code. Relative capacity constraints, a generalization of capacity constraints that bound the flow in the edges, express user-supplied information about infeasible paths. To compute MAXTs, T-graphs are searched for those execution paths which correspond to a maximum cost circulation. The search problem is transformed into an integer linear programming problem. The solution of the linear programming problem yields the MAXT. The special merits of the presented method are threefold: It uses a concise notation to characterize the static structure of a program and its possible execution paths. Furthermore, the notation allows for a description of the feasible paths through the program code that characterizes the behavior of the code sufficiently to compute the exact maximum execution time of the program &ndash; not just a bound thereof. Finally, linear program solving does not only yield maximum execution times, but also produces detailed information about the execution time and the number of executions of every single program construct in the worst case. This knowledge is valuable for a more comprehensive analysis of the timing of a program.
Distribution logistics in the process industries: establishing railcar requirements
Authors: Charles H. White
Venue: Proceedings of the 28th conference on Winter simulation (1996)

The Manufacturing World is often classified into Discrete Manufacturing and Process Operations.Process Industry Operations generally are classified as 'Batch' or 'Continuous'; we can think of these as producing 'stuff' as opposed to the discrete individual 'things' produced in Discrete Manufacturing Operations. These Manufacturing World's clearly have much in common, but there are areas in which they can be quite different. They certainly have overlap, but at the extremes they can be fundamentally different and present unique challenges. Continuity of Operations is one of these areas; some Continuous Chemical plants may operate 'around-the-clock' for several years between 'shutdowns'. This means that they literally continue to operate even when there are maintenance difficulties. They may slow down for grade changes or unusual operating conditions, but they do not stop altogether as this could force the entire production train down for a major overhaul/restart which can be very expensive and/or time consuming. For some chemical plants a total shutdown can poison the reaction catalyst. For some polymer plants a total shutdown can mean the molten polymer 'freezes' in the lines. Each of these will result in a long period of total outage while the plant is refurbished and restarted. When a Process is 'Continuous' in this sense, it certainly can create some unusual challenges from a "Logistics Viewpoint". Aspects of these challenges are JIT/WIP Inventory, Material Handling, and Product Distribution. This paper will (1) discuss these challenges with emphasis on Final Product Distribution and Railcar Requirements, and (2) briefly describe two cases where careful Analysis and Modeling helped lead to substantial improvements in Operations Understanding and to significant Financial Savings (both Investment and Cost).
Cell Migration Analysis After In Vitro WoundingInjury with a Multi-Agent Approach
Authors: Alain Boucher, Anne Doisy, Xavier Ronot, Catherine Garbay
Venue: Artificial Intelligence Review (1998)

This paper presents a multiagent system for studying in vitro cell motion. A typical application on the wound closure process is presented to illustrate the possibilities of the system, where different image sequences will be treated. The motion issue involves three aspects: image segmentation, object tracking and motion analysis. The current system version focuses mainly on the image segmentation aspect. A general agent model has been designed, which will be further expanded to include tracking and motion analysis behaviors as well. The agents integrate three basic behaviors: perception, interaction and reproduction. The perception evaluates pixels upon static and motion-based criteria. The interaction behavior allows two agents to merge or to negotiate parts of regions. The negotiation can be seen as a segmentation refinement process done by the agents. Finally, the reproduction behavior defines an exploration strategy of the images. Agents can start other agents around them, or they can duplicate themselves in the next frame. The frames are processed in pipeline, where previous information is used to treat the current frame. One unique agent model exist. Agents are specialized on execution time according to their goals. The results, coming from an existing prototype, show different types of cell behavior during cell migration, based on cell nuclei analysis.
Recognising Simple Behaviours Using Time-Delay RBF Networks
Authors: A. Jonathan Howell, Hilary Buxton
Venue: Neural Processing Letters (1997)

This paper presents experiments using a radial basis function variant of the time-delay neural network with image sequences of human faces. The network is shown to be able to learn simple behaviours based on y-axis head rotation and generalise on different data. The network model&lsquo;s suitability for future dynamic vision applications is discussed.
Convergence Past Singularities for a Fully Discrete Approximation of Curvature-Drive Interfaces
Authors: Ricardo H. Nochetto, Claudio Verdi
Venue: SIAM Journal on Numerical Analysis (1997)

Consider a closed surface in $\Rn$ of codimension 1 which propagates in the normal direction with velocity proportional to its mean curvature plus a forcing term. This geometric problem is first approximated by a singularly perturbed parabolic double obstacle problem with small parameter $\eps>0$. Conforming piecewise linear finite elements over a quasi-uniform and strongly acute mesh of size $h$ are further used for space discretization and combined with backward differences for time discretization with uniform time-step $\tau$. It is shown that the zero level set of the fully discrete solution converges past singularities to the true interface, provided $\tau,h^2\approx o(\eps^3)$ and no fattening occurs. If the more stringent relations $\tau,h^2\approx\O(\eps^4)$ are enforced, then a linear rate of convergence $\O(\eps)$ for interfaces is derived in the vicinity of regular points, namely those for which the underlying viscosity solution is nondegenerate. Singularities and their smearing effect are also studied. The analysis is based on constructing discrete barriers via a parabolic projection, Lipschitz dependence of viscosity solutions with respect to perturbations of data, and discrete nondegeneracy. These issues are proven, along with quasi optimality in two dimensions of the parabolic projection in $L^\infty$ with respect to both order and regularity requirements for functions in $W^{2,1}_p$.
AutoMod tutorial
Authors: Matthew W. Rohrer
Venue: Proceedings of the 28th conference on Winter simulation (1996)

The AutoMod/sup TM/ simulation system differs significantly from other systems because of its ability to deal with the physical elements of a system in physical (graphical) terms and the logical elements of a system in logical terms. AutoMod also offers advanced features to allow users to simulate complex movement (kinematics and velocity) of equipment such as robots, machine tools, transfer lines, and special machinery. All graphics are represented in 3-D space with unlimited viewing control including: translation, rotation, scale, light-sourced solids, perspective, and continuous motion viewing. The AutoMod CAD features are used to define the physical layout of manufacturing, material handling, and distribution systems. Unlike most other simulation software, the powerful AutoMod graphical interface accurately captures the physical constraints of distance, size, and space in 3-b. AutoMod is really two programs. The build portion is for the physical and logical model definition. After the user has defined the physical and logical components of the model, it is then compiled into an executable model, where the simulation and animation run concurrently. The executable model is fully interactive, it can be stopped at any instant in simulated time to view statistics and model status.
The memory fragmentation problem: solved?
Authors: Mark S. Johnstone, Paul R. Wilson
Venue: Proceedings of the 1st international symposium on Memory management (1998)

We show that for 8 real and varied C and C++ programs, several conventional dynamic storage allocators provide near-zero fragmentation, once we account for overheads due to implementation details such as headers, alignment, etc. This substantially strengthens our previous results showing that the memory fragmentation problem has generally been misunderstood, and that good allocator policies can provide good memory usage for most programs. The new results indicate that for most programs, excellent allocator policies are readily available, and efficiency of implementation is the major challenge. While we believe that our experimental results are state-of-the-art and our methodology is superior to most previous work, more work should be done to identify and study unusual problematic program behaviors not represented in our sample.
Presenting simulation results with TESS graphics
Authors: Charles R. Standridge, John R. Hoffman, David K. LaVal
Venue: Proceedings of the 17th conference on Winter simulation (1985)

Graphics provide an appropriate and effective mechanism for displaying the results of simulation runs. These results include individual observations of data values and statistical summaries of these values, as well as the structure and dynamics of models. Standard business graphics and animation techniques can be used to display these simulation results. TESS provides a framework for a collection of data during simulation runs, the selection of data to appear on graphs, and the generation of presentation graphs and animations.
A visual microprogramming system
Authors: Takanobu Baba, Hiroshi Minakawa, Kenzo Okuda
Venue: Proceedings of the 20th annual workshop on Microprogramming (1987)

A visual microprogramming system has been developed to support all aspects of the microprogramming process for a microprogrammed computer. The user can specify microoperations on a displayed hardware configuration. A graphical microprogram list has also been designed to display several microinstructions on the screen. Optimization may also be done on the screen. A visual simulator graphically illustrates the execution of microoperations on the screen, while allowing the user to control the simulator by using several commands. Preliminary evaluation results are also presented.
Co-array Fortran for parallel programming
Authors: Robert W. Numrich, John Reid
Venue: ACM SIGPLAN Fortran Forum (1998)

Co-Array Fortran, formerly known as F--, is a small extension of Fortran 95 for parallel processing. A Co-Array Fortran program is interpreted as if it were replicated a number of times and all copies were executed asynchronously. Each copy has its own set of data objects and is termed an image. The array syntax of Fortran 95 is extended with additional trailing subscripts in square brackets to give a clear and straightforward representation of any access to data that is spread across images.References without square brackets are to local data, so code that can run independently is uncluttered. Only where there are square brackets, or where there is a procedure call and the procedure contains square brackets, is communication between images involved.There are intrinsic procedures to synchronize images, return the number of images, and return the index of the current image.We introduce the extension; give examples to illustrate how clear, powerful, and flexible it can be; and provide a technical definition.
Incremental dependence analysis for interactive parallelization
Authors: Kevin Smith, Bill Appelbe, Kurt Stirewalt
Venue: ACM SIGARCH Computer Architecture News (1990)

Incrementally updating dependence information during interactive parallelization is a difficult proposition. We have developed a tool (PAT) that maintains dependence information during incremental transformations to a Fortran program, including loop parallelization, code replication, alignment and shifting, as well as insertion and deletion of code including parallel primitives. Our analysis is based on a variation on the standard approach to dependence graph generation, with program wide and local information separated in a sequential and a parallel dependence graph.
A Comparison of Large Scale Mixed Complementarity Problem Solvers
Authors: Stephen C. Billups, Steven P. Dirkse, Michael C. Ferris
Venue: Computational Optimization and Applications (1997)

This paper provides a means for comparing various computer codes for solving large scale mixed complementarity problems. We discuss inadequacies in how solvers are currently compared, and present a testing environment that addresses these inadequacies. This testing environment consists of a library of test problems, along with GAMS and MATLAB interfaces that allow these problems to be easily accessed. The environment is intended for use as a tool by other researchers to better understand both their algorithms and their implementations, and to direct research toward problem classes that are currently the most challenging. As an initial benchmark, eight different algorithm implementations for large scale mixed complementarity problems are briefly described and tested with default parameter settings using the new testing environment.
An experimental study of the basis for graph drawing algorithms
Authors: H. C. Purchase, R. F. Cohen, M. I. James
Venue: Journal of Experimental Algorithmics (JEA) (1997)

Designers of graph drawing algorithms and systems claim to illuminate application data by producing layouts that optimise measurable aesthetic qualities. Examples of these aesthetics include symmetry (where possible, a symmetrical view of the graph should be displayed), minimise arc crossing(the number of arc crossings in the display should be minimised), and minimise bends (the total number of bends in polyline arcs should be minimised).The aim of this paper is to describe our work to validate these claims by performing empirical studies of human understanding of graphs drawn using various layout aesthetics. This work is important since it helps indicate to algorithm and system designers what are the aesthetic qualities most important to aid understanding, and consequently to build more effective systems.
Logical observable entities
Authors: Jonathan G. Rossie,  Jr.
Venue: ACM SIGPLAN Notices (1998)

We show how finite-state machines can standardize the protocol used by a component object to notify other interested objects of its state changes, resulting in a more effective use of static types to constrain both parties, and a more efficient dissemination of information. The enhanced component specification is called a logical observable entity, or LOE. We address two key issues in effectively applying such a strategy: how to extend subtyping to consider the state machines, and how to ensure some kind of compliance between the state-machine specification and its implementation. This leads to an unusual subtyping predicate for LOEs on the one hand, and a prototype code generation strategy on the other.
A Pumping Condition for Regular Sets
Authors: Stefano Varricchio
Venue: SIAM Journal on Computing (1997)

We prove that a language of a finitely generated free monoid is regular if and only if it satisfies the positive block pumping property. This gives a positive answer to a problem posed by Ehrenfeucht, Parikh, and Rozenberg [SIAM J. Comput., 10 (1981), pp. 536--541].
Synthesising controllers from real-time specifications
Authors: Henning Dierks
Venue: Proceedings of the 10th international symposium on System synthesis (1997)

This paper presents a novel source-level dynamic analysis methodology and tool for High-Level Synthesis (HLS). It not only for the first time enables HLS to offer source-level design debugging on the `synthesized' RTL designs, but also allows the designer to analyze their dynamic characteristics, such as resource utilization, power consumption, etc., at the algorithmic (source) level. This technology has been proven in the industry as the critical element for successfully designing a microcontroller with 300+ instructions with Matisse, an interactive HLS system. Additionally, we demonstrate the use of this technology for architectural power optimization.
Rankings of Graphs
Authors: Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
Venue: SIAM Journal on Discrete Mathematics (1998)

A vertex (edge) coloring $\phi:V\rightarrow \{1,2,\ldots ,t\}$ ($\phi':E\rightarrow \{1,2,\ldots,$ $t\}$) of a graph G=(V,E) is a vertex (edge) t-ranking if, for any two vertices (edges) of the same color, every path between them contains a vertex (edge) of larger color. The {\em vertex ranking number} $\chi_{r}(G)$ ({\em edge ranking number} $\chi_{r}'(G)$) is the smallest value of t such that G has a vertex (edge) t-ranking. In this paper we study the algorithmic complexity of the {\sc Vertex Ranking} and {\sc Edge Ranking} problems. It is shown that $\chi_{r}(G)$ can be computed in polynomial time when restricted to graphs with treewidth at most k for any fixed k. We characterize the graphs where the vertex ranking number $\chi_{r}$ and the chromatic number $\chi$ coincide on all induced subgraphs, show that $\chi_{r}(G)=\chi (G)$ implies $\chi (G)=\omega (G)$ (largest clique size), and give a formula for $\chi_{r}'(K_n)$.
Edge and Depth from Focus
Authors: Naoki Asada, Hisanaga Fujiwara, Takashi Matsuyama
Venue: International Journal of Computer Vision (1998)

This paper proposes a novel method to obtain the reliable edge and depth information by integrating a set of multi-focus images, i.e., a sequence of images taken by systematically varying a camera parameter focus. In previous work on depth measurement using focusing or defocusing, the accuracy depends upon the size and location of local windows where the amount of blur is measured. In contrast, no windowing is needed in our method; the blur is evaluated from the intensity change along corresponding pixels in the multi-focus images. Such a blur analysis enables us not only to detect the edge points without using spatial differentiation but also to estimate the depth with high accuracy. In addition, the analysis result is stable because the proposed method involves integral computations such as summation and least-square model fitting. This paper first discusses the fundamental properties of multi-focus images based on a step edge model. Then, two algorithms are presented: edge detection using an accumulated defocus image which represents the spatial distribution of blur, and depth estimation using a spatio-focal image which represents the intensity distribution along focus axis. The experimental results demonstrate that the highly precise measurement has been achieved: 0.5 pixel position fluctuation in edge detection and 0.2% error at 2.4 m in depth estimation.
Analyzing Asynchronous Pipeline Schedules
Authors: Val Donaldson, Jeanne Ferrante
Venue: International Journal of Parallel Programming (1998)

Asynchronous pipelining is a form of parallelism that is useful in both distributed and shared memory systems. We show that asynchronous pipeline schedules are a generalization of both noniterative DAG (directed acyclic graph) schedules as well as simpler pipeline schedules, unifying these two types of scheduling. We generalize previous work on determining if a pipeline schedule will deadlock, and generalize Reiter's well-known formula for determining the iteration interval of a deadlock-free schedule, which is the primary measure of the execution time of a schedule. Our generalizations account for nonzero communication times (easy) and the assignment of multiple tasks to processors (nontrivial). A key component of our generalized approach to pipeline schedule analysis is the use of pipeline scheduling edges with potentially negative data dependence distances. We also discuss implementation of an asynchronous pipeline schedule at runtime; show how to efficiently simulate pipeline execution on a sequential processor; define and derive bounds on the startup time of a schedule, which is a secondary schedule performance measure; and describe a new algorithm for evaluating the iteration interval formula.
Hybrid diversity combing techniques for DS-CDMA over a multipath fading channel
Authors: M. A. Do, S. Y. Wu
Venue: Wireless Networks (1997)

The combined effect of antenna diversity and spread spectrum (SS) diversity for a direct sequence code division multiple access (DS-CDMA) system using differential binary phase-shift keying (DBPSK) modulation is evaluated. Both maximal ratio combining (MRC) and selection diversity (SD) are considered and the bit error rate (BER) performance for four following diversity schemes are compared: (1) SS diversity with MRC and antenna diversity with SD; (2) SS diversity with SD and antenna diversity with MRC; (3) MRC of both SS diversity and antenna diversity; (4) SD of both SS diversity and antenna diversity. It is shown that antenna diversity with MRC and SS diversity with selection has a performance very close to that of antenna diversity and SS diversity both with MRC.