ppxscal/embedding_network huggingface dataset:
Simulated Site Visits
Authors: Clare Newton
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

Architectural designs are translated into buildings using the documentation language. Gaps invariably exist between what is documented and what is built. Once a building is complete, its construction is largely concealed and it becomes difficult to compare the drawn details with the built details. This difficulty is compounded by the abstract nature of traditional architects' orthographic drawings.A multimedia relational database titled ÔSimulated Site Visits' (SSV), developed by Clare Newton and Jonathan Finkelstein at the University of Melbourne, records the process of constructing buildings. The structure and layout of SSV facilitates comparisons across media and helps to shift the focus onto the connections and gaps between a building and its representation.The development of SSV has been funded because of its potential as a teaching aid for architecture and building students. This paper will outline teaching implications of this form of multimedia intertwined with a discussion of the research potential. 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
On Integrating Visualization Techniques for Effective Software Exploration
Authors: M.-A. D. Storey, K. Wong, F. D. Fracchia, H. A. Mueller
Venue: Proceedings of the 1997 IEEE Symposium on Information Visualization (InfoVis '97) (1997)

This paper describes the SHriMP visualization technique for seamlessly exploring software structure and browsing source code, with a focus on effectively assisting hybrid program comprehension strategies. The technique integrates both pan+zoom and fisheye-view visualization approaches for exploring a nested graph view of software structure. The fisheye-view approach handles multiple focal points, which are necessary when examining several subsystems and their mutual interconnections. Source code is presented by embedding code fragments within the nodes of the nested graph. Finer connections among these fragments are represented by a network that is navigated using a hypertext link-following metaphor. SHriMP combines this hypertext metaphor with animated panning and zooming motions over the nested graph to provide continuous orientation and contextual cues for the user. The SHriMP tool is currently being evaluated in several user studies. Observations of users performing program understanding tasks with the tool are discussed.
An O(lg n) Expected Rounds Probabilistic Byzantine Generals Algorithm (The Bigger They Are, The Harder They Fall)
Authors: Gabriel Bracha
Venue:  (1984)

Byzantine Generals algorithms enable processes to reliably broadcast messages in a system of $n$ processes where up to $t$ of the processes may be faulty. The algorithms are conducted in synchronous rounds of message exchange. For a system where $n = (3 + \delta)t$ we prove the existence of a randomized algorithm whose expected number of rounds is $O(lg n)$. This is an improvement on the lower bound of $t + 1$ rounds required for deterministic algorithms and on the previous result of $t/lg n$ expected number of rounds for randomized algorithms.
Simulation Using Code-Perturbation: Black- and White-Box Approach
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

This paper presents a new approach in simulation-base hardware verification, which uses application programs as the test inputs. The approach perturbs the program-control-flow during the simulation to exhaust all branching possibilities in a verification program. It keeps the structure of the verification program at code-segment level and takes a significantly less time than that the straightforward simulation approach does. This approach can be further classified into two categories: the black-box approach and the white-box approach. The black-box approach can be applied to a wide range of programs. It is a cost-efficient method for verifying the integrated model of the hardware/software systems. On the other hand, the white-box approach can be used to retain the correct software state (the hardware state seen by the software) during a simulation. 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
A survey of computational steering environments
Authors: Jurriaan D. Mulder, Jarke J. Wijk, Robert Liere
Venue:  (1998)

Computational steering is a powerful concept that allows scientists to interactively control a computational process during its execution. In this paper, a survey of computational steering environments for the on-line steering of ongoing scientific and engineering simulations is presented. These environments can be used to create steerable applications for model exploration, algorithm experimentation, or performance optimization. For each environment the scope is identified, the architecture is summarized, and the concepts of the user interface is described. The environments are compared and conclusions and future research issues are given.
On Performance Metrics for IP Multicast Routing
Authors: John D. Bansemer, Mohamed Y. Eltoweissy
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

Current research on multicast benchmarking has focused primarily on measuring the performance capabilities of multicast forwarding devices without thoroughly addressing the impact routing protocols may have on the device. We provide a performance metricstaxonomy for multicast routing protocols to augment current work. These metrics are based upon the activities that occur during the lifetime of a multicast group, namely, the creation and termination of a group, the distribution of group communications, and the modification of group membership. These activities impact various multicast entities including hosts, routers, links, and the larger network supporting the group. Performance is further influenced by groupcharacteristics including group size and the number of group senders. We discuss the dynamics of multicast systems, present a testing procedure for performance evaluation of multicast routing, and define metrics in three areas: latency, jitter, and bandwidth consumption.
A Transmission Availability Forecast Service for Internet Protocol Networks
Authors: William D. Blair, Rittwik Jana
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

One important characteristic of a network connection is the bandwidth available to clients using that connection. The available bandwidth is determined by a combination of physical link speeds and network congestion. This paper recognizes the explosion of interest in the use of Internet Protocol networks within the Australian Defense Organization and describes the development of a software tool for estimating the available bandwidth between a server and client in a distributed computing environment. We discuss the design and implementation details of the Transmission Availability Forecaster probe and present validation studies demonstrating its reliability and accuracy in the context of actual Internet conditions.
NEW RESULTS ON THE REALIZABILITY OF REYNOLDS STRESS TURBULENCE CLOSURES
Authors: Charles G. Speziale, Ridha Abid, Paul A. Durbin
Venue:  (1993)

The realizability of Reynolds stress models in homogeneous turbulence is critically assessed from a theoretical standpoint. It is proven that a well known second-order closure formulated by Shih and Lumley using the strong realizability constraints of Schumann is, in fact, not a realizable model. The problem arises from the failure to properly satisfy the necessary positive second time derivative constraint when a principal Reynolds stress vanishes -- a fatal flaw that becomes apparent when the non-analytic terms in their model are made single-valued as required on physical grounds. It is furthermore shown that the centrifugal acceleration generated by rotations of the principal axes of the Reynolds stress tensor can make the second derivative singular at the most extreme limits of realizable turbulence. This previously overlooked effect appears to make it impossible to identically satisfy the strong form of realizability in any version of the present generation of second-order closures. On the other hand, models properly formulated to satisfy the weak form of realizability -- wherein states of one or two component turbulence are not accessible in finite time -- are found to be realizable. However, unlike the simpler and more commonly used second-order closures, these models can be ill-behaved near the extreme limits of realizable turbulence due to the way that higher-degree nonlinearities are often unnecessarily introduced to satisfy realizability. Illustrative computations of homogeneous shear flows are presented to demonstrate these points which can have important implications for turbulence modeling.
Modeling the Random Parameters Effects in a Non-Split Model of Gate Oxide Short
Authors: M. Renovell, J. M. Gallière, F. Azaïs, Y. Bertrand
Venue: Journal of Electronic Testing: Theory and Applications (2003)

This paper presents a new model for gate-to-channel GOS defects. The transistors used in digital cell library are usually designed with a minimum-size. This new model permits to handle minimal-length transistors allowing the simulation of GOS defects in realistic digital circuits. Based on the electrical analysis of the defect behavior, a comprehensive method for the model construction is detailed. It is shown that the behavior of the proposed model matches in a satisfactory way the behavior of a defective transistor including the random parameters of the defect.
Gray Scale Image Compression Based on Multiple-Valued Input Binary Functions, Walsh and Reed-Muller Spectra
Authors: Bogdan J. Falkowski, Lip-San Lim
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

A new method for the lossless compression of gray scale images has been proposed. Coding of intensities is first applied to make the data more amenable for compression. A prediction process is performed followed by the mapping of prediction residuals. The prediction residuals are then split into bit planes to which the compression technique is applied. These bit planes can be coded as uncompressed, expressed as minterms or compressed using a variable block-size segmentation and coding. A dictionary of patterns is formed from simple multiple-valued input binary functions, basic Walsh, triangular, Reed-Muller weights and some frequently occurring patterns. Other compression methods used in our scheme include minterm coding; coordinate data coding, generalized k-Variable Mixed-Polarity Reed-Muller expansion and the reference row technique. The proposed scheme has been implemented in the C language and compared with other state-of-the-art techniques.
Undecidability and completeness results for process algebras with alternative quantification over data
Authors: Jan F Groote, S. P. Luttik
Venue:  (1998)

We define a class of process algebras with a generalised operation $\sum$ that allows explicit treatment of \emph{alternative quantification} over data, and investigate the specific subclass formed by the algebras of finite processes modulo strong bisimulation.
Dynamic Re-Encoding During MDD Minimization
Authors: Frank Schmiedle, Wolfgang Günther, Rolf Drechsler
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

Multi-valued decision diagrams (MDDs) are a generalization of binary decision diagrams (BDDs). They often allow efficient representation of functions with multi-valued input variables similar to BDDs in the binary case. Therefore they are suitable for several applications in synthesis and verification of integrated circuits. MDD sizes counted in number of nodes vary from linear to exponential dependent on the variable ordering used. In all these applications, minimization of MDDs is crucial.In many cases, multi-valued variables are composed by a certain number of binary variables, and so the multi-valued inputs arise by grouping binary variables. The selection of these groups, that is, the decision which variables to merge, has enormous impact on MDD sizes. Techniques for finding variable groupings before starting MDD minimization have been proposed recently.In this paper, we present a new method that uses re-encoding, i.e. dynamic variable grouping. We do not choose one fixed variable grouping before minimizing MDDs, but allow changing the binary variables to be considered together during the minimization process. This is possible since MDDs are simulated on top of BDDs. By this, the underlying binary variables remain accessible throughout the minimization process. This technique is described in detail and we show experimental results that demonstrate the efficiency of our approach.
On Effective IDDQ Testing of Low Voltage CMOS Circuits Using Leakage Control Techniques
Authors: Zhanping Chen, Liqiong Wei, Kaushik Roy
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

The use of low threshold devices in low voltage CMOS circuits leads to an exponential increase in the intrinsic leakage current. This threatens the effectiveness of IDDQ testing for such low voltage circuits because it is difficult to differentiate a defect-free circuit from defective circuits. Recently, several leakage control techniques have been proposed to reduce intrinsic leakage current, which may benefit IDDQ testing. In this paper we investigate the possibilities of applying different leakage control techniques to improve the fault coverage of IDDQ testing. Results on a large number of benchmarks indicate that dual threshold and vector control techniques are very effective in improving fault coverage for IDDQ testing.
Resource Manager for Globus-Based Wide-Area Cluster Computing
Authors: Yoshio Tanaka, Mitsuhisa Sato, Motonori Hirano, Hidemoto Nakada, Satoshi Sekiguchi
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

In this paper, we present a new type of Globus resource allocation manager (GRAM) called RMF (Resource Manager beyond the Firewall) for wide-area cluster computing. RMF manages computing resources such as cluster systems and enables utilization of them beyond the firewall in global computing environments. RMF consists of two basic modules, a remote job queuing system (Q system) and a resource allocator. The Q system is a remote job queuing system, which schedules jobs submitted from global computing sites. The resource allocator manages resources and allocates them for requested jobs. For communications beyond the firewall between job processes, we designed the Nexus Proxy, which relays TCP communication links beyond the firewall. RMF and the Nexus Proxy provide a global computing environment in which users can easily utilize such parallel systems as cluster systems and supercomputers beyond the firewall.
Adaptive Control Design and Analysis (Adaptive and Learning Systems for Signal Processing, Communications and Control Series)
Authors: Gang Tao
Venue:  (2003)

:"Today, adaptive control theory has grown to be a rigorous and mature discipline. As the advantages of adaptive systems for developing advanced applications grow apparent, adaptive control is becoming more popular in many fields of engineering and science. Using a simple, balanced, and harmonious style, this book provides a convenient introduction to the subject and improves one's understanding of adaptive control theory." As either a textbook or reference, this self-contained tutorial of adaptive control design and analysis is ideal for practicing engineers, researchers, and graduate students alike.
Variable Shunting for the WAM
Authors: Dan Sahlin, Mats Carlsson
Venue:  (1991)

This paper describes how to extend the garbage collection for WAM so that it will shunt chains of bound variables if possible. Doing so has two advantages: 1. Space is saved by making it possible to deallocate the intermediate cells. This is particularly useful when those cells are associated with frozen goals. 2. Later dereferencing is speeded up by not having to follow long variable chains. The main complication of this optimization is the treatment of the trailed variables. We claim that all possible chains of variables are shunted by this algorithm. The algorithm has been implemented in SICStus Prolog, and benchmark results are presented in this paper. The full source code for the shunting algorithm is given in this paper.
On Restrictions to Ensure Reproducible Behavior in Concurrent Programs
Authors: Fred B. Schneider, A. J. Bernstein
Venue:  (1979)

One of the major difficulties encountered when dealing with concurrent programs is that reproducible behavior may not be assumed. As a result, it is difficult to validate and debug such systems. In this paper, structural restrictions are presented that ensure that reproducible behavior will occur in concurrent programs. The application of this to system design is discussed. Keywords: time dependent behavior, concurrency, synchronization, monitors, Concurrent Pascal.
On the Number of Independent Sets in Bipartite Graphs with
Authors: Sapozhenko A.A.
Venue:  (2000)

The asymptotics of the independent set number is found for bipartite graphs which minimum degree is equal in order to the number of vertices.
An adaptive image reconstruction method
Authors: Michal Haindl
Venue:  (1995)

A new adaptive regression type of image destriping method is introduced to reconstruct missing lines in multispectral images. The method uses available information from the failed pixel surrounding due to spectral and spatial correlation of multispectral data. The reconstruction is based on two mutually competing adaptive regression models from which the locally optimal predictor is selected.
Algebraic proof systems over formulas
Authors: Dima Grigoriev, Edward A. Hirsch
Venue: Theoretical Computer Science (2003)

We introduce two algebraic propositional proof systems F-NS and F-PC. The main difference of our systems from (customary) Nullstellensatz and polynomial calculus is that the polynomials are represented as arbitrary formulas (rather than sums of monomials). Short proofs of Tseitin's tautologies in the constant-depth version of F-NS provide an exponential separation between this system and Polynomial Calculus.We prove that F-NS (and hence F-PC) polynomially simulates Frege systems, and that the constant-depth version of F-PC over finite field polynomially simulates constant-depth Frege systems with modular counting. We also present a short constant-depth F-PC (in fact, F-NS) proof of the propositional pigeon-hole principle. Finally, we introduce several extensions of our systems and pose numerous open questions.
The Hamlet Design Entry System: An Overview of ADL and its Environment
Authors: M. R. Steen, A. Dam, T. Vogel
Venue:  (1994)

The Hamlet Design Entry System: An Overview of ADL and its Environment Exploiting parallelism for industrial real-time applications has not received much attention compared to scientific applications. The available real-time design methods do not adequately address the issue of parallelism, resulting still in a strong need for low-level tools such as debuggers and monitors. This need illustrates that developing parallel real-time applications is indeed a difficult and tedious task. In this paper we show how problems can be alleviated if an approach is followed that allows for experimentation with designs and implementations. In particular, we discuss a development system that integrates design, implementation, execution, and analysis of real-time applications, putting emphasis on exploitation of parallelism. In the paper we primarily concentrate on the support for application *design*, as we feel that parallelism should essentially be addressed at this level. KEYWORDS: parallelism, real-time systems, application design, software development experimentation.
Implementing a Database Information System for an Electronic Baseball Scorecard
Authors: Tiffany M. Wong
Venue:  (2001)

We present our design and implementation of a database system of information storage and retrieval for an electronic baseball scorecard. The program uses the relational MySQL database to hold information and a Tcl API to handle interactions between the database and the user interface code. This paper discusses the inner workings of how information storage was broken down inside the database, how queries were internally constructed in accordance with the user''s input, and how statistics for players and teams were calculated and returned to the user. Finally, we discuss some limitations attached to our current implementation of the program and propose improvements that can be made in future versions. 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
3D Computer Graphics: A Mathematical Introduction with OpenGL
Authors: Samuel R. Buss
Venue:  (2003)

:This book is aimed at the advanced undergraduate level or introductory graduate level and can also be used for self-study. Prerequisites include basic knowledge of calculus and vectors. The OpenGL programming portions require knowledge of programming in C or C++. The more important features of OpenGL are covered in the book, but it is intended to be used in conjunction with another OpenGL programming book.
Two Algorithms for Performing Multidimensional, Multiprocessor, Out-of-Core FFTs
Authors: Lauren M. Baptist
Venue:  (1999)

We show two algorithms for computing multidimensional Fast Fourier Transforms (FFTs) on a multiprocessor system with distributed memory when problem sizes are so large that the data do not fit in the memory of the entire system. Instead, data reside on a parallel disk system and are brought into memory in sections. We use the Parallel Disk Model for implementation and analysis. The first method is a straightforward out-of-core variant of a well-known method for in-core, multidimensional FFTs. It performs 1-dimensional FFT computations on each dimension in turn. This method is easy to generalize to any number of dimensions, and it also readily permits the individual dimensions to be of any sizes that are integer powers of~2. The key step is an out-of-core transpose operation that places the data along each dimension into contiguous positions on the parallel disk system so that the data for the 1-dimensional FFTs are contiguous. The second method is an adaptation of another well-known method for in-core, multidimensional FFTs. This method computes all dimensions simultaneously. It is more difficult to generalize to arbitrary radices and number of dimensions in this method than in the first method. Our present implementation is therefore limited to two dimensions of equal size, that are again integer powers of~2. We present I/O complexity analyses for both methods as well as empirical results for a DEC~2100 server and an SGI Origin~2000, each of which has a parallel disk system. Our results indicate that the methods are comparable in speed in two-dimensions.