ppxscal/embedding_network huggingface dataset:
Simple and flexible detection of contiguous repeats using a suffix tree
Authors: Jens Stoye, Dan Gusfield
Venue: Theoretical Computer Science (2002)

We study the problem of detecting all occurrences of (primitive) tandem repeats and tandem arrays in a string. We first give a simple time- and space-optimal algorithm to find all tandem repeats, and then modify it to become a time and space-optimal algorithm for finding only the primitive tandem repeats. Both of these algorithms are then extended to handle tandem arrays. The contribution of this paper is both pedagogical and practical, giving simple algorithms and implementations based on a suffix tree, using only standard tree traversal techniques
Sams Teach Yourself DB2 Universal Server in 21 Days with Cdrom, 1st edition
Authors: Susan M. Visser
Venue:  (1998)

:This is a complete tutorial and hands-on guide to all the new features of DB2 Universal Database Version 5. This is a comprehensive guide to designing, administering and optimizing a DB2 Universal Server database. With this book, the reader will learn to build secure distributed databases and replication into a network environment, gain in-depth information on making your information web-accessible and gain valuable insight into parallel processing for data warehousing. There is an emphasis on how DB2 can improve the productivity and profitability of the reader's organization, while it covers installation and configuration, day-to-day database administration, commands, performance, tuning and troubleshooting.One of the first and only books on the subject of DB2 Universal Server version 5Includes several real life examples of "DB2 in Action" to help businesses understand the power of DB2The complete guide to administering a DB2 database
MCSD in a Nutshell: The Visusal Basic Exams
Authors: James Foxall
Venue:  (2000)

:Since their introduction, the MCSD certification exams have been enthusiastically received by VB programmers who consider certification very important to their professional credibility. Programmers tend to be specialiststhey tend to do the same kind of programming over and over. The MCSD exam is targeted at technical generalistsdevelopers familiar with a broad array of Microsoft technologies and development approaches that are incorporated into Visual Basic. With its comprehensive overview of core technology areas, MCSD in a Nutshell is the perfect study guide and resource to help developers master technologies that are less familiar to them. In fact, its thorough review of Visual Basic-related development technologies also makes this an excellent tutorial for experienced VB programmers who wish to get up to speed on speed on some technology with which they work infrequently, if at all. Most certification books are really tutorials in disguise. In contrast, this book focuses on the advanced topics about which developers are actually tested on the exam. Topics include: Understanding COM Creating ActiveX Code Components Creating ActiveX Controls Creating and Using ActiveX Documents Creating Internet-Aware Applications Testing and Debugging Integrating Help with an Application Optimizing an Application Package and Deployment Incorporating Microsoft Transaction Server (MTS) Working with Data Using ActiveX Data Objects (ADO) Incredibly, most certification books appear to assume that the reader has no pintermediate to advanced programmer who is concerned with learning more about each of the core technologies that are covered by the exam. And unlike some certification books, MCSD in a Nutshell is written by an author who has successfully passed the certification exams.
Oracle and Visual Basic Developer's Handbook with Cdrom, 1st edition
Authors: Mark Tomlinson, Jim Fedynich, Jenny Besaw
Venue:  (2000)

:Since Oracle encourages its users to program with their own development tools, and Microsoft's documentation and support materials focus on use of Visual Basic with their databases, this manual contains information not available from any other source. The authors are Oracle insiders and experts in this area. Their companion CD contains all the source code from the book and sample database applications.
A query language for a network data base with graphical entities
Authors: Richard L. Phillips
Venue: ACM SIGGRAPH Computer Graphics (1977)

A generalized high level query language has been developed for use with a network data base, as defined by the CODASYL DBTG report. Of particular interest is the capability of manipulating graphical entities with this language. The system was developed to supportan offshore oil lease information project where one must formulate queries pertaining to proximity of graphical entities. To facilitate such requests new relational operators were defined and implemented. Thus compound Boolean expressions can be formed which involve graphical as well as non-graphical criteria. Since one goal of the information system is to produce selectively colored maps via an FR80 microfilm recorder, the query language syntax provides the user with a comprehensive thematic cartography capability. The query language is designed to isolate the user from the underlying network structure of the data base. In order to accomplish this generalized pathfinding and accessing algorithms had to be developed. Pathfinding is facilitated through an adjacency matrix involving all record types in the data base, while accession is controlled by examining the local owner-member relation for current record types. Besides querying, the system provides the usual complement of data base management system functions, i.e. deletion, updating, reporting, etc.
Almost-whole-program compilation
Authors: Zoran Budimlic, Ken Kennedy
Venue: Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande (2002)

This paper presents a strategy, called em almost-whole-program compilation, for extending the benefits of whole-program optimization to large collections of Java components that are packaged as a group after the development phase. This strategy has been implemented in a framework that uses Java visibility and scoping rules to transform a collection of classes into a package that is amenable to whole-program optimizations, without precluding extensions to the optimized and compiled code. Thus, it enables the Java developer to balance performance against flexibility of the program after the development phase, without compromising the design process. The transformation is shown to incur only modest performance penalties, which are more than compensated for by the interprocedural optimizations it enables. The paper concludes with experimental results showing the benefits that can be achieved using this approach.
Using Java 1.1 (Special Edition), 3rd edition
Authors: Joseph Weber, Anil Hemrajani
Venue:  (1997)

:Special Edition Using Java 1.1, Third Edition is a thorough reference and explains how to program Java applets for any intended use. This edition includes an updated CD-ROM with over 100 Java applets and more coverage of advanced topics such as Java/database integration, Java development environments, and details of all aspects of the Java API.Shows how to program Java applets for any useExplores all the power of Java 1.1CD-ROM includes the 1.1 JDK and contains over 100 Java applets to verified to run under Java 1.1
Incremental Integration Testing of Concurrent Programs
Authors: Pramod V. Koppol, Richard H. Carver, Kuo-Chung Tai
Venue: IEEE Transactions on Software Engineering (2002)

We present a method for selecting test sequences for concurrent programs from labeled transitions systems (LTS). A common approach to selecting test sequences from a set of LTSs is to derive a global LTS, called the reachability graph, and then force deterministic program executions according to paths selected from the graph. However, using a reachability graph for test path selection introduces a state explosion problem. To overcome this problem, a reduced graph can be generated using incremental reachability analysis, which consists of repeatedly generating a reachability graph for a subset of LTSs, reducing this graph, and using the reduced graph in place of the original LTSs. Unfortunately, existing incremental reachability analysis techniques generate reduced graphs with insufficient information for deterministic testing. In this paper, we present an incremental approach to testing concurrent programs. Incremental testing consists of incremental reachability analysis for test path selection and deterministic testing for test execution. We define a new type of reachability graph for incremental analysis, called an annotated labeled transition system (ALTS). An ALTS is an LTS annotated with information necessary for deterministic testing. We propose practical coverage criteria for selecting tests paths from an ALTS and present an ALTS reduction algorithm. The results of several case studies are reported.
Best Approximation from the Intersection of a Closed Convex Set and a Polyhedron in Hilbert Space, Weak Slater Conditions, and the Strong Conical Hull Intersection Property
Authors: Frank Deutsch, Wu Li, Joseph D. Ward
Venue: SIAM Journal on Optimization (1999)

Let X be a (real) Hilbert space, C be a closed convex subset, and $H_i =\{x\in X\mid \la x, h_i\ra \le b_i\} \quad (i=1,2,..., m)$ be a finite collection of half-spaces. Under the assumption that $K:=C\cap (\cap_1^mH_i)$ is not empty, the problem of characterizing the best approximation from $K$ to any $x\in X$ is considered. The "strong conical hull intersection property" (strong CHIP), which was introduced by us in 1997, is shown to be both necessary and sufficient for the following "perturbation property" to hold: for each $x\in X$, an element $x_0\in K$ satisfies $x_0=P_K(x)$ if and only if $x_0=P_C(x-\sum_1^m\lambda_ih_i)$ for some scalars $\lambda_i\ge 0$ with $\lambda_i[\la x_0, h_i\ra -b_i]=0$ for each $i$. Here $P_D(z)$ denotes the unique best approximation from $D$ to $z$. In other words, determining the best approximation from the set $K$ to any point is equivalent to the (generally easier) problem of determining the best approximation from the set $C$ to a perturbation of that point. Moreover, even when the strong CHIP does not hold, the perturbation property still holds, except now $C$ must be replaced by a certain convex extremal subset of $C$. We also show that the strong CHIP is weaker than any of the weak Slater conditions that one can naturally impose on the sets in question. These results generalize the main results of our 1997 paper [J. Approx. Theory, 90, pp. 385--444] and hence those of several other papers as well.
NT Server 4
Authors: Lisa Donald, Frank Cabiroy, Bruce Moran
Venue:  (1997)

:Going for your MCSE or Internet Systems Specialist certification? Here's the book you need to make sure you're ready for the Implementing and Supporting NT Server 4 exam. Study with courses or with the MCSE: NT Server 4 Study Guide, then use the Testing Guide to test and reinforce your knowledge of the material. The book provides summaries of the essential topics, and includes more than 700 questions with detailed answers and more than 200 sample test questions. The CD includes a test-simulation program for getting ready to take the computer-based exams, and the Network Press MCSE Study Guide Sampler.
Welcome to Concepts in Graphic Design, 1st edition
Authors: David A. Holzgang, Lesley Strothers
Venue:  (1993)

:Addressing end-user requirements by targeting practical techniques, Welcome toConcepts in Graphic Design takes you from mystery to mastery of digital design, electronic templates, and advanced layout. Professional designers David A. Holzgang and Lesley Strother explain how to integrate the latest tools and technology into your knowledge of graphic design. Welcome toConcepts in Graphic Design shows you how to create libraries of templates and artwork, reduce the time between initial concept to final output, improve your overall efficiency and proficiency in graphic computer design.
L2-Gain and Passivity in Nonlinear Control, 2nd edition
Authors: Arjan van der Schaft, A. J. Schaft
Venue:  (1999)

:This book gives a unified treatment of classical input output stability theory and recent developments in nonlinear robust and passivity-based control. The synthesis between these areas is provided by the theory of dissipative systems. Specifically, the small-gain and passivity theorems and their implications for nonlinear stability and stabilization are discussed from this vantage-ground. The connection between L - gain and passivity via scattering is detailed." "The passivity concepts are enriched by a generalised Hamiltonian formalism, emphasising the close relations with modeling and control by interconnection. Feedback equivalence to a passive system and resulting stabilization strategies are discussed." "The potential of L[subscript 2] - gain techniques in nonlinear control is demonstrated, including a compact treatment of the nonlinear H[subscript [infinity]] optimal control problem.
Red Hat Linux "X" Internet Server, 1st edition
Authors: Paul G. Sery, Dave Farrell
Venue:  (2002)

:Red Hat Linux X Internet Server takes the reader through all of the steps of setting up an Internet server using the Red Hat Linux operating system.It begins by describing Red Hat Linux networking basics, two example networks and the basics of DSL Internet connections, firewalls and troubleshooting in Part 1.This sets the foundation for all subsequent examples and provides readers with problem solving tools.Part 2 describes how to construct and manage a secure web server that is connected to a database. Part 3 shows the reader how to construct basic Internet services such as DNS, sendmail, FTP and Samba. Part 4 deals with advanced management techniques.The final part describes how to secure your network and servers. This part goes beyond the average coverage by showing advanced as well as basic security techniques and tools.ABOUT THE CD-ROMThe CD-ROM has an open-source high-availability system/server created by the author and appropriate GPL server and security software.Author Biography: Paul G. Sery (Albuquerque, NM) works with the Sandia National in the Special Projects group. He assists in the operation and management of the Computer Science Research Institute network. He is the author of Linux Network and Red Hat Linux Network Toolkit. He is the co-author of Red Hat Linux 7 For Dummies, TurboLinux for Dummies, Red Hat Linux in Small Business and SuSE Linux Server.David Farrell is currently a member of the Research Red Team part of the Cyber Defense Research Center with SRI International. He is studying cyber adversary behavior with the goal of being able to better defend against them. Dave was previouslya member of the Sandia National Labs Cyber Warfare Red Team and the Information Design Assurance Red Team and continues taking this type of work to the next level. He has been involved in performing "active assessments" of systems ranging from government critical infrastructure to big banks to individual systems under development by such agencies as DARPA, the founder of the Internet. He has over 20 years experience working with computers in the role of system, network and security administrator for large networks, and has developed both hardware and software as a defense contractor as well as in the commercial arena. Dave operates The World's Most Wanted, Inc., a non-profit organization formed to assist law enforcement agencies in the dissemination of information using the Internet in an attempt to apprehend fugitives and close unsolved criminal cases.
Where Best to Hold a Drum Fast
Authors: Steven J. Cox, Paul X. Uhlig
Venue: SIAM Journal on Optimization (1999)

If we are allowed to fasten, say, one half of a drum's boundary, which half produces the lowest or highest bass note? The answer is a natural limit of solutions to a family of extremal Robin problems for the least eigenvalue of the Laplacian. We produce explicit extremizers when the drum is a disk while for general shapes we establish existence and necessary conditions, and we build and test a pair of numerical methods.
The Legend of Zelda: Majora's Mask
Authors: Prima Temp Authors, Elizabeth Hollinger, James Ratkos
Venue:  (2000)

:The Legend of Zelda: Majora's Mask will be the best N64 RPG this year! Building on the fantastic Legend of Zelda franchise, this stunning sequel to The Legend of Zelda: Ocarina of Time will feature Link in an adventure that takes him to a parallel universe and an alternate version of Hyrule. The Legend of Zelda: Majora's MaskPrima's Official Strategy Guide will show you how to save Link' s friends by using the power of mystical masks. Prima gives you all the information you will need, inlcuding:Comprehensive 3D maps for all dungeons and regionsDetails on all items and their locations, including all 52 Pieces of HeartStrategies for defeating Link's enemiesHidden Ocarina melodiesFlowchart to help you make the most of your three days in TerminaSolutions to all complex puzzlesStep-by-step, detailed walkthroughs for the Temple dungeonsLocations of all 60 stray fairiesLink's ultimate transformation
Fundamentals of Parallel Processing
Authors: L. E. Jordan, Gita Alaghband
Venue:  (2002)

:Rapid changes in the field of parallel processing make this book especially important for professionals who are faced daily with new productsand provides them with the level of understanding they need to evaluate and select the products. It gives readers a fundamental understanding of parallel processing application and system development. Chapter topics include parallel machines and computations, potential for parallel computations, vector algorithms and architectures, MIMD computers and multiprocessors, distributed memory processors, interconnection networks, data dependence and parallelism, implementing synchronization and data sharing, parallel processor performance, temporal behavior of parallel programs, and parallel I/O. For computational scientists, software engineers, computer architects, and computer engineers.
Instant Java Servlets (Book/CD-ROM Package)
Authors: Phillip Hanna, Phil Hanna
Venue:  (2000)

:The Ultimate Collection of Working Solutions and Expert Techniques for Java Developers and Programmers Build powerful server-side Java applications,servlets and JavaServer Pages (JSP) with this solution-packed cookbook of illustrated techniques. Filled with hundreds of working examples,this unique and easy to use resource covers topics from database access and dynamic web page creation to legacy systems and e-commerce. Key topics covered include servlet-generated HTML,cookies and session management,threading,JSP,Enterprise JavaBeans,XML,and more. And,the bonus CD-ROM contains all the books* source code,which will save you hundreds of hours of programming time. Instructive,innovative,and invaluable,this is a perfect addition to every working programmer's bookshelf. The Ultimate Collection of Working Solutions and Expert Techniques for Java Developers and Programmers! Build powerful server-side Java applications,servlets,and JavaServer Pages (JSP) with this solution-packed cookbook of illustrated techniques. Filled with hundreds of working examples,this unique resource covers topics from database access and dynamic web page creation to legacy systems and e-commerce. Beginning with an overview of the servlet environment and its programming interface this exceptional guide offers complete solutions to many of today's common programming problems. Organized by topic for ease-of-use,you'll find coverage of key topics including servlet-generated HTML,cookies and session management,threading,JSP,Enterprise JavaBeans,XML,and more. Topics include problems arranged in order of complexity,making this resource appropriate for readers of every level - from beginners to highlyadvanced programmers. And,the bonus CD-ROM contains all the books' source code,which will save you hundreds of hours of programming time. Instructive,innovative,and invaluable,this is a perfect addition to every working programmer's bookshelf. Includes coverage of: JSP 1. 0Servlet BasicsHTML ClientsDebugging ServletsSession ManagementThreading IssuesInterservlet CommunicationPortable Applications ON THE CD-ROM: Source code for all solutionsFigure-to-program cross referenceApache Web Server Apache JServ Servlet Engine
Statistics for Managers Using Microsoft Excel, 1st edition
Authors: David M. Levine, David Stephan, Mark L. Berenson
Venue:  (1997)

:Statistics for Managers Using Microsoft Excel includes step-by-step procedures for using Excel to create workbooks for every statistical topic discussed in this text. Many of these workbooks extend the scope of Excel by providing analyses not included in Excel's Data Analysis tool and the Chart and Pivot Table Wizards. All workbooks allow you to see the results of dynamically changing the data for a problem, bringing the power of spreadsheet "what its" to the study of statistics. The disk that accompanies this text includes copies of every workbook discussed, all ready-to-use and completely documented.
Visual Basic Developer's Guide to Asp and Iis (Developer's Handbook Series), 1st edition
Authors: A. Russell Jones
Venue:  (1999)

:The core components of Web application development for programmers using Microsoft technologies are ASP (Active Server Pages) and IIS (Internet Information Server). This book gives experienced Visual Basic developers everything they need in order to develop sophistical Web applications. The book features in-depth information on writing IIS server-side applications and coverage of the new VB WebClasses. Russell Jones is a frequent contributor to Visual Basic Programmer's Journal and a frequent speaker at industry events.
Allocating Bandwidth for Bursty Connections
Authors: Jon Kleinberg, Yuval Rabani, Éva Tardos
Venue: SIAM Journal on Computing (2000)

In this paper, we undertake the first study of statistical multiplexing from the perspective of approximation algorithms. The basic issue underlying statistical multiplexing is the following: in high-speed networks, individual connections (i.e., communication sessions) are very bursty, with transmission rates that vary greatly over time. As such, the problem of packing multiple connections together on a link becomes more subtle than in the case when each connection is assumed to have a fixed demand.We consider one of the most commonly studied models in this domain: that of two communicating nodes connected by a set of parallel edges, where the rate of each connection between them is a random variable. We consider three related problems: (1) stochastic load balancing, (2) stochastic bin-packing, and (3) stochastic knapsack. In the first problem the number of links is given and we want to minimize the expected value of the maximum load. In the other two problems the link capacity and an allowed overflow probability p are given, and the objective is to assign connections to links, so that the probability that the load of a link exceeds the link capacity is at most $p$. In bin-packing we need to assign each connection to a link using as few links as possible. In the knapsack problem each connection has a value, and we have only one link. The problem is to accept as many connections as possible.For the stochastic load balancing problem we give an O(1)-approximation algorithm for arbitrary random variables. For the other two problems we have algorithms restricted to on-off sources (the most common special case studied in the statistical multiplexing literature), with a somewhat weaker range of performance guarantees.A standard approach that has emerged for dealing with probabilistic resource requirements is the notion of effective bandwidth---this is a means of associating a fixed demand with a bursty connection that "represents" its distribution as closely as possible. Our approximation algorithms make use of the standard definition of effective bandwidth and also a new one that we introduce; the performance guarantees are based on new results showing that a combination of these measures can be used to provide bounds on the optimal solution.