ppxscal/embedding_network huggingface dataset:
Staging and evaluating public performances as an approach to CVE research
Authors: Steve Benford, Mike Fraser, Gail Reynard, Boriana Koleva, Adam Drozd
Venue: Proceedings of the 4th international conference on Collaborative virtual environments (2002)

Staging public performances can be a fruitful approach to CVE research. We describe four experiences: Out of This World, a gameshow; Avatar Farm, a participatory drama; Desert Rain, a mixed reality performance; and Can You See Me Now?, a game that mixed on-line players with players on the streets. For each, we describe how a combination of ethnography, audience feedback and analysis of system logs led to new design insights, especially in the areas of orchestration and making activity available to viewers. We propose enhancing this approach with new tools for manipulating, analysing and sharing 3D recordings of CVEs.
Automatic verification of real-time systems with discrete probability distributions
Authors: Marta Kwiatkowska, Gethin Norman, Roberto Segala, Jeremy Sproston
Venue: Theoretical Computer Science (2002)

We consider the timed automata model of Alur and Dill (Theoret. Comput. Sci. 126 (1994) 183-235), which allows the analysis of real-time systems expressed in terms of quantitative timing constraints. Traditional approaches to real-time system description express the model purely in terms of nondeterminism; however, it is often desirable to express the likelihood of the system making certain transitions. In this paper, we present a model for real-time systems augmented with discrete probability distributions. Furthermore, two approaches to model checking are introduced for this model. The first uses the algorithm of Baier and Kwiatkowska (Distributed Comput. 11 (1998) 125-155) to provide a verification technique against temporal logic formulae which can refer both to timing properties and probabilities. The second, generally more efficient, technique concerns the verification of probabilistic, real-time reachability properties.
Programming Web Graphics with PERL and GNU Software
Authors: Shawn P. Wallace
Venue:  (1999)

:From access counters and log-report graphs to scientific plots and on-the-fly animated GIFs, graphics scripting is within the grasp of most Web authors. It is a little documented field, however, and the many valuable free libraries and tools available on the Internet remain under-utilized. Programming Web Graphics with Perl GNU Software is aimed at intermediate and advanced Web users who want to use CGI scripts to generate dynamic graphic content. It will also help to demystify the manipulation of graphics formats for newcomers to the Web. Programming Web Graphics with Perl GNU Software takes a practical, resource-like approach to the content. It is not a book about design or aesthetics of Web graphics; its focus is on programming or, more accurately, scripting programs that manipulate graphics file to be published on the Web. Most of the examples in the book use Perl as a scripting language, though the concepts are applicable to any programming language. However, several powerful Perl modules for generating graphics (GD, PerlMagick, GIFgraph) should help position Perl as a major contender for your Web graphics applications. Most of the topics covered in the book are applicable to any platform (NT, Linux, Un*x, MaxOS), with the exception of the chapter detailing the Gnu Image Manipulation Program (a free Adobe Photoshop-like application), which requires a connection to an X server. The focus is always on free software, when it is available. This book covers the following: a tour through the most popular Web graphics file formats by implementing parsers for GIF, JPEG, and PNG files descriptions of the PNG, JPEG, and giflib libraries, as well as many other free and proprietary libraries and SDKs extensive documentation and examples using the Perl graphics modules GD and GIFgraph, and the Perl interface to the powerful ImageMagick libraries documentation on the Gnu Image Manipulation Program (GIMP) and the Perl interface that lets you easily script plug-ins or interface to the GIMP via the Web the creation of image maps from data extracted from a database the implementation of several new Perl modules for the creation of neatly formatted PostScript files details on interfacing to a fax gateway reusable recipes for many popular applications such as Web counters and Web cams the creation of animated GIFs on-the-fly optimizing graphics generation on the server-side. One of the key ingredients to the success of the Web is that anyone who wanted to could participate in publishing to the world. This book will take its readers to the next level of publishing to the world: learning to use scripting programs to create dynamic graphics for their Web sited. The information in this book is written in a practical, easy manner with high-quality documentation and useful examples throughout. It is a detailed reference that provides Web designers and programmers and with the information they need to program.
The Computer Triangle: Hardware, Software, and People, 2nd edition
Authors: Robert L. Oakman
Venue:  (1997)

:This absorbing book provides a unique perspective on how the three major elements of the computer triangle--hardware, software, and people--work together for the advancement and sometimes debasement of society.
On the Global Convergence of a Filter--SQP Algorithm
Authors: Roger Fletcher, Sven Leyffer, Philippe L. Toint
Venue: SIAM Journal on Optimization (2002)

A mechanism for proving global convergence in SQP--filter methods for nonlinear programming (NLP) is described. Such methods are characterized by their use of the dominance concept of multiobjective optimization, instead of a penalty parameter whose adjustment can be problematic. The main point of interest is to demonstrate how convergence for NLP can be induced without forcing sufficient descent in a penalty-type merit function.The proof relates to a prototypical algorithm, within which is allowed a range of specific algorithm choices associated with the Hessian matrix representation, updating the trust region radius, and feasibility restoration.
Pulsed Neural Networks
Authors: Wolfgang Maass, Christopher M. Bishop
Venue:  (1999)

:This book presents the complete spectrum of current research in pulsed neural networks and includes the most important work from many of the key scientists in the field.
Corrigendum: On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
Authors: Liqun Qi, Zengxin Wei
Venue: SIAM Journal on Optimization (2000)

We correct an assertion in the quoted paper [Qi and Wei, SIAM J. Optim., 10 (2000), pp. 963--981].
Programming Javabeams Beans
Authors: Reaz Hoque, Tarun Sharma
Venue:  (1998)

:Programming JavaBeans 1. 1 gives you at-hand,solutions-real code youcan use for getting applications onto the Web. You get clear and detailed instructions for creating Bean components with advanced functionalities! This book gives you everything you need to slash development timefrom ready-to-run code to expert,written-for-developers help with interfacing with other technologies Inside Programming JavaBeans 1. 1 you'll find introductions to unfamiliar technology as well as tested,step-by-step solutions for developing Beans that work and play well with others. This complete,professional solutions kit helps you reduce development time and solve complex problems quickly. Covering all the features of this new technology (and giving you work-arounds to deal with the flaws),this book offers Web developers the answers you want in language that's clear,to the point,and written just for you. The McGraw-Hill Web Developer Series was written by developers for developers
Optimal series-parallel trade-offs for reducing a function to its own graph
Authors: Richard Beigel, Lane A. Hemaspaandra, Harald Hempel, Jörg Vogel
Venue: Information and Computation (2002)

Consider the problem of computing a function given only an oracle for its graph. For this problem, we present optimal trade-offs between serial and parallel queries. In particular, we give a fuction for which parallel access to its own graph is exponentially more expensive than sequential access.
Resource-Bounded Kolmogorov Complexity Revisited
Authors: Harry Buhrman, Lance Fortnow, Sophie Laplante
Venue: SIAM Journal on Computing (2002)

We take a fresh look at CD complexity, where CDt(x) is the size of the smallest program that distinguishes x from all other strings in time t(|x|). We also look at CND complexity, a new nondeterministic variant of CD complexity, and time-bounded Kolmogorov complexity, denoted by C complexity.We show several results relating time-bounded C, CD, and CND complexity and their applications to a variety of questions in computational complexity theory, including the following: Showing how to approximate the size of a set using CD complexity without using the random string as needed in Sipser's earlier proof of a similar result. Also, we give a new simpler proof of this result of Sipser's. Improving these bounds for almost all strings, using extractors. A proof of the Valiant--Vazirani lemma directly from Sipser's earlier CD lemma. A relativized lower bound for CND complexity. Exact characterizations of equivalences between C, CD, and CND complexity. Showing that satisfying assignments of a satisfiable Boolean formula can be enumerated in time polynomial in the size of the output if and only if a unique assignment can be found quickly. This answers an open question of Papadimitriou. A new Kolmogorov complexity-based proof that BPP\subseteq\Sigma_2^p$. New Kolmogorov complexity based constructions of the following relativized worlds: There exists an infinite set in P with no sparse infinite NP subsets. EXP=NEXP but there exists a NEXP machine whose accepting paths cannot be found in exponential time. Satisfying assignments cannot be found with nonadaptive queries to SAT.
Easy PC's, 1st edition
Authors: Nat Gertler, Rick Winter
Venue:  (1998)

:A four-color visual approach to learning that is easy to follow and fun for the reader to use when learning about her PC. The reader will quickly and easily learn how to use her computer, work with the latest version of Windows, learn basic software skills, use multimedia features, use the internet and more! Easy PCs, 5 Edition provides all of the information a novice reader needs to know to quickly and successfully without overwhelming the reader in too much text or too much coverage. New series features include quick reference where am I tabs, more complete index with terms familiar to the reader and not just the author, and new updated look and feelFour-color visual approach guaranteed to get the reader up to speed quickly on how to use his PC and software.Best value-price title in a four color visual approach on the market covering how to use the PC.New updated layout and design to appeal to today s fast-paced, need to know it quickly audience who wants to learn visually..
Core Concepts of Accounting Information Systems, 6th edition
Authors: Stephen A. Moscove, Mark G. Simkin, Nancy A. Bagranoff
Venue:  (1998)

:Based on the authors' bestselling AIS: Concepts and Practice for Effective Decision Making, this dramatically shorter text is entirely updated to reflect recent changes in technology and AIS practice. Covers such subjects as EDI, reengineering, neural networks, client/server, and events accounting. In addition to examples included throughout every chapter, a special "AIS at Work" feature demonstrates how actual companies make use of the AIS concepts presented in each chapter. Contains two chapters on control and one each on information systems auditing and computer security and crime.
Gradient domain high dynamic range compression
Authors: Raanan Fattal, Dani Lischinski, Michael Werman
Venue: Proceedings of the 29th annual conference on Computer graphics and interactive techniques (2002)

We present a new method for rendering high dynamic range images on conventional displays. Our method is conceptually simple, computationally efficient, robust, and easy to use. We manipulate the gradient field of the luminance image by attenuating the magnitudes of large gradients. A new, low dynamic range image is then obtained by solving a Poisson equation on the modified gradient field. Our results demonstrate that the method is capable of drastic dynamic range compression, while preserving fine details and avoiding common artifacts, such as halos, gradient reversals, or loss of local contrast. The method is also able to significantly enhance ordinary images by bringing out detail in dark regions.
UNIX Primer Plus, 3rd edition
Authors: Stephen Prata
Venue:  (1999)

:UNIX Primer Plus begins by placing Unix in a technical and historical context. The book then quickly walks you through the basics of the Unix operating system: logging in, passwords, and initial prompts. After the basics, you are taught about various Unix Editors, files and directories, and Mail. Panel drawings throughout the book help you understand concepts better, and exercises at the end of each chapter reinforce what you have learned in the chapter. Topics include email, files and directories, the vi. screen editor, the ex line editor, the emacs editor, information processing, and advanced editing techniques.
Markovian models for performance and dependability evaluation
Authors: Boudewijn R. Haverkort
Venue: Lectures on formal methods and performance analysis: first EEF/Euro summer school on trends in computer science (2002)

Markovian models have been used for about a century now for the evaluation of the performance and dependability of computer and communication systems. In this paper, we give a concise overview of the most widely used classes of Markovian models, their solution and application. After a brief introduction to performance and dependability evaluation in general, we introduce discrete-time. Markov chains, continuous-time Markov chains and semi-Markov chains. Stepwisely, we develop the main equations that govern the steady-state and the transient behaviour of such Markov chains. We thereby emphasise on intuitively appealing explanations rather than on mathematical rigor. The relation between the various Markov chain types is explained in detail. Then, we discuss means to numerically solve the systems of linear equations (both direct and iterative ones) and the systems of differential equations that arise when solving for the steady-state and transient behaviour of Markovian models.
Multiprotocol over ATM: Building State of the Art ATM Intranets, Utilizing RSVP, Nhrp, Lane, Flow Switching, and WWW Technology
Authors: Andrew Schmidt, Daniel Minoli
Venue:  (1998)

:Networks constructed with current ATM protocol design standards exceed by far former network capabilities. Unfortunately, this new ATM power and flexibility come at the cost of greater complexity. With the detailed coverage of the entire set of protocols in this book, you can be equal to the task. If you're a network manager or designer responsible for planning, building or managing an enterprise or campus network, this book is for you.
ICQ for Dummies
Authors: Peter Weverka, Michael Taylor
Venue:  (1999)

:Now that AOL owns ICQ (named after the Internet abbreviation for "I seek you"), thousands of new users are reaching out and touching someone online with this increasingly popular messaging and chat system. ICQ For Dummies tells readers everything they need to know to get started chatting with anyone anywhere in the world. This fun, easy-to-use reference helps readers navigate the many user options, organize lists of like-minded chatterers, understand the personal security issues of online communication, an even create Web pages that link to other ICQ members.
The Combinatorial Structure of Wait-Free Solvable Tasks
Authors: Hagit Attiya, Sergio Rajsbaum
Venue: SIAM Journal on Computing (2002)

This paper presents a self-contained study of wait-free solvable tasks. A new necessary condition for wait-free solvability, based on a restricted set of executions, is proved. This set of executions induces a very simple-to-understand structure, which is used to prove tight bounds for k-set consensus and renaming. The framework is based on topology, but uses only elementary combinatorics, and, in contrast to previous works, does not rely on algebraic or geometric arguments.
Reducing the number of AD passes for computing a sparse Jacobian matrix
Authors: Shahadat Hossain, Trond Steihaug
Venue: Automatic differentiation of algorithms: from simulation to optimization (2000)

A reduction in the computational work is possible if we do not require that the nonzeros of a Jacobian matrix be determined directly. If a column or row partition is available, the proposed substitution technique can be used to reduce the number of groups in the partition further. In this chapter, we present a substitution method to determine the structure of sparse Jacobian matrices efficiently using forward, reverse, or a combination of forward and reverse modes of AD. Specifically, if it is true that the difference between the maximum number of nonzeros in a column or row and the number of groups in the corresponding partition is large, then the proposed method can save many AD passes. This assertion is supported by numerical examples.
How to Use Microsoft Publisher 98
Authors: Rebecca Reese, Kathy Ivens
Venue:  (1998)

:How to Use presents you with a straightforward, visual approach to learning. The steps and graphics guide you through every task you'll need to perform in Microsoft Publisher 98. Use Publisher's wizards to easily create expertly designed publications. Dress up your words with fonts, styles, and graphics. Learn to arrange text and pictures for a professional-looking layout. Create your own logos and drawings. Publish your work to paper or to the Web.
Data Structures with STL, 1st edition
Authors: William H. Murray, Chris H. Pappas
Venue:  (2000)

: Learn data structures and the C++ Standard Template Library together! Teaches the advanced C++ features you need to know first Easy techniques based on real code examples Supercharge C++ code performance-and your own productivity! Supercharge your C++ code! Master data structures and STL together! When you understand data structures, you can command many of the most powerful, efficient algorithms ever created! Better yet, the C++ Standard Template Library bundles dozens of these advanced algorithms in a simple, reliable, easy-to-use form. Now, you can learn data structures and STL together, with the first book that teaches them both: Data Structures with STL! Renowned programming instructors William Murray and Chris Pappas begin with the intermediate-to-advanced C++ features you'll need to know first, including namespaces, void * pointers, generic types, and template development. Then, using extensive code examples, they introduce every aspect of working with data structures and STL: Understanding STL extensible framework and components Working with STL: containers, iterators, and algorithms Dynamic memory allocation/deallocation STL-based portable solutions for array creation, element insertion/deletion, sorting, element output, and more Clean, seamless integration of iostreams and exception handling Now's your chance to supercharge the performance and reliability of all your C++ codeand dramatically enhance your own productivity at the same time. Data Structures with STL shows you how-more simply and easily than you ever thoughtpossible!
Microsoft Systems Management Server 2.0 Training Kit with CD-ROM, 1st edition
Authors: Microsoft Corporation
Venue:  (1999)

:Gain a practical understanding of the SMS architecture by installing, configuring, and supporting the centralized management software for Windows-based systems, whether setting up a 20-node workgroup or a 100,000-desktop enterprise-wide system. Other topics include remote help desk support, inventory collection and data management, and setting up secondary and multiple sites. Experience Level: Intermediate/ Advanced
Taking a Walk in a Planar Arrangement
Authors: Sariel Har-Peled
Venue: SIAM Journal on Computing (2000)

We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perform online walks inside such an arrangement (i.e., compute all the faces that a curve, given in an online manner, crosses) and to compute a level in an arrangement, both in an output-sensitive manner. The expected running time of the algorithm is $O(\lambda_{t+2}(m+n)\log n)$, where m is the number of intersections between the walk and the given arcs. No similarly efficient algorithm is known for the general case of arcs. For the case of lines and for certain restricted cases involving line segments, our algorithm improves the best known algorithm of [M. H. Overmars and J. van Leeuwen, J. Comput. System Sci., 23 (1981), pp. 166--204] by almost a logarithmic factor.
3D MURALE: a multimedia system for archaeology
Authors: John Cosmas, Take Itegaki, Damian Green, Edward Grabczewski, Fred Weimer, Luc Van Gool, Alexy Zalesny, Desi Vanrintel, Franz Leberl, Markus Grabner, Konrad Schindler, Konrad Karner, Michael Gervautz, Stefan Hynst, Marc Waelkens, Marc Pollefeys, Roland DeGeest, Robert Sablatnig, Martin Kampel
Venue: Proceedings of the 2001 conference on Virtual reality, archeology, and cultural heritage (2001)

This paper introduces the 3D Measurement and Virtual Reconstruction of Ancient Lost Worlds of Europe system (3D MURALE). It consists of a set of tools for recording, reconstructing, encoding, visualising and database searching/querying that operate on buildings, building parts, statues, statue parts, pottery, stratigraphy, terrain geometry and texture and material texture. The tools are loosely linked together by a common database on which they all have the facility to store and access data. The paper describes the overall architecture of the 3D MURALE system and then briefly describes the functionality of the tools provided by the project. The paper compares the multimedia studio architecture adopted in this project with other multimedia studio architectures.
Query Decomposition for a Distributed Object-Oriented Mediator System
Authors: Vanja Josifovski, Tore Risch
Venue: Distributed and Parallel Databases (2002)

The mediator-wrapper approach to integrate data from heterogeneous data sources has usually been centralized in the sense that a single mediator system is placed between a number of data sources and applications. As the number of data sources increases, the centralized mediator architecture becomes an administrative and performance bottleneck. This paper presents a query decomposition algorithm for a distributed mediation architecture where the communication among the mediators is on a higher level than the communication between a mediator and a data source. Some of the salient features of the proposed approach are: (i) exploring query execution schedules that contain data flow to the sources, necessary when integrating object-oriented sources that provide services (programs) and not only data&semi; (ii) handling of functions with multiple implementations at more than one mediator or source&semi; (iii) multi-phase query decomposition using a combination of heuristics and cost-based strategies&semi; (iv) query plan tree rebalancing by distributed query recompilation.
Microsoft Project 98 Step by Step with Cdrom
Authors: Timothy D. Johnson
Venue:  (1997)

:The easy-to-follow lessons include clear objectives and real-world business examples so users can learn exactly what they need to know, at their own speed. Managers can more effectively communicate information throughout their organizations by putting the powerful features of Microsoft Project 98 to work.