ppxscal/embedding_network huggingface dataset:
Offline General Handwritten Word Recognition Using an Approximate BEAM Matching Algorithm
Authors: John T. Favata
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

A recognition system for general isolated offline handwritten words using an approximate segment-string matching algorithm is described. The fundamental paradigm employed is a character-based segment-then-recognize/match strategy. Additional user supplied contextual information in the form of a lexicon guides a graph search to estimate the most likely word image identity. This system is designed to operate robustly in the presence of document noise, poor handwriting, and lexicon errors, so this basic strategy is significantly extended and enhanced. A preprocessing step is initially applied to the image to remove noise artifacts and normalize the handwriting. An oversegmentation approach is taken to improve the likelihood of capturing the individual characters embedded in the word. The goal is to produce a segmentation point set that contains one subset which is the correct segmentation of the word image. This is accomplished by a segmentation module, employing several independent detection rules based on certain key features, which finds the most likely segmentation points of the word. Next, a sliding window algorithm, using a character recognition algorithm with a very good noncharacter rejection response, is used to find the most likely character boundaries and identities. A directed graph is then constructed that contains many possible interpretations of the word image, many implausible. Contextual information is used at this point and the lexicon is matched to the graph in a breath-first manner, under an appropriate metric. The matching algorithm employs a BEAM search algorithm with several heuristics to compensate for the most likely errors contained in the interpretation graph, including missing segments from segmentation failures, misrecognition of the segments, and lexicon errors. The most likely graph path and associated confidence is computed for each lexicon word to produce a final lexicon ranking. These confidences are very reliable and can be later thresholded to decrease total recognition error. Experiments highlighting the characteristics of this algorithm are given.
Running Microsoft Outlook 97
Authors: Russell Borland
Venue:  (1997)

:It's packed with everything from quick, clear instructions for new users to comprehensive answers for power users. And it's complete in one volume. In short, Running Microsoft Outlook 97 is the authoritative handbook you'll keep by your computer and use every day. "Chapters at a Glance" for quick reference, master table of contents, extensive cross-referenced index, "Quick Reference" tear-out card, step-by-step instructions, hundreds of screen illustrations, real-world examples, tips and advice from the experts, and CD Loaded with Must-Have Extras: Find information fast with a searchable version of the book on disc, includes Microsoft Internet Explorer, extend your knowledge of Outlook with articles from Microsoft's Knowledge Base, and use Outlook add-ons to extend Outlook's capabilities.
Using Visual Basic 5 with Cdrom, 1st edition
Authors: Loren Eidahl
Venue:  (1997)

:Platinum Edition Using s unique approach provides an unparalleled reference and tutorial by assuming basic knowledge at the start and then progressing rapidly into more challenging issues. The two hottest and least understood topics in Visual Basic today are COM programming and distributed computing. Platinum Editing Using Visual Basic 5 covers both topics in exhaustive depth using clear examples and concise writing. The CD-ROMs provide the finishing touches with thousands of additional pages of Visual Basic coverage, a vast array of pre-built controls, a library of complete applications, and a comprehensive electronic index.Designed for the developer who wants in depth coverage of core topics and new technologies and featuresProvides an unparalleled reference and tutorial by assuming basic knowledge at the start and then progressing rapidly into more challenging issuesCovers COM programming and distributed computing in exhaustive depth, using clear examples and concise writing
Simulation of transport protocols over wireless communication networks
Authors: Hala ElAarag, Mostafa Bassiouni
Venue: Proceedings of the 32nd conference on Winter simulation (2000)

In this paper, we describe a general-purpose communication network simulator that we designed to examine the performance of transport protocols over wireless networks. The general-purpose simulator can be used to study various aspects of performance of communication networks. In particular, we use it to examine, evaluate and predict the performance of wireless networks under a variety of the most commonly used transport protocols. We also examine the use of newly suggested protocols specifically designed for wireless networks. in this paper, we present our models for each protocol. We discuss performance measures that can be studied using our simulator. These measures are hard to evaluate with analytical models.
Teach Yourself TCP/IP in 14 Days
Authors: Timothy Parker
Venue:  (1994)

:TCP/IP is the predominant network protocol in use today. The strong focus in the industry on client-server systems, Internetworking, an Internet connectivity makes this book a needed reference. Its tutorial format covers all basic aspects of TCP/IP and explores its advanced capabilities and uses in the workplace.Covers the local area network environmentIncludes new material which instructs readers on how to configure TCP/IP with Windows 95 and other operating systemsCD-ROM includes source code from the book and powerful utilities
Engineering Design Graphics: With AutoCAD Release 14 and 2000, 10th edition
Authors: James H. Earle
Venue:  (2000)

:Back Cover While retaining many of the features that have made previous editions so successful, the tenth edition incorporates a number of key revisions that help make it the most comprehensive, and classically modern. Eight chapters cover the 6 complete design process -from preliminary ideas to implementation - including a full chapter containing design problems Integrates Computer Methods boxes throughout Includes Chapter 23: Working Drawings which, can be used to create a variety of additional classroom assignments Incorporates civil engineering applications and specialty chapters on pipe drafting and electric/electronics drafting Classically Modern Features coverage of 3D methods and solid modeling, as well as complete coverage of traditional 2D drawing methods Updated coverage of AutoCAD&#174 Release 2000. Features a chapter on career options to gets the reader thinking about the future Incorporates a second color throughout as a teaching and learning aid Step-by-step methods are outlined in figure captions - not buried in book
Mastering the AS/400: A Practical Hands-on Guide
Authors: Jerry Fottral
Venue:  (1996)

:This textbook is an introduction to AS/400 concepts and facilities with a decidedly utilitarian approach that stresses student participation. This introductory material is a natural prerequisite to programming and database management courses. It emphasizes mastery of system/user interface, member-object-library relationship, utilization of CL commands, basic database and program development utilities. 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
Approximating unweighted connectivity problems in parallel
Authors: Zhi-Zhong Chen
Venue: Information and Computation (2002)

Given an integer, i > k < i and a k-edge-connected graph G=(V, E), we wish to find an E'E of minimum size such that the graph (V, E') is k-edge-connected. This problem is NP-hard and the best performance ratio achieved by known NC approximation algorithms is 2. For the special case where the input integer k is fixed to be 2, it is known that a performance ratio of 1.5 + &epsilon; for any &epsilon; >0 can be achieved by an NC approximation algorithm. This paper considers the more general case where k is polylogarithmic in the size of the input graph, and presents the first NC approximation algorithm with a performance ratio of 1.924 for this case. We also consider the vertex analogue of this problem in which we require k-vertex-connectivity instead of k-edge-connectivity. We present the first NC approximation algorithm with a performance ratio of 1.931 for the special case where the input integer k is fixed to be 3. 2001 Elsevier Science
Words Have Wings: Teaching and Learning with Computer Networks
Authors: Kwok-Wing Lai
Venue:  (1996)

:This book is for anyone using networks in education: practical and time-saving information for many curriculum areas; an introduction and an overview; how to mine the Internet to support classroom work, and personal research; and information about many educational networks, including the Maori network Te Wahapu. 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
Security status display and browser interframe communication
Authors: Larry A. Dunning, Sub Ramakrishnan
Venue: Proceedings of the 2002 ACM symposium on Applied computing (2002)

We argue that current WWW protocols are anticompetitive and favor larger WWW retailers and service providers. Consumer confidence has been recognized as an impediment to the development of smaller WWW based businesses and the growth of online transactions. Consumers are understandably concerned about using their credit card number to make WWW purchases.Our assertion is that the development of standards which would allow payment providers to interface with vendors and consumers to interface with vendors with confidence has been made difficult by current browser standards. We suggest that changes can reasonably be made which would make the task of developing such interface protocols easier while enhancing consumer confidence. Changes in the direction we suggest could assist in enhancing competition, consumer security and privacy, as well as confidence. In addition, it would be easier to develop protocols to allow consumer choice of payment providers, shippers, and other services ancillary to an online transaction.
TreeDT: gene mapping by tree disequilibrium test
Authors: Petteri Sevon, Hannu T. T. Toivonen, Vesa Ollikainen
Venue: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining (2001)

We introduce and evaluate TreeDT, a novel gene mapping method which is based on discovering and assessing tree-like patterns in genetic marker data. Gene mapping aims at discovering a statistical connection from a particular disease or trait to a narrow region in the genome. In a typical case-control setting, data consists of genetic markers typed for a set of disease-associated chromosomes and a set of control chromosomes. A computer scientist would view this data as a set of strings.TreeDT extracts, essentially in the form of substrings and prefix trees, information about the historical recombinations in the population. This information is used to locate fragments potentially inherited from a common diseased founder, and to map the disease gene into the most likely such fragment. The method measures for each chromosomal location the disequilibrium of the prefix tree of marker strings starting from the location, to assess the distribution of disease-associated chromosomes.We evaluate experimentally the performance of TreeDT on realistic, simulated data sets, and comparisons to state of the art methods (TDT, HPM) show that TreeDT is very competitive.
FAR: fixed-points addition & relaxation based placement
Authors: Bo Hu, Malgorzata Marek-Sadowska
Venue: Proceedings of the 2002 international symposium on Physical design (2002)

In this paper we describe the Fixed-points Addition and Relaxation (FAR) based placement technique. Fixed point is a pseudo cell connected to a movable cell. By introducing fixed points, the placement can be maintained in a force equilibrium state and further transformed into another equilibrium state. By relaxing some of the previously introduced fixed points, we can partially or completely collapse the current placement in order to reposition the cells, or incrementally perturb the existing good solution to fulfill additional requirements. We apply the FAR-based approach to global placement for total wire length minimization, and to incremental placement for Buffer Site Generation (BSG). For global placement, our experimental results show that the FAR method achieves 54.4% CPU speedup and total wire length comparable to that achieved by the constant force based approach [1]. Experimental results indicate that to accommodate buffers in specific regions, FAR is able to perturb incrementally a given solution in a well-controlled way.
Networks and Imaging Systems in a Windowed Environment
Authors: Marc R. D'Alleyrand
Venue:  (1993)

:Here's your complete guide to planning, designing, implementing and managing multi-station image storage and retrieval systems that operate under windows applications. This practical book discusses the trade-offs involved when displaying and retrieving large amounts of data in small, multi-station, windowed environments and helps you overcome design hurdles and optimize your imaging system performance. Presented from a user perspective and written in a clear, non-technical style, the book is a one-stop resource for designers, users and planners of office systems, technical support personnel and IS students. 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
Scalable interest management using interest group based filtering for large networked virtual environments
Authors: Seunghyun Han, Mingyu Lim, Dongman Lee
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2000)

As distributed virtual environment (DVE) scales in terms of users and network latency, a key aspect to consider is scalability for interactive performance because a large number of objects likely impose heavy burden especially on the network and computational resources. To improve the scalability, various relevance-filtering mechanisms and aggregation mechanisms have been proposed. However the existing filtering mechanisms do not scale well in terms of interactive performance as the number of users increases and crowds in a specific place.In this paper, we propose a new scalable filtering scheme that reduces the number of messages by dynamically grouping users based on their interests and distance. Within a group, members communicate with each other with high fidelity. However, a representative sends up-to-dated group information of members with low transmission frequency when they are not of immediate interest but are still within the interest area. The representative is elected from members of the group in distributed manner. The proposed scheme enhances the interactive performance scalability of large-scale DVE systems as much as 18% compared with the existing approach.
Microsoft Project 98 Quick Source Reference Guide
Authors: CORPORATE Quick Source Staff
Venue:  (2000)

:This 6 page, tri-fold full-color guide is an invaluable resource for anyone who uses Project 98. It provides step by step instructions on how to: work with templates; work in different views; use the task table; track, reschedule, link and split tasks; define resources; use the calendar; format; edit reports; print; and much more! An excellent instructional tool for a user new to Project 98, it also serves as a handy reference tool for the more experienced user.Author Biography: Quick Source is a national supplier of training materials to corporations throughout the United States.
Saving Federal Travel Dollars
Authors: Jeffrey L. Huisingh, Harold M. Yamauchi, Randy Zimmerman
Venue: Interfaces (2001)

Federal employees frequently travel to professional-development conferences and training events. Conference planners often decide on event locations arbitrarily with little regard for travel cost. We developed a method for evaluating travel costs and determining the least expensive conference site from over 261 US cities with government-contracted air-fares. It involves using the relaxation method for solving the noncapacitated shortest-path-network problem and computing interairport distances using latitude and longitude data. A decision support tool called OffSite allows conference planners to assess collective travel costs for attendees arriving from geographically dispersed locations. Event planners input a list of origin cities for conference participants, and OffSite then determines the lowest-cost location. This tool can restrict the search for meeting venues to the origin locations of potential hosts for the conference. In addition, OffSite is flexible enough to allow planners to choose a preferred destination.
A performance evaluation of storing XML data in relational database management systems
Authors: Latifur Khan, Yan Rao
Venue: Proceedings of the 3rd international workshop on Web information and data management (2001)

XML is an emerging standard for the representation and exchange of Internet data. Along with document type definition (DTD), XML permits the execution of a collection of queries, using XPath to identify data in XML documents. In this paper we examine how XML data can be stored and queried using a standard relational database management system (RDBMS). For this, we propose a technique for automatic mapping from an XML document to relations within the RDBMS. We demonstrate that our novel approach preserves the nested structure of the XML documents. By hiding database details we devise a seamless, transparent framework for user access to XML data. In order to achieve this, we propose a novel mechanism for translating an XPath query into an SQL statement. Furthermore, we propose efficient techniques for the construction of an XML document on the fly from the result set of the SQL statement. We also present findings in terms of query response time on the comparative performance of different techniques for the construction of an XML document on the fly.
Wireless technology: protocols, standards, and techniques
Venue:  (2002)

Wireless Technology: protocols, standards and techniques has sorted it out for you. From basic principles to the state of the art, it furnishes clear, concise descriptions of second and third generation wireless technologies. The bestselling author of the Foundations of Mobile Radio Engineering has gathered together the most up-to-date networking standards, techniques, and protocols to form the most current and complete wireless reference available.
Fractal Dreams: New Media in Social Context
Authors: Jon Dovey
Venue:  (1996)

:CD-ROM, CDI, VR... the digital media revolution is upon us - or so, this book argues, we are being led to believe. The essays in Fractal Dreams set out to explore what is new about New Media, mapping the territory of the mediasphere and distinguishing what is actual and what is virtual in these new worlds. In these specially commissioned pieces, practitioners of New Media and cultural critics from Britain and North America grapple with key issues such as: who has access to technology? Is consumerism the same as access? Will art and everyday life finally merge in the shopping malls rather than the revolution? 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
Understanding how to improve the accessibility of computers through cursor control studies
Authors: Simeon Keates, P. John Clarkson, Peter Robinson
Venue: CHI '02 extended abstracts on Human factors in computing systems (2002)

People with motion-impairments often find it difficult to perform many of the actions required to interact with a computer. This paper presents the results of an on-going series of experiments designed to understand how using force feedback affects interaction for motion-impaired users. Point and click tasks were analyzed using new cursor control measures. The results showed significant improvement in throughput for all users with force-feedback and the cursor control measures were effective in capturing the differences between the conditions.
MCSE Training Guide: Microsoft Exchange Server 5.5, 1st edition
Authors: Robert Wallingsford
Venue:  (1998)

:MCSE Training Guide: Microsoft Exchange Server 5.5 covers each exam objective in detial and includes numerous review questions and exercises to prepare readers for the actual exam. 1. Introduction 2. Planning 3. Installation and Configuration 4. Configuring and Managing Resource Access 5. Monitoring and Optimization 6. Troubleshooting Differences between Exchange Server 5.5 and the previous version of the software are highlighted in order to assist the knowledgeable reader in getting up to speed quickly.{ This book has been crafted to mirror the same structure as the exam in order to reduce total study time as well as increase readers awareness of exam-specific information{ The most thorough study materials you will need to pass the Microsoft Exchange 5.5 exam: Implementing and Supporting Microsoft Exchange Server 5.5 (70-81){ Study test questions and practice taking the exam with the exclusive TestPrep test engine on the CD-ROM 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
Troubleshooting and Repairing PCs: Beyond the Basics, 3rd edition
Authors: Michael F. Hordeski
Venue:  (1997)

:One of the strongest-selling technician's guides to PC repair, this well-illustrated volume is now revised to place greater emphasis on Windows-related PCs, which present a unique set of system-specific troubleshooting and repair challenges. The author provides simnple, ste-by-step strategies for keeping IBM pCs and compatible 286, 386, 486, and Pentium systems up and running. 325 illustrations.
A finite element-boundary element algorithm for inhomogeneous boundary value problems
Authors: Michael Jung, Olaf Steinbach
Venue: Computing (2002)

For the solution of inhomogeneous boundary value problems in complex three-dimensional domains we propose a successively coupled finite-boundary element method. By using a finite element method in a simpler auxiliary domain we first compute a particular solution of the inhomogeneous partial differential equation. This solution is used in a second step to approximate the Newton potential in the boundary integral formulation which is related to the original boundary value problem. A rigorous error analysis and a numerical example are given.