ppxscal/embedding_network huggingface dataset:
A fast filtering scheme for large database cleansing
Authors: Sam Y. Sung, Zhao Li, Peng Sun
Venue: Proceedings of the eleventh international conference on Information and knowledge management (2002)

Existing data cleansing methods are costly and will take very long time to cleanse large databases. Since large databases are common nowadays, it is necessary to reduce the cleansing time. Data cleansing consists of two main components, detection method and comparison method. In this paper, we first propose a simple and fast comparison method, TI-Similarity, which reduces the time for each comparison. Based on TI-Similarity, we propose a new detection method, RAR, to further reduce the number of comparisons. With RAR and TI-Similarity, our new approach for cleansing large databases is composed of two processes: Filtering process and Pruning process. In filtering process, a fast scan on the database is carried out with RAR and TI-Similarity. This process guarantees the detection of potential duplicate records but may introduce false positives. In pruning process, the duplicate result from the filtering process is pruned to eliminate the false positives using more trustworthy comparison methods. The performance study shows that our approach is efficient and scalable for cleansing large databases, and is about an order of magnitude faster than existing cleansing methods.
A strategy for the construction of piecewise linear prewavelets over Type-1 triangulations in any space dimension
Authors: Erich Suter
Venue: Mathematical Methods for Curves and Surfaces: Oslo 2000 (2001)

We investigate candidates for basis functions for piecewise linear wavelet spaces over Type-1 triangulations of uniformly distributed data in any space dimension.
Granularity hierarchies in concurrency control
Authors: Michael J. Carey
Venue: Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems (1983)

This paper shows that granularity hierarchies may be used with many types of concurrency control algorithms. Hierarchical versions of a validation algorithm, a timestamp algorithm, and a multiversion algorithm are given, and hierarchical algorithm issues relating to request escalation and distributed databases are discussed as well. It is argued that these hierarchical algorithms should offer improved performance for certain transaction mixes.
Cases in E-Commerce, 1st edition
Authors: Jeffrey F. Rayport, Bernard J. Jaworski
Venue:  (2001)

:37 Harvard-style cases featuring top companies competing in the New Economy. Cases are organized to facilitate discussion of the decision-making process for formulating New Economy enterprise strategy. The presentation mirrors the organization of the eCommerce textbook written by the authors.
Pokemon Trainer's Survival Guide: Everything Pokemon
Authors: Mark MacDonald, J. Douglas Arnold, Mark Elies, Brian Brokaw
Venue:  (1999)

:Do you have anime madness? Japan has been overrun by little creatures called Pocket Monsters, and the mania is spreading here just as quickly. Do you want to learn how to be a Pokémon master? With detailed pictures and maps of the towns and routes and all the tips and tricks you need to know, the Pok&3233;mon Trainer's Survival Guide will help you win all the games and collect all of the more than 150 characters. There is even a sneak peek at number 151! Author Mark MacDonald is a true Pok&3233;mon expert: He traveled to Japan and studied all the products available there and in the United States. The result is the most comprehensive guide to date, guaranteed to send you on your way to becoming the world's best Pok&3233;mon trainer.
MCSE Training Guide: Windows NT Server 4 Enterprise
Authors: Joe Casad, Wayne Dalton
Venue:  (1997)

:Solid, objective-based content prepares readers to take the MCSE Windows NT Server Enterprise exam. The CD-ROM features an exam simulation program so they can practice the test.
A Priori Error Estimates for Finite Element Methods Based on Discontinuous Approximation Spaces for Elliptic Problems
Authors: Béatrice Rivière, Mary F. Wheeler, Vivette Girault
Venue: SIAM Journal on Numerical Analysis (2001)

We analyze three discontinuous Galerkin approximations for solving elliptic problems in two or three dimensions. In each one, the basic bilinear form is nonsymmetric: the first one has a penalty term on edges, the second has one constraint per edge, and the third is totally unconstrained. For each of them we prove hp error estimates in the H1 norm, optimal with respect to h, the mesh size, and nearly optimal with respect to p, the degree of polynomial approximation. We establish these results for general elements in two and three dimensions. For the unconstrained method, we establish a new approximation result valid on simplicial elements. L2 estimates are also derived for the three methods.
Perl CD Bookshelf: 6 Bestselling Books on CD-ROM
Authors: Ellen Siever
Venue:  (1999)

:Perl programmers increasingly rely on the Web, online help, and other online information sources to solve information pain. Now O'Reilly's Perl CD Bookshelf gives you convenient online access to your favorite books from your CD-ROM drive. The Perl CD Bookshelf contains a powerhouse of O'Reilly Animal Guides. Included are complete, unabridged versions of Perl in a Nutshell; Programming Perl, 2nd Edition; Perl Cookbook; Advanced Perl Programming; Learning Perl; and Learning Perl on Win32 Systems. As a bonus, the new hardcopy version of Perl in a Nutshell is also included. Never has it been easier to learn, or look up, what you need to know online. Formatted in HTML, The Perl CD Bookshelf can be accessed with any Web browser. The books are fully searchable and cross-referenced. In addition to individual indexes for each book, a master index for the entire library is provided
MCSE NT Server 4 Exam Cram: Exam 70-067, 3rd edition
Authors: Ed Tittel, James Michael Stewart, Kurt Hudson
Venue:  (2000)

:MCSE NT Server 4 Exam Cram, Third Edition, covers all exam formats for Exam 70-067: Implementing and Supporting Microsoft Windows NT Server 4.0. The Third Edition contains a new 32-page "scenario section," designed to prepare the reader for scenario-based questions on the actual exam. Two completely revised practice exams include questions designed to assess the reader's readiness to take the exam, complete with answers and explanations that reinforce the reasoning behind the correct answers. The Third Edition also includes readers' favorite Exam Cram features: warnings on trick questions, time-saving study tips, multiple-part question strategies, and shortcuts. Special features include: - A revised and updated Cram Sheet with tips, acronyms, and memory joggers that readers can take with them to the exam. - Cram Fitness Assessments that give readers a way to determine how to proceed with certification by analyzing their educational and experiential background and their subject knowledge level in order to make suggestions about preparation and study. The following key technical topics are covered in MCSE NT Server 4 Exam Cram, Third Edition : Windows NT installation, NT's file system, performance monitoring, NT/NetWare relationships, printing, backup and recovery, NT Remote Access Services (RAS), NT boot process, and troubleshooting system failures.
Outlook 2000 in a Nutshell: A Power User's Quick Reference, 1st edition
Authors: Tom Syroid, Bo Leuf
Venue:  (2000)

:There is currently an installed base of 23 million Microsoft Office users, and given the close integration of Outlook with the other Office 2000 components, Outlook is well on its way to becoming the most widely-used e-mail client in the world. With most of the books currently on the market for Outlook 2000 falling into the instant-learn, limited-scope "Dummies" category, the need for an up-to-date and comprehensive reference book such as Outlook 2000 in a Nutshell is great. This book is aimed squarely at typical Nutshell readers: sophisticated computer users who need a comprehensive, functional reference to the product. Outlook is much more than just an e-mail client. It is a powerful and versatile program that includes contact, calendar, notes, task, and journal tools all tightly integrated to give users quick access to vital information and fast, easy ways to share that information. You can arrange virtual conferences with NetMeeting, send Office documents through Outlook Mail, and save calendars as Web pages and publish them to the Web. Outlook 2000 in a Nutshell is organized intuitively, beginning with a program overview examining Outlook's interface and structure along with setup and installation issues. The chapter on program insights delves deeper into the program, looking at data structures, forms, and categories. The second part of the book drills down into Outlook's individual components and their associated commands, and the last section covers some sophisticated connectivity and collaboration issues as well as file management and encryption. There are also some special sections devoted to working with VBA, using Outlook as an Exchange client,and exploring how Outlook works with Palm devices. This book covers: Program data structures, forms, and views Adaptive menus and toolbars Outlook's Component interaction Connectivity and collaboration tools Importing and Exporting Working with VBA Outlook as an Exchange client Encryption tools, synchronization issues, data backup and more The authors worked extensively with Microsoft engineers on the alpha/beta releases of Outlook 98, and bring to the book a wealth of knowledge and experience. They have provided a comprehensive task index, designed to speed up the process of locating important information as well as tips and tricks about the program. Outlook 2000 in a Nutshell is a must-read for any user who wants to get as much out of this software as possible without wasting time weeding through hundreds of pages of useless information.
Level set surface editing operators
Authors: Ken Museth, David E. Breen, Ross T. Whitaker, Alan H. Barr
Venue: ACM Transactions on Graphics (TOG) (2002)

We present a level set framework for implementing editing operators for surfaces. Level set models are deformable implicit surfaces where the deformation of the surface is controlled by a speed function in the level set partial differential equation. In this paper we define a collection of speed functions that produce a set of surface editing operators. The speed functions describe the velocity at each point on the evolving surface in the direction of the surface normal. All of the information needed to deform a surface is encapsulated in the speed function, providing a simple, unified computational framework. The user combines pre-defined building blocks to create the desired speed function. The surface editing operators are quickly computed and may be applied both regionally and globally. The level set framework offers several advantages. 1) By construction, self-intersection cannot occur, which guarantees the generation of physically-realizable, simple, closed surfaces. 2) Level set models easily change topological genus, and 3) are free of the edge connectivity and mesh quality problems associated with mesh models. We present five examples of surface editing operators: blending, smoothing, sharpening, openings/closings and embossing. We demonstrate their effectiveness on several scanned objects and scan-converted models.
Investigating the use of analysis contracts to support fault isolation in object oriented code
Authors: L. C. Briand, Y. Labiche, H. Sun
Venue: Proceedings of the 2002 ACM SIGSOFT international symposium on Software testing and analysis (2002)

A number of activities involved in testing software are known to be difficult and time consuming. Among them is the isolation of faults once failures have been detected. In this paper, we investigate how the instrumentation of contracts could address this issue. Contracts are known to be a useful technique to specify the precondition and postcondition of operations and class invariants, thus making the definition of object-oriented analysis or design elements more precise. Our aim in this paper is to reuse and instrument contracts to ease testing. A thorough case study is run where we define contracts, instrument them using a commercial tool, and assess the benefits and limitations of doing so to support the isolation of faults. We then draw practical conclusions regarding the applicability of the approach and its limitations.
Programming the Be Operating System
Authors: Dan Parks Sydow
Venue:  (1999)

:C++ programmers get a beginners' start to developing applications for the Be operating system. Introduction begins with typical "hello, world" programs and gradually adds elements of the graphical interface while introducing basic OS features such as threads and file handling.
Evaluation of Single Layer Potentials over Curved Surfaces
Authors: Leandro Farina
Venue: SIAM Journal on Scientific Computing (2001)

The evaluation of nearly singular single layer potentials encountered in boundary element methods is treated by a new approach. The potential is expressed as a sum of a one-dimensional integral and a correction term that vanishes for planar surfaces. The small variance of the second term's integrand allows the use of a quasi-Monte Carlo quadrature. Numerical results show that a significant reduction in computational time is obtained over algorithms employing domain subdivisions.
Haplotyping as perfect phylogeny: conceptual framework and efficient solutions
Authors: Dan Gusfield
Venue: Proceedings of the sixth annual international conference on Computational biology (2002)

The next high-priority phase of human genomics will involve the development of a full Haplotype Map of the human genome [12]. It will be used in large-scale screens of populations to associate specific haplotypes with specific complex genetic-influenced diseases. A prototype Haplotype Mapping strategy is presently being finalized by an NIH working-group. The biological key to that strategy is the surprising fact that genomic DNA can be partitioned into long blocks where genetic recombination has been rare, leading to strikingly fewer distinct haplotypes in the population than previously expected [12, 6, 21, 7].In this paper we explore the algorithmic implications of the key (and now realistic) "no-recombination in long blocks" observation, for the problem of inferring haplotypes in populations. We observe that the no-recombination assumption is very powerful. This assumption, along with the standard population-genetic assumption of infinite sites [23, 14] imposes severe combinatorial constraints on the permitted solutions to the haplotype inference problem, leading to an efficient deterministic algorithm to deduce all features of the permitted haplotype solution(s) that can be known with certainty. The technical key is to view haplotype data as disguised information about paths in an unknown tree, and the haplotype deduction problem as a problem of reconstructing the tree from that path information. This formulation allows us to exploit deep theorems and algorithms from graph and matroid theory to efficiently find one permitted solution to the haplotype problem; it gives a simple test to determine if it is the unique solution; if not, we can implicitly represent the set of all permitted solutions so that each can be efficiently created.
Efficient Internet Multicast Routing Using Anycast Path Selection
Authors: Weijia Jia, Gaochao Xu, Wei Zhao, Pui-On Au
Venue: Journal of Network and Systems Management (2002)

A novel efficient and dynamic multicast routing protocol based on anycast routing techniques is presented. The contributions of the protocol differ from well-known shared-tree systems in two aspects&colon; &lpar;1&rpar; Off-tree anycast routing&colon; The nodes in the shared tree are formed into a virtual anycast group and multicast sources use anycast routing to select a better path from the source to one router in the group to achieve short delay and fault-tolerance. &lpar;2&rpar; On-tree dynamic routing&colon; The shared-tree approach is extended with capability of alternative path selections. If a node becomes absent from the shared tree, some predefined backup path&lpar;s&rpar; is &lpar;are&rpar; used to bypass the node and enable dynamic multicast routing to continue. The protocol requires only the routers near the faulty node to be reconfigured, thus reducing the runtime overhead as compared with global reconfiguration. The simulation data demonstrates the efficiency of our routing protocol.
Secure key agreement for group communications
Authors: Wen-Her Yang, Shiuh-Pyng Shieh
Venue: International Journal of Network Management (2001)

A secure key agreement protocol for group communications is proposed in this paper, which ensures the authenticity of group members and the privacy of group messages, and provides the properties of perfect forward and backward privacy. In a group session, the common key is collaboratively established by all participants, hence the overhead of key agreement is balanced among group members.
Microsoft FrontPage 2002: Complete Concepts and Techniques, 1st edition
Authors: Gary B. Shelly, Thomas J. Cashman, Michael Mick
Venue:  (2001)

:Part of the highly successful Shelly Cashman Series, Microsoft FrontPage 2002 Complete Concepts and Techniques provides step-by-step instructions accompanied by full-color screen shots, helping students learn basic through advanced FrontPage 2002 skills quickly and easily.
Image Processing for Numerical Approximations of Conservation Laws: Nonlinear Anisotropic Artificial Dissipation
Authors: Thorsten Grahs, Andreas Meister, Thomas Sonar
Venue: SIAM Journal on Scientific Computing (2001)

We employ a nonlinear anisotropic diffusion operator like the ones used as a means of filtering and edge enhancement in image processing and in numerical methods for conservation laws. It turns out that algorithms currently used in image processing are very well suited for the design of nonlinear higher order dissipative terms. In particular, we stabilize the well-known Lax--Wendroff formula by means of a nonlinear diffusion term.
Approximate Edge Splitting
Authors: Michel X. Goemans
Venue: SIAM Journal on Discrete Mathematics (2001)

We show that, in any undirected graph, splitting-off can be performed while preserving all cuts of value at most 4/3 times the minimum value, and this is the best possible. This generalizes a classical splitting-off result of Lovász.
The Complete Idiot's Guide to iMac
Authors: Brad Miser
Venue:  (2000)

:The Complete Idiot's Guide to iMac is a comprehensive guide to learning everything there is to know about the popular PC from Apple. Some of the topics you will learn about are: setting up your iMac, email, Internet, software, working with files and folders, Mac OS 9, and system maintenance.
More on Geometries of the Fischer Group Fi22
Authors: A. A. Ivanov, C. Wiedorn
Venue: Journal of Algebraic Combinatorics: An International Journal (2002)

We give a new, purely combinatorial characterization of geometries \cal E with diagram c.F_4(1): \begin{picture}(45,5) \put(2,1){\makebox(0,0){$\circ$}} \put(12,1){\makebox(0,0){$\circ$}} \put(22,1){\makebox(0,0){$\circ$}} \put(32,1){\makebox(0,0){$\circ$}} \put(42,1){\makebox(0,0){$\circ$}} \put(32.5,1){\line(1,0){8.7}} \put(2.5,1){\line(1,0){8.7}} \put(12.5,1){\line(1,0){8.7}} \put(22.5,1.2){\line(1,0){8.9}} \put(22.5,0.8){\line(1,0){8.9}} \put(32.5,1){\line(1,0){8.7}} \put(7,2.5){c} \put(1,-2.5){\scriptsize {1}} \put(11,-2.5){\scriptsize{2}} \put(21,-2.5){\scriptsize{2}} \put(31,-2.5){\scriptsize{1}} \put(41,-2.5){\scriptsize{1}} \end{picture} identifying each under some &ldquo;natural&rdquo; conditions&mdash;but not assuming any group action a priori&mdash;with one of the two geometries \cal E(Fi22) and \cal E(3 &middot; Fi22) related to the Fischer 3-transposition group Fi22 and its non-split central extension 3 &middot; Fi22, respectively. As a by-product we improve the known characterization of the c-extended dual polar spaces for Fi22 and 3 &middot; Fi22 and of the truncation of the c-extended 6-dimensional unitary polar space.
Aggregate predicate support in DBMS
Authors: Apostol (Paul) Natsev, Gene Y. C. Fuh, Weidong Chen, Chi-Huang Chiu, Jeffrey S. Vitter
Venue: Proceedings of the 13th Australasian database conference - Volume 5 (2002)

In this paper we consider aggregate predicates and their support in database systems. Aggregate predicates are the predicate equivalent to aggregate functions in that they can be used to search for tuples that satisfy some aggregate property over a set of tuples (as opposed to simply computing an aggregate property over a set of tuples). The importance of aggregate predicates is exemplified by many modern applications that require ranked search, or top-k queries. Such queries are the norm in multimedia and spatial databases.In order to support the concept of aggregate predicates in DBMS, we introduce several extensions in the query language and the database engine. Specifically, we extend the SQL syntax to handle aggregate predicates and work out the semantics of such extensions so that they behave correctly in the existing database model. We also propose a a new rk_SORT operator into the database engine, and study relevant indexing and query optimization issues.Our approach provides several advantages, including enhanced usability and improved performance. By supporting aggregate predicates natively in the database engine, we are able to reuse existing indexing and query optimization techniques, without sacrificing generality or incurring the runtime overhead of database-external approaches. To the best of our knowledge, the proposed framework is the first to support user-defined indexing with aggregate predicates and search based upon user-defined ranking. We also provide empirical results from a simulation study that validates the effectiveness of our approach.
Modern Systems Analysis and Design, 3rd edition
Authors: Jeffrey A. Hoffer, Joseph S. Valacich, Joey F. George
Venue:  (2001)

:NEW OR EXPANDED CONTENT COVERAGE TO KEEP YOU ON THE LEADING EDGE Increased focus on "make versus buy" and systems integration. More and more systems development involves the use of packages in combination with legacy applications and new modules. Chapter 11 shows how companies deal with these issues. Coverage of Internet-based systems. The authors have redesigned the distributed systems design chapter (now Chapter 16) to also address Internet-based application design topics not covered in the other chapters: They cover Internet application design standards, how to maintain site consistency, security issues, and data warehousing, among other topics. Expanded coverage of process modeling techniques. Chapter 8 now includes an introduction to business process modeling and functional hierarchy modeling as alternatives to data flow diagramming. These three process-modeling techniques are compared so you know when to use each in practice. Unlike other SAD texts, Modern Systems Analysis and Design has continually offered strong coverage of RAD  an important element in systems design. FEATURES THAT MAKE THIS EDITION AN INDISPENSABLE RESOURCE: Expanded and updated coverage of systems analysis as a profession Updated coverage of codes of conduct and new material on how systems professionals approach business problems with ethical considerations. Updated information on career paths with the latest information gathered from professional societies. Net Search Exercises New marginicons for Net Search exercises on the Web site can be found in every chapter. The icon signals when a topic in the text has a corresponding Net Search exercise on the Web site. Integration of Electronic commerce into the running cases One of three fictional running cases in the text, Pine Valley Furniture, is a furniture company founded in 1980, that now, in the Third Edition, has decided to explore electronic commerce as an avenue to increase its market share. Broadway Entertainment Company, Inc., BEC, a fictional video and record retailer, is a project case that allows you to study and develop a Web-based customer relationship management system.