ppxscal/embedding_network huggingface dataset:
Computing The Distribution of Accumulated Reward for a Markov Reward Process
Authors: M R Smith, S K Trivedi, V A Ramesh
Venue:  (1987)

In order to properly assess the effectiveness of systems over a finite time interval, measures that describe cumulative behavior are needed. We describe the behavior of a system as a continuous-time Markov chain and associate a reward rate with each state. The distribution of accumulated reward for analytical models of a system is of interest. The purpose of this note is to introduce a polynomial-time algorithm that obtains the distribution of accumulated reward over a finite interval for a Markov reward process.
Learning-Based Object Detection in Cardiac MR Images
Authors: Nicolae Duta, Anil K. Jain, Marie-Pierre Dubuisson-Jolly
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

An automated method for left ventricle detection in MR cardiac images is presented. Ventricle detection is the first step in a fully automated segmentation system used to compute volumetric information about the heart.Our method is based on learning the gray level appearance of the ventricle by maximizing the discrimination between positive and negative examples in a training set. The main differences from previously reported methods are feature definition and solution to the optimization problem involved in the learning process.Our method was trained on a set of 1,350 MR cardiac images from which 101,250 positive examples and 123,096 negative examples were generated. The detection results on a test set of 887 different images demonstrate an excellent performance: 98% detection rate, a false alarm rate of 0:05% of the number of windows analyzed (10 false alarms per image) and a detection time of 2 seconds per 256 × 256 image on a Sun Ultra 10 for an 8-scale search. The false alarms are eventually eliminated by a position/scale consistency check along all the images that represent the same anatomical slice.
Bimodal Multicast
Authors: Kenneth Birman, Mark Hayden, Oznur Ozkasap, Zhen Xiao, Mihai Budiu, Yaron Minsky
Venue:  (1998)

There are many methods for making a multicast protocol "reliable". At one end of the spectrum, a reliable multicast protocol might offer atomicity guarantees, such as all-or-nothing delivery, delivery ordering, and perhaps additional properties such as virtually synchronous addressing. At the other are protocols that use local repair to overcome transient packet loss in the network, offering ''best effort'' reliability. In this paper, we propose a new definition of reliability and offer an implementation of a protocol satisfying the definition (the definition requires certain network properties, but reasonable ones). Our protocol is similar to local repair protocols for the Internet, and like them, is extremely scalable. However, the form of reliability proposed is unusual for offering stable throughput under conditions that can dramatically degrade throughput when using atomic multicast. Bimodal multicast is well adapted to a class of applications for which previous forms of reliable multicast were fundamentally ill-matched.
Group leader election under link-state routing
Authors: Yih Huang, P. K. McKinley
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

In this work, we place the problem of group leader election in a context "inside the network," meaning that participants in the election process are network switches/routers, rather than hosts. A robust solution to the problem, called the Network Leader Election (NLE) protocol, is proposed for use in networks based on link-state routing (LSR). The protocol is robust, for it achieves leadership consensus in the presence of adverse events, such as leader failures and network partitioning. The correctness of the protocol can be proved formally. A simulation study reveals that the NLE protocol incurs low overhead in handling leader failures and in group creation. In addition, it is shown how important network functions, including hierarchical routing, address resolution, and multicast core management, can benefit from the NLE protocol.
Computability on Continuous Higher Types and its Role in the Semantics of Programming Languages
Authors: Robert L. Constable, Herbert Egli
Venue:  (1974)

This paper is about mathematical problems in programming language semantics and their influence on recursive function theory. In the process if constructing computable Scott models of the lambda calculus we examine the concepts of deterministic and non-deterministic effective operators of all finite types and continuous deterministic and non-deterministic partial computable operators on continuous inputs of all finite types. These are new recursion theoretic concepts which are appropriate to semantics and were inspired in part by Scott''s work on continuity.
Type Reconstruction for Syntactic Control of Interference, Part 2
Authors: Hongseok Yang, Howard Huang
Venue: Proceedings of the 1998 International Conference on Computer Languages (1998)

Syntactic Control of Interference (SCI) has long been studied as a basis for interference-free programming, with cleaner reasoning properties and semantics than traditional imperative languages. This paper improves upon Huang and Reddy's type inference system for SCI-based languages in two significant ways. First, we eliminate the need for explicit coercion operators in terms. Second, we consider adding let-bound polymorphism, which appears to be nontrivial in the presence of interference control. SCI can be adapted to a wide variety of languages, and our techniques should be applicable to any such language with SCI-based interference control.
The application of fatigue models to railway bridges
Authors: R. Gallagher, D. W. O'Dwyer, M. Hartnett
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper describes work that is being carried out to develop an approach for assessing the effects of dynamic loading on ageing metal bridges. The overall project involves work in a number of different areas: the development of bridge and rolling stock models and their interaction; the development of loading data to model variable track alignment and wheel profiles; the measurement of bridge responses to rolling loads; the calculation of cumulative fatigue damage and the evaluation of remaining fatigue life.This paper illustrates the approach taken in assessing the fatigue loading applied to the bridge. It discusses the methodology and mechanisms of fatigue analysis when applied. The procedure presented involves the implementation of the rain-flow algorithm. This method involves decomposing the stress history of each location on the structure into a series of stress cycles. This approach enables the application of traditional methods such as the Palmgren-Miner hypothesis. The method and its implementation are described in detail. Considerations such as material properties, stress concentrations and previous loading history are also considered and addressed.The importance of the dynamic interaction between the rolling stock, track and bridge systems, when considering fatigue, is dealt with in depth. Distinctions are made between different forms of structure and the difference in the response of short and long span bridges. The paper also addresses the different methods of approaching fatigue problems including: allowable stresses, the calculation of safe working life, or the calculation of safe working loads. The paper also discusses the ideas of low and high cycle fatigue.
Multiple-valued programmable logic arrays with universal literals
Authors: T. Utsumi, N. Kamiura, Y. Hata, K. Yamato
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

A universal literal is a single-variable function and has an ability to manipulate more information than a set literal. The array size therefore could be eliminated by using universal literal generators (ULGs for short) in programmable logic arrays (PLAs), compared to PLAs with set literals. This paper discusses what operator is the most suitable in the term of eliminating the array size. We find four solutions as the good operator structures to eliminate the array size. A speculation of the upper bound of the array sizes is shown. Experiments are also done for randomly generated functions and some arithmetic functions. The experimental results show that the MAX-of-TPRODUCT form PLAs require the smallest array size.
Teach Yourself HTML Publishing on the World Wide Web, 3 edition
Authors: Mac Bride
Venue:  (2003)

:Updated to reflect the latest changes in a fast-moving field, this step-by-step guide teaches HTML, the coding system a Web user needs to create a website. Includes tips on images, text formatting and fonts, interactive elements, and more. Even a beginner will be able to produce a Web page after only a few hours of practice. 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
Concurrent Maintenance of Views Using Multiple Versions
Authors: Sachin Kulkarni, Mukesh Mohania
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Materialized views in data warehouses are maintained incrementally, for reasons of efficiency, to present the latest updates to the users. These views are used by many warehouse readers (users) to execute OLAP queries by running several reader sessions and these views are maintained periodically by maintenance transactions. Therefore, there is an inherent problem of maintaining these views while the reader sessions continue to receive consistent data from these views. In this paper, we discuss a method that allows warehouse maintenance transactions to run concurrently with the reader sessions. Concurrency allows the readers to read the data from the views while the maintenance transaction updates these views.In our proposed method we create additional versions of views dynamically that contain only the modified tuples of the views and provide a mechanism to collapse these versions into the views periodically when there are no reader sessions accessing the views. These versions allow the reader sessions to access the old and the new information. The collapsing of the views is done by a low priority process executing periodically.
Heartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication
Authors: Marcos K Aguilera, Wei Chen, Sam Toueg
Venue:  (1997)

We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process crashes and lossy links. We first show that it is impossible to solve this problem without failure detectors. We then show how to solve it using a new failure detector, called heartbeat. In contrast to previous failure detectors that have been used to circumvent impossibility results, the heartbeat failure detector is implementable, and its implementation does not use timeouts. These results have wide applicability: they can be used to transform many existing algorithms that tolerate only process crashes into quiescent algorithms that tolerate both process crashes and message losses. This can be applied to consensus, atomic broadcast, k-set agreement, atomic commitment, etc. The heartbeat failure detector is novel: it is implementable without timeouts and it does not output lists of suspects as typical failure detectors do. If we restrict failure detectors to output only lists of suspects, quiescent reliable communication requires ><P [ACT97a], which is not implementable. Combined with the results of this paper, this shows that traditional failure detectors that output only lists of suspects have fundamental limitations.
A Distributed Architecture for Autonomous Robots
Authors: Maurizio Piaggio, Antonio Sgorbissa, Renato Zaccaria
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

In this paper we propose a distributed architecture for intelligent robotic systems. The architecture is specific to this domain because it intends to provide support for this type of applications that share particular functional requirements: concurrent perception and action, task and plan execution, reasoning, "intelligent behaviours". The architecture also aims to improve re-usability and integration of different software components. It allows the transparent distribution of processes on different computers in a network to take advantage of the increased computational power and to overcome the vehicles on-board limitations. We focus on the related cognitive model, on the internal structure of the architecture and of its components. We also examine in detail the EIE protocol we defined to exchange information within the distributed system. Finally we indicate some experimental results.
Idiosyncrasies of the Software Development Process and Their Relation to Software Patents: Theoretical Considerations and Empirical Evidence
Authors: Knut Blind, Jakob Edler
Venue: Netnomics (2003)

In Europe, the future patenting of software-related inventions has been the subject of intensive discussions for some time, since there exists a strong dispute between the supporters of the U.S. practice of allowing patents in order to increase Europe's competitiveness and the opponents postulating negative impacts of patents on the software development process. This paper presents empirical results about the idiosyncrasies of the software development process and tests hypotheses on their impact on the likelihood of patents being obstacles for software dvelopment. The paper concludes with the identification of determinants for preferences concerning different possible patent regimes in the future.
A Graphical Model for Audiovisual Object Tracking
Authors: Matthew J. Beal, Nebojsa Jojic, Hagai Attias
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

We present a new approach to modeling and processing multimedia data. This approach is based on graphical models that combine audio and video variables. We demonstrate it by developing a new algorithm for tracking a moving object in a cluttered, noisy scene using two microphones and a camera. Our model uses unobserved variables to describe the data in terms of the process that generates them. It is therefore able to capture and exploit the statistical structure of the audio and video data separately, as well as their mutual dependencies. Model parameters are learned from data via an EM algorithm, and automatic calibration is performed as part of this procedure. Tracking is done by Bayesian inference of the object location from data. We demonstrate successful performance on multimedia clips captured in real world scenarios using off-the-shelf equipment.
Nested Dissection: A Survey
Authors: Manpreet S. Khaira, Gary L. Miller, Thomas J. Sheffler
Venue:  (1992)

Methods for solving sparse linear systems of equations can be categorized under two broad classes - direct and iterative. Direct methods are methods based on gaussian elimination. This report discusses one such direct method, namely Nested Dissection. Nested Dissection, originally proposed by Alan George, is a technique for solving sparse linear systems efficiently. This report is a survey of some of the work in the area of nested dissection and attempts to put it together using a common framework.
A Statistical Syntactic Disambiguation Program and What it Learns
Authors: Murat Ersan, Eugene Charniak
Venue:  (1995)

We describe a program that uses statistical information on word-usage to perform syntactic disambiguation, and show that the use of this information significantly improves performance. The bulk of the paper, however, attempts to answer the question: what did the program learn that would account for this improvement? We show that the program has learned many linguistically recognized forms of lexical information, particularly verb case frames and prepositional preferences for nouns and adjectives. We also show that viewed simply as a learner of lexical information the program is also a success, performing slightly better than hand-crafted learning programs for the same tasks.
La assegnazione dei nomi a dominio su Internet (prima edizione)
Authors: Vittore Casarosa, Antonio Pinizzotto, Rita Rossi, Stefano Trumpy, Daniele Vannozzi
Venue:  (1998)

An outline of the origin of the Domain Name System in Internet is reported. A global overview of present situation follows: ISOC, InterNIC, RIPE and RIPE/NCC, ARIN, APNIC; then the Italian situation: Italian Naming Authority and Registration Authority. Some important issues about the Italian service management are dealt with: conflict between names and registered trademarks, name reservation, name structure for public administrations and similar issues. At the end of the document there is the IAHC proposal for the new gTLDs.
Concast: Design and Implementation of a New Network Service
Authors: Kenneth L. Calvert, James Griffioen, Amit Sehgal, Su Wen
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

This paper introduces concast, a new network service. Concast is the inverse of multicast: multiple sources send messages toward the same destination, which results in a single message being delivered to the destination. The received message appears to come from the concast group rather than any particular receiver. Different forms of concast service can be defined by varying the mapping from the set of sent messages to the received message. The service is useful for preventing implosion and reducing bandwidth consumption in cases where many senders transmit to the same receiver---for example in aggregating (or suppressing) positive (or negative) acknowledgementsWe define the semantics of a simple concast service that is the inverse of multicast, as well as a more general custom concast, which allows users to define certain aspects of the service's semantics. We describe how to implement the service so that it scales approximately as well as IP multicast. We also present results from a simulation study showing that concast provides significant benefits in a layered-video application.
High-Performance Replicated Distributed Objects in Partitionable Environments
Authors: Roy Friedman, Alexey Vaysburd
Venue:  (1997)

This paper presents an implementation of replicated distributed objects in asynchronous environments prone to node failures and network partitions. This implementation has several appealing properties: It guarantees that progress will be made whenever a majority of replicas can communicate with each other; it allows minority partitions to continue providing service for idempotent requests; it offers the application the choice between optimistic or safe message delivery. Performance measurements have shown that our implementation incurs low latency and achieves high throughput while providing globally consistent replicated state machine semantics. The paper discusses both the protocols and interfaces to support efficient object replication at the application level.
Probability concepts in pushover analysis
Authors: R. Torres, P. Fajfar, E. Alarcou
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper describes a method to obtain fragility curves for bridges in a seismic environment through nonlinear simplified methods. The bridge capacity is described using the Modal Adaptive Push Over methods and the seismic demand by the response spectra. The incertitudes associated to both systems are quantified using a family of time histories well distributed in respect to seismic intensity and a random family of bridges. The results are compared with the ones obtained using a step by step integration in time and with a simplified pushover approach.
v-Promela: A Visual, Object-Oriented Language for SPIN
Authors: Stefan Leue, Gerard Holzmann
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

We describe the design of VIP, a graphical front-end to the model checker SPIN. VIP supports a visual formalism, called v-Promela that connects the model checker to modern hierarchical notations for the specification of object-oriented, reactive systems. The formalism is comparable to formalisms such as UML-RT, ROOM, and Statecharts, but is presented here in a framework that allows us to combine the benefits of a visual, hierarchical specification method with the power of LTL model checking provided by SPIN. Like comparable formalisms, VIP can describe hierarchies of behaviour and of system structure. The formalism is designed to be transparent to the SPIN model checker itself, by allowing all central constructs to be translated mechanically into basic PROMELA, as already supported by the existing model checker.
Connectors in Configuration Programming Languages: Are They Necessary?
Authors: J. Bishop, R. Faria
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

Configuration programming is the process whereby components written in any conventional programming language can be bound together to form a dynamic system, often suitable for execution on distributed hardware. Among the specialised languages that exist for configuration programming there is currently a debate over the importance of recognising the connections between components as being as important as the components themselves. This paper lays out the pros and cons of the debate, outlining in the process the properties and roles of connectors. By means of experiments we show how connectors influence the way configurations are programmed and also how some of the effects can be simulated. The examples are given in Darwin, UNICON and WRIGHT and reference is also made lo the status of other current configuration languages.
Virtual University: Information Technology, Markets, and Management
Authors: Kevin Robins, Frank Webster
Venue:  (2003)

:This book, written by scholars from around the world discuss the effects of information technology on higher education. This volume covers the process of integrating information techology, creating virtual learning and possible consequences of the new information and communications techologies for higher education. It also focuses on how becoming a "virtual university" contributes to the reorganization of colleges and universities, gaining a more managerial and business identity globally.
On a theorem of L.V. Kantorovich concerning Newton's method
Authors: Ioannis K. Argyros
Venue: Journal of Computational and Applied Mathematics (2003)

We study the problem of approximating a locally unique solution of an operator equation using Newton's method. The well-known convergence theorem of L.V. Kantorovich involves a bound on the second Fréchet-derivative or the Lipschitz-Fréchet-differentiability of the operator involved on some neighborhood of the starting point. Here we provide local and semilocal convergence theorems for Newton's method assuming the Fréchet-differentiability only at a point which is a weaker assumption. A numerical example is provided to show that our result can apply to solve a scalar equation where the above-mentioned ones may not.
Almost universal parametrizations for cubic surfaces
Authors: Rainer Müller
Venue: Computer Aided Geometric Design (2003)

Universal parametrizations have been developed as an useful tool for working with rational surfaces. For example, they allow the systematic classification of rational curves with low degree on the surface and can be used for interpolation problems. Unfortunately, it is conjectured, that not every rational surface has a universal parametrization. To make the advantages usable for more surfaces, we introduce "almost universal parametrizations" as a generalization of universal parametrizations. We present them exemplarily for a special class of cubic surfaces, which do probably not possess a universal parametrization, and show applications.