ppxscal/embedding_network huggingface dataset:
Graphics Programming in C++: Writing Graphics Applications for Windows 98, 1st edition
Authors: Mark Walmsley
Venue:  (1998)

:The Windows 98 operating system makes life easy for the user but the creation of a Windows 98 graphics application can be a bewildering experience for the novice programmer. Mark Walmsley provides a quick and clear introduction to graphics programming under Windows 98 without overloading the reader with too much detail. The application of object oriented techniques to graphics programming is a principal theme throughout and lots of coding examples in C++ are provided. 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
Controlling creatures with Linux
Authors: Steve Rosenbluth, Michael Babcock, David Barrington Holt
Venue: Linux Journal (2002)

Is that movie character animatronic orcomputer-generated? Find out how the same Linux-based system can let oneperson control either one.
A finger on the pulse: temporal rhythms and information seeking in medical work
Authors: Madhu Reddy, Paul Dourish
Venue: Proceedings of the 2002 ACM conference on Computer supported cooperative work (2002)

Most cooperative work takes place in information-rich environments. However, studies of "information work" tend to focus on the decontextualized access and retrieval problems faced by individual information seekers. Our work is directed towards understanding how information management is seamlessly integrated into the course of everyday activities. Drawing on an ethnographic study of medical work, we explore the relationship between information and temporal coordination and discuss the role of temporal patterns or "rhythms" in providing individuals with the means to coordinate information and work.
A numerical method to simulate radio-frequency plasma discharges
Authors: E. P. Hammond, K. Mahesh, P. Moin
Venue: Journal of Computational Physics (2002)

A fully conservative and efficient numerical algorithm is developed for fluid simulations of radio-frequency plasma discharges. Results are presented in one and multiple dimensions for a helium discharge. The algorithm produces accurate results even on fairly coarse grids without the use of numerical dissipation. The proposed electron flux discretization is more accurate and efficient than two of the most commonly used discretizations: low-order upwinding (M. S. Barnes, T. J. Colter, and M. E. Elta, 1987, J. Appl. Phys. 61, 81) and Scharfetter-Gummel (D. L. Scharfetter and H. K. Gummel, 1969, IEEE Trans. Electron Devices ED-16, 64).
Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems
Authors: Defeng Sun, Jiye Han
Venue: SIAM Journal on Optimization (1997)

The paper presents concrete realizations of quasi-Newton methods for solving several standard problems including complementarity problems, special variational inequality problems, and the Karush--Kuhn--Tucker (KKT) system of nonlinear programming. A new approximation idea is introduced in this paper. The Q-superlinear convergence of the Newton method and the quasi-Newton method are established under suitable assumptions, in which the existence of F'(x*) is not assumed. The new algorithms only need to solve a linear equation in each step. For complementarity problems, the QR factorization on the quasi-Newton method is discussed.
MCSE: Windows 2000 Professional Exam Notes
Authors: James Chellis, Lisa Donald
Venue:  (2000)

:MCSE: Windows 2000 Professional Exam Notes provides the fastest and most effective way to make sure you're ready to pass the Windows 2000 Professional exam. The unique, innovative Exam Notes approach helps you gain and retain the knowledge you need, objective by objective: Critical Information sections provide detailed analyses of the key issues for each exam objective Necessary Procedures sections cover the nuts and bolts of each topic with concise step-by-step instructions Exam Essentials sections highlight crucial subject areas you'll need to know for the exam Key Terms and Concepts sections define the words and concepts vital to passing the exam Sample Questions sections preview the types of questions found in the exam and give answers and explanations MCSE Certification SeriesThe Coverage You Need to Pass Exam 70-210, Installing, Configuring, and Administering Windows 2000 Professional: Installation Administration of resources Hardware devices and drivers System performance and reliability Desktop configuration Network protocols and services Security
Introduction to Data Structures and Algorithm Analysis with C++, 1st edition
Authors: George J. Pothering, Thomas L. Naps
Venue:  (1995)

:This text provides an emphasis on abstract data types, algorithmic analysis, efficiency considerations and the implementation of data structures using object-oriented programming in C++. It does not assume student familiarity with C++ or object-oriented programming concepts. Usable for CS 2 and CS 7 courses.
Special Issue on Iterative Methods for Solving Systems of Algebraic Equations
Authors: Howard Elman
Venue: SIAM Journal on Scientific Computing (1999)

This is the fourth in a series of special issues of SIAM Journal on Scientific Computing devoted to iterative methods for solving systems of algebraic equations. The results in these papers were originally presented at the Fifth Copper Mountain meeting on iterative methods, held in April 1998. There were 210 attendees at the conference and 135 presentations were made. This year's collection contains a very broad collection of topics. These include domain decomposition methods; a variety of preconditioning algorithms including approaches based on Fourier techniques, sparse approximate inverses of matrices, and multilevel methods; several innovative multigrid algorithms, including algebraic techniques and methods for nonlinear systems; special algorithms for nonlinear path following, accurate multipole computations in particle simulation, and deflation in the conjugate gradient method; application of techniques based on first order least squares in several applied settings (models of elasticity, scattering and subsurface flow); and spectral and convergence analysis of solution algorithms in electromagnetics. This is a reflection of the vibrancy of the field and the continued need for fast algorithms that match the accuracy requirements of practical models and are well suited to modern computer architectures. The papers in this volume were edited by an editorial board consisting of the following members of the Copper Mountain program committee: Iain Duff Roland Freund Anne Greenbaum Steve McCormick Seymour Parter Gerhard Starke Hank van der Vorst Homer Walker Olof Widlund I wish to thank them for their efforts in subjecting all submissions to a rigorous refereeing process. I also want to thank Tom Manteuffel and Steve McCormick, the organizers of the Copper Mountain conferences, for their work in making these meetings successful; with the multigrid meetings taking place on alternate years, there have now been fourteen such meetings held in Colorado. Special thanks are due to Fred Howes of the Department of Energy, Michael Steuerwalt of the National Science Foundation, Steve Ashby of Lawrence Livermore National Laboratory, and Kirk Jordan of IBM for generous support of the meeting. Finally, our deepest gratitude goes to Fred Howes, who was a consistent and strong supporter of these meetings and their goals. His untimely death represents a great loss to the community. This special issue is dedicated to his memory.
Science on the Internet: A Resource for K-12 Teachers, 1st edition
Authors: Jazlin V. Ebenezer, Eddy Lau
Venue:  (1998)

:It explains what the Internet is and how teachers can navigate the World Wide Web (www) to teach and plan science lessons. The strength of this book is its extensive descriptions and URLs (addresses) of hundreds of high-quality science and science education sites on the www. Internet resource guide for current and future science teachers at the K-12 grade levels.
An Authentication Logic with Formal Semantics Supporting Synchronization, Revocation, and Recency
Authors: Stuart G. Stubblebine, Rebecca N. Wright
Venue: IEEE Transactions on Software Engineering (2002)

Distributed systems inherently involve dynamic changes to the value of security-relevant attributes such as the goodness of encryption keys, trustworthiness of participants, and synchronization between principals. Since concurrent knowledge is usually infeasible or impractical, it is often necessary for the participants of distributed protocols to determine and act on beliefs that may not be supported by the current state of the system. Policies for determining beliefs in such situations can range from extremely conservative, such as only believing statements if they are very recent, to extremely optimistic, such as believing all statements that are not yet known to be revoked. Such security policies often are heavily dependent on timing of received messages and on synchronization between principals. We present a logic for analyzing cryptographic protocols that has the capability to specify time and synchronization details. This capability considerably advances the scope of known techniques both for expressing practical authentication policies of protocol participants as constraints and for reasoning about protocol goals subject to these constraints. In the course of reasoning about protocol goals, one is able to exhibit sufficient conditions regarding trust between protocol participants, synchronization between protocol participants, and timeliness of message contents. Our logic is flexible and can support a wide range of security policies including the recent-secure authentication policy for enforcing revocation in distributed systems. The ability to reason about the conjunction of individual participant policies and protocols will be especially important as public and private key infrastructures are deployed and new and unanticipated policies are put into use.
Sams Teach Yourself Microsoft FrontPage 98 in a Week, 1st edition
Authors: David Karlins, Don Doherty, Stephanie Cottrell, Donald Dougherty
Venue:  (1997)

:Teach Yourself FrontPage in a Week is organized in the familiar day-by-day format. Each lesson provides a basic overview of the topics being taught, then shows lots of examples illustrating that topic, and follows up with a summary and exercises for further exploration.A step-by-step tutorial for designing, creating and administering Web pages and sites with Microsoft s market-leading Web authoring productCompletely revised and updated for FrontPage 98Covers everything from the basics of Web publishing to Wizards, WebBots, style sheets, and embedding Java, ActiveX, VBScript and JavaScript
Using AutoCAD: Release 13 for DOS, 7th edition
Authors: Ralph Grabowski, James E. Fuller
Venue:  (1994)

:Join thousands of users like yourself and let Using AutoCAD help you acquire the skills and knowledge you need to succeed in today's high-tech CAD world. Completely updated to Release 13 for DOS, Using AutoCAD and its success-proved tutorial approach is great for beginning or advanced users. From creating 2D and 3D drawings, to customizing, solid modeling, and more, Using AutoCAD is a complete, step-by-step guide that will help you learn how to use the full power of AutoCAD Release 13!
Alan Turing: The Enigma
Authors: Andrew Hodges
Venue:  (2000)

:Alan Turing (1912  1954) was a British mathematician who made history: His breaking of theGerman U-boat Enigma cipher in World War II ensured Allied-American control of the Atlantic. But Turings vision went far beyond the desperate wartime struggle. Already in the 1930s he had defined the concept of the universal machine, which underpins the computer revolution. In 1945 he was a pioneer of electronic computer design. But Turings true goal was the scientific understanding of the mind, brought out in the drama and wit of the famous "Turing test" for machine intelligence, and his prophecy for the twenty-first century. Drawn into the cockpit of world events and the forefront of technological innovation, Alan Turing was also an innocent and unpretentious gay man trying to live in a society that criminalized him. In 1952, he revealed his homosexuality and was forced to participate in a humiliating treatment program, and was ever after regarded as a security risk. His suicide in 1954 remains one of the many enigmas in an astonishing life story. "As vivid a picture as one could hope for a most complex and intriguing man," says Douglas Hofstadter, author of G&ouml;del, Escher, Bach. Both a compelling narrative and a work of scholarship, Alan Turing: The Enigma is the definitive biography of one of the greatest minds of the modern world.
Learn Act! 4.0 for the Advanced User with Cdrom
Authors: Deborah Bean, Neal Berkowitz
Venue:  (1998)

:Featuring topics of interest to the advanced user, including advanced template design, customized screen layouts, email, and setting up and using synchronization, "Learn Act! 3.0 for the Advanced User" is geared for the individual who needs to know more than the basics about the industry-leading Act! 3.0 from Symantec.
GNU EMACS Pocket Reference, 1st edition
Authors: Debra Cameron
Venue:  (1998)

:GNU Emacs is the most popular and widespread of the Emacs family of editors. It is also the most powerful and flexible. Unlike all other text editors, GNU Emacs is a complete working environment -- you can stay within Emacs all day without leaving. The GNU Emacs Pocket Reference is a companion volume to O'Reilly's Learning GNU Emacs, which tells you how to get started with the GNU Emacs editor and, as you become more proficient, it will help you learn how to use Emacs more effectively. This small book, covering Emacs version 20, is a handy reference guide to the basic elements of this powerful editor, presenting the Emacs commands in an easy-to-use tabular format.
Quantum Formulas: A Lower Bound and Simulation
Authors: Vwani P. Roychowdhury, Farrokh Vatan
Venue: SIAM Journal on Computing (2002)

We show that Nechiporuk's method [I. Wegener, The Complexity of Boolean Functions, Teubner-Wiley, New York, 1987] for proving lower bounds for Boolean formulas can be extended to the quantum case. This leads to an $\Omega(n^2/\log^2 n)$ lower bound for quantum formulas computing an explicit function. The only known previous explicit lower bound for quantum formulas [A. Yao, Proceedings of 34th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 352--361] states that the majority function does not have a linear-size quantum formula. We also show that quantum formulas can be simulated by Boolean circuits of almost the same size.
Java Software Solutions: Foundations of Program Design, 2nd edition
Authors: John Lewis, William Loftus
Venue:  (2000)

:Using Java(TM) 1.1, Java Software Solutions teaches beginning programmers how to design and implement high-quality object-oriented software. The authors emphasize problem solving through understanding requirements, exploring options, and designing conceptually clean solutions. John Lewis and Bill Loftus wrote this book from the ground up, taking full advantage of Java to teach introductory programming. Throughout the book, the authors intertwine the use of applets and applications to demonstrate computing concepts. Applets are introduced early, building on the excitement of the web, while applications are used for readers to gain a clear understanding of programming concepts.
Excel 2000: 101 Frontline Universe Timesavers
Authors: David D. Busch
Venue:  (2000)

:More than 50 million Americans have access to computers, yet only 12 million Americans use the Internet (six million of whom went online for the first time in 1995). This guide helps computer users find information on the Internet easily, providing alphabetized listings of 2,000 pertinent entries in approximately 600 subjects. Illustrations. Charts & tables.
Engineering Problem Solving with C, 2nd edition
Authors: Delores M. Etter, Jeanine A. Ingber
Venue:  (2000)

: To develop a consistent methodology for solving engineering problems. To present the fundamental capabilities of C, the language of choice of many practicing engineers and scientists. To illustrate the problem solving process with C through a variety of engineering examples and applications. Introduces the topics of character data and the discussion of C strings early. Adds chapters on: structures and C++ Programming language. Includes a new section of problems for each chapter. Provides new engineering application problems: Simulation, Image Processing, and Complex Number. Offers an Instructor's Resource CD-ROM to supplement text. Companion Website available at www.prenhall.com/etter
The future of logic synthesis and verification
Authors: Robert K. Brayton
Venue: Logic Synthesis and Verification (2001)

Logic synthesis has been worked on for at least 40 years, and much has been accomplished, with many commercial tools developed and used pervasively. However, in light of the continual progress made in technology, more complex designs will be made and along with increased physical interactions, these will present new changes for both synthesis and verification. We discuss some areas where these problems will arise and pose some challenges for the future.
Building AS/400 Client/Server Solutions Using Shrink-Wrapped Software and Off-the-Shelf Hardware, 1st edition
Authors: Kris Neely, Jim Hoopes, Brian Singleton
Venue:  (1997)

:Now you can leverage the power of shrink-wrapped software and off-the shelf-hardware to create robust AS/400-oriented client/server solutions at a fraction of the cost of a legacy solution! This book explains how to integrate 23 shrink-wrapped products with the AS/400. It provides background information on the product family in a client/server environment, gives an example of a C/S application using a specific brand of the product, and lists available software or hardware brands in the category.
Software safety: where's the evidence?
Authors: John A McDermid
Venue: Proceedings of the Sixth Australian workshop on Safety critical systems and software - Volume 3 (2001)

Standards for safety critical software usually either mandate or recommend development and assessment techniques which are deemed appropriate to reduce the risk of flaws in the software contributing to accidents. These recommendations are usually broken down into a number of "levels" of rigour, with the highest levels being applied where the consequences of failure, or risk, are most severe. The paper discusses the extent to which it is possible to find evidence that there is a genuine variation in risk with level, i.e. that the principles in the standards are sound, and questions some of the assumptions underlying these standards.The paper then goes on to discuss the potential advantages of using product-based evidence to demonstrate safety of software, as opposed to relying on process prescription. It outlines current work on developing and applying "evidence frameworks" as alternatives to the process-based approach, and identifies some of the challenges in gaining widespread acceptance of such approaches.Finally the paper discusses the ALARP principle, and what would be necessary to show that risks associated with safety-critical software have been reduced ALARP. The paper concludes that there are some fundamental difficulties with applying the ALARP principle to software, which neither the process nor evidence-based approaches to demonstrating software safety can readily resolve.
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
Authors: Xin He, Ming-Yang Kao, Hsueh-I Lu
Venue: SIAM Journal on Computing (2000)

We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property $\pi$ is called a {\em $\pi$-graph}. If $\pi$ satisfies certain properties, then an n-node m-edge $\pi$-graph G can be encoded by a binary string X such that (1) G and X can be obtained from each other in O(n log n) time, and (2) X has at most $\beta(n)+o(\beta(n))$ bits for any continuous superadditive function $\beta(n)$ so that there are at most $2^{\beta(n)+o(\beta(n))}$ distinct $n$-node $\pi$-graphs. The methodology is applicable to general classes of graphs; this paper focuses on planar graphs. Examples of such $\pi$ include all conjunctions over the following groups of properties: (1) G is a planar graph or a plane graph; (2) $G$ is directed or undirected; (3) $G$ is triangulated, triconnected, biconnected, merely connected, or not required to be connected; (4) the nodes of G are labeled with labels from $\{1,\ldots, \ell_1\}$ for $\ell_1\leq n$; (5) the edges of G are labeled with labels from $\{1,\ldots, \ell_2\}$ for $\ell_2\leq m$; and (6) each node (respectively, edge) of G has at most $\ell_3=O(1)$ self-loops (respectively, $\ell_4=O(1)$ multiple edges). Moreover, $\ell_3$ and $\ell_4$ are not required to be O(1) for the cases of $\pi$ being a plane triangulation. These examples are novel applications of small cycle separators of planar graphs and are the only nontrivial classes of graphs, other than rooted trees, with known polynomial-time information-theoretically optimal coding schemes.
Dictionary of Computer and Internet Terms, 6th edition
Authors: Douglas D. Downing, Michael A. Covington, Melody M. Covington
Venue:  (1998)

:Featuring more than 1,500 alphabetized entries, this compact dictionary has been updated to keep pace with the newest developments in computer science and Internet technology.
KidWare: The Parent's Guide to Software for Children, 1st edition
Authors: Michael C. Perkins, Celia H. Nunez
Venue:  (1994)

:Kidware: The Parent's Guide to Software for Children provides practical information about the best programs for children.
Programmable active memories: reconfigurable systems come of age
Authors: Jean E. Vuillemin, Patrice Bertin, Didier Roncin, Mark Shand, Hervé H. Touati, Philippe Boucard
Venue: Readings in hardware/software co-design (2001)

Programmable active memories (PAM) are a novel form of universal reconfigurable hardware coprocessor. Based on field-programmable gate array (FPGA) technology, a PAM is a virtual machine, controlled by a standard microprocessor, which can be dynamically and indefinitely reconfigured into a large number of application-specific circuits. PAM's offer a new mixture of hardware performance and software versatility. We review the important architectural features of PAM's, through the example of DECPeRLe-1, an experimental device built in 1992. PAM programming is presented, in contrast to classical gate-array and full custom circuit design. Our emphasis is on large, code-generated synchronous systems descriptions; no compromise is made with regard to the performance of the target circuits. We exhibit a dozen applications where PAM technology proves superior, both in performance and cost, to every other existing technology, including supercomputers, massively parallel machines, and conventional custom hardware. The fields covered include computer arithmetic, cryptography, error correction, image analysis, stereo vision, video compression, sound synthesis, neural networks, high-energy physics, thermodynamics, biology and astronomy. At comparable cost, the computing power virtually available in a PAM exceeds that of conventional processors by a factor 10 to 1000, depending on the specific application, in 1992. A technology shrink increases the performance gap between conventional processors and PAM's. By Noyce's law, we predict by how much the performance gap will widen with time.