ppxscal/embedding_network huggingface dataset:
Adobe Illustrator 10: The Complete Reference
Authors: Sandra E. Eddy
Venue:  (2002)

:Bring your creative ideas to fruition with the most powerful, flexible vector graphics tool available. Conjure and manipulate shapes, work with Illustrator color models, and discover the vast print and Web graphics capabilities in the latest upgrade to this popular application. Author Sandra E. Eddy leads you through all the rendering essentials -- plus special effects, typography, layers, transparency, and integration with other applications. Replete with professional-level information, Adobe Illustrator 10: The Complete Reference will help you expertly navigate the Illustrator workspace, take advantage of its numerous features, and might even improve your drawing skills along the way.
Inversion of Analytic Matrix Functions That are Singular at the Origin
Authors: Konstantin E. Avrachenkov, Moshe Haviv, Phil G. Howlett
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

In this paper we study the inversion of an analytic matrix valued function A(z). This problem can also be viewed as an analytic perturbation of the matrix A0=A(0). We are mainly interested in the case where A0 is singular but A(z) has an inverse in some punctured disc around z=0. It is known that A-1(z) can be expanded as a Laurent series at the origin. The main purpose of this paper is to provide efficient computational procedures for the coefficients of this series. We demonstrate that the proposed algorithms are computationally superior to symbolic algebra when the order of the pole is small.
Designing a distributed computing environment for global-scale systems: challenges and issues
Authors: Rajeev R. Raje, Sivakumar Chinnasamy
Venue: ACM SIGAPP Applied Computing Review (1999)

With the phenomenal growth of the Internet and other related technological advancements in both hardware and software, the field of computing has reached a state, where we need to think ahead and plan for future needs of computing for developing global-scale systems. Unfortunately, the present computing environments have many shortcomings that may act as bottlenecks for the development of the next generation of global information systems. Since the current scenario envisions a major shift in the way of computing and the way in which computers affect lives, we need to look far define the characteristics of a new computing environment that will address the pitfalls of the present alternatives. In this paper, we identify the common characteristics of a network-based distributed computing environment. Various design and implementational issues, associated with such an environment, are analyzed and a few solutions are proposed.
Beyond second-order statistics for learning: A pairwise interaction model for entropy estimation
Authors: Deniz Erdogmus, Jose C. Principe, Kenneth E. Hild,  II
Venue: Natural Computing: an international journal (2002)

Second order statistics have formed the basis of learning and adaptation due to its appeal and analytical simplicity. On the other hand, in many realistic engineering problems requiring adaptive solutions, it is not sufficient to consider only the second order statistics of the underlying distributions. Entropy, being the average information content of a distribution, is a better-suited criterion for adaptation purposes, since it allows the designer to manipulate the information content of the signals rather than merely their power. This paper introduces a nonparametric estimator of Renyi's entropy, which can be utilized in any adaptation scenario where entropy plays a role. This nonparametric estimator leads to an interesting analogy between learning and interacting particles in a potential field. It turns out that learning by second order statistics is a special case of this interaction model for learning. We investigate the mathematical properties of this nonparametric entropy estimator, provide batch and stochastic gradient expressions for off-line and on-line adaptation, and illustrate the performance of the corresponding algorithms in examples of supervised and unsupervised training, including time-series prediction and ICA.
A generic proxy system for networked computer games
Authors: Martin Mauve, Stefan Fischer, Jörg Widmer
Venue: Proceedings of the 1st workshop on Network and system support for games (2002)

In this work-in-progress report we present the general outline of a research project which aims at providing proxy support for networked computer games. The problems of both client-server and fully replicated architectures are discussed and we reason that employing proxy technology, which has been successfully used for other networked applications, is advantageous for this class of applications as well. In particular we describe how a proxy system for networked computer games can help with providing congestion control, achieving robustness, minimizing the impact of network delay and providing fairness.
Upgrading Your PC, 4th edition
Authors: Kris A. Jamsa
Venue:  (2001)

:With over 150000 copies sold of the previous editions, Rescued by Upgrading Your PC, Third Edition continues in the easy to follow step-by- step format, which has made it a Publishers Weekly best seller. 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
Semantic-based delivery of OLAP summary tables in wireless environments
Authors: Mohamed A. Sharaf, Panos K. Chrysanthis
Venue: Proceedings of the eleventh international conference on Information and knowledge management (2002)

With the rapid growth in mobile and wireless technologies and the availability, pervasiveness and cost effectiveness of wireless networks, mobile computers are quickly becoming the normal front-end devices for accessing enterprise data. In this paper, we are addressing the issue of efficient delivery of business decision support data in the form of summary tables to mobile clients equipped with OLAP front-end tools. Towards this, we propose a new on-demand scheduling algorithm, called SBS, that exploits both the derivation semantics among OLAP summary tables and the mobile clients' capabilities of executing simple SQL queries. It maximizes the aggregated data sharing between clients and reduces the broadcast length compared to the already existing techniques. The degree of aggregation can be tuned to control the tradeoff between access time and energy consumption. Further, the proposed scheme adapts well to different request rates, access patterns and data distributions. The algorithm effectiveness with respect to access time and power consumption is evaluated using simulation.
Bifrost inbox organizer: giving users control over the inbox
Authors: Olle Bälter, Candace L Sidner
Venue: Proceedings of the second Nordic conference on Human-computer interaction (2002)

Many email users, especially managers, receive too many email messages to read in the time available to them. The solutions available today often require programming skills on the part of the user to define rules for prioritizing messages or moving messages to folders. We propose a different approach: categorize messages in the inbox with predefined rules that do not require maintenance and are scalable to handle anything from 50 to thousands of messages.
Using Visual Basic in the CS curriculum
Authors: Joe Hummel, Jean Mehta
Venue: ACM SIGCSE Bulletin (2002)

Visual Basic is currently the most popular programming language in the United States. And yet, it is rarely found in traditional Computer Science (and related) curriculums. Perhaps this is due to the fact that VB is not truly object-oriented, but object-based. Or perhaps because VB is not an open language, instead supported only by tools from Microsoft Corporation and available only on the Windows platform. Or perhaps it is simply Microsoft itself, with its monopolistic tendencies.This panel will argue that Visual Basic --- while it should not replace the use of more traditional languages such as C++, Java, or Scheme --- fulfills an important role in modern CS and related curriculums. The panelists will highlight a few of the cases in which they have found VB to be exceedingly useful, and discuss their rationale for choosing VB over other languages.
Java 2: In Plain English, 3rd edition
Authors: Brian Overland, Michael Morrison
Venue:  (2000)

:Written for programmers of all levels, Java&#153 in Plain English is an intelligent, compact guide to the hottest programming language on the Web. Novice Java users will appreciate the books engaging, easy-to-follow style and helpful examples. Advanced programmers will discover a concise reference designed to make finding information quick and painless. The book provides an introductory tour of Java, a complete A&#150Z reference of all Java keywords, functions, and terms; a Java API reference with classes for applets, animation, graphics, threads, and exceptions; in-depth coverage of the latest Java 1.1 features; useful bits of expert advice; and much more.
Filtering for Linear Systems Driven by\linebreak Fractional Brownian Motion
Authors: N. U. Ahmed, C. D. Charalambous
Venue: SIAM Journal on Control and Optimization (2002)

In this paper we study continuous time filtering for linear multidimensional systems driven by fractional Brownian motion processes. We present the derivation of the optimum linear filter equations which involve a pair of functional-differential equations giving the optimum error covariance (matrix-valued) functions and the optimum filter. These equations are the appropriate substitutes of the matrix-Riccati differential equation arising in classical Kalman filtering. However, the optimum filter has the classical appearance, and, as usual, it is driven by the increments of the observed process.
Recursion in logics of programs
Authors: David Harel
Venue: Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1979)

The problem of reasoning about recursive programs is considered. Utilizing a simple analogy between iterative and recursive programs viewed as unfinite unions of finite terms, we carry out an investigation analogous to that carried out recently for iterative programs. The main results are the arithmetical completeness of axiom systems for (1) context-free dynamic logic and (2) its extension for dealing with infinite computations. Having the power of expression of these logics in mind, these results can be seen to supply (as corollaries) complete proof methods for the various kinds of correctness of recursive programs.
A user-oriented computer graphics system
Authors: Udo W. Pooch
Venue: ACM SIGGRAPH Computer Graphics (1976)

A user-oriented Computer Graphics System (CGS) is described, which primarily has been designed to aid the application programmer, and not just the sophisticated computer graphics user. The system has been designed to provide a very simple interaction capability, where the interaction is based on a variety of input devices and a simple input/output graphics command language. The result of this system has been an increase in programming efficiency, reduction in span time from creations of design to actual implementation. Typical application developments have included such system as flowcharting systems, Computer Aided Architectural Space Planning, Animation, Vehicle-Pedestrian Interactions, Computer-aided designs, and the simulation of the NASA Space Shuttle.
Understanding Neural Networks: Computer Explorations: A Workbook in Two Volumes with Software for the MacIntosh and PC Compatibles
Authors: Maureen Caudill, Charles Butler
Venue:  (1994)

:Understanding Neural Networks is a textbook and workbook that provides a unique interactive learning environment. With or without the aid of a classroom instructor, it allows students and other users to learn about neural networks while gaining practical, hands-on experience with all of the leading network models. Each model is presented as realistically as possible. Also included are chapter exercises and questions, many with illustrations. The key feature of this workbook is the software. Available for PC-ATs and compatibles and the Macintosh, these disks contain a collection of full-featured commercial-quality simulators for the most important network paradigms. The user interface is graphic and easy to use, and the simulators are consistent across all networks. The simulators can also build and train significantly large networks, allowing users to construct networks on their own with data relevant to their problems. Volume 1 covers learning, attractor networks, and hierarchical networks (including back-propagation networks). Volume 2 takes up temporal networks (including recurrent networks), self-organizing networks, higher-order networks, and such new directions in neural networks as fuzzy networks and evolutionary networks. Both volumes contain instructions on how to use the workbook, an introduction, appendixes, a table of random numbers, a glossary, a bibliography, and index. Maureen Caudill is a consultant on neural networks in San Diego. Charles Butler is Senior Principal Scientist at Physical Sciences in Alexandria, Virginia. He is a specialist in the development of neural-network applications. They are the authors of Naturally IntelligentSystems, a comprehensive nonmathematical introduction to neural networks.
Teach Yourself More Visual Basic in 21 Days, 1st edition
Authors: Lowell Mauer, Ori Gurewich
Venue:  (1998)

:Master Internet programming and ActiveX documents; find out what new controls have been added to the Toolbox; incorporate online help in your applications; learn expert tips and tricks for Visual Basic programming; make your applications run better and faster; add character to your applications with graphics and text; learn to design and create a database; and uncover ways to incorporate Crystal Reports into your applications.
Mastering Microsoft Outlook 98
Authors: Gini Courter, Annette Marquis
Venue:  (1998)

:Microsoft Outlook 98 promises PC users a great boost in their personal and business productivity. Mastering Microsoft Outlook 98 delivers on this promise by showing you how to take advantage of all the features that will make Outlook the center of your daily computing activities. This complete resource is the book for all Outlook users - first-timers, upgraders, and developers alike. You will find answers to all your questions about this powerful Personal Information Manager, whether you use it at home or as a Microsoft Exchange client in your workplace.
Oracle Database Administration: The Essential Reference
Authors: David Kreines, Brian Laskey
Venue:  (1999)

:The Oracle database administrator (DBA) performs a vitally important set of tasks at an Oracle site: database monitoring, backup and recovery, troubleshooting, and tuning for reliability and performance. The DBA also plays a role in initial database design, system configuration, installation, and security planning. This book provides a quick reference to the myriad details an Oracle DBA needs on a day-to-day basis to help do his or her job well. Part I (Chapters 1 to 7) of this book provides essential information and examples of how to perform a variety of critical DBA functions. The information in this section is presented in roughly the same sequence that these functions would be performed as the DBA plans and implements a new Oracle installation. Part II (Chapters 8 to 17) provides detailed reference information (command syntax, etc.) needed to perform DBA functions. This is a book for DBAs, written by DBAs  the single, definitive reference book of choice. If you must choose only one book to use at the office, to have at home, and to carry to a site you are troubleshooting, this will be that book.
Graphic and relational data base support for problem solving
Authors: Dan Weller, Robin Williams
Venue: ACM SIGGRAPH Computer Graphics (1976)

This paper describes a general purpose 'picture building system'. The main purpose of the system is to provide an environment wherein an application programmer can interactively create and modify applications. In addition to a graphics software package the picture building system provides high-level application building tools and a relational data base as integral parts of the system. An interpreter is provided to draw pictures from data stored in relations. A correlation handler is provided to allow a user to identify and manipulate displayed items. A relations editor is provided to interactively create, edit, and display relations. The picture building system works on a variety of graphic and nongraphic terminals.
Watch It: The Risks and Promises of Information Technologies for Education
Authors: Nicholas C. Burbules, Thomas Callister
Venue:  (1999)

:This book takes a close look at the complex and contradictory consequences of new technologies in the classroom. In a series of interrelated essays, the authors explore such issues as access, credibility, new approaches to reading and writing, the glut of information, privacy, censorship, commercialization, and online community.
A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
Authors: Florian A. Potra, Rongqin Sheng
Venue: SIAM Journal on Optimization (1998)

A primal-dual infeasible-interior-point path-following algorithm is proposed for solving semidefinite programming (SDP) problems. If the problem has a solution, then the algorithm is globally convergent. If the starting point is feasible or close to being feasible, the algorithm finds an optimal solution in at most $O(\sqrt{n}L)$ iterations, where n is the size of the problem and L is the logarithm of the ratio of the initial error and the tolerance. If the starting point is large enough, then the algorithm terminates in at most O(nL) steps either by finding a solution or by determining that the primal-dual problem has no solution of norm less than a given number. Moreover, we propose a sufficient condition for the superlinear convergence of the algorithm. In addition, we give two special cases of SDP for which the algorithm is quadratically convergent.
Digerati,Glitterati: High-Tech Heroes
Authors: Christopher Langdon, David Manners
Venue:  (2001)

:Discover the inspiration and motivation of the gifted few....... The intellectual power of the high-tech industry is awesome - but so are the egos. To keep people working together productively requires an individual style of management, and at the top of these companies are a new breed of executives. Their attitudes to work create fluid cultures where nothing is sacred and everything is open to challenge. The Digerati Glitterati are a select group of the most admired leaders in this remarkable world. Several have founded great companies, while others have transformed existing organisations into world leaders or blazed entrepreneurial trails for others to follow. Some are just beginning to leave their dynamic individual mark. All have a story to tell and priceless advice to offer. The Digerati Glitterati are: Hermann Hauser, Acorn Andrew Rickman, Bookham Technology Malcolm Miller, Pace Micro Technology Robin Saxby, ARM Gordon Moore, Intel Ulrich Schumacher, Infineon Jorma Ollila, Nokia Sir Clive Sinclair, Sinclair Research Pasquale Pistorio, STMicroelectronics Dick Skipworth, Memec David Potter, Psion Hans Snook, Orange Now, the Digerati Glitterati reveal the inside secrets of what it takes to build great companies. In candid interviews they explain how, why and when they got started, how they conceived the idea for their businesses and sold it to others, what motivated them, what kept them going in adversity and how they overcame their biggest challenges. When they speak, smart people listen.
Self-stabilizing mutual exclusion using tokens in mobile ad hoc networks
Authors: Yu Chen, Jennifer L. Welch
Venue: Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications (2002)

In this paper, we propose a self-stabilizing mutual exclusion algorithm using tokens for mobile ad hoc networks. Our algorithm is based on dynamic virtual rings formed by circulating tokens. We require the topology to be static while the algorithm is converging. But after it has converged, under a restricted mobility assumption, it guarantees both the safety and liveness properties of mutual exclusion; under arbitrary mobility, it cannot guarantee the liveness property, but it does guarantee the safety property.
PC Learning Labs Teaches Word 6.0 for Windows with 3.5 Disk
Authors: Logical Operations, PC Learning Labs Staff
Venue:  (1993)

:PC Learning Labs, the world leader in computer instruction in the classroom, has created an interactive book/disk learning tool that you can use to learn Word 6.0 for Windows at your own pace, in the comfort of your own home or office. Because PC Learning Labs Teaches Word 6.0 for Windows is based on the same classroom training that tens of thousands of beginners have successfully completed at PC Learning Labs sites across the United States, you can be sure that you will learn in the easiest, quickest, and most effective way.
A General Framework for Constructing and Analyzing Mixed Finite Volume Methods on Quadrilateral Grids: The Overlapping Covolume Case
Authors: So-Hsiang Chou, Do Y. Kwak, Kwang Y. Kim
Venue: SIAM Journal on Numerical Analysis (2001)

We present a general framework for constructing and analyzing finite volume methods applied to the mixed formulation of second-order elliptic problems on quadrilateral grids. The control volumes, or covolumes, in the grids overlap. An overlapping finite volume method of this type was first introduced by Russell in [T. F. Russell, Tech. report 3, Reservoir Simulation Research Corp., Tulsa, OK, 1995] and was tested for a variety of problems on rectangular and quadrilateral grids in [Z. Cai et al., Comput Geosci., 1 (1997), pp. 289--315]. Later in [S. H. Chou and D. Y. Kwak, SIAM J. Numer. Anal., 37 (2000), pp. 758--771], Chou and Kwak reformulated it as their mixed covolume method and proved optimal order error estimates using the covolume methodology from [S. H. Chou, Math. Comp., 66 (1997), pp. 85--104] and [S. H. Chou and D. Y. Kwak, SIAM J. Numer. Anal., 35 (1998), pp. 494--507]. However, their treatment was restricted to the case of diagonal coefficient tensor and rectangular grids since a different approach was needed for the quadrilateral (distorted rectangular) case. In this paper we give a new framework, which can handle not only the rectangular anisotropic case but also the anisotropic and irregular grid cases in which the locally supported test functions are images of the natural unit coordinate vectors under the Piola transformation. Our theory sheds light on how to create new test functions using quadratures and now covers Russell's quadrilateral case.
An Analysis of Sparse Approximate Inverse Preconditioners for Boundary Integral Equations
Authors: Ke Chen
Venue: SIAM Journal on Matrix Analysis and Applications (2000)

Preconditioning techniques for dense linear systems arising from singular boundary integral equations are described and analyzed. A particular class of approximate inverse based preconditioners related to the mesh neighbor methods is known to be efficient. This paper shows that it is an operator splitting preconditioner and clusters eigenvalues for the normal equation matrix thus ensuring a fast convergence of the conjugate gradient normal method. Clustering of the eigenvalues of the preconditioned matrix and fast convergence of the generalized minimal residual method are also observed. For the type of problems considered, we demonstrate a crucial connection between two essential features of eigenvalue clustering for a sparse preconditioner---approximate inversion for a small cluster radius and operator splitting for a small cluster size. Experimental results from several boundary integral equations are presented.