ppxscal/embedding_network huggingface dataset:
The Moments of the M/M/s Queue Length Process
Authors: F. Marcellán, G. Pérez
Venue: Queueing Systems: Theory and Applications (2003)

A representation for the moments of the number of customers in a M/M/s queueing system is deduced from the Karlin and McGregor representation for the transition probabilities. This representation allows us to study the limit behavior of the moments as time tends to infinity. We study some consequences of the representation for the mean.
A routing underlay for overlay networks
Authors: Akihiro Nakao, Larry Peterson, Andy Bavier
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

We argue that designing overlay services to independently probe the Internet--with the goal of making informed application-specific routing decisions--is an untenable strategy. Instead, we propose a shared routing underlay that overlay services query. We posit that this underlay must adhere to two high-level principles. First, it must take cost (in terms of network probes) into account. Second, it must be layered so that specialized routing services can be built from a set of basic primitives. These principles lead to an underlay design where lower layers expose large-scale, coarse-grained static information already collected by the network, and upper layers perform more frequent probes over a narrow set of nodes. This paper proposes a set of primitive operations and three library routing services that can be built on top of them, and describes how such libraries could be useful to overlay services.
Software Testing for Mobile and Ubiquitous Computing
Authors: Ichiro Satoh
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

We describe a framework that is used to build and test software for ubiquitous and mobile computing. The approach involves software-level emulators for computing devices. Since each emulator is implemented as a mobile agent, it can dynamically carry its target software to each of the sub-networks that its device is connected to, on behalf of the device, and it permits the software to interact with other servers in its current sub-network. The framework can simulate the mobility and reconnection of mobile or ubiquitous computing devices by using the logical mobility of mobile agent-based emulators. That is, it can test software designed to run on a mobile or ubiquitous device in the same way as if the software were disconnected from the network, moved with the device, and reconnected to and executed on another network. This paper describes the lessons we learned from exploiting the framework in developing typical application software for mobile and ubiquitous computing devices.
Major and descent statistics for the even-signed permutation group
Authors: Riccardo Biagioli
Venue: Advances in Applied Mathematics (2003)

We introduce and study three new statistics on the even-signed permutation group Dn. We show that two of these are Mahonian, i.e., are equidistributed with length, and that a pair of them gives a generalization of Carlitz's identity on the Euler-Mahonian distribution of the descent number and major index over Sn.
On Functions Defined on Free Boolean Algebras
Authors: Ivo Rosenberg, Dan A. Simovici, Szymon Jaroszewicz
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

We characterize measures on free Boolean algebras and we examine therelationships that exists between measures and binary tables in relationaldatabases.It is shown that these measures are completely defined bytheir values on positive conjunctions and an algorithm that leads tothe construction ofmeasures starting from its values on positiveconjunction is also given, including a formula that allows theevaluation of measures for arbitrary polynomials.Finally, westudy pairs of measures generated by ternary tables, that is, by tablesthat contain missing or unknown values.
An algebraic approach to hyperalgebras
Authors: I. G. Rosenberg
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

In the past 6 decades the theory of hypergroups and other concrete hyperalgebras has fairly developed but there is still no coherent universal-algebra type theory of hyperalgebras. We represent hyperalgebras on a universe A as special universal algebras on the set P*(A) (of all nonvoid subsets of A), define hyperclones on A and for A finite, study the relationship between the hyperclones on A and the inclusion-isotone clones on P* (A). We introduce new notions of subuniverses, congruences and homomorphisms of hyperalgebras. Finally we raise a few natural problems concerning the lattice of inclusion-isotone clones on P*(A); in particular for the boolean case A={0, 1}.
Genetical Engineering of Handwriting Representations
Authors: Alexandre Lemieux, Christian Gagné, Marc Parizeau
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper presents experiments with genetically engineered feature sets for recognition of on-line handwritten characters. These representations stem from a nondescript decomposition of the character frame into a set of rectangular regions, possibly overlapping, each represented by a vector of 7 fuzzy variables. Efficient new feature sets are automatically discovered using genetic programming techniques. Recognition experiments conducted on isolated digits of the Unipen database yield improvements of more than 3% over a previously manually designed representation where region positions and sizes were fixed.
Parallel Superconvergent Multigrid
Authors: Paul O. Frederickson, Oliver A. McByran
Venue:  (1987)

We describe a class of multiscale algorithms for the solution of large sparse linear systems that are particularly well adapted to massively parallel supercomputers. While standard multigrid algorithms are unable to effectively use all processors when computing on coarse grids, the new algorithms utilize the same number of processors at all times. The basic idea is to solve many coarse scale problems simultaneously, combining the results in an optimal way to provide an improved fine scale solution. As a result, convergence rates are much faster than for standard multigrid methods we have obtained V-cycle convergence rates as good as .0046 with one smoothing application per cycle, and .0013 with two smoothings. On massively parallel machines, the improved convergence rate is attained at no extra computational cost since processors that would otherwise be sitting idle are utilized to provide the better convergence. On serial machines, the algorithm is slower because of the extra time spent on multiple coarse scales, though in certain cases the improved convergence rate may justify this particularly in cases where other methods do not converge. In constant coefficient situations the algorithm is easily analyzed theoretically using Fourier methods on a single grid. The fact that only one grid is involved substantially simplifies convergence proofs. A feature of the algorithms is the use of a matched pair of operators: an approximate inverse for smoothing and a super-interpolation operator to move the correction from coarse to fine scales, chosen to optimize the rate of convergence.
Weak Alternating Automata Are Not That Weak
Authors: Orna Kupferman, Moshe Vardi
Venue: Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97) (1997)

Automata on infinite words are used for specification and verification of nonterminating programs. Different types of automata induce different levels of expressive power, of succinctness, and of complexity. Alternating automata have both existential and universal branching modes and are particularly suitable for specification of programs. In a {\em weak alternating automaton}, the state space is partitioned into partially ordered sets, and the automaton can proceed from a certain set only to smaller sets. Reasoning about weak alternating automata is easier than reasoning about alternating automata with no restricted structure. Known translations of alternating automata to weak alternating automata involve determinization, and therefore involve a double-exponential blow-up. In this paper we describe a quadratic translation, which circumvents the need for determinization, of Buchi and co-Buchi alternating automata to weak alternating automata. Beyond the independent interest of such a translation, it gives rise to a simple complementation algorithm for nondeterministic Buchi automata.
Models for Visualization in Parallel Debuggers
Authors: Cherri M. Pancake, Sue Utter
Venue:  (1989)

The complexity of parallel programming has stimulated the development of a variety of debugging tools. This survey of recent research focuses on debugger visualization systems. The effectiveness of such systems is bounded by the degree to which their representations of run-time behavior correlate with the language structures used to incorporate parallelism, as well as the logical framework adopted by the programmer. Current visualization systems are compared with the conceptual models supported by parallel languages. Attention is drawn to the fact that debuggers are tied to specific models and that this association may restrict their usefulness and acceptability.
Fast parallel chessboard distance transform algorithms
Authors: Yu-Hua Lee, Shi-Jinn Horng
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

In this paper, based on the diagonal propagation approach, we first provide an O(N2) time sequential algorithm to compute the chessboard distance transform (CDT) of an N X N image, which is a DT using the chessboard distance metrics. Based on the proposed sequential algorithm, the CDT of a 2-D binary image array of size N X N can be computed in O (log N) time on the EREW PRAM model using O(N2/log N) processors, O(log N/log log N) time on the CRCW PRAM model using O(N2log log N/log N) processors and O(log N) time on the hypercube computer using O(N2) processors. Following the mapping as proposed by Y.H. Lee and S.J. Horng (1995), the algorithm for the MAT is also efficiently derived. The medial axis transform of a 2-D binary image array of size N X N can be computed in O(log N) time on the EREW PRAM model using O(N2log N) processors, O(log N/log log N) time on the CRCW PRAM model using O(N2log log N/log N) processors, and O(log N) time on the hypercube computer using O(N2) processors. Our algorithms are faster than the best previous results as proposed by J.F. Jenq and S. Sahni (1992).
Hilbert''s Nullstellensatz is in the Polynomial Hierarchy
Authors: Pascal Koiran
Venue:  (1996)

We show that if the Generalized Riemann Hypothesis is true, the problem of deciding whether a system of polynomial equations in several complex variables has a solution is in the second level of the polynomial hierarchy. In fact, this problem is in AM, the ``Arthur-Merlin'''' class (recall that $\np \subseteq \am \subseteq \rp^{\tiny \np} \subseteq \Pi_2$). The best previous bound was PSPACE. An earlier version of this paper was distributed as NeuroCOLT Technical Report~96-44. The present paper includes in particular a new lower bound for unsatisfiable systems, and remarks on the Arthur-Merlin class.
Non-ergodicity of queueing networks under non-stability of theirfluid models
Authors: A. Puhalskii, A. Rybko
Venue:  (1999)

We study ergodicity properties of open queueing networks, for which the associated fluid models have trajectories that go to infinity. It is proved that if a trajectory is stable in a certain sense and tends to infinity linearly fast, then the underlying stochastic process is non-ergodic. The result applies to the basic non-trivial examples of non-ergodic networks found by Bramson, and Rybko and Stolyar. The proof employs some general large-deviation-theory results.
Logical Aspects of Set Constraints
Authors: Dexter Kozen
Venue:  (1994)

Set constraints are inclusion relations between sets of ground terms over a ranked alphabet. They have been used extensively in program analysis and type inference. Here we present an equational axiomatization of the algebra of set constraints. Models of these axioms are called termset algebras. They are related to the Boolean algebras with operators of Jonsson and Tarski. We also define a family of combinatorial models called topological term automata, which are essentially the term automata studied by Kozen, Palsberg, and Schwartzbach endowed with a topology such that all relevant operations are continuous. These models are similar to Kripke frames for modal or dynamic logic. We establish a Stone duality between termset algebras and topological term automata, and use time to derive a completeness theorem for a related multidimensional modal logic. Finally, we prove a small model property by filtration, and argue that this result contains the essence of several algorithms appearing in the literature on set constraints. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Specification-Based Class Testing: A Case Study
Authors: Ian MacColl, Leesa Murray, Paul Strooper, David Carrington
Venue: Proceedings of the Second IEEE International Conference on Formal Engineering Methods (1998)

This paper contains a case study demonstrating a complete process for specification-based class testing. The process starts with an abstract specification written in Object-Z and concludes by exercising an implementation with test cases and evaluating the results. The test cases are derived using the Test Template Framework for each individual operation. They are analysed to generate a finite state machine that can execute test sequences within the ClassBench framework. An oracle is also derived from the Object-Z specification. The case study demonstrates how a formal specification contributes to the development of practical tests that can be executed by a testing tool. It also shows how a test oracle can be derived from a specification and used by the same testing tool to evaluate test results.
SVG Unleashed
Authors: Andrew Watt
Venue:  (2002)

:SVG Unleashed gives in-depth advice about how to create and manipulate Scalable Vector Graphics (SVG) programmatically. Targeted to the experienced Web programmer, SVG Unleashed equips the reader with the practical knowledge needed to use SVG on both the client and the server side. The book begins with a thorough reference to SVG syntax, elements, coordinate systems, and animations, with coverage of the XML Document Object Model (DOM) and the SVG DOM application to each element or attribute. Client-side SVG programming is then introduced with particular emphasis on the use of ECMAScript/JavaScript. In Part III, readers learn to use several server-side languages to create SVG documents, while Part IV demonstrates SVG programming through several case studies. The book concludes with a chapter written by the W3C's SVG Working Group Chair that gives readers an insider's view to the future of SVG, covering 1.1, 1.2, and 2.0. The appendixes include a glossary of terms used in the book and downloadable references for SVG elements, SVG attributes and properties, and the SVG DOM.
On Managing Nonmontonic Transitive Relationships
Authors: B. Boutsinas
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

Efficient representation of knowledge, under a multiple inheritance scheme with exceptions, plays an important role in Artificial Intelligence. Fast verification of the existence of a transitive relationship in such a hierarchy is of great importance. This paper presents an efficient algorithm for computing transitive relationships with exceptions. It is based on a known transitive closure compression technique that uses a labeled spanning tree of a directed acyclic graph. It is a very fast algorithm, compared to graph-search algorithms that solve the same problem, without sacrificing some desirable properties that nonmonotonic multiple inheritance schemes should, in general, possess. Moreover, it satisfies low storage requirements.
An Architectural Style Decoupling Coordination, Computation and Data
Authors: Anssi Karhinen, Juha Kuusela, Tapio Tallgren
Venue: Proceedings of the Third IEEE International Conference on Engineering of Complex Computer Systems (1997)

In distributed applications, several processes are involved in serving a request. The state of the request is encoded in the states of their processes. This can lead to unnecessary complexity and hard-to-detect errors. This paper presents an architectural style, token architectures, that decouples data, control, and synchronization. Tokens encapsulate the state of a computation. Service points manipulate the tokens and perform services for them. The tokens use maps to move between service stations. We will show in an example how this style simplifies the design of a telecommunications application and what difficulties traditional designs must solve.
Abstract Data Visualization in the Built Environment
Authors: Dino Bouchlaghem, Dennis Loveday
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Research on data visualization is undergoing major developments in a number of different fields. These developments include investigating ways of applying visualization techniques and systems for manipulation that is more efficient, interpretation and presentation of data. In the built environment field, the potential of new visualization technologies to enhance the presentation of performance data obtained as output from simulation programs has remained almost unexplored.The primary aim of the work summarized here was to commence the development of a method for visualizing the data produced by thermal analysis tools. Two applications are presented here. The first is designed to automatically process the output within a commercial spreadsheet. The second is designed to display the solution in three dimensions to aid spatial recognition and data navigation.This paper presents, through small-scale user tests, that each of the proposed applications significantly improves some of the attributes associated with usability, namely: learnability, efficiency, memorability, errors and satisfaction. Advice is given on the key aspects that require attention when the full method is developed. Finally, it should be possible to develop low cost data visualization tools to improve the overall usability of a thermal analysis tool within a built environment practice.
Investigations of Model-Preference Defaults
Authors: Mark Boddy, Robert P. Goldman, Keiji Kanazawa, Lynn A Stein
Venue:  (1989)

In this paper, we explore the expressive and computational properties of the logic of model-preference defaults (MPD). We extend the set of sublanguages of MPD known to be tractable. We compare MPD with the approaches to nonmonotonic reasoning represented by default logic and circumscription. Finally, we discuss MPD''s suitability for various applications of nonmonotonic reasoning, including inheritance, temporal reasoning, and knowledge representation. In doing so, we show that MPD provides tractable solutions to the problems of temporal projection and mixing strict and defeasible inheritance.
Using Formal Methods. A practical compairsion between Z/EVES and PVS
Authors: Daniel Fredholm
Venue:  (2001)

This paper consists of a review and comparison between Z/EVES and PVS--two tools designed for analyzing formal specifications. Z/EVES is a tool for analyzing specifications written in Z. PVS is a general theorem prover for a language that consists of higher order logic together with set theory. The review has its focus on the possibility to use these tools in an industrial context. The plan for the review was to get acquainted with the tools on a general level and then to use them to partially validate a formal specification of requirements for the safety function of railway signaling systems. The conclusion is that PVS is clearly superior to Z/EVES. PVS has such a good performance that it can be recommended for industrial use in the area of formal methods. Concerning Z/EVES, its applicability seems more restricted.
Numerical inversion of the Laplace transform via fractional moments
Authors: Aldo Tagliani, Yurayh Velásquez
Venue: Applied Mathematics and Computation (2003)

A method for the numerical inversion of Laplace transform on the real line of heavy-tailed (probability) density functions is presented. The method assumes as known a finite set of real values of the Laplace transform and chooses the analytical form of the approximant maximizing Shannon-entropy, so that positivity of the approximant itself is guaranteed. The problem resorts to a finite fractional Hausdorff moment problem and some results of convergence are provided. Some numerical results are illustrated.
Predicting Fault-Prone Modules with Case-Based Reasoning
Authors: Taghi M. Khoshgoftaar, K. Ganesan, Edward B. Allen, Fletcher D. Ross, Rama Munikoti, Nishith Goel, Amit Nandi
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

Software quality classification models seek to predict quality factors such as whether a module will be fault-prone, or not. Case-based reasoning (cbr) is a modeling technique that seeks to answer new questions by identifying similar ``cases'' from the past. When applied to software reliability, the working hypothesis of our approach is this: a module currently under development is probably fault-prone if a module with similar product and process attributes in an earlier release was fault-prone. The contribution of this paper is application of case-based reasoning to software quality modeling. To the best of our knowledge, this is the first time that case-based reasoning has been used to identify fault-prone modules.A case study illustrates our approach and provides evidence that case-based reasoning can be the basis for useful software quality classification models that are competitive with discriminant models. The case study revisits data from a previously published nonparametric discriminant analysis study. The Type II misclassification rate of the cbr model was substantially better than that of the discriminant model. Although the Type I misclassification rate was slightly greater and the overall misclassification rate was only slightly less, the cbr model was preferred when costs of misclassification were considered.
Bidirectional Data Transfer Based Asynchronous VLSI System Using Multiple-Valued Current Mode Logic
Authors: Takahiro Hanyu, Tomohiro Takahashi, Michitaka Kameyama
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

A new asynchronous data transfer scheme usingmultiple-valued 2-color 1-phase coding, called a bidirectionaldata transfer scheme, is proposed for a high-performanceand low-power VLSI system. Valid data signalsof "0" or "1" are represented by binary dual-railcomplementary codes, (0,1) and (1,0), and "ODD" and"EVEN" colors are represented by binary dual-rail codes,(0,0) and (1,1), respectively. Control signals from botha transmitter and a receiver are represented by dual-railmultiple-valued coding with superposition of data and colorsignals. The use of dual-rail coding makes it easy to detectEVEN and ODD information by calculating the sumof dual-rail codes, even when data and color informationare mixed on the same wires in asynchronous datatransfer. Since a linear-summation can be implementedby wiring without active devices in multiple-valued bidirectionalcurrent-mode circuitry, the proposed circuit forasynchronous control becomes simple. It is evaluated in a0.18-µm CMOS technology that the switching speed of theproposed asynchronous data transfer scheme is about 1.6-times faster than that of the corresponding binary CMOSimplementation under the normalized power dissipation.