ppxscal/embedding_network huggingface dataset:
Quicken 2001 Fast and Easy
Authors: Coletta Witherspoon, Craig Witherspoon
Venue:  (2000)

:Quicken is the most popular personal finance program available. It allows users to bank online, track 401K contributions and earnings, set up accounts and enter transactions, pay bills, and transfer funds. Quicken 2001 Fast & Easy is a great tool for anyone who is familiar with a previous version of Quicken and wants to get up to speed quickly with the new version. The Fast & Easy approach gives you a low-cost, high-value method to personal finance management.
Linear Point Sets and R&eacute;dei Type k-blocking Sets in PG(n, q)
Authors: L. Storme, P. Sziklai
Venue: Journal of Algebraic Combinatorics: An International Journal (2001)

In this paper, i>k-blocking sets in i>PG(i>n, i>q), being of R&eacute;dei type, are investigated. A standard method to construct R&eacute;dei type i>k-blocking sets in i>PG(i>n, i>q) is to construct a cone having as base a R&eacute;dei type i>k&prime;-blocking set in a subspace of i>PG(i>n, i>q). But also other R&eacute;dei type i>k-blocking sets in i>PG(i>n, i>q), which are not cones, exist. We give in this article a condition on the parameters of a R&eacute;dei type i>k-blocking set of i>PG(i>n, i>q &equals; i>pi>h), i>p a prime power, which guarantees that the R&eacute;dei type i>k-blocking set is a cone. This condition is sharp. We also show that small R&eacute;dei type i>k-blocking sets are linear.
On quasi-thin association schemes
Authors: Mitsugu Hirasaka, Mikhail Muzychuk
Venue: Journal of Combinatorial Theory Series A (2002)

An association scheme (or simply, a scheme) is called thin if each of its basic relations has valency 1. It is easy to see that thin schemes can be viewed as groups and, conversely, groups can be seen as thin schemes. In the present paper, we investigate schemes the basic relations of which have valency 1 or 2. We call these schemes quasi-thin. In order to formulate our results we let (X, R) denote a scheme (in the sense of P.-H. Zieschang). We first offer three sufficient conditions for (X,R) to have an automorphism group acting transitively on X. These conditions are (i) Oθ(R) ∩ Oθ(R) = {1}, (ii) nOθ(R) = 2, (iii) R possesses an element r such that 〈r〉 = R and 〈rr*〉 = 〈r*r〉). We then prove that, if Oθ(R) = Oθ(R) and nOθ(R) = 4, |X|/4 ∈ {3,4,7,8,12,16}. As a consequence of the latter result, we obtain a classification of the quasi-thin schemes with |X|=4p, where p is a prime number.
Peter Norton's Complete Guide to PC Upgrades, 2nd edition
Authors: Peter Norton, Michael Desmond
Venue:  (1999)

:Peter Norton's Guide to Upgrading and Repairing PCs Second Edition explains how each component of a PC functions and how they function together. With coverage of all of the latest technologies including the entire Pentium II family (Celeron and Zeon), DVD, USB, Firewire, and v.90 modems it hits all of the technologies that go into PCs today. With updated coverage for Windows 98, new motherboard and memory technologies as well as more troubleshooting and detailed step by step installation information, this new edition will be a solid improvement on an already proven quality book. The Second Edition will feature the same great approach that begins with each chapter explaining the underlying technology. With a good understanding of the technology, the reader can then move into the pros and cons of the upgrades being discussed, step by step installation instructions, and troubleshooting procedures.
ECAI 96: 12th European Conference on Artificial Intelligence, August 11-16, 1996, Budapest, Hungary: Proceedings, 6th edition
Authors: Wolfgang Wahlster
Venue:  (1999)

:EOAI 96 August 11-16, 1996, Budapest, Hungary Proceedings Edited by Wolfgang Wahlster German Research Center for AI (DFKI), Germany The 12th European Conference on Artificial Intelligence, held in Budapest, Hungary, in August 1996, attracted 450 submissions from 41 different countries. The International Programme Committee selected 133 papers, which are presented in this volume, organized into 15 sections. With an acceptance rate of 29%, ECAI 96 was one of the most selective general AI conferences of 1996. The aim of the conference is to cover all aspects of AI, and to bring together basic and applied research. Important areas of Automated Reasoning are covered, such as Abductive, Temporal, Causal, Non-monotonic, Constraint-based, Case-based, Model-based, Qualitative, and Spatial Reasoning. Core subjects like Machine Learning, Knowledge Representation, Multi-Agent Systems, Natural Language Processing, Planning, Robotics and Vision are given extensive treatment. The proceedings also contains summaries of the four invited talks.
The Sample Average Approximation Method for Stochastic Discrete Optimization
Authors: Anton J. Kleywegt, Alexander Shapiro, Tito Homem-de-Mello
Venue: SIAM Journal on Optimization (2002)

In this paper we study a Monte Carlo simulation--based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and the expected value function is approximated by the corresponding sample average function. The obtained sample average optimization problem is solved, and the procedure is repeated several times until a stopping criterion is satisfied. We discuss convergence rates, stopping rules, and computational complexity of this procedure and present a numerical example for the stochastic knapsack problem.
Alternating Plane Smoothers For Multiblock Grids
Authors: Ignacio M. Llorente, Boris Diskin, N. Duane Melson
Venue: SIAM Journal on Scientific Computing (2000)

Standard multigrid methods are not well suited for problems with anisotropic discrete operators, which can occur, for example, on grids that are stretched in order to resolve a boundary layer. One of the most efficient approaches to yield robust methods is the combination of standard coarsening with alternating-direction plane relaxation in the three dimensions. However, this approach may be difficult to implement in codes with multiblock structured grids because there may be no natural definition of global lines or planes. This inherent obstacle limits the range of an implicit smoother to only the portion of the computational domain in the current block. This report studies in detail, both numerically and analytically, the behavior of blockwise plane smoothers in order to provide guidance to engineers who use block-structured grids. The results obtained so far show alternating-direction plane smoothers to be very robust, even on multiblock grids. In common computational fluid dynamics multiblock simulations, where the number of subdomains crossed by the line of a strong anisotropy is low (up to four), textbook multigrid convergence rates can be obtained with a small overlap of cells between neighboring blocks.
Markets for attention: will postage for email help?
Authors: Robert E. Kraut, James Morris, Rahul Telang, Darrin Filer, Matt Cronin, Shyam Sunder
Venue: Proceedings of the 2002 ACM conference on Computer supported cooperative work (2002)

Balancing the needs of information distributors and their audiences has grown harder in the age of the Internet. While the demand for attention continues to increase rapidly with the volume of information and communication, the supply of human attention is relatively fixed. Markets are a social institution for efficiently balancing supply and demand of scarce resources. Charging a price for sending messages may help discipline senders from demanding more attention than they are willing to pay for. Price may also help recipients estimate the value of a message before reading it. We report the results of two laboratory experiments to explore the consequences of a pricing system for electronic mail. Charging postage for email causes senders to be more selective and send fewer messages. However, recipients did not use the postage paid by senders as a signal of importance. These studies suggest markets for attention have potential, but their design needs more work.
Excel 2000 Fast and Easy, 1st edition
Authors: Faithe Wempen, Richard Cravens
Venue:  (1999)

:A highly visual, easy-to-use format teaches features most useful to average users and allows them to follow from beginning to end to master all the basic skills. Includes installation instructions and comprehensive glossary.
A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems
Authors: Paul Armand, Jean Charles Gilbert, Sophie Jan-Jégou
Venue: SIAM Journal on Optimization (2000)

We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generates feasible iterates and consists in computing approximate solutions of the optimality conditions perturbed by a sequence of positive parameters $\mu$ converging to zero. We prove that it converges q-superlinearly for each fixed $\mu$. We also show that it is globally convergent to the analytic center of the primal-dual optimal set when $\mu$ tends to 0 and strict complementarity holds.
As/400 Concepts and Facilities, 2nd edition
Authors: Tony Baritz, David Dunne
Venue:  (1993)

:This thorough revision of the bestselling guide to developing and coding business applications on the AS/400 features these new IBM releases,as well as eight entirely new chapters covering the latest developments in operations,IBM and third-party tools,PC and mainframe connectivity,performance tuning,and more. In addition,all of the chapters in the book have been carefully updated to reflect new software developments in RPG and CODE/400. AS/400 Concepts and Facilities provides programmers,consultants,systems analysts,and DP managers with a practical introduction to this midrange system and demonstrates exactly how it works and what it can do. It includes detailed coverage of such key topics as: navigating the AS/400; using CL (Command Language) and common functions; creating a database and running reports and queries; using development tools like the Source Entry Utility (SEU) and the Data File Utility (DFU); integrating applications,communications,and migration; and much more. In addition,the book is filled with sound methods and real code examples that will help users code actual business applications with ease.
New Perspectives on Microsoft Word 2000 - Brief, 1st edition
Authors: S. Scott Zimmerman, Ann Shaffer, Beverly B. Zimmerman
Venue:  (1999)

:Part of our New Perspectives Series, this text offers a case-oriented, problem-solving approach for learning word processing. As a Brief title, this text covers the essential features of Microsoft Word 2000  from creating, editing and formating a document to creating multiple-page reports with tables.
Beginning Perl for Bioinformatics, 1st edition
Venue:  (2001)

:With its highly developed capacity to detect patterns in data, Perl has become one of the most popular languages for biological data analysis. But if you're a biologist with little or no programming experience, starting out in Perl can be a challenge. Many biologists have a difficult time learning how to apply the language to bioinformatics. The most popular Perl programming books are often too theoretical and too focused on computer science for a non-programming biologist who needs to solve very specific problems. Beginning Perl for Bioinformatics is designed to get you quickly over the Perl language barrier by approaching programming as an important new laboratory skill, revealing Perl programs and techniques that are immediately useful in the lab. Each chapter focuses on solving a particular bioinformatics problem or class of problems, starting with the simplest and increasing in complexity as the book progresses. Each chapter includes programming exercises and teaches bioinformatics by showing and modifying programs that deal with various kinds of practical biological problems. By the end of the book you'll have a solid understanding of Perl basics, a collection of programs for such tasks as parsing BLAST and GenBank, and the skills to take on more advanced bioinformatics programming. Some of the later chapters focus in greater detail on specific bioinformatics topics. This book is suitable for use as a classroom textbook, for self-study, and as a reference. The book covers: Programming basics and working with DNA sequences and strings Debugging your code Simulating gene mutationsusing random number generators Regular expressions and finding motifs in data Arrays, hashes, and relational databases Regular expressions and restriction maps Using Perl to parse PDB records, annotations in GenBank, and BLAST output
Human Factors in Information Systems
Authors: Edward J. Szewczak, Edward H
Venue:  (2002)

:Many factors contribute to the way people view and use information, including task requirements, organizational settings, and personality characteristics. Today it is generally accepted that people are an integral element of an information system. System development methodologies include various kinds of people -- managers, analysts, programmers, support staff -- in the development process. IT could be wasted if various aspects of human behavior were not seriously accommodated. Human Factors in Information Systems addresses pertinent issues by including the most recent research in the discipline, which can be utilized by businesses and organizations when implementing information systems into their policies, procedures and daily tasks.
Advanced RenderMan: Creating CGI for Motion Picture, 1st edition
Authors: Anthony A. Apodaca, Larry Gritz
Venue:  (1999)

:Introduced by Pixar Studios over a decade ago, the RenderMan Interface Specification is the dominant standard for sending data to the leading rendering programs used by 3D artists and animators. But users are hampered by the lack of authoritative, up-to-date information on applying the standard, having long had to rely on the ten-year-old RenderMan Companion and a far-flung collection of course notes and Web sites. Advanced RenderMan: Beyond the Companion is precisely what RenderMan users are dying for. It offers thoroughly updated coverage while moving beyond the original work's scope to provide in-depth information on dozens of advanced topics. Both a reference and a tutorial, this book will be indispensable to graphics programmers, modelers, animators, technical directors, and hobbyists-it is truly the key to their ability to achieve state-of-the-art 3D effects. Key Features: Written by the world's foremost RenderMan experts-key figures at Pixar, the company that developed and first implemented the standard Offers advanced users instruction not available anywhere else while providing a leg up to relative beginners-including tips on avoiding mistakes and an appendix covering key math skills. Filled with technical illustrations and many full-color representations of effects supported by the RenderMan standard Via a companion Web site, provides comprehensive documentation of the standard's semantics and syntax, example source code, shaders and other software, and the full set of SIGGRAPH course notes on RenderMan
High-Performance VLSI Signal Processing: Innovative Architectures and Algorithms, 1st edition
Authors: K. J. Ray Liu, Kung Yao
Venue:  (1997)

:Electrical Engineering/Signal Processing High-Performance VLSI Signal Processing Innovative Architectures and Algorithms Volume 2 Systems Design And Applications The second volume in a two-volume set, High-Performance VLSI Signal Processing: Innovative Architectures and Algorithms brings together the most innovative papers in the field, focused introductory material, and extensive references. The editors present timely coverage of the latest design tools, design environments, and implementations of VLSI signal processing systems. These volumes will serve as vital resources for engineers who want a comprehensive knowledge of the extremely interdisciplinary field of high-performance VLSI processing. The editors provide a practical understanding of the merits of total system design through an insightful, synergistic presentation of methodology, architecture, and infrastructure. Each volume features:*Major papers that span the wide range of research areas in the field*Chapter introductions including historical perspectives*Numerous applications-oriented design examples*Coverage of current and future technological trends
Generic operational decomposition for concurrent systems: semantics and reflection
Authors: Annie Marcoux, Christine Maurel, Frédéric Migeon, Patrick Sallé
Venue: Progress in computer research (2001)

We present in this article reflection in concurrent languages, and in particular, in PlasmaII which is an implementation of the actor model defined by C. Hewitt and G. Agha. We propose to implement structural and behavioural reflection with an approach based on a fine-grained decomposition of actors management. In this reflective architecture, the actor life cycle is described as a system of cooperative elementary entities that can be easily changed. This approach provides the user with an expressive and concise description of reflective programs. The paper describes this architecture and how it is used to fit various paradigms of concurrent systems such as the actor model of Hewitt and Agha. We also present several examples and emphasize the components specialization leading to black-board communication, ported-object system, or rendezvous synchronization. We also use the semantics of Agha's actors to formalize components cooperation and its ability to treat concrete examples. We compare our approach to others such as facets of CodA or Meta-Interpreters and Meta-Object of ABCL/R3
Summoner
Authors: Prima Temp Authors, Eric Winding
Venue:  (2000)

:After summoning a powerful demon, which destroyed his home village, Joseph wandered alone until receiving a quest to find a series of ancient rings. Joined by a thief, a lady of high society, and a victim of his past mistakes, Joseph sets out into a hostile world to achieve his quest and make peace with his own demons. Its a world you wont want to enter on your own. SUMMONER: PRIMAS OFFICIAL STRATEGY GUIDE will hold your hand through the world of darkness, show you how to get the most out of your traveling companions, explain the mystic puzzles that cross your path, and -- hopefully - enable you to command the powers of Hell itself. Your guilty conscience, however, is your own problem.
Hierarchical database decomposition: a technique for database concurrency control
Authors: Meichun Hsu, Stuart E. Madnick
Venue: Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems (1983)

The classical approaches to enforcing serializability are the two-phase locking technique and the timestamp ondering technique. Either approach requires that a read operation from a transaction be negistered (in the form of either a read timestamp or a read lock), so that a write operation from a concurrent transaction will not interfere improperly with the read operation. However, setting a lock or leaving a timestamp with a data element is an expensive operation. The purpose of the current research is to seek ways to reduce the overhead of synchronizing certain types of read accesses while achieving the goal of serializability.To this end, a new technique of concurrency control for database management systems has been proposed. The technique makes use of a hierarchical database decomposition, a procedure which decomposes the entire database into data segments based on the access pattern of the update transactions to be run in the system. A corresponding classification of the update transactions is derived where each transaction class is 'rooted' in one of the data segments. The technique requires a timestamp ordering protocol be observed for acesses within an update transaction's own root segment, but enables read accesses to other data segments to proceed without ever having to wait or to leave any trace of these accesses, thereby reducing the overhead of concurrency control. An algorithm for handling ad-hoc read-only transactions in this environment is also devised, which does not require read-only transactions to wait or set any read timestamp.
Minimal Square Spectral Factors via Triples
Authors: M. A. Petersen, A. C. M. Ran
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

We consider the problem of parametrizing the set of square minimal spectral factors of a rational matrix function taking positive semidefinite values on the imaginary axis in terms of invariant subspaces and of the minimal unitary left divisors of a certain unitary function. We shall use an approach which involves null-pole triples.
Numerical Simulation of Oldroyd-B Fluid in a Contraction Channel
Authors: Sha Meng, Xin Kai Li, Gwynne Evans
Venue: The Journal of Supercomputing (2002)

A spectral element method coupled with the elastic viscous split stress technique for computing viscoelastic flows is presented. The rate of deformation tensor is introduced as an additional variable in the momentum equation, but not in the constitutive equation. The nonlinear rheological model, Oldroyd-B, is chosen to simulate the flow of a viscoelastic fluid. Numerical solutions are investigated based on a planar 4:1 abrupt contraction channel flow benchmark problem with different Weissenberg numbers. The results show a good agreement with other numerical predictions.
The logic of a relational data manipulation language
Authors: Marco A. Casanova, Philip A. Bernstein
Venue: Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1979)

A logic for a relational data manipulation language is defined by augmenting a known logic of programs with rules for two new statements: the relational assignment, which assign a relational expression to a relation, and the random tuple selection, which extracts an arbitrary tuple from a relation. The usual operations on relations-retrieve, insert, delete, update-are then defined as special cases of the relational assignment, and the for-each construct scanning a relation tuple by tuple is introduced with the help of the random tuple selection.
Special Edition Using Oracle8/8I, 1st edition
Authors: bn.com review, Joe Duer, David Austin, Willard Baird, Mathew Burke, Nicholas Chase
Venue:  (1999)

:Special Edition Using Oracle8i provides you with a one-stop reference on the latest Oracle database--complete with real-life experiences and practical examples. Key updates that are covered for Oracle8I include SQLJ programming, JavaBeans, CORBA, and Java Virtual Machine. You will learn the fundamentals of Oracle database design, development and administration and progress quickly to using Oracle's tools and products to make these tasks easier and faster. Take advantage of the ultimate database administrator's guide to Oracle8--including coverage of Oracle8i, the Internet-enhanced version of the core database Learn to integrate your database with SAP, Oracle Financials, and Oracle Applications Covers new features such as SQLJ, Java Stored Procedures, the Java virtual machine, interMedia, WebDB, and Oracle's Internet file system (iFS) CD-ROM contains Oracle 8i Personal Edition 8.1 for Windows NT, sample code, and bonus "Oracle on Linux" chapter
Microsoft Outlook 2000 Essential Concepts and Techniques
Authors: Gary B. Shelly, Thomas J. Cashman
Venue:  (1999)

:Part of the highly successful Shelly Cashman Series, this text offers a clear, step-by-step, screen-by-screen approach to learning the basic skills of Microsoft Outlook 2000.