ppxscal/embedding_network huggingface dataset:
ASP in a Nutshell, 2nd edition
Authors: A. Keyton Weissinger
Venue:  (2000)

:This book also includes an overview of the interaction between the latest release of Internet Information Server (version 5) and ASP 3.0, with an introduction to the IIS object model and the objects it comprises. The examples shown in this section and throughout the book are illustrated in VBScript. The main components of this book are: Active Server Pages Introduction. Brief overview of the ASP application paradigm with examples in VBScript. Also included is an introduction to Microsoft's Internet Information Server 5.0, the IIS object model, and the objects that it comprises. Object Reference. Each object is discussed in the following manner: descriptions, properties, collections, methods, events, accessory files/required DLLs, and remarks, including real-world uses, tips and tricks, and author's experience (where applicable). The objects--Application, Response, Request, Server, Session, ObjectContext, and ASPError, as well as ASP Directives, Global.ASA, and Server-Side Includes--all follow this paradigm. Component Reference. This section follows the same paradigm found in Object Reference. The discussion covers all of the additional components included with IIS, such as ActiveX Data Objects, the Ad Rotator, the Browser capabilities component, the File System Object, and more. Appendixes. Gives examples in one or two objects and components using Perl, REXX, and Python in ASP. Like other books in the "In a Nutshell" series this book offers the facts, including critical background information, in a no-nonsense manner that users will refer to again and again. It is a detailed reference that enables even experienced web developers to advance their ASP applications to new levels.
A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem
Authors: Marielba Rojas, Sandra A. Santos, Danny C. Sorensen
Venue: SIAM Journal on Optimization (2000)

We present a new method for the large-scale trust-region subproblem. The method is matrix-free in the sense that only matrix-vector products are required. We recast the trust-region subproblem as a parameterized eigenvalue problem and compute an optimal value for the parameter. We then find the solution of the trust-region subproblem from the eigenvectors associated with two of the smallest eigenvalues of the parameterized eigenvalue problem corresponding to the optimal parameter. The new algorithm uses a different interpolating scheme than existing methods and introduces a unified iteration that naturally includes the so-called hard case. We show that the new iteration is well defined and convergent at a superlinear rate. We present computational results to illustrate convergence properties and robustness of the method.
Command and Conquer: Tiberian Sun: Prima's Official Strategy Guide
Authors: Steve Honeywell
Venue:  (1999)

:Gain a player's edge on "Command and Conquer: Tiberian Sun" with the official strategy guide from Prima Development. Includes exclusive intelligence maps for every mission, tactics for multiplayer and AI play, and brass-tack details on every game element--troops, weaponry, etc.
Capacity Planning for Internet Services
Authors: Adrian Cockcroft, Walker
Venue:  (2001)

:Capacity planning is a well known discipline, particularly for sites that have a mainframe oriented background. The explosive growth of Internet sites and E-commerce has presented new challenges in managing performance and capacity. In many cases, time constraints and business demands can prevent normal capacity planning techniques from being applied. Classic datacenter capacity planning methods can be adjusted and successfully applied to this new Internet-centric computing environment.This BluePrint charts a course through the available techniques and tools, examines timescales and return on investment for different methodologies and provides a framework for decomposing big problems into solvable subproblems.
VBA Developer's Handbook, 2nd edition
Authors: Ken Getz, Mike Gilbert
Venue:  (2001)

:The VBA Developer's Handbook is the essential resource for developers working with any application that employs the VBA programming language. Written by recognized VBA experts, this book provides detailed coverage of a wide range of specific VBA programming challenges. Its careful, step-by-step instruction and thousands of lines of code offer answers while teaching you to devise new solutions, creatively and efficiently. Learn product-independent VBA programming. Instruction applies equally to all environments using a Visual Basic 5.0 host, including Microsoft Office 97. This book is vital to your progress as a VBA developer, whether you build stand-alone applications or automate or customize commercial products using their built-in VBA programmability. Master the full range of VBA functionality. Accomplish everything possible using VBA, from the basic to the advanced. You'll find full coverage of built-in VBA functions and strategies for expanding them with custom procedures. Learn to write reusable classes, create well-tuned VBA applications, and investigate and document your work.
Local Area Networks with Cdrom, 2nd edition
Authors: James E. Goldman, Phillip T. Rawles
Venue:  (2000)

:These days, networks and information systems are more than just a technological service segment of a company, they are vital variables in the business equation. This book takes a business-first approach to networks focusing on how to analyze, implement and manage local area networks. Drawing on extensive case studies, it provides a thorough examination of the business application, data, network, and technology issues surrounding the successful implementation of local area network-based client/server systems. It also provides working models which readers can use to organize their own systems.
ICALP, EATCS and Maurice Nivat
Authors: Grzegorz Rozenberg, Arto Salomaa
Venue: Theoretical Computer Science (2002)

The purpose of this writing is to tell something about the quite unique and fundamental role of Maurice Nivat, both in launching ICALP and EATCS, as well as in guiding them through the difficult early stages. Our account is based on personal recollections, as well as some original documents and letters. To preserve the personal character of our recollections, we have not tried to fill the gaps in our information through other channels such as interviewing some of the people involved. In other words, our personal account is not intended to be a comprehensive history. It only tells how things seemed to us.
Sparse Serial Tests of Uniformity for Random Number Generators
Authors: Pierre L'Ecuyer, Richard Simard, Stefan Wegenkittl
Venue: SIAM Journal on Scientific Computing (2002)

Different versions of the serial test for testing the uniformity and independence of vectors of successive values produced by a (pseudo)random number generator are studied. These tests partition the t-dimensional unit hypercube into k cubic cells of equal volume, generate n points (vectors) in this hypercube, count how many points fall in each cell, and compute a test statistic defined as the sum of values of some univariate function f applied to these k individual counters. Both overlapping and nonoverlapping vectors are considered. For different families of generators, such as linear congruential, Tausworthe, nonlinear inversive, etc., different ways of choosing these functions and of choosing k are compared, and formulas are obtained for the (estimated) sample size required to reject the null hypothesis of independent uniform random variables, as a function of the period length of the generator. For the classes of alternatives that correspond to linear generators, the most efficient tests turn out to have $k \gg n$ (in contrast to what is usually done or recommended in simulation books) and to use overlapping vectors.
A Versatile Functional&ndash;Anatomic Image Fusion Method for Volume Data Sets
Authors: Marilyn E. Noz, Gerald Q. Maguire Jr., Michael P. Zeleznik, Elissa L. Kramer, Faaiza Mahmoud, Joakim Crafoord
Venue: Journal of Medical Systems (2001)

We describe and validate a volumetric three-dimensional registration method, and compare it to our previously validated two-dimensional/three-dimensional method. CT/MRI and SPECT data from 14 patients were interactively fused using a polynomial warping technique. Registration accuracy was confirmed visually and by a nonsignificant F value from multivariate analysis of the transformed landmarks, a significant difference of the squared sum of intensity differences between the transformed/untransformed and the reference volume both at the 0.05 (p > 0.05) confidence level and an average 31% improvement of the correlation coefficient and cross correlation. For the two-dimensional/three-dimensional method, ROI center-to-center distance ranged from 1.42 to 11.32 mm (for liver) with an average of 6.13 mm &plusmn; 3.09 mm. The average ROI overlap was 92.51% with a 95% confidence interval of 90.20&ndash;96.88%. The new method is superior because it operates on the true three-dimensional volume. Both methods give good registration results, take 10 to 30 min, and require anatomic knowledge.
Toward the semantic geospatial web
Authors: Max J. Egenhofer
Venue: Proceedings of the 10th ACM international symposium on Advances in geographic information systems (2002)

With the growth of the World Wide Web has come the insight that currently available methods for finding and using information on the web are often insufficient. In order to move the Web from a data repository to an information resource, a totally new way of organizing information is needed. The advent of the Semantic Web promises better retrieval methods by incorporating the data's semantics and exploiting the semantics during the search process. Such a development needs special attention from the geospatial perspective so that the particularities of geospatial meaning are captured appropriately. The creation the Semantic Geospatial Web needs the development multiple spatial and terminological ontologies, each with a formal semantics; the representation of those semantics such that they are available both to machines for processing and to people for understanding; and the processing of geospatial queries against these ontologies and the evaluation of the retrieval results based on the match between the semantics of the expressed information need and the available semantics of the information resources and search systems. This will lead to a new framework for geospatial information retrieval based on the semantics of spatial and terminological ontologies. By explicitly representing the role of semantics in different components of the information retrieval process (people, interfaces, search systems, and information resources), the Semantic Geospatial Web will enable users to retrieve more precisely the data they need, based on the semantics associated with these data.
Image and Video Compression for Multimedia Engineering, 1st edition
Authors: Yun Q. Shi, Huifang Sun
Venue:  (1999)

:Image and Video Compression for Multimedia Engineering provides a solid, comprehensive understanding of the fundamentals and algorithms of coding and details all of the relevant international coding standards.. "With the growing popularity of applications that use large amounts of visual data, image and video coding is an active and dynamic field. Image and Video Compression for Multimedia Engineering is a first, comprehensive graduate/senior level text and a self-contained reference for researchers and engineers that builds a basis for future study, research, and development.
Fixpoint operators for domain equations
Authors: John Power, Giuseppe Rosolini
Venue: Theoretical Computer Science (2002)

We investigate fixpoint operators for domain equations. It is routine to verify that if every endofunctor on a category has an initial algebra, then one can construct a fixpoint operator from the category of endofunctors to the category. That construction does not lift routinely to enriched categories, using the usual enriched notion of initiality of an endofunctor. We show that by embedding the 2-category of small enriched categories into the 2-category of internal categories of a presheaf topos, we can recover the fixpoint construction elegantly. Also, we show that in the presence of cotensors, an enriched category allows the fixpoint construction.
Characteristics of Distributed-Parameter Systems: Handbook of Equations of Mathematical Physics and Distributed-Parameter Systems
Authors: A. G. Butkovskiµi, Leonid Moiseevich. Pustylºnikov
Venue:  (1993)

:This volume is intended to serve as a handbook which contains data dealing with the characteristics of systems with distributed and lumped parameters. Some two hundred problems are discussed and, for each problem, all the main characteristics of the solution are listed: standardising functions, Green's functions, transfer functions or matrices, eigenfunctions and eigenvalues with their asymptotics, roots of characteristic equations, and others. In addition to systems described by a single differential equation, this volume also includes degenerate multiconnected systems. The purpose of this volume is to make it easier to compare a large number of systems with distributed parameters. It also is intended to point the way for the solution of problems in the structural theory of distributed-parameter systems. The book contains three major chapters. Chapter 1 deals with special descriptions combining concrete and general features of distributed parameter systems of selected integro-differential equations. Also presented are the characteristics of simple quantum mechanical systems, and data for other systems. Chapter 2 presents the characteristics of systems of differential or integral equations. Several different multiconnected systems are presented. Chapter 3 describes practical prescriptions for finding and understanding the characteristics of various classes of distributed systems. Audience: Researchers whose work involves processes in continuous media, various kinds of field phenomena, problems of mathematical physics, and the control of distributed-parameter systems.
Microsoft PowerPoint 2000: Comprehensive, 1st edition
Authors: S. Scott Zimmerman, Beverly B. Zimmerman
Venue:  (2000)

:Part of the New Perspectives Series, this text offers a case-oriented, problem-solving approach for learning basic to more advanced features of PowerPoint 2000.
Self-stabilizing deterministic network decomposition
Authors: Fatima Belkouch, Marc Bui, Liming Chen, Ajoy K. Datta
Venue: Journal of Parallel and Distributed Computing (2002)

We present a simple and efficient self-stabilizing protocol for the network partitioning problem. Given a graph with k2 nodes, our decomposition scheme partitions the network into connected and disjoint partitions, with k nodes per partition. The proposed algorithm starts with a spanning tree of the graph, but uses some links which do not belong to the tree, if necessary. The protocol is self-stabilizing meaning that starting from an arbitrary state, it is guaranteed to reach a state where the network is correctly partitioned. The protocol stabilizes in 3(h + 1) rounds, where h is the height of the tree. We also propose solutions to the case where the network size is n &#x2264; k2. Hence our protocol works for dynamic systems in the sense that the protocol can adapt to changes of the network size. We discuss an important application of the proposed protocol.
Advanced JavaServer Pages
Authors: David M. Geary, Sun Microsystems
Venue:  (2001)

:Design and implement flexible, extensible, and maintainable applications with servlets and JSP technologyMaster powerful authentication and internationalization techniquesLearn how to integrate industry-standard XML and XSLT with JSP technologyUse JSP technology-based templates to develop robust applications from modular componentsAdvanced JavaServer Pages delivers:Web application design techniques based on JSP and servlets technologyProven strategies for achieving enterprise-class robustness and scalability with JSP technologyExpert guidance on implementing JSP technology-based applications with reusable componentsTo fully exploit the power of JavaServer Pages technology in Web application development, based on J2EE technology, you need to master the sophisticated server-side techniques that David Geary presents in Advanced JavaServer Pages. Geary tackles JavaServer Pages technology with the same exhaustive, authoritative approach that made his Graphic Java books into worldwide best sellers. He presents in-depth coverage of advanced topics including:Implementing custom JSP technology tagsDesigning scalable and extensible Web applicationsUsing authentication to build secure JSP technology-based applications Internationalizing JSP technology-based applications for global environmentsAdvanced JavaServer Pages features detailed chapters on internationalization, authentication, JSP technology templates, design, and XML. It concludes with a comprehensive case study that ties together key topics developed in thebook and demonstrates how to integrate advanced techniques based on JSP technology. This book is a must-have resource for every developer of Java technology creating server-side applications with JSP technology and servlets.
Networking for Dummies, 5th edition
Authors: Doug Lowe
Venue:  (2000)

:If you need to set up a network at the office but aren't sure what a network is, much less how to set one up, Networking For Dummies&#174, 2nd Edition, gives you the help you need! This friendly, easy-to-follow guide explains everything you need to know to select, set up, use, and manage a computer network in a non-intimidating way that anyone can understand -- even if you don't have a computer science degree! Use Networking For Dummies, 2nd Edition, the fun and easy way: Find up-to-date information on NetWare, Windows NT Server, and Windows 95, plus LANtastic and Windows for Workgroups Connect your network to the Internet -- quickly and easily! Set up a corporate Intranet to disseminate information to your employees Figure out how to network your printers and modems to make your office more friendly and efficient Solve common but annoying network problems Discover the basics of Macintosh networking Help new users understand how to use networks Find your way through those tangled webs of network cables, adapter cards, and other network paraphernalia Plus Doug's Lists of Top Ten Networking Tips: Ten commandments of network management Ten tricks to networking Windows Ten hot buzzwords guaranteed to enliven a cocktail party
"Sometime" is sometimes "not never": on the temporal logic of programs
Authors: Leslie Lamport
Venue: Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1980)

Pnueli [15] has recently introduced the idea of using temporal logic [18] as the logical basis for proving correctness properties of concurrent programs. This has permitted an elegant unifying formulation of previous proof methods. In this paper, we attempt to clarify the logical foundations of the application of temporal logic to concurrent programs. In doing so, we will also clarify the relation between concurrency and nondeterminism, and identify some problems for further research.In this paper, we consider logics containing the temporal operators "henceforth" (or "always") and "eventually" (or "sometime"). We define the semantics of such a temporal logic in terms of an underlying model that abstracts the fundamental concepts common to almost all the models of computation which have been used. We are concerned mainly with the semantics of temporal logic, and will not discuss in any detail the actual rules for deducing theorems.We will describe two different temporal logics for reasoning about a computational model. The same formulas appear in both logics, but they are interpreted differently. The two interpretations correspond to two different ways of viewing time: as a continually branching set of possibilities, or as a single linear sequence of actual events. The temporal concepts of "sometime" and "not never" ("not always not") are equivalent in the theory of linear time, but not in the theory of branching time -- hence, our title. We will argue that the logic of linear time is better for reasoning about concurrent programs, and the logic of branching time is better for reasoning about nondeterministic programs.The logic of linear time was used by Pnueli in [15], while the logic of branching time seems to be the one used by most computer scientists for reasoning about temporal concepts. We have found this to cause some confusion among our colleagues, so one of our goals has been to clarify the formal foundations of Pnueli's work.The following section gives an intuitive discussion of temporal logic, and Section 3 formally defines the semantics of the two temporal logics. In Section 4, we prove that the two temporal logics are not equivalent, and discuss their differences. Section 5 discusses the problems of validity and completeness for the temporal logics. In Section 6, we show that there are some important properties of the computational model that cannot be expressed with the temporal operators "henceforth" and "eventually", and define more general operators.
Proceedings of the 2002 ACM symposium on Document engineering
Venue: Document Engineering (2002)

Welcome to the ACM Symposium on Document Engineering (DocEng) 2002, the second in a series of meetings on the emerging area of document engineer-ing, which investigates, from the perspective of computer science, systems for creating, managing, and maintaining documents in any form and in all media.DocEng'02 is the second in what we hope will be a long series of meet-ings. The first of the series, DocEng'01, was held in Atlanta, GA during November of 2001. The symposium continues the tradition of several other con-ferences, including the long series of biennial Electronic Publishing (EP) confer-ences and Principles of Document Processing workshops, the 2000 Digital Documents and Electronic Publishing conference, the 1988 ACM Conference on Document Processing Systems, and the 1981 ACM Symposium on Text Manipulation.DocEng'02 once again joins with the ACM Conference on Information and Knowledge Management (CIKM) to present this symposium. We wish to thank the CIKM organizing committee for their assistance.The technical program results from the efforts of the Program Committee and additional reviewers. Each paper received at least three reviews. We thank the PC and reviewers for their careful reviews and prompt efforts, especially as our review schedule coincided with many committee members' vacation schedules. Forty-six papers were submitted and the committee selected twenty-one papers for presentation at DocEng'02.We hope you will agree with us that the Symposium's papers reflect a broad and dynamic area of research, and share with us our excitement over the directions and activities presented here.