ppxscal/embedding_network huggingface dataset:
Interactive Computing Series: Microsoft PowerPoint 97, 1st edition
Authors: Kenneth C. Laudon, Evan Kantor, Michael Banino
Venue:  (1998)

:This brief,highly graphical,colorfully illustrated text offers a beginning skill level in less than 200 pages. Unique pedagogical design has students see,do,practice,and test every software skill motivated by concept explanation. A maximum of 70 skills are covered,each in a 2 - 3 page spread which graphically demonstrates and reinforces the concept. Introductory skills are covered in easily absorbed 2 - 3 page spreads which graphically demonstrate and reinforce each concept. A business case scenario,running throughout the text,integrates all the concepts and applications. Student Data Files are packaged in the Instructor's Manual (on a CD) and can be copied onto a disk for students,and/or copied to computers in the lab,or placed on the the lab's network. A separate,stand-alone,student CD-ROM is available and can be used in place of the text or to support the text. The CD-ROM includes all the features of the text plus a fully interactive self-test at the end of each chapter. Students practice and test their skills by completing a series of tasks. Scored output can be reviewed by the student,printed,or recorded to a disk or a Local Area Network for the instructor. In addition,the CD will be supported by a powerful,comprehensive task-based testing system. A Windows-based computerized test bank supports the text and offers on-screen testing and results-reporting capabilities.
Introduction to Intelligent Simulation: The Rao Language
Authors: A. Artiba, V. V. Emelyanov, S. I. Iassinovski
Venue:  (1998)

:Introduction to Intelligent Simulation: The RAO Language focuses on an unique approach in modeling and simulation of complex systems. In the volume features are considered of complex systems and processes, their mathematical description, and modeling. Theoretical foundations of RAO (Resource-Action-Operation) language as well as its syntax and utilisation are given. Examples of simulation models of different complexity levels, related to different fields, are presented as well.
Theory of Globally Convergent Probability-One Homotopies for Nonlinear Programming
Authors: Layne T. Watson
Venue: SIAM Journal on Optimization (2000)

For many years globally convergent probability-one homotopy methods have been remarkably successful on difficult realistic engineering optimization problems, most of which were attacked by homotopy methods because other optimization algorithms failed or were ineffective. Convergence theory has been derived for a few particular problems, and considerable fixed point theory exists, but generally convergence theory for the homotopy maps used in practice for nonlinear constrained optimization has been lacking. This paper derives some probability-one homotopy convergence theorems for unconstrained and inequality constrained optimization, for linear and nonlinear inequality constraints, and with and without convexity. Some insight is provided into why the homotopies used in engineering practice are so successful, and why this success is more than dumb luck. By presenting the theory as variations on a prototype probability-one homotopy convergence theorem, the essence of such convergence theory is elucidated.
OrCAD PSpice and Circuit ANALYSIS
Authors: John Keown
Venue:  (2000)

: Presents content in such a way that anyone who is studying or has studied the various electrical topics will be able immediately to put OrCad's PSpice to practical use. Gives full explanations of the example problems  not just the abbreviated "how-to" coverage found in most other texts. Provides more insight than other texts into the creation and use of circuit models for OrCad's PSpice.
Spectral Structures of Irreducible Totally Nonnegative Matrices
Authors: Shaun M. Fallat, Michael I. Gekhtman, Charles R. Johnson
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

An n-by-n matrix is called totally nonnegative if every minor of A is nonnegative. The problem of interest is to characterize all possible Jordan canonical forms (Jordan structures) of irreducible totally nonnegative matrices. We show that the positive eigenvalues of such matrices have algebraic multiplicity one, and also demonstrate key relationships between the number and sizes of the Jordan blocks corresponding to zero. These notions yield a complete description of all Jordan forms through n=7, as well as numerous general results. We also define a notion of "principal rank" and employ this idea throughout.
Creating assemblies:: aboard the Ghost Ship
Authors: Jon Hindmarsh, Christian Heath, Dirk vom Lehn, Jason Cleverly
Venue: Proceedings of the 2002 ACM conference on Computer supported cooperative work (2002)

This paper examines the use of an interactive artwork that was designed by members of the research team and exhibited at the Sculpture, Objects and Functional Art (SOFA) Exposition in Chicago, USA. The paper uses audio-visual recordings of interaction with and around the work to consider how people encounter and make sense of an assembly of traditional objects and video technologies. The analysis of action and interaction is used to develop a series of 'design sensitivities' to inform the development of technological assemblies to engender informal interaction and sociability in museums and galleries.
Advanced Concepts in Operating Systems
Authors: Mukesh Singhal, Niranjan G. Shivaratri
Venue:  (1994)

:Operating systems have evolved substantially over the past two decades,and there is a need for a book which can explain major developments and changes in this dynamic field. This is such a book. Comprehensive,and useful as a text and reference,Advanced Concepts in Operating Systems lays down all the concepts and mechanisms involved in the design of advanced operating systems. The discussion is reinforced by many examples and cases
Some comments on numerical reliability
Authors: Jules de G. Gribble
Venue: ACM SIGAPL APL Quote Quad (1982)

From a numerical point of view, certain commonly accepted algorithms may be unreliable. The Least-Squares Problem will be used to illustrate some of the differences between mathematics and numerics, or computational mathematics.
Digital Rush: Nine Internet Start-Ups in the Race for Dot-COM Riches
Authors: Jonathan Reed Aspatore, Alicia Abell
Venue:  (2000)

:Digital Rush uncovers the experiences and ideas behind some of the most fascinating and fast-growing Internet businesses of our time. Unlike other Web profile books, it digs deep by concentrating on a select group of cyber-entrepreneurs. And they're hardly the usual dot-com suspects. Readers go behind the scenes with innovators such as: Startups.com, VarsityBooks.com, Enews.com, BuyandHold.com, eTradersEdge.com, and others." "The people who created, financed, and sweated blood over these companies talk about their dumbest mistakes, their smartest moves, how to cut through the online clutter, and what they'd do differently if they were starting today. Along the way, this candid and business-savvy book delivers invaluable insights on how to: start an Internet company; take it to greater levels; add an e-component to a brick-and-mortar business; secure capital at every stage; find talent; attend to customer service; generate new ideas; forecast future Internet trends, and more.
Understanding B2B
Authors: Matthew Friedman, Marlene Blanshay
Venue:  (2001)

:To understand B2B electronic commerce in its proper perspective, managers and executives need the kind of birds-eye view that business experts Matthew Friedman and Marlene Blanshay provide in Understanding B2B. Friedman and Blanshay answer key questions without overwhelming readers with technical information, and share an inside look at electronic B2B from some of the worlds top analystsfrom solution providers to academic strategists.
Practical Visual C++ 6
Authors: Jonathan Bates, Timothy J. Tompkins
Venue:  (1999)

:Practical Visual C++ takes a straight forward, no-nonsense approach to teaching C++. You start by learning the basics of Developer Studio with the use of the Wizards, editors, and debuggers. Then move on to the core language, including program flow, data types, functions, classes, object-oriented programming, and more. You then progress into the Microsoft Foundation Classes (MFC), the libraries of pre-build classes that Microsoft provides to make Visual C++ programming much easier. By understanding how to use the classes within MFC, you will be able to create nearly any type of program. Specific coverage includes working with dialogs, objects, controls, document-views, file manipulation, and printing.
Teach Yourself FrontPage 2000 Visually
Authors: Ruth Maran
Venue:  (2000)

:Perfect for the beginning or intermediate user, Teach Yourself FrontPage 2000 VISUALLY is a full-color tutorial with concise, jargon-free instructions and over 500 screenshots. With more than 300 full-color pages, the book covers the basics and beyond and uses a step-by-step approach to show you how to create and format FrontPage documents; add graphics, sound and video; and troubleshoot problems effectively.
Handling long targets and errors in sequencing by hybridization
Authors: Eran Halperin, Shay Halperin, Tzvika Hartman, Ron Shamir
Venue: Proceedings of the sixth annual international conference on Computational biology (2002)

Sequencing by hybridization (SBH) is a DNA sequencing technique, in which the sequence is reconstructed using its k-mer content. This content, which is called the spectrum of the sequence, is obtained by hybridization to a universal DNA array. Standard universal arrays contain all k-mers for some fixed k, typically 8 to 10. Currently, in spite of its promise and elegance, SBH is not competitive with standard gel-based sequencing methods. This is due to two main reasons: lack of tools to handle realistic levels of hybridization errors, and an inherent limitation on the length of uniquely reconstructible sequence by standard universal arrays.In this paper we deal with both problems. We introduce a simple polynomial reconstruction algorithm which can be applied to spectra from standard arrays and has provable performance in the presence of both false negative and false positive errors. We also propose a novel design of chips containing universal bases, that differs from the one proposed by Preparata et al. We give a simple algorithm that uses spectra from such chips to reconstruct with high probability random sequences of length lower only by a squared log factor compared to the information theoretic bound. Our algorithm is very robust to errors, and has a provable performance even if there are both false negative and false positive errors. Simulations indicate that its sensitivity to errors is also very small in practice.
Semiconductor Device Physics and Simulation, 1st edition
Authors: J. S. Yuan, Juin J. Liou
Venue:  (1998)

:With the emergence of ultra-large-scaled-integrated technology--allowing millions of transistors to fit on a single microchip--came the near obsolescence of traditional analytical models that failed to account for the complexities of the new technology. This original text presents comprehensive coverage of many modern semiconductor devices, with implications for their future design and analysis. 244 illus.
Monotonicity of Fixed Point and Normal Mappings Associated with Variational Inequality and Its Application
Authors: Yun-Bin Zhao, Duan Li
Venue: SIAM Journal on Optimization (2000)

We prove sufficient conditions for the monotonicity and the strong monotonicity of fixed point and normal maps associated with variational inequality problems over a general closed convex set. Sufficient conditions for the strong monotonicity of their perturbed versions are also shown. These results include some well known in the literature as particular instances. Inspired by these results, we propose a modified Solodov and Svaiter iterative algorithm for the variational inequality problem whose fixed point map or normal map is monotone.
The Internet Dictionary: The Essential Guide to Netspeak
Authors: Christian Crumlish
Venue:  (1995)

:Welcome to the world of shareware, flame wars, links, crackers, and 'bots - a world where you'll need a dictionary just to sort out the FAQs! The Internet Dictionary is an indispensable guide to the slang, jargon, acronyms, and technical terms you'll encounter as an Internet user. This concise, plain-English resource is both a vital learn-as-you-go reference and a fascinating place to browse. Demystify networking terminology; decode acronyms for services, organizations, standards, programs, and files; learn hacker jargon and converse with other Internet insiders; and identify and beware of trolling, mailbombs, and other cyberspace tricks and traps. You'll find over 2400 easy-to-use, cross-referenced entries, with simple definitions, helpful examples, and plenty of illustrations. From "acceptable use" to "Zterm," from "archie" to the "World Wide Web," The Internet Dictionary covers all you need to feel comfortable speaking like a cybernaut.
The network query language NOAH
Authors: G. Schlageter, M. Rieskamp, U. Prädel, R. Unland
Venue: Proceedings of the 1982 ACM SIGMOD international conference on Management of data (1982)

A non-procedural query language for network databases is described. The language is very powerful as compared to other implemented languages. It allows to formulate complex queries which, among other things, include conditions for CODASYL-sets and conditions for n:m-relationships. Cyclic database structures can be processed to some extent.Note: This report is not written for the "naive" user of NOAH, and is not meant to replace a NOAH manual. Instead, this report describes the foundations, the underlying concepts, and the structure of the language in more theoretically oriented, technical terms.This research was performed at the university of Hagen, West Germany, and was partially supported by Triumph Adler AG, N&uuml;rnberg, West Germany.
Building Web Applications with Ado.Net and Xml Web Services (Gearhead Press--in the Trenches), 1st edition
Authors: Richard Hundhausen, Steven Borg
Venue:  (2002)

:ADO.NET is the new set of data access services for the .NET framework. Reprogramming existing ADO code into ADO.NET so that applications can work on the .NET platform is very time consuming. Web services allow different applications to talk to one another and exchange information and data, making the job of programmers and developers much less arduous.
Logical and physical design: a flow perspective
Authors: Olivier Coudert
Venue: Logic Synthesis and Verification (2001)

A physical design flow consists of producing a production-worthy layout from a gate-level netlist subject to a set of constraints. This chapter focuses on the problems imposed by shrinking process technologies, and their solutions in the context of design flows with an emphasis on the complex interactions between logic optimization, placement, and routing. The chapter exposes the problems of timing and design closure, signal integrity, design variable dependencies, clock and power/ground routing, and design signoff. It also surveys logical and physical design flows, and describes a refinement-based flow.
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
Authors: Daniele Micciancio
Venue: SIAM Journal on Computing (2001)

We show that approximating the shortest vector problem (in any $\ell_p$ norm) to within any constant factor less than $\sqrt[p]2$ is hard for NP under reverse unfaithful random reductions with inverse polynomial error probability. In particular, approximating the shortest vector problem is not in RP (random polynomial time), unless NP equals RP. We also prove a proper NP-hardness result (i.e., hardness under deterministic many-one reductions) under a reasonable number theoretic conjecture on the distribution of square-free smooth numbers. As part of our proof, we give an alternative construction of Ajtai's constructive variant of Sauer's lemma that greatly simplifies Ajtai's original proof.
One- and Multidimensional Signal Processing: Algorithms and Applications in Image Processing, 1st edition
Authors: Hartmut Schroder, Holger Blume
Venue:  (2001)

:Multi-dimensional signal processing plays a key role in modern image processing systems. It is important for image and video communications as well as automation techniques.
The Logical Approach to Temporal Reasoning
Authors: Juan Carlos Augusto
Venue: Artificial Intelligence Review (2001)

Temporal reasoning started to be considered as a subject of study in artificial intelligence in the late 1970's. Since then several ways to represent and use temporal knowledge have been suggested. As a result of that, there are several formalisms capable of coping with temporal notions in some way or other. They range from isolated proposals to complex systems where the temporal aspect is used together with other important features for the task of modelling an intelligent agent. The purposes of this article are to summarize logic-based temporal reasoning research and give a glance on the different research tracks envisaging future lines of research. It is intended to be useful to those who need to be involved in systems having these characteristics and also an occasion to present newcomers some problems in the area that still waits for a solution.
Windows XP/2000 Answer Book: A Completer Resource from the Desktop to the Enterprise
Authors: John Savill
Venue:  (2002)

:An invaluable resource for Windows system administrators, small business managers, and home users, The Windows XP/2000 Answer Book answers more than eight hundred of the most frequently asked questions about the newest and most powerful versions of the Windows operating system. It provides solutions to real-world Windows system administration problems and shows users of all levels how to take full advantage of their Windows systems.The Windows XP/2000 Answer Book is based in part on the author’s highly acclaimed Windows NT/2000 FAQ Web site, but is broader in scope and contains more in-depth information and concrete examples. Organized for easy access, the questions range from basic queries about installation and core functions to the operating system’s most sophisticated capabilities, such as customization, domain concepts, Active Directory, Internet support, and security. Each stand-alone entry begins with an overview of the technology and includes clear explanations, step-by-step instructions, and examples of effective use.You will find answers to such questions as:What hardware is needed to run Windows 2000?What is the difference between Windows XP Professional Edition and XP Home Edition?What Windows backup options are available?How can I manage services remotely?What are the differences between NT 4.0 and 2000 domains?Which naming conventions does Active Directory use for objects?How do I configure a domain on a DNS Server?How do I create a DHCP Relay Agent?How do I perform Scandisk in Windows XP and Windows 2000?How can I stop aWindows 2000 upgrade from overwriting special security settings?How do I speed up server response?How do I create a queue to a network printer?What is the Windows Media XP bonus pack?How can I create a RAS connection script?Whether you are searching for the answer to a specific question, or just browsing to gain insight and practical techniques, the wealth of information in The Windows XP/2000 Answer Book will enable you to install your system properly, configure it to serve your organization’s needs, and keep it running smoothly.
On RAM Priority Queues
Authors: Mikkel Thorup
Venue: SIAM Journal on Computing (2000)

Priority queues are some of the most fundamental data structures. For example, they are used directly for task scheduling in operating systems. Moreover, they are essential to greedy algorithms. We study the complexity of integer priority queue operations on a RAM with arbitrary word size, modeling the possibilities in standard imperative programming languages such as C. We present exponential improvements over previous bounds, and we show tight relations to sorting.Our first result is a RAM priority queue supporting find-min in constant time and insert and delete-min in time O(log log n), where n is the current number of keys in the queue. This is an exponential improvement over the $O(\sqrt{\log n})$ bound of Fredman and Willard [ Proceedings of the 22nd ACM Symposium on the Theory of Computing, Baltimore, MD, pp. 1--7]. Plugging this priority queue into Dijkstra's algorithm gives an O(mlog log m) algorithm for the single source shortest path problem on a graph with m edges, as compared with the previous $O(m\sqrt{\log m})$ bound based on Fredman and Willard's priority queue. The above bounds assume $O(n 2^{{\varepsilon} w})$ space, where w is the word length and ${\varepsilon}>0$. They can, however, be achieved in linear space using randomized hashing.Our second result is a general equivalence between sorting and priority queues. A priority queue is monotone if the minimum is nondecreasing over time, as in many greedy algorithms. We show that on a RAM, the amortized operation cost of a monotone priority queue is equivalent to the per-key cost of sorting. For example, the equivalence implies that the single source shortest paths problem on a graph with m edges is no harder than that of sorting m keys. With the current RAM sorting, this gives an O(m log log m) time bound, as above, but the relation holds regardless of the future developments in RAM sorting.From the equivalence result, for any fixed ${\varepsilon}>0$, we derive a randomized monotone $O(\sqrt{\log n}^{1+{\varepsilon}})$ priority queue with expected constant time decrease-key. Plugging this into Dijkstra's algorithm gives an $O(n\sqrt{\log n}^{1+{\varepsilon}}+m)$ algorithm for the single source shortest path problem on a graph with n nodes and m edges, complementing the above O(mlog log m) algorithm if $m\gg n$. This improves the O(nlog n/log log n + m) bound by Fredman and Willard [Proceedings of the 31st IEEE Symposium on the Foundations of Computer Science, St. Louis, MO, 1990, pp. 719--725], based on their O(log n/log log n) priority queue with constant decrease-key.
A Variable Time Step Method for an Age-Dependent Population Model with Nonlinear Diffusion
Authors: Bruce P. Ayati
Venue: SIAM Journal on Numerical Analysis (2000)

We propose a method for solving a model of age-dependent population diffusion with random dispersal. This method, unlike previous methods, allows for variable time steps and independent age and time discretizations. We use a moving age discretization that transforms the problem to a coupled system of parabolic equations. The system is then solved by backward differences in time and a Galerkin approximation in space; the equations that need to be solved at each step treat each age group separately. A priori L2 error estimates are obtained by an energy analysis. These estimates are superconvergent in the age variable. We present a postprocessing technique which capitalizes on the superconvergence.
Programming Business Applications with Microsoft Visual Basic 6.0, 3rd edition
Authors: William E. Burrows, Joseph D. Langford
Venue:  (2000)

:Programming Business Applications with Visual Basic 6. 0 is designed to provide your students with a visual presentation of modern programming techniques. Beginning with the fundamental concepts and gradually moving toward complex features,this text allows students to learn about realistic end-user applications they will encounter in the real world.