ppxscal/embedding_network huggingface dataset:
Optimal Decomposition of the Domain in Spectral Methods for Wave-Like Phenomena
Authors: Carl Erik Wasberg, David Gottlieb
Venue: SIAM Journal on Scientific Computing (2000)

A strategy for determining the optimal number of grid points and subdomains in a spectral method with domain decomposition on a serial computer is presented. The rapidly growing computational cost for large numbers of grid points in each subdomain is balanced against the exponential convergence for spectral approximation of smooth functions, and the optimum is found as the number of grid points and subdomains that gives the minimal computational cost for a given accuracy. The typical length scale of the problem is found to influence the number of subdomains but not the number of grid points within each subdomain.
Feature Generation Using General Constructor Functions
Authors: Shaul Markovitch, Dan Rosenstein
Venue: Machine Learning (2002)

Most classification algorithms receive as input a set of attributes of the classified objects. In many cases, however, the supplied set of attributes is not sufficient for creating an accurate, succinct and comprehensible representation of the target concept. To overcome this problem, researchers have proposed algorithms for automatic construction of features. The majority of these algorithms use a limited predefined set of operators for building new features. In this paper we propose a generalized and flexible framework that is capable of generating features from any given set of constructor functions. These can be domain-independent functions such as arithmetic and logic operators, or domain-dependent operators that rely on partial knowledge on the part of the user. The paper describes an algorithm which receives as input a set of classified objects, a set of attributes, and a specification for a set of constructor functions that contains their domains, ranges and properties. The algorithm produces as output a set of generated features that can be used by standard concept learners to create improved classifiers. The algorithm maintains a set of its best generated features and improves this set iteratively. During each iteration, the algorithm performs a beam search over its defined feature space and constructs new features by applying constructor functions to the members of its current feature set. The search is guided by general heuristic measures that are not confined to a specific feature representation. The algorithm was applied to a variety of classification problems and was able to generate features that were strongly related to the underlying target concepts. These features also significantly improved the accuracy achieved by standard concept learners, for a variety of classification problems.
Computers, 7th edition
Authors: Larry E. Long, Nancy Long
Venue:  (1999)

:KET BENEFIT:This book personalizes the reader's learning experiences by relating a term or concept to their personal life using a manner that is consistent with everyday conversation. The new edition has been largely rewritten to strike a good balance between efficiency of presentation and content that holds the reader's interest and invites learning. Only concepts critical to general information technology (IT) competency are covered in order to provide the breath of topics necessary to the understanding that is applicable today and in the future.Information Technology in Perspective, Using the PC: Popular Productivity Software, Inside the Computer, Storing and Retrieving Information, Information Input and Output, Networks and Networking, Going Online, The Windows Environment, PC Software For the every Application, Computers in Society: Today, Computers in Society: Tomorrow, Information Systems, Developing Business Information Systems.For anyone interested in learning basic concepts for the PC.
Provocative Awareness
Authors: Bill Gaver
Venue: Computer Supported Cooperative Work (2002)

Recently a number of systems have been designed that connect remote lovers, or strangers in an urban setting. The forms these systems take and the functions they serve may be unfamiliar, but they can be seen as extensions of awareness technologies to new domains. Awareness technologies have often been specialised to give information for particular work activities or relationships. Given that relationships in the home or in local communities tend to be different from those of the workplace, it is appropriate that both the form and content of information conveyed to increase awareness should be different as well. The systems described here, for instance, explore new sensory and interaction possibilities, use ambiguity to increase engagement, and address a wider range of emotional relationships than do most workplace awareness systems. They point to ways of extending notions of peripheral awareness to new domains on the one hand, and possibilities for new forms of workplace awareness on the other.
Enterprise Development with VisualAge for Java, Version 3, 3rd edition
Authors: Dale R. Nilsson, Russell A. Stinehour, Peter M. Jakab, Bill Sarantokos
Venue:  (2000)

:All the tools and skills you'll need to fully utilize the new features of VisualAge for Java, Version 3 Authored by four certified instructors who have taught VisualAge for Java to programmers around the world, this hands-on guide brings you completely up-to-date with the latest features of Version 3. You'll discover how to utilize VisualAge for Java to develop Enterprise JavaBeans, Servlets, Swing components, and much more. You'll also progress through a series of programming examples that will help you master the necessary skills to ace IBM's VisualAge for Java and WebSphere certification exams. With its accessible and comprehensive coverage of key topics, this book will quickly show you how to:*Utilize VisualAge for Java's IDE and Visual Builder*Define JavaBeans with properties, methods, and events*Create complex Java programs using AWT and JFC Swing components*Use Java to access relational databases with JDBC*Build Enterprise JavaBeans, Servlets, and Java Server Pages*Create, test, and debug Enterprise JavaBeansThe CD-ROM includes:*Fully functional version of VisualAge for Java, Version 3 Professional EditionDB2(r) Universal Database, Version 5.2, Personal Edition 60-Day Trial*Samples you need to complete the exercises*Code for all the projects in the book
Computer-Based Exercises for Signal Processing Using MATLAB 5, 1st edition
Authors: James H. McClellen, Alan V. Oppenheim, Ronald W. Schafer
Venue:  (1997)

: Presents many computer-based problems that can be done in conjunction with a course in DSP theory. Projects relate to practical systems and implementations so the reader can learn and understand how DSP is applied. Includes projects and exercises, which make full use of the power of MATLAB v5 to explore conceptual, analytical, and computational issues in digital signal processing. Many projects provide hints to introduce pitfalls, limitations and tricks for getting the most out of MATLAB v5. Discusses both the power and limitations of MATLAB v5 functions and regularly explores the issue of using built-in functions versus developing code to solve problems. Exercises consistently reinforce important problem solving behaviors, such as verifying results, experimenting with parameters as a means of building understanding and intuition, exploring the realism of formulations, comparing theoretical and numerical or measured results, and developing predictions and then comparing them to actual results.
An overview of the sparse basic linear algebra subprograms: The new standard from the BLAS technical forum
Authors: Iain S. Duff, Michael A. Heroux, Roldan Pozo
Venue: ACM Transactions on Mathematical Software (TOMS) (2002)

We discuss the interface design for the Sparse Basic Linear Algebra Subprograms (BLAS), the kernels in the recent standard from the BLAS Technical Forum that are concerned with unstructured sparse matrices. The motivation for such a standard is to encourage portable programming while allowing for library-specific optimizations. In particular, we show how this interface can shield one from concern over the specific storage scheme for the sparse matrix. This design makes it easy to add further functionality to the sparse BLAS in the future.We illustrate the use of the Sparse BLAS with examples in the three supported programming languages, Fortran 95, Fortran 77, and C.
The Complete Idiot's Guide to Project Management with Microsoft Project 2000
Authors: Ron Black, Reich Gardner
Venue:  (2000)

:The Complete Idiot's Guide to Project Management Using Microsoft Project 2000 provides an easy to use source of answers for all your questions regarding project management fundamentals and the industry's leading project management tool. It is for anyone who is just starting to use or is thinking of using Microsoft Project. Topics include integration between Project data and other applications, Project analysis, using Project in workgroups, tracking costs, and Web Integration.
Local tension methods for bivariate scattered data interpolation
Authors: Carla Manni
Venue: Mathematical Methods for Curves and Surfaces: Oslo 2000 (2001)

The paper surveys some local tension methods which can be used for constrained scattered data interpolation. The graphical performances of various methods are compared with the aid of a classical numerical test.
Neighborhood Preserving Hashing and Approximate Queries
Authors: Danny Dolev, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas
Venue: SIAM Journal on Discrete Mathematics (2002)

Let $D \subseteq \Sigma^n$ be a dictionary. We look for efficient data structures and algorithms to solve the following approximate query problem: Given a query $u \in \Sigma^n$ list all words $v \in D$ that are close to u in Hamming distance.The problem reduces to the following combinatorial problem: Hash the vertices of the n-dimensional hypercube into buckets so that (1) the c-neighborhood of each vertex is mapped into at most k buckets and (2) no bucket is too large.Lower and upper bounds are given for the tradeoff between k and the size of the largest bucket. These results are used to derive bounds for the approximate query problem.
Oracle8 and Windows NT Black Book with Cdrom, 10th edition
Authors: Mike Curtis, Jacqueline King
Venue:  (1998)

:"Addresses the similarities and differences between Unix and Windows NT, with a special emphasis on operating system features, performance tuning, and functionality that will impact an Oracle database running on Windows NT." "Describes Oracle supplied, NT-specific utilities in detail; including the NT Instance Manager, NT Backup Manager, NT Recovery Manager, and SQL*Net Easy configuration." "Covers installing Oracle Enterprise Manager (OEM), building the OEM repository, creating the OEM network definition, and configuring the intelligent agents." "Shows how to use Windows NT tools (Disk Administrator and Performance Monitor) to help monitor and tune Oracle performance." "Designed specifically to ease the often difficult Windows NT learning curve which database administrators are facing in record numbers." "Provides an essential insider's look at the Oracle 8 architecture and the critical changes necessary in the Windows NT environment to support an Oracle database." "A demonstration copy of the Oracle8 Server and the Oracle Enterprise Manager" "All the sample database administration scripts from the book" "Mike Curtis (Kirkland, WA) is a principal systems engineer at ARIS Corporation, a leader in consulting and education in the Oracle and Microsoft environments. He is currently an instructor on both Oracle database administration and Unix system administration. He has been working with Oracle since 1987, as both an application developer and a DBA. Jacqueline King (Plano, TX) is currently a course developer for Database Consultants, Inc. Jackie was previously a developer and DBA with 10 years of Oracle database experience."
A+ Certification Study System with Cdrom, 1st edition
Authors: Michael A. Pastore, Bill Karow, Randall Thomas, Candy Paape, John Glassman
Venue:  (1999)

:Computer professionals can use this study guide to help them master the hardware skills needed to pass the A+ Certification exam. Organized logically and chock-full of insider tips and expert techniques, all are cross-referenced to make learning as easy as possible. The CD-ROM includes the entire book in a searchable format.
Fast Bit-Reversals on Uniprocessors and Shared-Memory Multiprocessors
Authors: Zhao Zhang, Xiaodong Zhang
Venue: SIAM Journal on Scientific Computing (2000)

In this paper, we examine different methods using techniques of blocking, buffering, and padding for efficient implementations of bit-reversals. We evaluate the merits and limits of each technique and its application and architecture-dependent conditions for developing cache-optimal methods. Besides testing the methods on different uniprocessors, we conducted both simulation and measurements on two commercial symmetric multiprocessors (SMP) to provide architectural insights into the methods and their implementations. We present two contributions in this paper: (1) Our integrated blocking methods, which match cache associativity and translation-lookaside buffer (TLB) cache size and which fully use the available registers, are cache-optimal and fast. (2) We show that our padding methods outperform other software-oriented methods, and we believe they are the fastest in terms of minimizing both CPU and memory access cycles. Since the padding methods are almost independent of hardware, they could be widely used on many uniprocessor workstations and multiprocessors.
Securing IPv6 neighbor and router discovery
Authors: Jari Arkko, Tuomas Aura, James Kempf, Vesa-Matti Mäntylä, Pekka Nikander, Michael Roe
Venue: Proceedings of the 1st ACM workshop on Wireless security (2002)

When IPv6 Neighbor and Router Discovery functions were defined, it was assumed that the local link would consist of mutually trusting nodes. However, the recent developments in public wireless networks, such as WLANs, have radically changed the situation. The nodes on a local link cannot necessarily trust each other any more, but they must become mutually suspicious even when the nodes have completed an authentication exchange with the network. This creates a number of operational difficulties and new security threats. In this paper we provide a taxonomy for the IPv6 Neighbor and Router Discovery threats, describe two new cryptographic methods, Cryptographically Generated Addresses (CGA) and Address Based Keys (ABK), and discuss how these new methods can be used to secure the Neighbor and Router discovery mechanisms.
Operators in an APL containing nested arrays
Authors: M. A. Jenkins, Jean Michel
Venue: ACM SIGAPL APL Quote Quad (1978)

Formal definitions of several functions and operators for manipulating nested arrays are presented. Three operators that control the application of a function to the items or groups of items of an array are defined. In addition, the definition of current APL operators is extended to nested arrays. A proposal is presented to accept some of the ideas for the present APL and others for an APL extended to include heterogeneous nested arrays.
Using Your MAC
Authors: Todd Stauffer, Que Corporation
Venue:  (1995)

:Readers will discover instant productivity with their Macintosh with this user-friendly guide. Focused on the one best way to perform tasks, this book enables users to find information fast, apply it to their own work, and move on.Explains the basics of a Mac system, including hardware, software, and System 7 and 7.5Includes special tips and advice on running software applications effectively"Read Me First" boxes demystify Mac jargon and complex topics
Exploring collaborative navigation:: the effect of perspectives on group performance
Authors: Huahai Yang, Gary M. Olson
Venue: Proceedings of the 4th international conference on Collaborative virtual environments (2002)

In this paper, we describe a collaborative navigation task in CVE. As a work in process, we present a process model of the task and design an experiment to test hypotheses generated by this process model. Using this experimental approach, we investigated the effect of the dimension of egocentric-exocentric perspectives on collaborative navigation performance. Results favor an egocentric perspective display. We also discuss the implications of this work for the design of interaction techniques to support collaborative navigation and awareness in CVE.
Totally Unauthorized Guide to Diddy Kong Racing
Authors: Woodbrown
Venue:  (1997)

:Strategy guide will include course maps with all critical areas highlighted, secret shortcuts and special tricks to help win the game, how to unlock courses and meet goals for each course. Guide will also contain multi-player section and detailed strategy for defeating each course with a variety of vehicles.Diddy Kongs Racing focuses on high-speed, entertaining racing action with a large dose of adventure and exploration.Diddy Kong and seven other characters race through 50 beautiful 3-D courses with rivers, waterfalls, tunnels, canyons, lava, snow, rolling hills and quiet lagoons.The game features Rare s proprietary Real-Time Dynamic Animation Technology, which allows the game to include large, colorful and highly textured characters in a massive environment.
Constructing Correct Software: The Basics, 1st edition
Authors: John Cooke
Venue:  (1998)

:Central to Formal Methods is the so-called Correctness Theorem which relates a specification to its correct implementations. This theorem is the goal of traditional program testing and, more recently, of program verification (in which the theorem must be proved). Proofs are difficult, though, even with the use of powerful theorem provers. This volume explains and illustrates an alternative method, which allows the construction of (necessarily correct) algorithms from a specification using algebraic transformations and refinement techniques which prevent the introduction of errors. Constructing Correct Software will provide invaluable reading for students and practitioners of Computer Science and Software Engineering to whom correctness of software is of prime importance.
Numerical Approximation of Some Linear Stochastic Partial Differential Equations Driven by Special Additive Noises
Authors: Qiang Du, Tianyu Zhang
Venue: SIAM Journal on Numerical Analysis (2002)

This paper is concerned with the numerical approximation of some linear stochastic partial differential equations with additive noises. A special representation of the noise is considered, and it is compared with general representations of noises in the infinite dimensional setting. Convergence analysis and error estimates are presented for the numerical solution based on the standard finite difference and finite element methods. The effects of the noises on the accuracy of the approximations are illustrated. Results of the numerical experiments are provided.
Active Server Pages in Plain English
Authors: Timothy Eden, Patricia Hartman
Venue:  (2000)

:"Two books in one - both an interactive reference & tutorial. Active Server Pages In Plain English gives you instant access to ASP through a detailed reference section of key ASP components and languages along with a dense tutorial that describes the programming essentials. Extensive cross-references with live page numbers make this the perfect book to prop next to your computer while programming with ASP."--BOOK JACKET.
Design of diagnosible automata
Authors: J. Paul Roth
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

A device d is any object which can perform a well-defined function, its inputs and outputs quantum-valued. It is acyclic if its output is independent of "previous" inputs. A failure in d is any change in its function. An automaton A is composed from devices by interconnection of certain outputs of some devices with inputs of others. A failure of A is a failure of any of its devices, interconnection failures included. Problem: Given failure f of A find a test, an input pattern for which the corresponding output pattern differs depending upon whether f occurs. For A acyclic - its devices are acyclic and the graph of its interconnection is acyclic - the D-algorithm, widely used, guarantees computation of a test for any testable failure. For A cyclic, with memory, feedback, a design constraint is necessary. An R-automaton has a Regular synchronized raceless design; any function can be so realized (e.g. IBM S/360/40, 370/195). For an R-design, DALG5, the D-algorithm extended, can always compute a test for any testable failure. Similarly TESTDETECT2 extends to determine all failures of an R-automaton detected by a given test, requiring on the average n steps, where n is the number of devices, where standard simulation requires n2. This work was sponsored in part by the Jet Propulsion Laboratory of the California Institute of Technology with the support under Contract NAS 7-100 of the National Aeronautics and Space Administration.
Constructing good quality web page communities
Authors: Jingyu Hou, Yanchun Zhang
Venue: Proceedings of the 13th Australasian database conference - Volume 5 (2002)

World Wide Web is a rich source of information and continues to expand in size and complexity. To capture the features of the Web at a higher level to realise the information classification and efficient retrieval on the Web is becoming a challenge task. One natural way is to exploit the linkage information among the Web pages. Previous work such as HITS in this area is based on a set of retrieved pages to get a Web community that is a bunch of pages related to the query topics. Since the set of retrieved pages may contain many unrelated pages (noise pages) to the query topics, the obtained Web community sometimes is unsatisfactory. In this paper, we propose an innovative algorithm to eliminate noise pages from set of retrieved pages and improve its quality. This improvement will enable existing community construction algorithms to construct good quality Web page communities. The proposed algorithm reveals and takes advantage of the relationships among concerned Web pages at a deeper level. The numerical experiment results show the effectiveness and feasibility of the algorithm. This algorithm could also be used solely to filter unnecessary Web pages and reduce the management cost and burden of Web-based data management systems. The ideas in the algorithm can also be applied to other hyperlink analysis.
High Performance Computing and the Art of Parallel Programming: An Introduction for Geographers, Social Scientists, and Engineers
Authors: Stan Openshaw, Ian Turton
Venue:  (1999)

:High Perfomance Computing and the Art of Parallel Computing provides a non-technical introduction to High Performance Computing applications together with advice about how beginners can start to write parallel programs. Using case studies to show where HPC has already been used and providing examples for other areas of application to geography, GIS and the social sciences, it provides a plain and practical introduction to a subject that is usually surrounded by complex computer jargon.
Abstract state machines and computationally complete query languages
Authors: Andreas Blass, Yuri Gurevich, Jan Van den Bussche
Venue: Information and Computation (2002)

Abstract state machines (ASMs) form a relatively new computation model holding the promise that they can simulate any computational system in lockstep. In particular, an instance of the ASM model has recently been introduced for computing queries to relational databases. This model, to which we refer as the BGS model, provides a powerful query language in which all computable queries can be expressed. In this paper, we show that when one is only interested in polynomial- time computations, BGS is strictly more powerful than both QL and whilenew, two well-known computationally complete query languages. We then show that when a language such as whilenew is extended with a duplicate elimination mechanism, polynomial-time simulations between the language and BGS become possible. Copyright 2002 Elsevier Science (USA).