ppxscal/embedding_network huggingface dataset:
Microsoft Access 2 Bible, 2nd edition
Authors: Cary N. Prague, Michael R. Irwin
Venue:  (1994)

:Nationally bestselling authors and database pros Cary Prague and Michael Irwin have teamed up to bring you the authoritative guide to one of the most popular and powerful PC database programs around. PC World Microsoft Access 2 Bible, 2nd Edition, provides you with hundreds of tips and shortcuts to help you create powerful databases, reports, and queries with Access. You'll discover how to Create and maintain database tables and relationships, and establish referential integrity Fashion useful data-entry forms complete with data validation Set up multitable reports, including group summaries, totals, calculations, and mail merge reports and labels Build multitable queries to turn your data into valuable information you can use Create macros and save time by automating Access tasks such as data manipulation, menus, and dialog boxes Import external data files from dBASE, Paradox, SQL Server, Excel, 1-2-3, and FoxPro Add pictures and graphics to your forms and reports for a professional look Take advantage of built-in Control Wizards Plus, the bonus disk you get with PC World Microsoft Access 2 Bible, 2nd Edition, features A complete application built with Microsoft Access 2 Sample database tables Complex data-entry forms Multitable reports Complete macro examples Menus and switchboards Sample form and button add-on software
An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
Authors: Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa Przytycka, Mikkel Thorup
Venue: SIAM Journal on Computing (2000)

The maximum agreement subtree problem is the following. Given two rooted trees whose leaves are drawn from the same set of items (e.g., species), find the largest subset of these items so that the portions of the two trees restricted to these items are isomorphic. We consider the case which occurs frequently in practice, i.e., the case when the trees are binary, and give an O(nlog n) time algorithm for this problem.
Physically-based visual simulation on graphics hardware
Authors: Mark J. Harris, Greg Coombe, Thorsten Scheuermann, Anselmo Lastra
Venue: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware (2002)

In this paper, we present a method for real-time visual simulation of diverse dynamic phenomena using programmable graphics hardware. The simulations we implement use an extension of cellular automata known as the coupled map lattice (CML). CML represents the state of a dynamic system as continuous values on a discrete lattice. In our implementation we store the lattice values in a texture, and use pixel-level programming to implement simple next-state computations on lattice nodes and their neighbors. We apply these computations successively to produce interactive visual simulations of convection, reaction-diffusion, and boiling. We have built an interactive framework for building and experimenting with CML simulations running on graphics hardware, and have integrated them into interactive 3D graphics applications.
A Multiresolution Approach to Regularization of Singular Operators and Fast Summation
Authors: Gregory Beylkin, Robert Cramer
Venue: SIAM Journal on Scientific Computing (2002)

Singular and hypersingular operators are ubiquitous in problems of physics, and their use requires a careful numerical interpretation. Although analytical methods for their regularization have long been known, the classical approach does not provide numerical procedures for constructing or applying the regularized operator. We present a multiresolution definition of regularization for integral operators with convolutional kernels which are homogeneous or associated homogeneous functions. We show that our procedure yields the same operator as the classical definition. Moreover, due to the constructive nature of our definition, we provide concise numerical procedures for the construction and application of singular and hypersingular operators. As an application, we present an algorithm for fast computation of discrete sums and briefly discuss several other examples.
MCSE: Networking Essentials Study Guide with CDROM, 3rd edition
Authors: James Chellis, Charles Perkins, Matthew Strebe
Venue:  (1999)

:Here's the book you need to prepare for Exam 70-058, Networking Essentials. This Microsoft Certified Professional Approved Study Guide provides: Full coverage of every exam objective-all the information you need to know Practical information on applying networking concepts in the real world Hundreds of challenging review questions, in the book and on the CD Cutting-edge test prep software, including product simulations, adaptive testing, and electronic flashcards (in both PC and Palm format) Authoritative coverage of critical exam topics, including: Mastering PC fundamentals Understanding network components Understanding how networks work in the real world Designing a LAN Configuring a network server Configuring network clients Administering a network Providing remote access Scaling a network Setting up a Wide Area Network Mastering network protocols Troubleshooting Featured on the CDs On the first enclosed CD, you'll find the Network Press Edge Test for the Networking Essentials exam--custom preparation software that lets you test your knowledge of the material under exam conditions. This testing program has been expanded to include bonus questions available only on the CD, as well as simulated adaptive testing capabilities. You'll also find product simulation software that shows you how Microsoft software works in actual implementations--invaluable preparation for Microsoft's tough new simulation questions. Rounding out the package is an electronic flashcard program that you can use to reinforce your knowledge and identify weak spots, now available for both your PC and your Palm device. The second CD is part of Learnkey's Networking Essentials course, providing interactive computer-based training on key topics for the Microsoft exam. Study with expert video instruction, then use the interactive exercises to test your knowledge. About the Authors:James Chellis, MCP, is President of EdgeTek Technical Education, a national network training company and Microsoft Solution Provider specializing in Windows NT. He has co-authored eight Network Press MCSE Study Guides. Charles Perkins is an MCSE with years of experience managing local and wide area networks. Co-author of five Network Press MCSE Study Guides and former Director of Computing Services for the University of Utah College of Law, he is now a consultant specializing in Windows NT. Matthew Strebe, MCSE, is co-author of four Network Press MCSE study guides and owner of Netropolis, a network integration firm specializing in high-speed networking and Windows NT.
Tribes 2: Prima's Official Strategy Guide
Authors: Joe Grant Bell
Venue:  (2000)

:Tactics for all weapons and vehicles, including the new onesInsight into the characteristics of each armor typeTips on personalizing your equipment to gain the winning edgePointers for every mission type, including: Capture and Hold, Flag Hunters, Rabbit, and Siege
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Venue: International Conference on Principles and Practice of Declarative Programming (2002)

Together with the Seventh International ACM SIGPLAN Conference on Functional Programming (ICFP'02), the Generative Programming and Component Engineering Conference (GPCE'02) and a number of associated workshops, PPDP'02 has formed a federation of conferences known as Colloquium on Principles, Logics, and Implementations of high-level programming languages (PLI 2002). Previous PLI colloquia were held in Paris, in September 1999, in Montréal, in September 2000 and in Firenze, in September 2001. These events are organized by SIGPLAN, ACM's Special Interest Group on Programming Languages.PPDP aims to stimulate research on the use of declarative methods in programming and on the design, implementation and application of programming languages that support such methods. Topics of interest include any aspect related to understanding, integrating and extending programming paradigms such as those for logic, functional, constraint, probabilistic, rule and object-oriented programming; concurrent extensions and mobile computing; type theory; support for modularity; use of logical methods in the design of program development tools; program analysis and verification; abstract interpretation; development of implementation methods; application of the relevant paradigms and associated methods in industry and education.A total of 36 submissions (33 regular papers and 3 system descriptions) were received in response to the call for papers. The ConfMan conference management system was used for the handling of electronic submissions, for allocation of reviewing duties, and for filing of reviews. The program committee meeting was conducted electronically. Each paper was reviewed by at least three referees and 18 papers including 2 system presentations were selected for publication.Because practice has an important place in the conference, we decided to give to system presentations a similar place in the proceedings and in the program than to the regular papers.In addition to the selected presentations, the scientific program included three invited talks, by Neil Jones (University of Copenhagen), Catuscia Palamidessi (The Pennsylvania State University), and Janos Sztipanovits (Vanderbilt University).
A general-purpose compression scheme for large collections
Authors: Adam Cannane, Hugh E. Williams
Venue: ACM Transactions on Information Systems (TOIS) (2002)

Compression of large collections can lead to improvements in retrieval times by offsetting the CPU decompression costs with the cost of seeking and retrieving data from disk. We propose a semistatic phrase-based approach called xray that builds a model offline using sample training data extracted from a collection, and then compresses the entire collection online in a single pass. The particular benefits of xray are that it can be used in applications where individual records or documents must be decompressed, and that decompression is fast. The xray scheme also allows new data to be added to a collection without modifying the semistatic model. Moreover, xray can be used to compress general-purpose data such as genomic, scientific, image, and geographic collections without prior knowledge of the structure of the data. We show that xray is effective on both text and general-purpose collections. In general, xray is more effective than the popular gzip and compress schemes, while being marginally less effective than bzip2. We also show that xray is efficient: of the popular schemes we tested, it is typically only slower than gzip in decompression. Moreover, the query evaluation costs of retrieval of documents from a large collection with our search engine is improved by more than 30&percnt; when xray is incorporated compared to an uncompressed approach. We use simple techniques for obtaining the training data from the collection to be compressed and show that with just over 4&percnt; of data the entire collection can be effectively compressed. We also propose four schemes for phrase-match selection during the single pass compression of the collection. We conclude that with these novel approaches xray is a fast and effective scheme for compression and decompression of large general-purpose collections.
Space-time points: 4d splatting on efficient grids
Authors: Neophytos Neophytou, Klaus Mueller
Venue: Proceedings of the 2002 IEEE symposium on Volume visualization and graphics (2002)

4D datasets, such as time-varying datasets, usually come on 4D Cartesian Cubic (CC) grids. In this paper, we explore the use of 4D Body Centered Cubic (BCC) grids to provide a more efficient sampling lattice. We use this lattice in conjunction with a point-based renderer that further reduces the data into an RLE-encoded list of relevant points. We achieve compression ranging from 50 to 80% in our experiments. Our 4D visualization approach follows the hyperslice paradigm: the user first specifies a 4D slice to extract a 3D volume, which is then viewed using a regular point-based full volume renderer. The slicing of a 4D BCC volume yields a 3D BCC volume, which theoretically has 70% of the datapoints of an equivalent CC volume. We reach compressions close to this in practice. The visual quality of the rendered BCC volume is virtually identical with that obtained from the equivalent CC volume, at 70-80% of the CC grid rendering time. Finally, we also describe a 3.5D visualization approach that uses motion blur to indicate the transition of objects along the dimension orthogonal to the extracted hyperslice in one still image. Our approach uses interleaved rendering of a motion volume and the current iso-surface volume to add the motion blurring effect with proper occlusion and depth relationships.
Fundamentals of Neural Network Modeling: Neuropsychology and Cognitive Neuroscience, 1st edition
Authors: Randolph W. Parks, Daniel S. Levine, Debra L. Long
Venue:  (1998)

:Over the past few years, computer modeling has become more prevalent in the clinical sciences as an alternative to traditional symbol-processing models. This book provides an introduction to the neural network modeling of complex cognitive and neuropsychological processes. It is intended to make the neural network approach accessible to practicing neuropsychologists, psychologists, neurologists, and psychiatrists. It will also be a useful resource for computer scientists, mathematicians, and interdisciplinary cognitive neuroscientists. The editors (in their introduction) and contributors explain the basic concepts behind modeling and avoid the use of high-level mathematics.
Mutating network models to generate network security test cases
Authors: Ronald W. Ritchey
Venue: Mutation testing for the new century (2001)

Security testing is normally limited to the scanning of individual hosts with the goal of locating vulnerabilities that can be exploited to gain some improper level of access on the target network. Scanning is a successful approach for discovering security problems, but it suffers from two major problems, but it suffers form two major problems. First, it ignores security issues that can arise due to interactions of systems on a network. Second, it does not provide any concept of test coverage other than the obvious criteria of attempting all known exploitation techniques on every system on the network. In this paper, I present a new method for generating security test cases for a network. This method extends my previous work in model checking network security by defining mutant operators to apply to my previously defined network security model. The resulting mutant models are fed into a model checker to produce counterexamples. These counterexamples represent attack scenarios (test cases) that can be run against the network. I also define a new coverage criterion for network security that requires a much smaller set of exploits to be run against the network to verify the network's security.
Mean-Square and Asymptotic Stability of the Stochastic Theta Method
Authors: Desmond J. Higham
Venue: SIAM Journal on Numerical Analysis (2000)

Stability analysis of numerical methods for ordinary differential equations (ODEs) is motivated by the question "for what choices of stepsize does the numerical method reproduce the characteristics of the test equation?" We study a linear test equation with a multiplicative noise term, and consider mean-square and asymptotic stability of a stochastic version of the theta method. We extend some mean-square stability results in [Saito and Mitsui, SIAM. J. Numer. Anal., 33 (1996), pp. 2254--2267]. In particular, we show that an extension of the deterministic A-stability property holds. We also plot mean-square stability regions for the case where the test equation has real parameters. For asymptotic stability, we show that the issue reduces to finding the expected value of a parametrized random variable. We combine analytical and numerical techniques to get insights into the stability properties. For a variant of the method that has been proposed in the literature we obtain precise analytic expressions for the asymptotic stability region. This allows us to prove a number of results. The technique introduced is widely applicable, and we use it to show that a fully implicit method suggested by [Kloeden and Platen, Numerical Solution of Stochastic Differential Equations, Springer-Verlag, 1992] has an asymptotic stability extension of the deterministic A-stability property. We also use the approach to explain some numerical results reported in [Milstein, Platen, and Schurz, SIAM J. Numer. Anal., 35 (1998), pp. 1010--1019.]
The kinetic typography engine: an extensible system for animating expressive text
Authors: Johnny C. Lee, Jodi Forlizzi, Scott E. Hudson
Venue: Proceedings of the 15th annual ACM symposium on User interface software and technology (2002)

Kinetic typography --- text that uses movement or other temporal change --- has recently emerged as a new form of communication. As we hope to illustrate in this paper, kinetic typography can be seen as bringing some of the expressive power of film --- such as its ability to convey emotion, portray compelling characters, and visually direct attention --- to the strong communicative properties of text. Although kinetic typography offers substantial promise for expressive communications, it has not been widely exploited outside a few limited application areas (most notably in TV advertising). One of the reasons for this has been the lack of tools directly supporting it, and the accompanying difficulty in creating dynamic text. This paper presents a first step in remedying this situation --- an extensible and robust system for animating text in a wide variety of forms. By supporting an appropriate set of carefully factored abstractions, this engine provides a relatively small set of components that can be plugged together to create a wide range of different expressions. It provides new techniques for automating effects used in traditional cartoon animation, and provides specific support for typographic manipulations.
On Infinite Products of Fuzzy Matrices
Authors: Sy-Ming Guu, Yung-Yih Lur, Chin-Tzong Pang
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

In this paper, we study the convergence of infinite products of a finite number of fuzzy matrices, where the operations involved are max-min algebra. Two types of convergences in this context will be discussed: the weak convergence and strong convergence. Since any given fuzzy matrix can be "decomposed" of the sum of its associated Boolean matrices, we shall show that the weak convergence of infinite products of a finite number of fuzzy matrices is equivalent to the weak convergence of infinite products of a finite number of the associated Boolean matrices. Further characterizations regarding the strong convergence will be established. On the other hand, sufficient conditions for the weak convergence of infinite products of fuzzy matrices are proposed. A necessary condition for the weak convergence of infinite products of fuzzy matrices is presented as well.
Kris Jamsa's Starting with Visual Basic with CDROM
Authors: Rob Francis
Venue:  (2001)

:Visual Basic is a programming language and environment developed by Microsoft. It was one of the first products to provide a graphical programming environment and a paint metaphor for developing user interfaces. Kris Jamsa's Starting With Visual Basic, aimed at professional programmers who may be new to Visual Basic, examines all aspects of this technology. Each chapter contains reader exercises, completed example files, and multiple choice, true/false, and short answer questions. You will receive expert advice on design and development considerations for creating applications for SQL Server using Access. This book follows a step-by-step process and introduces you to the fundamental aspects of VB.
Performance of TCP/IP Over ATM Networks, 1st edition
Authors: Mahbub Hassan, Mohammed Atiquzzaman
Venue:  (2000)

:Gain an in-depth understanding of performance issues central to the planning, designing, and efficient operation of TCP/IP over ATM networks with this practical new book. Containing information essential to solving internetworking problems between TCP/IP and ATM networks, this book helps you guarantee quality of service for ATM applications and understand the enhancements required to run TCP over wireless links. Written by internationally recognized authorities in the field, this extremely comprehensive book provides a thorough discussion of TCP/IP and ATM design principles, network protocols, packet formats and more. It covers the latest developments in this exciting field and arms you with the knowledge you need to increase internetworking efficiency and better understand the protocol overhead in running TCP/IP and ATM.
Implications of a logical paradox for computer-dispensed justice
Authors: Joseph S. Fulda
Venue: ACM SIGCAS Computers and Society (2000)

We argue that the paradox of the preface suggests a reason why computers, no matter how expert, should not be permitted to judge criminal cases. This column normally comments on the work of others; we make an exception just this once.
Cars 2000: Computer Assisted Radiology and Surgery: Proceedings of the 14th International Congress and Exhibition, San Francisco,, 1st edition
Authors: Michael W. Vannier, Heinz U. Lemke
Venue:  (2000)

:Proceedings of the 14th International Congress and Exhibition, held in San Francisco, CA, on June 28-July 1, 2000. Focuses on the computer and communication tools assisting surgery. For radiologists, surgeons, computer scientists, and engineers.
Bias on the web
Authors: Abbe Mowshowitz, Akira Kawaguchi
Venue: Communications of the ACM (2002)

When it comes to measuring bias on the Web, there is clearly strength in numbers (of search engines, that is).
Signal Processing in C
Authors: Christopher E. Reid, Thomas B. Passin
Venue:  (1992)

:Recent advances have made digital signal processing (DSP) one of the fastest growing areas in digital technology, expanding into many new applications, particularly on personal computers. This serves as a fundamental C programming reference, providing well structured, easy-to-use signal processing algorithms. Emphasizes the use of these algorithms (rather than their mathematical derivations) as well as C programming techniques. Prepared by authors who have written many algorithms in C for both simulations and real-time embedded systems, it presents algorithms for all topics, including a standard interface to these routines. In addition, execution time/computational complexity, memory requirements and algorithm tradeoffs are discussed.
Multi-agent infrastructure, agent discovery , middle agents for Web services and interoperation
Authors: Katia Sycara
Venue: Mutli-agents systems and applications (2001)

This chapter has two parts. In Part I, we present an overview of issues in modeling Multi Agent Systems (MAS), discuss what features and components are required for a MAS infrastructure, and present a model of a generic infrastructure. In addition, we present RETSINA as an example of an implemented MAS infrastructure. In Part II, we present issues in agent and service discovery and interoperation through a set of domain independent active and intelligent registries, called middle agents.
Paradox 4.0
Authors: Sarah E. Hutchinson, Stacey C. Sawyer
Venue:  (1994)

:The IRWIN ADVANTAGE SERIES is a comprehensive set of software application lab manuals that covers a wide array of applications ranging from the most popular commercial packages. Each manual is designed for one hour application courses. When packaged together or with any IRWIN computer concepts textbook,we'll greatly reduce the price.