ppxscal/embedding_network huggingface dataset:
Graph Sketches
Authors: James Abello, Jeffrey Korn, Irene Finocchi
Venue: Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01) (2001)

We introduce the notion of Graph Sketches. They can be thought of as visual indices that guide the navigation of a multi-graph too large to fit on the available display. We adhere to the Visual Information-Seeking Mantra: Overview first, zoom and filter, then details on demand. Graph Sketches are incorporated into MGV, an integrated visualization and exploration system for massive multi-digraph navigation. We highlight the main algorithmic and visualization tasks behind the computation of Graph Sketches and illustrate several application scenarios. Graph Sketches will be used to guide the navigation of multi-digraphs defined on vertex sets with sizes ranging from 100 to 250 million vertices.
USGS THREE-DIMENSIONAL FINITE VOLUME ELLAM IMPLEMENTATION
Authors: C. I. Heberton, T. F. Russell, L. F. Konikow, G. Z. Hornberger
Venue:  (2000)

We report on a three-dimensional implementation of a finite volume ELLAM method. The USGS FVELLAM code simulates solute transport in flowing ground water for a single dissolved solute constituent and represents the processes of advective transport, hydrodynamic dispersion (including mechanical dispersion and diffusion), mixing from fluid sources, and simple chemical reactions (including linear sorption and decay). The implementation conserves mass locally and globally. This ELLAM incorporates an implicit-in-time finite difference approximation for the dispersive and sink terms, allowing large transport time increments to be used. It uses a forward tracking approach to move mass to the new time level, distributing mass among destination cells using approximate characteristic functions. It can yield qualitatively good results in few transport time steps.
MySQL: The Definitive Guide to Using, Programming , and Administering MySQL 4, 2nd Edition, 2 edition
Authors: Paul Dubois
Venue:  (2003)

:In the second edition of MySQL Paul DuBois provides an updated, comprehensive guide to one of the most popular relational database systems.MySQL is the most popular open source database server in the world, with more than 2 million installations and customers including Yahoo!, MP3.com, Motorola, and NASA.MySQL 4.0, now generally available, is a long-awaited update to the database management system that has many new features, including a new table definition file format, enhanced replication, and more functions for a full text search.Instead of giving readers merely an overview of MySQL 4.0, DuBois continues to include the most sought-after answers to the questions he hears most often from the community.
Domain-specific languages
Authors: Arie Deursen, Paul Klint, J. M.W. Visser
Venue:  (2000)

Domain-Specific Languages are used in software engineering in order to enhance quality, flexibility, and timely delivery of software systems, by taking advantage of specific properties of a particular application domain. This survey covers terminology, risks and benefits, examples, design methodologies, and implementation techniques of domain-specific languages as used for the construction and maintenance of software systems. Moreover, it covers an annotated selection of 75 key publications in the area of domain-specific languages.
Computation of Signature Symmetric Balanced Realizations
Authors: U. Helmke, K. Hüper, J. B. Moore
Venue: Journal of Global Optimization (2003)

A new numerical scheme for computing balancing coordinate transformations for signature symmetric realizations in linear systems theory is presented. The method is closely related to the Jacobi method for diagonalizing symmetric matrices. Here the minimization of the sum of traces of the Gramians by orthogonal and hyperbolic Jacobi-type rotations is considered. Local quadratic convergence of the algorithm is shown.
Maze Game for the Macintosh
Authors: Mark Sherman
Venue:  (1986)

Maze is a multiperson game using a broadcast protocol on the Macintosh. This disk contains the sources (in TML Pascal) for a Maze game.
Bifurcation of Internal Solitary Wave Modes from the Essential Spectrum
Authors: Kevrekidis P.G., Jones C.K.R.T.
Venue:  (1999)

The bifurcation of internal modes from the phonon band in models supporting solitary wave solutions has been one of the exciting new phenomena in the field. We will present a number of analytical and semi-analytical techniques for the detection, study and understanding of these modes. We will see how they appear, without threshold, due to the discretization of the continuum equations. This perturbation is viewed in terms of a singular continuum approximation and analyzed by both perturbation theory and the Evans'' function method. It is shown that these methods give equivalent results. Moreover, they are corroborated by mixed analytical-numerical computations based on the discrete Evans'' function recently developed by the first author. The extent to which these predictions survive to strong discretizations are discussed. The results will be presented in the context of both the sine-Gordon and the $\phi^4$ models.
Performability analysis of handoff calls in personal communication networks
Authors: Cheul Woo Ro, K. S. Trivedi
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

A combined performance and dependability (called performability) model for dealing with handoff calls is introduced. Stochastic reward nets (SRNs) are used for this purpose. An SRN model of channel assignment is developed and analyzed. The method of phase type expansion is used is approximate non-exponential call holding time distribution. A discussion, of how hand-off models with failure relate to Markov reward models is also given.
A Classroom Note on Topological Ordering
Authors: L. Cammack, C. Cooper
Venue:  (1980)

A partially ordered set (poset) is a pair (S,R) where S is a nonempty set and R is a reflexive, antisymmetric, transitive relation on S. (Equivalently, a pair (S,R'') where R'' is an irreflexive, transitive relation on S.) Unless otherwise stated the second definition will be the one used in this discussion. (S,R) is a chain if R is a total order on S, that is, given any pair a, b in S, either (a,b) or (b,a) is in R. The notion of embedding a poset in a complete lattice is a well known lattice theoretic result. [ see Foulis(1)] In this sequel we consider a special case of that result; namely, the embedding of a poset in a chain. Although the proof in the finite case suggests an intuitively obvious constructive algorithm [see Kahn(2)] it was only recently that an `optimal'' solution was discovered which can be implemented in linear time. [see Knuth(3)]. The proof in the infinite case first appeared in print in a paper by Szpilrajn. [see Szpilrajn(4)]. In this presentation the proof in the infinite case is a reasonably `clean'' and straightforward application of Zorn''s lemma which can be readily understood by the average undergraduate.
On Selecting Testable Paths in Scan Designs
Authors: Yun Shao, Sudhakar M. Reddy, Irith Pomeranz, Seiji Kajihara
Venue: Journal of Electronic Testing: Theory and Applications (2003)

We propose an efficient method to select a minimal set of testable paths in scan designs, such that every line in the circuit is covered by at least one of the longest testable paths that contain it (if there are any). The proposed path selection approach is based on a stepwise path expansion procedure that uses delay information and compact information about untestable paths to select longest paths while avoiding untestable paths. Techniques called delay analysis and delay-constrained path expansion are used to speedup the selection of paths to test. Compared to earlier approaches, the proposed approach is fast and it is guaranteed to find testable paths. Additionally the procedure also derives tests for the selected paths. Experimental results for ISCAS89 benchmark circuits using standard scan and broadside testing are presented to demonstrate the effectiveness of the proposed method.
Analysis of SEU Effects in a Pipelined Processor
Authors: M. Rebaudengo, M. Sonza Reorda, M. Violante
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

Modern processors embed features such as pipelined execution units and cache memories that can hardly be controlled by programmers through the processor instruction set. As a result, software-based fault injection approaches are no longer suitable for assessing the effects of SEUs in modern processors, since they are not able to evaluate the effects of SEUs affecting pipelines and caches. In this paper we report an analysis of a commercial processor core where the effects of SEUs located in the processor pipeline and cache memories are studied. Moreover, the obtained results are compared with those software-based approaches provide. Experimental results show that software-based approaches may lead to errors during the failure rate estimation of up to 400%.
On-Line Error Detection and Correction in Storage Elements with Cross-Parity Check
Authors: M. Pflanz, K. Walther, C. Galke, H. T. Vierhaus
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

This paper proposes the Cross-Parity check as a method for an on-line detection of multiple bit-errors in storage elements of microprocessors like registers or register files. Transient or 'soft' errors caused by radiation or electromagnetic influences are in the focus of this work. Especially for register files or register groups, an easy implementable error correction method is proposed, which can be performed by software routines or additional hardware. The method is based on the logical interpretation of Cross-Parity vectors.
Social navigation: modeling, simulation, and experimentation
Authors: Mark O. Riedl, Robert St. Amant
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

The term social navigation refers to the process of seeking social interaction as a source of navigational support. In this paper we present a computational model of social navigation as an extension to an existing conceptual, non-computational model of general navigation. We argue that such models are important in designing effective shared environments for information navigation. We describe support for the model with a simulation environment for social navigation and an analytical model that addresses some of the quantitative implications of social interaction on the process.
Why are Human-Computer interfaces Difficult to Design and Implement?
Authors: Brad A. Myers
Venue:  (1993)

Everyone knows that designing and implementing human-computer interfaces is difficult and time-consuming. However, there is little discussion of why this is true. Should we expect that a new method is around the corner that will make the design easier? Will the next generation of user interface toolkits make the implementation trivial? No. This article discusses reasons why user interface design and implementation are inherently difficult tasks and will remain so for the foreseeable future.
An organic database system
Authors: Martin L. Kersten, Arno P.J.M. Siebes
Venue:  (1999)

The pervasive penetration of database technology may suggest that we have reached the end of the database research era. The contrary is true. Emerging technology, in hardware, software, and connectivity, brings a wealth of opportunities to push technology to a new level of maturity. Furthermore, ground breaking results are obtained in Quantum- and DNA-computing using nature as inspiration for its computational models. This paper provides a vision on a new brand of database architectures, i.e. an Organic Database System where a large collection of connected, autonomous data cells implement a semantic meaningful store/recall information system. It explores the analogy of a biological complex to charter the contours of this research vision. A concrete computational model is defined and illustrated by examples as a step into this direction.
Exploiting Symmetry in the Model Checking of Relational Specifications
Authors: Daniel Jackson
Venue:  (1994)

Errors in a software design can be detected early on by analyzing a formal model expressed in a specification language such as Z. Since software designs tend to involve infinite (or at least very big) state spaces, it has been assumed that this analysis cannot be automated. Consequently, few formal specifications have been extensively analyzed, and the potential for early detection of errors has not been realized. This paper argues that, while proving properties of designs may be intractable, detecting errors may not be. State transitions of an operation can be enumerated exhaustively, within a ''scope'' defined by the user that places a bound on the size of state components. Symmetry can then be exploited to reduce this finite state space. A state can be shown to be symmetrical, in the context of the analysis, to a state already examined, and thus guaranteed not to reveal an error. Preliminary experiments with a prototype are promising. A small scope often seems sufficient to catch errors, and exhibits enough symmetry to reduce search by a factor of 10 or more.
Lightglove: Wrist-Worn Virtual Typing and Pointing
Authors: Bruce Howard, Susie Howard
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

We are presenting the "Lightglove", a watch-size wireless virtual typing device worn underneath the wrist(s), with light beams sensing fingertips and motion sensors tracking hand movement. A miniature keyboard image is superimposed over the user's application on the host system display, and active keys corresponding to each finger are highlighted and pan around the key-map as the hand moves. Typing and pointing actions are similar to those with conventional keyboard and mouse, as though a physical device were underneath the hand. When the cursor moves out of the keyboard display area the Lightglove acts as a pointer (mouse). Applications include computer/PDA input, gaming control, TV remote control, and musical applications.
Greed Sort: An Optimal External Sorting Algorithm for Multiple Disks
Authors: Mark H. Nodine, Jeffrey S Vitter
Venue:  (1991)

We present an optimal deterministic algorithm for external sorting on multiple disks. Our measure of performance is the number of input/output (I/O) operations. In each I/O, each disk can simultaneously transfer a block of data. Our algorithm improves upon a recent randomized optimal algorithm and the (non-optimal) commonly used technique of disk striping. The code is simple enough for easy implementation.
A routing protocol for finding two node-disjoint paths in computer networks
Authors: K. Ishida, Y. Kakuda, T. Kikuno
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

In this paper, we present a routing protocol for finding two node-disjoint paths between each pair of nodes in a computer network. In the proposed protocol, each node in the network has the same procedure, which is driven by local information with respect to the network topology such as an adjacent node on a spanning tree in the network. Thus, the execution of the protocol can continue after changes of the network topology and load. The concept of spanning tree-based kernel construction is introduced to synchronize procedures under the distributed control of the protocol. The routing scheme based on the protocol possesses the enhanced capabilities of alternate routes and load splitting, which cope with failures and load variations in the network. Furthermore, even if topology changes occur which damage the obtained disjoint paths, the paths themselves can be updated efficiently
The nature of "computer architecture"
Authors: Lyle A. Cox,  Jr.
Venue: ACM SIGARCH Computer Architecture News (1979)

"The finest words in the world are only vain sounds if you cannot understand them." Anatole FranceThere are several different interpretations of what "computer architecture" is, and what the phrase means. An informal survey of professionals who routinely deal with computers was conducted to determine better the perceived meaning of "computer architecture". From this I hoped to identify potential areas of misunderstanding when discussing the various aspects of computer architecture.
Strategic Railway Systems Using ADS Technologies in Japan
Authors: Yoshio Ishida
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

In 1987 Japanese National Railway ("JNR"), a public corporation, was privatized and split into one freight railway company and six passenger railway companies with a view to bringing about a rebirth of railway enterprise. Our company was inaugurated as East Japan Railway Company ("JR East") with a service area covering the Metropolitan Tokyo and Tohoku region.In this paper I will review how JR East as a leading passenger railway company in Japan has constructed, since its beginning in 1987, the Strategic Railway Systems ("SRS"), which are necessarily required for the management of a privatized company and which can be apowerful tool for the enhancement of management efficiency. I will discuss the underlying basic concept and the technologies applied in the construction of SRS.I will first go over the history of introduction of SRS by comparing it with the form of a railway system which was dictated by the needs of management of a public corporation in the era of JNR.I will then touch upon the technical background which made is possible to build SRS, particularly the technological progress in the IT area and Autonomous Decentralized System ("ADS") technologies. I will expound on how such new technologies came to be adopted into the railway system, what specific functions they were designed to fulfill and what practical effects were realized as a result.Finally, I will set forth my view on what future progress is expected of SRS which is in use today.
Integrated E-Learning: Pedagogy, Technology and Organization
Authors: Wim Jochems, Rob Koper, Jeroen Van Merrienboer
Venue:  (2003)

:This book recognizes that online and e-learning are no longer of exclusive concern of distance education and that they can no longer be considered in isolation from traditional education programs. The authors view e-learning as part of a continuum of learning environments  that include classroom teaching, self-study, on-the-job training and active practice of skills  and offer a framework and practical guidance for optimizing the use of each to achieve learning objectives. By offering a coherent approach to instructional design they show how e-learning can be designed to support other forms of learning, rather than being a matter of simply "digitizing" traditional materials. They propose the integration of pedagogical, technological and organizational factors. This is a hands-on book reflects the contributors' considerable teaching experience and demonstrates how to design, develop, implement and evaluate integrated courses. "Integrated E-Learning" is essential reading for anyone wanting to implement, design develop or deliver e-learning or training courses.
Building a PC for Dummies, 4 edition
Authors: Mark L. Chambers
Venue:  (2003)

:This hands-on guide provides you with complete easy-to-follow instructions for assembling a Pentium PC computer from the ground up! Determine what type of computer you need and save hundreds of dollars by scavenging used parts or buying new parts online. Add advanced features like a digital scanner, an ISDN connection, and a CD recorder to your PC! You'll find all these great tips and tricks and more in Building A PC For Dummies. Inside, find helpful advice on how to Evaluate your needs and build the computer that's right for you -- from a basic system to a power user's dream Get the facts on your hardware choices before you buy -- including used parts that can save you even more money Pick the right operating system to run on your new PC -- including DOS, Windows 95, UNIX, Windows 98, Windows NT, OS/2, and LINUX Connect your new PC to an office or home network and share data or play games Add a modem to surf the Web or use ISDN for a high-speed connection Watch movies on your PC with a DVD drive or record your own CD-ROMs Play MIDI music, digital sound effects, and audio CDs with the latest sound cards
Cooperative Co-Learning: A Model-Based Approach for Solving Multi Agent Reinforcement Problems
Authors: Bruno Scherrer, François Charpillet
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Solving Multi-Agent Reinforcement Learning Problems is a key issue. Indeed, the complexity of deriving multiagent plans, especially when one uses an explicit model of the problem, is dramatically increasing with the number of agents. This papers introduces a general iterative heuristic: at each step one chooses a sub-group of agents and update their policies to optimize the task given the rest of agents have fixed plans. We analyse this process in a general purpose and show how it can be applied to Markov Decision Processes, Partially Observable Markov Decision Processes and Decentralized Partially Observable MarkovDecision Processes.
The Havana Framework for Supporting Application and Channel Dependent QOS in Wireless Networks
Authors: Javier Gomez, Andrew T. Campbell, Hiro Morikawa
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

For wireless channels, interference mitigation techniques are typically applied at the packet transmission level. In this paper, we present the Havana Framework for supporting integrated adaptive-QOS that also responds to impairments over multiple time scales that are present at the flow/session level. Our framework is based on three different mechanisms that operate over distinct adaptation time scales. At the packet transmission time scale, a channel predictor determines whether to transmit a packet or not depending on the state of the wireless channel. At the packet scheduling time scale, a compensator credits and compensates flows that experience bad link quality. Over even longer time scales an adapter regulates flows taking into account the ability of wireless applications to adapt to changes in available bandwidth and channel conditions.
Adaptive lifting schemes with perfect reconstruction
Authors: G. Piella, Henk J.A.M. Heijmans
Venue:  (2001)

In this paper, we propose a framework for constructing adaptive wavelet decompositions using the lifting scheme. A major requirement is that perfect reconstruction is possible without any overhead cost. In this paper we restrict ourselves to the update lifting stage. It is assumed that the update filter utilises local gradient information to adapt itself to the signal in the sense that smaller gradients `evoke'' stronger update filters. As a result, sharp transitions in a signal will not be smoothed to the same extent as regions which are more homogeneous. The approach taken in this paper differs from other adaptive schemes found in the literature in the sense that that no bookkeeping is required in order to have perfect reconstruction.
Marker Tracking and HMD Calibration for a Video-Based Augmented Reality Conferencing System
Authors: Hirokazu Kato, Mark Billinghurst
Venue: Proceedings of the 2nd IEEE and ACM International Workshop on Augmented Reality (1999)

We describe an augmented reality conferencing system which uses the overlay of virtual images on the real world. Remote collaborators are represented on Virtual Monitors which can be freely positioned about a user in space. Users can collaboratively view and interact with virtual objects using a shared virtual whiteboard. This is possible through precise virtual image registration using fast and accurate computer vision techniques and HMD calibration. We propose a method for tracking fiducial markers and a calibration method for optical see-through HMD based on the marker tracking.