ppxscal/embedding_network huggingface dataset:
Comparing and aggregating rankings with ties
Authors: Ronald Fagin, Ravi Kumar, Mohammad Mahdian, D. Sivakumar, Erik Vee
Venue: Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2004)

Rank aggregation has recently been proposed as a useful abstraction that has several applications, including meta-search, synthesizing rank functions from multiple indices, similarity search, and classification. In database applications (catalog searches, fielded searches, parametric searches, etc.), the rankings are produced by sorting an underlying database according to various fields. Typically, there are a number of fields that each have very few distinct values, and hence the corresponding rankings have many ties in them. Known methods for rank aggregation are poorly suited to this context, and the difficulties can be traced back to the fact that we do not have sound mathematical principles to compare two partial rankings, that is, rankings that allow ties.In this work, we provide a comprehensive picture of how to compare partial rankings, We propose several metrics to compare partial rankings, present algorithms that efficiently compute them, and prove that they are within constant multiples of each other. Based on these concepts, we formulate aggregation problems for partial rankings, and develop a highly efficient algorithm to compute the top few elements of a near-optimal aggregation of multiple partial rankings. In a model of access that is suitable for databases, our algorithm reads essentially as few elements of each partial ranking as are necessary to determine the winner(s).
Simulating markov-reward processes with rare events
Authors: Winfried K. Grassmann, Jingxiang Luo
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2005)

Simulating continuous-time Markov reward processes containing rarely visited, but economically important states requires long simulation times unless special measures are taken. In this article, we consider Markov reward processes in equilibrium, and we use the equilibrium equations to reallocate rewards. The effect of this reallocation is determined analytically for a number of small examples. In these examples, significant savings in run lengths were possible, especially in the case where the expected rewards are strongly influenced by low-probability boundary states. The emphasis of the article is on exploration; no large simulation problems have been considered.
Analyzing the Behavior of Parallel Ant Colony Systems for Large Instances of the Task Scheduling Problem
Authors: Enrique Alba, Guillermo Leguizamon, Guillermo Ordonez
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 6 - Volume 07 (2005)

Ant Colony Optimization algorithms are intrinsically distributed algorithms where independent agents are in charge of building solutions collaboratively. Stigmergy or indirect communication is the way in which each agent learns from the experience of the whole colony. In this sense, explicit communication models of ACO can be defined directly giving birth to parallel algorithms of high numerical and real time efficiency. We do so in this work, and apply the resulting algorithms to the Minimum Tardy Task Problem (MTTP), a scheduling problem that has been faced with other meta-heuristics in the past. The aim of this article is to report experimental results on the behavior of three types of parallel ACO algorithms on large instances of the mentioned problems with the goal of improving existing solutions significantly.
A Dynamic Group Mutual Exclusion Algorithm Using Surrogate-Quorums
Authors: Ranganath Atreya, Neeraj Mittal
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

The group mutual exclusion problem extends the traditional mutual exclusion problem by associating a type with each critical section. In this problem, processes requesting critical sections of the same type can execute their critical sections concurrently. However, processes requesting critical sections of different types must execute their critical sections in a mutually exclusive manner. In this paper, we provide a distributed algorithm for solving the group mutual exclusion problem based on the notion of surrogatequorum. Intuitively, our algorithm uses the quorum that has been successfully locked by a request as a surrogate to service other compatible requests for the same type of critical section. Unlike the existing quorum-based algorithms for group mutual exclusion, our algorithm achieves a low message complexity of O(q), where q is the maximum size of a quorum, while maintaining both synchronization delay and waiting time at two message hops. Moreover, like the existing quorum-based algorithms, our algorithm has high maximum concurrency of n, where n is the number of processes in the system. The existing quorum-based algorithms assume that the number of groups is static and does not change during runtime. However, our algorithm can adapt without performance penalties to dynamic changes in the number of groups. Simulation results indicate that our algorithm outperforms the existing quorum-based algorithms for group mutual exclusion by as much as 50% in some cases.
DECIDING THROUGH DOING: THE ROLE OF SKETCHING IN TYPOGRAPHIC DESIGN
Authors: Rachel Hewson
Venue: ACM SIGCHI Bulletin (1991)

Current computer-based tools for document creation do not yet support and enhance the full range of traditional skills possessed by professional typographic designers. These tools' strengths lie in the latter stages of the process, that is, in the production aspects, but they provide only limited support for the early, design stages. Traditionally, the early, decision-making part of the design process has been executed through sketching using paper and pencil. Observations of contemporary professional designers indicate that even those who fluently use computer-based systems for implementing designs nevertheless use paper and pencil to sketch their initial exploration of design ideas. That designers choose the traditional medium for sketching strongly suggests that they are engaging in an activity that is necessary but not yet supported by the electronic medium, since they neither abandon sketching, nor harness the electronic tools for this purpose. 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
String Matching Over Compressed Text on Handheld Devices Using Tagged Sub-Optimal Code (TSC)
Authors: Abdelghani Bellaachia, Iehab Al Rassan
Venue: Real-Time Systems (2005)

This paper presents Tagged Sub-optimal code (TSC), a new coding technique to speed up string matching over compressed databases on personal digital assistants (PDA). TSC is a variable-length sub-optimal code that supports minimal prefix property. It always determines its codeword boundary without traversing a tree or lookup table. TSC technique may be beneficial in many types of applications: speeding up string matching over compressed text, and speeding decoding process. This paper also presents two algorithms for string matching over compressed text using TSC (SCTT) and the Byte Pair Encoding (BPE) technique (SCTB). indent Several experiments were conducted to compare the performance of TSC, Byte Pair Encoding (BPE), and Huffman code. Several PDA databases with different record sizes were used: the well-known Calgary dataset and a set of small-sized PDA databases. Experimental results show that SCTT is almost twice as fast as the Huffman-based algorithm. SCTT has also the same performance in search time as the search in uncompressed databases and is faster than the SCTB algorithm. For frequently updated PDA databases such as phone books, to-do list, and memos, SCTT is the recommended method regardless of the size of the average record length, since the time required to compress the updated records using BPE poses significant delays compared to TSC.
Construction, verification and experimental use of two epitope-tagged collections of budding yeast strains: Research Papers
Authors: Russell Howson, Won-Ki Huh, Sina Ghaemmaghami, James V. Falvo, Kiowa Bower, Archana Belle, Noah Dephoure, Dennis D. Wykoff, Jonathan S. Weissman, Erin K. O'Shea
Venue: Comparative and Functional Genomics (2005)

A major challenge in the post-genomic era is the development of experimental approaches to monitor the properties of proteins on a proteome-wide level. It would be particularly useful to systematically assay protein subcellular localization, post-translational modifications and protein&ndash;protein interactions, both at steady state and in response to environmental stimuli. Development of new reagents and methods will enhance our ability to do so efficiently and systematically. Here we describe the construction of two collections of budding yeast strains that facilitate proteome-wide measurements of protein properties. These collections consist of strains with an epitope tag integrated at the C-terminus of essentially every open reading frame (ORF), one with the tandem affinity purification (TAP) tag, and one with the green fluorescent protein (GFP) tag. We show that in both of these collections we have accurately tagged a high proportion of all ORFs (approximately 75&percnt; of the proteome) by confirming expression of the fusion proteins. Furthermore, we demonstrate the use of the TAP collection in performing high-throughput immunoprecipitation experiments. Building on these collections and the methods described in this paper, we hope that the yeast community will expand both the quantity and type of proteome level data available. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Survey Measures of Web-Oriented Digital Literacy
Authors: Eszter Hargittai
Venue: Social Science Computer Review (2005)

This article presents survey measures of web-oriented digital literacy to serve as proxies for observed skill measures, which are much more expensive and difficult to collect for large samples. Findings are based on a study that examined users' digital literacy through both observations and survey questions, making it possible to check the validity of survey proxy measures. These analyses yield a set of recommendations for what measures work well as survey proxies of people's observed web-use skills. Some of these survey measures were administered on the General Social Survey 2000 and 2002 Internet modules, making the findings relevant for the use of existing large-scale national data sets. Results suggest that some composite variables of survey knowledge items are better predictors of people's actual digital literacy based on performance tests than are measures of users' self-perceived abilities, a proxy traditionally used in the literature on the topic.
Performance Evaluation of a Parallel Pipeline Computational Model for Space-Time Adaptive Processing
Authors: Wei-Keng Liao, Alok Choudhary, Donald Weiner, Pramod Varshney
Venue: The Journal of Supercomputing (2005)

This paper presents further results on the design and implementation of various optimizations based on our earlier work of developing a parallel pipelined model for the computational intensive applications that have multiple processing tasks. Performance evaluation of this model was done by using a real-time airborne radar application that employs a Space-Time Adaptive Processing (STAP) algorithm. This paper focuses on the following four issues: (1) The tradeoffs between increasing the throughput and reducing the latency are examined in more detail when allocating processors among different processing tasks. (2) A multi-threaded design is incorporated into the pipeline model and implemented on a massively parallel computer with symmetric multi-processor nodes, which shows enhanced performance. (3) The disk I/O is incorporated into the parallel pipeline to study its effect on performance in which two I/O task designs have been implemented: embedding I/O in the pipeline or having a separate I/O task. By using a double buffering approach together with the asynchronous I/O, the overall pipeline performance scales well as the number of processors increases. (4) From the comparison of the two I/O implementations, it is discovered that the latency may be improved when merging multiple tasks into a single task. The effect of reorganizing the task structure of the pipeline is discussed in detail. All the performance results shown in this work demonstrate the linear scalability the parallel pipeline model can achieve using a production radar application. Although this paper focuses on the implementation of the parallel pipeline model and uses the results from a STAP application to support the claims of the discovered properties for this pipeline, this model is also applicable to many other types of applications with similar computational characteristics.
Processing link structures and linkbases on the web
Authors: François Bry, Michael Eckert
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Hyperlinks are an essential feature of the World Wide Web, highly responsible for its success. XLink improves on HTML's linking capabilities in several ways. In particular, links after XLink can be "out-of-line" (i.e., not defined at a link source) and collected in (possibly several) linkbases, which considerably ease building complex link structures.Modeling of link structures and processing of linkbases under the Web's "open world linking" are aspects neglected by XLink. Adding a notion of "interface" to XLink, as suggested in this work, considerably improves modeling of link structures. When a link structure is traversed, the relevant linkbase(s) might become ambiguous. We suggest three linkbase management modes governing the binding of a linkbase to a document to resolve this ambiguity.
Hybrid Models for Human Motion Recognition
Authors: Claudio Fanti, Lihi Zelnik-Manor, Pietro Perona
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Probabilistic models have been previously shown to be efficient and effective for modeling and recognition of human motion. In particular we focus on methods which represent the human motion model as a triangulated graph. Previous approaches learned models based just on positions and velocities of the body parts while ignoring their appearance. Moreover, a heuristic approachwas commonly used to obtain translation invariance. In this paper we suggest an improved approach for learning such models and using them for human motion recognition. The suggested approach combines multiple cues, i.e., positions, velocities and appearance into both the learning and detection phases. Furthermore, we introduce global variables in the model, which can represent global properties such as translation, scale or view-point. The model is learned in an unsupervised manner from unlabelled data. We show that the suggested hybrid probabilistic model (which combines global variables, like translation, with local variables, like relative positions and appearances of body parts), leads to: (i) faster convergence of learning phase, (ii) robustness to occlusions, and, (iii) higher recognition rate.
Audio-Visual Affect Recognition through Multi-Stream Fused HMM for HCI
Authors: Zhihong Zeng, Jilin Tu, Brian Pianfetti, Ming Liu, Tong Zhang, Zhenqiu Zhang, Thomas S. Huang, Stephen Levinson
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Advances in computer processing power and emerging algorithms are allowing new ways of envisioning Human Computer Interaction. This paper focuses on the development of a computing algorithm that uses audio and visual sensors to detect and track a user's affective state to aid computer decision making. Using our Multi-stream Fused Hidden Markov Model (MFHMM), we analyzed coupled audio and visual streams to detect 11 cognitive/emotive states. The MFHMM allows the building of an optimal connection among multiple streams according to the maximum entropy principle and the maximum mutual information criterion. Person-independent experimental results from 20 subjects in 660 sequences show that the MFHMM approach performs with an accuracy of 80.61% which outperforms face-only HMM, pitch-only HMM, energy-only HMM, and independent HMM fusion.
Tight Bounds for Wavelength Assignment on Trees of Rings
Authors: Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Afundamental problem in communication networks is wavelength assignment(WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths with the same wavelength are edge-disjoint, using the minimum number of wavelengths. The WA problem is NP-hard for a tree of rings network which is well used in practice. In this paper, we give an efficient algorithm which solves the WA problem on a tree of rings with an arbitrary (node) degree by at most 3Lwavelengths and achieves an approximation ratio of 2.75 asymptotically, where L is the maximum number of paths on any link in the network. The 3L upper bound is tight that there are instances of theWAproblem that require at least 3L wavelengths even on a tree of rings with degree four. We also give a 3L and 2-approximation algorithm for the WA problem on a tree of rings with degree at most six. Previous results include: 4L (resp. 3L) wavelengths for trees of rings with arbitrary degrees (resp. degree at most eight), and 2-approximation (resp. 2.5-approximation) algorithm for trees of rings with degree four (resp. six).
Design of a graphical history browser with Undo facility, and visual search analysis
Authors: Hisanori Masuda, Atsumi Imamiya
Venue: Systems and Computers in Japan (2004)

Existing interactive systems provide the user with various tools to make the system recover from an error. Most direct-manipulation graphical interfaces, for example, include an Undo&sol;Redo tool, by which the user can cancel an erroneous action. However, they are only simple mechanisms or provide only a command history represented by a text list, from which it is difficult to find the command or state desired by the user. The purpose of this paper is to realize an interface which helps the user to utilize Undo selectively and easily, to discuss the design and implementation of a graphical history browser, and to describe a visual search experiment and analysis utilizing the history browser. The history browser includes the following functions. (1) Operation commands for each figure object are grouped. (2) The graphical history composed of snapshots of the operation screen is provided as a flip comic. In order to examine the effectiveness of command grouping, an experimental comparison is made with the conventional techniques without grouping. As a result, the effectiveness of command grouping for the experimental task is shown from the viewpoints of task execution time and subjective evaluation by the subject. In addition, in order to investigate the features of the history browser and the behavior of the user in history search, a task experiment is performed in which two methods of history display&mdash;display of the history browser and parallel displays of two figures&mdash;are used to search visually for the difference between the two figures. The task execution time, the error, and the eye-movement data of the subject are analyzed, and it is shown that by utilizing the flip function of the history browser, the user can find differences quickly and exactly from the specified stimulus display. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(12): 32&ndash;45, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10431
Programming and Customizing the PICAXE Microcontroller, 1 edition
Authors: David Lincoln
Venue:  (2005)

The PICAXE chip is inexpensive and versatile, and can be used to build almost any application other microcontrollers have been used for -- at a lower cost. This first-to-market book on the subject, officially endorsed by the manufacturer of the PICAXE, shows hobbyists how to get the most out of the PICAXE and includes dozens of innovative projects. Includes a programming guide and application notes consolidation for the PICAXE Covers all PICAXE "flavors" and new releases of the Program Editor software Accompanying website includes the Programming Editor software and documentation Table of contentsChapter 1: IntroductionChapter 2: Programming TechniquesChapter 3: PICAXE(tm) ArithmeticChapter 4: Interfacing and Input/Output TechniquesChapter 5: Using Programming Editor(tm)Chapter 6: Programming, Powering, and Resetting the PICAXE(tm)Chapter 7: Basic ExperimentsChapter 8: Intermediate ExperimentsChapter 9: Advanced ExperimentsAPPENDIX
Real-Time Finite Element Finger Pinch Grasp Simulation
Authors: Mamy Pouliquen, Christian Duriez, Claude Andriot, Alain Bernard, Laurent Chodorge, Florian Gosselin
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

This paper addresses physically-based simulation of human fingers for Virtual Reality applications with haptic feedback. Deformation and contact models are based on Finite Element Method. We show that with good assumptions for the Finite Element model and with a corotational approach, we can achieve virtual fingers to perform an interactive grasp task. We also show that thanks to the Gauss-Seidel type resolution method we can speed up the CPU time for complex multi-contact simulations with friction. We describe preliminary results in 2D for grasping rigid objects with deformable fingers in real-time.
Discrete acceleration and personalised tiling as brain?body interface paradigms for neurorehabilitation
Authors: Paul Gnanayutham, Chris Bloor, Gilbert Cockton
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

We present two studies that have advanced the design of brain-body interfaces for use in the rehabilitation of individuals with severe neurological impairment due to traumatic brain injury. We first developed and evaluated an adaptive cursor acceleration algorithm based on screen areas. This improved the initial design, but was too inflexible to let users make the most of their highly varied abilities. Only some individuals were well served by this adaptive interface. We therefore developed and evaluated an approach based on personalized tile layouts. The rationales for both designs are presented, along with details of their implementation. Evaluation studies for each are reported, which show that we have extended the user population who can use our interfaces relative to previous studies. We have also extended the usable functionality for some of our user group. We thus claim that personalized tiling with discrete acceleration has allowed us to extend the usable functionality of brain-body interfaces to a wider population with traumatic brain injury, thus creating new options for neurorehabiliation.