ppxscal/embedding_network huggingface dataset:
PK-tree: a spatial index structure for high dimensional point data
Authors: Wei Wang, Jiong Yang, Richard Muntz
Venue: Information organization and databases: foundations of data organization (2000)

In this chapter we present the PK-tree which is an index structure for high dimensional point data. The proposed indexing structure can be viewed as combining aspects of the PR-quad or K-D tree but where unnecessary nodes are eliminated. The unnecessary nodes are typically the result of skew in the point distribution and we show that by eliminating these nodes the performance of the resulting index is robust to skewed data distributions. The index structure is formally defined, efficiently updateable and bounds on the number of nodes and the mean height of the tree can be proved. Bounds on the expected height of the tree can be given under certain mild constraints on the spatial distribution of points. Empirical evidence both on real data sets and generated data sets shows that the PK-tree outperforms the recently proposed spatial indexes based on the R-tree and X-tree by a wide margin. It is also significant that the relative performance advantage of the PK-tree grows with the dimensionality of the data set.
A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
Authors: Robert Michael Lewis, Virginia Torczon
Venue: SIAM Journal on Optimization (2002)

We give a pattern search method for nonlinearly constrained optimization that is an adaption of a bound constrained augmented Lagrangian method first proposed by Conn, Gould, and Toint [SIAM J. Numer. Anal., 28 (1991), pp. 545--572]. In the pattern search adaptation, we solve the bound constrained subproblem approximately using a pattern search method. The stopping criterion proposed by Conn, Gould, and Toint for the solution of the subproblem requires explicit knowledge of derivatives. Such information is presumed absent in pattern search methods; however, we show how we can replace this with a stopping criterion based on the pattern size in a way that preserves the convergence properties of the original algorithm. In this way we proceed by successive, inexact, bound constrained minimization without knowing exactly how inexact the minimization is. As far as we know, this is the first provably convergent direct search method for general nonlinear programming.
A Nonstiff Euler Discretization of the Complex Ginzburg--Landau Equation in One Space Dimension
Authors: Peter Takác, Ansgar Jüngel
Venue: SIAM Journal on Numerical Analysis (2000)

A nonstiff discretization method is applied to the complex Ginzburg--Landau (CGL) equation with periodic boundary conditions, \begin{eqnarray*} &\partial_t u = (1+i\nu) \partial_{xx}^2 u + Ru - (1+i\mu)|u|^2 u ; \\ &u(x + 2\pi,t) = u(x,t) \quad\mbox{ for } -\infty < x < \infty,\; t\geq 0. \end{eqnarray*} This parabolic equation is discretized first in space by a truncated Fourier series (that is, a finite Fourier sum) and then in time by an explicit Euler method. The exponential decay of Fourier modes in both, the original CGL equation, and the resulting equation for the truncated Fourier series (independently from the number of Fourier modes in the truncation) is used in an essential way to prove the nonstiffness. Also dissipativity of the discretized equation is established and numerical results are discussed.
Java in Telecommunications: Solutions for Next Generation Networks
Authors: Thomas C. Jepsen, Douglas Tait, Anirban Sharma, Ravi Jain, Farooq Anjum, Ravi Raj Bhat
Venue:  (2001)

:Recent developments to Java such as JAIN (Java APIs for Integrated Networks) and the Java Telephony API expand its functionality to enable its use in the next generation of networks and in telecommunication systems of the future. Providing the first comprehensive overview of how Java may be employed to create telecommunications networks of the future, this text offers broad coverage of all the latest developments which make Java based technologies the solution of choice for building powerful, flexible, efficient, secure networks for mobile devices. Features of the text include: · Offers an overview of how all the latest technologies fit together to enable the development of next generation telecommunications applications · Leading edge, topical coverage of the latest technologies yet to be fully implemented in industry · Practical emphasis, with renowned contributors from industry, writing about the technology itself rather than theoretical concepts · Supplemented with plenty of examples of software code · Deals with hot topical issues such as call processing, multimedia processing, mobile routing agents, active networks, XML, network management with EJB, Servlets, JSP CORBA and RMI An essential reference for experienced network planners, designers, managers and telecommunications engineers with an interest in using leading-edge technologies to implement new network capabilities. The practical emphasis combined with the coverage of the latest technology makes this text of interest to practitioners in industry as well as university researchers. Author Biography: THOMAS C. JEPSON is Programming Languages Editor for IEEE IT Professional Magazine and a telecommunicationsindustry professional who has developed a number of telecommunications-related Java applications, including graphical user interfaces and an application programming interface for Asynchronous Transfer Mode (ATM).
Truncation Strategies for Optimal Krylov Subspace Methods
Authors: Eric de Sturler
Venue: SIAM Journal on Numerical Analysis (1999)

Optimal Krylov subspace methods like GMRES and GCR have to compute an orthogonal basis for the entire Krylov subspace to compute the minimal residual approximation to the solution. Therefore, when the number of iterations becomes large, the amount of work and the storage requirements become excessive. In practice one has to limit the resources. The most obvious ways to do this are to restart GMRES after some number of iterations and to keep only some number of the most recent vectors in GCR. This may lead to very poor convergence and even stagnation. Therefore, we will describe a method that reveals which subspaces of the Krylov space were important for convergence thus far and exactly how important they are. This information is then used to select which subspace to keep for orthogonalizing future search directions. Numerical results indicate this to be a very effective strategy.
Strong Stability-Preserving High-Order Time Discretization Methods
Authors: Sigal Gottlieb, Chi-Wang Shu, Eitan Tadmor
Venue: SIAM Review (2001)

In this paper we review and further develop a class of strong stability-preserving (SSP) high-order time discretizations for semidiscrete method of lines approximations of partial differential equations. Previously termed TVD (total variation diminishing) time discretizations, these high-order time discretization methods preserve the strong stability properties of first-order Euler time stepping and have proved very useful, especially in solving hyperbolic partial differential equations. The new developments in this paper include the construction of optimal explicit SSP linear Runge--Kutta methods, their application to the strong stability of coercive approximations, a systematic study of explicit SSP multistep methods for nonlinear problems, and the study of the SSP property of implicit Runge--Kutta and multistep methods.
Topological Lower Bounds on Algebraic Random Access Machines
Authors: Amir M. Ben-Amram, Zvi Galil
Venue: SIAM Journal on Computing (2002)

We prove general lower bounds for set recognition on random access machines (RAMs) that operate on real numbers with algebraic operations $\{+,-,\times,/\}$, as well as RAMs that use the operations $\{+,-,\times,\lfloor\;\rfloor\}$. We do it by extending a technique formerly used with respect to algebraic computation trees. In the case of algebraic computation trees, the complexity was related to the number of connected components of the set W to be recognized. For RAMs, four similar results apply to the number of connected components of $W^\circ$, the topological interior of W. Two results use $(\overline W)^\circ$, the interior of the topological closure of $W$.We present theorems that can be applied to a variety of problems and obtain lower bounds, many of them tight, for the following models:1. A RAM which operates on real numbers, using integers to address memory and either the operations $\{+,-,\times,/\}$ or $\{+,-,\times,\lfloor\;\rfloor\}$.2. A RAM of each of the above instruction sets, extended by allowing arbitrary real numbers to be used as memory addresses and adding a test-for-integer instruction.3. A RAM of each of the above instruction sets which can compute with arbitrary real numbers, as well as use them for memory addressing, while the input is restricted to the integers. (For one result on this model, we require that all program constants be rational.)
Congestion prices as feedback signals: an approach to QoS management
Authors: Rolf Neugebauer, Derek McAuley
Venue: Proceedings of the 9th workshop on ACM SIGOPS European workshop: beyond the PC: new challenges for the operating system (2000)

Recently there has been a renewed interest in the application of economic models to the management of computational resources. Most of this interest is focused on pricing models for the Internet; in particular, on congestion or shadow prices, that address the phenomenon of what economists call external costs --- users are exposed to the costs they impose on other users when causing congestion of a resource.This paper describes how congestion prices can be applied to resource management in operating systems. Shadow prices are interpreted as feedback signals to applications which can adjust their resource requirements according to an application-specific strategy. This leads to a decentralised approach of resource management where applications are enabled and encouraged to perform resource and quality tradeoffs themselves. We have implemented a simulation environment and a number of strategies to evaluate the usefulness of congestion prices as a feedback signal and demonstrate that this approach can offer different service levels to different tasks. We also discuss how the simulation results can be applied in a real operating system and how this work can be extended to form a generic resource management framework.
Focus on software
Authors: David A. Bandel
Venue: Linux Journal (2002)

Internet Abuse
Teach Yourself Visually PowerPoint 2002, 1st edition
Authors: Ruth Maran
Venue:  (2002)

:Are you a visual learner? Do you prefer instructions that show you how to do something -- and skip the long-winded explanations? If so, then this book is for you. Open it up and you'll find clear, step-by-step screen shots that show you how to tackle more than 125 PowerPoint 2002 tasks, from working with slide designs, slide masters, and task panes to adding multimedia, animation, and organization charts.
Network Cabling Blueprints
Authors: BICSI
Venue:  (2002)

:Once cablers have learned network design fundamentals,they transition to the "real world" by learning the most common network topologies and how to work with them for smooth support of the most popular business applications. Part of BICSI's official training material,this book introduces newcomers to the configurations they will confront on the job,and teaches independent cabling business owners what they need to know about current practices in hardware and cable design. Acquaints the cabling designer with industry-standard practices for today's specialized networks and services Clearly and simply explains standards and topologies at the advanced technician level Application-integration tips and techniques Breaks each task into bulleted stepsEVERYTHING YOU NEED TO DESIGN NETWORK PLANS FOR TODAY*S MOST-IN-DEMAND TOPOLOGIES AND PLATFORMSThis precisely written and carefully researched reference teaches professional cable installers the newest and most popular network topologies and thoroughly explains how to work with them for smooth support of the most common business software. A joint venture between industry leaders McGraw-Hill and BICSI,Networking Technologies for Cabling Professionals offers the depth and breadth of coverage you would expect when two industry leaders join forces. Part of BICSI's world-renowned training material,Networking Technologies for Cabling Professionals is the perfect tool for introducing newcomers in the field to the configurations they will confront on the job and teaching independent cabling business owners everything they need to know about current practices in hardware and cable design. Field-tested by tens of thousands oftechnicians in 85 countries,and utilizing an easy-to-understand format and approach,Networking Technologies for Cabling Professionals:* Teaches industry-standard practices for today's specialized networks and services* Details how to integrate the most-used application software into a network * including Netshow,NetMeeting,Site Server,Groupwise,Border Manager,and more* Clearly and simply explains standards and topologies* Provides application-integration tips and techniques* Teaches by example,breaking each task into bulleted steps* Offers a vendor-neutral approach 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
FrontPage 98 for Windows: Visual QuickStart Guide, 2nd edition
Authors: Phyllis Davis, Deborah Craig
Venue:  (1998)

:FrontPage 98 for Windows: Visual QuickStart Guide readers will learn the principles of good Web design and all the basic techniques, such as formatting text, assigning hyperlinks mapping images, adding hotspots, and working with tables and frames. There's plenty included for intermediate users too, including instructions on how to incorporate some of the hottest technologies--DHTML, GIF animation, and Push channels---nto their Web pages. This is the Web authoring tool Windows users have been waiting for!
Interworking of switched ethernet and ATM flow control mechanisms
Authors: James Aweya, Michel Ouellette, Delfin Y. Montuno
Venue: International Journal of Network Management (2002)

In this paper, we evaluate the performance of TCP in a network where the IEEE 802.3x flow control and the ATM Available Bit Rate flow control mechanisms are interworked. The objective is to examine whether an interworking of the two flow control mechanisms can improve the performance of upper-layer protocols like TCP which is an end-to-end connection-based transport protocol. The simulation studies show that the two interworked flow control mechanisms result in high link utilization while providing very low loss rates when used in conjunction with TCP. The flow control mechanisms complement each other.
Adaptive runtime layout of hierarchical UI components
Authors: Heikki Keränen, Johan Plomp
Venue: Proceedings of the second Nordic conference on Human-computer interaction (2002)

Emerging small mobile terminals, each having a different screen size, create challenges for graphical user interface designers of multi-platform applications and services. In this paper we present a method which considers the screen size of the terminal and the currently active user interface component to divide the screen space for components at runtime. The method is demonstrated by using a modified treemap layout algorithm. The method has many advantages over existing zoomable interfaces using predefined layout including constant information density, context visibility and better suitability for screens being small and having extreme aspect ratios.
Intelligent Information Systems: Meeting the Challenge of the Knowledge Era
Authors: Alan J. Rowe, Sue A. Davis
Venue:  (1996)

:This book closes the gap between information technologies and management decision making. It treats currently relevant topics in information technology--knowledge-based expert systems, graphic-user interface, fuzzy logic, neural networks, data storage, client server, and integration of heterogeneous databases--by using examples and, more importantly, by relating these methods to the needs of the decision maker by taking into account the individual's decision style. The authors provide a solid basis for determining how decision makers use and access information that becomes part of the design of information systems. Integrating the decision maker into the design results in a more "intelligent information system" because the focus is on the outcome rather than on the methodology or computer power used.
Apple CD-ROM Handbook: A Guide to Planning, Creating, and Producing a CD-ROM, 1st edition
Authors: Apple Computer Inc.
Venue:  (1992)

:You'll find definitive coverage of the newest and most important technologies, such as QuickDraw 3D and Apple Guide. You'll also find the classic cornerstones of Macintosh development, like Macintosh Human Interface Guidelines, MacsBug Reference and Debugging Guide, and Planning and Managing AppleTalk Networks. Care has been taken to provide the information using the most appropriate medium. From the multimedia presentations of Electronic Guide to Macintosh Human Interface Design to the electronic reference included with Advanced Color Imaging on the Mac OS, the material is presented in the way that allows you to access it most effectively.
Integrating Computer Technology into the Classroom, 1st edition
Authors: Lisa Demeulle, Deborah L. Lowther, Gary R. Morrison
Venue:  (1998)

:This text focuses on integrating computers into teaching through the use of an inquiry-based, easy-to-use model for creating lesson plans. Teachers can use this 10-step process to design student-centered learning environments in which computer technology is integrated as a tool for learning rather than as a delivery mechanism. In addition, this text provides many practical examples and tips throughout to facilitate student understanding of chapter content. Coupled with this approach is an underlying foundation that addresses the National Education Technology Standards for Students and Teachers and the national curriculum standards. Features of this edition: New Chapter 3, Teacher as Designer I: Teacher's Toolbox, includes new material on writing behavioral and cognitive objectives, learner analysis, task analysis, and generative strategies. New Chapter 5, Implementations: From Plan to Action, provides step-by-step guidance for setting up and implementing a lesson that has students using computers during problem-solving lessons. New Chapter 8, The Role of Assessment, presents information on how to use multiple forms of assessment, such as task lists and rubrics, to assess student learning from an integrated lesson. New Chapter 12, Presentation of Results, synthesizes the ideas presented in two chapters of the first edition. It describes and illustrates how students can use various computer tools to present their results. New Chapter 14, Educational Software, describes strategies for assessing and integrating inquiry-based and traditional types of software into an NTeQ lesson plan.The two Internet chapters from the first edition have been revised to include a sharper focus on web tools, policies, and using the Internet as a tool in a new Chapter 13, The Internet in the Classroom. A Companion Website extends the content of the text, provides students with many helpful resources, activities, and projects, and allows students to check their comprehension of chapter material.
Rate-based query optimization for streaming information sources
Authors: Stratis D. Viglas, Jeffrey F. Naughton
Venue: Proceedings of the 2002 ACM SIGMOD international conference on Management of data (2002)

Relational query optimizers have traditionally relied upon table cardinalities when estimating the cost of the query plans they consider. While this approach has been and continues to be successful, the advent of the Internet and the need to execute queries over streaming sources requires a different approach, since for streaming inputs the cardinality may not be known or may not even be knowable (as is the case for an unbounded stream.) In view of this, we propose shifting from a cardinality-based approach to a rate-based approach, and give an optimization framework that aims at maximizing the output rate of query evaluation plans. This approach can be applied to cases where the cardinality-based approach cannot be used. It may also be useful for cases where cardinalities are known, because by focusing on rates we are able not only to optimize the time at which the last result tuple appears, but also to optimize for the number of answers computed at any specified time after the query evaluation commences. We present a preliminary validation of our rate-based optimization framework on a prototype XML query engine, though it is generic enough to be used in other database contexts. The results show that rate-based optimization is feasible and can indeed yield correct decisions.
Maximo: Ghosts to Glory: Official Strategy Guide
Authors: Doug Walsch
Venue:  (2002)

:BradyGames Maximo: Ghosts to Glory Official Strategy Guide provides a detailed walkthrough and area maps for the dynamic environments. A complete listing of weapons, items and the level of progression of specific attacks are also included. Boss strategies to help gamers defeat the toughest enemies. Tips to unlock secrets and hidden abilities of Maximo's weapons. This guide is part of BradyGames' Signature Series line, a strategy guide format that showcases quality product design to produce true collector's edition books for avid gamers. Some of the features include: high quality paper stock and special cover treatment, riveting coverage of the history of Maximo, and a premium item. 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
How to Do Everything with Mp3 and Digital Music
Authors: Dave Johnson, Rick Broida
Venue:  (2001)

:Bring your favorite music with you wherever you go. Whether it's from your personal music collection or the Internet, convert music to a digital format that you can enjoy on a PC or portable MP3 player. Utilize various music file formats -- including WAV, WMA, and MP3. Learn to use graphic equalizers, minimize unwanted noise through editing, and make other tweaks to your songs. Properly amplify analog source material, discover sound-enhancing plug-ins for Winamp -- even find the right pair of speakers or headphones. For Mac and PC users alike, How to Do Everything with MP3 and Digital Music will help deepen anyone's appreciation of music.
Domino and the as/400; Installation and Configuration, 1st edition
Authors: Rosana Choruzy, Michelle Zolkos
Venue:  (1999)

:Lotus Domino is multifaceted, providing corporations with E-mail and workflow management tools while serving as a database manager. This book clearly explains the process of implementing Lotus Domino Version 4, Release 6 on the AS/400 and navigates step-by-step through the installation and configuration process. Based on the IBM Redbook on the subject, this exhaustive book has been revised and is complete with additional information from sources such as NEWS/400 Magazine. It includes a backup and recovery plan for saving and restoring Domino data on the AS/400 system. A discussion of E-mail integration, directory synchronization, alternatives to configuring and managing, and dial-up connectivity are also included. It contains expert advice on fax support and using the AS/400 Operations Navigator.