ppxscal/embedding_network huggingface dataset:
Programming Distributed Applications with Com+ and Microsoft Visual Basic 6.0, Second Edition, 2nd edition
Authors: Ted Pattison, Don Box
Venue:  (2000)

:With Programming Distributed Applications with COM+ and Microsoft Visual Basic, programmers discover how to execute enterprise-level development tasks formerly achievable only in the C++ environment. This astute reference takes the complexities out of the Component Object Model (COM) and explains how to use the significant COM-based capabilities in Microsoft Visual Basic 6.0 to create scalable, distributed solutions--with information and resources geared specifically to the Visual Basic development system. Additions to the popular first edition of this title cover building type libraries with IDL, configured components, setting up a distributed application, and using ADO in the middle tier. This title provides the perfect entry point for developers who need to understand COM+ and Microsoft's component architecture for Visual Basic programmers. The author is a recognized expert on this subject, and this title has many concrete, hands-on examples to ease task-oriented, enterprise development. Enterprise developers get the perfect introduction to COM to enhance their productivity. Visual Basic Developers can leverage their Visual Basic expertise to build middle-tier business objects. Title is based on the very popular first version of this book, now updated to discuss COM+.
Digital Projects for Musicians: Twenty Exciting, Useful, and Educational Projects for Studio or Stage
Authors: Craig Anderton, Bob Moses, Greg Bartlett
Venue:  (1994)

:Build your own MIDI computer and run 20 exciting, useful, and educational projects for studio or stage. A must for any MIDI hobbyist.
Houses, windows and DOHR's: (descriptive object of high rank)
Authors: Stephen M. Mansour
Venue: Proceedings of the international conference on APL-Berlin-2000 conference (2000)

Anyone who buys a house can appreciate the complexity of a mortgage. Mortgage analysis requires not only significant computations, but also vast quantities of input and output. The interface between APL and Windows can provide a link between the input and the calculations; however, display of the output remains a problem. Mortgage data are inherently multi-dimensional, resulting in high-rank arrays. The dimensions involve individual mortgages or bond classes, and various prepayment and default scenarios, time periods, and cash flows.Although higher rank arrays can be difficult to visualize and interpret, a matrix can be displayed quite easily as an HTML table with row and column headers identifying the data. In a GUI, it can be displayed as a grid object. A rank-3 array can be displayed as a series of HTML tables each linked from a table of contents at the beginning of the document; as a GUI, it can be displayed as a tab control, each tab containing a grid object.APL has many functions to handle high-rank arrays, e.g. dyadic transpose, indexing, and the reduction operator. Descriptive Objects of High Rank (DOHR's) are nested arrays containing built-in captions, named axes, and named indexes. Certain fundamental operations can be performed on these objects to produce easily readable output. These include selection, summary, orientation and annexation. These fundamental operations are based on upon the following APL concepts: reduction--the removal of an axis, compression--the removal of one or more indexes, transpose--the rearrangement of axes, and catenation/lamination--combining objects along an axis. Most functions that apply to DOHR's can be built upon these fundamental operations.
Numerical Recipes in C: The Art of Scientific Computing, 2nd edition
Authors: William H. Press, Saul A. Teukolsky, William T. Vetterling, Brian P. Flannery
Venue:  (1992)

:This is the greatly revised and expanded Second Edition of the hugely popular Numerical Recipes: The Art of Scientific Computing. The product of a unique collaboration among four leading scientists in academic research and industry Numerical Recipes is a complete text and reference book on scientific computing. In a self-contained manner it proceeds from mathematical and theoretical considerations to actual practical computer routines. With over 100 new routines bringing the total to well over 300, plus upgraded versions of the original routines, the new edition remains the most practical, comprehensive handbook of scientific computing available today. Highlights of the new material include: A new chapter on integral equations and inverse methods Multigrid and other methods for solving partial differential equations Improved random number routines Wavelet transforms The statistical bootstrap method A new chapter on less-numerical algorithms including compression coding and arbitrary precision arithmetic. The book retains the informal easy-to-read style that made the first edition so popular, while introducing some more advanced topics. It is an ideal reference for scientists and engineers and indispensable to anyone who works in scientific computing. The Second Edition is available in the increasingly popular C language and in FORTRAN, the traditional language for numerical calculations. The C version takes advantage of many unique features of the C language including dynamic memory allocation, modularization, pointer reference to matrices, structured programming, and much more.
Interactive visualisation of large multivariate datasets on the world-wide web
Authors: J L Wesson, P R Warren
Venue: Proceedings of the 2001 Asia-Pacific symposium on Information visualisation - Volume 9 (2001)

Information visualisation of large multivariate datasets presents certain unique challenges. Few tools currently exist to facilitate the interactive display of such information on the World-Wide Web. This paper discusses the representation of multivariate data and the development of an API and an example application to view large datasets interactively in 3D in a web-based environment. This application enables the user to dynamically create and view XYZ scatter charts of student placement information using a web browser.
Engineering web cache consistency
Authors: Jian Yin, Lorenzo Alvisi, Mike Dahlin, Arun Iyengar
Venue: ACM Transactions on Internet Technology (TOIT) (2002)

Server-driven consistency protocols can reduce read latency and improve data freshness for a given network and server overhead, compared to the traditional consistency protocols that rely on client polling. Server-driven consistency protocols appear particularly attractive for large-scale dynamic Web workloads because dynamically generated data can change rapidly and unpredictably. However, there have been few reports on engineering server-driven consistency for such workloads. This article reports our experience in engineering server-driven consistency for a sporting and event Web site hosted by IBM, one of the most popular sites on the Internet for the duration of the event. We also examine an e-commerce site for a national retail store. Our study focuses on scalability and cachability of dynamic content. To assess scalability, we measure both the amount of state that a server needs to maintain to ensure consistency and the bursts of load in sending out invalidation messages when a popular object is modified. We find that server-driven protocols can cap the size of the server's state to a given amount without significant performance costs, and can smooth the bursts of load with minimal impact on the consistency guarantees. To improve performance, we systematically investigate several design issues for which prior research has suggested widely different solutions, including whether servers should send invalidations to idle clients. Finally, we quantify the performance impact of caching dynamic data with server-driven consistency protocols and the benefits of server-driven consistency protocols for large-scale dynamic Web services. We find that (i) caching dynamically generated data can increase cache hit rates by up to 10&percnt;, compared to the systems that do not cache dynamically generated data; and (ii) server-driven consistency protocols can increase cache hit rates by a factor of 1.5-3 for large-scale dynamic Web services, compared to client polling protocols. We have implemented a prototype of a server-driven consistency protocol based on our findings by augmenting the popular Squid cache.
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Authors: Patrick Cousot
Venue: Theoretical Computer Science (2002)

We construct a hierarchy of semantics by successive abstract interpretations. Starting from the maximal trace semantics of a transition system, we derive the big-step semantics, termination and nontermination semantics, Plotkin's natural, Smyth's demoniac and Hoare's angelic relational semantics and equivalent nondeterministic denotational semantics (with alternative powerdomains to the Egli-Milner and Smyth constructions), D. Scott's deterministic denotational semantics, the generalized and Dijkstra's conservative/liberal predicate transformer semantics, the generalized/total and Hoare's partial correctness axiomatic semantics and the corresponding proof methods. All the semantics are presented in a uniform fixpoint form and the correspondences between these semantics are established through composable Galois connections, each semantics being formally calculated by abstract interpretation of a more concrete one using Kleene and/or Tarski fixpoint approximation transfer theorems. Copyright 2002 Elsevier Science B.V.
Lessons Learned in Software Testing
Authors: Cem Kaner, James Bach, Bret Pettichord
Venue:  (2001)

:Great software testing teams arent born, theyre madethrough a lot of hard work and persuasive communication. Along the way, there is an abundance of traps that one can fall into, which can derail the best-laid plans and put your projects behind schedule.Cem Kaner, James Bach, and Bret Pettichord know this all too well. Between them, they have over fifty years of testing experience, and know what it takes for successful testing. In this groundbreaking new book, they have compiled 293 pieces of experience-tested advice for you to put to work in your testing projects. They reveal insights on how to do the job well, how to manage it, and how to steer clear of common misunderstandings in software testing. Each lesson is an assertion related to software testing, followed by an explanation or example that shows you the how, when, and why of the testing lesson. The ultimate resource for software testers, developers, and managers at every level of expertise, this guidebook also features: Useful practices and helpful ways of evaluating situations gleaned from over fifty years of combined testing experience from the worlds leading software testing experts Lessons for all key topic areas including test design, test automation, test management, testing strategies, and bug reporting Advice on how to match the selection of practices to the circumstances of your project Wiley Computer Publishing Timely. Practical. Reliable. Author Biography: CEM KANER, JD, PhD, is a professor of computer sciences at Florida Institute of Technology. He also consults on technical and management issues, and practices law within the software development community. He is the lead author of two books, Testing Computer Software and Bad Software (both from Wiley). JAMES BACH is founder and principal consultant of Satisfice, Inc., a software testing and quality assurance company. His experience with competitive software development in leading Silicon Valley companies, such as Apple and Borland, led him to specialize in such aspects of the craft as "good enough" quality, risk-based testing, exploratory testing, and other techniques that require skill and judgment. He has also served as Chief Scientist at Software Testing Labs. BRET PETTICHORD works as an independent consultant and edits the popular Software Testing Hotlist. A frequent speaker and writer, he is also the founder of the Austin Workshop on Test Automation.
An Efficient Algorithm for Large-Scale Nonlinear Programming Problems with Simple Bounds on the Variables
Authors: R. Pytlak
Venue: SIAM Journal on Optimization (1998)

In this paper we present a new conjugate gradient algorithm for nonlinear programming problems with simple bounds on the variables. The method is an extension of our conjugate gradient algorithm described in [R. Pytlak, IMA J. Numer. Anal., 14 (1994), pp. 443--460]. The simple constraints on the variables are treated by a projection. Under mild assumptions the method is globally convergent. The algorithm has the property whereby many constraints can leave or enter an active set of constraints at one iteration. If the strict complementarity condition is satisfied, the active set at a solution is identified in a finite number of iterations. The algorithm has been tested on problems with more than 10,000 variables.
Configuring ISA Server 2000: Building Firewalls for Windows 2000
Authors: Thomas W. Shinder, Debra Littlejohn Shinder, Martin Grasdal
Venue:  (2001)

:The complete guide to implementing ISA Server in the Enterprise Because security and network performance - the two pronged purpose of ISA Server - are so important in todays interconnected world, ISA Server plays a vital role in your overall network design. Configuring ISA Server 2000 will plan an equally vital role in helping you understand Microsoft's much-anticipated Web-caching, filtering, and connection-sharing software package, Internet Security and Acceleration Server 2000 - or more simply, ISA Server. Learn ISA Server's features Master the security, acceleration, and Internet connection sharing features of ISA Server. Understand ISA's architecture Get an overview of ISA Server's complex architecture and how the program components work at various layers of the network communications models. Select proper authentication methods Read about ISA's defferent authentication options, depending on the type of client. Administer ISA with confidence Master the unknown and undocumented components and features of ISA Understand ISA's Firewall features Now you'll understand multiplayer filtering, stateful inspection, intrusion detection, secure VPN, streaming media splitting, and more! Recognize intrusion attcks Set up ISA Firewall to detect all-ports scan, IP half scans, ping of deaths, land attacks, UDP bombs and other attacks. Use ISA as a web caching server Read about smart and scheduled caching, distributed caching, and hierarchical caching options Save Time Get complete coverage of wizards that guide you through common setup and management tasks.
A Parallel Implementation of the Nonsymmetric QR Algorithm for Distributed Memory Architectures
Authors: Greg Henry, David Watkins, Jack Dongarra
Venue: SIAM Journal on Scientific Computing (2002)

One approach to solving the nonsymmetric eigenvalue problem in parallel is to parallelize the QR algorithm. Not long ago, this was widely considered to be a hopeless task. Recent efforts have led to significant advances, although the methods proposed up to now have suffered from scalability problems. This paper discusses an approach to parallelizing the QR algorithm that greatly improves scalability. A theoretical analysis indicates that the algorithm is ultimately not scalable, but the nonscalability does not become evident until the matrix dimension is enormous. Experiments on the Intel Paragon system, the IBM SP2 supercomputer, the SGI Origin 2000, and the Intel ASCI Option Red supercomputer are reported.
MCSD Training Guide: Microsoft Visual Basic 6 Exam 70-175 with Cdrom
Authors: Howard Hawhee, Thomas Moore, Felipe Martins
Venue:  (1999)

:Each Training Guide will be organized around the exam objectives. This makes it very easy for readers to focus on areas where they need to improve. It also helps them identify what the key topics on the exam will be.
Adobe Illustrator 9.0 Classroom in a Book with CD-ROM, 1st edition
Authors: Adobe Creative Team, Adobe Systems
Venue:  (2000)

: Learn how to create professional-quality artwork for print or the Web using Illustrator 9, the world's most popular illustration application Updated edition of the worldwide bestseller Adobe Illustrator is one of the most popular vector graphics tools in the print and web industry Self-paced lessons are the ideal introduction to Illustrator's complex features Adobe Illustrator 9.0 Classroom in a Book shows users how to master Adobe Illustrator in short, focused lessons. Created by Adobe's own training experts, it covers all the new features of Illustrator 9, including added compatibility with Macromedia Flash, a new Transparency Palette, and superior vector and raster graphics. Readers start with an introduction to Illustrator's many tools, brushes, and palettes. Lessons include making selections, painting, gradient fills, drawing straight lines, using type and creating type masks, outlining paths with patterns, printing artwork, producing color separations, and preparing finished artwork for print or the Web. Each lesson builds upon the knowledge learned in previous lessons, so readers have a full tour of the software by the time they have finished the book. The cross-platform CD provides all the lessons and images needed for each chapter. Previous Edition ISBN: 1-56830-470-6 The Adobe Creative Team is made up of members of Adobe's User Education Group. They take their expertise in training users to work with Adobe products, combine it with the creative talents of the Adobe Illustrator team, and add the valuable content of the CD-ROM to make a unique learning package from Adobe Systems.
Real-Time Interactive 3D Games: Creating 3D Games in Macromedia Director 8.5 / Shockwave Studio
Authors: Allen Partridge
Venue:  (2001)

:This book provides an exciting blend of game design strategies, nuts-and-bolts programming tips, deeply detailed code samples, and richly developed games and demos. Real-Time Interactive 3D Games defines the role of narratives in games and is packed with valuable advice on a variety of topics, including tapping into the traditions of theater to make the games you develop more dramatic and tips for marketing your 3D game.The first part of the book demonstrates good character and environment design for interactive games. A substantial set of tutorials on the use of 3D Lingo to program games follows. Finally, you can follow along with Dr. Partridge and his team as they build a dramatic real-time interactive 3D game called 17 Keys. The structure mirrors the best game development practices to give you the skills to go out and develop games on your own.A detailed and practical guide to Shockwave 3D, including simulating physics for games and advanced control with modifiersBeyond just code, teaches game design procedures including developing treatments, specs and game interface design strategiesIntelligent game agents explained and demonstratedCameras, lights, models, shaders, textures, and animationSecrets to low-poly modeling for real-time gamesA fully developed real-time 3D game with explanations and commented code 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
Cyclic Colorings of 3-Polytopes with Large Maximum Face Size
Authors: Oleg V. Borodin, Douglas R. Woodall
Venue: SIAM Journal on Discrete Mathematics (2002)

A cyclic coloring of a plane graph is a vertex coloring in which, for each face f, all the vertices in the boundary of f have different colors. It is proved that if G is a 3-polytope (3-connected plane graph) with maximum face size ${\mathnormal{\Delta}^*}$, then G is cyclically $(\mathnormal{\Delta}^* + 1)$-colorable provided that $\mathnormal{\Delta}^*$ is large enough. The figure $\mathnormal{\Delta}^* + 1$ is sharp.
Using UML: Software Engineering with Objects and Rules, 1st edition
Authors: R.J. J. Pooley, Perdita Stevens
Venue:  (1999)

:Using UML is an introduction to the Unified Modeling Language for students learning about object- and component-based software design and development. It places UML in the context of the software engineering discipline as a whole, providing students with a practical understanding of good practice in software design and development. The authors present a broad view of the subject area, enabling students to see for themselves how different practices may be appropriate for different situations. The goal of the book is to encourage pragmatic and open-minded approach to real-life software engineering.
Residual and Backward Error Bounds in Minimum Residual Krylov Subspace Methods
Authors: Christopher C. Paige, Zdenvek Strakos
Venue: SIAM Journal on Scientific Computing (2001)

Minimum residual norm iterative methods for solving linear systems Ax=b can be viewed as, and are often implemented as, sequences of least squares problems involving Krylov subspaces of increasing dimensions. The minimum residual method (MINRES) [C. Paige and M. Saunders, SIAM J. Numer. Anal., 12 (1975), pp. 617--629] and generalized minimum residual method (GMRES) [Y. Saad and M. Schultz, SIAM J. Sci. Statist. Comput., 7 (1986), pp. 856--869] represent typical examples. In [C. Paige and Z. Strakos, Bounds for the least squares distance using scaled total least squares, Numer. Math., to appear] revealing upper and lower bounds on the residual norm of any linear least squares (LS) problem were derived in terms of the total least squares (TLS) correction of the corresponding scaled TLS problem. In this paper theoretical results of [C. Paige and Z. Strakos, Bounds for the least squares distance using scaled total least squares, Numer. Math., to appear] are extended to the GMRES context. The bounds that are developed are important in theory, but they also have fundamental practical implications for the finite precision behavior of the modified Gram--Schmidt implementation of GMRES, and perhaps for other minimum norm methods.
When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree
Authors: Luca Trevisan
Venue: SIAM Journal on Computing (2000)

We prove that the traveling salesman problem ({\sc Min TSP}) is {\sf Max SNP}-hard (and thus {\sf NP}-hard to approximate within some constant r>1) even if all cities lie in a Euclidean space of dimension $\log n$ ($n$ is the number of cities) and distances are computed with respect to any lp norm. The running time of recent approximation schemes for geometric {\sc Min TSP} is doubly exponential in the number of dimensions. Our result implies that this dependence is necessary unless NP has subexponential algorithms. As an intermediate step, we also prove the hardness of approximating {\sc Min TSP} in Hamming spaces. Finally, we prove a similar, but weaker, inapproximability result for the Steiner minimal tree problem ({\sc Min ST}). The reduction for {\sc Min TSP} uses error-correcting codes; the reduction for {\sc Min ST} uses the integrality property of {\sc Min-Cut} linear programming relaxations. The only previous inapproximability results for metric {\sc Min TSP} involved metrics where all distances are 1 or 2.
Fifty years of microarchitecture
Authors: Harvey Cragon, Ernest Cockrell,  Jr.
Venue: Proceedings of the 34th annual ACM/IEEE international symposium on Microarchitecture (2001)

The Micro-34 program will be placed in the context of fifty years of research inmicroarchitecture.Over this time, the major emphasis has been on improving processorperformance as measured by Clock per Instruction (CPI).We have seen a number of questions that occupied many minds for many years:Stack architectures compared to memory-to-memory and register files, and RISC vs. CISC are examples.For the last fifteen years or so, the focus of much research has been improvements in CPI by exploiting instruction level parallelism by the processor.This emphasis continues with the papers at Micro-34.