ppxscal/embedding_network huggingface dataset:
Mayfield Quick View Guide to the Internet for Students of Health, Physical Education and Exercise Science Version 2.0, 2nd edition
Authors: Jennifer Campbell Koella, Michael Keene
Venue:  (2000)

:This brief guide gives students and teachers a reference to the Internet and World Wide Web. It includes sections on finding, using, and documenting sources, source reliability, the Internet and job searches, communicating with e-mail and in virtual communities, and more.
Analysis of simple programs over different sets of primitives
Authors: A. J. Kfoury
Venue: Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (1980)

It is well known that most questions of interest about the behavior of programs--such as equivalence, halting, optimization, and other problems--are undecidable. On the other hand, it is possible to make some or all of these questions decidable by introducing appropriate restrictions on the programming language under consideration. And once such restrictions are made, the next step is to ask how hard it is to solve these problems for programming languages for which they are decidable.This analysis of programming languages has been undertaken by others, in particular by Jones and Muchnick [4], who choose to restrict their programs to operate over finite memory. Our approach starts from the language of loop-programs, as defined by Meyer and Ritchie [1], in which we in fact allow more general arithmetical operations. Unlike Jones and Muchnick, we do not place any restriction on memory here; instead, we (primarily) restrict our attention to loop-programs without nested loops.
Understanding Microsoft Windows 2000 Distributed Services
Authors: David Chappell
Venue:  (1999)

:For programmers and highly technical managers, this book offers a clear overview of Microsoft Transaction Server (MTS). The title gives a solid introduction to the architecture of MTS and related services, providing a readable, coherent overview of the entire topic--and a clear understanding of how the various technologies fit together in an enterprise's application strategy. Experience Level: Beginner/ Intermediate
Distributed streams algorithms for sliding windows
Authors: Phillip B. Gibbons, Srikanta Tirthapura
Venue: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures (2002)

This paper presents algorithms for estimating aggregate functions over a "sliding window" of the N most recent data items in one or more streams. Our results include:<ol>For a single stream, we present the first &egr;-approximation scheme for the number of 1's in a sliding window that is optimal in both worst case time and space. We also present the first &egr; for the sum of integers in [0..R] in a sliding window that is optimal in both worst case time and space (assuming R is at most polynomial in N). Both algorithms are deterministic and use only logarithmic memory words.In contrast, we show that an deterministic algorithm that estimates, to within a small constant relative error, the number of 1's (or the sum of integers) in a sliding window over the union of distributed streams requires &OHgr;(N) space. We present the first randomized (&egr;,&sgr;)-approximation scheme for the number of 1's in a sliding window over the union of distributed streams that uses only logarithmic memory words. We also present the first (&egr;,&sgr;)-approximation scheme for the number of distinct values in a sliding window over distributed streams that uses only logarithmic memory words.</olOur results are obtained using a novel family of synopsis data structures.
Asynchronous Parallel Pattern Search for Nonlinear Optimization
Authors: Patricia D. Hough, Tamara G. Kolda, Virginia J. Torczon
Venue: SIAM Journal on Scientific Computing (2001)

We introduce a new asynchronous parallel pattern search (APPS). Parallel pattern search can be quite useful for engineering optimization problems characterized by a small number of variables (say, fifty or less) and by objective functions that are expensive to evaluate, such as those defined by complex simulations that can take anywhere from a few seconds to many hours to run. The target platforms for APPS are the loosely coupled parallel systems now widely available. We exploit the algorithmic characteristics of pattern search to design variants that dynamically initiate actions solely in response to messages, rather than routinely cycling through a fixed set of steps. This gives a versatile concurrent strategy that allows us to effectively balance the computational load across all available processors. Further, it allows us to incorporate a high degree of fault tolerance with almost no additional overhead. We demonstrate the effectiveness of a preliminary implementation of APPS on both standard test problems as well as some engineering optimization problems.
Scientific Simulations with Special Purpose Computers: The Grade Systems, 1st edition
Authors: J. Makimo, Makoto Taiji
Venue:  (1998)

:Describes the structure, performance, and applications of the world's most advanced computer developed at the University of Tokyo. This book starts with an overview of these systems, and then focuses on an extremely high profile and successful project--the GRAPE Computer at the University of Tokyo. Also covers special-purpose systems, and considers the future direction of development for these devices.
Microsoft Commerce Server 2000 Pocket Consultant
Authors: Brad Wist
Venue:  (2001)

:Commerce Server 2000 reduces the complexity of building tailored, effective electronic-commerce solutions by providing the application framework together with sophisticated feedback mechanisms and analytical capabilities. MICROSOFT COMMERCE SERVER 2000 POCKET CONSULTANT is the ideal concise, on-the-go reference that administrators and developers will want to carry with them as they support and manage this server product. Designed as a quick reference for both developers and IT Professionals, this pocket guide is a concise guide to Commerce Server's management services and tools, site architecture and basic components, user authentication, catalogue system, site transactions, business processing pipelines, and more. It's designed to help IT professionals build effective, user-centric solutions, get to market faster with e-commerce solutions, and empower the organizations they support to make educated decisions with real-time information. It's the fast answers, daily operations guide for busy IT professionals and developers who use Commerce Server 2000 to build real-life, highly scalable e-commerce sites It's an excellent on-the-go reference for Commerce Server 2000, and a great companion guide for the Microsoft Commerce Server 2000 Resource Kit. Key Book Benefits: * It's the fast answers, daily operations guide for busy IT professionals and developers who use Commerce Server 2000 to build e-commerce sites * Includes quick-reference tables, lists, and step-by-step instructionsideal for administrators and developers on the go * Provides compelling information about key components of Commerce Server 2000, and shows how to buildreal-life, highly scalable e-commerce sites
Project Managing E-Learning
Venue:  (2002)

Book Description Project Managing E-Learning is the fifth book in the new ASTD E-Learning Series and explains how to apply classic project management principles to the job of launching and managing a successful e-learning project. Like the other books in the series, Project Managing E-Learning is practical, easy to read, and focuses on application. In addition to its practical grounding in project management , it provides readers with pointers on how to avoid technical issues that can bring an e-learning project to a halt. Just reading the top 18 list of why e-learning projects fail could prove invaluable to the success of a current or future project. Project Managing E-Learning includes practical hands-on Your Turn sections that offer exercises, worksheets, and other guidance to help reinforce your learning. those found in the book for immediate application.
NetScape Communicator for Busy People, 1st edition
Authors: Christian Crumlish, Jeff Hadfield
Venue:  (1997)

:Addresses all of Communicator 4. 0's components,including Navigator,Messenger,Collabra,Composer,Conference,and Netcaster. In-depth coverage and complete step-by-step instructions on using Netscape Communicator 4. 0's features,including browsing,e-mail,newsgroups,Web publishing,conferencing and Netcasting. Perfect for people who need to get up and running on Netscape Communicator 4. 0,but don't have time to comb through useless information. A task-oriented,full-color visual approach to teaching.
UNIX System Programming, 2nd edition
Authors: Keith Haviland, Gina Gray, Benb Salama
Venue:  (1999)

:The UNIX operating system has become a key part of the technology landscape as we move into the 21st century. There are now a huge number of large-scale data management and transaction-processing systems built on UNIX platforms, and UNIX is at the core of the server backbone of the Internet. 'The new edition of this highly successful book for professional programmers provides a lucid and well structured guide to developing UNIX software in the C language, and has been updated to reflect the more distributed environments typical of current IT solutions. UNIX System Programming concentrates on a detailed study of the UNIX system call interface - the programming interface between the UNIX kernel and application software running in the UNIX environment - and additionally covers some of the more important subroutine libraries. Features fundamental techniques are developed in depth and are fully supported with program examples highly relevant to the two important standards - the X/OPEN portability guide and the IEEE POSIX standard strong emphasis on exercises and examples throughout New to this edition more on signals and signal handling more on interprocess communication using pipes more on advanced interprocess communications and the terminal whole section on sockets From a wealth of experience of developing system and application software, and a real appreciation of the needs of UNIX system programmers, the authors fully appreciate that computing is not a spectator sport. By exploring both system calls and subroutine libraries they give the reader a practical appreciation of when not to reinvent the wheel, as well as a better understanding of the internal workings of this still elegant operating system.
Opsis: a distributed object architecture based on bracket capabilities
Authors: Mark Evered
Venue: Proceedings of the Fortieth International Conference on Tools Pacific: Objects for internet, mobile and embedded applications (2002)

The object-oriented access control in contemporary middleware is inadequate in view of the sensitivity of data stored on the internet and the growing threat from hackers and malicious software. In this paper we present the Opsis system, an architecture for distributed Java applications based on the strict use of 'bracket capabilities'. We describe the concept of 'capability servers' for supporting flexibility and transparency of remote invocation and for allowing the migration of objects. We demonstrate the power and simplicity of the system in an example E-commerce application including the definition of a form of secure electronic cheque.
Breaking the Access Barrier: Delivering Internet Connections over Cable
Authors: Mark E. Laubach, David Farber, Stephen Dukes
Venue:  (2002)

:An inside look at high-speed access written for the cable industryCable modems have emerged as a leading consumer choice for high-speed Internet access, outpacing alternatives such as digital subscriber lines, but not without raising issues about quality of service and controversy about open access. Providing an objective review of residential broadband and cable television networking, this book will be of great use for professionals who are integrating cable into their networks or service offerings. The authors compare cable access systems to competing technologies and discuss the increasingly difficult issues confronting each. Readers will also find coverage of the hottest areas in the field including high-speed data and packet voice standards, managing the "always-on" connection, and security and privacy risks.
C++: An Introduction to Computing, 3rd edition
Authors: Joel Adams, Larry Nyhoff
Venue:  (2002)

:I think it's well written and intelligently presented. It's a good introduction not only to C++ programming, but also to computer science as a whole. - Larry Herman, UNITEC Institute of Technology This book has a very large number of exercises, with a large variety of types. It is one the things that attracted me to the text. I am pleased with the quantity and quality of the exercises in this book. - Cary Laxer, Computer Science, Rose-Hulman Institute of Technology Joel Adams and Larry Nyhoff address two key goals for first-year computing courses: to give students programming skills in a specific language, and to introduce them to the larger field of computer science. In this third edition of their best-selling book, these experienced educators offer a well-rounded approach to the methodologies and techniques of C++, while presenting students with a general overview of computing as a discipline, allowing them to put their learning into a broader context. KEY FEATURES Provides carefully selected Part of the Picture presentations by computing experts as an overview of the discipline of computer science Offers 500 Quick Quiz questions with answers and 800 written exercises to be used for written assignments Includes more than 300 programming problems drawn from a wide range of application areas NEW TO THIS EDITION A new chapter on data structures Learning objectives listed at the beginning of each chapter End-of-chapter summaries with key words and notes to help students identify the main concepts of each chapter Case studies featuring problems withcomplete solutions, including both design and program code Special optional OBJECTive Thinking sections to present classes and objects Prentice Hall Companion Website at http://www.prenhall.com/adams and authors' website at http://cs.calvin.edu/books/c++/intro/3e/
Order Conditions of Stochastic Runge--Kutta Methods by B-Series
Authors: K. Burrage, P. M. Burrage
Venue: SIAM Journal on Numerical Analysis (2000)

In this paper, general order conditions and a global convergence proof are given for stochastic Runge--Kutta methods applied to stochastic ordinary differential equations (SODEs) of Stratonovich type. This work generalizes the ideas of B-series as applied to deterministic ordinary differential equations (ODEs) to the stochastic case and allows a completely general formalism for constructing high order stochastic methods, either explicit or implicit. Some numerical results will be given to illustrate this theory.
A Noncontrollability Result for Systems of Mixed Order
Authors: Giuseppe Geymonat, Vanda Valente
Venue: SIAM Journal on Control and Optimization (2000)

In this paper we prove an abstract theorem of noncontrollability for the evolution equation associated to a Douglis--Nirenberg elliptic system of mixed order with nonempty essential spectrum. In particular, we show by Weyl's characterization of the essential spectrum that the condition of exact controllability does not hold true. We discuss examples concerning the elasticity operator in the framework of the linear membrane shell theory.
Understanding GIS; The ARC/INFO Method (PC Version), 2nd edition
Authors: Teresa Connolly, Birkbeck College
Venue:  (1998)

:Essential reading for students, researchers, and professionals who use GIS and ARC/INFO software. It is also suitable for practical lab classes and professional reference. This workbook introduces some of the basic concepts of GIS and overviews the functions and capabilities of ARC/INFO. The lessons contained in this book will guide you in the completion of a small GIS project. You will design and develope a digital spatial database, perform spatial analysis, create a map, and generate a report.
A generating functionology approach to a problem of Wilf
Authors: Paweł Hitczenko Cecil Rousseau, Carla D. Savage
Venue: Journal of Computational and Applied Mathematics (2002)

Wilf posed the following problem: determine asymptotically as n → ∞ the probability that a randomly chosen part size in a randomly chosen composition of n has multiplicity m. One solution of this problem has been given by two of the authors <http://www.csc.ncsu.edu/faculty/savage/>. In this paper, we study this question using the techniques of generating functions and singularity analysis.
Expert Systems, 3rd edition
Authors: Joseph C. Giarratano, Gary Riley
Venue:  (1998)

:This book combines coverage of expert systems theory with coverage of practical applications using CLIPS, an expert systems shell widely used in government, industry, and education. The first half of the book (Chapters 1-6) presents underlying theory, including knowledge representation, methods of inference, reasoning under uncertainty, and inexact reasoning (with fuzzy logic). The second half (Chapters 7-12) introduces readers to rule-based expert systems programming using the CLIPS programming language. Complete source code, reference manuals and example programs are provided on the bound-in CD-ROM, as well as papers from the virtual CLIPS conference run by the authors. The result is a self-contained book and CD-ROM package for computer science, engineering, and CIS/MIS students and professionals that provides the conceptual background and programming tools needed to understand and implement expert systems.
I-Series: Computing Concepts,Introductory Edition, 1st edition
Authors: Stephen Haag, Maeve Cummings, Alan Rea
Venue:  (2002)

:This exciting,new first edition concepts text emphasizes all that is current,cutting-edge,and interesting to students in the introductory course. Focusing specifically on users,consumers and purchasers of technology,this text provides a no-nonsense coverage of the absolute essentials for using technology in today's wired world. The I-Series offers excellent coverage on the basics,as well as extensive information on building a Web site,E-Commerce,implications of technological advances,maintaining a computer system,buying your first PC,and more. Each chapter also contains coverage of security,ethics,and privacy and an introduction to the web-based Life Long Learning modules.
Measuring the Goodness of Orthogonal Array Discretizations for Stochastic Programming and Stochastic Dynamic Programming
Authors: Victoria C. P. Chen
Venue: SIAM Journal on Optimization (2002)

This paper describes a continuous space discretization scheme based on statistical experimental designs generated from orthogonal arrays (OAs) of strength three with index unity. Chen, Ruppert, and Shoemaker [Oper. Res., 47 (1999), pp. 38--53] employed this efficient discretization scheme in a numerical solution method for high-dimensional continuous-state stochastic dynamic programming (SDP). These OAs may be instrumental in reducing the dimensionality of event spaces, SDP state spaces, and first-stage decision spaces in two-stage stochastic programming. In particular, computationally efficient space-filling measures for these OAs are derived for evaluating how well a specific OA discretization fills the state space. Comparisons were made with two types of common measures: ones which maximize the average (or minimum) distance between discretization points within the OA and ones which minimize the average (or maximum) distance between discretization points and nondiscretization points lying on a full grid (i.e., points lying on the full grid that are not contained in the OA discretization). OAs of strength three were tested by fitting multivariate adaptive regression splines to data from an inventory-forecasting continuous-state stochastic dynamic program.
The Structure of 1-Generator Quasi-Twisted Codes and New Linear Codes
Authors: Nuh Aydin, Irfan Siap, Dijen K. Ray-Chaudhuri
Venue: Designs, Codes and Cryptography (2001)

One of the most important problems of coding theory is to construct codes with best possible minimum distances. Recently, quasi-cyclic (QC) codes have been proven to contain many such codes. In this paper, we consider quasi-twisted (QT) codes, which are generalizations of QC codes, and their structural properties and obtain new codes which improve minimum distances of best known linear codes over the finite fields GF(3) and GF(5). Moreover, we give a BCH-type bound on minimum distance for QT codes and give a sufficient condition for a QT code to be equivalent to a QC code.
A+ Certification Training Guide with Cdrom, 2nd edition
Authors: Charles J. Brooks
Venue:  (1998)

:Description:A+ Certification Training Guide contains all the information and strategies you need to pass the A+ Certification exams. The book is organized around the exam objectives. Part One covers the Hardware Environment core exam, Part Two covers the Windows 95 specialty exam, and Part Three covers the Macintosh specialty exam. Reference information throughout all three parts is augmented by situational, hands-on material that demonstrates key concepts. Review questions and exercises test your knowledge and push you to a complete understanding of the exam requirements. Completely updated for the 1998 exam revision: Hardware Exam Module, DOS/Windows/Win95 Exam Module Extensive use of screen shots, exploded diagrams, tables, study highlights and annotated programming code The all-in-one solution to preparing for the exam--the only study materials needed to pass the exam -CD-ROM contains TestPrep test simulation engine, giving you hands-on experience with taking the exam, and building confidence
1997 4th International Workshop on Community Networking
Authors: IEEE Communications Society
Venue:  (1997)

:The fourth IEEE International Workshop in the series of Community Networking brings together representatives, practitioners and technical experts from Service Providers, Network Providers, Equipment Manufacturers and Research Community to a forum on the four key topics of networked services to the home and community.
Viscosity Solutions of the Bellman Equation for Exit Time Optimal Control Problems with Vanishing Lagrangians
Authors: Michael Malisoff
Venue: SIAM Journal on Control and Optimization (2001)

We study the Hamilton--Jacobi--Bellman equation for undiscounted exit time optimal control problems for fully nonlinear systems and fully nonlinear singular Lagrangians using the dynamic programming approach. We prove a local uniqueness theorem characterizing the value functions for these problems as the unique viscosity solutions of the corresponding Hamilton--Jacobi--Bellman equations that satisfy appropriate boundary conditions. The novelty of this theorem is in the relaxed hypotheses on the lower bound on the Lagrangian and the very general assumptions on the target set. As a corollary, we show that the value function for the Fuller problem is the unique viscosity solution of the corresponding Hamilton--Jacobi--Bellman equation that vanishes at the origin and satisfies certain growth conditions. This implies as special cases first that the value function of this problem is the unique proper viscosity solution of the corresponding Hamilton--Jacobi--Bellman equation, in the class of all functions which are continuous in the plane and null at the origin, and second that this value function is the unique viscosity solution of that equation in a class which includes functions which are not bounded below. We also apply our results to the degenerate eikonal equation of geometric optics and to the shape-from-shading equations in image processing. Our theorem also applies to problems with noncompact targets and unbounded control sets whose Lagrangians take negative values.