ppxscal/embedding_network huggingface dataset:
Introduction to work flow modeling with BPSimulator
Authors: Don Lazzari, Robert Crosslin
Venue: Proceedings of the 28th conference on Winter simulation (1996)

This paper highlights the features and functions of BPSimulator, a simulation analysis tool focused on work flow and business processes. Based on Systems Modeling Corporation's general-purpose simulation system, Arena, BPSimulator leverages all of the power and flexibility of Arena while providing the business analyst with an intuitive interface and a short learning curve. Like Arena, it is a comprehensive system that addresses all phases of a simulation project from input data analysis to the analysis of simulation output data.
Approximations in Dynamic Zero-Sum Games II
Authors: Mabel M. Tidball, Odile Pourtallier, Eitan Altman
Venue: SIAM Journal on Control and Optimization (1997)

We pursue in this paper our study of approximations of values and $\epsilon$-saddle-point policies in dynamic zero-sum games. After extending the general theorem for approximation, we study zero-sum stochastic games with countable state space and unbounded immediate reward. We focus on the expected average payoff criterion. We use some tools developed in [M. M. Tidball and E. Altman, SIAM J. Control Optim., 34 (1996), pp. 311--328] to obtain the convergence of the values as well as the convergence of the $\epsilon$ saddle-point policies in various approximation problems. We consider several schemes of truncation of the state space (e.g., finite state approximation) and approximations of games with discount factor close to one for the game with expected average cost. We use the extension of the general theorem for approximation to study approximations in stochastic games with complete information. Finally, we consider the problem of approximating the sets of policies. We obtain some general results that we apply to a pursuit evasion differential game.
Multilevel facility layout
Authors: Keebom Kang, Ramon Rodriguez, Oscar Adaniya
Venue: Proceedings of the 17th conference on Winter simulation (1985)

This paper presents an approach to solve multilevel facility layout problems when the traveling times between departments are nonlinear. The objective is to obtain a solution that minimizes the total expected cost of movement, such that all the space requirements are satisfied. Due to the complexity of the problem a heuristic is developed so that a good solution can be obtained in an acceptable computational time.
The performance of query control schemes for the zone routing protocol
Authors: Zygmunt J. Haas, Marc R. Pearlman
Venue: ACM SIGCOMM Computer Communication Review (1998)

In this paper, we study the performance of route query control mechanisms for the recently proposed Zone Routing Protocol (ZRP) for ad-hoc networks. The ZRP proactively maintains routing information for a local neighborhood (routing zone), while reactively acquiring routes to destinations beyond the routing zone. This hybrid routing approach has the potential to be more efficient in the generation of control traffic than traditional routing schemes. However, without proper query control techniques, the ZRP can actually produce more traffic than standard flooding protocols.Our proposed query control schemes exploit the structure of the routing zone to provide enhanced detection (Query Detection (QD1/QD2)), termination (Loop-back Termination (LT), Early Termination (ET)) and prevention (Selective Bordercasting (SBC)) of overlapping queries. We demonstrate how certain combinations of these techniques can be applied to single channel or multiple channel ad-hoc networks to improve both the delay and control traffic performance of the ZRP. Our query control mechanisms allow the ZRP to provide routes to all accessible network nodes with only a fraction of the control traffic generated by purely proactive distance vector and purely reactive flooding schemes, and with a response time as low as 10% of a flooding route query delay.
Millimetre Wave Signal Generation Using Monolithic HEMTTechnologies
Authors: P. Kangaslahti, P. Alinikula, V. Porra
Venue: Analog Integrated Circuits and Signal Processing (1998)

We have designed, processed and tested monolithic 40GHz frequency doublers and amplifiers using enhancement and depletion HEMT processes. The passive parts included microstrip, coplanar waveguide and lumped component circuits. The on-chip measured output power of frequency doublers at 40GHz was &plus;2 dBm and the conversion loss was 2&ndash;5 dB. The EHEMT doublers operated at low input power level from a single DC supply and the CPW passive parts enabled economical design. The integrated system of depletion PHEMT doubler and amplifier chips enclosed in hermetic packages delivered &plus;10 dBm output power at 38GHz frequency band. This is the first time that the application of enhancement mode HEMTs in frequency doublers is reported and compared to the performance with depletion mode HEMTs. We have proven that EHEMT and DHEMT frequency multiplier circuits are efficient solutions for local oscillator use in modern millimetre wave systems.
A General Theory for Deadlock Avoidance in Wormhole-Routed Networks
Authors: Eric Fleury, Pierre Fraigniaud
Venue: IEEE Transactions on Parallel and Distributed Systems (1998)

Most machines of the last generation of distributed memory parallel computers possess specific routers which are used to exchange messages between nonneighboring nodes in the network. Among the several technologies, wormhole routing is usually preferred because it allows low channel-setup time and reduces the dependency between latency and internode distance. However, wormhole routing is very susceptible to deadlock because messages are allowed to hold many resources while requesting others. Therefore, designing deadlock-free routing algorithms using few hardware facilities is a major problem for wormhole-routed networks. In this paper, we describe a general theoretical framework for the study of deadlock-free routing functions. We give a general definition of what can be a routing function. This definition captures many specific definitions of the literature (e.g., vertex-dependent, input-dependent, source-dependent, path-dependent, etc.). Using our definition, we give a necessary and sufficient condition which characterizes deadlock-free routing functions. Our theory embraces, at a high level, most of the theories related to deadlock avoidance in wormhole-routed networks previously derived in the literature. In particular, it applies not only to one-to-one routing, but also to one-to-many routing. The latter paradigm is used to solve the multicast problem with the path-based or tree-based facility.
Avoiding object misconceptions
Authors: Simon Holland, Robert Griffiths, Mark Woodman
Venue: ACM SIGCSE Bulletin (1997)

This paper identifies and describes a number of misconceptions observed in students learning about object technology. It identifies simple, concrete, measures course designers and teachers can take to avoid these misconceptions arising. The context for this work centres on an introductory undergraduate course and a postgraduate course. Both these courses are taught by distance education. These courses both use Smalltalk as an introduction to object technology. More particularly, the undergraduate course uses Smalltalk as a first programming language.Distance education can limit the amount and speed of individual feedback that can be given in the early stages of learning. For this reason, particular attention has been paid to characterizing measures for avoiding elementary misconceptions seen in beginning learners. At the same time we also address some misconceptions observed in postgraduate students. The pedagogical issues discussed are of particular importance when devising an extended series of examples for teaching or assessment, or when designing a visual microworld to be used for teaching purposes.
A Shortest-Path Routing Algorithm for Incomplete WK-Recursive Networks
Authors: Ming-Yang Su, Gen-Huey Chen, Dyi-Rong Duh
Venue: IEEE Transactions on Parallel and Distributed Systems (1997)

The WK-recursive networks own two structural advantages: expansibility and equal degree. A network is expansible if no changes to node configuration and link connection are necessary when it is expanded, and of equal degree if its nodes have the same degree no matter what the size is. However, the number of nodes contained in a WK-recursive network is restricted to dt, where d > 1 is the size of the basic building block and t¿ 1 is the level of expansion. The incomplete WK-recursive networks, which were proposed to relieve this restriction, are allowed to contain an arbitrary number of basic building blocks, while preserving the advantages of the WK-recursive networks.Designing shortest-path routing algorithms for incomplete networks is in general more difficult than for complete networks. The reason is that most incomplete networks lack a unified representation. One of the contributions of this paper is to demonstrate a useful representation, i.e., the multistage graph representation, for the incomplete WK-recursive networks. On the basis of it, a shortest-path routing algorithm is then proposed. With O(d·t) time preprocessing, this algorithm takes O(t) time for each intermediate node to determine the next node along the shortest path.
Parallel logic simulation on a network of workstations using parallel virtual machine
Authors: Maciek Kormicki, Ausif Mahmood, Bradley S. Carlson
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (1997)

This paper explores parallel logic simulation on a network of workstations using a parallel virtual machine (PVM). A novel parallel implementation of the centralized-time event-driven logic simulation algorithm is carried out such that no global controlling workstation is needed to synchronize the advance of simulation time. Further advantages of our new approach include a random partitioning of the circuit onto available workstations and a pipelined execution of the different phases of the simulation algorithm. To achieve a better load balance, we employ a semioptimistic scheme for gate evaluations (in conjunction with a centralized-time algorithm) such that no rollback is required. The performance of this implementation has been evaluated using the ISCAS benchmark circuits. Speedups improve with the size of the circuit and the activity level in the circuit. Analyses of the communication overhead show that the techniques developed here will yield even higher gains as newer networking technologies like ATM are employed to connect workstations.
The Irreducible Modules of the Terwilliger Algebras ofDoob Schemes
Authors: Kenichiro Tanabe
Venue: Journal of Algebraic Combinatorics: An International Journal (1997)

Let Y be any commutative association scheme and we fix any vertex x of Y. Terwilleger introduced a non-commutative, associative, and semi-simple {\bf C}-algebraT\,{=}\,T(x) for Y and x in [4]. We call T the Terwilliger (or subconstituent) algebra ofY with respect to x. Let W (\subset {\bf C}^{|X|}) be an irreducible T(x)-module. W is said to be thin if W satisfies a certain simple condition.Y is said to be thin with respect to x if each irreducible T(x) -module is thin. Y is said to be thin if Y is thin with respect to each vertex in X.The Doob schemes are direct product of a number of Shrikhande graphs and some complete graphsK_4 . Terwilliger proved in [4] that Doob scheme is not thin if the diameter is greater than two. I give the irreducible T(x)-modules of Doob schemes.
Linearly Derived Steiner Triple Systems
Authors: E. F. Assmus,  Jr.
Venue: Designs, Codes and Cryptography (1998)

We attach a graph to every Steiner triple system. The chromatic number of this graph is related to the possibility of extending the triple system to a quadruple system. For example, the triple systems with chromatic number one are precisely the classical systems of points and lines of a projective geometry over the two-element field, the Hall triple systems have chromatic number three (and, as is well-known, are extendable) and all Steiner triple systems whose graph has chromatic number two are extendable. We also give a configurational characterization of the Hall triple systems in terms of mitres.
OMC: an organisational model for co-operations
Authors: Hans Czap, Joachim Reiter
Venue: ACM SIGGROUP Bulletin (1997)

In this paper, we present a reference-model to support information processing of business-co-operations. The co-operation of autonomous and heterogeneous partners leads to special demands, which mainly result in increased flexibility with respect to the definition and execution of inter-organisational processes. In the following, a general framework will be established in order to account for the superior flexibility-efficiency. Additionally, this framework will allow the consideration of individual user-preferences.
Convergence Properties of Feasible Descent Methods for Solving Variational Inequalities in Banach Spaces
Authors: Dao Li Zhu, Patrice Marcotte
Venue: Computational Optimization and Applications (1998)

This work is concerned with the analysis of convergence properties of feasible descent methods for solving monotone variational inequalities in Banach spaces.
A Filter Model for Concurrent $\lambda$-Calculus
Authors: Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro, Adolfo Piperno
Venue: SIAM Journal on Computing (1998)

Type-free lazy $\lambda$-calculus is enriched with angelic parallelism and demonic nondeterminism. Call-by-name and call-by-value abstractions are considered and the operational semantics is stated in terms of a must convergence predicate. We introduce a type assignment system with intersection and union types, and we prove that the induced logical semantics is fully abstract.
A document-centered approach for an open CASE environment framework connected with the world-wide web
Authors: Frédéric Blanqui
Venue: ACM SIGSOFT Software Engineering Notes (1997)

Software development suffers from a number of well known difficulties, both technical and managerial [2]. A technical approach that could help to reduce them is the use of Computer-Aided Software Engineering (CASE) technologies. However, current Integrate Project Support Environment (IPSE) frameworks impose many constraints on CASE tool vendors, and this has impeded their adoption [10]. A more incremental strategy should be considered for the transfer and the diffusion of those technologies.This paper describes a document-centered approach and a simple but extendable system called Open Software Development System (OSDS) based on this approach. First, we describe difficulties inherent in the management of documents involved in software development. Second, we define some requirements to address those difficulties. Finally, we describe the important features of OSDS; these include an extension of Mosaic [3] that enables anyone with network access to connect to an OSDS, browse through it, and automatically integrate some documents into his/her own system.
Alignment by Maximization of Mutual Information
Authors: Paul Viola, William M. Wells,  III
Venue: International Journal of Computer Vision (1997)

A new information-theoretic approach is presented for finding the pose of an object in an image. The technique does not require information about the surface properties of the object, besides its shape, and is robust with respect to variations of illumination. In our derivation few assumptions are made about the nature of the imaging process. As a result the algorithms are quite general and may foreseeably be used in a wide variety of imaging situations.Experiments are presented that demonstrate the approach registering magnetic resonance (MR) images, aligning a complex 3D object model to real scenes including clutter and occlusion, tracking a human head in a video sequence and aligning a view-based 2D object model to real images.The method is based on a formulation of the mutual information between the model and the image. As applied here the technique is intensity-based, rather than feature-based. It works well in domains where edge or gradient-magnitude based methods have difficulty, yet it is more robust than traditional correlation. Additionally, it has an efficient implementation that is based on stochastic approximation.
Our failing students: a study of a repeat group
Authors: Judy Sheard, Dianne Hagan
Venue: ACM SIGCSE Bulletin (1998)

The high failure and low retention rates of students in introductory programming courses are of growing concern.This study looks at a group of students who are repeating an introductory programing subject, exploring issues which may affect their learning and ultimate success. Comparisons are made with a group of new students undertaking the same subject.The students were surveyed in the middle and at the end of one semester. A profile of the students, focussing on their motivation for their course selection and commitment to this course, was established. Their opinions on the usefulness of their classes, various resources, tutorial work and assignment work were sought. The needs and concerns of these students, highlighted in the surveys, are discussed and suggestions are made for the establishment of a special learning environment for failing students.
Contest: a concurrent test generator for sequential circuits
Authors: Vishwani D. Agrawal
Venue: Proceedings of the 25th ACM/IEEE Design Automation Conference (1988)

This paper describes the application of a concurrent fault simulator to automatic test vector generation. As faults are simulated in the fault simulator a cost function is simultaneously computed. A simple cost function is the distance (in terms of the number of gates and flip-flops) of a fault effect from a primary output. The input vector is then modified to reduce the cost function until a test is found. The paper presents experimental results showing the effectiveness of this method in generating tests for combinational and sequential circuits. By defining suitable cost functions, we have been able to generate: 1) initialization sequences, 2) tests for a group of faults, and 3) a test for a given fault. Even asynchronous sequential circuits can be handled by this approach.
Project EXODUS: experimental mobile multimedia deployment in ATM networks
Authors: J. C. Francis, D. V. Polymeros, G. L. Lyberopoulos, V. Vande Keere, A. Elberse, P. Rogl, L. Vezzoli
Venue: Mobile Networks and Applications (1998)

This paper reports on European Commission sponsored research within the EXODUS project. The project carries out research in the context of the evolution towards UMTS and performs personal and terminal multimedia mobility experiments using fixed and wide-band radio access in an international ATM network. After introducing the EXODUS platform and services, the paper presents an IN-based functional model which is suitable for support of mobile multimedia services in ATM networks. Interworking and mobility management issues are discussed, and information flows for call handling are presented. The paper includes a presentation of the mobility management and enhanced INAP protocols which have been developed by the EXODUS project.
A new cache replacement scheme based on backpropagation neural networks
Authors: Humayun Khalid
Venue: ACM SIGARCH Computer Architecture News (1997)

In this paper, we present a new neural network-based algorithm, KORA (Khalid ShadOw Replacement Algorithm), that uses backpropagation neural network (BPNN) for the purpose of guiding the line/block replacement decisions in cache. This work is a continuation of our previous research presented in [1]-[3]. The KORA algorithm attempts to approximate the replacement decisions made by the optimal scheme (OPT). The key to our algorithm is to identify and subsequently discard the dead lines in cache memories. This allows our algorithm to provide better cache performance as compared to the conventional LRU (Least Recently Used), MRU (Most Recently Used), and FIFO (First In First Out) replacement policies. Extensive trace-driven simulations were performed for 30 different cache configurations using different SPEC (Standard Performance Evaluation Corp.) programs. Simulation results have shown that KORA can provide substantial improvement in the miss ratio over the conventional algorithms. Our work opens new dimensions for research in the development of new and improved page replacement schemes for virtual memory systems and disk caches.
A test package for Sturm-Liouville solvers
Authors: J. D. Pryce
Venue: ACM Transactions on Mathematical Software (TOMS) (1999)

The author and colleagues have produced a collection of 60 test problems which offer a realistic performance test of the currently available automatic codes for eigenvalues of the classical Sturm-Liouville problem. We describe a Fortran implementation and the considerations that went into its design. A novel feature is that (almost) all the code defining one problem is textually contiguous in the Fortran text, unlike for example the DETEST package for ODE initial-value solvers where the definition of a problem is spread over several routines. The described implementation forms the infrastructure of the SLDRVER interactive package which supports exploration of a set of Sturm-Liouville problems with the four SL-solvers SLEIGN, SLEDGE, SL02F, and SLEIGN2. A &ldquo;standard&rdquo; set of 60 problems is provided, but it is simple to replace this by another one.
Scheduling and binding bounds for RT-level symbolic execution
Authors: Chuck Monahan, Forrest Brewer
Venue: Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design (1997)

Generalizes ALAP (as late as possible) bounds for the exact scheduling problem on a pre-defined data path. Conventional bounds are inapplicable because of the possible requirement of re-computing operands for minimal schedule length. Efficient techniques are presented for constructing the new bounds which are sensitive to point-to-point delays via transitive memory units. An efficient operand mapping bound is also described. Based on these two bounds, time improvement factors of 50 have demonstrated in exact scheduling results.
Sequential Regularization Methods for Nonlinear Higher-Index DAEs
Authors: Uri Ascher, Ping Lin
Venue: SIAM Journal on Scientific Computing (1997)

Sequential regularization methods relate to a combination of stabilization methods and the usual penalty method for differential equations with algebraic equality constraints. This paper extends an earlier work [SIAM J. Numer. Anal., 33 (1996), pp. 1921--1940] to nonlinear problems and to differential algebraic equations (DAEs) with an index higher than 2. Rather than having one "winning" method, this is a class of methods from which a number of variants are singled out as being particularly effective methods in certain circumstances. We propose sequential regularization methods for index-2 and index-3 DAEs, both with and without constraint singularities. In the case of no constraint singularity we prove convergence results. Numerical experiments confirm our theoretical predictions and demonstrate the viability of the proposed methods. The examples include constrained multibody systems.