ppxscal/embedding_network huggingface dataset:
Collective Intelligence: Mankind's Emerging World in Cyberspace
Authors: Pierre Levy
Venue:  (1997)

:The number of travelers along the information superhighway is increasing at a rate of ten percent a month. How will this communications revolution affect our culture and society? Though awed by their potential, we've feared computers as agents of the further alienation of modern man: they take away our jobs, minimize direct human contact, even shake our faith in the unique power of the human brain. Pierre Levy believes, however, that rather than creating a society where machines rule man, the technology of cyberspace will have a humanizing influence on us, and foster the emergence of a "collective intelligence" - a meeting of minds on the Internet - that will validate the contributions of the individual.
The Linear Rational Pseudospectral Method with Iteratively Optimized Poles for Two-Point Boundary Value Problems
Authors: Jean-Paul Berrut, Hans D. Mittelmann
Venue: SIAM Journal on Scientific Computing (2001)

An algorithm is proposed which improves upon the polynomial pseudospectral method for solving linear two-point boundary value problems. In the latter, the collocation points are the vertical projection onto the interval of points equidistant or nearly equidistant on the circle, and they therefore accumulate in the vicinity of the extremities of the interval. Thus the method is well-suited for solving problems whose solutions have boundary layers but not as good at approximating solutions with large gradients (shocks) away from the extremities of their domain of definition. Our idea is to modify the polynomial ansatz by attaching a denominator so as to make it a rational interpolant. The denominator is then successively optimized in an iterative procedure with each step consisting of the solution of two problems: an optimization of the denominator for given values of the approximation to the solution u at the interpolation points and a collocation in the linear space of the rational interpolants with the just obtained fixed denominator to obtain new approximate values of u. We show the efficiency of a Galerkin version of the method and discuss the power of the collocation version with several numerical examples.
The Complete Guide to Java Database Programming (Java Masters Series)
Authors: Mathew Siple, Matthew D. Siple
Venue:  (1997)

:For experienced developers and programmers looking to exploit the power of Java by building applications that interact with a SQL database server,this book/CD-ROM is your complete,real-world guide to the Java Database Connectivity Application Programming Interface. Part 1 leads you through the seven key steps in developing a JDBC API application; Part 2 details all of the JDBC classes,interfaces,methods,and variables; and Part 3 guides you through the development of a dynamic and extensible database browser. CD-ROM contains JDK 1. 14 plus essential source code (Windows- and Solaris-compatible) and the Web Logic Driver. A volume in the McGraw-Hill Java Masters series. Unleash the power of JFBC API to access any database with unprecedented ease Ready to exploit the flexibility and strength of Java by building applications that interact with a SQL database server? Here are all the tools needed by any experienced developer or programmer to master the Java Database Connectivity Application Programming Interface (JDC API)systems. Step by step,with real-world exercises and examples,Matthew Siple shows how to design and build database assess and management application using the JDBC API. Using this book and CD-ROM,you'll proceed from the basics right through to the development of your own database browser: Get an overview of the JDBC API and how it worksStudy two- and three-tier client server modelsPractice the seven key steps in developing a JDBC applicationDelve into all of the JDBC classes,interfaces,methods,and variableFocus on solutions to some of the more complex tasks required of today's client/server databaseapplicationsBuild a dynamic and extensible database browserone that lets you connect to any SQL92 compliant server and query it for all user-available object in the database,as well as database meta data
Sams Teach Yourself Lotus SmartSuite in 24 Hours, 1st edition
Authors: Faithe Wempen, Faithewempen Wempen
Venue:  (1998)

:In just 24 sessions of one hour or less, you will be up and running with Lotus SmartSuite. Using a straightforward, step-by-step approach, each lesson builds upon the previous one, allowing you to learn the essentials of Lotus SmartSuite from the ground up. Here, you'll find the tools you need for using Word Pro, 1-2-3, Approach, Freelance Graphics, Organizer, FastSite and more!
Two-Sided Arnoldi and Nonsymmetric Lanczos Algorithms
Authors: Jane Cullum, Tong Zhang
Venue: SIAM Journal on Matrix Analysis and Applications (2002)

We introduce new two-sided Arnoldi recursions and use them to define a model reduction procedure for large, linear, time-invariant, multi-input/multi-output differential algebraic systems. We prove that this procedure has desirable moment matching properties. We define a corresponding model reduction procedure which is based on a band nonsymmetric Lanczos recursion and prove that if the deflation is exact and there are no breakdowns in the recursions, then these two model reduction procedures generate identical reduced-order systems. We prove similar equivalences for corresponding eigenelement procedures. We concentrate on the theoretical properties of the new algorithms.
Quick Course in Microsoft Publisher 2000
Authors: Christina Dudley
Venue:  (1999)

:Ideal for use as a self-paced training guide or for instructor-led training, this book offers to-the-point tutorials and learning exercises for quickly grasping desktop publishing basics and building proficiency.
Building Database Driven Catalogs
Authors: Sherif Danish, Patrick Gannon
Venue:  (1998)

:As a prime sales tool,the good old catalog is as vital as everespecially when it's on the Web and done right. This guide explains the business strategies behind the trend and shows how to create "smart" (i. e.,not static) online database-driven catalogs for business and consumer buyers. The CD-ROM is a real bonus; it contains a fully functional version of Saqqara Systems Stepsearch Software,the corporate-tested Internet catalog publishing and authoring system valued at over $1,000. Create a state-of-the-art interactive online catalog! Would you like your business to have a top-of-the-line electronic catalog like that of The Sharper Image or The Nature Company? Do you wish your business could communicate with other businesses online as effectively as Xerox or Hewlett-Packard do? With this book,your business can! Written by the founders of the company that implemented H P's and Xerox's online catalog,and packed with case studies from companies like The Sharper Image and The Nature Company,Building Database-Driven Web Catalogs tells you how to go from "static" online catalogs modeled on obsolescent print media,to a dynamic and effective E-Commerce site with leading-edge interactive capabilities. You'll find numerous guides that describe how to design a technically attractive site. But only Building Database-Driven Web Catalogs gives you what you really need to understand and profitably exploit the business benefits,possibilities,and implementation of E-Commerce. With all the strategic management information you need to make business decisions plus the detailed implementation data needed to put those decisions in place,this guide is an essential reference in today'smarketplace. It's a resource that can earn thousands of dollars for your businessnow,and well into the 21st century.
Mario Party 2
Authors: Tim Bogenn, Tim Fitzpatrick
Venue:  (2000)

:BradyGames-Mario Party 2 Official Strategy Guide features detailed maps and strategy for every edventure board, including Bowser Land! Expert Mini-Game Tactics for all 65 Mini-Games. Complete Single-Player Coverage  Mini-Game Coaster, Battle, Trial, and Duel Modes, and MORE! Every Secret and Bonus revealed to earn all the Hidden Mini-Games!
Artificial Ethology
Authors: Owen Holland, David McFarland
Venue:  (2000)

:"Modelling and computer simulations combined with empirical research are the traditional tools for the study of animal behaviour. This exciting new book sets out to show how artificial ethology, or experimentation with animal-like robots, can add a new dimension to our understanding of behavioural questions. Introductory chapters to modelling and robotics are followed by thematic chapters scrutinizing major areas of research in animal behaviour. Each thematic exploration is illustrated with case studies written by leading researchers in the field. From robotic lobsters to robotic 'monkeys', each case study brings the text to life, and gives a detailed description of a problem, approach, and robot application. The book concludes with a discussion of general points arising from the use of robots in biological research." Artificial Ethology offers a comprehensive introduction to the application of robotics in animal behaviour and physiology. It will be of interest and use to all behavioural scientists, particularly zoologists, as well as computer scientists, and engineers.
The New Geography: How the Digital Revolution Is Reshaping the American Landscape
Authors: Joel Kotkin
Venue:  (2000)

:In the blink of an eye, vast economic forces have created new types of communities and reinvented old ones. In The New Geography, acclaimed forecaster Joel Kotkin decodes the changes, and provides the first clear road map for where Americans will live and work in the decades to come, and why. He examines the new role of cities in America and takes us into the new American neighborhood. The New Geography is a brilliant and indispensable guidebook to a fundamentally new landscape.
Data Abstraction and Problem Solving with C++: Walls and Mirrors, 3rd edition
Authors: Frank M. Carrano, Janet J. Prichard
Venue:  (2001)

:Focusing on data abstraction and data structures, the second edition of this very successful book continues to emphasize the needs of both the instructor and the student. The book illustrates the role of classes and abstract data types (ADTs) in the problem-solving process as the foundation for an object-oriented approach. Throughout the next, the distinction between specification and implementation is continually stressed. The text covers major applications of ADTs, such as searching a flight map and performing an event-driven simulation. It also offers early, extensive coverage of recursion and uses this technique in many examples and exercises. Overall, the lucid writing style, widespread use of examples, and flexible coverage of material have helped make this a leading book in the field.
Nonmonotone Trust-Region Methods for Bound-Constrained Semismooth Equations with Applications to Nonlinear Mixed Complementarity Problems
Authors: Michael Ulbrich
Venue: SIAM Journal on Optimization (2000)

We develop and analyze a class of trust-region methods for bound-constrained semismooth systems of equations. The algorithm is based on a simply constrained differentiable minimization reformulation. Our global convergence results are developed in a very general setting that allows for nonmonotonicity of the function values at subsequent iterates. We propose a way of computing trial steps by a semismooth Newton-like method that is augmented by a projection onto the feasible set. Under a Dennis--Moré-type condition we prove that close to a regular solution the trust-region algorithm turns into this projected Newton method, which is shown to converge locally q-superlinearly or quadratically, respectively, depending on the quality of the approximate subdifferentials used.As an important application we discuss how the developed algorithm can be used to solve nonlinear mixed complementarity problems (MCPs). Hereby, the MCP is converted into a bound-constrained semismooth equation by means of an NCP-function. The efficiency of our algorithm is documented by numerical results for a subset of the MCPLIB problem collection.
VM/CMS: A Survival Guide+
Authors: James E. Potter
Venue:  (1994)

:VM/CMS: A Survival Guide + (2nd Edition) contains the operating system statements COBOL students and programmers need to work with COBOL programs, including extensive coverage of VSAM. The book can also be used as a learning tool and reference manual by anyone who works in the IBM VM/CMS environment, regardless of the programming language being used. For new users, the text offers a quick start on the IBM mainframe system and its editor. This text is a must for new and experienced VM users. James E. Potter teaches business computing and COBOL programming at California State University Hayward. He is widely known for his ability to guide students into successful computing with his outstanding keystroke-by-keystroke methodology. 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
Utility Maximization with Discretionary Stopping
Authors: Ioannis Karatzas, Hui Wang
Venue: SIAM Journal on Control and Optimization (2000)

Utility maximization problems of mixed optimal stopping/control type are considered, which can be solved by reduction to a family of related pure optimal stopping problems. Sufficient conditions for the existence of optimal strategies are provided in the context of continuous-time, Itô process models for complete markets. The mathematical tools used are those of optimal stopping theory, continuous-time martingales, convex analysis, and duality theory. Several examples are solved explicitly, including one which demonstrates that optimal strategies need not always exist.
On $\mathcalVU$-theory for Functions with Primal-Dual Gradient Structure
Authors: Robert Mifflin, Claudia Sagastizábal
Venue: SIAM Journal on Optimization (2000)

We consider a general class of convex functions having what we call primal-dual gradient structure. It includes finitely determined max-functions and maximum eigenvalue functions as well as other infinitely defined max-functions. For a function in this class, we discuss a space decomposition that allows us to identify a subspace on which the function appears to be smooth. Moreover, using the special structure of such a function, we compute smooth trajectories along which certain second-order expansions can be obtained. We also give an explicit expression for the Hessian of a related Lagrangian.
Beginning Components for ASP
Authors: Richard Anderson, Alex Homer, Simon Robinson
Venue:  (1999)

:This book is an example oriented practical guide teaching you the correct way to write components alongside design issues, architecture and data access. By teaching you how to write a component in VB, the book teaches you COM along the way. About the authors Richard Anderson Richard Anderson is a professional software developer who has over 10 years experience of Microsoft Technologies. He is a recognized authority in many areas, and has written material for several books as well as technically reviewing many others. Richard spends his daytime as senior systems architect for a medium sized electronic commerce company, and spends his spare time living the COM lifestyle, keeping his wife Sam happy, and eating curries. Brian Francis Brian is a Senior Developer with NCR's Human Interface Technology Center in Atlanta, Georgia. At the HITC, Brian is responsible for prototyping and developing advanced applications that apply superior human interfaces as developed at the Center. His tools of choice include Visual Basic, Visual C++, Java, and all of the Microsoft Internet products. Brian has developed and deployed Multimedia Kiosk applications, Computer-based Training applications, and other advanced user interface prototypes for the past three years. Alex Homer Alex Homer lives and works in the idyllic rural surroundings of Derbyshire, UK. His software company, specializes in office integration and Internet-related development, and produces a range of vertical application software. He has worked with Wrox Press on several projects. Simon Robinson Former academic who specialized in post-doctorate computational physics & mathematical modeling, mostly in quantum physics and superconductors. He subsequently worked as 50% programmer and 50% evaluation / researcher for Lucent Technologies, until June 1999, and now works freelance. He has 11 years continuous programming experience. A recognized expert in COM/DCOM/ATL, ADSI, Active Directory, MFC, LDAP, C++, VB and MMC.
Business to Business Bible
Authors: Simon M. Collin
Venue:  (2001)

:In this comprehensive guide Simon Collin provides tips and advice on using the Internet to search (and research) everything from getting news delivered by e-mail to organising travel and buying equipment on-line. This one-stop shop is packed with contact details and advice on where to look and how to look for what you need. It's guaranteed to save you valuable time and resources. The Business-to-Business Bible will be an invaluable source of reference for anyone using the Internet.
Continuity in software systems
Authors: Dick Hamlet
Venue: Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis (2002)

Most engineering artifacts behave in a continuous fashion, and this property is generally believed to underlie their dependability. In contrast, software systems do not have continuous behavior, which is taken to be an underlying cause of their undependability. The theory of software reliability has been questioned because technically the sampling on which it is based applies only to continuous functions.This paper examines the role of continuity in engineering, particularly in testing and certifying artifacts, then considers the analogous software situations and the ways in which software is intrinsically unlike other engineered objects. Several definitions of software 'continuity' are proposed and related to ideas in software testing. It is shown how 'continuity' can be established in practice, and the consequences for testing and analysis of knowing that a program is 'continuous.Underlying any use of software 'continuity' is the continuity of its specification in the usual mathematical sense. However, many software applications are intrinsically discontinuous and one reason why software is so valuable is its natural ability to handle these applications, where it makes no sense to seek software 'continuity' or to blame poor dependability on its absence.
The algorithm on knowledge reduction in incomplete information systems
Authors: Jiye Liang, Zongben Xu
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2002)

Rough set theory is emerging as a powerful tool for reasoning about data, knowledge reduction is one of the important topics in the research on rough set theory. It has been proven that finding the minimal reduct of an information system is a NP-hard problem, so is finding the minimal reduct of an incomplete information system. Main reason of causing NP-hard is combination problem of attributes. In this paper, knowledge reduction is defined from the view of information, a heuristic algorithm based on rough entropy for knowledge reduction is proposed in incomplete information systems, the time complexity of this algorithm is O(|A|2|U|). An illustrative example is provided that shows the application potential of the algorithm.
A general purpose, expandable processor for real-time computer graphics
Authors: Jeffrey F. Eastman, David R. Wooten
Venue: Proceedings of the 1st annual conference on Computer graphics and interactive techniques (1974)

A class of critical computer requirements for real-time scan T.V. computer graphics is examined in relation to commercially available CPU architectures. Finding general purpose processors not suited, a new processor is proposed which is designed around the concept of "instruction set partitioning." In this design, special hardware-implemented algorithms may be included in the machine instruction set, and these processors allowed to operate asynchronously from each other. The design is projected to generate a complete new frame of a color T.V. picture every 0.1-0.8 seconds depending on image complexity. Due to its inherent generality, the CPU may be similarly expanded to encompass a wide variety of other specialized, or real-time tasks with minimal additional hardware. The 32-bit parallel processor has a design cycle time of 100 ns and is in the price class of a minicomputer.
On sparse evaluation representations
Authors: G. Ramalingam
Venue: Theoretical Computer Science (2002)

The sparse evaluation graph has emerged over the past several years as an intermediate representation that captures the dataflow information in a program compactly and helps perform dataflow analysis efficiently. The contributions of this paper are three-fold: We present a linear time algorithm for constructing a variant of the sparse evaluation graph for any dataflow analysis problem. Our algorithm has two advantages over previous algorithms for constructing sparse evaluation graphs. First, it is simpler to understand and implement. Second, our algorithm generates a more compact representation than the one generated by previous algorithms. (Our algorithm is also as efficient as the most efficient known algorithm for the problem.) We present a formal definition of an equivalent flow graph, which attempts to capture the goals of sparse evaluation. We present a quadratic algorithm for constructing an equivalent flow graph consisting of the minimum number of vertices possible. We show that the problem of constructing an equivalent flow graph consisting of the minimum number of vertices and edges is NP-hard. We generalize the notion of an equivalent flow graph to that of a partially equivalent flow graph, an even more compact representation, utilizing the fact that the dataflow solution is not required at every node of the control-flow graph. We also present an efficient linear time algorithm for constructing a partially equivalent flow graph. Copyright 2002 Elsevier Science B.V.
Computation of Lagrange multipliers for linear least squares problems with equality constraints
Authors: A. Laratta, F. Zironi
Venue: Computing (2001)

The computation of Lagrange multipliers in linear least squares problems with equality constraints is studied. A perturbation analysis is performed to examine the conditioning of the problems; the behaviour of two algorithms on a class of test problems is shown on some graphs.
Nintendo 64 Player's Choice Pocket Power Guide: Unauthorized Strategy Guide
Authors: Nick Roberts
Venue:  (1998)

:The player's chose these games! Some of the best available, Cruis'n USA, Starfox 64, Wave Race, Shadows of the Empire, Mario Kart '64, and many more! Includes Gameshark codes!
Cocyclic Codes of Length 40
Authors: A. Baliga
Venue: Designs, Codes and Cryptography (2001)

There are 5 groups of order 20. This paper reports on the search for binary self-dual codes of length 40, cocyclic over any one of the first four groups, using cocyclic Hadamard matrices and the [I, A] construction. The fifth group is not investigated here. A total of 28 classes of extremal cocyclic self-dual codes were found&mdash;27 of these are doubly-even and one singly-even. The majority of these classes arise from the dihedral-cocyclic Hadamard matrices. There is also a class of dihedral-cocyclic Hadamard matrices which gives a large collection of [40, 20] codes with only one codeword of length 4.