ppxscal/embedding_network huggingface dataset:
Conditional checkpoint abort: an alternative semantic for re-synchronization in CCL
Authors: Francesco Quaglia, Andrea Santoro, Bruno Ciciani
Venue: Proceedings of the sixteenth workshop on Parallel and distributed simulation (2002)

Recently, a Checkpointing and Communication Library (CCL) to support optimistic parallel simulation on myrinet based clusters has been presented. Beyond classical low latency message delivery functionalities, this library additionally offers CPU offloaded checkpointing functionalities based on data transfer capabilities provided by a programmable DMA engine on board of myrinet network cards. A re-synchronization functionality is also supported for both logical (i.e. data consistency) and practical (i.e. hardware contention) reasons, which is implemented according to the following semantic: at any re-synchronization point, the simulation application is momentarily frozen until the last activated DMA based checkpoint operation is completed. In case long freezing periods are experienced, the checkpointing functionalities offered by CCL might not be fully effective in reducing the real checkpointing overhead at the simulation application level. To tackle this drawback, we present an alternative semantic for re-synchronization, namely conditional checkpoint abort, leading to application freezing only in case at least a threshold fraction of the state vector currently being checkpointed has already been transferred into the checkpoint buffer. In the opposite case, the checkpoint operation is aborted and the simulation application is immediately allowed to proceed, thus avoiding excessive checkpointing overhead (due to freezing) at the simulation application level. We also report the results of an evaluation, carried out using classical parameterized synthetic benchmarks, which show that the execution speed of the simulation application can be significantly increased by the alternative semantic we propose.
On Principal Angles between Subspaces of Euclidean Space
Authors: Zlatko Drmac
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

The cosines of the principal angles between the column spaces of full column rank matrices $X\in{\hbox{{\bf R}$^{m\times p}$}}$ and $Y\in{\hbox{{\bf R}$^{m\times q}$}}$ are efficiently computed, using the Björck--Golub algorithm, as the singular values of $Q_x^{T}Q_y,$ where Qx and Qy are orthonormal matrices computed by the QR factorizations of X and Y, respectively. This paper shows that the Björck--Golub algorithm is mixed stable in the following sense: the computed singular values approximate with small relative error the exact cosines of the principal angles between the column spaces of $X+\Delta X$ and $Y+\Delta Y,$ where $\Delta X,$ $\Delta Y$ are small backward errors. Further, theoretical analysis and numerical evidence show that the algorithm becomes more robust if the QR factorizations are computed with the complete pivoting scheme of Powell and Reid. Moreover, it is shown that Gaussian elimination with complete pivoting can be used as an efficient preconditioner in computation and as a useful tool in analysis of the sensitivity of the QR factorization.
Finite Element Analysis of a Quadratic Eigenvalue Problem Arising in Dissipative Acoustics
Authors: A. Bermúdez, R. G. Durán, R. Rodríguez, J. Solomin
Venue: SIAM Journal on Numerical Analysis (2000)

A quadratic eigenvalue problem arising in the determination of the vibration modes of an acoustic fluid contained in a cavity with absorbing walls is considered. The problem is shown to be equivalent to the spectral problem for a noncompact operator and a thorough spectral characterization is given. A numerical discretization based on Raviart--Thomas finite elements is analyzed. The method is proved to be free of spurious modes and to converge with optimal order. Implementation issues and numerical experiments confirming the theoretical results are reported.
A unified component framework for dynamically extensible virtual environments
Authors: Andrzej Kapolka, Don McGregor, Michael Capps
Venue: Proceedings of the 4th international conference on Collaborative virtual environments (2002)

If large-scale shared virtual worlds are to be established on the Internet, they must be based on technologies that allow them to adapt, scale, and evolve continuously-that is, without their being taken offline. In the course of designing NPSNET-V, an architecture intended to satisfy these criteria through component-based dynamic extensibility, the authors recognized the need for a consistent, unified component framework. This framework, which they implemented in Java™, allows one to construct applications as component hierarchies rooted at an invariant microkernel. A simple extensible interface layer and event model allow components to communicate with one another, and an XML configuration and serialization mechanism permits applications to store and transmit component and application state in a versatile standardized format. After an initial bootstrapping process, one may add, remove, and upgrade components at run time, and one may introduce newly loaded Java™ code anywhere in the application hierarchy at any time. The complications posed by this reconfigurability and the hierarchical nature of NPSNET-V applications led the authors to develop a consistent design strategy, which they based largely on several common design patterns. The most critical design pattern that they used was the Model-View-Controller pattern, which forms the basis of the NPSNET-V entity model.
The Zapatista Social Netwar in Mexico
Authors: David Ronfeldt, John Arquilla, Graham E. Fuller, Melissa Fuller
Venue:  (1999)

:This study was prepared for a research project on "Stability and the Military in Mexico." The research was sponsored by Deputy Chief of Staff for Intelligence and was conducted in RAND Arroyo Center's Strategy and Doctrine Program. The Arroyo Center is a federally funded research and development center sponsored by the United States Army. The study reports on a case of "netwar," a concept that we have been developing for the purpose of understanding the nature of conflict in the information age (Arquilla and Ronfeldt, 1996b). Although the focus is on the Zapatista movement in Mexico, and on the responses thereto of the Mexican government and army, the study also identi-fies some implications for possible future netwars elsewhere around the world. This study focuses mainly on the 1994-1996 period, in part because that was the heyday of this social netwar, but also because the study's preliminary findings were initially briefed to the sponsor in June 1996, and the first draft appeared in December 1996. This final publication is much revised and updated from the draft. Please direct comments to: David Ronfeldt, John Arquilla International Studies Group Interdisciplinary Academic Center RAND U.S. Naval Postgraduate School Santa Monica, CA 90407-2138 Monterey, CA 93943 (310) 393-0411, extension 7717 (408) 656-3450 ronfeldt@rand.org jarquilla@nps.navy.mil
Windows 2000 Developer's Guide
Authors: Ben Forta, Paul Fonte
Venue:  (1999)

:The Windows 2000 Developer's Guide provides expert code and advice for the most difficult programming challenges in Microsoft's Windows 2000 operating system. The book is highly example driven and targets professional Windows developers who want short focused examples and code. Every technology, technique, or feature described will include: a brief overview of the technology; a short description of what the following example demonstrates; extensively annotated example source code; detailed analysis of the preceding code, explaining all function calls etc.; and, additional notes or comments about the technology discussed. About the Authors:Ben Forta is a best-selling author and noted programmer who works for Allaire. He has over 15 years of software development experience specializing in database and data communication based applications. Paul Fonte is the Open Text Technical Lead for integrating Livelink into the Windows desktop. He has developed many consumer applications and services for the Win9x and NT platforms over the years. Greg Brewer has been developing Windows applications for over a decade.
Progressive lossless compression of arbitrary simplicial complexes
Authors: Pierre-Marie Gandoin Olivier Devillers
Venue: Proceedings of the 29th annual conference on Computer graphics and interactive techniques (2002)

Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold or "nearly manifold". We propose here a progressive geometry compression scheme which can handle manifold models as well as "triangle soups" and 3D tetrahedral meshes. The method is lossless when the decompression is complete which is extremely important in some domains such as medical or finite element.While most existing methods enumerate the vertices of the mesh in an order depending on the connectivity, we use a kd-tree technique [Devillers and Gandoin 2000] which does not depend on the connectivity. Then we compute a compatible sequence of meshes which can be encoded using edge expansion [Hoppe et al. 1993] and vertex split [Popovi&cacute; and Hoppe 1997].The main contributions of this paper are: the idea of using the kd-tree encoding of the geometry to drive the construction of a sequence of meshes, an improved coding of the edge expansion and vertex split since the vertices to split are implicitly defined, a prediction scheme which reduces the code for simplices incident to the split vertex, and a new generalization of the edge expansion operation to tetrahedral meshes.
The well-tempered semaphore: theme with variations
Authors: Kenneth A. Reek
Venue: ACM SIGCSE Bulletin (2002)

This paper discusses differences in the semantics of various semaphore implementations and their ramifications in developing solutions to synchronization problems. An approach is described to insulate students from these differences and simplify the task of teaching semaphores.
Computer Wars: The Fall of IBM and the Future of Global Technology, 1st edition
Authors: Charles H. Ferguson, Charles R. Morris
Venue:  (1993)

:Now in paperback, the book THE WALL STREET JOURNAL called "required reading for anyone itching to know what happened at Big Blue." A behind-the-scenes look at the dramtic fall of IBM.
Empirical Evaluation Techniques in Computer Vision, 1st edition
Authors: Kevin Bowyer, P. Jonathon Phillips
Venue:  (1998)

:Empirical Evaluation Techniques in Computer Vision presents methods that allow comparative assessment of algorithms and the accompanying benefits: places computer vision on solid experimental and scientific grounds, assists the development of engineering solutions to practical problems, allows accurate assessments of computer vision research, provides convincing evidence that computer vision research results in practical solutions. The chapters in this volume cover the three main paradigms for evaluating computer vision algorithms. The paradigms are: (1) evaluations that are independently administered, (2) evaluation of a set of algorithms by one research group, and (3) evaluation methods that feature ground truthing procedures as a major component.
Modelling Systems: Practical Tools and Techniques for Software Development
Authors: John Fitzgerald, Peter G. Larsen
Venue:  (1998)

:This book provides an insight into established techniques which help developers to overcome the complexity of software development by constructing models of software systems in early design stages. The analysis and testing of models allows feedback before an expensive commitment is made to detailed design and coding. Aimed at software developers in industry and university students in software engineering courses, the text provides a remarkable new introduction to modelling using a leading technology: ISO Standard VDM-SL. The text breaks new ground by combining training in modelling techniques with commercial-strength tool support on a PC Windows platform.
Tcl/Tk Pocket Reference
Authors: Paul Raines
Venue:  (1998)

:The Tcl language and the Tk graphical toolkit are simple and powerful building blocks for sophisticated applications. This small book is a handy reference guide to the basic Tcl language elements, to the Tcl and Tk commands (presenting each command and its options), and to the Tk widgets.
Compact Central WENO Schemes for Multidimensional Conservation Laws
Authors: Doron Levy, Gabriella Puppo, Giovanni Russo
Venue: SIAM Journal on Scientific Computing (2000)

We present a new third-order central scheme for approximating solutions of systems of conservation laws in one and two space dimensions. In the spirit of Godunov-type schemes, our method is based on reconstructing a piecewise-polynomial interpolant from cell-averages which is then advanced exactly in time.In the reconstruction step, we introduce a new third-order, compact, central weighted essentially nonoscillatory (CWENO) reconstruction, which is written as a convex combination of interpolants based on different stencils. The heart of the matter is that one of these interpolants is taken as a suitable quadratic polynomial, and the weights of the convex combination are set as to obtain third-order accuracy in smooth regions. The embedded mechanism in the WENO-like schemes guarantees that in regions with discontinuities or large gradients, there is an automatic switch to a one-sided second-order reconstruction, which prevents the creation of spurious oscillations.In the one-dimensional case, our new third-order reconstruction is based on an extremely compact three-point stencil. Analogous compactness is retained in more space dimensions. The accuracy, robustness, and high-resolution properties of our scheme are demonstrated in a variety of one- and two-dimensional problems.
Classroom integral calculus: some useful digressions when teaching integral calculus
Authors: Daniel J. Acosta, Randall Wills
Venue: PRIMUS: problems, resources, and issues in mathematics undergraduate studies (2002)

In this article we outline ideas and exercises for two topics that accompany the standard treatment of integral calculus. These concepts emphasize intuition to help facilitate student comprehension of the definite integral as a limit of Riemann sums.
Disney's Photomosaics
Authors: Robert Silvers, Robert Tieman
Venue:  (1998)

:Photomosaics are everywhere. And the creative genius behind this trend offers a stunning new look at some familiar faces. From Mickey Mouse to "The Lion King", familiar and beloved icons are magically reborn in this vivid compilation of thousands of images. Full-color photos.
Functional Programming and Parallel Graph Rewriting, 1st edition
Authors: Rinus Plasmeijer, Marko Van Eekelen
Venue:  (1993)

:The descriptive power and semantic elegance of modern functional languages make it possible to develop correct programs relatively quickly. Efficient implementations of functional languages, employing graph rewriting techniques, have only recently become available. This book illustrates the techniques of functional programming in Miranda and Clean, and focuses on the computational model of Graph Rewriting Systems for both sequential and parallel machines. Highlights of the book include a clear tutorial guide to functional programming in Miranda and Clean, in-depth coverage of implementation on both sequential and parallel machines, and unique focus on Graph Rewriting Systems as a computational model. The book will be equally valuable for students taking courses in functional programming, and for programmers or systems designers who are keen to explore state-of-the-art programming and implementation techniques. The Concurrent Clean System, which is available from the authors, offers the opportunity to write both sequential and parallel applications (including window-based systems) in a pure, lazy functional language.
Asymptotic Convergence Analysis of Some Inexact Proximal PointAlgorithms for Minimization
Authors: Ciyou Zhu
Venue: SIAM Journal on Optimization (1996)

In this paper, we prove that the inexact proximal point algorithm (PPA) in the form of Bonnans--Gilbert--Lemar&eacutechal--Sagastiz&aacutebal's ``general algorithmic pattern'' (GAP--1) converges linearly under mild conditions. We also propose another variant (GAP--2) of inexact PPA that shares the same convergence property as GAP--1 but makes more sense numerically. Based on this essential result, we further prove the linear convergence for the outer iteration of the bundle method without requiring the differentiability of the objective function or the uniqueness of the solution. We also prove the linear convergence for the outer iteration of Correa--Lemar&eacutechal's ``implementable form'' of PPA and derive its rate.
Net Privacy: A Guide to Developing and Implementing an Ironclad Ebusiness Privacy Plan
Authors: Michael Erbschloe, John R. Vacca
Venue:  (2001)

:Names, addresses, and purchase patterns of customers are legal tender, as valuable to marketers as they are to competitors. At the same time, these and other indispensable internal information are often protected behind paper-thin corporate firewalls -- barriers that stand little chance against sophisticated computer hackers looking to compromise systems and steal information. Net Privacy shows executives, consultants, technology designers, and other decision makers how to protect information privacy in today's competitive business arena.
Macworld PhotoShop 5 Bible, 1st edition
Authors: Deke McClelland, Ted Padova
Venue:  (1998)

:Deke McClelland's international bestseller has been meticulously updated with hundreds of illustrated techniques and detailed guidelines for exploiting the latest version of the most powerful image-editing software available. From adding spot colors to using layer effects to editing text to wrapping a selected image around a three-dimensional primitive, McClelland breaks down every Photoshop function and feature - enabling you to produce high-impact images for print, multimedia, and the Web.
Computer Graphics and Geometric Modeling, 1st edition
Authors: David Salomon
Venue:  (1999)

:This is a book for those interested in understanding how graphics programs work and how present-day computer graphics can generate realistic-looking curves, surfaces, and solid objects. The book emphasizes the mathematics behind computer graphics, and most of the required mathematics is included in an appendix. With its numerous illustrative examples and (solved) exercises, the book makes a splendid text for a two-semester course in computer graphics for advanced undergraduate or graduate students. It also serves as a fine reference for professionals in the computer graphics field.
Mastering Maya Complete 3 with Cdrom
Authors: John L. Kundert-Gibbs, Peter Lee
Venue:  (2001)

:Expert Instruction + Hands-on Projects = Maya Mastery The latest release of Maya adds gaming-related features, nonlinear animation, new modeling tools, and a long list of more subtle refinements. Mastering Maya helps you take full advantage of all the capabilities of version 3, whether you're graduating from version 2.x or are completely new to Maya. Expert, step-by-step instruction and hands-on projects equip you with the understanding and know-how you need to create professional models and animations. Featured on the CDOn the enclosed CD, you'll find files supporting all the exercises contained in the book, including QuickTime animations, color images, and pre-built projects, all of which will help you follow the authors' step-by-step instructions. Also included are textures, shaders, and a collection of MEL scripts.
Getting Started with dBASE IV: For the IBM PC (5.25 inch Data Disk)
Authors: Henry Gaylord, Babette Kronstadt, David Sachs
Venue:  (1993)

:Carefully tested, practically oriented tutorials; numerous screen dumps and practice exercises; and coverage of the latest release of dBASE are featured. A data disk allows students to focus on key concepts, commands and functions.
Cellular Neural Networks, 1st edition
Authors: Gabriele Manganaro, L. Fortuna, Paolo Arena
Venue:  (1999)

:This book is about new applications of cellular neural networks (CNNs), new theoretical results and implementation issues. The topic involves several scientific disciplines including circuit theory, microelectronics, dynamic systems theory and applied mathematics, information processing, biology, neurophysiology, and robotics, to cite but a few. Significant attention is paid to small-size CNNs for generating chaotic dynamics and also to their application in the area of nonlinear circuit synchronization and secure communication.
Internationalization of the curriculum report of a project within computer science
Authors: J. A. N. Lee
Venue: Proceedings of the 33rd SIGCSE technical symposium on Computer science education (2002)

In the Fall of 1999 the Center for Excellence in Undergraduate Teaching (CEUT) and the International Office at Virginia Tech provided a small grant to support the incorporation of international aspects into the Computer Science curriculum. The "Professionalism in Computing" course was chosen as the vehicle for this activity on the grounds that (a) it is a required course of all majors, and (b) the topics within the course were best amenable to international extensions. Through the efforts of the students in the Spring 2000 offering of the course, together with a number of international students, lesson plans for the comparison of non-US aspects of three topics were developed. The topics were Privacy, Freedom of Speech, and Censorship, and the countries covered included Germany, South Korea, China, and Turkey.
K-tree/forest: efficient indexes for boolean queries
Authors: Rakesh M. Verma, Sanjiv Behl
Venue: Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval (2002)

In Information Retrieval it is well-known that the complexity of processing boolean queries depends on the size of the intermediate results, which could be huge (and are typically on disk) even though the size of the final result may be quite small. In the case of inverted files the most time consuming operation is the merging or intersection of the list of occurrences [1]. We propose, the Keyword tree (K-tree) and forest, efficient structures to handle boolean queries in keyword-based information retrieval. Extensive simulations show that K-tree is orders-of-magnitude faster (i.e., far fewer I/O's) for boolean queries than the usual approach of merging the lists of occurrences and incurs only a small overhead for single keyword queries. The K-tree can be efficiently parallelized as well. The construction cost of K-tree is comparable to the cost of building inverted files.
Modeling task knowledge to support software development
Authors: Fabio Zlot, Kathia Marçal de Oliveira, Ana Regina Rocha
Venue: Proceedings of the 14th international conference on Software engineering and knowledge engineering (2002)

One of the main reasons why the development of software does not meet the client's need is the lack of understanding of the software's real objective, and consequently, the tasks it should perform and how they should be performed. With this assumption, we have defined a structure to represent the task knowledge which supports software engineers in understanding problems starting from the understanding of the tasks which comprise these problems. This structure combines task ontologies and problem solving methods, providing the developer with the necessary task knowledge to guide him throughout the development process. This article shows how task knowledge is defined and used to help the development of software, presenting as an example, use cases modeling.