ppxscal/embedding_network huggingface dataset:
Jini Example by Example
Authors: Keith Edwards, Tom Rodden
Venue:  (2001)

:Learn Jini 1.1 technology via code examplesFor the entire project lifecycle: design and coding through administrationCoverage of ServiceUI and Surrogate ArchitectureContains a start-to-finish application code for all aspects of JiniIncluding JavaSpaces and wrapper codeFrom Keith Edwards, author of best-seller Core Jini 2nd editionMaster Jini technology development example by example. . . .With the Jini 1.1 release, Jini network technology is rapidly maturing into a great solution for networking devices of all kinds, from wireless PDAs to servers to household appliances. Pragmatic and concise, Jini Example by Example presents techniques and real code for building reliable, high-performance Jini systems. Co-authored by Keith Edwards, author of the best-seller Core Jini 2nd edition, this book offers practical techniques and solutions you can use right now. Coverage includes: A high-level "overflight" of the philosophy and principles of Jini technologyAn introduction to the Jini Framework: program structure, clients, servers, RMI, and Jini ServicesExpert guidance and sample code for managing leasing and remote events A start-to-finish application case study, offering insight into how Jini systems work and what they can doPractical "wrapper" techniques for leveraging existing components Advanced JavaSpaces solutions for storing and managing the objects Jini services rely uponJini Example by Example presents insiders' understanding for the entire application lifecycle: design, coding, deployment,administration, and more.
Accessible Access with Cdrom
Authors: Mark Whitehorn, Bill Marklyn
Venue:  (2000)

:About the Book: Accessible Access 2000 assumes that you start with no knowledge of Access or databases and takes you to the point where you can create and use a multi-table database.
CCNP Routing Exam Cram Personal Trainer
Authors: Jeremy McGrew, Brian Morgan, Eric McMasters
Venue:  (2001)

:Groundbreaking, customizable certification training product that takes the exam-focused content of the Exam Cram book and combines it with unique software to create a fully integrated electronic course. The CCNP Routing Exam Cram Personal Trainer is the ultimate answer for candidates preparing for the CCNP Routing exam (640-503). Practice test questions and simulations linked to book content provide a powerful learning environment that helps candidates understand difficult test concepts like building scalable internetworks, managing IP traffic, configuring OSPF, and controlling routing updates. The Personal Trainer's browser-like interface is easy to use and provides a helpful Self-Assessment feature to personalize study sessions. Also includes practice test questions and free question updates after registering online.
Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
Authors: Krzysztof C. Kiwiel, Bozena Lopuch
Venue: SIAM Journal on Optimization (1997)

We present methods for finding common fixed points of finitely many firmly nonexpansive mappings on a Hilbert space. At every iteration, an approximation to each mapping generates a halfspace containing its set of fixed points. The next iterate is found by projecting the current iterate on a surrogate halfspace formed by taking a convex combination of the halfspace inequalities. This acceleration technique extends one for convex feasibility problems (CFPs), since projection operators onto closed convex sets are firmly nonexpansive. The resulting methods are block iterative and, hence, lend themselves to parallel implementation. We extend to accelerated methods some recent results of Bauschke and Borwein [SIAM Rev., 38 (1996), pp. 367--426] on the convergence of projection methods.
Flash Actionscript for Dummies with Cdrom
Authors: Doug Sahlin
Venue:  (2001)

:Add interactive FlashScript to take your Flash movies to the limit! ActionScript gives you the power to turn your Flash creations into awesome interactive applications. But how do you get up to speed on all those ActionScript actions, objects, functions, and operators? Relax! With tips and tutorials from Web graphics expert Doug Sahlin, you'll be creating animated buttons, online quiz games, and custom cursors in no time!
Crisp Approach to Beginning WordPerfect 5.1 for Nontechnical Business Users
Authors: Mark Workman
Venue:  (1993)

:The latest book in the style of the successful crisp 50-minute series! These new A Crisp Approach to... books provide the most important, basic skills you need to learn about the most widely used software in today's business world, such as WordPerfect, Lotus, DOS, and Excel. No other books are as easy to use during the first 50 minutes on your computer!
Undergraduate computational science and engineering programs and courses
Authors: Peter R Turner, Angela B Shiflet, Steve Cunningham, Kris Stewart, Andrew T Phillips, Ignatios E Vakalis
Venue: Proceedings of the 33rd SIGCSE technical symposium on Computer science education (2002)

This 90-minute panel session will discuss recent and future developments in incorporating Computational Science and Engineering into the undergraduate curriculum. There is a companion session devoted to tools and techniques and so the focus here is on programs and courses.The panelists will demonstrate a clear uniformity of purpose but a wide variety of approaches to increasing the CSE experience of undergraduates in different types of schools.The schools represented vary from large state universities to small private liberal arts colleges and a medium-sized school with a strong engineering bias.The approaches adopted also differ. There are complete programs built largely from existing courses, specific courses that are added to established programs to allow a student to follow an emphasis in CSE. The introduction of CSE into existing programs through faculty advice and education has also been successful.Yet other approaches represented among the panelists are the introduction of multi-disciplinary team-taught project-based courses as a springboard for growing an undergraduate CSE program including undergraduate research projects. The incremental use of small add-on courses to supplement conventional mathematics offerings with some CSE content has also been used successfully.Another approach represented on the panel is the use of a particular vehicle --- in this case graphics and visualization --- to introduce key ideas of CSE into regular parts of the curriculum.The unifying theme of the panel --- the desire to improve undergraduate CSE education will be evident throughout. By presenting a wide variety of approaches to achieve this end, it is hoped that any audience participants who wish to create a CSE thread in their own programs will find some ideas to help them. Some of the practical and political issues will also be discussed in the various contexts.The program for the panel would allow each panelist a maximum of 10 minutes to outline their programs and approaches. The remaining 30 (or more) minutes would then be reserved for general discussion and questions and contributions from the audience.
Automatic drafting systems: an effective person-machine interface
Authors: Carl Machover
Venue: ACM SIGGRAPH Computer Graphics (1976)

A primary advantage of computer graphics is that a comfortable environment can be created for an individual to communicate with a computer. A properly people-designed automatic drafting system is an excellent example of such an environment.
Elementary Statistics, 2nd edition
Authors: Neil A. Weiss
Venue:  (1992)

:Now in its Fourth Edition, Weiss has a reputation for being thorough and precise, and for using real data extensively throughout. Case studies are introduced at the beginning of the chapters and discussed at the end, showing students the links between the subject matter and how the material can be used in real life.
3ds max 4 in Depthh with CD-ROM
Authors: Rob Polevoi, Jon McFarland
Venue:  (2000)

:3ds max™ 4 In Depth provides readers with a comprehensive reference for creating effects for film, movies, and games. This book covers the modeling and modification of structures from primitive objects, plus other parametric design tools found in the program. 3ds max™ 4 In Depth contains various projects to strengthen concepts learned with a color studio to showcase the results. CD-ROM is included with maps or clips needed for each exercise.
Tight bounds on cache use for stencil operations on rectangular grids
Authors: Michael A. Frumkin, Rob F. Van der Wijngaart
Venue: Journal of the ACM (JACM) (2002)

We derive tight bounds on cache misses for evaluation of explicit stencil operators on rectangular grids. Our lower bound is based on the isoperimetric property of the discrete crosspolytope. Our upper bound is based on a good surface-to-volume ratio of a parallelepiped spanned by a reduced basis of the interference lattice of a grid. Measurements show that our algorithm typically reduces the number of cache misses by a factor of three, relative to a compiler optimized code. We show that stencil calculations on grids whose interference lattices have a short vector feature abnormally high numbers of cache misses. We call such grids unfavorable and suggest to avoid these in computations by appropriate padding. By direct measurements on a MIPS R10000 processor we show a good correlation between abnormally high numbers of cache misses and unfavorable three-dimensional grids.
A Jacobi--Davidson Type Method for a Right Definite Two-Parameter Eigenvalue Problem
Authors: Michiel E. Hochstenbach, Bor Plestenjak
Venue: SIAM Journal on Matrix Analysis and Applications (2002)

We present a new numerical iterative method for computing selected eigenpairs of a right definite two-parameter eigenvalue problem. The method works even without good initial approximations and is able to tackle large problems that are too expensive for existing methods. The new method is similar to the Jacobi--Davidson method for the eigenvalue problem. In each step, we first compute Ritz pairs of a small projected right definite two-parameter eigenvalue problem and then expand the search spaces using approximate solutions of appropriate correction equations. We present two alternatives for the correction equations, introduce a selection technique that makes it possible to compute more than one eigenpair, and give some numerical results.
Configuring Awareness
Authors: Christian Heath, Marcus Sanchez Svensson, Jon Hindmarsh, Paul Luff, Dirk vom Lehn
Venue: Computer Supported Cooperative Work (2002)

The concept of awareness has become of increasing importance to both social and technical research in CSCW. The concept remains however relatively unexplored, and we still have little understanding of the ways in which people produce and sustain `awareness' in and through social interaction with others. In this paper, we focus on a particular aspect of awareness, the ways in which participants design activities to have others unobtrusively notice and discover, actions and events, which might otherwise pass unnoticed. We consider for example how participants render visible selective aspects of their activities, how they encourage others to notice features of the local milieu, and how they encourage others to become sensitive to particular events. We draw examples from different workplaces, primarily centres of coordination&semi; organisational environments which rest upon the participants' abilities to delicately interweave a complex array of highly contingent, yet interdependent activities.
Microsoft Visualbasic.Net Professional Projects
Authors: Kuljit Kaur, Pooja Bembey
Venue:  (2002)

:Incorporating five hands-on projects, Microsoft Visual Basic .NET Professional Projects is your key to unlocking the power of Visual Basic .NET. Each project focuses on a specific Visual Basic .NET concept and is based on a real-world situation. You will be able to use the skills that you develop throughout the book to modify the projects as needed to fit your professional needs.
Approximating the Single-Sink Link-Installation Problem in Network Design
Authors: F. S. Salman, J. Cheriyan, R. Ravi, S. Subramanian
Venue: SIAM Journal on Optimization (2000)

We initiate the algorithmic study of an important but NP-hard problem that arises commonly in network design. The input consists of the following: An undirected graph with one sink node and multiple source nodes, a specified length for each edge, and a specified demand, demv, for each source node v. A small set of cable types, where each cable type is specified by its capacity and its cost per unit length. The cost per unit capacity per unit length of a high-capacity cable may be significantly less than that of a low-capacity cable, reflecting an economy of scale; i.e., the payoff for buying at bulk may be very high. The goal is to design a minimum-cost network that can (simultaneously) route all the demands at the sources to the sink by installing zero or more copies of each cable type on each edge of the graph. An additional restriction is that the demand of each source must follow a single path. The problem is to find a route from each source node to the sink and to assign capacity to each edge of the network such that the total costs of cables installed are minimized. We call this problem the single-sink link-installation problem. For the general problem, we introduce a new "moat-type" lower bound on the optimal value and we prove a useful structural property of near-optimal solutions: For every instance of our problem, there is a near-optimal solution whose graph is acyclic (with a cost no more than twice the optimal cost). We present efficient approximation algorithms for key special cases of the problem that arise in practice. For points in the Euclidean plane, we give an approximation algorithm with performance guarantee O(log (D/u1)), where D is the total demand and u1 is the smallest cable capacity. When the metric is arbitrary, we consider the case where the network to be designed is restricted to be two level; i.e., every source-sink path has at most two edges. For this problem, we present an algorithm with performance guarantee O(log n), where n is the number of nodes in the input graph, and also show that this performance guarantee is nearly best possible.
Strategies for processing ad hoc queries on large data warehouses
Authors: Kurt Stockinger, Kesheng Wu, Arie Shoshani
Venue: Proceedings of the 5th ACM international workshop on Data Warehousing and OLAP (2002)

As data warehousing applications grow in size, existing data organizations and access strategies, such as relational tables and B-tree indexes, are becoming increasingly ineffective. The two primary reasons for this are that these datasets involve many attributes and the queries on the data usually involve conditions on small subsets of the attributes. Two strategies are known to address these difficulties well, namely vertical partitioning and bitmap indexes. In this paper, we summarize our experience of implementing a number of bitmap index schemes on vertically partitioned data tables. One important observation is that simply scanning the vertically partitioned data tables is often more efficient than using B-tree based indexes to answer ad hoc range queries on static datasets. For these range queries, compressed bitmap indexes are in most cases more efficient than scanning vertically partitioned tables. We evaluate the performance of two different compression schemes for bitmap indexes stored is various ways. Using the compression scheme called Word-Aligned Hybrid Code (WAH) to store the bitmaps in plain files shows the best overall performance for bitmap indexes. Tests indicate that our bitmap index strategy based on WAH is not only efficient for attributes of low cardinality, say, <100, but also for high-cardinality attributes with 200,000 or more distinct values.
Disappearing Cryptography: Information Hiding: Steganography and Watermarking (2nd Edition), 2nd edition
Authors: Peter Wayner
Venue:  (2002)

:Disappearing Cryptography, Second Edition describes how to take words, sounds, or images and hide them in digital data so they look like other words, sounds, or images. When used properly, this powerful technique makes it almost impossible to trace the author and the recipient of a message. Conversations can be submerged in the flow of information through the Internet so that no one can know if a conversation exists at all. This full revision of the best-selling first edition describes a number of different techniques to hide information. These include encryption, making data incomprehensible; steganography, embedding information into video, audio, or graphics files; watermarking, hiding data in the noise of image or sound files; mimicry, "dressing up" data and making it appear to be other data, and more. The second edition also includes an expanded discussion on hiding information with spread-spectrum algorithms, shuffling tricks, and synthetic worlds. Each chapter is divided into sections, first providing an introduction and high-level summary for those who want to understand the concepts without wading through technical explanations, and then presenting greater detail for those who want to write their own programs. To encourage exploration, the author's Web site contains implementations for hiding information in lists, sentences, and images. About the Author: Peter Wayner is a writer living in Baltimore and is the author of Digital Cash and Agents at Large (both Academic Press). His writings appear in numerous academic journals as well as the pages of more popular forums such as MacWorld and the New York Times. He has taught various computer science courses at Cornell University and Georgetown University.
Specification-based anomaly detection: a new approach for detecting network intrusions
Authors: R. Sekar, A. Gupta, J. Frullo, T. Shanbhag, A. Tiwari, H. Yang, S. Zhou
Venue: Proceedings of the 9th ACM conference on Computer and communications security (2002)

Unlike signature or misuse based intrusion detection techniques, anomaly detection is capable of detecting novel attacks. However, the use of anomaly detection in practice is hampered by a high rate of false alarms. Specification-based techniques have been shown to produce a low rate of false alarms, but are not as effective as anomaly detection in detecting novel attacks, especially when it comes to network probing and denial-of-service attacks. This paper presents a new approach that combines specification-based and anomaly-based intrusion detection, mitigating the weaknesses of the two approaches while magnifying their strengths. Our approach begins with state-machine specifications of network protocols, and augments these state machines with information about statistics that need to be maintained to detect anomalies. We present a specification language in which all of this information can be captured in a succinct manner. We demonstrate the effectiveness of the approach on the 1999 Lincoln Labs intrusion detection evaluation data, where we are able to detect all of the probing and denial-of-service attacks with a low rate of false alarms (less than 10 per day). Whereas feature selection was a crucial step that required a great deal of expertise and insight in the case of previous anomaly detection approaches, we show that the use of protocol specifications in our approach simplifies this problem. Moreover, the machine learning component of our approach is robust enough to operate without human supervision, and fast enough that no sampling techniques need to be employed. As further evidence of effectiveness, we present results of applying our approach to detect stealthy email viruses in an intranet environment.
Assessment of a High Resolution Centered Scheme for the Solution of Hydrodynamical Semiconductor Equations
Authors: A. Marcello Anile, Nikolaos Nikiforakis, Rosa M. Pidatella
Venue: SIAM Journal on Scientific Computing (2000)

Hydrodynamical models are suitable to describe carrier transport in submicron semiconductor devices. These models have the form of nonlinear systems of hyperbolic conservation laws with source terms, coupled with Poisson's equation. In this article we examine the suitability of a high resolution centered numerical scheme for the solution of the hyperbolic part of these extended models, in one space dimension. Because of the lack of physically significant exact analytical solutions, the method is assessed against a benchmark for the system of compressible, unsteady Euler equations with source terms, which has an exact solution; the latter is shown to be nearly identical to the numerical one. The method is then used to solve the extended hydrodynamical model (EM) based on the maximum entropy closure recently introduced by Anile, Romano, and Russo, simulating a ballistic diode n+-n-n+, which models a metal oxide semiconductor field effect transistor (MOSFET) channel. Results are presented for the reduced- and full-equation EM formulation at steady state, for an initially discontinuous electron density at the junctions. Transient results show the evolution of highly nonlinear waves emanating from the neighborhood of the junctions.
Word 2000 Essentials Advanced, 1st edition
Authors: Keith Mulbery
Venue:  (1999)

:The Essentials series is conceived as a learning system that combines graphics, instructions, experience, reinforcement, and problem solving. It consists of modular lessons that are built around a series of numbered, step-by-step procedures that are clear, concise, and easy to review. Explanatory material is interwoven before each lesson and between the steps. For anyone interested in learning Microsoft Office 2000.
Finding the flow in web site search
Authors: Marti Hearst, Ame Elliott, Jennifer English, Rashmi Sinha, Kirsten Swearingen, Ka-Ping Yee
Venue: Communications of the ACM (2002)

Designing a search system and interface may best be served (and executed) by scrutinizing usability studies.
Implementing AS/400 Security, 3rd edition
Authors: Wayne Madden, Carol Woodbury
Venue:  (1998)

:Concise and practical, this third edition not only provides the fundamentals of implementing a security strategy, it offers the specifics on the latest security enhancements to the AS/400 system. Madden explains everything users need to know about security exposures and how to prevent them.
PhotoShop 5.5 Artistry: A Master Class for Photographers, Artists, and Production Artists
Authors: Barry Haynes, Wendy Crumpler
Venue:  (2000)

:Photoshop 5.5 Artistry is for serious photographers who gravitate to using digital technology and the Web as their processing and distribution tools of choice. New Riders is here with the updated version of Photoshop 5 Artistry, including material that covers all of Photoshop 5.5's new critical features. This book is an in-depth course on digital imaging for intermediate and advanced users who want to create the best possible photographic images. Over fifty small sections show you a focused approach to doing specific tasks. As you work through chapters and step-by-step, hands-on excercises, you will gain in-depth understanding of the complex topics, such as calibration and ICC color management, and master the relationship between Photoshop tools.
Exploring Calculus with Mathematica for the MacIntosh Interface, 1st edition
Authors: Millianne Lehmann, James K. Finch
Venue:  (1992)

:This easy-to-use manual enhances the fundamental concepts of calculus using Mathematica. Intended for use in a laboratory setting, a wide range of calculus concepts are developed and investigated through a series of exploratory activities.