ppxscal/embedding_network huggingface dataset:
The Virtual Midas Touch: Helping Behavior After a Mediated Social Touch
Authors: Antal Haans, Wijnand A. IJsselsteijn
Venue: IEEE Transactions on Haptics (2009)

A brief touch on the upper arm increases people's altruistic behavior and willingness to comply with a request. In this paper, we investigate whether this Midas touch phenomenon would also occur under mediated conditions (i.e., touching via an arm strap equipped with electromechanical actuators). Helping behavior was more frequently endorsed in the touch, compared to the no-touch condition, but this difference was not found to be statistically significant. However, a meta-analytical comparison with published research demonstrated that the strength of the virtual Midas touch is of the same magnitude as that of the Midas touch in unmediated situations. The present experiment, thus, provides empirical evidence that touch-like qualities can be attributed to electromechanical stimulation. This is important for the field of mediated social touch of which the design rationale is based on the assumption that mediated touch by means of tactile feedback technologies is processed in ways similar to real physical contact.
A Petri-Net-Based Approach to QoS Estimation of Web Service Choreographies
Authors: Yunni Xia, Jun Chen, Mingqiang Zhou, Yu Huang
Venue: Advances in Web and Network Technologies, and Information Management: APWeb/WAIM 2009 International Workshops: WCMT 2009, RTBI 2009, DBIR-ENQOIR 2009, PAIS 2009, Suzhou, China, April 2-4, 2009, Revised Selected Papers (2009)

Current Web service choreography proposals, such as WSCI and BPEL, provide notations for describing the message flows in Web service collaborations. The kernel of WSCI consists of simple communication primitives that may be combined using control-flow constructs expressing sequence, branching, parallelism, synchronization, etc. Many efforts have been made on functional formalization and property verification of WSCI-based service choreography. However, QoS facet of service is yet to be given the importance it deserves. In this paper, we introduce a novel analytical approach to predict the QoS of web service choreographed based on WSCI using general stochastic Petri net (GSPN) as the intermediate representation. From the GSPN model and its corresponding continuous-time Markov chain, analytical estimation of three QoS metrics are obtained. In the case study, we also use computer simulation and confidence interval analysis to validate theoretical evaluations.
Analysis of an Improved Multi-user Adaptive Resource Scheduling Algorithm in OFDMA System
Authors: Zhou Yu, Xian-gang Zuo, Jin-hui Lei
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

The Orthogonal Frequency Division Multiple Access (OFDMA) is widely used for its characteristics of high data transmission rate and the flexibility of bandwidth allocation. In this paper, an equivalent SISO model for the MIMO STBC system was presented, and a Multi-user multirate adaptive sub-carrier allocation scheme was proposed also. We apply the algorithm to the OFDMA. The simulations results show that the performance will be improved when the adaptive sub-carrier allocation algorithm are used in conventional system by reducing the total transmit power. So, the complexity will be reduced effectively, it has extensive application.
Speeding-up data-driven applications with program summaries
Authors: Sonia Guéhis, Virginie Goasdoué-Thion, Philippe Rigaux
Venue: Proceedings of the 2009 International Database Engineering & Applications Symposium (2009)

We consider the class of database programs and address the problem of minimizing the cost of their exchanges with the database server. This cost partly consists of query execution at the server side, and partly of query submission and network exchanges between the program and the server. The natural organization of database programs leads to submit an intensive flow of elementary SQL queries to the server, and exploits only locally its optimization power. In this paper, we develop a global optimization approach. We base this approach on an execution model where queries can be executed asynchronously with respect to the flow of the application program. Our method aims at choosing an efficient query scheduling which limits the penalty of client/server interactions. Our results show that the technique can improve the execution time of database programs by several orders of magnitude.
The Quantum Probability Ranking Principle for Information Retrieval
Authors: Guido Zuccon, Leif A. Azzopardi, Keith Rijsbergen
Venue: Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory (2009)

While the Probability Ranking Principle for Information Retrieval provides the basis for formal models, it makes a very strong assumption regarding the dependence between documents. However, it has been observed that in real situations this assumption does not always hold. In this paper we propose a reformulation of the Probability Ranking Principle based on quantum theory. Quantum probability theory naturally includes interference effects between events. We posit that this interference captures the dependency between the judgement of document relevance. The outcome is a more sophisticated principle, the Quantum Probability Ranking Principle, that provides a more sensitive ranking which caters for interference/dependence between documents' relevance.
Classified self-organizing map with adaptive subcodebook for edge preserving vector quantization
Authors: Chao-Huang Wang, Chung-Nan Lee, Chaur-Heh Hsieh
Venue: Neurocomputing (2009)

This paper presents a novel classified self-organizing map method for edge preserving quantization of images using an adaptive subcodebook and weighted learning rate. The subcodebook sizes of two classes are automatically adjusted in training iterations based on modified partial distortions that can be estimated incrementally. The proposed weighted learning rate updates the neuron efficiently no matter of how large the weighting factor is. Experimental results show that the new method achieves better quality of reconstructed edge blocks and more spread out codebook and incurs a significantly less computational cost as compared to the competing methods.
User-Centred Design and Literacy Tools for the Deaf
Authors: Tania Mascio, Rosella Gennari
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Addressing Diversity. Part I: Held as Part of HCI International 2009 (2009)

The need of literacy intervention and of tools for deaf people is largely documented in the literature of deaf studies. This paper aims at eliciting the interests of HCI researchers and practitioners alike on the creation of more intelligent web tools for the literacy of deaf people. Our paper overviews several e-tools for the literacy of the deaf, and it assesses them according to the user centred design methodology. It concludes with a proposal, namely, a first set of guidelines for designing usable e-tools for deaf people, and calls for a debate on the need of a deaf user centred design.
MMR-based active machine learning for bio named entity recognition
Authors: Seokhwan Kim, Yu Song, Kyungduk Kim, Jeong-Won Cha, Gary Geunbae Lee
Venue: Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX (2006)

This paper presents a new active learning paradigm which considers not only the uncertainty of the classifier but also the diversity of the corpus. The two measures for uncertainty and diversity were combined using the MMR (Maximal Marginal Relevance) method to give the sampling scores in our active learning strategy. We incorporated MMR-based active machine-learning idea into the biomedical named-entity recognition system. Our experimental results indicated that our strategies for active-learning based sample selection could significantly reduce the human effort.
On the Use of Run Time Distributions to Evaluate and Compare Stochastic Local Search Algorithms
Authors: Celso C. Ribeiro, Isabel Rosseti, Reinaldo Vallejos
Venue: Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics (2009)

Run time distributions or time-to-target plots are very useful tools to characterize the running times of stochastic algorithms for combinatorial optimization. We further explore run time distributions and describe a new tool to compare two algorithms based on stochastic local search. For the case where the running times of both algorithms fit exponential distributions, we derive a closed form index that gives the probability that one of them finds a solution at least as good as a given target value in a smaller computation time than the other. This result is extended to the case of general run time distributions and a numerical iterative procedure is described for the computation of the above probability value. Numerical examples illustrate the application of this tool in the comparison of different algorithms for three different problems.
Is White Light the Best Illumination for Palmprint Recognition?
Authors: Zhenhua Guo, David Zhang, Lei Zhang
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

Palmprint as a new biometric has received great research attention in the past decades. It owns many merits, such as robustness, low cost, user friendliness, and high accuracy. Most of the current palmprint recognition systems use an active light to acquire clear palmprint images. Thus, light source is a key component in the system to capture enough of discriminant information for palmprint recognition. To the best of our knowledge, white light is the most widely used light source. However, little work has been done on investigating whether white light is the best illumination for palmprint recognition. In this study, we empirically compared palmprint recognition accuracy using white light and other six different color lights. The experiments on a large database show that white light is not the optimal illumination for palmprint recognition. This finding will be useful to future palmprint recognition system design.
Extremely lexicalized models for accurate and fast HPSG parsing
Authors: Takashi Ninomiya, Takuya Matsuzaki, Yoshimasa Tsuruoka, Yusuke Miyao, Jun'ichi Tsujii
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

This paper describes an extremely lexicalized probabilistic model for fast and accurate HPSG parsing. In this model, the probabilities of parse trees are defined with only the probabilities of selecting lexical entries. The proposed model is very simple, and experiments revealed that the implemented parser runs around four times faster than the previous model and that the proposed model has a high accuracy comparable to that of the previous model for probabilistic HPSG, which is defined over phrase structures. We also developed a hybrid of our probabilistic model and the conventional phrase-structure-based model. The hybrid model is not only significantly faster but also significantly more accurate by two points of precision and recall compared to the previous model.
A simple sentence-level extraction algorithm for comparable data
Authors: Christoph Tillmann, Jian-ming Xu
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers (2009)

The paper presents a novel sentence pair extraction algorithm for comparable data, where a large set of candidate sentence pairs is scored directly at the sentence-level. The sentence-level extraction relies on a very efficient implementation of a simple symmetric scoring function: a computation speed-up by a factor of 30 is reported. On Spanish-English data, the extraction algorithm finds the highest scoring sentence pairs from close to 1 trillion candidate pairs without search errors. Significant improvements in BLEU are reported by including the extracted sentence pairs into the training of a phrase-based SMT (Statistical Machine Translation) system.
Sphericity test in a GMANOVA-MANOVA model with normal error
Authors: Peng Bai
Venue: Journal of Multivariate Analysis (2009)

For the GMANOVA-MANOVA model with normal error: Y=XB"1Z"1^'+B"2Z"2^'+E, E~N"q"x"n(0,I"n@?@S), we study in this paper the sphericity hypothesis test problem with respect to covariance matrix: @S=@lI"q (@l is unknown). It is shown that, as a function of the likelihood ratio statistic @L, the null distribution of @L^2^/^n can be expressed by Meijer's G"q","q^q^,^0 function, and the asymptotic null distribution of -2log@L is @g"q"("q"+"1")"/"2"-"1^2 (as n->~). In addition, the Bartlett type correction -2@rlog@L for log@L is indicated to be asymptotically distributed as @g"q"("q"+"1")"/"2"-"1^2 with order n^-^2 for an appropriate Bartlett adjustment factor -2@r under null hypothesis.
TJDewey --- On the Efficient Path Labeling Scheme Holistic Approach
Authors: Radim Bača, Michal Krátký
Venue: Database Systems for Advanced Applications: DASFAA 2009 International Workshops: BenchmarX, MCIS, WDPP, PPDA, MBC, PhD, Brisbane, Australia, April 20 - 23, 2009 (2009)

In recent years, many approaches to XML twig pattern searching have been developed. Holistic approaches are particularly significant in that they provide a theoretical model for optimal processing of some query classes and have very low main memory complexity. Holistic algorithms can be incorporated into XQuery algebra as a twig query pattern operator.We can find two types of labeling schemes used by indexing methods: element and path labeling schemes. The path labeling scheme is a labeling scheme where we can extract all the ancestor's labels from a node label. In the TJFast method, authors have introduced an application of the path labeling scheme (Extended Dewey) in the case of holistic methods. In our paper, we depict some improvements of this method that lead to a better scalability of the TJFast algorithm. We introduce the TJDewey algorithm which combines the TJFast algorithm with the DataGuide summary tree. The path labeling schemes have better update features and our article shows that the utilization of a path labeling scheme can have comparable or even better query processing parameters compared to other element labeling scheme approaches.
Study on Virtual Measurement Technology for Near-Bit Dynamic Forces of Bottom-Hole Assembly
Authors: Cheng Li, Tianhuai Ding, Peng Wang, Ken Chen
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

A virtual measurement system for investigating the dynamic behaviors of bottom-hole assembly (BHA) in measurement while drilling is designed and set up. Based on the working principle of system, a straight beam strain gauge sensor device and a virtual instrument-based dynamic force wireless measurement system are developed. The axial force, radial force and torque exerted on rotating simulated drillstring are detected multithreadedly in the laboratory. Then the lateral force is calculated. The dynamic force parameters of BHA composed of simulated drillstrings are measured under different weight on bit loads and deviation angles. The experimental results show that lateral force can facilitate the hole deviation control of BHA due to more sensitivity to weight on bit, deviation angle and BHA combination mode. The proposed measurement technology provides the experimental basis for the theoretical analyses of the hole deviation control mechanism of BHA.
A New Decision-Diagram-Based Method for Efficient Analysis on Multistate Systems
Authors: Liudong Xing, Y. S. Dai
Venue: IEEE Transactions on Dependable and Secure Computing (2009)

Multistate systems can model many practical systems in a wide range of real applications. A distinct characteristic of these systems is that the systems and their components may assume more than two levels of performance (or states), varying from perfect operation to complete failure. The nonbinary property of multistate systems and their components makes the analysis of multistate systems difficult. This paper proposes a new decision-diagram-based method, called multistate multivalued decision diagrams (MMDD), for the analysis of multistate systems with multistate components. Examples show how the MMDD models are generated and evaluated to obtain the system-state probabilities. The MMDD method is compared with the existing binary decision diagram (BDD)-based method. Empirical results show that the MMDD method can offer less computational complexity and simpler model evaluation algorithm than the BDD-based method.
IBM Lotus Notes 8.5 Quick Source Guide
Authors: Quick Source
Venue:  (2009)

Do you need an easy-to-follow software reference right at your fingertips? Our 6 page, tri-fold guides are the answer. These quick reference guides include step by step instructions to help users to learn software features more quickly, as well as full color screen graphics to highlight important features. Quick Source reference guides also include the software program s NEW features and gives you quick access to time saving shortcuts. The Lotus Notes 8.5 Quick Source guide is a clear and concise tool for learning the features in Entourage. Features included in this guide include NEW features such as Using the Type-Ahead Feature, Importing Contacts, Exporting Contacts, and Adding a Calendar. It also includes Working with Mail Features, Creating a Meeting, Navigating in the Calendar, Creating a Replica, Getting Help, and much more. 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
Automating the underwriting of insurance applications
Authors: Kareem S. Aggour, William Cheetham
Venue: Proceedings of the 17th conference on Innovative applications of artificial intelligence - Volume 3 (2005)

An end-to-end system was created at Genworth Financial to automate the underwriting of Long Term Care (LTC) and Life Insurance applications. Relying heavily on Artiticial Intelligence techniques, the system has been in production since December 2002 and today completely automates the underwriting of 19.2% of the LTC applications. A fuzzy logic rules engine encodes the underwriter guidelines and an evolutionary algorithm optimizes the engine's performance. Finally, a natural language parser is used to improve the coverage of the underwriting system.
Parallel MATLAB for Multicore and Multinode Computers, 1st edition
Authors: Jeremy Kepner
Venue: Software, Environments And Tools (2009)

This is the first book on parallel MATLAB and the first parallel computing book focused on the design, code, debug, and test techniques required to quickly produce well-performing parallel programs. MATLAB is currently the dominant language of technical computing with one million users worldwide, many of whom can benefit from the increased power offered by inexpensive multicore and multinode parallel computers. MATLAB is an ideal environment for learning about parallel computing, allowing the user to focus on parallel algorithms instead of the details of implementation. Parallel MATLAB for Multicore and Multinode Computers covers more parallel algorithms and parallel programming models than any other parallel programming book due to the succinctness of MATLAB. It presents a hands-on approach with numerous example programs; wherever possible, the examples are drawn from widely known and well-documented parallel benchmark codes that are representative of many real applications across the field of technical computing. Audience: Intended for professional scientists and engineers, as well as undergraduate or graduate students, who use MATLAB. It is suitable as either the primary book in a parallel computing class or as a supplementary text in a numerical computing class or a computer science algorithms class. Contents: List of Figures; List of Tables; List of Algorithms; Preface; Acknowledgments; Part I: Fundamentals: Chapter 1: Primer: Notation and Interfaces; Chapter 2: Introduction to pMatlab; Chapter 3: Interacting with Distributed Arrays; Part II: Advanced Techniques: Chapter 4: Parallel Programming Models; Chapter 5: Advanced Distributed Array Programming; Chapter 6: Performance Metrics and Software Architecture; Part III: Case Studies: Chapter 7: Parallel Application Analysis; Chapter 8: Stream; Chapter 9: RandomAccess; Chapter 10: Fast Fourier Transform; Chapter 11: High Performance Linpack; Appendix: Notation for Hierarchical Parallel Multicore Algorithms; Index
Within and Between-Subject Reliability Using Classic Jack for Ergonomic Assessments
Authors: Brian Mcinnes, Allison Stephens, Jim Potvin
Venue: Proceedings of the 2nd International Conference on Digital Human Modeling: Held as Part of HCI International 2009 (2009)

As the use of computer-aided ergonomic tools become more prominent in performing ergonomic evaluations early in the design phase, the drive to improve upon the validity, reliability, and accuracy of the technology will increase. Posturing a digital human (DH) in a virtual environment proves to be a challenging task. There are a very large number of possible positions in which the DH can be positioned for any given task, and the position that the DH is postured into may differ depending on the experiences of the user. This may lead to different conclusions regarding the acceptability of an operation.
A Flexible Access Control Model for Distributed Collaborative Editors
Authors: Abdessamad Imine, Asma Cherif, Michaël Rusinowitch
Venue: Proceedings of the 6th VLDB Workshop on Secure Data Management (2009)

Distributed Collaborative Editors (DCE) provide computer support for modifying simultaneously shared documents, such as articles, wiki pages and programming source code, by dispersed users. Controlling access in such systems is still a challenging problem, as they need dynamic access changes and low latency access to shared documents. In this paper, we propose a flexible access control model where the shared document and its authorization policy are replicated at the local memory of each user. To deal with latency and dynamic access changes, we use an optimistic access control technique in such a way that enforcement of authorizations is retroactive. We show that naive coordination between updates of both copies can create security holes on the shared document, by permitting illegal modifications or rejecting legal modifications. Finally, we present a prototype for managing authorizations in collaborative editing work which may be deployed easily on P2P networks.