ppxscal/embedding_network huggingface dataset:
Simple algorithms for partial point set pattern matching under rigid motion
Authors: Arijit Bishnu, Sandip Das, Subhas C. Nandy, Bhargab B. Bhattacharya
Venue: Pattern Recognition (2006)

This paper presents simple and deterministic algorithms for partial point set pattern matching in 2D. Given a set P of n points, called sample set, and a query set Q of k points (n>=k), the problem is to find a matching of Q with a subset of P under rigid motion. The match may be of two types: exact and approximate. If an exact matching exists, then each point in Q coincides with the corresponding point in P under some translation and/or rotation. For an approximate match, some translation and/or rotation may be allowed such that each point in Q lies in a predefined @e-neighborhood region around some point in P. The proposed algorithm for the exact matching needs O(n^2) space and O(n^2logn) preprocessing time. The existence of a match for a given query set Q can be checked in O(k@alogn) time in the worst-case, where @a is the maximum number of equidistant pairs of point in P. For a set of n points, @a may be O(n^4^/^3) in the worst-case. Some applications of the partial point set pattern matching are then illustrated. Experimental results on random point sets and some fingerprint databases show that, in practice, the computation time is much smaller than the worst-case requirement. The algorithm is then extended for checking the exact match of a set of k line segments in the query set with a k-subset of n line segments in the sample set under rigid motion in O(knlogn) time. Next, a simple version of the approximate matching problem is studied where one point of Q exactly matches with a point of P, and each of the other points of Q lie in the @e-neighborhood of some point of P. The worst-case time and space complexities of the proposed algorithm are O(n^2k^2logn) and O(n), respectively. The proposed algorithms will find many applications to fingerprint matching, image registration, and object recognition.
Killer Game Programming in Java
Authors: Andrew Davison
Venue:  (2005)

Although the number of commercial Java games is still small compared to those written in C or C++, the market is expanding rapidly. Recent updates to Java make it faster and easier to create powerful gaming applications-particularly Java 3D-is fueling an explosive growth in Java games. Java games like Puzzle Pirates, Chrome, Star Wars Galaxies, Runescape, Alien Flux, Kingdom of Wars, Law and Order II, Roboforge, Tom Clancy's Politika, and scores of others have earned awards and become bestsellers. Java developers new to graphics and game programming, as well as game developers new to Java 3D, will find Killer Game Programming in Java invaluable. This new book is a practical introduction to the latest Java graphics and game programming technologies and techniques. It is the first book to thoroughly cover Java's 3D capabilities for all types of graphics and game development projects. Killer Game Programming in Java is a comprehensive guide to everything you need to know to program cool, testosterone-drenched Java games. It will give you reusable techniques to create everything from fast, full-screen action games to multiplayer 3D games. In addition to the most thorough coverage of Java 3D available, Killer Game Programming in Java also clearly details the older, better-known 2D APIs, 3D sprites, animated 3D sprites, first-person shooter programming, sound, fractals, and networked games. Killer Game Programming in Java is a must-have for anyone who wants to create adrenaline-fueled games in Java.
Handling degeneracies in exact boundary evaluation
Authors: Koji Ouchi, John Keyser
Venue: Proceedings of the ninth ACM symposium on Solid modeling and applications (2004)

We present a method for dealing with degenerate situations in an exact boundary evaluation system. We describe the possible degeneracies that can arise and how to detect them. We then present a numeric perturbation method that is simpler to implement within a complex system than symbolic perturbation methods.
The Molen compiler for reconfigurable processors
Authors: Elena Moscu Panainte, Koen Bertels, Stamatis Vassiliadis
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2007)

In this paper, we describe the compiler developed to target the Molen reconfigurable processor and programming paradigm. The compiler automatically generates optimized binary code for C applications, based on pragma annotation of the code executed on the reconfigurable hardware. For the IBM PowerPC 405 processor included in the Virtex II Pro platform FPGA, we implemented code generation, register, and stack frame allocation following the PowerPC EABI (embedded application binary interface). The PowerPC backend has been extended to generate the appropriate instructions for the reconfigurable hardware and data transfer, taking into account the information of the specific hardware implementations and system. Starting with an annotated C application, a complete design flow has been integrated to generate the executable bitstream for the reconfigurable processor. The flexible design of the proposed infrastructure allows to consider the special features of the reconfigurable architectures. In order to hide the reconfiguration latencies, we implemented an instruction-scheduling algorithm for the dynamic hardware configuration instructions. The algorithm schedules, in advance, the hardware configuration instructions, taking into account the conflicts for the reconfigurable hardware resources (FPGA area) between the hardware operations. To verify the Molen compiler, we used the multimedia video frame M-JPEG encoder of which the extended discrete cosine transform (DCT&ast;) function was mapped on the FPGA. We obtained an overall speedup of 2.5 (about 84&percnt; efficiency over the maximal theoretical speedup of 2.96). The performance efficiency is achieved using automatically generated nonoptimized DCT&ast; hardware implementation. The instruction-scheduling algorithm has been tested for DCT, quantization, and VLC operations. Based on simulation results, we determine that, while a simple scheduling produces a significant performance decrease, our proposed scheduling contributes for up to 16x M-JPEG encoder speedup.
Assignment scheduling capability for unmanned aerial vehicles: a discrete event simulation with optimization in the loop approach to solving a scheduling problem
Authors: Darryl K. Ahner, Arnold H. Buss, John Ruck
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Many military planning problems are difficult to solve using pure mathematical programming techniques. One such problem is scheduling unmanned aerial vehicles (UAVs) in military operations subject to dynamic movement and control constraints. This problem is instead formulated as a dynamic programming problem whose approximate solution is obtained via the Assignment Scheduling Capability for UAVs (ASC-U) model using concepts from both simulation and optimization. Optimization is very effective at identifying the best decision for static problems, but is weaker in identifying the best decision in dynamic systems. Simulation is very effective in modeling and capturing dynamic effects, but is weak in optimizing from alternatives. ASC-U exploits the relative strengths of both methodologies by periodically re-optimizing UAV assignments and then having the simulation transition the states according to state dynamics. ASC-U thus exploits the strengths of simulation and optimization to construct good, timely solutions that neither optimization nor simulation could achieve alone.
Strong and weak points of the MUSCADET theorem prover - examples from CASC-JC
Authors: Dominique Pastre
Venue: AI Communications (2002)

MUSCADET is a knowledge-based theorem prover based on natural deduction. It has participated in CADE Automated theorem proving System Competitions. The results show its complementarity with regard to resolution-based provers. This paper presents some of its crucial methods and gives some examples of MUSCADET proofs from the last competition (CASC-JC in IJCAR 2001).
Detection of nuclear material at border crossings using motion correlation
Authors: David M. Nicol, Rose Tsang, Heidi Ammerlahn, Michael Johnson
Venue: Proceedings of the 38th conference on Winter simulation (2006)

This paper considers the problem that arises when a vehicle carrying nuclear material is detected approaching a border crossing. As quickly as possible, and with automation we wish to identify which vehicle among all those in the area is likely to be carrying the source. We show that if the border crossing area has technology for tracking the position of vehicles, we can correlate observed movements with observed changes in levels of detected radiation---for as the vehicle carrying the material gets closer to the detector, the stronger will be the detected radiation. We use a simulation model that captures the stop-and-go dynamics of a border crossing area to evaluate our ideas, and find a highly successful technique that tracks which vehicles move just when detected radiation changes, coupled with fitting radiation intensity/distance observations to an inverse-square law. This method almost always isolates the sought vehicle just as soon as the minimum number of data observations is obtained.
Collective entity resolution in relational data
Authors: Indrajit Bhattacharya, Lise Getoor
Venue: ACM Transactions on Knowledge Discovery from Data (TKDD) (2007)

Many databases contain uncertain and imprecise references to real-world entities. The absence of identifiers for the underlying entities often results in a database which contains multiple references to the same entity. This can lead not only to data redundancy, but also inaccuracies in query processing and knowledge extraction. These problems can be alleviated through the use of entity resolution. Entity resolution involves discovering the underlying entities and mapping each database reference to these entities. Traditionally, entities are resolved using pairwise similarity over the attributes of references. However, there is often additional relational information in the data. Specifically, references to different entities may cooccur. In these cases, collective entity resolution, in which entities for cooccurring references are determined jointly rather than independently, can improve entity resolution accuracy. We propose a novel relational clustering algorithm that uses both attribute and relational information for determining the underlying domain entities, and we give an efficient implementation. We investigate the impact that different relational similarity measures have on entity resolution quality. We evaluate our collective entity resolution algorithm on multiple real-world databases. We show that it improves entity resolution performance over both attribute-based baselines and over algorithms that consider relational information but do not resolve entities collectively. In addition, we perform detailed experiments on synthetically generated data to identify data characteristics that favor collective relational resolution over purely attribute-based algorithms.
Synchronous and Asynchronous Communications in Composable Parameterized High-Level Petri Nets
Authors: Raymond Devillers, Hanna Klaudel
Venue: Fundamenta Informaticae (2004)

In the domain of parameterized composable high-level Petri nets (M-nets), we shall combine the refinement, the synchronization and the asynchronous link operations in a unified and general setup, while keeping the expected properties of those operations. In particular, the various high-level net operations are consistent through unfolding with their low-level counterparts, and the usual commutativity and idempotency properties are fulfilled at the syntactic level up to structural equivalences.
A comparative study of combining multiple enrolled samples for fingerprint verification
Authors: Chunyu Yang, Jie Zhou
Venue: Pattern Recognition (2006)

In fingerprint verification systems, there are usually multiple (from two to four) enrolled impressions for a same finger. The performance of the systems can be improved by combining these impressions through feature fusion or decision fusion strategy. In this paper, different schemes to combine multiple enrolled impressions are comparatively studied. Experimental results show that a larger improvement can be obtained by using decision fusion scheme than feature fusion. In all decision fusion rules, sum rule outperforms voting rule a little whether using similarity or Neyman-Pearson rule. Based on the observation that the performance of these two strategies can complement each other, we also propose a novel fusion scheme to further combine feature fusion and decision fusion, which can produce an even better result.
TCP offload through connection handoff
Authors: Hyong-youb Kim, Scott Rixner
Venue: ACM SIGOPS Operating Systems Review (2006)

This paper presents a connection handoff interface between the operating system and the network interface. Using this interface, the operating system can offload a subset of TCP connections in the system to the network interface, while the remaining connections are processed on the host CPU. Offloading can reduce computation and memory bandwidth requirements for packet processing on the host CPU. However, full TCP offloading may degrade system performance because finite processing and memory resources on the network interface limit the amount of packet processing and the number of connections. Using handoff, the operating system controls the number of offloaded connections in order to fully utilize the network interface without overloading it. Handoff is transparent to the application, and the operating system may choose to offload connections to the network interface or reclaim them from the interface at any time. A prototype system based on the modified FreeBSD operating system shows that handoff reduces the number of instructions and cache misses on the host CPU. As a result, the number of CPU cycles spent processing each packet decreases by 16--84%. Simulation results show handoff can improve web server throughput (SEPCweb99) by 15%, despite short-lived connections.
Computer aided design and design automation in Europe
Authors: Waldo G. Magnuson,  Jr.
Venue: ACM SIGDA Newsletter (1976)

This document is issued primarily for the informtion of U.S. Government scientific personnel and contractors. It is not considered part of the scientific literature and should not be cited as such.
Expert Oracle PL/SQL, 1 edition
Authors: Ron Hardman, Michael McLaughlin
Venue:  (2005)

Experienced PL/SQL programmers and Oracle developers will learn to master Oracle's procedural extension to industry-standard SQL. Using this authoritative resource, readers will become experts at developing robust, high-performance enterprise applications with PL/SQL. Detailed examples describe the practical aspect of each feature, and provide ideas to the reader of how they can best exploit the functionality.
Understanding DB2(R): Learning Visually with Examples
Authors: Raul F. Chong, Clara Liu, Sylvia F. Qi, Dwaine R. Snow
Venue:  (2005)

The Easy, Visual Guide to IBM DB2 V8.2IBM DB2 Universal Database™ V8.2 for Linux®, UNIX®, and Windows® is a flexible, scalable, cost-effective, and easy-to-use enterprise database. Now, one book makes DB2 even easier. Understanding DB2 teaches DB2 V8.2 visually, step by step, with dozens of examples and case studies drawn from the authors' unsurpassed experience as DB2 consultants at IBM.Understanding DB2 doesn't just present the big picture. It thoroughly introduces every DB2 concept, procedure, and tool you'll need to get results as an administrator, user, or developer. You'll find authoritative coverage of installation, configuration, objects, database instances, storage, connectivity, security, performance, backup and recovery, SQL fundamentals, and much more. Virtually every new concept is explained with screenshots, diagrams, or tables, all designed to help you learn faster and remember more.For those preparing for certification, this book also contains over a hundred sample questions crafted by the authors to reflect the content and format of the IBM DB2 UDB Database Administration Certification exams, with answers and detailed explanations.Coverage includes Understanding the DB2 product family, DB2 commands, and the DB2 environment Configuring client and server connectivity: walkthroughs of four typical scenarios Managing DB2 storage: partitions, tablespaces, buffer pools, and more Leveraging the power of SQL: queries, inserts, deletes, and updates Implementing security: encryption, authentication, and authorization Administering and maintaining data, from LOAD and EXPORT to backup/recovery Providing high availability with online split mirroring and suspended I/O DB2 architecture: process and memory models Managing database performance and troubleshooting
Network Virtualization (Networking Technology)
Authors: Victor Moreno, Kumar Reddy
Venue:  (2006)

Share network resources and reduce costs while providing secure network services to diverse user communities Presents the business drivers for network virtualization and the major challenges facing network designers today Shows how to use virtualization designs with existing applications, such as VoIP and network services, such as quality of service and multicast Provides design alternatives for different real-world deployment scenarios, with configuration examples and case studiesï¾ Today's enterprises have several groups of users with specific needs. The differences between these groups translate into specific network requirements. Within some organizations, these requirements are so dissimilar that the different groups need to be treated as totally separate customers by the enterprise's IT department. As the number of groups increases, keeping them separate and secure is a challenge to IT departments, particularly with the advent of wireless networks, the requirement for enterprise-wide user mobility, and the need for cross group collaboration with resource sharing on a per project basis. Network Virtualization provides design guidance for virtualized enterprise networks and arms network architects with the background necessary to make sound technological choices in the face of different business requirements. As a means of introduction, Network Virtualization lays out the fundamentals of enterprise network design. The book builds upon these fundamental principles to introduce the different virtualization methods as the logical evolution of the enterprise network architecture. Detailed descriptions of the technology, design principles, network configurations, and real-world case studies are provided throughout the book, helping readers develop a pragmatic understanding of virtualized enterprise network architectures. Specific examples are included that tailor deployment advice to the small, medium, and large enterprise environment.
Symposium on nonlinear programming at the George Washington University
Authors: Larry Haverly
Venue: Issue 14 (May 1973) (1973)

A Symposium on Nonlinear Programming was held at The George Washington University on 14-16 March 1973. It was sponsored by the Mathematical Programming Society under the auspices of the Office of Naval Research and the university's Department of Operations Research. The conference was organized and conducted by Anthony V. Fiacco (Program Chairman), Garth P. McCormick (Arrangements Chairman) and James E. Falk (Publicity Chairman). 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
Cognitive high level information fusion
Authors: Leonid I. Perlovsky
Venue: Information Sciences: an International Journal (2007)

Fusion of sensor and communication data currently can only be performed at a late processing stage after sensor and textual information are formulated as logical statements at appropriately high level of abstraction. Contrary to this it seems, the human mind integrates sensor and language signals seamlessly, before signals are understood, at pre-conceptual level. Learning of conceptual contents of the surrounding world depends on language and vice versa. The paper describes a mathematical technique for such integration. It combines fuzzy dynamic logic with dual cognitive-language models. The paper briefly discusses relationships between the proposed mathematical technique, working of the mind and applications to understanding-based search engines.
Faster and more robust point symmetry-based K-means algorithm
Authors: Kuo-Liang Chung, Jhin-Sian Lin
Venue: Pattern Recognition (2007)

Based on the recently published point symmetry distance (PSD) measure, this paper presents a novel PSD measure, namely symmetry similarity level (SSL) operator for K-means algorithm. Our proposed modified point symmetry-based K-means (MPSK) algorithm is more robust than the previous PSK algorithm by Su and Chou. Not only the proposed MPSK algorithm is suitable for the symmetrical intra-clusters as the PSK algorithm does, the proposed MPSK algorithm is also suitable for the symmetrical inter-clusters. In addition, two speedup strategies are presented to reduce the time required in the proposed MPSK algorithm. Experimental results demonstrate the significant execution-time improvement and the extension to the symmetrical inter-clusters of the proposed MPSK algorithm when compared to the previous PSK algorithm.
Lessons identified from data collection for model validation
Authors: Alan Cowdale
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Computer simulation models will ideally be developed within an environment where all the necessary input data is readily available and all the relevant stakeholders are supportive and co-operative. In practice, many models are developed for the purpose of evaluating organisational or process change. As a result, system performance data may often be limited or potentially biased by key parties associated with the results of the simulation model. Ensuring valid input data is therefore a key aspect of model validation and an important component in a successful simulation study. This paper addresses some examples of data collection problems that have been encountered by the author and presents a number of lessons identified.
Networking: A Beginner's Guide, Fourth Edition, 4 edition
Authors: Bruce Hallberg
Venue:  (2005)

Here is an unparalleled introduction to networking, offering easy-to-follow details on design and configuration, hardware, networking protocols, remote access, and security. This updated guide contains expanded coverage of wireless networking, the latest Windows and Linux releases, and security measures. New networking professionals will first learn what they need to know about network technology, and then how to apply that knowledge to set up, manage, and secure networks.Table of contentsINTRODUCTIONSection I: Networking Ins and OutsChapter 1: The Business of Networking Chaper 2: Laying the Foundation Chapter 3: Networking OverviewChapter 4: Network Cabling Chapter 5: SOHO Networking Chapter 6: Network Hardware Chapter 7: Make Network Connections Chapter 8: Networking Protocols Chapter 9: Inspect Directory Services Chapter 10: Connections from Afar: Remote Network AccessChapter 11: Secure Your NetworkChapter 12: Network Disaster Recovery Chapter 13: Purchase and Manage Server Hardware Chapter 14: Purchase and Manage Client Computers Section II: Hands On KnowledgeChapter 15: Design a Network Chapter 16: Install and Set up Windows 2000 ServerChapter 17: Administer Windows 2000 Server: the BasicsChapter 18: Other Windows 2000 Server ServicesChapter 19: Windows Server 2003 Chapter 20: Install Windows Server 2003 Chapter 21: Set up a Small Network with Windows Server 2003 Chapter 22: Install and Set up LinuxChapter 23: Administer Linux: The BasicsChapter 24: Set up a Linux Web Server with Apache