ppxscal/embedding_network huggingface dataset:
Interactive multi-pass programmable shading
Authors: Mark S. Peercy, Marc Olano, John Airey, P. Jeffrey Ungar
Venue: Proceedings of the 27th annual conference on Computer graphics and interactive techniques (2000)

Programmable shading is a common technique for production animation, but interactive programmable shading is not yet widely available. We support interactive programmable shading on virtually any 3D graphics hardware using a scene graph library on top of OpenGL. We treat the OpenGL architecture as a general SIMD computer, and translate the high-level shading description into OpenGL rendering passes. While our system uses OpenGL, the techniques described are applicable to any retained mode interface with appropriate extension mechanisms and hardware API with provisions for recirculating data through the graphics pipeline. We present two demonstrations of the method. The first is a constrained shading language that runs on graphics hardware supporting OpenGL 1.2 with a subset of the ARB imaging extensions. We remove the shading language constraints by minimally extending OpenGL. The key extensions are color range (supporting extended range and precision data types) and pixel texture (using framebuffer values as indices into texture maps). Our second demonstration is a renderer supporting the RenderMan Interface and RenderMan Shading Language on a software implementation of this extended OpenGL. For both languages, our compiler technology can take advantage of extensions and performance characteristics unique to any particular graphics hardware.
Preconditioning for the Steady-State Navier--Stokes Equations with Low Viscosity
Authors: Howard C. Elman
Venue: SIAM Journal on Scientific Computing (1999)

We introduce a preconditioner for the linearized Navier--Stokes equations that is effective when either the discretization mesh size or the viscosity approaches zero. For constant coefficient problems with periodic boundary conditions, we show that the preconditioning yields a system with a single eigenvalue equal to 1, so that performance is independent of both viscosity and mesh size. For other boundary conditions, we demonstrate empirically that convergence depends only mildly on these parameters and we give a partial analysis of this phenomenon. We also show that some expensive subsidiary computations required by the new method can be replaced by inexpensive approximate versions of these tasks based on iteration, with virtually no degradation of performance.
Proportional-share scheduling in single-server and multiple-server computing systems
Authors: D. H. J. Epema, J. F. C. M. de Jongh
Venue: ACM SIGMETRICS Performance Evaluation Review (1999)

Proportional Share Scheduling (PSS), which is the allocation of prespecified fractions of a certain resource to different classes of customers, has been studied both in the context of the allocation of network bandwidth and of processors. Much of this work has focused on systems with a single scheduler and when all classes of customers are constantly backlogged. We study the objectives and performance of PSS policies for processor scheduling when these conditions do not hold.
Improving academic software engineering projects: A comparative study of academic and industry projects
Authors: Pierre N. Robillard, Martin Robillard
Venue: Annals of Software Engineering (1999)

A project course in software engineering is often part of the curriculum in computer engineering or computer science. This paper studies the relationship between academic and industrial projects in software engineering. The purpose is to compare the practices followed in a project&dash;course approach with the practices of professional software engineers. The approach is to compare the measurements obtained from academic and industrial projects. The critical factors regarding the process, the people and the project are discussed. The structure of the software processes and the measurement tools are presented. The data analyses show that the academic projects are found to be strongly dominated by programming activities. Based on the data from the industrial projects, we formulate seven recommendations to improve the software engineering practices in academic projects. They are related to management, predevelopment, development, testing, reviews documentation and team activities. The concluding remarks discuss some of the actions that could be taken to improve academic projects.
The Diffie&ndash;Hellman Protocol
Authors: Ueli M. Maurer, Stefan Wolf
Venue: Designs, Codes and Cryptography (2000)

The 1976 seminal paper of Diffie and Hellman is a landmark in the history of cryptography. They introduced the fundamental concepts of a trapdoor one-way function, a public-key cryptosystem, and a digital signature scheme. Moreover, they presented a protocol, the so-called Diffie&ndash;Hellman protocol, allowing two parties who share no secret information initially, to generate a mutual secret key. This paper summarizes the present knowledge on the security of this protocol.
High-Level Controllability and Observability Analysis for Test Synthesis
Authors: Frank F. Hsu, Janak H. Patel
Venue: Journal of Electronic Testing: Theory and Applications (1998)

In this study, we present a high-level testability analysis technique that evaluates the testability of a design based on the proposed controllability and observability measures. The control-data flow graph (CDFG) constructed from the VHDL description of a design is first analyzed to identify hard-to-control conditional branches and hard-to-control/observe register transfer statements. After the hard-to-test areas of the design are identified, the proposed testability enhancement methods can be applied to improve the testability of the circuit. Unlike many recent studies in the area of high-level test synthesis (HLTS) that focus on improving the testability of data paths, our approach also improves the testability of synthesized circuits by enhancing the controllability of the control flow. Experimental results on several high-level synthesis benchmarks show that when this approach is used prior to logic synthesis, the test generation complexities are reduced while better fault coverage and ATPG efficiency are often achieved. Implementation of this technique requires minimal logic and performance overheads and allows test vectors to be applied at clock-speed.
Construction and Testing of Ultrasound Broadband Transducers for Blood Flow Sensing
Authors: Duran Altiparmak, İnan Güler
Venue: Journal of Medical Systems (1998)

Ultrasound pulsed transducers are very important for blood flow measurement and imaging. Ultrasound pulsed transducers are broadband transducers which require relatively heavy external damping to achieve a good axial resolution and an adequately wide bandwidth. In this work, using a simple RLC circuit model, broadband transducers were constructed and tested. The results are quite applicable for pulsed Doppler blood flow measurements.
Desktop versus web-based network management
Authors: Luca Haj Deri
Venue: International Journal of Network Management (1999)

This paper introduces a novel management paradigm called desktop-based management that enables management of network resources from a desktop environment. It also covers the design and the implementation of SMB&horbar;SNMP, a simple desktop&hyphen;based management system that allows people to manage SNMP resources from a desktop environment. Copyright &copy; 1999 John Wiley Sons, Ltd.
A software model and specification language for non-WIMP user interfaces
Authors: Robert J. K. Jacob, Leonidas Deligiannidis, Stephen Morrison
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (1999)

We present a software model and language for describing and programming the fine-grained aspects of interaction in a non-WIMP user interface, such as a virtual environment. Our approach is based on our view that the essence of a non-WIMP dialogue is a set of continuous relationships&mdash;most of which are temporary. The model combines a data-flow or constraint-like component for the continuous relationships with an event-based component for discrete interactions, which can enable or diable individual continuous relationships. To demonstrate our approach, we present the PMIW user interface management system for non-WIMP interactions, a set of examples running under it, a visual editor for our user interface description language, and a discussion of our implemantation and our restricted use of constraints for a performance-driven interactive situation. Our goal is to provide a model and language that captures the formal structure of non-WIMP interactions in the way that various previous techniques have captured command-based, textual, and event-based styles and to suggest that using it need and not compromise real-time performance.
The queue protocol: a deadlock-free, homogeneous, non-two-phase locking protocol
Authors: Udo Kelter
Venue: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1988)

The M-pitfall protocol (MPP) is the most general homogeneous non-two-phase locking protocol which supports shared and exclusive locks. It has two major disadvantages: it is not deadlock-free and it has the paradoxical property that concurrency is often reduced if shared locks are used instead of exclusive locks. This paper presents a new protocol, the Queue Protocol (QP), which removes these deficiencies. Although the QP can be regarded an enhancement of the MPP, pitfalls are no more used in the QP; thus, the QP has the further advantage that processing overhead due to pitfalls is avoided.
Sensitivity of Solutions to Variational Inequalities on Banach Spaces
Authors: Adam B. Levy
Venue: SIAM Journal on Control and Optimization (1999)

We analyze the sensitivity of parameterized variational inequalities for convex polyhedric sets in reflexive Banach spaces. We compute a generalized derivative of the solution mapping where the formula for the derivative is given in terms of the solutions to an auxiliary variational inequality. These results are distinguished from other work in this area by the fact that they do not depend on the uniqueness of the solutions to the variational inequalities. To obtain our results, we use second-order epi-derivatives to analyze the second-order properties of polyhedric sets. We apply our results to sensitivity analyses of stationary points and KKT pairs associated with constrained infinite-dimensional optimization problems.
Dense and Sparse Matrix Classes Using the C++ Standard Template Library
Authors: Søren S. Nielsen
Venue: Computational Economics (1999)

The C++ programming language has undergone significant changes since its inception in the 1980s, but has now reached a relatively steady state. Standard C++ now includes a general library of container classes, the Standard Template Library (STL). These developments are rapidly changing the styles used in C++ class programming. The paper has dual purposes: it provides an introduction to STL for C++ programmers, and it develops an efficient matrix class library, built upon STL, which provides functionality useful in areas such as computational economics, finance, mathematical programming and statistics. This library, which is freely available, comprises a full set of vector and matrix operations using both dense and sparse implementations. The paper discusses approaches towards and pitfalls in constructing C++ concrete data types, and has references for further on-line information.
Row-Wise Backward Stable Elimination Methods for the Equality Constrained Least Squares Problem
Authors: Anthony J. Cox, Nicholas J. Higham
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

It is well known that the solution of the equality constrained least squares (LSE) problem minBx=d||b-Ax||2 is the limit of the solution of the unconstrained weighted least squares problem $$ \min_x\left\| \bmatrix{ \mu d \cr b } - \bmatrix{\mu B \cr A } x \right\|_2 $$ as the weight $\mu$ tends to infinity, assuming that $\bmatrix{B^T & A^T \cr}^T$ has full rank. We derive a method for the LSE problem by applying Householder QR factorization with column pivoting to this weighted problem and taking the limit analytically, with an appropriate rescaling of rows. The method obtained is a type of direct elimination method. We adapt existing error analysis for the unconstrained problem to obtain a row-wise backward error bound for the method. The bound shows that, provided row pivoting or row sorting is used, the method is well-suited to problems in which the rows of A and B vary widely in norm. As a by-product of our analysis, we derive a row-wise backward error bound of precisely the same form for the standard elimination method for solving the LSE problem. We illustrate our results with numerical tests.
Low Communication Overhead Jacobi Algorithms for Eigenvalues Computation on Hypercubes
Authors: Dolors Royo, Antonio González, Miguel Valero-García
Venue: The Journal of Supercomputing (1999)

This paper presents some novel algorithms to implement the Jacobi method in hypercube multicomputers. The algorithms are based on the one-sided Jacobi method and use new Jacobi orderings, which are one of the contributions of this paper. The second contribution of this paper is the use of a systematic algorithm transformation, which is referred to as communication pipelining, and is aimed at reducing the communication overhead by exploiting parallelism in the communication operations. The proposed schemes are evaluated by means of analytical models and compared with previous proposals. The results show a significant reduction in the communication overhead, which in some cases can be by a factor almost as great as the number of dimensions of the hypercube.
Asymptotic Analysis for Penalty and Barrier Methods in Variational Inequalities
Authors: A. Auslender
Venue: SIAM Journal on Control and Optimization (1999)

We study the convergence of a class of penalty and barrier methods for solving monotone variational inequalities with constraints. This class of methods is an extension of penalty and barrier methods for convex optimization to the setting of variational inequalities. Primal convergence is established under weaker conditions than usual: the solution set is supposed either to be a compact set or, for the case of interior barrier methods, the sum of a compact set and a linear space. Dual convergence is also analyzed. The analysis strongly exploits a new formula related to recession calculus.
How to find the best approximation results
Authors: Pierluigi Crescenzi, Viggo Kann
Venue: ACM SIGACT News (1998)

A compendium of NP optimization problems, containing the best approximation results known for each problem, is available on the world wide web at http://www.nada.kth.se/~viggo/problemlist/In this paper we describe the compendium, and specify how the compendium is consultable as well as modifiable on the web. We also give statistics for the use of the compendium.
Connectionist Learning in Behaviour-Based Mobile Robots: A Survey
Authors: Mark Rylatt, Chris Czarnecki, Tom Routen
Venue: Artificial Intelligence Review (1998)

This paper is a survey of some recent connectionist approaches to the design and development of behaviour-based mobile robots. The research is analysed in terms of principal connectionist learning methods and neurological modeling trends. Possible advantages over conventionally programmed methods are considered and the connectionist achievements to date are assessed. A realistic view is taken of the prospects for medium term progress and some observations are made concerning the direction this might profitably take.
SNMP through WWW
Authors: Ching-Wun ‘Bo’ Tsai, Ruay-Shiung ‘Bo’ Chang
Venue: International Journal of Network Management (1998)

In this article we propose a bilingual agent to accept either SNMP or HTTP commands and design several HTML pages to facilitate the task of network management. For network elements that support only SNMP, the bilingual agent can act as a proxy, so that the traditional SNMP agent can also be queried through the Web browser. &copy; 1998 John Wiley & Sons, Ltd.
Analysis of congestion control mechanisms in an intelligent network
Authors: Anna Hać, Lining Gao
Venue: International Journal of Network Management (1998)

An SCP overload control method is proposed and its characteristics are evaluated and compared with other methods &lpar;window and call gapping&rpar; under various overload traffic patterns by using the network simulator that models SCP, SSPs, and their relationships in the IN. &copy; 1998 John Wiley & Sons, Ltd.
Scalable browsing for large collections: a case study
Authors: Gordon W. Paynter, Ian H. Witten, Sally Jo Cunningham, George Buchanan
Venue: Proceedings of the fifth ACM conference on Digital libraries (2000)

Phrase browsing techniques use phrases extracted automatically from a large information collection as a basis for browsing and accessing it. This paper describes a case study that uses an automatically constructed phrase hierarchy to facilitate browsing of an ordinary large Web site. Phrases are extracted from the full text using a novel combination of rudimentary syntactic processing and sequential grammar induction techniques. The interface is simple, robust and easy to use.To convey a feeling for the quality of the phrases that are generated automatically, a thesaurus used by the organization responsible for the Web site is studied and its degree of overlap with the phrases in the hierarchy is analyzed. Our ultimate goal is to amalgamate hierarchical phrase browsing and hierarchical thesaurus browsing: the latter provides an authoritative domain vocabulary and the former augments coverage in areas the thesaurus does not reach.
Thin Films with High Surface Tension
Authors: T. G. Myers
Venue: SIAM Review (1998)

This paper is a review of work on thin fluid films where surface tension is a driving mechanism. Its aim is to highlight the substantial amount of literature dealing with relevant physical models and also analytic work on the resultant equations.In general the introduction of surface tension into standard lubrication theory leads to a fourth-order nonlinear parabolic equation $$ \pad{h}{t}+\pad{}{x}\left(C \frac{h^3}{3}\frac{\partial^3 h}{\partial x^3} +f(h,h_x,h_{xx})\right) = 0 ,\label{abeq1} $$ where $h=h(x,t)$ is the fluid film height. For steady situations this equation may be integrated once and a third-order ordinary differential equation is obtained. Appropriate forms of this equation have been used to model fluid flows in physical situations such as coating, draining of foams, and the movement of contact lenses.In the introduction a form of the above equation is derived for flow driven by surface tension, surface tension gradients, gravity, and long range molecular forces. Modifications to the equation due to slip, the effect of two free surfaces, two phase fluids, and higher dimensional forms are also discussed. The second section of this paper describes physical situations where surface tension driven lubrication models apply and the governing equations are given. The third section reviews analytical work on the model equations as well as the "generalized lubrication equation" $$ \pad{h}{t}+\pad{}{x}\left(h^n h_{xxx}\right) = 0. $$ In particular the discussion focusses on asymptotic results, travelling waves, stability, and similarity solutions. Numerical work is also discussed, while for analytical results the reader is directed to existing literature.
Past, present, and future of user interface software tools
Authors: Brad Myers, Scott E. Hudson, Randy Pausch
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2000)

A user interface software tool helps developers design and implement the user interface. Research on past tools has had enormous impact on today's developers&mdash;virtually all applications today are built using some form of user interface tool. In this article, we consider cases of both success and failure in past user interface tools. From these cases we extract a set of themes which can serve as lessons for future work. Using these themes, past tools can be characterized by what aspects of the user interface they addressed, their threshold and ceiling, what path of least resistance they offer, how predictable they are to use, and whether they addressed a target that became irrelevant. We believe the lessons of these past themes are particularly important now, because increasingly rapid technological changes are likely to significantly change user interfaces. We are at the dawn of an era where user interfaces are about to break out of the &ldquo;desktop&rdquo; box where they have been stuck for the past 15 years. The next millenium will open with an increasing diversity of user interface on an increasing diversity of computerized devices. These devices include hand-held personal digital assistants (PDAs), cell phones, pages, computerized pens, computerized notepads, and various kinds of desk and wall size-computers, as well as devices in everyday objects (such as mounted on refridgerators, or even embedded in truck tires). The increased connectivity of computers, initially evidenced by the World Wide Web, but spreading also with technologies such as personal-area networks, will also have a profound effect on the user interface to computers. Another important force will be recognition-based user interfaces, especially speech, and camera-based vision systems. Other changes we see are an increasing need for 3D and end-user customization, programming, and scripting. All of these changes will require significant support from the underlying user interface sofware tools.
&rsquo;&rsquo;It&lsquo;s Just a Matter of Common Sense&lsquo;&lsquo;: Ethnography as Invisible Work
Authors: Diana E. Forsythe
Venue: Computer Supported Cooperative Work (1999)

Anthropologists have been using ethnographic methods since the 1970s to support the design and evaluation of software. While early use of such skills in the design world was viewed as experimental, at least by computer scientists and engineers, ethnography has now become established as a useful skill in technology design. Not only are corporations and research laboratories employing anthropologists to take part in the development process, but growing numbers of non-anthropologists are attempting to borrow ethnographic techniques. The results of this appropriation have brought out into the open a kind of paradox: while ethnography looks and sounds straightforward, this is not really the case. The work of untrained ethnographers tends to overlook things that anthropologists see as important parts of the research process. The consistency of this pattern suggests that some aspects of ethnographic fieldwork are invisible to the untrained eye. In short, ethnography would appear to constitute an example of invisible work. Drawing on my own decade of experience as an anthropologist working in design, I attempt to clarify the nature of ethnographic expertise, describe six misconceptions about ethnography that I have encountered among scientists, and present real-life examples to illustrate why quasi-ethnographic work based on these misconceptions is likely to be superficial and unreliable.