ppxscal/embedding_network huggingface dataset:
On reducing the processing cost of on-demand QoS path computation
Authors: George Apostolopoulos, Roch Guérin, Sanjay Kamat, Satish K. Tripathi
Venue: Journal of High Speed Networks (1998)

Quality of Service (QoS) routing algorithms have become the focus of recent research due to their potential for increasing the utilization of an Integrated Services Packet Network (ISPN) serving requests with QoS requirements. While heuristics for determining paths for such requests have been formulated for a variety of QoS models, little attention has been given to the overall processing complexity of the QoS routing protocol. This paper deals with the processing complexity of determining QoS paths in link state based routing architectures. Although on-demand path computation is very attractive due to its simplicity, many believe that its processing cost will be prohibitive in environments with high request rates. In this work, we first characterize the processing cost of QoS routing algorithms that use the widest-shortest path heuristic. Then we study alternatives to on-demand path computation that can reduce this processing overhead. In addition to the well known solution of path pre-computation, we introduce and study path caching, an incremental modification of on-demand path computation. By simulating realistic topologies and traffic conditions we investigate the performance of both alternatives. Our results show that caching is an effective alternative to path pre-computation and that both path caching and pre-computation can achieve significant processing cost savings without severely compromising routing performance.
A unified sequence-structure classification of protein sequences: combining sequence and structure in a map of the protein space
Authors: Golan Yona, Michael Levitt
Venue: Proceedings of the fourth annual international conference on Computational molecular biology (2000)

We analyze all known protein sequences in search for a global map of protein space that is consistent in terms of both sequence and structure. Our goal is to define clusters of homologous protein domains, beyond those detected by sequence-based methods alone, and then to build a three-dimensional (3D) model for each of the sequences that are homologous to sequences of known 3D structure. This analysis uses both sequence and structure based metrics in the analysis of all protein sequences in a non-redundant (NR) database, comprising all major sequence databases. The analysis starts from the sequences of the SCOP database domains, which have known three-dimensional structures These sequences are clustered first into families based on sequence similarity alone, without incorporating any information from the SCOP classification. Each sequence-based family is represented by a profile, and this profile is used to search the NR database, using PSI-BLAST. Since PSI-BLAST can lead to false similarities, several different indices of validity are used to control the procedure Each of the detected sequences is marked and a profile is built for the whole cluster of similar sequences. A 3D model is then built for each sequence in the cluster using an alignment made using the profile as well as the known structures of the SCOP representatives in the cluster Clusters based on SCOP domains are called type-I clusters In all we find 1421 type-I clusters with total of 168,431 sequences (44.5% of our NR database) After all members of type-I clusters have been marked, we analyze the remaining sequences. The PSI-BLAST procedure is applied repeatedly, each time with a different query, to search what is left over from the previous run. This give type-II clusters, which may overlap. Type-I and type-II clusters are then grouped using higher level measures of similarity. Those pairs of clusters that contain the same common protein (significant overlap in membership), are marked first. The pairs of clusters are then compared using either a structure metric (when 3D structures are known) or a novel sequence profile metric, and clustered into superfamilies and &ldquo;fold&rdquo; families. This analysis avoids the limitation of classifications that are based just on sequence comparison, and allows us to construct a 3D model for a substantial portion of the sequences in the NR database.
Dot com versus bricks and mortar &mdash; the impact of portal technology (invited presentation) (abstract only)
Authors: Chris Horn
Venue: Proceedings of the 22nd international conference on Software engineering (2000)

The &ldquo;New Economy is rapidly being adopted on a global scale as corporations vie for new competitive positions and defensive responses. Incumbents&rdquo; so-called &ldquo;bricks'n'mortar corporations&rdquo; are generally finding it challenging, but usually rewarding, to extend their business practices to the internet. New entrants&rdquo; so-called &ldquo;Dot Com companies&rdquo; are unfettered from institutional rigidity and thus have an enormous opportunity to gain market share, but at the same time are frequently challenged to provide the same levels of brand awareness, product and service as at least some of the incumbents. In this presentation we consider how internet infrastructure software is evolving, and its implications for both brick'n'mortar and dot com organisations.
An Adaptive Grid Method and Its Application to Steady Euler Flow Calculations
Authors: Feng Liu, Shanhong Ji, Guojun Liao
Venue: SIAM Journal on Scientific Computing (1999)

An adaptive remeshing procedure based on a cell volume deformation method is presented. Starting with an initial grid, this method offers direct cell volume control through the specification of the transformation Jacobian. Grid points are moved with appropriate grid velocities so that the specified cell volume distribution can be achieved at the end of the grid movement without adding or removing grid points. The grid velocities are determined by solving a scalar Poisson equation. This method is applied to solving the compressible Euler equations. Computational test cases of transonic flow over an airfoil are presented and demonstrate the desired control of grid sizes across shock waves.
Improving coverage analysis and test generation for large designs
Authors: Jules P. Bergmann, Mark A. Horowitz
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

State space techniques have proven to be useful for measuring and improving the coverage of test vectors that are used during functional validation via simulation. By comparing the state and edge coverage provided by tests with that which is possible in the design's state graph, the designer can estimate how well tested the design is and identify areas that need better testing. Unfortunately, for many interesting designs, the full state graph may be too large to fully explore, or if it is explorable, the resulting coverage may be so low as to provide limited feedback. Several techniques have been proposed that identify and work with an interesting subset of the design's state machines, but they still require computing the full state graph before projecting it. In this paper we discuss projection directed state exploration, in which a projection from the full graph is found while exploring only the relevant portion of the full graph. Even with this limited exploration, BDD size blowup is still a problem. To deal with this, we have also developed several interactive tools that provide feedback to the designer, and allow them to add hints to help with the exploration.
Integration of the Scan-Test Method into an Architecture Specific Core-Test Approach
Authors: Chris Feige, Jan Ten Pierick, Clemens Wouters, Ronald Tangelder, Hans G. Kerkhoff
Venue: Journal of Electronic Testing: Theory and Applications (1999)

In this paper a concept is proposed to combine a bus-transfer based test approach (AMBA) with the well-known scan-test technique. This novel approach combines the advantages of modularity and core reuse (AMBA) with the benefits of high fault coverages and short time-to-market cycles (scan). The consequences with respect to test hardware implementation and tool flow are discussed.
Selectively estimation for Boolean queries
Authors: Zhiyuan Chen, Nick Koudas, Flip Korn, S. Muthukrishnan
Venue: Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2000)

In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an increasing need to quickly and reliably estimate the number of strings (tuples, documents, etc.) matching a Boolean query. Boolean queries in this context consist of substring predicates composed using Boolean operators. While there has been some work in estimating the selectivity of substring queries, the more general problem of estimating the selectivity of Boolean queries over substring predicates has not been studied.Our approach is to extract selectivity estimates from relationships between the substring predicates of the Boolean query. However, storing the correlation between all possible predicates in order to provide an exact answer to such predicates is clearly infeasible, as there is a super-exponential number of possible combinations of these predicates. Instead, our novel idea is to capture correlations in a space-efficient but approximate manner. We employ a Monte Carlo technique called set hashing to succinctly represent the set of strings containing a given substring as a signature vector of hash values. Correlations among substring predicates can then be generated on-the-fly by operating on these signatures.We formalize our approach and propose an algorithm for estimating the selectivity of any Boolean query using the signatures of its substring predicates. We then experimentally demonstrate the superiority of our approach over a straight-forward approach based on the independence assumption wherein correlations are not explicitly captured.
Linux: shells by example
Authors: Ellie Quigley
Venue: Prentice Hall Ptr Open Source Technology Series (2000)

The complete hands-on guide to bash and tsch-PLUS grep, sed, and gawk!Learn Linux shell programming hands-on!gawk in-depth! Pattern scanning, text filtering, reporting, and more!By best-selling author Ellie Quigley, Silicon Valley's #1 shell programming instructor!One book is all you need to learn Linux shell programming! Linux Shells by Example is your complete, step-by-step guide to both essential Linux shells-bash and tcsh-and three essential Linux shell programming utilities, grep, sed and gawk. Ellie Quigley-Silicon Valley's top shell programming instructor-starts from scratch and gets you all the way to expert-level techniques! Through hundreds of classroom-proven examples, you'll learn what Linux shells are, what they do, and exactly how they integrate with other Linux utilities and processes. Master creating, running, and debugging shell scripts using grep, sed, gawk, and a whole lot more.bash and tcsh: how they compare, and when to use eachgawk in depth: pattern scanning, text filtering, reporting, and other key applicationsDetailed syntax listings, comparison charts, essential information on Linux utilities, and moreWhether you're a system administrator, application developer or power user, Linux Shells by Example is the most convenient, cost-effective way to learn Linux shell programming!Companion CD-ROM contains all of the source code and datafiles from the book.
Support for garbage collection at every instruction in a Java compiler
Authors: James M. Stichnoth, Guei-Yuan Lueh, Michał Cierniak
Venue: Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation (1999)

A high-performance implementation of a Java Virtual Machine1 requires a compiler to translate Java bytecodes into native instructions, as well as an advanced garbage collector (e.g., copying or generational). When the Java heap is exhausted and the garbage collector executes, the compiler must report to the garbage collector all live object references contained in physical registers and stack locations. Typical compilers only allow certain instructions (e.g., call instructions and backward branches) to be GC-safe; if GC happens at some other instruction, the compiler may need to advance execution to the next GC-safe point. Until now, no one has ever attempted to make every compiler-generated instruction GC-safe, due to the perception that recording this information would require too much space. This kind of support could improve the GC performance in multithreaded applications. We show how to use simple compression techniques to reduce the size of the GC map to about 20% of the generated code size, a result that is competitive with the best previously published results. In addition, we extend the work of Agesen, Detlefs, and Moss, regarding the so-called "JSR Problem" (the single exception to Java's type safety property), in a way that eliminates the need for extra runtime overhead in the generated code.
Compiler Techniques for the Superthreaded Architectures
Authors: Jenn-Yuan Tsai, Zhenzhen Jiang, Pen-Chung Yew
Venue: International Journal of Parallel Programming (1999)

Several useful compiler and program transformation techniques for the superthreaded architectures are presented in this paper. The superthreaded architecture adopts a thread pipelining execution model to facilitate runtime data dependence checking between threads, and to maximize thread overlap to enhance concurrency. In this paper, we present some important program transformation techniques to facilitate concurrent execution among threads, and to manage critical system resources such as the memory buffers effectively. We evaluate the effectiveness of those program transformation techniques by applying them manually on several benchmark programs, and using a trace-driven, cycle-by-cycle superthreaded processor simulator. The simulation results show that a superthreaded processor can achieve promising speedup for most of the benchmark programs.
Inferring intent in eye-based interfaces: tracing eye movements with process models
Authors: Dario D. Salvucci
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

While current eye-based interfaces offer enormous potential for efficient human-computer interaction, they also manifest the difficulty of inferring intent from user eye movements. This paper describes how fixation tracing facilitates the interpretation of eye movements and improves the flexibility and usability of eye-based interfaces. Fixation tracing uses hidden Markov models to map user actions to the sequential predictions of a cognitive process model. In a study of eye typing, results show that fixation tracing generates significantly more accurate interpretations than simpler methods and allows for more flexibility in designing usable interfaces. Implications for future research in eye-based interfaces and multimodal interfaces are discussed.
Built-in Self Test Based on Multiple On-Chip Signature Checking
Authors: Mohammed Fadle Abdulla, C. P. Ravikumar, Anshul Kumar
Venue: Journal of Electronic Testing: Theory and Applications (1999)

We propose an improved BIST architecture which supports on-chip comparison of signatures at no significant increase in area. The proposed test architecture reduces detection latency and eliminates the lengthy scan-out phase from each test session by allowing testing and on-chip signature comparison of multiple intermediate signatures to occur concurrently. The work is based on a novel procedure to implement the multiple on-chip signature checking. We show that such a test method gives significant improvements in test application time and aliasing probability. This paper also presented two techniques to minimize the test area overhead with a very small test time overhead compare to the conventional schemes. These techniques resulted in up to 80% savings in test area overhead for some High-level synthesis benchmark circuits. This paper also presents an aliasing analysis of the proposed scheme.
On Herbrand semantics and conflict serializability of read-write transactions (extended abstract)
Authors: Jens Lechtenbörger, Gottfried Vossen
Venue: Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2000)

The quest for unified correctness criteria in database concurrency control is addressed from a new perspective. A family of Herbrand semantics is presented, where each semantics provides an interpretation for operations in the read-write model of transactions. Using commutativity arguments, each semantics leads to a notion of conflict, which then gives rise to distinct classes of serializable schedules. Surprisingly, the classical notion of serializability with respect to two of these sematics, update-in-place and deferred-update semantics, already embodies a unified correctness criterion; moreover, prefix-closed variants of it allow for a higher degree of transaction parallelism than, for example, prefix-reducibility. Finally, it is shown that previous criteria may permit undesirable schedules, which are ruled out by a stronger notion of serializability that captures all intuitively correct schedules, but is incomparable to prefix-reducibility and the classes of schedules recognized by optimistic protocols.
A study of user behavior in an immersive virtual environment for digital libraries
Authors: Fernando A. Das Neves, Edward A. Fox
Venue: Proceedings of the fifth ACM conference on Digital libraries (2000)

In this paper we present a 2x3 factorial design study evaluating the limits and differences on the behavior of 10 users when searching in a virtual reality representation that mimics the arrangement of a traditional library. The focus of this study was the effect of clustering techniques and query highlighting on search strategy users develop in the virtual environment, and whether position or spatial arrangement influenced user behavior. We found several particularities that can be attributed to the differences in the VR environment.This study's results identify: 1) the need of co-designing both spatial arrangement and interaction method; 2) adifficulty novice users faced when using clusters to identify commontopics; 3) the influence of position and distance on users' selection of collection items to inspect; and 4) that users did not search until found the best match, but only until they found a satisfactory match.
An autostereoscopic display
Authors: Ken Perlin, Salvatore Paxia, Joel S. Kollin
Venue: Proceedings of the 27th annual conference on Computer graphics and interactive techniques (2000)

We present a display device which solves a long-standing problem: to give a true stereoscopic view of simulated objects, without artifacts, to a single unencumbered observer, while allowing the observer to freely change position and head rotation. Based on a novel combination of temporal and spatial multiplexing, this technique will enable artifact-free stereo to become a standard feature of display screens, without requiring the use of special eyewear. The availability of this technology may significantly impact CAD and CHI applications, as well as entertainment graphics. The underlying algorithms and system architecture are described, as well as hardware and software aspects of the implementation.
Java 2D graphics
Authors: Jonathan Knudsen
Venue: O'Reilly Java Series (1999)

One weakness of Java has been its graphics capabilities. Java 1.0 and 1.1 only included simple primitives for line drawing: lines could only be one pixel wide, they could only be solid, and there wasn't any good way to draw curves. Font management and color management were also weak. Java 2D (collectively called the "2D API") signals a major improvement in Java's graphics capabilities. It covers many of the classes in Java 1.2 that address graphics handling and improves on many weaknesses that were present in the previous versions of Java. The 2D API allows you to produce high-quality, professional images on a screen or printer. Java 2D Graphics describes the 2D API from top to bottom, demonstrating how to set line styles and pattern fills as well as more advanced techniques of image processing and font handling. You'll see how to create and manipulate the three types of graphics objects: shapes, text, and images. Other topics include image data storage, color management, font glyphs, and printing. Java 2D Graphics assumes no prior knowledge of graphics. Chock full of detailed explanations and examples, this book provides beginning Java programmers with a solid foundation in 2D graphics and helps more advanced programmers create and use high-quality images in their applications. Topics covered in the book include: The rendering pipelineShapes and pathsGeometryPainting with solid colors, gradients, and texturesStroking paths, including dashed linesTransformations: translation, rotation, shearing, and scalingAlpha compositingClippingRasterizing and antialiasingFonts and textFont metricsGlyphsColors and color spacessRGB and CIEXYZICC color profilesImages, image color models, and image dataImage processingImage data storageGraphics devicesPrinting
An Infinite Family of 3-Designs from Preparata Codes overZ_4
Authors: Tor Helleseth, P. Vijay Kumar, Kyeongcheol Yang
Venue: Designs, Codes and Cryptography (1998)

We show that the support of minimum Lee weight codewords having Hamming weight 5 in the Preparata code over Z_4 form a 3-(2^m,5,10) design for any odd integer m \geq 3.
Searchlight and Doppler effects in the visualization of special relativity: a corrected derivation of the transformation of radiance
Authors: Daniel Weiskopf, Ute Kraus, Hanns Ruder
Venue: ACM Transactions on Graphics (TOG) (1999)

We demonstrate that a photo-realistic image of a rapidly moving object is dominated by the searchlight and Doppler effects. Using a photon-counting technique, we derive expressions for the relativistic transformation of radiance. We show how to incorportate the Doppler and searchlight effects in the two common techniques of special relativistic visualization, namely ray tracing and polygon rendering. Most authors consider geometrical appearance only and neglect relativistic effects on the lighting model. Chang et al. [1996] present an incorrect derivation of the searchlight effect, which we compare to our results. Some examples are given to show the results of image synthesis with relativistic effects taken into account.
Estimating tessellation parameter intervals for rational curves and surfaces
Authors: Jianmin Zheng, Thomas W. Sederberg
Venue: ACM Transactions on Graphics (TOG) (2000)

This paper presents a method for determining a priori a constant parameter interval for tessellating a rational curve or surface such that the deviation of the curve or surface from its piecewise linear approximation is within a specified tolerance. The parameter interval is estimated based on information about second-order derivatives in the homogeneous coordinates, instead of using affine coordinates directly. This new step size can be found with roughly the same amount of computation as the step size in Cheng [1992], though it can be proven to always be larger than Cheng's step size. In fact, numerical experiments show the new step is typically orders of magnitude larger than the step size in Cheng [1992]. Furthermore, for rational cubic and quartic curves, the new step size is generally twice as large as the step size found by computing bounds on the Bernstein polynomial coefficients of the second derivatives function.