ppxscal/embedding_network huggingface dataset:
An Address Dependence Model of Computation for Hierarchical Memories with Pipelined Transfer
Authors: Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09 (2005)

Powerful memory models, including hierarchies with block transfer or with pipeline of accesses have been proposed in theory and are partially realized in commercial systems, to reduce the average memory overhead per operation. However, even for such powerful models, there are simple direct flow programs, with no branches and no indirect addressing, that require non-constant overhead, resulting in superlinear execution time. Indeed, we characterize a wide, natural class of machines, including nearly all previously proposed models, and develop a technique which yields superlinear time lower bounds on any machine of this class, for suitable direct-flow computations. We propose the Address Dependence Model (ADM) for machines with pipelined memory hierarchies, where any direct-flow program runs in time linear in the number of executed instructions. As an example of the capabilities of ADM for algorithms non amenable to direct-flow formulation, we show how to implement quicksort in time proportional to the number of executed comparisons, whose expected valu is O(n log n), even on memories where the latency of address x is a(x) = ¿(x). (In contrast, T = ¿(n log^2 n) for sorting in the block transfer model of [Hierarchical memory with block transfer].) Finally, we consider the question of physical implementation of ADM and propose an extensible machine design, in which the number of gates and the length of a wire that a signal traverses in one clock period are, within a given technology, independent of system size. Such designs scale with system size (in particular, with memory latency) as well as with technological advancement.We assume aggressive, but feasible [Optimal organizations for pipelined hierarchical memories], hierarchical memories pipelinable at a constant rate. The main contribution is a novel processor organization capable of fully exploiting such memories.
Heavy-Traffic Limits for the G/H2*/n/m Queue
Authors: Ward Whitt
Venue: Mathematics of Operations Research (2005)

We establish heavy-traffic stochastic-process limits for queue-length, waiting-time and overflow stochastic processes in a class ofG/GI/n/m queueing models withn servers andm extra waiting spaces. We let the arrival process be general, only requiring that it satisfy a functional central limit theorem. To capture the impact of the service-time distribution beyond its mean within a Markovian framework, we consider a special class of service-time distributions, denoted byH2*, which are mixtures of an exponential distribution with probabilityp and a unit point mass at 0 with probability 1- p. These service-time distributions exhibit relatively high variability, having squared coefficients of variation greater than or equal to one. As in Halfin and Whitt (1981, Heavy-traffic limits for queues with many exponential servers,Oper. Res.29 567-588), Puhalskii and Reiman (2000, The multiclassGI/PH/N queue in the Halfin-Whitt regime.Adv. Appl. Probab.32 564-595), and Garnett, Mandelbaum, and Reiman (2002. Designing a call center with impatient customers.Manufacturing Service Oper. Management,4 208-227), we consider a sequence of queueing models indexed by the number of servers,n, and letn tend to infinity along with the traffic intensities ? nso that v n (1 - ? n ) ?for -8
Scalability of mobile, base-station-oriented RF networks: Research Articles
Authors: Sohil Thakkar, Karthikeyan Chandrashekar, Stuart D. Milner
Venue: Wireless Communications Mobile Computing (2004)

The performance and scalability of mobile, base-station-oriented wireless networks with respect to routing and mobility models is addressed in this paper. Using systems-oriented, large-scale discrete event simulation, both performance scalability and complexity scalability are analyzed. Performance scalability addresses the effect of network size on system performance. Complexity scalability, in this case, consists of communication complexity (i.e. amount of control information exchanged to create and maintain network connectivity). Results confirmed the scalability of base-station-oriented networks using the routing, and mobility models, using over 2000 fully dynamic hosts and routers. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Optimal Channel Assignments for Lattices with Conditions at Distance Two
Authors: Jerrold R. Griggs, Xiaohua Teresa Jin
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13 (2005)

The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory.Given a graph G, possibly infinite, and real numbers k¿, k¿, ..., k_p ¿ 0, a L(k¿, k¿, ..., k_p )-labeling of G assigns real numbers f(x) ¿ 0 to the vertices x, such that the labels of vertices u and v differ by at least k_i if u and v are at distance i apart.We denote by ¿(G; k¿, k¿, ..., k_p ) the infimum span over such labelings f.We survey this new theory of real number labelings.When p = 2 it is enough to determine ¿(G; k, 1) for reals k ¿ 0, which will be a piecewise linear function. We present the function for the square lattice (grid) and for the hexagonal lattice.For the triangular lattice, we have also solved it except for the range 1/2¿k¿4/5.
Fault-tolerant routing for complete Josephus cubes
Authors: Peter K. K. Loh, W. J. Hsu
Venue: Parallel Computing (2004)

This paper proposes and analyses a fault-tolerant routing system for the Complete Josephus Cube [Parallel Computing 26 (2000) 427]. For a Complete Josephus Cube of dimension r, the routing strategy tolerates at least (r + 1) and up to 2(r - 1) encountered component faults. Routes generated are free from cycles and guarantee message delivery. Within stated fault conditions, the message is routed within a maximum of (2(r - 1)) hops. The message overhead incurred is low for the specified fault tolerance level. Finally, our router design shows that hardware support may be simply achieved with practical components, facilitating integration with the host network.
A Public-Key Traitor Tracing Scheme with Revocation Using Dynamic Shares
Authors: Wen-Guey Tzeng, Zhi-Jia Tzeng
Venue: Designs, Codes and Cryptography (2005)

We proposed a new public-key traitor tracing scheme with revocation capability using dynamic shares and entity revocation techniques. Our scheme's traitor tracing and revocation programs cohere tightly. The size of the enabling block of our scheme is independent of the number of receivers. Each receiver holds one decryption key only. The distinct feature of our scheme is that when traitors are found, we can revoke their private keys (up to some threshold z) without updating the private keys of other receivers. In particular, no revocation messages are broadcast and all receivers do nothing. Previously proposed revocation schemes need update existing keys and entail large amount of broadcast messages. Our traitor tracing algorithm works in a black-box way. It is conceptually simple and fully k-resilient, that is, it can find all traitors if the number of them is k or less. The encryption algorithm of our scheme is semantically secure assuming that the decisional Diffie-Hellman problem is hard.
Eye gaze tracking techniques for interactive applications
Authors: Carlos H. Morimoto, Marcio R. M. Mimica
Venue: Computer Vision and Image Understanding (2005)

This paper presents a review of eye gaze tracking technology and focuses on recent advancements that might facilitate its use in general computer applications. Early eye gaze tracking devices were appropriate for scientific exploration in controlled environments. Although it has been thought for long that they have the potential to become important computer input devices as well, the technology still lacks important usability requirements that hinders its applicability. We present a detailed description of the pupil-corneal reflection technique due to its claimed usability advantages, and show that this method is still not quite appropriate for general interactive applications. Finally, we present several recent techniques for remote eye gaze tracking with improved usability. These new solutions simplify or eliminate the calibration procedure and allow free head motion.
How to Do Everything with Windows XP, Third Edition, 3 edition
Authors: Curt Simmons
Venue:  (2005)

This easy-to-follow guide shows anyone running Windows XP how to take advantage of the power, stability, and versatility of the most popular operating system in use today. Coverage of basic system features enables you to use your computer effectively and efficiently. Learn to access the Control Panel and customize settings, use keyboard commands, operate and maintain hardware, use all the software properly, and enjoy all the digital entertainment features. Key updates to this edition include full details on Service Pack 2--which provides increased protection against viruses, hackers, and worms--and how it affects security, email, home networking, and firewalls. The new interface and components of Media Player 10 are also covered, making downloading, playing and organizing music and videos much easier.Table of contentsChapter 1: Explore the XP DesktopChapter 2: Manage Your Computer with Control Panel Chapter 3: Configure System SettingsChapter 4: Manage Components, Programs, Folders, &FilesChapter 5: Use Those Accessories That Come with WindowsChapter 6: Manage Your Windows HardwareChapter 7: CH7: Use Printers, Fax Machines, Scanners, and Digital CamerasChapter 8: Create Connections to the InternetChapter 9: Surf the InternetChapter 10: Run Outlook ExpressChapter 11: Create a Home NetworkChapter 12: Manage Users and GroupsChapter 13: Configure ICS, ICF, Remote Desktop, and Remote AssistanceChapter 14: Play GamesChapter 15: Use Windows Media Player 9 for Your Music and Videos Chapter 16: Create Movies with Windows Movie Maker 2Chapter 17: Manage Digital Photos on Windows XPChapter 18: Explore Windows XP Plus! Packs and PowerToysChapter 19: Take Care of Windows XPChapter 20: Solving ProblemsAPPENDIX A: INSTALLING WINDOWS XP
Integrating Shape and Texture for Hand Verification
Authors: Ajay Kumar, David Zhang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper investigates the performance of a bimodal biometric system using fusion of shape and texture. We propose several new hand-shape features that can be used to represent the hand shape and improve the performance for hand-shape based user authentication. We also demonstrate the usefulness of Discrete Cosine Transform (DCT) coefficients for palmprint authentication. The score level fusion of hand shape and palmprint features using product rule achieves best performance as compared to Max or Sum rule. The two hand shapes of an individual are anatomically similar. However, the palmprint information from the two hands can be combined to further improve performance and is investigated in this paper. Our experimental results on the database of 100 users achieve promising results and therefore confirm the usefulness of proposed method.
Hypothesis selection and resolution in the mercury flight reservation system
Authors: Stephanie Seneff, Joseph Polifroni
Venue: Proceedings of the first international conference on Human language technology research (2001)

In a spoken dialogue system, the degree to which the dialogue manager informs and controls the behavior of other human language technology components is an important research topic. Although each separate server can be developed and trained on its own, it must function as part of an entire system, and do so in the context of a complex dialogue with a human user. The dialogue manager is the one component that has not only local information from each server, but also global knowledge about the task and specific knowledge about a particular user's constraints. In this paper, we describe various algorithms we have developed for exploiting the knowledge of the dialogue manager in the selection of recognition hypotheses in the context of human-machine interactions. We describe enhancements we have made to other human language technology servers for the purpose of providing useful information to the dialogue manager, as well as new capabilities in the dialogue manager itself aimed at detecting and repairing problematic spots in the dialogue. We conclude by describing some evaluation metrics and tools we have developed for monitoring system performance.
Algorithmic progress in solving partial differential equations
Authors: John R. Rice
Venue: ACM SIGNUM Newsletter (1976)

This is an attempt to document the progress that has been made over the past 30 years in computational methods for solving partial differential equations. Hopefully the assumptions made in this study are clear, but they may well be disputed. Some computational efforts are quickly estimated here, but others are taken from the literature without an independent check that the same definition of effort is used. There are probably some computational methods which I have overlooked which should be included. Note that this study shows up some obscure methods as being very attractive, which suggests that there are other lesser known methods which are also attractive.
Test factoring: focusing test suites for the task at hand
Authors: David Saff, Michael D. Ernst
Venue: Proceedings of the 27th international conference on Software engineering (2005)

No abstract available
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Authors: Eli Gafni, Rachid Guerraoui, Bastian Pochon
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This is because the topological questions that underly set agreement are not about simple connectivity as in consensus. Analyzing set agreement inspired the discovery of the relation between topology and distributed algorithms, and consequently the impossibility of asynchronous set agreement.Yet, the application of topological reasoning has been to the static case, that of asynchronous and synchronous tasks. It is not known yet for example, how to characterize starvation-free solvability of non-terminating tasks. Non-terminating tasks are dynamic entities with no defined end. In a similar vain, early deciding synchronous set agreement, in which the number of rounds it takes a processor to decide adapts to the actual number of failures, falls in this category of dynamic entities.This paper develops a simulation technique that brings to bear topological results to deal with the dynamic situation that arises with early decisions. The novelty of the new simulation is the ability of simulators to look back at the transcript of past rounds of the simulation to influence their current behavior.Using our new technique, we not only re-derive past results, but we propose and prove a lower bound to synchronous early stopping set agreement. We then provide an algorithm to match the lower bound. Our technique uses the BG simulation, in the most creative way it was used to-date, to obtain a rather simple reduction from a static asynchronous impossibility. This reduction is a simple alternative to yet unknown topological argument, and in fact may suggest the way of finding such an argument.
An Analysis of Reliable Delivery Specifications for Web Services
Authors: Shrideep Pallickara, Geoffrey Fox, Sanmi Lee Pallickara
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Reliable delivery of messages is now a key component of the Web Services roadmap, with two promising, and competing, specifications in this area viz. WS-Reliability (WSR) fromOASIS and WS-ReliableMessaging (WSRM) from IBM and Microsoft. In this paper we provide an analysis of these specifications. Our investigations have been aimed at identifying the similarities and divergence in philosophies of these specifications. We also include a gap analysis and recommendations regarding the gaps identified by the gap analysis.
What's on the Web--And What's Not
Authors: James W. Tankard,  Jr. Cindy Royal
Venue: Social Science Computer Review (2005)

Many students (and some faculty members) seem to act as if the World Wide Web contains all of human knowledge. One indication of this phenomenon is the increasing reliance on web sites by students for research purposes. This study challenges this thinking by examining variation in the amount of information on the web on several dimensions: historical time, completeness of general information, extent of information about different countries, and extent of coverage of corporations. A second phase of the study explored several predictors of amount of information on the web for these same dimensions. The predictors were time, importance of information, population (for countries), and annual revenue (for corporations). Examining the role of the predictors takes a first step toward formulating a theory that explains the content of the web.
Further Torture: More Testing of Backup and Archive Programs
Authors: Elizabeth D. Zwicky
Venue: Proceedings of the 17th USENIX conference on System administration (2003)

Every system administrator depends on some set of programs for making secondary copies of data, as backups for disaster recovery or as archives for long term storage. These programs, like all other programs, have bugs. The important thing for system administrators to know is where those bugs are.Some years ago I did testing on backup and archive programs, and found that failures were extremely common and that the documented limitations of programs did not match their actual limitations. Curious to see how the situation had changed, I put together a new set of tests, and found that programs had improved significantly, but that undocumented failures were still common.In the previous tests, almost every program crashed outright at some point, and <tt>dump</tt> significantly out-performed all other contenders. In addition, many programs other than the backup and archive programs failed catastrophically (most notably <tt>fsck</tt> on many platforms, and the kernel on one platform). Few programs other than <tt>dump</tt> backed up devices, making them incapable of backing up and restoring a functional operating system. In the new tests, crashes are rare, and more programs function as backups of entire systems, but failures in backup and archive programs are still widespread, and <tt>dump</tt> is not inherently more reliable than other programs.
A Multi-Stage Classifier Based Algorithm of Pedestrian Detection in Night with a Near Infrared Camera in a Moving Car
Authors: Hui Sun, Chengying Hua, Yupin Luo
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper presents an algorithm of pedestrian detection in night using a near infrared camera which is installed in a moving car. To deal with several kinds of primary disturbances in the road, we adopt a multi-stage classifier which eliminates certain kinds of disturbances in every stage. Especially in the final stage, a classifier based on 2D pedestrian shape model is designed to make decision. And the speed of detection can be accelerated due to the multi-stage strategy. The experiment shows our method is promising.
A personalized recommender system for travel information
Authors: Sergiu Chelcea, George Gallais, Brigitte Trousse
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

This article concerns an emerging research field related to mobility from the transport point of view, linked to the travel information retrieval. To facilitate such a retrieval, we propose the use of recommender systems in a mobility context: these systems facilitate information retrieval, and help prepare the user's trip ("pre-trip": choice of the transport mode, schedule, route, time of the trip, ...) and carry it out ("on-trip": interactive guidance, way visualization, destination planning). This double impact is rarely exploited today and we propose, after a description of the used technologies, to illustrate the benefits of this new approach on a traditional tourist visit example. The originality of this approach lies in 1) its capacities to adapt the recommendations to the user's behavior during his information retrieval correlated to his own movement and 2) the on-line learning capabilities of such a system supporting information retrieval.
Wait-Free Reference Counting and Memory Management
Authors: Hakan Sundell
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

We present a practical wait-free implementation of a garbage collection scheme based on reference counting that uses atomic primitives which are available in modern computer systems. To the best of our knowledge, this is the first wait-free algorithm of a reference counting scheme that can support dynamic concurrent data structures. As all operations of wait-free algorithms are guaranteed to always finish in a finite number of their own steps independently of the other operations' actions, the new algorithm is especially suitable for real-time systems where execution time guarantees are of significant importance. We also present a wait-free algorithm of a free-list, for supporting concurrent allocation and freeing of memory blocks. The new algorithms are linearizable and are compatible to previous implementations of non-blocking dynamic data structures.
A Lightweight Kernel for the Harness Metacomputing Framework
Authors: C. Engelmann, G. A. Geist
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 1 - Volume 02 (2005)

Harness is a pluggable heterogeneous Distributed Virtual Machine (DVM) environment for parallel and distributed scientific computing. This paper describes recent improvements in the Harness kernel design. By using a lightweight approach and moving previously integrated system services into software modules, the software becomes more versatile and adaptable. This paper outlines these changes and explains the major Harness kernel components in more detail. A short overview is given of ongoing efforts in integrating RMIX, a dynamic heterogeneous reconfigurable communication framework, into the Harness environment as a new plug-in software module. We describe the overall impact of these changes and how they relate to other ongoing work.
A Framework for Sensor Management in Wireless and Heterogeneous Sensor Network
Authors: D. Vaidya, J. Peng, L. Yang, J. W. Rozenblit
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

This paper proposes a framework for sensor configuration and management in wireless multi sensor network system, which is responsible for taking decisions in order to coordinate the assignment and scheduling of sensors best suited for the application. A Sensor Manager operates over a heterogeneous sensor network which provides sensory data from multiple types of sensors. The application of this work is tracking the movement of objects in a moderately occupied confined space. Simulations were run to study the operations of the proposed sensor manage in such application. The simulation results are compared to other published results to show the effectiveness of this work.