ppxscal/embedding_network huggingface dataset:
Absolute Beginner's Guide to Computer Basics (3rd Edition) (Absolute Beginner's Guide)
Authors: Michael Miller
Venue:  (2005)

Think setting up your new PC is going to be a challenge that you don't have time for? Think again. Absolute Beginner's Guide to Computer Basics, Third Edition can make setting up and learning about your new computer fun and easy. Step-by-step instructions and helpful illustrations will show you how to set up your computer, begin using Microsoft Windows XP and personalize your Windows XP experience. You'll also learn how to: Work with files and folders Add new hardware and devices to your system Perform maintenance and diagnose common problems Install new software Use the Internet Protect your PC from viruses, spam and other nuisancesThis latest edition has been updated to include coverage of Windows XP Service Pack 2, Windows Media Player 10 and 802.11g wireless networks. You'll also get the chance to explore how to use portable media players, safely shop online, buy and sell things on eBay, and how to use your digital camera and software to create digital scrapbooks. Absolute Beginner's Guide to Computer Basics, Third Edition is the most up-to-date guide for beginning computer users on the market and will be the only book you need to get up and running with your computer.
PortaNum: a reading aid for a classroom blackboard
Authors: Marianne Douard, Joseph Colineau, Loïc Goasduff
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

Developed by THALES, PortaNum is a reading aid which allows visually impaired people to read texts (located at a distance) on a classroom blackboard or slides presented in a meeting. The useful system for distance vision consists in a camera connected to a laptop and an image digital processing software. The image processing improves the legibility, corrects the defects of lighting, increases contrasts, enlarges the image and then offers quality and optimal visual comfort.
Instruction scheduling using MAX-MIN ant system optimization
Authors: Gang Wang, Wenrui Gong, Ryan Kastner
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

Instruction scheduling is a fundamental step for mapping an application to a computational device. It takes a behavioral application specification and produces a schedule for the instructions onto a collection of processing units. The objective is to minimize the completion time of the given application while effectively utilizing the computational resources. The instruction scheduling problem is NP-hard, thus effective heuristic methods are necessary to provide a qualitative scheduling solution. In this paper, we present a novel instruction scheduling algorithm using MAX-MIN Ant System Optimization approach. The algorithm utilizes a unique hybrid approach by combining the ant system meta-heuristic with list scheduling, where the local and global heuristics are dynamically adjusted to the input application in an iterative manner. Compared with force-directed scheduling and a number of different list scheduling heuristics, our algorithm generates better results over all the tested benchmarks with better stability. Furthermore, by solving the test samples optimally using ILP formulation, we show that our algorithm consistently achieves a near optimal solution.
Experiences with interpretation vs. translation in transmeta's code morphing software
Authors: Dean Deaver
Venue: Proceedings of the 2004 workshop on Interpreters, virtual machines and emulators (2004)

Transmeta's Efficeon microprocessor is a full, system-level implementation of the x86 architecture, comprising a native VLIW microprocessor with a software layer, the Code Morphing Software (CMS), that combines an interpreter, dynamic binary translator, optimizer, and run-time system. This software layer provides unique opportunities for studying the tradeoffs between interpretation and dynamic translation with various levels of optimization, while running arbitrary PC workloads. This talk presents some results from such a study, and provides insight into what mix of these emulation modes is most desirable over the range of tested workloads.
Scalable, Server-Passive, User-Anonymous Timed Release Cryptography
Authors: Aldar C. -F. Chan, Ian F. Blake
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

We consider the problem of sending messages into the future, commonly known as timed release cryptography. Existing schemes for this task either solve the relative time problem with uncontrollable, coarse-grained release time (time-lock puzzle approach) or do not provide anonymity to senders and/or receivers and are not scalable (server-based approach). Using a bilinear pairing on any Gap Diffie-Hellman group, we solve this problem by giving scalable, server-passive and user-anonymous timed release public-key encryption schemes allowing precise absolute release time specifications. Unlike the existing server-based schemes, the trusted time server in our scheme is completely passive ¿ no interaction between it and the sender or receiver is needed; it is even not aware of the existence of a user, thus assuring the privacy of a message and the anonymity of both its sender and receiver. Besides, our scheme also has a number of desirable properties including a single form of update for all users, self-authenticated time-bound key updates, and key insulation, making it a scalable and appealing solution. It could also be easily generalized to a more general policy lock mechanism.
Selection of diagnostic techniques and instrumentation in a predictive maintenance program. A case study
Authors: M. C. Carnero
Venue: Decision Support Systems (2005)

Predictive maintenance programs (PMPs) can provide significant advantages in relation to quality, safety, availability and cost reduction in industrial plants. Nevertheless, during implementation, different decision making processes are involved, such as the selection of the most suitable diagnostic techniques. A wrong decision can lead to the failure of the setting up of the predictive maintenance program and its elimination, with the consequent economic losses, as the setting up of these programs is a strategic decision. In this article, a model is proposed that carries out the decision making in relation to the selection of the diagnostic techniques and instrumentation in the predictive maintenance programs. The model uses a combination of tools belonging to operational research such as: analytic hierarchy process (AHP) and factor analysis (FA). The model has been tested in screw compressors when lubricant and vibration analyses are integrated.
Retrieval schemes for scalable unstructured P2P system
Authors: Lan Quan, Tai Rang Eom, Kyung Geun Lee, Ju-wook Jang, Sang Yun Lee
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

In the unstructured peer-to-peer networks, the network topology and the placement of files are largely unconstrained. Gnutella is one of the prominent unstructured P2P networks. The primitive search in Gnutella is flooding-based search and the search region is constrained by TTL value. The scheme produces too much traffic though with limited search region. In addition, many of the peers in Gnutella are free riders, which waste too much traffic without contribution. In this paper, we propose several retrieval schemes to unstructured P2P network to extend the search region but reduce the search traffic, and also balance the network load, so that can acquire the whole networks scalable.
Recursion patterns and time-analysis
Authors: Manuel Barbosa, Alcino Cunha, Jorge Sousa Pinto
Venue: ACM SIGPLAN Notices (2005)

This paper explores some ideas concerning the time-analysis of functional programs defined by instantiating typical recursion patterns such as folds, unfolds, and hylomorphisms. The concepts in this paper are illustrated through a rich set of examples in the Haskell programming language. We concentrate on unfolds and folds (also known as anamorphisms and catamorphisms respectively) of recursively defined types, as well as the more general hylomorphism pattern. For the latter, we use as case-studies two famous sorting algorithms, mergesort and quicksort. Even though time analysis is not compositional, we argue that splitting functions to expose the explicit construction of the recursion tree and its later consumption helps with this analysis.
Partial words and the critical factorization theorem
Authors: F. Blanchet-Sadri, S. Duncan
Venue: Journal of Combinatorial Theory Series A (2005)

The study of combinatorics on words, or finite sequences of symbols from a finite alphabet, finds applications in several areas of biology, computer science, mathematics, and physics. Molecular biology, in particular, has stimulated considerable interest in the study of combinatorics on partial words that are sequences that may have a number of "do not know" symbols also called "holes". This paper is devoted to a fundamental result on periods of words, the critical factorization theorem, which states that the period of a word is always locally detectable in at least one position of the word resulting in a corresponding critical factorization. Here, we describe precisely the class of partial words w with one hole for which the weak period is locally detectable in at least one position of w. Our proof provides an algorithm which computes a critical factorization when one exists. A World Wide Web server interface at http://www.uncg.edu/mat/cft/has been established for automated use of the program.
Scalability and portability of a belief network-based dialog model for different application domains
Authors: Carmen Wai, Helen M. Meng, Roberto Pieraccini
Venue: Proceedings of the first international conference on Human language technology research (2001)

This paper describes the scalability and portability of a Belief Network (BN)-based mixed initiative dialog model across application domains. The Belief Networks (BNs) are used to automatically govern the transitions between a system-initiative and a user-initiative dialog model, in order to produce mixed-initiative interactions. We have migrated our dialog model from a simpler domain of foreign exchange to a more complex domain of air travel information service. The adapted processes include: (i) automatic selection of specified concepts in the user's query, for the purpose of informational goal inference; (ii) automatic detection of missing / spurious concepts based on backward inference using the BN. We have also enhanced our dialog model with the capability of discourse context inheritance. To ease portability across domains, which often implies the lack of training data for the new domain, we have developed a set of principles for hand-assigning BN probabilities, based on the "degree of belief" in the relationships between concepts and goals. Application of our model to the ATIS data gave promising results.
G-ToPSS: fast filtering of graph-based metadata
Authors: Milenko Petrovic, Haifeng Liu, Hans-Arno Jacobsen
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

RDF is increasingly being used to represent metadata. RDF Site Summary (RSS) is an application of RDF on the Web that has considerably grown in popularity. However, the way RSS systems operate today does not scale well. In this paper we introduce G-ToPSS, a scalable publish/subscribe system for selective information dissemination. G-ToPSS is particularly well suited for applications that deal with large-volume content distribution from diverse sources. RSS is an instance of the content distribution problem. G-ToPSS allows use of ontology as a way to provide additional information about the data. Furthermore, in this paper we show how G-ToPSS can support RDFS class taxonomies. We have implemented and experimentally evaluated G-ToPSS and we provide results in the paper demonstrating its scalability compared to alternatives.
Quantitative Characterization of Event Streams in Analysis of Hard Real-Time Applications
Authors: Ernesto Wandeler, Alexander Maxiaguine, Lothar Thiele
Venue: Real-Time Systems (2005)

Many real-time embedded systems process event streams that are composed of a finite number of different event types. Each different event type on the stream would typically impose a different workload to the system, and thus the knowledge of possible correlations and dependencies between the different event types could be exploited to get tighter analytic performance bounds of the complete system. We propose an abstract stream model to characterize such an event stream. The model captures the needed information of all possible traces of a class of event streams. Hence, it can be used to obtain hard bounded worst-case and best-case analysis results of a system. We show how the proposed abstract stream model can be obtained from a concrete stream specification, and how it can be used for performance analysis. The applicability of our approach and its advantages over traditional worst-case performance analysis are shown in a case study of a multimedia application.
Effects of fisheye on visualizing connections between nodes
Authors: Erika Darling, Kristine Recktenwald, Nikhil Kalghatgi, Aaron Burgman
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

It is important for analysts to realize the connection between two distant nodes in a graph, which is not readily supported by existing space-filling techniques. We developed an experimental prototype, FocusTree, which displays graphs in two view modes: fisheye or tree. In fisheye view, selected nodes and the nodes connecting them remained full-sized while the other nodes were reduced in size. In tree view, all nodes remained the same size, regardless of selection state. We conducted a study to compare the speed of participants using the fisheye view to the tree view when determining the number of links between two nodes. There were two states for the degree of separation in the tasks: simple (four links) and complex (eight links). Results showed a main effect for view type with fisheye view being significantly faster than tree view for determining the connection between two nodes.
A simple wide-band compact model and parameter extraction using particle swarm optimization of on-chip spiral inductors for silicon RFICs
Authors: Sushanta K. Mandal, Arijit De, Amit Patra, Shamik Sural
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

We propose a wide-band model of spiral inductor in which a resistance is incorporated in series with the overlap capacitance that estimates the underpass oxide leakage and a parallel combination of lateral substrate resistance and capacitance is introduced to model the lateral substrate coupling at high frequencies. The particle swarm optimization (PSO) algorithm is used for the extraction of the model parameters. The proposed model has been verified with the measured data of octagonal spiral inductors fabricated on a six-metal BiCMOS7 process. The model along with the PSO extraction procedure gives excellent fit when compared with the measured data over the frequency range up to 10GHz. The frequency independent elements of the model facilitate it to be integrated in a SPICE-compatible simulator.
Towards analog implementations of PWL two-dimensional non-linear functions: Research Articles
Authors: Marco Storace, Mauro Parodi
Venue: International Journal of Circuit Theory and Applications (2005)

This paper deals with the circuit implementation of non-linear algebraic bivariate functions. The synthesis procedure is based on a piecewise-linear approximation technique and on a corresponding circuit architecture, whose basic element is a circuit block with the input&#x002F;output function y(x) = max(0; x). Some known CMOS circuit structures that can be used to obtain such a block are considered, and their main advantages and drawbacks are pointed out. The static and dynamic features of both the single circuit block and the overall architecture for two-dimensional PWL functions are illustrated by way of examples. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Using centralized element in P2P network for better community management
Authors: Adam Morávek, Ivan Jelinek
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

In this paper we are focusing on description of a new possible Internet searching system. It uses Peer-to-Peer (P2P) model to build a clustered logical network using a multi-ring topology. We are also aware of the fact that without centralized element is the searching very difficult. For that we introduce central data-topics managing server as the intermediary between user (P2P node) and desired information. When using both models - P2P and Client/Server - we introduce two-way searching approach. For better node identification we use the meta-addressing which is also necessary for managing node profiles.
A Tool to Map Testing Techniques to Classes
Authors: Peter J. Clarke, Junhua Ding, Brian A. Malloy
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

The complexities of the basic unit of OO systems, the class, has resulted in a plethora of implementation-based testing techniques (IBTTs) to test the characteristics of a class. Surprisingly, there has been little or no research in the area of automatically identifying those IBTTs suitable for testing a class. In this paper we present a tool that automates the process of mapping IBTTs to a class under test (CUT). The mapping process identifies those IBTTs that can suitably test characteristics of the CUT and, more importantly, provides feedback to the tester that facilitates identification of the characteristics of the CUT that are not suitably tested by any of the IBTTs in the list.
Understanding and reducing web delays
Authors: Kevin Curran, Connor Duffy
Venue: International Journal of Network Management (2005)

Over the years the number of web users has increased dramatically unfortunately leading to the inherent problem of congestion. This can affect each user's surfing experience. This paper investigates download times associated with a web request, identifies where delays occur, and provides guidelines which can be followed by web developers to enable a faster and more efficient download and service for their users.
Relating Symbolic and Cryptographic Secrecy
Authors: Michael Backes, Birgit Pfitzmann
Venue: Proceedings of the 2005 IEEE Symposium on Security and Privacy (2005)

We investigate the relation between symbolic and cryptographic secrecy properties for cryptographic protocols. Symbolic secrecy of payload messages or exchanged keys is arguably the most important notion of secrecy shown with automated proof tools. It means that an adversary restricted to symbolic operations on terms can never get the entire considered object into its knowledge set. Cryptographic secrecy essentially means computational indistinguishability between the real object and a random one, given the view of a much more general adversary. In spite of recent advances in linking symbolic and computational models of cryptography, no relation for secrecy under active attacks is known yet. For exchanged keys, we show that a certain strict symbolic secrecy definition over a specific Dolev-Yao-style cryptographic library implies cryptographic key secrecy for a real implementation of this cryptographic library. For payload messages, we present the first general cryptographic secrecy definition for a reactive scenario. The main challenge is to separate secrecy violations by the protocol under consideration from secrecy violations by the protocol users in a general way. For this definition we show a general secrecy preservation theorem under reactive simulatability, the cryptographic notion of secure implementation. This theorem is of independent cryptographic interest. We then show that symbolic secrecy implies cryptographic payload secrecy for the same cryptographic library as used in key secrecy. Our results thus enable existing formal proof techniques to establish cryptographically sound proofs of secrecy for payload messages and exchanged keys.
What makes the differences: benchmarking XML database implementations
Authors: Hongjun Lu, Jeffrey Xu Yu, Guoren Wang, Shihui Zheng, Haifeng Jiang, Ge Yu, Aoying Zhou
Venue: ACM Transactions on Internet Technology (TOIT) (2005)

XML is emerging as a major standard for representing data on the World Wide Web. Recently, many XML storage models have been proposed to manage XML data. In order to assess an XML database's abilities to deal with XML queries, several benchmarks have also been proposed, including XMark and XMach. However, no reported studies using those benchmarks were found that can provide users with insights on the impacts of a variety of storage models on XML query performance. In this article, we report our first set of results on benchmarking a set of XML database implementations using two XML benchmarks. The selected implementations represent a wide range of approaches, including RDBMS-based systems with document-independent and document-dependent XML-relational schema mapping approaches, and XML native engines based on an Object-Oriented Model and the Document Object Model. Comprehensive experiments were conducted to study relative performance of different approaches and the important issues that affect XML query performance, such as path expression query processing, effectiveness of various partitioning, label-path, and indexing structures.
DISSERTATIONS: ABSTRACTS OF INTEREST
Authors: Susanne M. Humphrey, Ben Shneiderman
Venue: ACM SIGCHI Bulletin (1992)

The following abstracts were selected from a computer search using the BRS Information Technologies retrieval services of the Dissertation Abstracts International (DAI) database produced by University Microfilms International.Unless otherwise specified, paper or microform copies of dissertations may be ordered, using the UM order number, from University Microfilms International, Dissertation Copies, Post Office Box 1794, Ann Arbor, MI 488106; telephone for U.S. (except Michigan, Hawaii, or Alaska): 800/521-3042, for Canada: 800/268-6090. Price lists, ordering, and shipping information are in the introduction to the published DAI. An alternative source for copies is sometimes provided at the end of the abstract.The dissertation titles and abstracts contained here are published with permission of University Microfilms International, publishers of Dissertation Abstracts International (copyright 1985) by University Microfilms International), and may not be reproduced without their prior permission.
Lipreading method using color extraction method and eigenspace technique
Authors: Yasuyuki Nakata, Moritoshi Ando
Venue: Systems and Computers in Japan (2004)

This paper describes a lipreading system using a color extraction method and several eigenspace techniques. To detect a precise mouth position, the system first finds the rough position of the mouth by the color extraction method and then determines the precise position using an eigentemplate technique. To describe the mouth shape change, we developed an eigen waveform technique. The detected precise mouth position improves the accuracy of the eigen waveform, which results in a high recognition rate. We constructed an automatic lipreading system and an experiment revealed that this system recognizes 85&percnt; of 35 words and 69&percnt; of 100 words. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(3): 12&ndash;23, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10508