ppxscal/embedding_network huggingface dataset:
Knowledge Mining With VxInsight: Discovery ThroughInteraction
Authors: George S. Davidson, Bruce Hendrickson, David K. Johnson, Charles E. Meyers, Brian N. Wylie
Venue: Journal of Intelligent Information Systems (1998)

The explosive growth in the availability of information is overwhelming traditional information management systems. Although individual pieces of information have become easy to find, the larger context in which they exist has become harder to track. These contextual questions are ideally suited to visualization since the human visual system is remarkably adept at interpreting large quantities of information, and at detecting patterns and anomalies. The challenge is to present the information in a manner that maximally leverages our visual skills. This paper discusses a set of properties that such a presentation should have, and describes the design and functionality of VxInsight, a visualization tool built to these principles.
Not Only the Tragedy of the Commons: Misperceptions of Bioeconomics
Authors: Erling Moxnes
Venue: Management Science (1998)

An exploratory search for explanations of mismanagement of renewable resources, other than the theory of the commons, was performed by an experiment. Eighty three subjects, mostly recruited from the fisheries sector in Norway, were asked to manage the same simulated virgin fish stock, one subject at a time. Exclusive property rights were granted to rule out the commons problem. Despite perfect property rights, subjects consistently overinvested, leading to an average overcapacity of 60%. The resource was reduced by an average of 15% below its optimal level. Overcapacity and tough "quotas" resemble the situation in Norwegian and other fisheries during the past few decades. The likely explanation of the observed behaviour is misperception of feedback, a phenomenon that occurs in many experimental studies of dynamically complex systems. Such misperceptions add a new and important dimension to the problem of renewable resource management, beyond the commons problem.
Extending Value Reuse to Basic Blocks with Compiler Support
Authors: Jian Huang, David J. Lilja
Venue: IEEE Transactions on Computers (2000)

Speculative execution and instruction reuse are two important strategies that have been investigated for improving processor performance. Value prediction at the instruction level has been introduced to allow even more aggressive speculation and reuse than previous techniques. This study suggests that using compiler support to extend value reuse to a coarser granularity than a single instruction, such as a basic block, may have substantial performance benefits. We investigate the input and output values of basic blocks and find that these values can be quite regular and predictable. For the SPEC benchmark programs evaluated, 90 percent of the basic blocks have fewer than four register inputs, five live register outputs, four memory inputs, and two memory outputs. About 16 to 41 percent of all the basic blocks are simply repeating earlier calculations when the programs are compiled with the -O2 optimization level in the GCC compiler. Compiler optimizations, such as loop-unrolling and function inlining, affect the sizes of basic blocks, but have no significant or consistent impact on their value locality, nor the resulting performance. Based on these results, we evaluate the potential benefit of basic block reuse using a novel mechanism called the block history buffer. This mechanism records input and live output values of basic blocks to provide value reuse at the basic block level. Simulation results show that using a reasonably sized block history buffer to provide basic block reuse in a 4-way issue superscalar processor can improve execution time for the tested SPEC programs by 1 to 14 percent, with an overall average of 9 percent when using reasonable hardware assumptions.
Non Uniform Multiresolution Method for Optical Flow and Phase Portrait Models: Environmental Applications
Authors: Isaac Cohen, Isabelle Herlin
Venue: International Journal of Computer Vision (1999)

In this paper we define a complete framework for processing large image sequences for a global monitoring of short range oceanographic and atmospheric processes. This framework is based on the use of a non quadratic regularization technique for optical flow computation that preserves flow discontinuities. We also show that using an appropriate tessellation of the image according to an estimate of the motion field can improve optical flow accuracy and yields more reliable flows. This method defines a non uniform multiresolution approach for coarse to fine grid generation. It allows to locally increase the resolution of the grid according to the studied problem. Each added node refines the grid in a region of interest and increases the numerical accuracy of the solution in this region. We make use of such a method for solving the optical flow equation with a non quadratic regularization scheme allowing the computation of optical flow field while preserving its discontinuities. The second part of the paper deals with the interpretation of the obtained displacement field. For this purpose a phase portrait model used along with a new formulation of the approximation of an oriented flow field allowing to consider arbitrary polynomial phase portrait models for characterizing salient flow features. This new framework is used for processing oceanographic and atmospheric image sequences and presents an alternative to complex physical modeling techniques.
Mathematica as an Environment for Doing Economics andEconometrics
Authors: David A. Belsley
Venue: Computational Economics (1999)

Today&lsquo;s graduate students in economics must master early on a computational environment suitable for their research needs. A case is made here why Mathematica is an eminently reasonable choice for this purpose for many students. Salient features of Mathematica are examined in this context, and the breadth of economic research accomplished in Mathematica is illustrated.
Systems for multi-level teaching materials
Authors: Jorma Sajaniemi, Marja Kuittinen
Venue: ACM SIGCSE Bulletin (1998)

Lecturers need three kinds of supporting materials: lecture notes given to learners, presentation material to be shown in the lectures, and lecturer's own guidance material to direct her during the lecture. Hardly any of the current presentation systems supports easy preparation and maintenance of these three interwoven material sources. In this paper, we describe two systems that can be used for authoring and presentation of multiple-level teaching materials.
Bayesian Landmark Learning for Mobile Robot Localization
Authors: Sebastian Thrun
Venue: Machine Learning (1998)

To operate successfully in indoor environments, mobile robots must be able to localize themselves. Most current localization algorithms lack flexibility, autonomy, and often optimality, since they rely on a human to determine what aspects of the sensor data to use in localization (e.g., what landmarks to use). This paper describes a learning algorithm, called BaLL, that enables mobile robots to learn what features/landmarks are best suited for localization, and also to train artificial neural networks for extracting them from the sensor data. A rigorous Bayesian analysis of probabilistic localization is presented, which produces a rational argument for evaluating features, for selecting them optimally, and for training the networks that approximate the optimal solution. In a systematic experimental study, BaLL outperforms two other recent approaches to mobile robot localization.
A new heuristic algorithm for finding minimum-cost multicast trees with bounded path delay
Authors: Anna Hać, Kelei Zhou
Venue: International Journal of Network Management (1999)

This article presents a new heuristic algorithm called DDBMA &lpar;Dynamic Delay Bounded Multicast Algorithm&rpar; to construct a minimum-cost multicast tree. The heuristic depends on &lpar;1&rpar; bounded delay along paths from source nodes to destination node; &lpar;2&rpar; minimum cost of the multicast tree; &lpar;3&rpar; dynamic multicast tree status which is maintained by updating the existing multicast tree when nodes in the network request to join or leave. Copyright &copy; 1999 John Wiley Sons, Ltd.
Co-synthesis of heterogeneous multiprocessor systems using arbitrated communication
Authors: David L. Rhodes, Wayne Wolf
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

We describe the first co-design technique aimed at heterogenous systems employing arbitrated communication. Arbitrated system design is especially difficult because communication scheduling is directly tied to task allocation. The method provides a complete co-design&mdash;i.e. generation of a hardware configuration along with an allocation and schedule&mdash;for the execution of hard real-time data-dependent tasks. By using an actual scheduling analysis in the inner co-design loop, the method is readily able to address realistic system effects including various communication models like arbitration, as in PCI-based systems.
Teaching electronic commerce (panel session)
Venue: Proceedings of the 2000 ACM SIGCPR conference on Computer personnel research (2000)

This panel will discuss various approaches and issues pertaining to the development and implementation of courses in Electronic Commerce &mdash; at the undergraduate, graduate, and executive levels. There has never been a better time to be teaching e-commerce. Web applications have evolved to a point where Gilder's &ldquo;hollowing out the computer&rdquo; seems almost achievable &mdash; as dot-com companies eager to build market share provide essential tools for the price of an eyeball (multiplied by the size of your outlook address book). The same toolbox that is creating an exciting and accessible platform for building e-businesses can be used to build the e-commerce classes that introduce students to such endeavors. This situation makes it possible to augment local school platforms to design rich, portable e-commerce classes that teach students the fundamentals of e-business as well as empower them to stretch the definition of this evolving phenomenon. The panel will explore key issues and options for the design of e-commerce classes, including: the structure of e-commerce classes &mdash; types of requirements, amount of hands-on experience, amount of programming required; appropriate content for various types of classes and how to keep it current; textbook options &mdash; what's out there, what's coming up, how people have supplemented these texts; platform options &mdash; local programs vs. web-based applications, providing students with marketable skills; where to apply technology &mdash; in projects, small hands-on exercises, in class management and communications; and managing projects &mdash; client relationships, limiting project scope, and team management.
Video textures
Authors: Arno Schödl, Richard Szeliski, David H. Salesin, Irfan Essa
Venue: Proceedings of the 27th annual conference on Computer graphics and interactive techniques (2000)

This paper introduces a new type of medium, called a video texture, which has qualities somewhere between those of a photograph and a video. A video texture provides a continuous infinitely varying stream of images. While the individual frames of a video texture may be repeated from time to time, the video sequence as a whole is never repeated exactly. Video textures can be used in place of digital photos to infuse a static image with dynamic qualities and explicit actions. We present techniques for analyzing a video clip to extract its structure, and for synthesizing a new, similar looking video of arbitrary length. We combine video textures with view morphing techniques to obtain 3D video textures. We also introduce video-based animation, in which the synthesis of video textures can be guided by a user through high-level interactive controls. Applications of video textures and their extensions include the display of dynamic scenes on web pages, the creation of dynamic backdrops for special effects and games, and the interactive control of video-based animation.
An Efficient Recognition-Complete Processor Allocation Strategy for k-ary n-cube Multiprocessors
Authors: Po-Jen Chuang, Chih-Ming Wu
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

Composed of various topologies, the k-ary n-cube system is desirable for accepting and executing topologically different tasks. To utilize its large amount of processor resources, several allocation strategies have been reported, each with certain restrictions that affect performance. For improvement, we propose a new allocation strategy for the k-ary n-cubes. The proposed strategy is an extension of the TC strategy for hypercubes and is able to recognize all subcubes with different topologies requested by tasks. Complexity analysis and performance comparison between related strategies are provided to demonstrate their advantages and disadvantages. Simulation results show that with full subcube recognition ability and no internal fragmentation, our strategy always exhibits better performance.
Waveform Inversion of Reflection Seismic Data for Kinematic Parameters by Local Optimization
Authors: René-Edouard Plessix, Yann-Hervé De Roeck, Guy Chavent
Venue: SIAM Journal on Scientific Computing (1999)

A reformulation of the usual least-squares waveform inversion problem is proposed to retrieve, from seismic data, the kinematic parameters (the two-dimensional (2D) background velocity and the source and cable depth) by local optimization. These last parameters are of paramount importance for a successful inversion of very high resolution (VHR) seismic data which we are interested in. In our inversion the source and cable depth parameters are treated in the same way as the background velocity. To avoid the problem of local minima, a change of unknowns is performed: the depth reflectivity is replaced by its dual variable, called the time reflectivity. In this way, the current value of the reflectivity is stored in the time domain and is strongly decoupled from the current value of the velocity field and cable depth. The increase in modeling complexity (an additional prestack migration is required for each function evaluation) is compensated by the enlargement of the attraction domain of the global minimum which allows the use of a local optimization technique. A numerical implementation with Born approximation and ray tracing is detailed, in which the derivatives of the travel time are computed via an adjoint state technique for more efficiency. Numerical results illustrate the behavior of the new objective function, and inversion of synthetic and real VHR data for kinematic parameters is performed.
Random oracles in constantipole: practical asynchronous Byzantine agreement using cryptography (extended abstract)
Authors: Christian Cachin, Klaus Kursawe, Victor Shoup
Venue: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (2000)

Byzantine agreement requires a set of parties in a distributed system to agree on a value even if some parties are corrupted. A new protocol for Byzantine agreement in a completely asynchronous network is presented that makes use of cryptography, specifically of threshold signatures and coin-tossing protocols. These cryptographic protocols have practical and provably secure implementations in the &ldquo;random oracle&rdquo; model. In particular, a coin-tossing protocol based on the Diffie-Hellman problem is presented and analyzed. The resulting asynchronous Byzantine agreement protocol is both practical and nearly matches the known theoretical lower bounds. More precisely, it tolerates the maximum number of corrupted parties, runs in constant expected time, has message and communication complexity close to the maximum, and uses a trusted dealer only in a setup phase, after which it can process a virtually unlimited number of transactions. Novel dual-threshold variants of both cryptographic protocols are used. The protocol is formulated as a transaction processing service in a cryptographic security model, which differs from the standard information-theoretic formalization and may be of independent interest.
PipeRench: a co/processor for streaming multimedia acceleration
Authors: Seth Copen Goldstein, Herman Schmit, Matthew Moe, Mihai Budiu, Srihari Cadambi, R. Reed Taylor, Ronald Laufer
Venue: Proceedings of the 26th annual international symposium on Computer architecture (1999)

Future computing workloads will emphasize an architecture's ability to perform relatively simple calculations on massive quantities of mixed-width data. This paper describes a novel reconfigurable fabric architecture, PipeRench, optimized to accelerate these types of computations. PipeRench enables fast, robust compilers, supports forward compatibility, and virtualizes configurations, thus removing the fixed size constraint present in other fabrics. For the first time we explore how the bit-width of processing elements affects performance and show how the PipeRench architecture has been optimized to balance the needs of the compiler against the realities of silicon. Finally, we demonstrate extreme performance speedup on certain computing kernels (up to 190x versus a modern RISC processor), and analyze how this acceleration translates to application speedup.
Functional programming and the fragile base class problem
Authors: Timothy A. Budd
Venue: ACM SIGPLAN Notices (1998)

A fact of life is that software changes over time. It has been observed that while object-oriented programs and functional programs both facilitate changes of a certain variety, they also make it difficult to permit changes of another type. Object-oriented languages make it easy to add new data types, but difficult to add new functionality to an existing data type (the so-called fragile base class problem). Functional programs make it easy to add new behavior to existing data types, but make it difficult to add new types of data values that are variations on existing types. In this paper we argue that a multiparadigm language, that permits both styles of development, provides the best of both worlds.
Action Language: a specification language for model checking reactive systems
Authors: Tevfik Bultan
Venue: Proceedings of the 22nd international conference on Software engineering (2000)

We present a specification language called Action Language for model checking software specifications. Action Language forms an interface between transition system models that a model checker generates and high level specification languages such as Statecharts, RSML and SCR&mdash;similar to an assembly language between a microprocessor and a programming language. We show that Action Language translations of Statecharts and SCR specifications are compact and they preserve the structure of the original specification. Action Language allows specification of both synchronous and asynchronous systems. It also supports modular specifications to enable compositional model checking.
High-Order Mixed Current Basis Functions for Electromagnetic Scattering of Curved Surfaces
Authors: Wei Cai
Venue: Journal of Scientific Computing (1999)

We construct high-order mixed current vector basis (unctions on an arbitrary curved surface which can be subdivided as a union of curved triangles and quadrilaterals. The objective is to construct vector basis (a) which consists of high-order polynomials of the surface parameterization variables on triangles and quadrilaterals, (b) part of the basis will have vanishing moments on the triangles and quadrilaterals. The first property will enable us to represent the current distribution over scatter surface with much less number of unknowns and larger patches of either triangular or quadrilateral shapes. The second property will achieve what wavelet basis does on an interval, but on a more general domain, namely, a sparse matrix representation for some integral operators.
On Interactive Object Shape Modeling Using Algebraic Curves
Authors: Zhibin Lei, David B. Cooper
Venue: Journal of VLSI Signal Processing Systems (1998)

Query By Sketch for indexing into an image database involves presenting the machine with a sketch of the object to be found in the database. The sketch can be of the object shape or distinct contours on the image of the object. This sketch can be made from memory, or can be refined interactively in response to what the database search returns at each iteration. Or the sketch can be made by generating curves of an object boundary or object-surface image-discontinuities from an example image. This paper introduces and describes a family of 2D curves (implicit polynomial curves) for this purpose, and an algorithm for generating a representation which passes within &epsiv; of a set of control points specified by the user. Control points can be placed at arbitrary locations and in arbitrary order, and can be erased by the user at will, in order to arrive at the desired shape representation. Level sets of the object potential field have been used to facilitate the interaction process. The fitting algorithm is formulated in the efficient Linear Programming (LP) framework. We illustrate the use of this method in the application of content-based image retrieval.
OPENET: an open and efficient control platform for ATM networks
Authors: Israel Cidon, Tony Hsiao, Asad Khamisy, Abhay Parekh, Raphael Rom, Moshe Sidi
Venue: Journal of High Speed Networks (2000)

ATM networks are currently moving from the experimental stage of test-beds to a commercial state where production networks are deployed and operated. The ATM Forum PNNI (Private Network to Network Interface) standard introduces an architecture suited for an internetwork which, in principle, can also be used as an intra-network nodal interface. However, the current PNNI falls short in providing an acceptable solution due to severe performance limitations in intra-network operation, limited functionality and the lack of open interfaces for functional extensions and services. OPENET is a common, open and high-performance network control platform based on performance and functional enhancements to the PNNI platform. It is designed to address the issues of interoperability (being vendor independent), scalability (in terms of network size and volume of calls), high performance (in terms of call processing latency and throughput) and functionality. OPENET is mainly an intra-networking extension to current PNNI. It is compatible with PNNI in the internetwork environment where large networks must be partitioned according to natural topological or organizational boundaries. The major novelty of the OPENET architecture (compared to the current PNNI) is its focus on network control performance. A particular emphasis is given to the increase of the overall rate of connection handling, to the reduction of the call establishment latency and to the efficient utilization of the network resources. These performance enhancements are achieved by the use of a native ATM distribution tree for the dissemination of utilization update, light-weight call setup, take down and modification signaling, the use of fast setup and takedown with the future option to implement them in hardware, and extensive use of caching and pre-calculation for route computation. OPENET also extends PNNI in terms of functionality. It utilizes a new signaling paradigm that better supports fast reservation and multicast services, a rich control communication infrastructure which enables the development of augmented services leveraging the existing functions, messaging system and information of the network control platform.