ppxscal/embedding_network huggingface dataset:
Recursive Algorithm for the Fundamental/Group Inverse Matrix of a Markov Chain from an Explicit Formula
Authors: Isaac Sonin
Venue: SIAM Journal on Matrix Analysis and Applications (2001)

We present a new accurate algorithm (REFUND) for computing the fundamental matrix (or closely related group inverse matrix) of a finite regular Markov chain. This algorithm is developed within the framework of the state reduction approach exemplified by the GTH (Grassmann, Taksar, Heyman)/S (Sheskin) algorithm for recursively finding invariant measure. The first (reduction) stage of the GTH/S algorithm is shared by REFUND, as well as by an earlier algorithm FUND developed for the fundamental matrix by Heyman in 1995, and by a modified version of Heyman and O'Leary in 1998. Unlike FUND, REFUND is recursive, being based on an explicit formula relating the group inverse matrix of an initial Markov chain and the group inverse matrix of a Markov chain with one state removed. Operation counts are approximately the same: $\Theta (\frac 73n^3)$ for REFUND versus $\Theta (\frac 83n^3)$ for FUND. Numerical tests indicate that REFUND is accurate. The structure of REFUND makes it easily combined with the other algorithms based on the state reduction approach. We also discuss the general properties of this approach, as well as connections to the optimal stopping problem and to tree decompositions of graphs related to Markov chains.
Sams Teach Yourself Today: E-Baseball : Mining the Internet for History, Stats, Fantasy Leagues, and Memorabilia, 1st edition
Authors: Bob Temple
Venue:  (2000)

:Sams Teach Yourself e-Baseball Today is written for anybody who wants to learn about everything from the illustrious history of baseball to the increasingly popular Internet fantasy leagues. Each short, easy-to-read chapter carefully steps you through all you need to know to successfully find online and computer resources to track baseball statistics, research baseball rules, play and run baseball fantasy leagues, and buy and sell baseball collectibles.
Microsoft Office 2000/Visual Basic for Applications Fundamentals
Authors: David Boctor
Venue:  (1999)

:A fast, easy way to learn to program with Visual Basic for Applications, to extend and modify behavior in the various Office applications, and to take full advantage of the Internet. 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
Analysing data trough visualizations in a web-based trade fair system
Authors: Paolo Buono, Maria Francesca Costabile, Gerald Jaeschke, Matthias Hemmje
Venue: Proceedings of the 14th international conference on Software engineering and knowledge engineering (2002)

The enormous amount of data available on the web must be adequately exploited by company managers in order to improve their business. An important role is played by various techniques that are capable of extracting useful information. Our approach exploits visualization techniques. In this paper we present 2D and 3D visualizations that are used in a web-based system that supports the organization and management of trade fairs. We show how the main users of the system, namely fair organisers and companies that participate in the fair either as exhibitors or visitors, take advantage of the available visual tools in their business activities.
Cooperating physical robots: a lesson in playing robotic soccer
Authors: Bernhard Nebel
Venue: Mutli-agents systems and applications (2001)

Having a robot that carries out a task for you is certainly of some help. Having a group of robots seems to be even better because in this case the task may be finished faster and more reliably. However, dealing with a group of robots can make some problems more difficult. In this paper we sketch some of the advantages and some problems that come up when dealing with groups of robots. In particular, we describe techniques as they have been developed and tested in the area of robotic soccer.
Teach Yourself UNIX, 4th edition
Authors: Kevin Reichard, Eric Foster-Johnson
Venue:  (1999)

:Put your UNIX fears to rest and embark on the programming path with teach yourself UNIX&reg;, 3rd Edition. Starting with UNIX session basics and the UNIX directory, veteran authors Kevin Reichard and Eric F. Johnson provide you with the foundation for a successful programming career. teach yourself UNIX, 3rd Edition also covers, permissions, logins, passwords, UNIX Internet tools, and the command line. Plus, teach yourself UNIX, 3rd Edition explains advanced UNIX capabilities such as multitasking, Awk programs, Perl scripts, and the streams editor. Reichard and Johnson include a detailed glossary and an appendix of basic UNIX commands.
Pure C#: A Code - Intensive Premium Reference
Authors: William Robison
Venue:  (2001)

:Pure C#, in keeping with the Pure series, focuses on issues of concern specific to writing programs using the C# language. The book is divided into three parts: Part 1 addresses the syntax and program construction methods available to C# programming. Part 2 is a code-intensive section that demonstrates specific tasks of concern to programmers. Part 3 presents reference topics of use to C# programmers.
PhotoShop 6 in an Instant
Authors: Michael Toot, Mike Woolridge
Venue:  (2001)

:Are you a visual learner who needs results - right away? Do you prefer to focus on the essentials - and skip the bells and whistles? If so, then this book is for you. Open it up and you will find extra-large, step-by-step screen shots that show you how to tackle over 100 key Photoshop 6 tasks, from using the Airbrush tool and reordering layers to applying a Texture filter and adding type to an image. And all this at a great price!
Teach Yourself America Online, 1st edition
Authors: Charles Bowen, Jennifer Watson
Venue:  (1998)

:Teach Yourself America Online When you need on-the-spot answers  Teach Yourself! Learn fast with short, clear steps Find the answers you need easily Explore the Web for related topics*Make the most of every minute online*Use AOL's newest features to send pictures with e-mail*Skillfully navigate all new content channels*Create your own Web pages with AOL's all-in-one tool  Personal Publisher*Do it all from your computer  read the news, invest online, shop, make travel arrangementsShelving Category: America Online User Level: Beginning to Intermediate
The determination of the thermal properties of a heat conductor in a nonlinear heat conduction problem
Authors: D. Lesnic
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2002)

This paper considers the inverse determination of the positive unknown thermal properties K(T), C(T) and the unknown temperature T(x,t) in the nonlinear transient heat conduction equation. In addition to prescribed initial and/or boundary values, specified continuously differentiable temperature data T(x0, t) with non-zero derivative at a single sensor location x = x0 is given. When K(T) and C(T) obey a certain relationship which enables one to linearise exactly the nonlinear heat equation then their dependence upon T is obtained explicitly, whilst the unknown temperature T(x,t) is obtained implicitly and is then calculated numerically. Results are presented and discussed for infinite, semi-infinite and finite slabs.
Strong relaxation of the isothermal euler system to the heat equation
Authors: S. Junca, M. Rascle
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2002)

We consider the system of isothermal Euler Equations with a strong damping. For large BV solutions, we show that the density converges to the solution to the heat equation when the friction coefficient &#x03B5;-1 tends to infinity. Our estimates are already valid for small time, including in the initial layer. They are global in space (and even in time when the limits of the density are the same at &#x00B1;&#x221E;) and they provide rates of convergence when &#x03B5; &#x2192; 0.
The CWEB System of Structured Documentation: Version 3.0, 1st edition
Authors: Donald Ervin Knuth, Silvio Levy
Venue:  (1994)

:WEB is a software system that facilitates the creation of readable programs. It was originally developed by Donald E. Knuth as he programmed the TEX typesetting system. Users of WEB are able to write programs of superior quality; produce state-of-the-art documentation; greatly reduce debugging time and maintain programs easily as conditions change. CWEB is a version of WEB for documenting C and C++ programs. WEB was adapted to C by Silvio Levy in 1987, and since then both Knuth and Levy have revised and enhanced the system in many ways, notably to support C++ and ANSI C. Thus CWEB combines TEX with two of today's most widely used professional programming languages. This book is the definitive user's guide and reference manual for the CWEB system. The CWEB software itself is freely available via anonymous ftp from labrea.stanford.edu on the Internet.
Top-k selection queries over relational databases: Mapping strategies and performance evaluation
Authors: Nicolas Bruno, Surajit Chaudhuri, Luis Gravano
Venue: ACM Transactions on Database Systems (TODS) (2002)

In many applications, users specify target values for certain attributes, without requiring exact matches to these values in return. Instead, the result to such queries is typically a rank of the "top k" tuples that best match the given attribute values. In this paper, we study the advantages and limitations of processing a top-k query by translating it into a single range query that a traditional relational database management system (RDBMS) can process efficiently. In particular, we study how to determine a range query to evaluate a top-k query by exploiting the statistics available to an RDBMS, and the impact of the quality of these statistics on the retrieval efficiency of the resulting scheme. We also report the first experimental evaluation of the mapping strategies over a real RDBMS, namely over Microsoft's SQL Server 7.0. The experiments show that our new techniques are robust and significantly more efficient than previously known strategies requiring at least one sequential scan of the data sets.
High Level Synthesis of Pipelined Datapaths
Authors: Peter Arato, Visegrady Tamas, Istvan Jankovits
Venue:  (2001)

:The CAD tool PIPE has been developed in response to the increased speed requirement and complexity of ASIC executable tasks. High level synthesis offers more complex ASIC design solutions, now emerging in academic and industrial design environments. In this timely resource, the applicability of the PIPE tool is considered in the context of the field towards hardware / software co--design and system level synthesis. Increasing interest in high-level logic synthesis as designs with 200 million transistors on a single chip become commonplace Step-by-step tutorial in the CAD tool "PIPE", illustrating the applications potential, including the advantages, drawbacks and benchmark results Supplementary CD-ROM including synthesis subroutines and benchmarksProfessional hardware engineers and researchers who are familiar with high level synthesis or related topics would find this to be a valuable reference resource. Also, MSc and PhD students studying or researching high level synthesis or related topics could use the book as a tutorial text to accompany existing works on this rapidly evolving topic.
Optimal Control of a Class of Linear Hybrid Systems with Saturation
Authors: Bart De Schutter
Venue: SIAM Journal on Control and Optimization (2000)

We consider a class of first order linear hybrid systems with saturation. A system that belongs to this class can operate in several modes or phases; in each phase each state variable of the system exhibits a linear growth until a specified upper or lower saturation level is reached, and after that the state variable stays at that saturation level until the end of the phase. A typical example of such a system is a traffic signal controlled intersection. We develop methods to determine optimal switching time sequences for first order linear hybrid systems with saturation that minimize criteria such as average queue length, worst case queue length, average waiting time, and so on. First we show how the extended linear complementarity problem (ELCP), which is a mathematical programming problem, can be used to describe the set of system trajectories of a first order linear hybrid system with saturation. Optimization over the solution set of the ELCP then yields an optimal switching time sequence. Although this method yields globally optimal switching time sequences, it is not feasible in practice due to its computational complexity. Therefore, we also present some methods to compute suboptimal switching time sequences. Furthermore, we show that if there is no upper saturation, then for some objective functions the globally optimal switching time sequence can be computed very efficiently. We also discuss some approximations that lead to suboptimal switching time sequences that can be computed very efficiently. Finally, we use these results to design optimal switching time sequences for traffic signal controlled intersections.
Complex Systems
Authors: David G. Green, Terry R. Bossomaier
Venue:  (1999)

:"This book explores the field of complexity. It features in-depth coverage of important theoretical ideas, including fractals, chaos, non-linear dynamics, artificial life and self-organisation. It also provides overviews of complexity in several applied areas, including parallel computation, control systems, neural systems and ecosystems. Some of the properties that best characterise complex systems, including algorithmic richness, non-linearity and abundant interactions between components, are examined. In this way the book draws out themes, especially the ideas of connectivity and natural computation, that reveal deep, underlying similarities between phenomena that have formerly been treated as completely distinct. The idea of natural computation is particularly rich in fresh approaches applicable to both biology and computing. Analogies such as the DNA code as life's underlying program, or organisms as automata, are very compelling. Conversely, biologically inspired ideas such as cellular automata, genetic algorithms and neural networks are at the forefront of advanced computing."--BOOK JACKET.
Block-Iterative Algorithms with Underrelaxed Bregman Projections
Authors: Yair Censor, Gabor T. Herman
Venue: SIAM Journal on Optimization (2002)

The notion of relaxation is well understood for orthogonal projections onto convex sets. For general Bregman projections it was considered only for hyperplanes, and the question of how to relax Bregman projections onto convex sets that are not linear (i.e., not hyperplanes or half-spaces) has remained open. A definition of the underrelaxation of Bregman projections onto general convex sets is given here, which includes as special cases the underrelaxed orthogonal projections and the underrelaxed Bregman projections onto linear sets as given by De Pierro and Iusem [J. Optim. Theory Appl., 51 (1986), pp. 421--440]. With this new definition, we construct a block-iterative projection algorithmic scheme and prove its convergence to a solution of the convex feasibility problem. The practical importance of relaxation parameters in the application of such projection algorithms to real-world problems is demonstrated on a problem of image reconstruction from projections.
A Conjugate Points Theory for a Nonlinear Programming Problem
Authors: H. Kawasaki
Venue: SIAM Journal on Control and Optimization (2001)

The conjugate point is an important global concept in the calculus of variations and optimal control. In these extremal problems, the variable is not a vector in Rn but a function. So a simple and natural question arises. Is it possible to establish a conjugate points theory for a nonlinear programming problem, Min f(x) on x\in R^n$? This paper positively answers this question. We introduce the Jacobi equation and conjugate points for the nonlinear programming problem, and we describe necessary and sufficient optimality conditions in terms of conjugate points.
MCSE IIS 4 Ace It!: Exam 70-87, 1st edition
Authors: David Iseminger
Venue:  (2002)

:This exam-focused book targets candidates who want to achieve the MCSE + Internet or MCP + Internet certification from Microsoft. Its rich feature set includes a full practice exam, Official Word and Inside Scoop chapters, and Ace Card reviews.
Visual Guide to Paradox for Windows: The Pictorial Companion to Windows Database Management and Programming, 1st edition
Authors: Patrick J. Burns, Jan Weingarten, Ted Clifford
Venue:  (1994)

:A uniquely pictorial approach to Paradox. Hundreds of examples and illustrations show how to achieve complex database development with simple drag-and-drop. Users learn how to access and modify database files, use Form and Report Designers and Experts, program with ObjectPal, and more. Disk contains sample macros, forms, reports, tables, queries, and ready-to-use database.
Generating compact code from dataflow specifications of multirate signal processing algorithms
Authors: Shuvra S. Bhattacharyya, Joseph T. Buck, Soonhoi Ha, Edward A. Lee
Venue: Readings in hardware/software co-design (2001)

Synchronous dataflow (SDF) semantics are well suited to representing and compiling multirate signal processing algorithms. A key to this match is the ability to cleanly express iteration without overspecifying the execution order of computations, thereby allowing efficient schedules to constructed. Due to limited program memory, it is often desirable to translate the iteration in an SDF graph into groups of repetitive firing patterns so that loops can be constructed in the target code. This paper establishes fundamental topological relationships between iteration and looping in SDF graphs, and presents a scheduling framework that provably synthesizes the most compact looping structures for a large class of practical SDF graphs. By modularizing different components of the scheduling framework, and establishing their independence, we show how other scheduling objectives, such as minimizing data buffering requirements or increasing the number of data transfers that occur in registers, can be incorporated in a manner that does not conflict with the goal of code compactness.
Programming in Scheme, 1st edition
Authors: Michael B. Eisenberg
Venue:  (1993)

:"With this book you can learn to write good programs that do interesting things right off the bat," writes software developer Julie Sussman. "This is the introductory [programming] text that I wish I had had" Scheme - a simple, learnable dialect of LISP has emerged as a popular educational language as well as a serious tool for producing applications and system software. Programming in Scheme provides an accessible introduction to Scheme that assumes no previous programming experience and covers all the basics of the language and many advanced topics as well. It gets readers on the machine early, teaches language structure and programming technique through extended examples an exercises, and emphasizes debugging throughout. Chapters are organized as a series of groups, or "layers," each of which advances the reader to a new level in Scheme. The first layer (chapters 2-7) introduces Scheme procedures - how to define, use, and debug them. The second layer (chapters 8-10) discusses lists and subprocedures. The third layer (chapters 11-15) provides a more elaborate and powerful model of the Scheme language. These last chapters also explore the notion of first-class procedure objects, one of the most fascinating ideas in computer science. Appendixes contain an Edwin mini-manual, answers to selected exercises, references and bibliography. Michael Eisenberg is a Ph.D candidate in Computer Science at MIT. Harold Abelson is Associate Professor of Computer Science and Engineering at MIT.
Internet and World Wide Web: How to Program with Cdrom, 1st edition
Authors: Harvey M. Deitel, T. R. Nieto
Venue:  (1999)

:Authors Harvey and Paul Dietel are the principals of Deitel & Associates, Inc., the internationally-recognized training and consulting organization specializing in Java, C++, C, Visual Basic® , object technology, and Internet and World Wide Web programming training. They are also the authors of the best-selling college-level textbooks including C++ How to Program (2/e), Java How to Program (3/e), C How to Program (2/e) and Visual Basic® 6 How to Program. The Deitels and their colleague Tem Nieto introduce the fundamentals of Internet and World Wide Web programming. Key topics include: Client-side and server-side scripting, objects HTML, JavaScript/Jscript, VBScript Activex Controls, graphics, GUI, events Database: SQL, ADO, RDS, data binding Electronic commerce, SSL, SET, cryptography ASP, Perl/CGI, Servlets Dynamic HTML, XML Multimedia, animation Audio, video, speech PWS, IIS, Apache, Jigsaw Internet and World Wide Web How to Program include: Hundreds of "live-code" programs with screen captures that show exact outputs Extensive exercises (many with answers) accompanying every chapter Hundreds of tips, recommended practices and cautions-marked with these icons Internet and World Wide Web How to Program is the centerpiece of a family of resources for teaching and learning Internet and World Wide Web programming, including a Web site (...
Crisis Investing for the Year 2000: How to Profit from the Coming Y2K Computer Crash.
Authors: L. Jay Kuo, Edward M. Dua
Venue:  (1999)

:Predicting that the stock market will drop sharply in anticipation of the Y2K crisis, two financial experts show how investors can take advantage of the impending disaster. Illustrations.
Optical Character Recognition for Cursive Handwriting
Authors: Nafiz Arica, Fatos T. Yarman-Vural
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

In this paper, a new analytic scheme, which uses a sequence of segmentation and recognition algorithms, is proposed for offline cursive handwriting recognition problem. First, some global parameters, such as slant angle, baselines, and stroke width and height are estimated. Second, a segmentation method finds character segmentation paths by combining gray scale and binary information. Third, Hidden Markov Model (HMM) is employed for shape recognition to label and rank the character candidates. For this purpose, a string of codes is extracted from each segment to represent the character candidates. The estimation of feature space parameters is embedded in HMM training stage together with the estimation of the HMM model parameters. Finally, the lexicon information and HMM ranks are combined in a graph optimization problem for word-level recognition. This method corrects most of the errors produced by segmentation and HMM ranking stages by maximizing an information measure in an efficient graph searchalgorithm. The experiments in dicate higher recognition rates compared to the available methods reported in the literature.
Real World PhotoShop 6
Authors: David Blatner, Bruce Fraser
Venue:  (2001)

:A brand new edition of the definitive guide to industrial-strength Photoshop techniques!Real World Photoshop 6 is the only book that explicitly covers the prepress, color, and production issues that Photoshop users deal with on a daily basis. It explains in clear language the essential concepts and techniques for producing professional quality images quickly and efficiently, covering in depth the key Photoshop toolsnot just how to use them, but also why and when. Richly illustrated in full-color throughout, this book is entirely updated to cover the new features of Photoshop 6, and is destined to become a well-thumbed reference for graphic designers, illustrators, and production professionals.
Fresh Ideas in Letterhead and Busines Card Design, 4th edition
Authors: Gail Deibler Finke, Lisa Buchanan
Venue:  (2002)

:In letterhead and business card design, producing nice layouts and stunning graphics is only half the battle. Solving your clients' design problems is the other half. This book features 116 designs that are graphically impressive AND conceptually fit!