ppxscal/embedding_network huggingface dataset:
Performance of multi-dimensional space-filling curves
Authors: Mohamed F. Mokbel, Walid G. Aref, Ibrahim Kamel
Venue: Proceedings of the 10th ACM international symposium on Advances in geographic information systems (2002)

A space-filling curve is a way of mapping the multi-dimensional space into the one-dimensional space. It acts like a thread that passes through every cell element (or pixel) in the D-dimensional space so that every cell is visited exactly once. There are numerous kinds of space-filling curves. The difference between such curves is in their way of mapping to the one dimensional space. Selecting the appropriate curve for any application requires knowledge of the mapping scheme provided by each space-filling curve. A space-filling curve consists of a set of segments. Each segment connects two consecutive multi-dimensional points. Five different types of segments are distinguished, namely, Jump, Contiguity, Reverse, Forward, and Still. A description vector V=(J,C,R,F,S), where J,C,R,F, and S, are the percentages of Jump, Contiguity, Reverse, Forward, and Still segments in the space-filling curve, encapsulates all the properties of a space-filling curve. The knowledge of V facilitates the process of selecting the appropriate space-filling curve for different applications. Closed formulas are developed to compute the description vector V for any D-dimensional space and grid size N for different space-filling curves. A comparative study of different space filling curves with respect to the description vector is conducted and results are presented and discussed.
Implementing Baan IV
Authors: Yves Perreault, Baan Institute, Tom Vlasic
Venue:  (1998)

:As the number-one competitor to SAP, BAAN is a Dutch-based client/server solution for corporations. Written by a team of world-renowned BAAN consultants, this one-stop guide teaches users the fundamentals of the BAAN system and the ins and outs of implementing individual modules.Explores the skills users need when looking for a BAAN-related positionExtensive coverage of installing BAAN, programming for BAAN, running BAAN modules, troubleshooting BAAN, security, and training
The Casino Answer Book: How to Overcome the House Advantage when You Play Blackjack, Video Poker and Roulette
Authors: John Grochowski
Venue:  (1998)

:In casino gambling there's a house advantage built into every game. John Grochowski shows you how to beat that advantage and increase your winning odds in three of the most popular casino games (blackjack, video poker, and roulette).
Rolling the dice to understand a not-so-intuitive kind of distribution
Authors: Paul Abraham
Venue: PRIMUS: problems, resources, and issues in mathematics undergraduate studies (2002)

Motivated by an exercise in [4, p. 229], the author describes a classroom investigation of the triangular-shaped frequency distribution that arises from the sum of two independent random variables uniformly distributed in the interval [1,6]. Included are three dice rolling experiments for small sample sizes, a TI-92 function for large sample sized dice rolling simulations, a TI-92 program for independent sum simulations much less discrete than dice rolling, and a discussion of how they were used in the classroom.
Digital processing of the speech of deaf children
Authors: Harry Levitt
Venue: Proceedings of the ACM annual conference - Volume 1 (1972)

Several digital processing techniques have been found to be of value in the computer analysis of the speech of deaf children. These techniques include the cepstrum analysis, chirp z transform, and predictive coding of the speech signal. The application of these techniques to the analysis of deaf speech, and the special problems that are encountered, are discussed. The accuracy of the speech parameter estimates obtained by these techniques is difficult to evaluate since the "true" values are not known. One approach to evaluating the accuracy of estimation is to synthesize the speech using the estimated parameter values. The computer simulation of the speech of deaf children has, thus far, shown a moderate degree of success. The computer synthesis of deaf speech also appears to be a diagnostic tool of great potential for the evaluation and treatment of speech problems.
Internet Growth and Economic Theory
Authors: Rajeev K. Goel, Edward W. T. Hsieh
Venue: Netnomics (2002)

This paper focuses on economic implications of the Internet. We argue that some effects of the Internet can be understood within the context of traditional economics. Specifically, the Internet has the potential to make market more contestable and hence more competitive. Policy issues are also discussed.
Windows NT 4 Workstation for Dummies, 2nd edition
Authors: Andy Rathbone, Sharon Crawford, Microsoft Corporation
Venue:  (1999)

:Building on the success of their first collaboration, Windows aficionados Andy Rathbone and Sharon Crawford team up to help computer users get the most out of Windows NT Workstation 4 - the desktop operating system that continues to grow in popularity. This easy-to-read reference benefits computer novices and more seasoned Windows veterans alike. This book update provides in-depth coverage of new features and functionality now available to NT end-users, plus all the operating system basics, if you need them.
Polygon shading with a pen plotter
Authors: C. Bastian, C. Cervini
Venue: ACM SIGAPL APL Quote Quad (1984)

Functions are given to find the extremities of parallel or convergent shade lines filling any set of closed polygons.
An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints
Authors: Masao Fukushima, Paul Tseng
Venue: SIAM Journal on Optimization (2002)

We consider a mathematical program with a smooth objective function and linear inequality/complementarity constraints. We propose an $\epsilon$-active set algorithm which, under a uniform LICQ on the $\epsilon$-feasible set, generates iterates whose cluster points are B-stationary points of the problem. If the objective function is quadratic and $\epsilon$ is set to zero, the algorithm terminates finitely. Some numerical experience with the algorithm is reported.
Business Information Desk Reference: Where to Find Answers to Business Questions
Authors: Melvyn N. Freed, Virgil P. Diodato
Venue:  (1992)

:This valuable resource tells readers where to learn how to: launch, protect, and market a new product; do business with the U.S. government; appraise the value of a firm; find answers to consumer questions and concerns; learn how to write a business plan; locate the business rules, regulations, and customs of foreign nations; find information about competitors and suppliers; prepare for a meeting with potential investors in one's company, and find names and addresses of venture capitalists.
Using DOS
Authors: Gerry R. Routledge, Suzanne Weixel, Michael O'Mara
Venue:  (1995)

:For the fastest and easiest access to essential DOS information, nothing comes close to this efficient reference. Readers find the one best way to use DOS commands and perform tasks, whether organizing information or running software applications.Covers hardware, basic PC literacy, Windows, memory, printing, disks, directories, and moreFeatures tips, notes, cautions, and troubleshooting Q&AsDesigned for comfort, ease of use, and quick access
Understanding Digital Transmission and Recording, 1st edition
Authors: Irwin Lebow
Venue:  (1998)

:With the advent of the PC, the Internet, modems, the compact disc and digital TV broadcasting, the analog world is being slowly replaced by the new digital world. Everyone knows about this trend, but few understand it. Much of what is happening with the technology is counterintuitive -- even to an engineer. UNDERSTANDING DIGITAL TRANSMISSION AND RECORDING explains the essence of digital communication and recording for working engineers, students and other professionals working across industries. Even the communications engineer who is steeped in the mathematics of the field will find this book helpful in understanding the larger picture.
The Local Solvability of a Hamilton--Jacobi--Bellman PDE around a Nonhyperbolic Critical Point
Authors: Arthur J. Krener
Venue: SIAM Journal on Control and Optimization (2000)

We show the existence of a local solution to a Hamilton--Jacobi--Bellman (HJB) PDE around a critical point where the corresponding Hamiltonian ODE is not hyperbolic, i.e., it has eigenvalues on the imaginary axis. Such problems arise in nonlinear regulation, disturbance rejection, gain scheduling, and linear parameter varying control. The proof is based on an extension of the center manifold theorem due to Aulbach, Flockerzi, and Knobloch. The method is easily extended to the Hamilton--Jacobi--Isaacs (HJI) PDE. Software is available on the web to compute local approximtate solutions of HJB and HJI PDEs.
Delivering Learning on the Net
Authors: Martin Weller
Venue:  (2002)

:Educators cannot ignore the net or its implications for their course or institution, but where to begin? Good Web-based education is complex, and does not occur in a vacuum. The educational, administrative and organizational aspects all need to be understood - in addition to a sound understanding and vision of the requirements of online technologies.Simple, straightforward and direct, this book will guide readers through each of these issues. This is not a book for those fixated by technology. Instead, it will show any educator, teacher, or indeed trainer, how to understand and develop effective online courses. It avoids reducing the issues of good Web-based education to a simplistic cook book approach: this is not possible for anything other than the most basic material. Rather, it clearly and authoritatively develops an understanding of the basic principles, and essential components of good online education.
Model exploration with temporal logic query checking
Authors: Arie Gurfinkel, Benet Devereux, Marsha Chechik
Venue: Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering (2002)

A temporal logic query is a temporal logic formula with placeholders. Given a model, a solution to a query is a set of assignments of propositional formulas to placeholders, such that replacing the placeholders with any of these assignments results in a temporal logic formula that holds in the model. Query checking, first introduced by William Chan \citechan00, is an automated technique for finding solutions to temporal logic queries. It allows discovery of the temporal properties of the system and as such may be a useful tool for model exploration and reverse engineering.This paper describes an implementation of a temporal logic query checker. It then suggests some applications of this tool, ranging from invariant computation to test case generation, and illustrates them using a Cruise Control System.
A Textbook on ATM Telecommunications: Principles and Implementation, 1st edition
Authors: Perambur S. Neelakanta, P. S. Nelakanta
Venue:  (1999)

:an introduction to ATM telecommunications combining the theory underlying broadband communications technology and applied practical instructions and lessons taken from industry
Traffic Control and Transport Planning: A Fuzzy Sets and Neural Networks Approach
Authors: Dusan Teodorovic, Katarina Vukadinovic
Venue:  (1998)

:The goal of this book is to acquaint the reader with the basic elements of the fuzzy set theory, fuzzy logic, fuzzy logic systems, artificial neural networks, neurofuzzy modeling, and applications of fuzzy logic and neural networks to date in traffic and transportation engineering, and to indicate the directions for future research in this area.
Dreamweaver Ultradev 4: The Complete Reference, 1st edition
Authors: Ray West, Tom Allen, Tom Muck
Venue:  (2001)

:Useful for developers of all skill levels,this comprehensive reference will show you everything you need to build powerful e-business applications using UltraDev. Customize powerful Web applications quickly and cleanly with this ultra-useful development tool. Dreamweaver UltraDev 4: The Complete Reference will teach you the easiest,most effective way to design,plan,and build a Web site,then use it to collect,distribute,and leverage information for customers and employees. Create the ideal Web site using a visual design environment that concurrently allows code editing through a logical parallel-window system. From constructing a Web site from the ground up to analyzing your information needs and developing a Web application to meet them,this book is the perfect companion to the latest of Macromedia's extremely useful tools. View and edit code through a second window while graphically constructing your site with objectsDesign,plan,and build powerful,information-rich Web sites for any purposeCreate and customize Web applications with Dreamweaver's popular design interfaceMaintain an organized server with Clean Code upload filtrationConfigure scripts using ColdFusion,ASP,or JSP,depending on your server and operating system needsUse objects or write scripts for managing information flow to and from your databaseConnect your Web applications to legacy systems,including independent servers and e-commerce solutionsLearn from included CD-featuring multimedia tutorials,sample code,scripts,and more
Interpolation-based index maintenance
Authors: Walter A. Burkhard
Venue: Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems (1983)

A new interpolation-based order preserving hashing algorithm suitable for on-line maintenance of large dynamic external files under sequences of four kinds of operations insertion, update, deletion, and orthogonal range query is proposed. The scheme, an adaptation of linear hashing, requires no index or address directory structure and utilizes O(n) space for files containing n records, all of the benefits of linear hashing are inherited by this new scheme. File implementations yielding average successful search lengths much less than 2 and average unsuccessful search lengths much less than 4 for individual records are obtainable, the actual storage required is controllable by the implementor.
Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications
Authors: Michael A. Steel, László A. Székely
Venue: SIAM Journal on Discrete Mathematics (2002)

In this paper we study inverting random functions under the maximum likelihood estimation (MLE) criterion in the discrete setting. In particular, we consider how many independent evaluations of the random function at a particular element of the domain are needed for reliable reconstruction of that element. We provide explicit upper and lower bounds for MLE, both in the nonparametric and parametric setting, and give applications to coin-tossing and phylogenetic tree reconstruction.
A New SQP Algorithm for Large-Scale Nonlinear Programming
Authors: R. W. H. Sargent, M. Ding
Venue: SIAM Journal on Optimization (2000)

An efficient new SQP algorithm capable of solving large-scale problems is described. It generates descent directions for an $\ell_1$ plus log-barrier merit function and uses a line-search to obtain a sufficient decrease of this function. The unmodified exact Hessian matrix of the Lagrangian function is normally used in the QP subproblem, but this is set to zero if it fails to yield a descent direction for the merit function. The QP problem is solved by an interior-point method using an inexact Newton approach, iterating to an accuracy just sufficient to produce a descent direction in the early stages and tightening the accuracy as we approach a solution. We prove finite termination of the algorithm, at an $\epsilon$-optimal Fritz-John point if feasibility is attained. We also show that if any iterate is close enough to an isolated connected subset of local minimizers, then the iterates converge to this subset. The rate of convergence is Q-quadratic if the subset is an isolated minimizer which satisfies a second-order sufficiency condition, but Q-quadratic convergence to an $\epsilon$-optimal point can still be achieved without any conditions beyond Lipschitz continuity of second-order derivatives.The implementation SQPIPM is designed for problems with many degrees of freedom and is shown to perform well compared with other codes on a range of standard problems.
Creating Web Pages for Dummies, 4th edition
Authors: Bud E. Smith, Arthur Bebak
Venue:  (1999)

:Whether you want to post a personal home page or a business Web site on the world Wide Web, Creating Web Pages For Dummies is the book for you! With this easy-to-follow reference, you quickly find out how to create a Web page, place it on a Web server for little or no cost, and view your own home page on the Web after only a couple of hours of work! Also, discover how to add graphics, formatting, hypertext links, and even multimedia to create a first-rate page and become a Web publishing expert overnight! Use Creating Web Pages For Dummies the fun and easy way: Discover how to use a wide range of Web page creation tools already online, including tools to use on America Online, CompuServe, and Prodigy Create Web pages with or without using HTML Place your Web pages on a Web server -- sometimes you can even do it for free! Produce simple, clear Web pages and link them with easy-to-use Web sites Uncover Web page basics including how to format text, create links, and add graphics Find examples of great sites from businesses and individuals to show you how to publish easily Plus Top Ten Lists of Web publishing dos and don'ts
Scalar functions
Venue: ACM SIGAPL APL Quote Quad (1983)

The primitive functions described in this section are called scalar-functions. All scalar-functions have uniform behaviour with respect to the structure of their argument arrays. The shape of the result of a scalar-function is determined solely by the shapes of its arguments.This section defines scalar-functions individually for scalar arguments. Their common behaviour is described here by the expository device of an implicit operator, called the scalar-extension-operator. 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
Language model for IR using collection information
Authors: Rong Jin, Luo Si, Alex G. Hauptmann, Jamie Callan
Venue: Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval (2002)

Information retrieval using meta data can be traced back to the early age of IR where documents are represented by the controlled vocabulary. In this paper, we explore the usage of meta-data information under the framework of language model. We present a new language model that is able to take advantage of the category information for documents to improve the retrieval accuracy. We compare the new language model with the traditional language model over the TREC4 dataset where the collection information for documents is obtained using the k-means clustering method. The new language model outperforms the traditional language model, which verifies our statement.
Business Rules Applied: Building Better Systems Using the Business Rules Approach
Authors: Barbara Von Halle
Venue:  (2001)

:From a bestselling author and experta soon-to-be classic on application development Representing a significant change of focus in software engineering, the business rule approach to application development benefits all decision makers. Managers looking to take advantage of new opportunities will turn to business rules to implement change. IT has already learned the benefits of separating data by processing and managing data as an independent component of systems. A rules-extended development approach does exactly the same thing for business rules: by reducing the amount of code that needs to be written, it shortens the time necessary to implement change. Bestselling author Barbara von Halle (The Handbook of Relational Database Design from Addison Wesley) presents the first book to show in practical, real-world terms how to build applications using business rule concepts and techniques. This authoritative guide will give readers: * Complete guidance for system designers and database managers * The motivation for using the business rule approach * Techniques for discovering and managing rules * Guidance on how to conduct rule analysis * Steps for designing the implementation options of the rules, as well as designing workflow and database components
Mastering MATLAB 6: A Comprehensive Tutorial and Reference, 1st edition
Authors: Duane C. Hanselman, Bruce R. Littlefield, Bruce C. Littlefield
Venue:  (2000)

:This easy-to-follow book covers all essential aspects and new features of MATLAB Version 6. Thorough coverage of indexing, vectorizing, and linear algebra are included. Covers integration of MATLAB with C, FORTRAN, and Java. Extensive index has been revised. Ideal as an introduction or as a reference to MATLAB.
Windows Networking and Connectivity Guide: How to Survive in a World of Windows, NetWare, and DOS, 1st edition
Authors: Ralph R. Davis, Stephen Randy Davis
Venue:  (1992)

:programmers writing applications software to run under Windows 3.1 and a network. They have been left largely alone to unravel the complex relationship between the sparse DOS and Windows networking functions, and industry standard network APIs like NetWare and Banyan Vines. The introduction of Windows for Workgroups and Windows NT simplifies some of the issues, but makes others even more difficult. Windows Network Programming is the first book to clearly address the key issues regarding Windows and networks. The book looks closely at the leading network standards, including: NetWare Windows for Workgroups LAN Manager Windows NT Banyan Vines TCP/IP. It also develops a network-independent interface for Windows applications by determining what functionality should be standardized. This network-independent interface provides services to talk to Windows programs on other machines, add users and user groups, change users' access rights report on traffic or configuration, and determine how network resources are being used. The book is organized into two sections. Part I deals with horizontal (or distributed) applications, including client-to-client and client-to-server programs. Part 2 covers those applications that appear to execute within a single workstation, referred to as vertical applications. Windows Network Programming will appeal to both experienced network programmers and Windows programmers wanting to write network-aware applications.
Affine Invariant Convergence Analysis for Inexact Augmented Lagrangian-SQP Methods
Authors: S. Volkwein, M. Weiser
Venue: SIAM Journal on Control and Optimization (2002)

An affine invariant convergence analysis for inexact augmented Lagrangian-SQP methods is presented. The theory is used for the construction of an accuracy matching between iteration errors and truncation errors, which arise from the inexact linear system solvers. The theoretical investigations are illustrated numerically by an optimal control problem for the Burgers equation.
Shadow algorithms for computer graphics
Authors: Franklin C. Crow
Venue: ACM SIGGRAPH Computer Graphics (1977)

Shadows are advocated for improved comprehension and enhanced realism in computer-synthesized images. A classification of shadow algorithms delineates three approaches: shadow computation during scanout; division of object surfaces into shadowed and unshadowed areas prior to removal of hidden surfaces; and inclusion of shadow volumes in the object data. The classes are related to existing shadow algorithms and implementations within each class are sketched. A brief comparison of the three approaches suggests that the last approach has the most appealing characteristics.