ppxscal/embedding_network huggingface dataset:
Quality of Service Issues in Internet Web Services
Authors: Marco Conti, Mohan Kumar, Sajal K. Das, Behrooz A. Shirazi
Venue: IEEE Transactions on Computers (2002)

We take great pleasure in introducing this special section on "Quality of Service Issues in Internet Web Services" to the readership of the IEEE Transactions onComputers . This special section is comprised of seven papers, spanning caching, prefetching, replication, admission control, and router scheduling. The topics coveredinclude theoretical and implementation aspects of provisioning quality of service (QoS).
Virtual Private Networks for Dummies, 1st edition
Authors: Mark S. Merkow, Dummies Technology Press
Venue:  (1999)

:Virtual private networks enable a company to lock in ironclad security for e-commerce transactions - and link remote sites at a fraction of what conventional network's cost. This uniquely accessible guide show IS professionals everywhere how to take advantage of this exciting but complex new technology. In true For Dummies style, the book demystifies "IP tunneling" and the three basic principles behind it - encapsulation, authentication, and encryption - and offers proven, practical solutions for successful implementation.
Test Yourself MCSE Windows 2000 Professional (Exam 70-210)
Authors: James Truscott
Venue:  (2000)

:Don't let the real test be your first test! Osborne's MCSE Windows 2000 Professional Test Yourself Practice Exams contains hundreds of practice questions for exam 70-210one of the Core Four required MCSE certification exams. The book is organized by official exam objective and contains in-depth answers that explain why the correct options are right and why the incorrect options are wrong. Plus,a key code in the book entitles you to download full practice exam software from our site!Don't Let the REAL Test Be Your First Test!More Questions - More Content: Score Higher With The Most Effective Self-Testing and Quick Review Program Available Based on the MCSE Installing,Configuring,and Administering Microsoft Windows 2000 Professional exam (20-210)Coverage features quick review of all technology objectives and more than 225 realistic exam questions to build your knowledgeExclusive "Exam Watch" features point out the most frequently missed questions - and how to answer them correctly Answers provide in-depth explanations - and show why the incorrect choices are wrong,as shown below: John wants to monitor all the processes,services,and drivers that are running on his computer. He'd also like to see the process name,process ID (PID),the percentage of CPU time being used,and the elapsed time using the CPU and memory usage. Where is the best place for John to view this information? A. System Monitor B. Task Manager C. Scheduled Tasks D. The latest System Monitor log file B. Task Manager can be used for different tasks,and allows you to monitor applications,processes,and different performancestatistics. Task Manager has three tabs: Applications,Processes,and Performance. The information above can all be found under the Performance tab of Task Manager. A is incorrect since System Monitor is not the best choice here. All of the requirements can be accessed in one area of Task Manager. The Scheduled Tasks utility does not offer this information,making C incorrect. D is incorrect since the latest System Monitor log file does not contain all of this real-time information.
Fast Evaluation of Radial Basis Functions: Methods for Generalized Multiquadrics in $\RR^\protectn$
Authors: J. B. Cherrie, R. K. Beatson, G. N. Newsam
Venue: SIAM Journal on Scientific Computing (2001)

A generalized multiquadric radial basis function is a function of the form $ s(x) = \sum_{i=1}^N d_i \phi(|x -t_i|), $ where $ \phi(r)= ( r^2+\tau^2 )^{k/2}$, $x \in \mathbb{R}^n$, and $k\in\mathbb{Z}$ is odd. The direct evaluation of an N center generalized multiquadric radial basis function at m points requires $\mathcal{O}(m N)$ flops, which is prohibitive when m and N are large. Similar considerations apparently rule out fitting an interpolating N center generalized multiquadric to N data points by either direct or iterative solution of the associated system of linear equations in realistic problems.In this paper we will develop far field expansions, recurrence relations for efficient formation of the expansions, error estimates, and translation formulas for generalized multiquadric radial basis functions in n-variables. These pieces are combined in a hierarchical fast evaluator requiring only $\mathcal{O}((m+N)\log N|\log\epsilon|^{n+1})$ flops for evaluation of an N center generalized multiquadric at m points. This flop count is significantly less than that of the direct method. Moreover, used to compute matrix-vector products, the fast evaluator provides a basis for fast iterative fitting strategies.
Army Men Air Combat
Authors: Prima Publishing Staff
Venue:  (2000)

:Continuing the epic battles between the Green and Tan plastic soldiers, Army Men Air Combat takes combat to the skies with the vaunted Air Cavalry. Players lead the Air Cavalry in a new series of campaigns and multiplayer levels. Together with Sarge, you will fight in the air and on the ground to rescue POWs, extract wounded allies, sabotage enemy plans, and most importantly, fight the evil Tan nemesis. The Tans don't stand a chance with Army Men Air Combat: Prima's Official Strategy Guide in your hands. Inside, you'll find:Complete flythroughs of every missionCoverage of multiplayer and cooperative playWeapons and equipment listsDetailed maps for every missionLocations of all power-ups, enemies, vehicles, and weapons 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
The parallelization of the perspective shear-warp volume rendering algorithm
Authors: Jürgen P. Schulze, Ulrich Lang
Venue: Proceedings of the Fourth Eurographics Workshop on Parallel Graphics and Visualization (2002)

The shear-warp algorithm for volume rendering is among the fastest volume rendering algorithms. It is an object-order algorithm, based on the idea of the factorization of the view matrix into a 3D shear and a 2D warp component. Thus, the compositing can be done in sheared object space, which allows the algorithm to take advantage of data locality. Although the idea of a perspective projection shear-warp algorithm is not new, it is not widely used. That may be because it is slower than the parallel projection algorithm and often slower than hardware supported approaches.In this paper, we present a new parallelized version of the perspective shear-warp algorithm. The parallelized algorithm was designed for distributed memory machines using MPI. The new algorithm takes advantage of the idea that the warp can be done in most computers' graphics hardware very fast, so that the remote parallel computer only needs to do the compositing. Our algorithm uses this idea to do the compositing on the remote machine, which transfers the resulting 2D intermediate image to the actual display machine. Even though the display machine could be a moderately equipped PC or laptop computer, it can be used to display complex volumetric data, provided there is a network connection to a high performance parallel computer. Furthermore, remote rendering could be used to drive virtual environments, which typically require perspective projection and high frame rates for stereo projection and multiple screens.
MS SQL Server 7 Unleashed
Authors: Greg Mable, Sharon Bjeletich, Sams Publishing, et al
Venue:  (1999)

:Microsoft SQL Server 7 Unleashed offers a variety of topics for system and database administrators and programmers to help you learn new features and objects of the product and solve problems you face on a daily basis. Building upon your working knowledge of the product, it takes your experience and knowledge to a more expert level. This title includes topics such as SQL Server architecture and Transact-SQL programming, performance tuning and system administration, Web and Scalability issues, integration with BackOffice, and much more.
The Unfinished Revolution: Human-Centered Computers and What They Can Do for Us
Authors: Michael L. Dertouzos
Venue:  (2002)

:Using a computer ought to be as easy and productive as driving your car. But today's systems are oblivious to our needs and demand ever more attention and work from us, as they swell in numbers, complexity and features. now Michael Dertouzos argues that we must shift the focus of information technology away from machines and back to people. In The Unfinished Revolution, he not only outlines five key technologies that will help us do this, he also offers and exciting vision of how human-centric computers could dramatically alter the way we live and work in the Information Century. About the Author:For more than a quarter century, Michael Dertouzos has headed up the MIT Laboratory for Computer Science, which has been associated with many of the most important developments in computing. Dertouzos is the author of the 1997 best-seller What Will Be: How the New World of Information Will Change Our Lives. He lives in Weston, MA.
Dino Crisis 2: Sybex Official Strategies and Secrets
Authors: Bart G. Farkas, Doug Radcliffe
Venue:  (2000)

:This fastpaced action/adventure thriller is Capcom's highly anticipated followup to last year's hit. Dino Crisis 2 features female and male lead characters, stunning graphics, and tons of primary and secondary weapons for dealing with a horde of maneating dinosaurs. Sybex's official strategy guide provides a detailed, screenbyscreen walkthrough of the game's expansive levels, strategies and tactics for dealing with each deadly dino, and tips to uncover every single secret in what's sure to be a brontosaurussized PlayStation hit. Plus, each copy includes an exclusive fullcolor poster!
Lectures on information retrieval
Authors: Maristella Agosti, Fabio Crestani, Gabriella Pasi
Venue: Lecture Notes In Computer Science; Vol. 1980 (2001)

Information Retrieval (IR) is concerned with the effective and efficient retrieval of information based on its semantic content. The central problem in IR is the quest to find the set of relevant documents, among a large collection containing the information sought, satisfying a user's information need usually expressed in a natural language query. Documents may be objects or items in any medium: text, image, audio, or indeed a mixture of all three.
The Numerical Solution of the Steady State Solid Fuel Ignition Model and Its Optimal Control
Authors: Alfio Borzì, Karl Kunisch
Venue: SIAM Journal on Scientific Computing (2000)

We present a finite difference multigrid technique that efficiently solves optimal control problems associated with the steady state solid fuel ignition model. This is a nonlinear indefinite problem which gives rise to singular optimal control systems. Regarding the direct problem, necessary and sufficient conditions for existence of solutions are given and second-order convergence of numerical solution errors with respect to the mesh size is proven. A robust nonlinear multigrid method is implemented to validate this convergence estimate.Two optimal control strategies for solid fuel ignition phenomena are considered and compared. The corresponding optimality systems are solved to second-order accuracy by a multigrid method whose convergence properties are independent of the values of the weights in the cost functionals and of the number of grid points.
Optical Filter Design and Analysis: A Signal Processing Approach, 1st edition
Authors: Christie K. Madsen, J.H. Zhao
Venue:  (1999)

:A Unique, Cutting-Edge Approach to Optical Filter Design With more and more information being transmitted over fiber-optic lines, optical filtering has become crucial to the advanced functionality of todays communications networks. Helping researchers and engineers keep pace with this rapidly evolving technology, this book presents digital processing techniques for optical filter design. This higher-level approach focuses on filter characteristics and enables readers to quickly calculate the filter response as well as tackle larger and more complex filters. The authors incorporate numerous theoretical and experimental results from the literature and discuss applications to a variety of systemsincluding the new wavelength division multiplexing (WDM) technology, which is fast becoming the preferred method for system upgrade and expansion. Special features of this book include:*The theory underlying various architectures that can approximate any filter function*Filter design techniques applicable to a broad range of materials systemsfrom silica to fiber to microelectromechanical (MEM) systems*Design examples relevant to filters for WDM systems and planar waveguide devices*250 figures as well as problem sets for use in graduate-level studies
A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
Authors: Mihai Anitescu
Venue: SIAM Journal on Optimization (2002)

We present an algorithm that achieves superlinear convergence for nonlinear programs satisfying the Mangasarian--Fromovitz constraint qualification and the quadratic growth condition. This convergence result is obtained despite the potential lack of a locally convex augmented Lagrangian. The algorithm solves a succession of subproblems that have quadratic objectives and quadratic constraints, both possibly nonconvex. By the use of a trust-region constraint we guarantee that any stationary point of the subproblem induces superlinear convergence, which avoids the problem of computing a global minimum. We compare this algorithm with sequential quadratic programming algorithms on several degenerate nonlinear programs.
Systematically combining process simulation and empirical data in support of decision analysis in software development
Authors: Ioana Rus, Stefan Biffl, Michael Halling
Venue: Proceedings of the 14th international conference on Software engineering and knowledge engineering (2002)

Decision-making is a complex and important task in software engineering. The current state-of-the-practice is rather non-systematic as it typically relies upon personal experience without using explicit models. Empirical studies can help but are to some extent context dependent and costly to conduct. Typically it is not efficient or even possible to conduct empirical studies for a large number of context parameter variations. We propose to build on a set of systematic empirical studies to fill gaps in context variable space with simulation: (a) Simulation can use the empirical results from different contexts and apply them to a planning situation as appropriate. (b) The analysis of simulation results can point out situations and factors for which conducting empirical studies would be most worthwhile. This paper presents a general decision model, a simulation framework, and examples for different decisions to use V&V activities in software development (e.g., under which conditions is a V&V activity, such as a re-inspection, worthwhile) to demonstrate practical applications of the general model.
Discrete models for geometric objects
Authors: Pere Brunet
Venue: Proceedings of the seventh ACM symposium on Solid modeling and applications (2002)

This lecture presents and discusses the use of discrete models for modeling geometric objects. Discrete models (voxel representations, octrees, KD-trees, interval solids or even point representations) are emerging as a flexible tool for geometric modeling. These algorithms exploit the trade-off between robustness and memory. The availability at low cost of large amounts of memory affords thus completely robust models. Discrete bands can be used for instance for reconstructing valid closed models from point clouds, and to obtain different kinds of smooth Boundary Representations. On the other hand, discrete representations are specially well suited for error-bounded geometry and topology simplification, being also useful for occlusion culling in the inspection and navigation of very large virtual environments. Basic tools for modeling, surface extraction and visualization, simplification and relaxation will be described, and a number of potential applications will be presented.
Naked in Cyberspace: How to Find Personal Information Online, 2nd edition
Authors: Carole A. Lane
Venue:  (2002)

:Surveying the types of personal records that are available on the Internet and through online services, this encyclopedic book explains how researchers find and use personal data, identifies the most useful sources of information about people, and offers advice for those with privacy concerns. Researchers will learn how to use online tools and databases to gain competitive intelligence, locate and investigate people, access public records, identify experts, find new customers, recruit employees, search for assets, uncover criminal records, and conduct genealogical research. Added to this updated edition is a more comprehensive listing of all vendors of public records.Carole A. Lane is the owner of TechnoSearch, Inc. a technology research firm. She lives in Vista, California.
A conservative algorithm for computing the flow of permissions in Java programs
Authors: Gleb Naumovich
Venue: Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis (2002)

Open distributed systems are becoming increasingly popular. Such systems include components that may be obtained from a number of different sources. For example, Java allows run-time loading of software components residing on remote machines. One unfortunate side-effect of this openness is the possibility that "hostile" software components may compromise the security of both the program and the system on which it runs. Java offers a built-in security mechanism, using which programmers can give permissions to distributed components and check these permissions at run-time. This security model is flexible, but using it is not straightforward, which may lead to insufficiently tight permission checking and therefore breaches of security.In this paper, we propose a data flow algorithm for automated analysis of the flow of permissions in Java programs. Our algorithm produces, for a given instruction in the program, a set of permissions that are checked on all possible executions up to this instruction. This information can be used in program understanding tools or directly for checking properties that assert what permissions must always be checked before access to certain functionality is allowed. The worst-case complexity of our algorithm is low-order polynomial in the number of program statements and permission types, while comparable previous approaches have exponential costs.
Photographic tone reproduction for digital images
Authors: Erik Reinhard, Michael Stark, Peter Shirley, James Ferwerda
Venue: ACM Transactions on Graphics (TOG) (2002)

A classic photographic task is the mapping of the potentially high dynamic range of real world luminances to the low dynamic range of the photographic print. This tone reproduction problem is also faced by computer graphics practitioners who map digital images to a low dynamic range print or screen. The work presented in this paper leverages the time-tested techniques of photographic practice to develop a new tone reproduction operator. In particular, we use and extend the techniques developed by Ansel Adams to deal with digital images. The resulting algorithm is simple and produces good results for a wide variety of images.
Oddworld: Abe's Odyssee: The Official Strategy Guide.
Authors: Melissa Tyler, Rusel DeMaria
Venue:  (1997)

:Be brave, not brunch with this book that provides complete walkthroughs for all levels, answers to all the temple puzzles, location of each secret area, and much more.
Runs of geometrically distributed random variables: a probabilistic analysis
Authors: Guy Louchard
Venue: Journal of Computational and Applied Mathematics (2002)

Using a Markov chain approach and a polyomino-like description, we study some asymptotic properties of runs of geometrically distributed random variables. We analyze the limiting trajectories, the number of runs and the run length distribution, the hitting time to a length k run and the maximum run length.
Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
Authors: Jeffrey C. Lagarias, James A. Reeds, Margaret H. Wright, Paul E. Wright
Venue: SIAM Journal on Optimization (1998)

The Nelder--Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional unconstrained minimization. Despite its widespread use, essentially no theoretical results have been proved explicitly for the Nelder--Mead algorithm. This paper presents convergence properties of the Nelder--Mead algorithm applied to strictly convex functions in dimensions 1 and 2. We prove convergence to a minimizer for dimension 1, and various limited convergence results for dimension 2. A counterexample of McKinnon gives a family of strictly convex functions in two dimensions and a set of initial conditions for which the Nelder--Mead algorithm converges to a nonminimizer. It is not yet known whether the Nelder--Mead method can be proved to converge to a minimizer for a more specialized class of convex functions in two dimensions.
Clustering Windows Servers: A Road Map for Enterprise Solutions
Authors: Gary Mauler, Milt Beebe
Venue:  (2001)

:Demystifies Windows clustering from both a hardware and software viewpoint -Defines clustering terminology and concepts from a vendor-neutral perspective-Provides a matrix for evaluating the multitude of cluster technology offeringsAn IT decision-maker's road map to creating scalable and reliable Windows 2000 clustered systems.Clustering Windows 2000 explains what a cluster is and what it is not. It explains the concepts and technology from the perspective of Microsoft's Windows family of operating systems. Mauler and Beebe thoroughly explore the critical interaction and integration of state-of-the-art computer hardware with these operating systems and also with third-party layered solutions. However, more than teaching technology, the book provides a unique framework by which readers can evaluate their organizations' own clustering needs. The new Cluster Configuration MatrixC presented here allows them to determine the utility of the many clustering products and solutions given their companies' specific requirements for high availability. Clustering Windows 2000 enables IT professionals to create a highly effective clustering strategy that can grow with their organizations' needs and accommodate ongoing developments in clustering technology.About the Author: Fellow Engineer with Northrop Grumman. Mauler has been designing and implementing clustered systems since the early eighties.