ppxscal/embedding_network huggingface dataset:
How to Build a Digital Library
Authors: Ian H. Witten, David Bainbridge
Venue:  (2002)

:Given modern society's need to control its ever-increasing body of information, digital libraries will be among the most important and influential institutions of this century. With their versatility, accessibility, and economy, these focused collections of everything digital are fast becoming the "banks" in which the world's wealth of information is stored. How to Build a Digital Library is the only book that offers all the knowledge and tools needed to construct and maintain a digital library-no matter how large or small. Two internationally recognized experts provide a fully developed, step-by-step method, as well as the software that makes it all possible. How to Build a Digital Library is the perfectly self-contained resource for individuals, agencies, and institutions wishing to put this powerful tool to work in their burgeoning information treasuries. Features Sketches the history of libraries-both traditional and digital-and their impact on present practices and future directions Offers in-depth coverage of today's practical standards used to represent and store information digitally Uses Greenstone, freely accessible open-source software-available with interfaces in the world's major languages (including Spanish, Chinese, and Arabic) Written for both technical and non-technical audiences Web-enhanced with software documentation, color illustrations, full-text index, source code, and more Author Biography: Ian H. Witten is a professor of computer science at the University of Waikato in New Zealand. He directs the New Zealand Digital Library research project. His research interests include information retrieval, machine learning, text compression, and programming by demonstration. He received an MA in Mathematics from Cambridge University, England; an MSc in Computer Science from the University of Calgary, Canada; and a PhD in Electrical Engineering from Essex University, England. He is a fellow of the ACM and of the Royal Society of New Zealand. He has published widely on digital libraries, machine learning, text compression, hypertext, speech synthesis and signal processing, and computer typography. He has written several books, the latest being Managing Gigabytes (1999) and Data Mining (2000), both from Morgan Kaufmann. David Bainbridge is a senior lecturer in Computer Science at the University of Waikato, New Zealand. He holds a PhD in Optical Music Recognition from the University of Canterbury, New Zealand where he studied as a Commonwealth Scholar. Since moving to Waikato in 1996 he has continued to broadened his interest in digital media, while retaining a particular emphasis on music. An active member of the New Zealand Digital Library project, he manages the group's digital music library, Meldex, and has collaborated with several United Nations Agencies, the BBC and various public libraries. David has also worked as a research engineer for Thorn EMI in the area of photo-realistic imaging and graduated from the University of Edinburgh in 1991 as the class medalist in Computer Science.
Post-Apocalypse Now
Authors: Marc Donner
Venue: IEEE Security and Privacy (2003)

It's curious that apocalyptic fantasies are such a popular fictional form. What is the allure of the end of civilization as we know it, and how did our interest in it emerge?
Testing Object-Oriented Programs An Integrated Approach
Authors: Mei-Hwa Chen, Howard M. Kao
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

Traditional testing techniques often overlook object-oriented faults that are either caused by inheritance and/or polymorphism features or are introduced in object management. We present an object-flow based testing strategy that utilizes two object-flow coverage criteria-all-bindings and all-du-pairs-in testing object-oriented programs. The all-bindings criterion takes inheritance and polymorphism features into account to ensure that every binding of every object is exercised under some test. The all-du-pairs criterion is applied to monitor the behavior of every object during its lifetime by keeping track of where the object is defined and where such definition is referenced. These object-flow coverage criteria can be used to develop test cases that are able to trigger object-oriented faults. Furthermore, an integrated approach that incorporates the object-flow based testing strategy with traditional testing techniques as well as state-based testing technique is introduced. The results of our empirical study conducted on three industrial systems show that with this approach the reliability of the systems can be improved significantly and at least 80% of the maintenance cost can be reduced.
A Tutorial for CC++
Authors: Paul A. G. Sivilotti, Peter A. Carlin
Venue:  (1994)

No abstract available.
A Scalable Issue in Multicast Protocols: Reducing Forwarding States
Authors: Sheng Xu, Ng Chee Hock, Liren Zhang
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

Forwarding states explosion may cause scalability problem in multicast protocols. In this paper we describe a technique, called Dynamic Overlap Tree Path (DOTP), to improve the scalability of existing multicast protocols. This technique, which can be incorporated in both the dense and sparse modes of multicast protocols, dynamically finds overlapped tree paths and merge their forwarding states to reduce the storage requirement in multicast routers without introducing any additional control-message overheads. Using OPNET simulation package, we implemented some multicast protocols like CBT and PIM and their modifications to investigate the efficiency of our proposed technique. According to the simulation, the overall average forwarding-state table size of the networks simulated can be reduced by about 30%.
Some Results of the Space Requirements of Dynamic Memory Allocation Algorithms
Authors: Dennis W. Ting
Venue:  (1975)

NO SUPPLIED 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
Single Camera Tracking of Marker Clusters: Multiparameter Cluster Optimization and Experimental Verification
Authors: Sebastian Vogt, Ali Khamene, Frank Sauer, Heinrich Niemann
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

We have built a system for augmented reality visualization based on a single head mounted tracking camera. The camera includes an infrared illuminator and works in conjunction with a set of retro-reflective markers that are placed around the workspace. This marker frame configuration delivers excellent pose information, which translates to stable, jitter-free augmentation. In this article, we describe using the same single camera system for tracking relatively small marker clusters, which can be used for tool or instrument tracking. Tracking of such a marker cluster is more susceptible to noise compared to tracking of a marker frame, mainly due to its small image coverage. The sensitivity to noise is studied using Monte Carlo simulations and verified in an experimental setup. We achieved jitter-free augmentation with an optimized cluster design.
Cold code decompression at runtime
Authors: Saumya Debray, William S. Evans
Venue: Communications of the ACM (2003)

Using a software-based technique to dynamically decompress selected code fragments during program execution.
A geometrical optics-based numerical method for high frequency electromagnetic fields computations near fold caustics--Part I
Authors: J.-D. Benamou, O. Lafitte, R. Sentis, I. Solliec
Venue: Journal of Computational and Applied Mathematics (2003)

This paper presents an Eulerian numerical method for the computation of a bi-valued solution of Hamilton-Jacobi type equation in a particular geometric setting. More precisely we consider high frequency electromagnetic fields in the vicinity of fold caustics.
Analysis of Scalable Algorithms for Dynamic Load Balancing and Mapping with Application to Photo-realistic Rendering
Authors: Alan Heirich
Venue:  (1997)

This thesis presents and analyzes scalable algorithms for dynamic load balancing and mapping in distributed computer systems. The algorithms are distributed and concurrent, have no central thread of control, and require no centralized communication. They are derived using spectral properties of graphs: graphs of physical network links among computers in the load balancing problem, and graphs of logical communication channels among processes in the mapping problem. A distinguishing characteristic of these algorithms is that they are scalable: the expected cost of execution does not increase with problem scale. This is proven in a scalability theorem which shows that, for several simple disturbance models, the rate of convergence to a solution is independent of scale. This property is extended through simulated examples and informal argument to general and random disturbances. A worst case disturbance is presented and shown to occur with vanishing probability as the problem scale increases. To verify these conclusions the load balancing algorithm is deployed in support of a photo-realistic rendering application on a parallel computer system based on Monte Carlo path tracing. The performance and scaling of this application, and of the dynamic load balancing algorithm, are measured on different numbers of computers. The results are consistent with the predictions of scalability, and the cost of load balancing is seen to be non-increasing for increasing numbers of computers. The quality of load balancing is evaluated and compared with the quality of solutions produced by competing approaches for up to 1,024 computers. This comparison shows that the algorithm presented here is as good as or better than the most popular competing approaches for this application. The thesis then presents the dynamic mapping algorithm, with simulations of a model problem, and suggests that the pair of algorithms presented here may be an ideal complement to more expensive algorithms such as the well-known recursive spectral bisection.
Practical Description of Configurations for Distributed Systems Management
Authors: James D. Thornton
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

As distributed systems grow larger and more complex, the problem of managing them becomes more serious, and automated assistance becomes essential. Automated management services need to become a standard part of distributed systems, but in order for them to be of any value they must be general enough to adapt to the needs of any organization, without sacrificing practical usability. That challenge is partially addressed in this paper with a proposal for automated configuration management based upon descriptions of configuration states. The proposed model is very general, yet the language and algorithms that are introduced are designed to be very practical. Experimental application of this approach to a real-life configuration problem is presented, with comparison to the existing solution that is in production use.
View Maintenance after View Synchronization
Authors: Anisoara Nica, Elke A. Rundensteiner
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

While current view technology assumes that the ISs do not change their schema, our Evolvable View Environment (EVE) project addresses this problem by evolving the view definitions affected by IS schema changes, which we coin view synchronization. In EVE, the view synchronizer rewrites the view definitions by replacing view components with suitable components from other ISs. However, after such a view redefinition process, the view extents, if materialized, must also be brought up-to-date. In this paper, we propose strategies to address this incremental adaptation of the view extent after view synchronization. One key idea of our approach is to regard the complex changes done to a view definition after synchronization as atomic unit. Second, to exploit knowledge of how the view definition was synchronized, especially the containment information between the old and new view. Our techniques would successfully adapt views under the unavailability of base relations while currently known maintenance strategies from the literature would fail.
Is There More to TSSG than Associative Chaining (Chunking and All That)?
Authors: N. R. Taylor, J. G. Taylor
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

Our purpose in this paper is to explore the relevance of the ACTION network in understanding the manner of chunking involved in temporal sequence storage and generation (TSSG). We show how neurons involved in chunking can be hard-wired to generate sequences. Results from an adaptive model are presented indicating that chunking neurons can be re-used in the generation of different sequences. We investigate, in a hard-wired model, how longer sequences can be generated by chunking at a higher level short sequences, that are already chunked, by using the principles already uncovered.
Tech Ref, 7 edition
Authors: Thomas J. Glover, Millie M. Young
Venue:  (2002)

:-- TechRef is a handbook size reference which contains all of the best selling Pocket PCRef Plus Pocket PC DIRectory Plus a chapter on Windows 95 keyboard shortcuts Plus a chapter on our favorite 250 World Wide Web sites! All in one convenient handbook.-- Configuration specs for over 3450 hard drive and 460 floppy drives, DOS command reference through Version 6.22, ASCII codes, hardware and software interrupts, I/O Maps, cable pinouts, error codes, CPU table, printer control codes, and much, much, more.-- Contains directory information on over 2,000 North American companies involved in the manufacture of PC based computers, peripherals, software, and service depots! Includes name, address, classification (hardware, software, etc.), phone numbers for main, toll free, fax, tech support, and BBS, on-line addresses for World Wide Web, Compuserve, Microsoft Network, and AOL.-- Handbook size! (5" x 7.5" x 1.2"). Durable Lexotone "RM" cover.-- A MUST for anyone who uses or works on PC computers!-- New edition each year!
Advances in Modelling, Animation and Rendering: Proceedings of Computer Graphics International 2002
Authors: John Vince, R. Earnshaw
Venue:  (2002)

:This volume contains the papers presented at Computer Graphics International 2002, in July, at the University of Bradford, UK. These papers represent original research in computer graphics from around the world and cover areas such as: * Real-time computer animation * Image based rendering * Non photo-realistic rendering * Virtual reality * Avatars * Geometric and solid modelling * Computational geometry * Physically-based modelling * Graphics hardware architecture * Data visualisation * Data compression
Teach Yourself Visually PhotoShop Elements 2, 1 edition
Authors: Michael Woolridge
Venue:  (2003)

:Are you a visual learner? Do you prefer instructions that show you how to do something -- and skip the long-winded explanations? If so, then this book is for you. Open it up and you'll find clear, step-by-step screen shots that show you how to tackle scores of Photoshop Elements 2 tasks, from importing digital camera photos and sizing images to repairing photo damage, using filters, and creating a Web photo gallery.
A Clustering Based Approach to Efficient Image Retrieval
Authors: Ruofei Zhang, Zhongfei (Mark) Zhang
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

This paper addresses the issue of effective and efficient content based image retrieval by presenting a novel indexing and retrieval methodology that integrates color, texture, and shape information for the indexing and retrieval, and applies these features in regions obtainedthrough unsupervised segmentation, as opposed to applying them to the whole image domain. In order to address the typical color feature "inaccuracy" problem in the literature, fuzzy logic is applied to the traditional color histogram to solve for the problem to a certain degree. Thesimilarity is defined through a balanced combination between global and regional similarity measures incorporating all the features. In order to further improve the retrieval efficiency, a secondary clustering technique is developed and employed to significantly save queryprocessing time without compromising the retrieval precision. An implemented prototype system has demonstrated a promising retrieval performance for a test database containing 2000 general-purpose color images, as compared with its peer systems in the literature.
Data Protection in Mobile Agents: One-Time Key-Based Approach
Authors: Jong-Youl Park, Dong-Ik Lee, Hyung-Hyo Lee
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

This paper deals with security issues in a mobile agent system, especially protecting agent data from malicious servers. For this purpose, one-time key generation system, OKGS in short, is proposed. In OKGS, we integrate notions of a one-way hash function and a coupler. One-way function plays a major role in ensuring confidentiality and integrity of agent data. And the notion of a coupler is used to establish inter-relationship among consecutive encryption keys for agent data, i.e., all agent keys form a unidirectional chain. With these two distinctive features of OKGS, therefore, only the agent owner, who creates the agent bearing data, can decrypt and protect all the agent data which are gathered in the itinerary.
PROGRAMMABLE FORCE FIELDS FOR DISTRIBUTED MANIPULATION, AND THEIR IMPLEMENTATION USING MICRO-FABRICATED ACTUATOR ARRAYS
Authors: Karl Bohringer
Venue:  (1997)

Programmable force vector fields can be used to control a variety of flexible planar parts feeders such as massively-parallel micro actuator arrays or transversely vibrating (macroscopic) plates. These new automation designs promise great flexibility, speed, and dexterity---they may be employed to position, orient, singulate, sort, feed, and assemble parts. A wealth of geometric and algorithmic problems arise in the control and programming of manipulation systems with many independent actuators. The theory of programmable force fields represents the first systematic attack on massively-parallel distributed manipulation based on geometric and physical reasoning. We show how to develop combinatorially precise planning algorithms that synthesize force field strategies for controlling a very large number of distributed actuators in a principled, geometric, task-level fashion. When a part is placed on our devices, the programmed force field induces a force and moment upon it. Over time, the part may come to rest in a dynamic equilibrium state. By chaining together sequences of force fields, the equilibrium states of a part in the field may be cascaded to obtain a desired final state. The resulting strategies require no sensing and enjoy efficient planning algorithms. This thesis introduces new experimental devices that can implement programmable force fields. In particular, we describe the M-Chip (Manipulation Chip), a massively-parallel array of programmable micro-motion pixels. Both the M-Chip, as well as macroscopic devices such as transversely vibrating plates, may be programmed with force fields, and their behavior predicted and controlled using our equilibrium analysis. We demonstrate lower bounds (i.e., impossibility results) on what the devices cannot do, and results on a classification of control strategies yielding design criteria by which well-behaved manipulation strategies may be developed. We define composition operators to build complex strategies from simple ones, and show the resulting fields are also well-behaved. Finally, we consider parts feeders that can only implement a very limited ``vocabulary'''' of force fields. We show how to plan and execute parts-posing and orienting strategies for these devices, but with a significant increase in planning complexity and some sacrifice in completeness guarantees. We discuss the tradeoff between mechanical complexity and planning complexity.
Incorporating Time in the New World of Computing Systems
Authors: Hean L Poh
Venue:  (1986)

The New World of Computing System, referred to as the New World system, is a total system for the structuring, manipulation and communication of information. Time is a ubiquitous aspect of most databases. The aim of this thesis is to study the problems associated with the implementation of time in the New World system. Time information is not only stored in New World, they can be retrieved and processed to answer various types of user queries. This is an additional feature as compared to most models of time implementation in databases where the relationships between time intervals are not dealt with. To start with, ways of representing time in the form of floating point number are devised and discussed. Then the conversion of time information from its various user accustomed forms to New World system internal form and back are explored. Finally, the ambiguities and complexities involved in finding the intersection, subtraction, union and extension of two different sequences of time intervals associated with an object in a database are studied and algorithms for resolving these are presented . An explanation on how the crunchers work with the addition of time information is also given. This includes discussing about how quantifiers such as at least 2, how many etc. are handled in the New World system. Case studies are also conducted to test out these routines. As conclusion, the remaining problems associated with time implementation not covered in this thesis work are discussed.
How Many Queries Are Needed to Learn One Bit of Information?
Authors: Hans-Ulrich Simon
Venue: Annals of Mathematics and Artificial Intelligence (2003)

In this paper we study the question how many queries are needed to &ldquo;halve a given version space&rdquo;. In other words: how many queries are needed to extract from the learning environment the one bit of information that rules out fifty percent of the concepts which are still candidates for the unknown target concept. We relate this problem to the classical exact learning problem. For instance, we show that lower bounds on the number of queries needed to halve a version space also apply to randomized learners (whereas the classical adversary arguments do not readily apply). Furthermore, we introduce two new combinatorial parameters, the halving dimension and the strong halving dimension, which determine the halving complexity (modulo a small constant factor) for two popular models of query learning: learning by a minimum adequate teacher (equivalence queries combined with membership queries) and learning by counterexamples (equivalence queries alone). These parameters are finally used to characterize the additional power provided by membership queries (compared to the power of equivalence queries alone). All investigations are purely information-theoretic and ignore computational issues.
The largest small n-dimensional polytope with n + 3 vertices
Authors: Andreas Klein, Markus Wessler
Venue: Journal of Combinatorial Theory Series A (2003)

The aim of this paper is the determination of the largest n-dimensional polytope with n + 3 vertices of unit diameter. This is a special case of a more general problem Graham proposes in (J. Combin. Theory A 18 (1975) 165).