ppxscal/embedding_network huggingface dataset:
Sharing Usability Problem Sets within and between Groups
Authors: Gudmundur Freyr Jonasson, Ebba Thora Hvannberg
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

Merging similar usability problems is often a time consuming step in the process of usability evaluation. We have developed a tool which can aid with merging duplicate problem descriptions. The tool enables evaluators to define constructs which describe a usability problem and store them in a database. The evaluator can search for existing constructs, problem descriptions and problem sets using the query language XQuery. The XQuery search function also enables the evaluator to compare usability problems. The tool is designed to be flexible and the exchange of data between evaluators is simple exploiting the compatibility of XML (Extensible Markup Language) and a well defined data structure. We have performed an analysis on a problem set to check for the comparison quality of the merging function in the tool. This has allowed us to suggest further ways to compare usability problems.
A Modelling Framework for Ambient Assisted Living Validation
Authors: Juan-Carlos Naranjo, Carlos Fernandez, Pilar Sala, Michael Hellenschmidt, Franco Mercalli
Venue: Proceedings of the 5th International on ConferenceUniversal Access in Human-Computer Interaction. Part II: Intelligent and Ubiquitous Interaction Environments (2009)

This paper describes a modeling framework that facilitates and streamlines the process of creation, design, construction and deployment of technological solutions in the context of AAL assuring that they are accessible and usable for senior citizens. The framework supports the design of the Human Interaction aspects of an AAL solution in all the stages of a user centered design methodology, putting in practice the guidelines for the verification and validation of the accessibility and usability facets. Two environments are defined: The authoring environment allow the definition of the user, environment and service models. The simulation environment is composed by software and hardware components that constitute a physical ensemble that in conjunction allow the ICT designer to implement actual Virtual Reality scenarios of AAL. It will be used to verify interaction designs and validate the accessibility of the AAL products by means of immersing the users in 3D virtual spaces.
Exploiting named entity classes in CCG surface realization
Authors: Rajakrishnan Rajkumar, Michael White, Dominic Espinosa
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)

This paper describes how named entity (NE) classes can be used to improve broad coverage surface realization with the OpenCCG realizer. Our experiments indicate that collapsing certain multi-word NEs and interpolating a language model where NEs are replaced by their class labels yields the largest quality increase, with 4-grams adding a small additional boost. Substantial further benefit is obtained by including class information in the hyper-tagging (supertagging for realization) component of the system, yielding a state-of-the-art BLEU score of 0.8173 on Section 23 of the CCGbank. A targeted manual evaluation confirms that the BLEU score increase corresponds to a significant rise in fluency.
Gem #59: generating Ada bindings for C headers
Authors: Arnaud Charlet
Venue: ACM SIGAda Ada Letters (2009)

One of the delicate areas of Ada that is often unfamiliar to developers is how to intermix Ada code with other programming languages. While Ada provides very powerful and complete capabilities to interface with other compiled languages such as C, C++, and Fortran, writing the Ada glue code that enables a programmer to use complex and large APIs can be tedious and error-prone. In this Gem, we will explore a new tool provided by AdaCore to automate the interface generation of C header files through the compiler.
A Digital Rights Management Model for Healthcare
Authors: Nicholas Paul Sheppard, Reihaneh Safavi-Naini, Mohammad Jafari
Venue: Proceedings of the 2009 IEEE International Symposium on Policies for Distributed Systems and Networks (2009)

Electronic healthcare records promise to increase the efficiency and effectiveness of healthcare systems, but also introduce new risks to the security and privacy of healthcare information. In this paper, we outline how digital rights management can be used to protect health information transmitted throughout a distributed healthcare system. Our proposal allows for information to be disclosed on a need-to-know basis as defined by workflows, and in line with the wishes of patients.
Student Engagement with Peer Assessment: A Review of Pedagogical Design and Technologies
Authors: Karen Stepanyan, Richard Mather, Hamilton Jones, Carlo Lusuardi
Venue: Proceedings of the 8th International Conference on Advances in Web Based Learning (2009)

The paper summarizes participatory action research that explores student attitudes towards a peer assessment exercise and further reveals a distinctive pattern in student responses. A formative and reciprocal peer assessment exercise was studied to identify possible reasons for low levels of student participation. The target group included students in an undergraduate course in computing. A follow-up questionnaire, undertaken by 36 students, was analyzed and compared against assignment marks. Finally, the access statistics of the virtual learning environment (VLE) were examined. The major results indicate the following: [i] an expectation of more explanatory and supportive tutor intervention; [ii] a student preference towards anonymity; [iii] student interest in accessing peer work; and [iv] that the allocation of marks and in-class activities factors are important in encouraging student involvement.
Minimum Sphere Covering Theory in High Dimension Space and Its Application for Speech Recognition
Authors: Fei Lu, Wenxiu He
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

We study Covering Theory at first and then propose Minimum Sphere Covering(MSC) Algorithms in HighDimension Space. We build an extensible covering neural network by using Minimum Sphere Covering Algorithm. At last, we applied this algorithm in speech recognition and better results describe its effectiveness.
In-Memory Checkpointing for MPI Programs by XOR-Based Double-Erasure Codes
Authors: Gang Wang, Xiaoguang Liu, Ang Li, Fan Zhang
Venue: Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2009)

Today, the scale of High performance computing (HPC) systems is much larger than ever. This brings a challenge to fault tolerance of HPC systems. MPI (Message Passing Interface) is one of the most important programming tools for HPC. There are quite a few fault-tolerant extensions for MPI, such as MPICH-V, StarFish, FT-MPI and so on. Most of them are based on on-disk checkpointing. In this paper, we apply two kinds of XOR-based double-erasure codes - RDP (Row-Diagonal Parity) and B-Code to in-memory checkpointing for MPI programs. We develop scalable checkpointing/recovery algorithms which embed erasure code encoding/decoding computation into MPI collective communications operations. The experiments show that the scalable algorithms decrease communication overhead and balance computation effectively. Our approach provides highly reliable, fast in-memory checkpointing for MPI programs.
Dual 2DLDA Based on Gabor Features for Face Recognition
Authors: Xiangqun Zhang, Xu Zhang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Subspace learning techniques for face recognition have been attached growing attention. Two dimensional linear discriminate analysis (2DLDA) is a popular face recognition technique, which learns two interrelated subspace in an iterative manner. DialLDA is proposed as a complementary method to 2DLDA. Motivated by the success of 2DLDA and DialLDA for face recognition, in the paper we develop an innovative algorithm named Dual-2DLDAmethod, and it integrates the two complementary methods2DLDA and DialLDA to learn multiple subspaces by utilizing Gabor features extracted from the training data.The proposed method can fully extract the information in the training data effectively. We have experimentally compared our method to other popular feature extraction methods, such as 2DPCA, 2DLDA. Experimental results on ORL databases show that the proposed method is superior to the popular methods.
A Study on Stereo and Motion Data Accuracy for a Moving Platform
Authors: Sandino Morales, Young Woon Woo, Reinhard Klette, Tobi Vaudrey
Venue: Proceedings of the FIRA RoboWorld Congress 2009 on Advances in Robotics (2009)

Stereo and motion analysis are potential techniques for providing information for control or assistance systems in various robotics or driver assistance applications. This paper evaluates the performance of several stereo and motion algorithms over a long synthetic sequence (100 stereo pairs). Such an evaluation of low-level computer vision algorithms is necessary, as moving platforms are being used for image analysis in a wide area of applications. In this paper algorithms are evaluated with respect to robustness by modifying the test sequence with various types of realistic noise. The novelty of this paper is comparing top performing algorithms on a long sequence of images, taken from a moving platform.
Algebraic Side-Channel Attacks on the AES: Why Time also Matters in DPA
Authors: Mathieu Renauld, François-Xavier Standaert, Nicolas Veyrat-Charvillon
Venue: Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems (2009)

Algebraic side-channel attacks have been recently introduced as a powerful cryptanalysis technique against block ciphers. These attacks represent both a target algorithm and its physical information leakages as an overdefined system of equations that the adversary tries to solve. They were first applied to PRESENT because of its simple algebraic structure. In this paper, we investigate the extent to which they can be exploited against the AES Rijndael and discuss their practical specificities. We show experimentally that most of the intuitions that hold for PRESENT can also be observed for an unprotected implementation of Rijndael in an 8-bit controller. Namely, algebraic side-channel attacks can recover the AES master key with the observation of a single encrypted plaintext and they easily deal with unknown plaintexts/ciphertexts in this context. Because these attacks can take advantage of the physical information corresponding to all the cipher rounds, they imply that one cannot trade speed for code size (or gate count) without affecting the physical security of a leaking device. In other words, more intermediate computations inevitably leads to more exploitable leakages. We analyze the consequences of this observation on two different masking schemes and discuss its impact on other countermeasures. Our results exhibit that algebraic techniques lead to a new understanding of implementation weaknesses that is different than classical side-channel attacks.
ECODE: A Definition Extraction System
Authors: Rodrigo Alarcón, Gerardo Sierra, Carme Bach
Venue: Human Language Technology. Challenges of the Information Society: Third Language and Technology Conference, LTC 2007, Poznan, Poland, October 5-7, 2007, Revised Selected Papers (2009)

Terminological work aims to identify knowledge about terms in specialised texts in order to compile dictionaries, glossaries or ontologies. Searching for definitions about the terms that terminographers intend to define is therefore an essential task. This search can be done in specialised corpus, where they usually appear in definitional contexts, i.e. text fragments where an author explicitly defines a term. We present a research focused on the automatic extraction of those definitional contexts. The methodology includes three different processes: the extraction of definitional patterns, the automatic filtering of non-relevant contexts, and the automatic identification of constitutive elements, i.e., terms and definitions.
Logic-based verification of technical documentation
Authors: Christian Schönberg, Franz Weitl, Mirjana Jakšić, Burkhard Freitag
Venue: Proceedings of the 9th ACM symposium on Document engineering (2009)

Checking the content coherence of digital documents is the purpose of the Verdikt system which can be applied to different domains and document types including technical documentation, e-learning documents, and web pages. An expressive temporal description logic allows for the specification of content consistency criteria along document paths. Whether the document conforms to the specification can then be verified by applying a model checker. In case of specification violations, the model checker provides counterexamples, locating errors in the document precisely. Based on a sample technical documentation in the form of a web document, the general verification process and its effectiveness, efficiency, and usability are demonstrated.
Cross-domain activity recognition
Authors: Vincent Wenchen Zheng, Derek Hao Hu, Qiang Yang
Venue: Proceedings of the 11th international conference on Ubiquitous computing (2009)

In activity recognition, one major challenge is huge manual effort in labeling when a new domain of activities is to be tested. In this paper, we ask an interesting question: can we transfer the available labeled data from a set of existing activities in one domain to help recognize the activities in another different but related domain? Our answer is "yes", provided that the sensor data from the two domains are related in some way. We develop a bridge between the activities in two domains by learning a similarity function via Web search, under the condition that the sensor data are from the same feature space. Based on the learned similarity measures, our algorithm interprets the data from the source domain as the data in the domain with different confidence levels, thus accomplishing the cross-domain knowledge transfer task. Our algorithm is evaluated on several real-world datasets to demonstrate its effectiveness.
Return Intervals Analysis of the Hong Kong Stock Market
Authors: Hong Zhang, Nianpeng Wang, Keqiang Dong
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

In this paper, we analyze the Hang Seng Index data for the 22-year period, from December 31, 1986, to June 6,2008 in the Hongkong stock market, a total of 5315 trading days. Using rescaled range method, we study how the threshold value q affects the correlations of the return intervals s r(τ ) between events above a certain threshold q. We find that: i) both return intervals obtained by different threshold q and the original series are arranged in long-range dependence behavior; ii) the correlations of the return intervals grow stronger when the threshold q is larger.
Numbat: abolishing privileges when licensing new constituents in constraint-oriented parsing
Authors: Jean-Philippe Prost
Venue: Proceedings of the Third Workshop on Constraints and Language Processing (2006)

The constraint-oriented approaches to language processing step back from the generative theory and make it possible, in theory, to deal with all types of linguistic relationships (e.g. dependency, linear precedence or immediate dominance) with the same importance when parsing an input utterance. Yet in practice, all implemented constraint-oriented parsing strategies still need to discriminate between "important" and "not-so-important" types of relations during the parsing process. In this paper we introduce a new constraint-oriented parsing strategy based on Property Grammars, which overcomes this drawback and grants the same importance to all types of relations.
A Link Quality Evaluation Model in Wireless Sensor Networks
Authors: Zhu Jian, Zhao Hai
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

Wireless link quality evaluation plays an important role in the design of upper layer protocols for wireless sensor networks applications. The packets reception ratio is a typical way of the evaluation; however, it needs a larger number of hello packets. This paper firstly investigates the existing typical link evaluation metrics in wireless sensor networks based on the platform of MicaZ which is developed by Crossbow Company, then takes link quality indication as the evaluation metric to experimentally study the characteristics of wireless link. According to the statistic analysis of large amount of sampling values, a link evaluation model based on gauss distribution is brought forward and it is validated by some tests, the result shows that, link quality indication based evaluation model can evaluate the link’s quality correctly based on lower energy consumption. This research is expansible, therefore, the established link evaluation model can provide guidance for application, and also can provide valuable references for the simulation research of upper layer protocols.
Annotating discourse connectives in the Chinese Treebank
Authors: Nianwen Xue
Venue: Proceedings of the Workshop on Frontiers in Corpus Annotations II: Pie in the Sky (2005)

In this paper we examine the issues that arise from the annotation of the discourse connectives for the Chinese Discourse Treebank Project. This project is based on the same principles as the PDTB, a project that annotates the English discourse connectives in the Perm Treebank. The paper begins by outlining range of discourse connectives under consideration in this project and examines the distribution of the explicit discourse connectives. We then examine the types of syntactic units that can be arguments to the discourse connectives. We show that one of the most challenging issues in this type of discourse annotation is determining the textual spans of the arguments and this is partly due to the hierarchical nature of discourse relations. Finally, we discuss sense discrimination of the discourse connectives, which involves separating discourse connective from non-discourse connective senses and teasing apart the different discourse connective senses, and discourse connective variation, the use of different connectives to represent the same discourse relation.
Personalized reasoner based on belief strengths of information sources
Authors: Cai Shu-Bin, Ming Zhong, Li Shi-Xian
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

Traditionally, only "individual-independent" facts are inputted to a reasoner. The reasoner will produce the same answer to the same question, regardless of who the questioner is. However, since ontology reasoners have their facts distributed in the open internet environment, reasoners may contain "individual-dependent" facts. Personalized reasoner is becoming possible.
Randomized approximation of Sobolev embeddings, II
Authors: Stefan Heinrich
Venue: Journal of Complexity (2009)

We study the approximation of Sobolev embeddings by linear randomized algorithms based on function values. Both the source and the target space are Sobolev spaces of non-negative smoothness order, defined on a bounded Lipschitz domain. The optimal order of convergence is determined. We also study the deterministic setting. Using interpolation, we extend the results to other classes of function spaces. In this context a problem posed by Novak and Wozniakowski is solved. Finally, we present an application to the complexity of general elliptic PDE.
Learning grasp strategies with partial shape information
Authors: Ashutosh Saxena, Lawson L. S. Wong, Andrew Y. Ng
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

We consider the problem of grasping novel objects in cluttered environments. If a full 3-d model of the scene were available, one could use the model to estimate the stability and robustness of different grasps (formalized as form/force-closure, etc); in practice, however, a robot facing a novel object will usually be able to perceive only the front (visible) faces of the object. In this paper, we propose an approach to grasping that estimates the stability of different grasps, given only noisy estimates of the shape of visible portions of an object, such as that obtained from a depth sensor. By combining this with a kinematic description of a robot arm and hand, our algorithm is able to compute a specific positioning of the robot's fingers so as to grasp an object. We test our algorithm on two robots (with very different arms/manipulators, including one with a multifingered hand). We report results on the task of grasping objects of significantly different shapes and appearances than ones in the training set, both in highly cluttered and in uncluttered environments. We also apply our algorithm to the problem of unloading items from a dishwasher.
The number of all possible meaningful or discernible pictures
Authors: Theo Pavlidis
Venue: Pattern Recognition Letters (2009)

The paper provides lower bounds on the number of all possible images that appear meaningful to a human observer as well as the number of all possible images that appear pair-wise distinct to a human observer. These numbers suggest that it is impractical to construct training or testing sets of images that are dense in the set of all images unless the class of images is restricted.
A Software Transactional Memory Service for Grids
Authors: Kim-Thomas Möller, Marc-Florian Müller, Michael Sonnenfroh, Michael Schöttner
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

In-memory data sharing for grids allow location-transparent access to data stored in volatile memory. Existing Grid middlewares typ- ically support only explicit data transfer between Grid nodes. We be- lieve that Grid systems benefit from complementing traditional message- passing techniques with a data-oriented sharing technique. The latter includes automatic replica management, data consistency, and location- transparent access. As a proof of concept, we are implementing a POSIX- compatible object sharing service as part of the EU-funded XtreemOS project, which builds a Linux-based Grid operating system. In this paper we describe the software architecture of the object sharing service and design decisions including transactional consistency and peer-to-peer net- work structure. We also present preliminary evaluation results analyzing lower-bound transaction-overhead using a parallel raytracing application.
eHumanities desktop: an online system for corpus management and analysis in support of computing in the humanities
Authors: Rüdiger Gleim, Ulli Waltinger, Alexandra Ernst, Alexander Mehler, Tobias Feith, Dietmar Esch
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Demonstrations Session (2009)

This paper introduces eHumanities Desktop- an online system for corpus management and analysis in support of Computing in the Humanities. Design issues and the overall architecture are described as well as an initial set of applications which are offered by the system.