ppxscal/embedding_network huggingface dataset:
Wearing Bike Components
Authors: Jo Herstad, Do Van Thanh
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

This paper addresses the requirement to support component mobility. Field studies of bike messenger operations in Oslo and New York City has been conducted to inform design. We have investigated how component mobility is critical for enabling tailoring of personal mobility in general, and on-body off-body mobility specifically. We suggest that taking mobility seriously may not only contribute to our understanding of current support for mobility, but also raise more general issues concerning requirements and design of mobile technologies. Instead of building a terminal by integrating several terminals into one, our approach suggest, first, a dissolution of the current terminals into pieces called "basic components", and then reassemble the selected basic components to form a customized terminal.
Java Persistence for Relational Databases
Authors: Richard Sperko
Venue:  (2003)

:"Java Persistence for Relational Databases" focuses on storing the primary component of any Java application the Java object in the most common business tool: the relational database. This book is different because it doesn't focus on one technology or another; it focuses on the overall problem and various solutions and best practices."Java Persistence for Relational Databases" is best practices and patterns for readers who want to connect to databases using Java. It will also include coverage of various database-related APIs for Java, including JDO, JDBC (including newest 3.0 APIs), and CMP (Container Managed Persistence with EJB). "Java Persistence for Relational Databases" contains all those things developers want to know but were afraid to ask. It addresses realistically persisting Java objects in various ways. Whether a developer's environment requires them to use JDO, CMP, Castor, or hand code a persistence layer using JDBC, there is something in this book for them.
Agent-Based Auctions
Authors: Lyndon Lee
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

This paper discusses the technical challenges, business implications and research issues of agent-based auctions.
An ABS algorithm for solving singular nonlinear systems with rank defects
Authors: Rendong Ge, Zun-Quan Xia
Venue: The Korean Journal of Computational Applied Mathematics (2003)

A modified ABS algorithm for solving a class of singular non-linear systems, F(x) = 0, F ∈ Rn, constructed by combining the discreted ABS algorithm and a method of Hoy and Schwetlick (1990), is presented. The second differential operation of F at a point is not required to be calculated directly in this algorithm. Q-quadratic convergence of this algorithm is given.
Design and Implementation of Hardware for Real-Time Intelligent Agents
Authors: Michael G. Panteleyev, Dmitry V. Puzankov, German G. Kolosov, Igor B. Govorukhin
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

Creation of intelligent agents (IAs) became a basic trend in artificial intelligence in recent years. One of the most important requirements to such systems is real-time decision making when operating in open dynamic and uncertain environments. The efficiency of IAs in hardreal-time applications can be improved by hardware support. Rule-based (production) knowledge are widely used in different subsystems of IAs to represent both domain and control knowledge.In this paper a known approaches to design and implementation of inference processor for rule-based systems are considered and a novel one is presented. An approach is based on the concept of universal interpreter for rule-based systems and its implementation on microprogram level. The design tasks and processor's architecture based on Rete-network with multiple input β-nodes are considered. A design methodology for such class of devices and corresponding software tool for design process support are described. An implementation of processor using Altera programmable logic devices (PLD) and performance estimation results are presented in conclusion.
User-Based Testing of GUI Sequences and Their Interactions
Authors: Lee White, Husain Almezen, Nasser Alzeidi
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

Testing Graphical User Interfaces (GUIs) is difficult, nvolving many states, inputs andevents.We have previously reported a new method for testing GUIs that is scalable andconcentrates on user sequences of GUI objects and selections that collaborate, called complete interaction sequences (CIS), and that produce the desired response for the user called the responsibility.In this paper we will extend this approach by investigating the use of memory tools to detect missing effects and CIS sequences, investigating interactions between CIS sequences, and providing empirical studies of five different GUI systems.
A Formalism for Parallel Virtual-Grid Compaction
Authors: G N Sullivan, S C Ellis
Venue:  (1990)

A formalism is presented for virtual-grid symbolic compaction. The formalism supplies a mathematical basis for extracting coarse-grained MIMD parallelism from the problem. Parallelism provides a means for reducing prohibitive compaction processing times. The formalism is based on the effects of design rules on primitive rectangles, embodied in a new function, called repel. Primitives are aggregated into groups, and inter-group and intra-group operations perform the compaction. Groups also represent the granularity of parallelism. The formalism explicitly blueprints the functions, interactions, and critical sections needed in a parallel implementation. The parallel extraction is shown to preserve serializability - and therefore generate correct results.
Inside XML, 2 edition
Authors: Holzner, Ed Tittel
Venue:  (2002)

:Steven Holzner's friendly, easy-to-read style has turned this book (formerly known as Inside XML) into the leading reference on XML. Unlike other XML books, this one is packed with hundreds of real-world examples, fully tested and ready to use! Holzner teaches you XML like no other author can, covering every major XML topic today and detailing the ways XML is used now -- connecting XML to databases (both locally and on web servers), styling XML for viewing in today's web browsers, reading and parsing XML documents in browsers, writing and using XML schemas, creating graphical XML browsers, working with the Simple Object Access Protocol (SOAP), and a great deal more. Real World XML is designed to be the standard in XML coverage -- more complete, and more accessible, than any other.
Anticipative Reinforcement Learning
Authors: Frederic Maire
Venue:  (2001)

This paper introduces Anticipative Reinforcement Learning (ARL), a method that addresses two critical problems of reinforcement learning; the breakdown of the classical algorithms for problems with small time steps and continuous action spaces, and the unlearning of policies and value functions when they are implemented with neural networks. In ARL, an agent is made of three components; the actor, the critic and the model (the model is as in Dyna but we use it differently). The originality of ARL lies in the action selection process; the agent builds a set of candidate actions that includes the action recommended by the actor plus some random actions. Once the set of candidate actions is built, the candidate actions are ranked by considering what would happen if these actions were taken and followed by a sequence of actions using only the current policy (anticipation using iteratively the model with a finite look-ahead).
QuickTime 6 for Macintosh and Windows: Visual QuickStart Guide
Authors: Judith L. Stern, Robert Lettieri
Venue:  (2002)

:UntitledQuickTime 6 is one of those technologies that's hard to get a handle on: It's not just an application, but an entire cross-platform multimedia architecture you can use to view and create a vast range of multimedia projects. Now over 10 years old, QuickTime has become the Web standard for streaming and non-streaming video content. QuickTime 6 for Macintosh and Windows: Visual QuickStart Guide, puts the QuickTime architecture in perspective, providing both the "big picture" as well as detailed instructions for accomplishing a variety of tasksfrom creating slide-show presentations, editing movies, and creating music soundtracks, to uploading videos for streaming over the Web. The task-based, visual layout takes an easy approach to teaching QuickTime, using pictures to guide artists, teachers, video professionals and hobbyists through the ins and outs of the program. Beginners learn just what they need to know to get started, while more seasoned professionals can use the handy visual tabs to quickly look up the new features and tools of version 6, including support for MPEG-4.
An Overview of the Isis Project
Authors: Kenneth P. Birman, Amr E Abbadi, Wally Dietrich, Thomas A. Joseph, Thomas Raeuchle
Venue:  (1984)

The goal of the ISIS projest is to provide a high-level support for fault-tolerant distributed computing by automatically replicating data and code. The extent to which information is replicated and the physical location of information are not specified directly by the programmer, but are instead inferred from a specification, which looks much like a conventional program in an object-oriented language. This novel approach to fault-tolerant software construction requires much less sophistication from programmers than current alternatives. Moreover, optimization techniques that would be too complex for implementation in general purpose applications can be supported by the ISIS system. This overview discusses the goals of the project, its current status, and some of the implications of our work.
Matrix Computations and Signal Processing
Authors: Charles Van Loan
Venue:  (1987)

The interactions between the signal processing and matrix computation areas is explored by examining some subspace dimension estimation problems that arise in a pair of direction-of-arrival algorithms: MUSIC and ESPRIT. We show that the intelligent handling of these numerical problems requires a successful intermingling of perturbation theory, sensible problem formulation, and reliance upon unitary matrix methods.
The future of intellectual property
Authors: Richard A. Spinello
Venue: Ethics and Information Technology (2003)

This paper uses two recent works as a springboard for discussing the proper contours of intellectual property protection. Professor Lessig devotes much of The Future of Ideas to demonstrating how the expanding scope of intellectual property protection threatens the Internet as an innovation commons. Similarly, Professor Litman's message in Digital Copyright is that copyright law is both too complicated and too restrictive. Both authors contend that as a result of overprotecting individual rights, creativity is stifled and the vitality of the intellectual commons is in jeopardy. It is difficult to evaluate the claims and policy prescriptions of these books without some appreciation for the moral foundations of intellectual property. The utility and labor desert theories remain the two most prominent in the Anglo-American tradition. After exploring those theories, we argue for a secure regime of protection based on the Lockean vision that property rights are justly deserved as a reward for labor that creates value. However, as Locke's famous proviso implies, even a natural property right is not absolute and must be balanced by regard for the public domain. But a natural right cannot be sacrificed simply to advance technological innovation or to achieve marginal social and economic gains. While we agree with Lessig and Litman that recent legislation goes too far we conclude the essay by attempting to illustrate that some of their policy recommendations err in the opposite direction by underprotecting valid property rights.
Providing Design Abstractions in Distributed Systems
Authors: Gilbert A. Neiger, Sam Toueg
Venue:  (1988)

The design of protocols for distributed systems is more complex than for centralized systems because coordination and cooperation between processors are difficult to achieve. Among the factors complicating this design are the failure of processors and the lack of processor synchronization. In this paper, we show how to simplify the design of fault-tolerant protocols using methods that automatically translate protocols tolerant of benign failures into ones tolerant of more severe failures. Such methods provide the abstraction of restricted faulty behavior. We also show how to circumvent the lack of processor synchronization by using logical clocks, which provide the abstraction of perfectly synchronized clocks in solutions to a large class of problems, both in asynchronous and partially synchronized systems.
PhotoShop Face to Face: Facial Image Retouching,Manipulation and Makeovers with PhotoShop 7 or Earlier, 1 edition
Authors: Gavin Cromhout, Josh Fallon, Adrian Luna, Nathan Flood, Katy Freer
Venue:  (2002)

:What's in a face? Everything! And with the incredible power of Photoshop you can retouch and manipulate facial images using an infinite variety of styles. Want to hide a blemish? Paint a friend's face? Animate it and watch it morph into someone else? Mimic the Masters and transform a photo into a Lichtenstein or Warhol? Improve the composition or alter the context of a photograph? This book brings together some of the most exciting designers around to show you how. You&iacute;ll learn the tricks behind the following techniques: * Facial retouching with Photoshop 7 * Combining features to make hybrid faces * Slapping on realistic face paint * Recreating artistic styles * Producing incredible morphing sequences * Creating a realistic fantasy figure * Creating Photoshop faces from scratch ...and more! This book provides inspiration and clear, concise guidance towards achieving fantastic facial effects for all Photoshop users from beginning to advanced, leading you through even the most powerful Photoshop techniques. Some of the most exciting designers around have gathered to work their magic on this tightly focused canvas, working from a number of different starting points. Whether it's a perfect gloss you're after, or an abstract form of iconography, Photoshop has a collection of subtle and powerful tricks up its sleeve, and this book coaxes them into the open. The authors have even suppled original files for readers to work on, downloadable from the friends of ED website! Book Info A colorful volume packed with fun and informative practical tips on using Photoshop techniques to manipulate portraits. Softcover. This is a full color inspirations title from friendsof ED, aimed showing professionals and home users alike how to access the multiplicity of techniques available in Adobe Photoshop. By using such a familiar model as the human face, the effectiveness and originality of these techniques is thrown into sharp relief. The book employs versions of Photoshop up to the brand new release Version 7, although the techniques shown will be compatible with previous releases of the software. Each chapter contains multiple examples of how to treat a face in Photoshop, and an in-depth explanation of technique from the designer.
A Constraint-Based Nurse Rostering System Using a Redundant Modeling Approach
Authors: B. M. W. Cheng, J. H. M. Lee, J. C. K. Wu
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

This paper describes the design and implementation of a nurse rostering system using a redundant modeling approach. Nurse rostering is defined as a process of generating timetables for specifying the work shifts of nurses over a given period of time. This process is difficult because the human roster planner has to ensure that every rostering decision made complies with a mixture of hard hospital rules and soft nurse preference rules. Moreover, some nurse shift pre-assignments often break the regularity of wanted (or unwanted) shifts and reduce the choices for other unfilled slots. Soft constraints amount to disjunction, which can be modeled as choices in the search tree. This approach, although straightforward, incurs overhead in the search of solution. We propose redundant modeling, an effective way to speed up constraint propagation through cooperations among different models for the same problem, as a means to reduce search time. Experiments and pilot testing of the system confirm the feasibility of our method.
Sorting in O(n log log n) time and linear space usingaddition, shift, and bit-wise boolean operatations
Authors: Mikkel Thorup
Venue:  (1996)

We present a randomized sorting algorithm doing as described in the title.
Computer Assisted Query System
Authors: Sanjay Kapoor
Venue:  (1994)

With the growing concern for making database management systems (DBMS) easier to use, efforts are being made to design a query language interface that takes advantage of the capabilities of graphical workstations. The trend is to isolate the user from hassle of complexity of SQL statements and from having to know how the data is stored; that is, to allow a user to make queries without knowing SQL, or some other database language. For the administrator of the database, another important requirement or the interface is to insert data, delete data and be able to create new tables in the database. My project it an exploration of replacing a database command language by an appropriate user interface and of software required to support such an interface.
A Proof of a Leader Election Protocol in microCRL ($\mu$CRL)
Authors: Lars Fredlund, Jan F Netherlands), Henri K Netherlands)
Venue:  (1995)

In 1982 Dolev, Klawe & Rodeh presented an O(n log n) unidirectional distributed algorithm for the circular extrema-finding (or leader-election) problem}. At the same time Peterson came up with a nearly identical solution. In this paper, we bring the correctness of this algorithm to a completely formal level. This relatively small protocol, which can be described on half a page, requires a rather involved proof for guaranteeing that it behaves well in all possible circumstances. To our knowledge, this is one of the more advanced case-studies in formal verification based on process algebra.
Getting Started with Bluetooth
Authors: Madhushee Gangali
Venue:  (2002)

:As the world continues to become more mobile and business is conducted in the blink of an eye, a new system is taking communication one step further. Bluetooth technology unites computing with telecommunication. This innovative breakthrough eliminates the need for cables by using short-range radio links. Equipped with features such as robustness, low complexity, low power and low cost, this technology incorporates any digital device, including PDAs and printers, into the Bluetooth system. Getting Started with Bluetooth teaches you concepts about Bluetooth specifications, devices, and architecture, giving you the knowledge to gain a competitive edge!
Situated Computing: Bridging the Gap between Intention and Action
Authors: Anatole V. Gershman, Joseph F. McCarthy, Andrew E. Fano
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

Situated computing represents a new class of computing applications that bridges the gap between people's intentions and the actions they can take to achieve those intentions. These applications are contextually embedded in real-world situations, and are enabled by the proliferation of new kinds of computing devices, expanding communication capabilities and new kinds of digital content. Three types of discontinuities give rise to intention/action gaps and provide opportunities for situated computing applications: physical discontinuities, information discontinuities and awareness discontinuities. Several examples of applications that overcome these discontinuities are presented.
Scalable Service Differentiation in a Shared Storage Cache
Authors: Bong-Jun Ko, Kang-Won Lee, Khalil Amiri, Seraphin Calo
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Motivated by the need to enable easier data sharing andcurb rising storage management costs, storage systems arebecoming increasingly consolidated and thereby shared bya large number of users and applications. In such environments,service differentiation becomes increasingly important.Since caching is a fundamental and pervasive techniqueemployed to improve the performance of storage systems,providing differentiated services from a storage cacheis a crucial component of the entire end-to-end QoS solution.In this paper, we discuss a QoS architecture for ashared storage proxy cache which can provide long-term hitrate assurances to competing classes. The proposed architectureconsists of three components: (a) per-class feedbackcontrollers that track the performance of each class, (b) afairness controller that allocates excess resources fairly inthe case when all goals are met, and (c) a contention resolverthat decides cache allocation in the case when at leastone class does not meet its target hit rate. We compare theperformance of various feedback per-class controllers, andprovide guidelines for designing QoS mechanisms for such adynamic environment.
Reducing Web Latency with Hierarchical Cache-Based Prefetching
Authors: Dan Foygel, Dennis Strelow
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

Proxy caches have become a central mechanism for reducing the latency of web document retrieval. While caching alone reduces latency for previously requested documents, web document prefetching could mask latency for previously unseen, but correctly predicted requests. We describe a prefetching algorithm suitable for use in a network of hierarchical web caches; this algorithm observes requests to a cache and its ancestors, and initiates prefetching for predicted future requests if prefetching is likely to reduce the overall latency seen by the cache's clients. We introduce a novel cost-benefit model that allows us to judge the value of any cached or prefetched document, which we use to state a formal prefetching policy. Extensive simulations were run to judge the improvements offered by prefetching, and our approach is quantitatively compared to the method currently in use.
ATMTraP: an asynchronous transfer mode traffic and performance measurement tool
Authors: C. A. Johnston, D. J. Smith, K. C. , . Young Jr
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

The analysis and development of ATM network traffic control algorithms is often performed using theoretical traffic models. Algorithms for traffic shaping, policing, flow control, and switch architectures have been proposed based on these models. While the models help to obtain preliminary solutions, the success and validity of the proposed algorithm will be a function of how close the assumed models resemble real traffic patterns. The paper presents ATMTraP, an experimental prototype asynchronous transfer mode traffic and performance measurement tool which could be used in the characterization of sources and elements that form the ATM network. ATMTraP has been used in the Nectar Gigabit Testbed to collect preliminary traffic statistics from sources, such as, a Cray C-90 supercomputer, Sun workstations, and an iWARP systolic array.