ppxscal/embedding_network huggingface dataset:
Essential CSS and DHTML for Web Professionals, 1st edition
Authors: Dan Livingston, Micah Brown
Venue:  (1999)

From the Book:PREFACE: Introduction When we first started learning DHTML, there were two kinds of books on the market: overly simplified, cutesy books that were appropriate for technophobic junior high schoolers; and huge reference tomes that could be used to prop up a house. But nothing actually taught us to build pages for real clients using stylesheets and DHTML. This book will guide you through stylesheets and DHTML using examples taken straight from our experience as Web designers and programmers. We'll start off with basic concepts and simple examples and work up to some pretty sophisticated effects and functionality. Now let's look at how this book is laid out and what DHTML can and can't do. How This Book Is Laid Out Most of us learn how to create content for the Web when we're forced to. Your boss was maybe impressed by something fancy another CEO showed her, and since you helped her with her e-mail once, you're the resident expert in all things Web. She wants you to implement some "DHTML stuff" on your company's Web site. You say, "No problem." You think, "OK, I have something to learn now." In our everyday lives this is often the way in which we expand our skills: We are given a job and if we don't know exactly how to do it, then we quickly learn how. In writing this book we decided to parallel the real world: This book is split into two main projects, and for each main project we will be responsible for the creation and/or upgrading of Web sites for two fictitious companies. In the first three chapters of the book we will be using DHTML to create the homepage for Shelley Biotechnologies, afast-growingbiotech startup. In each chapter we will have at least one subproject that will consist of commonly used DHTML. We'll keep the difficulty down and focus on the DHTML you'll need to know first. At the end of each chapter, there will be more advanced exercises that you can complete on your own to expand your skills. In the second half of the book we'll be creating an interactive storefront for Stitch Magazine's first foray into e-commerce. These tasks are more advanced than those found in the first project and will show you some of the powerful things you can do using DHTML. The exercises in the chapters are designed to give you a solid foundation in DHTML, as well as many advanced skills and techniques that will carry you through the vast majority of DHTML projects you'll encounter. You will find that more often than not there is more than one way to do things in DHTML. There really aren't right and wrong ways to accomplish tasks. For all of the examples in the book you will be able to go to the companion Web site located at ...
Lotus Domino R5 Clustering, 2nd edition
Authors: Steve Russell, Zeljka Zoranovic, Kathleen McGivney
Venue:  (2001)

From the Book:PREFACE: PrefaceThis redbook provides you with the information you need to understand howto plan, design, install, configure, and manage Lotus Domino clusters.Domino is a leading groupware application that provides collaborativeworkgroup tools such as e-mail, database access and calendar management.These functions have become critical for the day-to-day operations of manycompanies. For such businesses, downtime, that is, loss of one or more ofthese tools due to server or software failure, can have a significant impact onbusiness results.One way to manage the risk of downtime is to implement clustered systems.Clusters are groups of servers treated as a single computing resource thatprovides services to network users. When a server in the cluster fails, itsworkload is passed to one or more other members of the cluster untilcorrective action is taken and the failed server can be brought back intooperation again.In contrast with other clustering technologies, such as Microsoft ClusterServices, Domino provides its own unique clustering technology that isindependent of the underlying operating system. This means that a singlecluster can comprise servers running a variety of the operating systemssupported by Domino, from OS/390, to AIX, to Windows 2000.The book focuses on IBM's family of Netfinity servers as the hardwareplatform of choice. Netfinity servers are Intel-based, industry-standardservers that offer a number of innovative features to provide a stable andreliable platform for business-critical computing. In this book, MicrosoftWindows 2000 is often used as the operating system chosen to illustrateparticular facets of Domino clusteringbeingconsidered, but Linux is alsoused as an alternative and to demonstrate the operating system-independentnature of Domino clusters.We assume the reader is familiar with Domino operation and terminology.
Aspects of equivalence as illustrated by phosphine complexes of transition metals
Authors: John H. Nelson
Venue: Concepts in Magnetic Resonance: an Educational Journal (2002)

The various types of symmetry-related nuclei present in transition metal complexes of phosphines are discussed. Differences between the solution and the solid states are considered. Examples of spectra are presented to illustrate the relationships between the types of equivalences and observed spectral line shapes. An introduction to solid-state NMR spectroscopy is followed by descriptions of spectra that illustrate some of the types of information, which may be obtained from NMR spectroscopy of solid samples.
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
Authors: Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan
Venue: SIAM Journal on Computing (2002)

Given a set V of n points in $\IR^d$ and a real constant t>1, we present the first O(nlog n)-time algorithm to compute a geometric t-spanner on V. A geometric t-spanner on V is a connected graph G = (V,E) with edge weights equal to the Euclidean distances between the endpoints, and with the property that, for all $u,v\in V$, the distance between u and v in G is at most t times the Euclidean distance between u and v. The spanner output by the algorithm has O(n) edges and weight $O(1)\cdot wt(MST)$, and its degree is bounded by a constant.
Aplanar, two-dimensional geometry in APL
Authors: G. J. Porter
Venue: ACM SIGAPL APL Quote Quad (1980)

The algebraic and array-value orientations of APL make it a very desirable language to use for geometry. A point is given by its coordinates, a line by its endpoints, and more generally, a polyline or stroke by an ordered collection of N points. These are all arrays. More complicated pictures can be created as a union of these elements.In this note we describe a workspace, APLANAR, for two-dimensional (planar) geometry. This workspace is used in conjunction with a viewing system (graphics package) to produce graphic output. The viewing system is described in Appendix II.
Teach Yourself Web Publishing with HTML 4 in 14 Days: Professional Reference, 2nd Edition (with CD-ROM), 2nd edition
Authors: Laura Lemay, Arman Danesh
Venue:  (1997)

:A thoroughly-revised version of the best-selling book that started the whole HTML/Web publishing phenomenon, Teach Yourself Web Publishing with HTML in 14 Days, Second Professional Reference Edition is easy enough for the beginner yet comprehensive enough that even experienced Web authors will find it indispensable for reference.Includes 16 more chapters than the softcover edition, plus a 300-page HTML reference sectionCovers the new "Cougar" specification for the next version of HTML and the new Netscape and Microsoft technologies like style sheets, absolute positioning and dynamic HTMLCD-ROM includes an electronic version of the reference section, plus additional Web publishing tools for Windows and Macintosh platforms
Algorithms; A Functional Programming Approach, 1st edition
Authors: Fethi Rabhi, Guy Lapalme
Venue:  (1999)

:The design of algorithms for problem-solving lies at the heart of computer science. Concise yet authoritative, Algorithms: A Functional Programming Approach teaches the skills needed to master this essential subject. The authors challenge more traditional methods of teaching algorithms by using a functional programming context, with Haskell as the implementation language. This leads to smaller, clearer and more elegant programs which enable the programmer to understand the algorithm itself more quickly and to use that understanding to explore alternative solutions. Placing the emphasis on program development rather than the mathematical properties of algorithms, the book uses a succession of practical programming examples to develop in the reader problem-solving skills which can be easily transferred to other language paradigms. Key features of this innovative text include: Unmatched collection of functional programming algorithms A wealth of practical examples, bringing the algorithms into clear focus End of chapter exercises throughout Source code and selected solutions freely available online Comprehensive index and bibliographical notes Appendices on Haskell implementations and mathematical background For computer science students taking algorithms and/or functional programming courses, Algorithms: A Functional Programming Approach represents the ideal textbook. It is also an invaluable reference source of functional programs for practitioners.
Density-Based Multiscale Data Condensation
Authors: Pabitra Mitra, C. A. Murthy, Sankar K. Pal
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

A problem gaining interest in pattern recognition applied to data mining is that of selecting a small representative subset from a very large data set. In this article, a nonparametric data reduction scheme is suggested. It attempts to represent the density underlying the data. The algorithm selects representative points in a multiscale fashion which is novel from existing density-based approaches. The accuracy of representation by the condensed set is measured in terms of the error in density estimates of the original and reduced sets. Experimental studies on several real life data sets show that the multiscale approach is superior to several related condensation methods both in terms of condensation ratio and estimation error. The condensed set obtained was also experimentally shown to be effective for some important data mining tasks like classification, clustering, and rule generation on large data sets. Moreover, it is empirically found that the algorithm is efficient in terms of sample complexity.
A Particle-Partition of Unity Method for the Solution of Elliptic, Parabolic, and Hyperbolic PDEs
Authors: Michael Griebel, Marc Alexander Schweitzer
Venue: SIAM Journal on Scientific Computing (2000)

In this paper, we present a meshless discretization technique for instationary convection-diffusion problems. It is based on operator splitting, the method of characteristics, and a generalized partition of unity method. We focus on the discretization process and its quality. The method may be used as an h-version or a p-version. Even for general particle distributions, the convergence behavior of the different versions corresponds to that of the respective version of the finite element method on a uniform grid. We discuss the implementational aspects of the proposed method. Furthermore, we present the results of numerical examples, where we considered instationary convection-diffusion, instationary diffusion, linear advection, and elliptic problems.
Basic Algorithms and Operators, 1st edition
Authors: Thomas Back, David B. Fogel, Zbigniew Michalewicz
Venue:  (1999)

:Evolutionary Computation 1, Basic Algorithms and Operators covers all the paradigms of evolutionary computation in detail, giving an overview of the rationale evolutionary computation and of its biological background. This volume also offers an in-depth presentation of basic elements of evolutionary computation models according to the types of representations used for typical problem classes (for example, binary, real-valued, permutations, finite-state-machines, parse trees). Choosing this classification based on representation, the search operators mutation and recombination (and others) are straightforwardly grouped according to the semantics of the data they manipulate.
MCSD FrontPage 98 Study Guide (Exam 70-55)
Venue:  (1999)

:Prepare to pass the MCSD FrontPage 98 exam--while gaining practical knowledge of microsoft's frontPage technology for on-the-job success--using this comprehensive, 100% curiculum-based training system. Built on the proven training methodology of Global Knowledge, this complete study guide and CD-ROM package provides expert instruction from the company that trains more than 150,000 IT professionals for certification each year.
Freebsd Unleashed
Venue:  (2001)

:This book teaches the reader everything he/she needs to know in order to use FreeBSD to its full potential. It will show individuals how to use the same FreeBSD power that Yahoo!, the Internet Movie Database, and many other high profile internet sites depend on. Whether someone needs an enterprise class server, a small business server, or a dependable workstation, this book can be a very economical and powerful solution to your needs.
How to Build a Robot
Authors: Clive Gifford
Venue:  (2002)

:How to Build a Robot is a guide to building a walking, talking, thinking robot. Along the way you will find out about robots in fact and fiction, from R2D2 and C3PO to real robots a that can smell, learn, fly, and beat humans at chess.
A Practical Approach to COREL WordPerfect 7.0 for Windows 95: Complete Course: Disk Included
Authors: Mary Alice Eisch
Venue:  (1999)

:This text is the most comprehensive instructional text available on the COREL WordPerfect 7 for Windows 95 software. This self-paced, self-teaching guide provides you with engaging lessons, helpful illustrations, and many challenging applications to aid you in building WordPerfect expertise. Numerous hands-on activities and screen captures are integrated throughout the text to provide reinforcement. Comprehensive review activities test the users' critical thinking skills. This text is ideal for either individualized or group instruction.
State replication for multiplayer games
Authors: Carsten Griwodz
Venue: Proceedings of the 1st workshop on Network and system support for games (2002)

Massive multiplayer games have to cope with scalability problems that arise from the necessity of supporting network traffic for different game elements concurrently. In this paper, we show a simple means of separating these traffic styles in a proxy architecture by defining levels of urgency and relevance for each style. With this simple separation, low latency traffic styles can be preferred effectively over other traffic within the same game.We continue with a proposal for a middleware approach to the use of this infrastructure. It is based on the assumption that game developers can specify static requirements for the distributed objects at design and development time. In this case, we propose a combination of code-generation and run-time support for the use of the network architecture.
The restriction scaffold problem
Authors: Amir Ben-Dor, Richard M. Karp, Benno Schwikowski, Ron Shamir
Venue: Proceedings of the sixth annual international conference on Computational biology (2002)

Most shotgun sequencing projects undergo a long and costly phase of finishing, in which a partial assembly forms several contigs whose order, orientation and relative distance is unknown. We propose here a new technique that supplements the shotgun assembly data by cheap and simple complete restriction digests of the target. By computationally combining information from the contig sequences and the fragment sizes measured for several different enzymes, we seek to form a "scaffold" on which the contigs will be placed in their correct orientation, order and distance. We give a heuristic search algorithm for solving the problem and report on promising preliminary simulation results. The key to the success of the search scheme is the very rapid solution of its two time-critical subproblems that are solved precisely in linear time.Our simulations indicate that with noise levels of some 3% relative error in measuring fragment sizes, using five enzymes, most datasets of 20 contigs can be correctly ordered, and the remaining ones have most of their pairs of neighboring contigs correct. Hence, the technique has a potential to provide real help to finishing. Even when the target clone remains unfinished, the ability to order and orient the contigs correctly makes the partial assembly both more accessible and more useful for biologists.
Low Earth Orbital Satellites for Personal Communication Networks, 1st edition
Authors: Abbas Jamalipour
Venue:  (1997)

:Although low earth orbital (LEO) satellites are the most promising candidates for establishing personal communication networks (PCNs) on a global basis, their usage is also problematic. This new book provides the first comprehensive analysis of one of the hottest topics in communication systems today  the application of LEO satellites in PCNs. Dedicated to studying LEO satellite systems, the book describes the characteristic design features, discusses the issues to be considered during the design of LEO satellite communications networks, and presents analytical frameworks for evaluating their performance. It also explains major problems relating to employing LEO satellites in a global PCN  both for today's and tomorrow's applications. The book's broad coverage, including new research viewpoints, necessary tools, and fundamental analysis techniques, will enable you to:  Identify the advantages and disadvantages of non-geostationary satellites compared to conventional geostationary systems  Understand how LEO satellite systems can meet specific requirements of future global PCNs  Compare different multiple access schemes  and select the newest, most promising schemes for future wireless communications and mobile satellite systems  Determine the traffic characteristics of LEO satellites for global PCNs  Apply new techniques to evaluate and improve the performance of LEO satellite systems This comprehensive book is a valuable reference for electrical engineers involved in a wide range of activities, including the design of mobile satellite systems, LEO satellite systems, andterrestrial cellular systems. It offers graduate students of electrical and communications engineering a complete overview not found in any other reference. Much of the book's analyses and techniques are also applicable to other mobile communication systems such as terrestrial cellular systems.
An Energy-minimizing Interpolation for Robust Multigrid Methods
Authors: W. L. Wan, Tony F. Chan, Barry Smith
Venue: SIAM Journal on Scientific Computing (1999)

We propose a robust interpolation for multigrid based on the concepts of energy minimization and approximation. It can handle PDE coefficients of various types on structured or unstructured grids under one framework. The formulation is general; it can be applied to any dimension. We demonstrate numerically the effectiveness of the multigrid method in two dimensions by applying it to a discontinuous coefficient problem, an oscillatory coefficient problem, and an anisotropic problem. Empirically, the convergence rate is independent of the coefficients of the underlying PDE, in addition to being independent of the mesh size. The proposed method is primarily designed for second-order elliptic PDEs, with possible extensions to other classes of problems such as integral equations.
IBM and the Holocaust: The Strategic Alliance Between Nazi Germany and America's Most Powerful Corporation
Authors: Edwin Black
Venue:  (2001)

:IBM and the Holocaust is the stunning story of IBM's strategic alliance with Nazi Germany--beginning in 1933 in the first weeks that Hitler came to power and continuing well into World War II. As the Third Reich embarked upon its plan of conquest and genocide, IBM and its subsidiaries helped create enabling technologies, step-by-step, from the identification and cataloging programs of the 1930s to the selections of the 1940s. Only after Jews were identified--a massive and complex task that Hitler wanted done immediately--could they be targeted for efficient asset confiscation, ghettoization, deportation, enslaved labor, and, ultimately, annihilation. It was a cross-tabulation and organizational challenge so monumental, it called for a computer. Of course, in the 1930s no computer existed. But IBM's Hollerith punch card technology did exist. Aided by the company's custom-designed and constantly updated Hollerith systems, Hitler was able to automate his persecution of the Jews. Historians have always been amazed at the speed and accuracy with which the Nazis were able to identify and locate European Jewry. Until now, the pieces of this puzzle have never been fully assembled. The fact is, IBM technology was used to organize nearly everything in Germany and then Nazi Europe, from the identification of the Jews in censuses, registrations, and ancestral tracing programs to the running of railroads and organizing of concentration camp slave labor. IBM and its German subsidiary custom-designed complex solutions, one by one, anticipating the Reich's needs. They did not merely sell the machines and walk away. Instead, IBM leased these machines for high fees and became the sole source of the billions of punch cards Hitler needed. IBM and the Holocaust takes you through the carefully crafted corporate collusion with the Third Reich, as well as the structured deniability of oral agreements, undated letters, and the Geneva intermediaries--all undertaken as the newspapers blazed with accounts of persecution and destruction. Just as compelling is the human drama of one of our century's greatest minds, IBM founder Thomas Watson, who cooperated with the Nazis for the sake of profit. Only with IBM's technologic assistance was Hitler able to achieve the staggering numbers of the Holocaust. Edwin Black has now uncovered one of the last great mysteries of Germany's war against the Jews--how did Hitler get the names? The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
O'Leary Series: Microsoft Windows 2000 Brief Edition, 1st edition
Authors: Timothy O'Leary, Linda O'Leary
Venue:  (2000)

:SERIES TAGLINE: The O'Leary Series is the true step-by-step way to develop computer application skills. The new design emphasizes the step-by-step visual approach with screen captures for every concept.
Cost based data dissemination in satellite networks
Authors: Bo Xu, Ouri Wolfson, Sam Chamberlain, Naphtali Rishe
Venue: Mobile Networks and Applications (2002)

We consider the problem of data dissemination in a broadcast network. In contrast to previously studied models, broadcasting is among peers, rather than client server. Such a model represents, for example, satellite communication among widely distributed nodes, sensor networks, and mobile ad hoc networks. We introduce a cost model for data dissemination in peer to peer broadcast networks. The model quantifies the tradeoff between the inconsistency of the data, and its transmission cost; the transmission cost may be given in terms of dollars, energy, or bandwidth. Using the model we first determine the parameters for which eager (i.e. consistent) replication has a lower cost than lazy (i.e. inconsistent) replication. Then we introduce a lazy broadcast policy and compare it with several naive or traditional approaches to solving the problem.