ppxscal/embedding_network huggingface dataset:
Inside Macintosh: Devices, 2nd edition
Authors: Apple Computer Inc., Apple Computer Inc Staff
Venue:  (1994)

:Inside Macintosh: Devices describes how to write software that interacts with built-in and peripheral hardware devices. With this book, you'll learn how to Write and install your own device drivers, desk accessories, and Chooser extensions Communicate with device drivers using the Device Manager Access expansion cards using the Slot Manager Control SCSI devices using SCSI Manager 4.3 or the original SCSI Manager Communicate directly with Apple Desktop Bus devices Interact with the Power Manager in battery-powered Macintosh computers Communicate with serial devices using the Serial Driver You need this book if you want to write a Macintosh device driver or desk accessory. You also need this book if you want to write an application that directly addresses the Apple Desktop Bus, NuBus cards, or the Power Manager. Because many other Macintosh managers interact with the Device Manager, this book provides useful background information for writing and debugging low-level software. To use this book you should be familiar with fundamental Macintosh Operating System concepts such as memory and process management. A good place to begin is with the book Inside Macintosh: Overview. If you are designing an application or device driver that addresses hardware, you should also consult Guide to the Macintosh Family Hardware, second edition. For information about processor-direct slot (PDS) and NuBus expansion cards, read Designing Cards and Drivers for the Macintosh Family, third edition.
On the Superlinear Convergence of an $O(n^ 3L)$ Interior-Point Algorithm for the Monotone LCP
Authors: Kevin McShane
Venue: SIAM Journal on Optimization (1996)

Karmarkar's partial updating scheme is applied to a polynomial superlinearly convergent algorithm for the monotone linear complementarity problem (LCP). This modification reduces the bound on the number of arithmetic operations required to achieve $\epsilon $-optimality by a factor of $\sqrt{n}$. The complementarity gap sequence generated by the resulting algorithm converges $q$-quadratically to zero if the LCP is nondegenerate and has a strictly complementary optimal solution. In general, the convergence rate is $q$-superlinear if the iterates are assumed to converge to a strictly complementary optimal solution.
Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming
Authors: Nicholas I. M. Gould, Dominique Orban, Annick Sartenaer, Philippe L. Toint
Venue: SIAM Journal on Optimization (2000)

The local convergence properties of a class of primal-dual interior point methods are analyzed. These methods are designed to minimize a nonlinear, nonconvex, objective function subject to linear equality constraints and general inequalities. They involve an inner iteration in which the log-barrier merit function is approximately minimized subject to satisfying the linear equality constraints, and an outer iteration that specifies both the decrease in the barrier parameter and the level of accuracy for the inner minimization. Under nondegeneracy assumptions, it is shown that, asymptotically, for each value of the barrier parameter, solving a single primal-dual linear system is enough to produce an iterate that already matches the barrier subproblem accuracy requirements. The asymptotic rate of convergence of the resulting algorithm is Q-superlinear and may be chosen arbitrarily close to quadratic. Furthermore, this rate applies componentwise. These results hold in particular for the method described in [A. R. Conn, N. I. M. Gould, D. Orban, and P. L. Toint, Math. Program. Ser. B, 87 (2000), pp. 215--249] and indicate that the details of its inner minimization are irrelevant in the asymptotics, except for its accuracy requirements.
1998 IEEE 24th Annual Conference of the IEEE Industrial Electronics Society Proceedings
Authors: Institute of Electrical and Electronics Engineers
Venue:  (1998)

:The IECON is an international conference on the industrial application of power electronics, control, robotics, signal processing, instrumentation, automation, artificial intelligence and emerging technologies. The objectives of this conference is to promote high quality research and professional interaction for the advancement of science, technology and fellowship.
About local configurations in arithmetic planes
Authors: Marie-Andrée Jacob-Da Col
Venue: Theoretical Computer Science (2002)

In Vittone and Chassery (Proc. of DGCI'97, Vol. 1347 of Lecture Notes in Computer Sciences, 1997, pp. 87-98) J.-M. Chassery and J. Vittone studied local configurations of (m,n)-cubes in naive planes in function of the parameters of these naive planes. More precisely, they enumerated the bicubes and the tricubes that appear in a naive hyperplane of parameters (a,b,c). A symmetry about the line c=a+b appears clearly in this enumeration. The aim of this paper is to prove that the configurations of (nn)-cubes in the plane of parameters (a,b,c) are in one-to-one relation with those in the plane of parameters (c-b, c-a,c). If we restrict the parameters to the planes such that a+bc, we note a second symmetry about the line c=2b; We also prove this symmetry. We generalize a theorem established by Rveilles and Grard (Grard, Proc. of DGCI'99, Vol. 1568 of Lecture Notes in Computer Sciences, 1999, pp. 65-75, Reveilles, Vision Geometry 4, Vol. 2573 of SPIE 95, San Diego, 1995) and these symmetries to the local configurations of planes of given thickness.
Rate analysis for embedded systems
Authors: Anmol Mathur, Ali Dasdan, Rajesh K. Gupta
Venue: Readings in hardware/software co-design (2001)

Embedded systems consist of interacting components that are required to deliver a specific functionality under constraints on execution rated and relative time separation of the components. In this article, we model an embedded system using concurrent processes interacting through synchronization. We assume that there are rate constraints on the execution rates of processes imposed by the designer or the environment of the system, where the execution rate of a process is the number of its executions per unit time. We address the problem of computing bounds on the execution rates of processes constituting an embedded system, and propose an interactive rate analysis framework. As part of the rate analysis framework we present an efficient algorithm for checking the consistency of the rate constraints. Bounds on the execution rate of each process are computed using an efficient algorithm based on the relationship between the execution rate of a process and the maximum mean delay cycles in the process graph. Finally, if the computed rates violate some of the rate constraints, some of the processes in the system are redesigned using information from the rate analysis step. This rate analysis framework is implemented in a tool called RATAN. We illustrate by an example how RATAN can be used in an embedded system design.
Dreamweaver Ultradev Fast and Easy Web Development, 1st edition
Authors: Aneesha Bakharia, Aneesh Bakhania
Venue:  (2000)

:Dreamweaver UltraDev combines the best features of Dreamweaver with UltraDev. UltraDev allows designers, programmers, and developers to visually create and edit data-driven Web applications on multiple server platforms. Dreamweaver UltraDev Fast & Easy Web Development introduces you to the wide variety of functions that can be achieved using a server-side scripting language. It covers the expanded functionality of UltraDevthe support for industry servers, integration with leading development tools, and its extensive database support. This book is great for Web developers, programmers, or designers who may be familiar with Dreamweaver or UltraDev, but are looking for a quick learning tool to get up and running with Dreamweaver UltraDev. The visual, step-by-step format is great for users with little or no experience using this products predecessors.
Learning from Data: Concepts, Theory, and Methods, 1st edition
Authors: Vladimir S. Cherkassky, Filip Mulier
Venue:  (1998)

:This is an interdisciplinary book on neural networks, statistics and fuzzy systems. A unique feature is the establishment of a general framework for adaptive data modeling within which various methods from statistics, neural networks and fuzzy logic are presented. Chapter summaries, examples and case studies are also included.[Includes companion Web site with ... Software for use with the book.
Algorithms in C++: Fundamentals, Data Structures, Sorting, Searching, 3rd edition
Authors: Robert Sedgewick, Christopher J. Van Wyk
Venue:  (1998)

:Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers! This particular book, Parts 1n4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Although the substance of the book applies to programming in any language, the implementations by Van Wyk and Sedgewick also exploit the natural match between C++ classes and ADT implementations. Highlights Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures Greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes than in previous editions Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations New implementations of binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and much more Increased quantitative information about the algorithms, giving you a basis for comparing them Over 1000 new exercises to help you learn the properties of algorithms Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporatesnew programming styles with classic and new algorithms, you will find a wealth of useful information in this book.
A Numerical Scheme for Impact Problems I: The One-Dimensional Case
Authors: Laetitia Paoli, Michelle Schatzman
Venue: SIAM Journal on Numerical Analysis (2002)

We consider a mechanical system with impact and one degree of freedom. The system is not necessarily Lagrangian. The representative point is subject to the constraint $u(t) \in \Er^+$ for all t. We assume that, at impact, the velocity is reversed and multiplied by a given coefficient of restitution $e\in[0,1]$. We define a numerical scheme which enables us to approximate the solutions of the Cauchy problem: this is an ad hoc scheme which does not require a systematic search for the times of impact. We prove the convergence of this numerical scheme to a solution. Many of the features of this proof will be reused in the nonconvex, multidimensional case, written in generalized coordinates, given in the companion paper [L. Paoli and M. Schatzman, SIAM J. Numer. Anal., 40 (2002), pp. 734--768]. We present some numerical results obtained with the scheme for a spring-dashpot system and we compare them to the results obtained by impact detection and penalization.
MINITAB Guide to Statistics
Authors: Ruth Meyer, David Krueger
Venue:  (1997)

: The manual provides readers with a complete introduction to Minitab and the tools they need to run statistical procedures, from descriptive statistics to time series analysis, using Minitab. Interpretation of numerical and graphical output is included. Menu and session commands are described and illustrated. Step-by-step instructions indicate how to manipulate and analyze data. Real-life examples, exercises, and data sets from business, education, sciences, sports, etc. Interpretation of numerical and graphical output. For readers interested in business statistics using the Minitab statistical software package.
Installing SuSE Linux
Authors: John Scroggins, Fabor Fedor
Venue:  (2000)

:Install SuSE Linux covers only the topics necessary to get the OS up and running. By utilizing the information in this text, you will be able to prevent surprises during the installation of SuSE. This product is for experienced Linux enthusiasts or experienced Unix users who would like to purchase the distribution and the documentation required to configure the OS. Topics covered include new features of SuSE 6.2, YaST, choosing packages, installing KDE or GNOME, Internet configuration, system configuration, and X Windows.
Multimedia: A Critical Introduction
Authors: Jeanette Steemers
Venue:  (2000)

:The rapid growth of multimedia technologies such as the Internet, e-mail and digital television holds the promise of a new "information age" that caters to individual tastes and creates new wealth. But are new media technologies really designed to achieve these utopian aims? Addressing such issues, Multimedia: A Critical Introduction provides a historical, cultural and political context to the development of multimedia as both a technology and a concept. Individual chapters discuss the origins of multimedia in the unlikely interaction between the military and 1960s counter-culture; the wide-ranging effects of the deregulation of media industries by the "new right" governments in the 1980s; issues of privacy and censorship; and the use of digital technology to create special effects in films.Contributors: Peter Dean, Luke Hockley, Jeanette Steemers.
Strategic Information Warfare Rising
Authors: Roger C. Molander, Peter Wilson, Richard F. Mesic
Venue:  (1998)

:This report summarizes research performed by RAND for the Office of the Assistant Secretary of Defense (Command, Control, Communications and Intelligence) in response to a request from the Office of the Deputy Secretary of Defense. The objective of this effort was to derive a framework for policy and strategy decisionmaking on problems raised by the emerging potential of Strategic Information Warfare. This study was undertaken in recognition that future U.S. national security strategy is likely to be profoundly affected by the ongoing rapid evolution of cyberspace the Global Information Infrastructure (GII) and, thus by the growing dependence of the U.S. military and other national institutions and infrastructures on potentially vul-nerable elements of the U.S. national information infrastructure. This report should be of special interest to those who are exploring the effect of the information revolution on strategic warfare, and to those who are concerned with ensuring the security of information-dependent infrastructures. It should also be of interest to those segments of the U.S. and the international security community that are concerned with the post- Cold War evolution of military and national security strategy, especially strategy changes driven wholly or in part by the evolution of, and possible revolutions in, information technology. The research reported here was accomplished within the Acquisition and Technology Policy Center of RAND's National Defense Research Institute, a federally funded research and development center sponsored by the Office of the Secretary of Defense, the Joint Chiefs of Staff, Unified Commands, and the defense agencies. It builds on an earlier andongoing body of research within the center on the national security implications of the information revolution.
Control Systems Applications, 1st edition
Authors: William S. Levine
Venue:  (1999)

:Control technology permeates every aspect of our lives. We rely onthem to perform a wide variety of tasks without giving much thought to the origins of the technology or how it became such an important part of our lives Control System Applications covers the uses of control systems, both in the common and in the uncommon areas of our lives. From the everyday to the unusual, it's all here. From process control to human-in-the-loop control, this book provides illustrations and examples of how these systems are applied. Each chapter contains an introduction to the application, a section defining terms and references, and a section on further readings that help you understand and use the techniques in your work environment Highly readable and comprehensive, Control System Applications explores the uses of control systems. It illustrates the diversity of control systems and provides examples of how the theory can be applied to specific practical problems. It contains information about aspec ts of control that are not fully captured by the theory, such as techniques for protecting against controller failure and the role of cost and complexity in specifying controller designs
A technique of treating negative weights in WENO schemes
Authors: Jing Shi, Changqing Hu, Chi-Wang Shu
Venue: Journal of Computational Physics (2002)

High-order accurate weighted essentially nonoscillatory (WENO) schemes have recently been developed for finite difference and finite volume methods both in structured and in unstructured meshes. A key idea in WENO scheme is a linear combination of lower order fluxes or reconstructions to obtain a higher order approximation. The combination coefficients, also called linear weights, are determined by local geometry of the mesh and order of accuracy and may become negative, such as in the central WENO schemes using staggered meshes, high-order finite volume WENO schemes in two space dimensions, and finite difference WENO approximations for second derivatives. WENO procedures cannot be applied directly to obtain a stable scheme if negative linear weights are present. The previous strategy for handling this difficulty is either by regrouping of stencils or by reducing the order of accuracy to get rid of the negative linear weights. In this paper we present a simple and effective technique for handling negative linear weights without a need to get rid of them. Test cases are shown to illustrate the stability and accuracy of this approach.
ADO RDS Programming with ASP
Authors: Matt Brown, John Papa, Eric Wilson, Peter Debetta, Charles Crawford Caison,  Jr.
Venue:  (1999)

:ActiveX Data Objects (ADO) 2.0 is the latest data manipulation toolset that can be used to develop enterprise business solutions. ADO 2.0 is an integral component in enterprise business solutions, including internet/intranet applications, as it combines high-speed access to data and a flexible data structure with its simple interface. Remote Data Services (RDS) is a high-performance client-side data caching technology that transports data in intranet/internet solutions. RDSs real power is derived from its foundation: ADO. Using RDS and ADO in ASP yields powerful Web-based solutions that can be built upon a multitude of data resources.
Planning for PKI: Best Practices Guide for Deploying Public Key Infrastructure, 1st edition
Authors: Russ Housley, Tim Polk
Venue:  (2001)

:An in-depth technical guide to the security technology driving Internet e-commerce. "Planning for PKI" examines this cornerstone Internet security technology. Written by the architects of the Internet Public Key Infrastructure (PKI), this book provides authoritative technical guidance for network engineers, architects, and managers who need to implement the right PKI architecture for their organization. Readers will learn that building a successful PKI is an on going process, not a one-time event. The authors discuss results and lessons learned from three early PKI deployments, helping readers avoid the pitfalls and emulate the successes of early PKI adopters. Using plain and direct language, the authors share their extensive knowledge of PKI standards development in the Internet Engineering Task Force (IETF) and elsewhere. Subtle points about the Internet PKI standards are liberally sprinkled throughout the book. These nuggets provide insight into the intent of some of the esoteric topics in the standards, enabling greater interoperability. "Planning for PKI" gathers the PKI state-of-the-art into one volume, covering everything from PKI history to emerging PKI-related technologies.
Microsoft Excel 2000: Illustrated Basic Edition, 1st edition
Authors: Elizabeth E. Reding, Tara Lynn O'Keefe
Venue:  (2000)

:Through instructor-led or self-paced step-by-step instruction, individuals learn how to work with charts, formulas, and functions.
CCDP Cisco Internetwork Design Study Guide
Authors: Robert Padjen, Todd Lammle
Venue:  (2000)

:Padjen, an expert in networking, offers a guide to instruct exam candidates on a variety of Cisco design topics, including complex routed LAN, routed WAN, and switched LAN networks. CD contains advanced testing engine, electronic flash cards for both PC and Palm Pilots, and evaluation copy of leading design software from Visio.
Algorithms for fault-tolerant routing in circuit switched networks
Authors: Amitabha Bagchi, Amitabh Chaudhary, Christian Scheideler, Petr Kolman
Venue: Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures (2002)

In this paper we consider the k edge-disjoint paths problem (k-EDP), a generalization of the well-known edge-disjoint paths problem. Given a graph G=(V,E) and a set of terminal pairs (or requests) T, the problem is to find a maximum subset of the pairs in T for which it is possible to select paths such that each pair is connected by k edge-disjoint paths and the paths for different pairs are mutually disjoint. To the best of our knowledge, no nontrivial result is known for this problem for k>1. To measure the performance of our algorithms we will use the recently introduced flow number F of a graph. This parameter is known to satisfy F=O(\Delta \alpha^-1 \log n), where \Delta is the maximum degree and \alpha is the edge expansion of G. We show that a simple, greedy online algorithm achieves a competitive ratio of O(k^3 \cdot F) which naturally extends the best known bound of O(F) for k=1 to higher $k$. To get this bound, we introduce a new method of converting a system of k disjoint paths into a system of k length-bounded disjoint paths. Also, an almost matching deterministic online lower bound \Omega(k \cdot F) is given.In addition, we study the k disjoint flows problem (k-DFP), which is a generalization of the well-known unsplittable flow problem (UFP). The k-DFP is similar to the k-EDP with the difference that we now consider a graph with edge capacities and the requests can have arbitrary demands d_i. The aim is to find a subset of requests of maximum total demand for which it is possible to select flow paths such that all the capacity constraints are maintained and each selected request with demand d_i is connected by k disjoint paths, each of flow value d_i/k.The k-EDP and k-DFP problems have important applications in fault-tolerant (virtual) circuit switching which plays a key role in optical networks.
On-line Randomized Call Control Revisited
Authors: Stefano Leonardi, Alberto Marchetti-Spaccamela, Alessio Presciutti, Adi Rosén
Venue: SIAM Journal on Computing (2002)

We consider the problem of on-line call admission and routing on trees and meshes. Previous work gave randomized on-line algorithms for these problems and proved that they have optimal (up to constant factors) competitive ratios. However, these algorithms can obtain very low profit with high probability. We investigate the question of devising for these problems on-line competitive algorithms that also guarantee a "good" solution with "good" probability.We give a new family of randomized algorithms with asymptotically optimal competitive ratios and "good" probability to get a profit close to the expectation. We complement these results by providing bounds on the probability of any optimally competitive randomized on-line algorithm for the problems we consider to get a profit close to the expectation. To the best of our knowledge, this is the first study of the relationship between the tail distribution and the competitive ratio of randomized on-line benefit algorithms.