ppxscal/embedding_network huggingface dataset:
Polaris: A System for Query, Analysis and Visualization of Multi-Dimensional Relational Databases
Authors: Chris Stolte, Pat Hanrahan
Venue: Proceedings of the IEEE Symposium on Information Vizualization 2000 (2000)

In the last several years, large multi-dimensional databases have become common in a variety of applications such as data warehousing and scientific computing. Analysis and exploration tasks place significant demands on the interfaces to these databases. Because of the size of the data sets, dense graphical representations are more effective for exploration than spreadsheets and charts. Furthermore, because of the exploratory nature of the analysis, it must be possible for the analysts to change visualizations rapidly as they pursue a cycle involving first hypothesis and then experimentation.In this paper, we present Polaris, an interface for exploring large multi-dimensional databases that extends the well-known Pivot Table interface. The novel features of Polaris include an interface for constructing visual specifications of table-based graphical displays and the ability to generate a precise set of relational queries from the visual specifications. The visual specifications can be rapidly and incrementally developed, giving the analyst visual feedback as they construct complex queries and visualizations.
A Communication Staging Technique for Network Cache Interconnected Clusters
Authors: Amy W. Apon, Hsiang Ann Chen, Charlotte F. Fischer, Larry E. Wilbur
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

This work is an experimental investigation of a technique for staging communication between tasks of parallel applications in clusters that are interconnected with network cache architecture. With network cache a process can write broadcast data to a shared buffer on the NIC. This data is immediately broadcast on the network and available in shared buffers on the NIC's of all workstations. By using network cache as a large staging area for collective communications, the required number of data and synchronization messages is reduced and application performance is improved. A version of matrix-vector multiply in which the result vector is available to all processes at the end of the computation is implemented both using network cache and using traditional MPI messaging libraries. The implementations are compared experimentally, and results show that completion time is improved by several factors with network cache staging rather than the point-to-point implementation of MPI messaging libraries.
Elastic degradation and damage in concrete following nonlinear equations and loading function
Authors: M. H. F. M. Barros, C. M. Mota Soares, R. A. F. Martins
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

In the present work an elastic-degrading model is used in the analysis of concrete under three dimension states of stress. The non-linear behaviour is controlled by the equation defined in the CEB-FIP Model Code 1990 for axial compression. The initiation of damage in three dimension states of stress is controlled by the use of the Von Mises or the Drucker-Prager criteria.
The Use of Dense Stereo Range Data in Augmented Reality
Authors: Gaile Gordon, Mark Billinghurst, Melanie Bell, John Woodfill, Bill Kowalik, Alex Erendi, Janet Tilander
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

This paper describes an augmented reality system that incorporates a real-time dense stereo vision system. Analysis of range and intensity data is used to perform two functions: 1) 3D detection and tracking of the user's fingertip or a pen to provide natural 3D pointing gestures,and 2) computation of the 3D position and orientation of the user's viewpoint without the need for fiducial marks calibration procedures, or manual initialization. The paper describes the stereo depth camera, the algorithms developed for pointer tracking and camera pose tracking,and demonstrates their use within an application in the field of oil and gas exploration.
A logic for reasoning about time and reability
Authors: Hans Hansson, Bengt Jonsson
Venue:  (1990)

We present a logic for stating properties such as, "after a request for service there is at least a 98\045 probability that the service will be carried out within 2 seconds". The logic extends the temporal logic CTL by Emerson, Clarke and Sistla with time and probabil- ities. Formulas are interpreted over discrete time Markov chains. We give algorithms for checking that a given Markov chain satis- fies a formula in the logic. The algorithms require a polynomial number of arithmetic operations, in size of both the formula and\003This research report is a revised and extended version of a paper that has appeared under the title "A Framework for Reasoning about Time and Reliability" in the Proceeding of the 10thIEEE Real-time Systems Symposium, Santa Monica CA, December 1989. This work was partially supported by the Swedish Board for Technical Development (STU) as part of Esprit BRA Project SPEC, and by the Swedish Telecommunication Administration.1the Markov chain. A simple example is included to illustrate the algorithms.
Autonomous Filter Engine Based on Knowledge Acquisition from the Web
Authors: Luigi Lancieri, Pierre Agostini, Nicolas Saillard, Samuel Legouix
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

For a long time filtering data has been a very important matter. With the growth of Internet this question has become more and more pressing. Everyone knows that finding information is not always very easy, because of the large amount of data that the network contains. More generally, our concern here is not only to find what is interesting to download but also to avoid what is unsuitable. One of the different ways recently explored to address the question of filtering and rating information is to apply the studies done in the field of linguistic and artificial intelligence to the web. In this context, we would like to show that it is possible to build an easy going and low cost tool to compare information. This tool will use automatically extracted and selected Web contents to build a specialized knowledge database that can easily be adapted to any subject in any language.
Scheduled hot-potato routing
Authors: J. Naor, A. Orda, R. Rom
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

This paper is concerned with fast, hot-potato routing, performed according to a predetermined schedule. At each time period each node selects an outgoing link, through which an incoming packet is sent. No buffers are used. We investigate first the problem of how to route a network-wide demand of packets, given the predetermined schedule. We show that certain versions of the problem have efficient solutions, while other versions are intractable. We then consider the problem of finding an optimal schedule given a network-wide demand of packets. We indicate that the problem is tractable for either a single source or single destination. However for the multi-source multi-destination case we show that it is an NP-complete problem. The problem remains intractable even for a simple topology of nodes arranged on a bidirectional line. We present an efficient heuristic for directed tree-networks, and adapt it to general topologies through a recursive scheme, for which an efficient performance bound is shown.
Towards Megaprogramming
Authors: Gio Wiederhold, Peter Wegner, Stefano Ceri
Venue:  (1990)

Our goal in this paper is to develop an architecture and methodology for megaprogramming. We define {\em megaprogramming} as programming with very large modules called {\em megamodules} that capture the functionality of systems such as those used by banks, airline reservation systems, and city transportation systems. Megamodules are internally homogeneous, independently maintained systems whose life cycle is managed by a software community with its own goals, knowledge base, and programming traditions. We use the term `ontology'' to denote the declared entities that may meaningfully be used within a megamodule and their internal operations. A problem to be dealt with is the interaction of ontologies. Computations using megamodules are described by {\em megaprograms,} written in a {\em megaprogramming language.} We are concerned with interfaces of individual megamodules and with the megaprogramming language for megamodule management. Each megamodule must describe its externally accessible data structures and operations; descriptions are stored in libraries, called megamodule repositories, that have certain data dictionary facilities. Megaprogramming languages provide more flexible module management than traditional methods of combining modules, and in particular may perform transduction between modules on a variety of computer systems. Modules will have different data representations. Databases may be supported within megamodules with complete autonomy. They are not directly accessed by megaprograms. Some megamodules may share databases and use their facilities to resolve conflicts due to concurrent access. Input-output for human clients is generally performed by specialized modules. Megaprogramming allows us to think in terms of larger abstractions than traditional programming, and is a form of component-based programming in the large. It has the potential of substantially increasing modeling power and software productivity because its powerful encapsulation allows very large software systems to be managed as collections of megamodules. Programming within a megamodule can be handled by traditional techniques for programming, while interaction of megamodules is governed by megaprogramming protocols.
Robust Characterizations of Polynomials and Their Applications to Program Testing
Authors: Ronitt Rubinfeld, Madhu Sudan
Venue:  (1993)

The study of self-testing and self-correcting programs leads to the search for robust characterizations of functions. Here we make this notion precise and show such a characterization for polynomials. From this characterization, we get the following three applications: First, we can construct simple and efficient self-testers for polynomial functions. Secondly, it provides results in the area of coding theory, by giving extremely fast and efficient error-detecting schemes for some well known codes. Thirdly, this error-detection scheme plays a crucial role in recent results on hardness of approximating some NP-optimization problems.
Parallel DaSSF Discrete-Event Simulation without Shared Memory
Authors: James D. Chalfant
Venue:  (1999)

The Dartmouth implementation of the Scalable Simulation Framework (DaSSF) is a discrete-event simulator used primarily in the simulation of networks. It achieves high performance through parallel processing. DaSSF 1.22 requires shared memory between all processors in order to operate. This limits the number of processors available and the hardware platforms that can exploit parallelism. We are interested in extending parallel DaSSF operation to architectures without shared memory. We explore the requirements of this by implementing parallel DaSSF using MPI as the sole form of interaction between processors. The approaches used to achieve this can be abstracted and applied to the current version of DaSSF. This would allow parallel simulation using shared memory by processors within a single machine, and also at a higher level between separate machines using distributed memory. 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
Deferred Compilation: The Automation of Run-Time Code Generation
Authors: Mark Leone, Peter Lee
Venue:  (1993)

This paper describes deferred compilation, an alternative and complement to compile-time program analysis and optimization. By deferring aspects of compilation to run time, exact information about programs can be exploited, leading to greater opportunities for code improvement. This is in contrast to the use of static analyses, which are inherently conservative. Deferred compilation automates the translation of ordinary programs into native machine code that performs fast optimization and native-code generation at run time. Automation is obtained through the use of a compile-time staging analysis, which determines the portions of a program that may be safely and profitably compiled at run time. Fast run-time optimization is obtained by trading space for time: compile-time specialization yields numerous run-time code generators, each customized to optimize a small portion of the source program based on run-time information. Implementation strategies developed for a prototype compiler are discussed, and the results of preliminary experiments demonstrating significant overall speedup are presented.
Deterministic Computations Whose Hisrtory is Independent of the Order of Updating
Authors: Peter Gacs
Venue:  (1995)

Abstract Consider a network of processors (sites) in which each site has finitely many neighbors. Each site has some transition function computing its next state from the states of the neighbors. These transitions (updates) are applied in arbitrary order, one or many at a time. If the state of site x at time t is r(x,t) then let us define the sequence r''(x,0),r''(x,1),... by taking the sequence r(x,0),r(x,1),... and deleting each repetition, i.e. each element equal to the preceding one. The system of transition functions is said to support asynchrony if the sequence r''(x,i), (while it lasts, in case it is finite) depends only on the initial configuration, not on the order of updates. This paper gives a simple characterization of transition functions supporting asynchrony. The characterization says that it is equivalent to the following seemingly weaker commutativity condition: For any configuration, for any pair x,y of neighbors, if the updating would change both s(x) and s(y) then the result of updating first x and then y is be the same as the result of doing this in the reverse order.
Integrating Trust into Grid Resource Management Systems
Authors: Farag Azzedin, Muthucumaru Maheswaran
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

Grid computing systems that have been the focus of much research activities in recent years provide a virtual framework for controlled sharing of resources across institutional boundaries. Security is one major concern in any system that enables remote execution. Several techniques can be used for providing security in Grid systems including sandboxing, encryption, and other access control and authentication mechanisms. The additional overhead caused by these mechanisms may negate the performance advantages gained by Grid computing. Hence, we contend that it is essential for the scheduler to consider the security implications while performing resource allocations. In this paper, we present a trust model for Grid systems and show how the model can be used to incorporate the securityimplications into scheduling algorithms. Three scheduling heuristics that can be used in a Grid system are modified to incorporate the trust notion and simulations are performed to evaluate the performance.
Throughput of Existing Multiprocessor File Systems (An Informal Study)
Authors: David Kotz
Venue:  (1993)

Fast file systems are critical for high-performance scientific computing, since many scientific applications have tremendous I/O requirements. Many parallel supercomputers have only recently obtained fully parallel I/O architectures and file systems, which are necessary for scalable I/O performance. Scalability aside, I show here that many systems lack sufficient absolute performance. I do this by surveying the performance reported in the literature, summarized in an informal table.
Augmented Chemistry: An Interactive Educational Workbench
Authors: Morten Fjeld, Benedikt M. Voegtli
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

This system paper reports on some of the advantages tangible interaction can bring to chemistry education. The paper describes the realisation of an in-house designed Tangible User Interface (TUI) called Augmented Chemistry (AC). A set of interactive tools work within this system. Using these tools, elements can be chosen from a booklet menu and composed into 3D molecular models. The tools indicate one way towards realising a seamless integrationof the physical and digital realms. Since many tools can be used concurrently, single and multiple users can interact with the system at a time. To use the system in an educational context, it was extended into an educational workbench drawing on haptic and aural augmentation. The design and implementation of the AC system required contributions from optics, mathematics, molecular chemistry, software engineering, and 3D programming, making it a truly interdisciplinary project. Future challenges lie in user acceptance, educational effect, and further system development.
Technology Impact on Dependability Requirements
Authors: David Kiang
Venue: Proceedings of the 3rd International Software Engineering Standards Symposium (ISESS '97) (1997)

This paper presents the research findings concerning the changing dependability requirements for electronic products and services. It provides new thrusts for Dependability standards development. The work done is under the auspices of the IEC/TC56 Dependability: Strategic Advisory Group-Task Force on Technology. The study focuses on the dynamic shift in the telecommunications business environment driven by rapid technology evolution and market diversity. The issues pertaining to new approaches for Dependability methodology development are discussed. Industry needs for new Dependability standards to facilitate international trades are highlighted. 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
Syntactic Fault Patterns in OO Programs
Authors: Roger T. Alexander, Jeff Offutt, James M. Bieman
Venue: Proceedings of the Eighth International Conference on Engineering of Complex Computer Systems (2002)

Although program faults are widely studied, there aremany aspects of faults that we still do not understand, particularlyabout OO software. In addition to the simple factthat one important goal during testing is to cause failuresand thereby detect faults, a full understanding of the characteristicsof faults is crucial to several research areas. Thepower that inheritance and polymorphism brings to the expressivenessof programming languages also brings a numberof new anomalies and fault types. In prior work wepresented a fault model for the appearance and realizationof OO faults that are specific to the use of inheritance andpolymorphism. Many of these faults cannot appear unlesscertain syntactic patterns are used. The patterns are basedon language constructs, such as overriding methods thatdirectly define inherited state variables and non-inheritedmethods that call inherited methods. If one of these syntacticpatterns is used, then we say the software contains ananomaly and possibly a fault. This paper describes the syntacticpatterns for each OO fault type. These syntactic patternscan potentially be found with an automatic tool. Thus,faults can be uncovered and removed early in development.
Virtual but Visible Software
Venue: Proceedings of the International Conference on Information Visualisation (2000)

The problem of trying to view and comprehend large amounts of data is a well-known one. A specialized version of this problem, that of visualizing program code, (often known as software visualization) has suffered from the field refusing to embrace new ideas and technologies. This paper presents an application of virtual reality to this problem and highlights areas of importance from virtual reality that have been used to good effect when creating graphical abstractions of Java source code. A summary of the achievements of this approach and the relationship to the virtual reality features believed to be most beneficial is provided.
On New Forms of the Ergodic Theorem
Authors: V. V. Kozlov, D. V. Treschev
Venue: Journal of Dynamical and Control Systems (2003)

We present generalizations of the classical Birkhoff and von Neumann ergodic theorems, where the time average is replaced by a more general average, including some density.
Global convergence of nonmonotone descent methods for unconstrained optimization problems
Authors: Wenyu Sun, Jiye Han, Jie Sun
Venue: Journal of Computational and Applied Mathematics (2002)

Global convergence results are established for unconstrained optimization algorithms that utilize a nonmonotone line search procedure. This procedure allows the user to specify a flexible forcing function and includes the nonmonotone Armijo rule, the nonmonotone Goldstein rule, and the nonmonotone Wolfe rule as special cases.
Interval Methods and Fuzzy Optimization
Authors: W. A Lodwick, K. D. Jamison
Venue:  (1996)

In this paper we develop methods to solve constrained fuzzy minimization problems for a class of fuzzy functions by using interval methods. The class of fuzzy functions we consider for the minimization problems is the set of rea-valued functions where one or more parameters/coefficients are fuzzy numbers. The fucus of this research is to explore some relationsips between fuzzy set theory and interval analysis as it relates to optimization problems.
Development of research networking in Africa: the point of view of the RINAF technical support unit established in Pisa
Authors: Laura Abba, Abraham Gebrehiwot, Adriana Lazzaroni, Stefano Trumpy
Venue:  (1998)

The RINAF (Regional Informatics Network for Africa) project, conceived by UNESCOs Intergovernmental Informatics Programme (IIP) in 1989 and mainly financed by the Italian Government, is aimed at supporting the interconnection of academic and research institutions within Africa and to the international research community through the provision of computer equipment, basic network services and training activities. Starting from a description of the project status, this paper gives an evaluation of the changing network environment in Africa and of its impact, providing some remarks on the set up of an independent African management capacity for research networks.
Stiffness of ODEs
Authors: Desmond J. Higham, Lloyd N. Trefethen
Venue:  (1992)

It is argued that even for a linear system of ODEs with constant coefficients, stiffness cannot properly be characterized in terms of the eigenvalues of the Jacobian, because stiffness is a transient phenomenon whereas the significance of eigenvalues is asymptotic. Recent theory from the numerical solution of PDEs is adapted to show that a more appropriate characterization of stiffness can be based upon pseudospectra instead of spectra. Numerical experiments with an adaptive ODE solver illustrate these findings.