ppxscal/embedding_network huggingface dataset:
CWE: Assistance Environment for the Evaluation Operating a Set of Variations of the Cognitive Walkthrough Ergonomic Inspection Method
Authors: Thomas Mahatody, Christophe Kolski, Mouldi Sagar
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

In spite of the existence of several usability inspection methods, they are still insufficiently used because of various constraints, such as the absence of software environments to facilitate their use and the inexistence of guides to choose the best method to be used. This article describes the design of CWE (Cognitive Walkthrough Environment) which is an evaluation assistance environment exploiting the Cognitive Walkthrough inspection method. This environment is intended to facilitate the use of the CW method as well as several of its versions and extensions.
What Can Be Taught: Part II
Authors: Roger C. Schank
Venue: eLearn (2009)

In a previous column, ("Things That Can't Be Taught"), I opened up the idea that there are some things that can't be taught, even though some e-learning tries to teach them. Then, in Part I of this article, I looked instead at things that can be taught and began outlining the different ways through which we learn them, which can be categorized into the processes that inform them: conscious processes, subconscious processes, analytic processes, and mixed processes. In Part I, I wrote about learning through conscious processes. Here, I will look at the other three. 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
Rewriting XPath Expressions Depending on Path Summary
Authors: Xiaoshuang Xu, Yucai Feng, Feng Wang, Yingbiao Zhou
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

Optimizing XPath expressions before query execution is an important measure for efficient improvement of the holistic performance. After path summary is derived from a XML document, we equivalently transfer a path expression into the ones without descendent axes or wildcards. To rewrite a linear path expression, its analytical path set is calculated in polynomial time under path summary. For complex expressions, we disclose path restraints among nodes in its tree pattern under path summary, and develop a rewriting algorithm to completely eliminate its descendent and wildcard features. Thereof, path summary provides an excellent basis for rewriting XPath expressions. The experimental results show that our algorithm can rewrite XPath expressions effectively.
DHTCache: A Distributed Service to Improve the Selection of Cache Configurations within a Highly-Distributed Context
Authors: Carlos E. Gómez, María Pilar Villamil, Harold E. Castro, Laurent D'Orazio
Venue: Proceedings of the 2nd International Conference on Data Management in Grid and Peer-to-Peer Systems (2009)

Peer-to-peer (P2P) systems based on distributed hash tables allow the construction of applications with high scalability and high availability. These kinds of applications are more sophisticated and demanding on data volume to be handled as well as their location. A cache is quite interesting within these applications since a cache reduces the latency experienced by users. Nevertheless, configuring a suitable cache is not a trivial issue due to the quantity of parameters, especially within distributed and dynamic environments. This is the motivation for proposing the DHTCache, a cache service that allows developers to experiment with different cache configurations to provide information to make better decisions on the type of cache suitable for P2P applications.
An efficient algorithm to induce minimum average lookahead grammars for incremental LR parsing
Authors: Dekai Wu, Yihai Shen
Venue: Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together (2004)

We define a new learning task, minimum average lookahead grammar induction, with strong potential implications for incremental parsing in NLP and cognitive models. Our thesis is that a suitable learning bias for grammar induction is to minimize the degree of lookahead required, on the underlying tenet that language evolution drove grammars to be efficiently parsable in incremental fashion. The input to the task is an unannotated corpus, plus a non-deterministic constraining grammar that serves as an abstract model of environmental constraints confirming or rejecting potential parses. The constraining grammar typically allows ambiguity and is itself poorly suited for an incremental parsing model, since it gives rise to a high degree of nondeterminism in parsing. The learning task, then, is to induce a deterministic LR (k) grammar under which it is possible to incrementally construct one of the correct parses for each sentence in the corpus, such that the average degree of lookahead needed to do so is minimized. This is a significantly more difficult optimization problem than merely compiling LR (k) grammars, since k is not specified in advance. Clearly, na&iuml;ve approaches to this optimization can easily be computationally infeasible. However, by making combined use of GLR ancestor tables and incremental LR table construction methods, we obtain an O(n3 + 2m) greedy approximation algorithm for this task that is quite efficient in practice.
Cultural Dimensions in User Preferences and Behaviors of Mobile Phones and Interpretation of National Cultural Differences
Authors: Juhyun Eune, Kun-Pyo Lee
Venue: Proceedings of the 3rd International Conference on Internationalization, Design and Global Development: Held as Part of HCI International 2009 (2009)

The purpose of this study is to identify the differences in user behaviors and cultural tendencies which will develop a cultural evaluation frame work for mobile phone design among countries in the mobile telecommunication market. Cultural taxonomy helps the understanding of cultural differences. To help understand the Asian market more clearly, a brief overview of Geert Hofstede's findings (Individualism, Uncertainty avoidance, Power distance, Masculinity, and Long-term orientation) and the K.P. Lee's Cultural Variables (Way of Task Handling, Temporal Perception, Conception of Nature, Adherence to rules, Relationship with Human, Nature of Human Activity, Message Contexting, and Expression of Emotion) for the index of different cultures was used in this study. This research is based on an online survey in three countries (Korea, China and Japan), summarizing the responses of questionnaire about user preferences, and behavioral perceptions of UI Design of mobile phones. The result of this research identified the differences and similarities among countries clearly, reorganized the cultural variables. After comparing values of author's value from online survey and two other variables, this study found that Hofstede's and KP Lee's are very meaningful to identify cultural-based national characteristics. This verifies that differences of usage behavior and preference for mobile phone reflect cultural perspectives. This cultural research is the key to understanding these needs and to providing the companies with advanced market positioning. This study should not stop at a simple cross-national comparison but be a cultural comparison framework for giving companies a clear future direction for globalization-based design development.
Isometric projection
Authors: Deng Cai, Xiaofei He, Jiawei Han
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Recently the problem of dimensionality reduction has received a lot of interests in many fields of information processing. We consider the case where data is sampled from a low dimensional manifold which is embedded in high dimensional Euclidean space. The most popular manifold learning algorithms include Locally Linear Embedding, ISOMAP, and Laplacian Eigenmap. However, these algorithms are nonlinear and only provide the embedding results of training samples. In this paper, we propose a novel linear dimensionality reduction algorithm, called Isometric Projection. Isometric Projection constructs a weighted data graph where the weights are discrete approximations of the geodesic distances on the data manifold. A linear subspace is then obtained by preserving the pairwise distances. In this way, Isometric Projection can be defined everywhere. Comparing to Principal Component Analysis (PCA) which is widely used in data processing, our algorithm is more capable of discovering the intrinsic geometrical structure. Specially, PCA is optimal only when the data space is linear, while our algorithm has no such assumption and therefore can handle more complex data space. Experimental results on two real life data sets illustrate the effectiveness of the proposed method.
A Knowledge-Base for Web Information Integration and Retrieval
Authors: Wenhong Guo, Xuefeng Fan
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

Domain knowledge-base construction plays an important role in intelligent web structured information processing. The paper provides a basic resource construction technique for semantic web information processing. Firstly it puts forward a Chinese domain knowledge composition model. Then it introduces how to construct special domain knowledge-base. The construction mainly based on database schemas, web query page interfaces and traditional knowledge construction methods Techniques about knowledge acquisition, knowledge representation, knowledge storage and reasoning are discussed in detail. The main knowledge architecture is a semantic network which is constituted by many kinds of knowledge units. We have worked on it for web Chinese information in several domains and achieved tangible results. The research is valuable to large scale applications of intelligent information integration and information retrieval on the Web.
Computational modelling of structural priming in dialogue
Authors: David Reitter, Frank Keller, Johanna D. Moore
Venue: Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX (2006)

Syntactic priming effects, modelled as increase in repetition probability shortly after a use of a syntactic rule, have the potential to improve language processing components. We model priming of syntactic rules in annotated corpora of spoken dialogue, extending previous work that was confined to selected constructions. We find that speakers are more receptive to priming from their interlocutor in task-oriented dialogue than in spona-neous conversation. Low-frequency rules are more likely to show priming.
Managing the mappings between domain ontologies and database schemas when formulating relational queries
Authors: Kamran Munir, Mohammed Odeh, Richard McClatchey
Venue: Proceedings of the 2009 International Database Engineering & Applications Symposium (2009)

In recent years, the tremendous increase in the use of medical knowledge-discovery and decision-support applications has often required clinical researchers to write complex database queries. The users of these data analysis systems are normally unaware of the semantic relationships between the concepts stored in a database. In order to provide automated query formulation services, some mechanism for generating queries is required. In this regard, as reported in [1], domain ontologies can be used to formulate relational database queries in order to simplify the data access of the underlying data sources. However, the provision of such a query generation facility requires managing complex mappings between domain ontologies and relational data sources. In this regard, this paper discusses our approach to define mappings between domain ontologies and database schemas to support the ontology assisted relational query formulation process. This approach has been applied to the integrated medical database schema of the EU funded Health-e-Child (HeC) project.
Communication in Naturally Mobile Sensor Networks
Authors: Donghua Deng, Qun Li
Venue: Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications (2009)

Naturally mobile sensors networks are ad-hoc sensor networks in which nodes move under the control of the environment, for example for nodes attached to animals or for nodes drifting with currents on the surface of the water. In this paper we study communication in one type of naturally mobile network, where motion can be modeled as a random walk approximation to Brownian motion. This model captures the movement of societies of animals such as grazing herds. We analyze information propagation in such networks using a reaction-diffusion approach.
An Approximation Algorithm for Approximation Rank
Authors: Troy Lee, Adi Shraibman
Venue: Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity (2009)

One of the strongest techniques available for showing lower bounds on bounded-error communication complexity is the logarithm of the approximation rank of the communication matrix---the minimum rank of a matrix which is entrywise close to the communication matrix. Krause showed that the logarithm of approximation rank is a lower bound in the randomized case, and later Buhrman and de Wolf showed it could also be used for quantum communication complexity. As a lower bound technique, approximation rank has two main drawbacks: it is difficult to compute, and it is not known to lower bound the model of quantum communication complexity with entanglement. We give a polynomial time constant factor approximation algorithm to the logarithm of approximation rank, and show that the logarithm of approximation rank is a lower bound on quantum communication complexity with entanglement.
Parallel Particle Swarm Optimization with Adaptive Asynchronous Migration Strategy
Authors: Zhi-Hui Zhan, Jun Zhang
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

This paper proposes a parallel particle swarm optimization (PPSO) by dividing the search space into sub-spaces and using different swarms to optimize different parts of the space. In the PPSO framework, the search space is regarded as a solution vector and is divided into two sub-vectors. Two cooperative swarms work in parallel and each swarm only optimizes one of the sub-vectors. An adaptive asynchronous migration strategy (AAMS) is designed for the swarms to communicate with each other. The PPSO benefits from the following two aspects. First, the PPSO divides the search space and each swarm can focus on optimizing a smaller scale problem. This reduces the problem complexity and makes the algorithm promising in dealing with large scale problems. Second, the AAMS makes the migration adapt to the search environment and results in a very timing and efficient communication fashion. Experiments based on benchmark functions have demonstrated the good performance of the PPSO with AAMS on both solution accuracy and convergence speed when compared with the traditional serial PSO (SPSO) and the PPSO with fixed migration frequency.
Interest-matching comparisons using CP-nets
Authors: Andrew W. Wicker, Jon Doyle
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

The formation of internet-based social networks has revived research on traditional social network models as well as interest-matching, or match-making, systems. In order to automate or augment the process of interest-matching, we describe a method for the comparison of preference orderings represented by CP-nets, which allows one to determine a shared interest level between agents. Empirical results suggest that this distance measure for preference orderings agrees with the intuitive assessment of shared interest levels.
Formal Verification of a Microkernel Used in Dependable Software Systems
Authors: Christoph Baumann, Bernhard Beckert, Holger Blasum, Thorsten Bormer
Venue: Proceedings of the 28th International Conference on Computer Safety, Reliability, and Security (2009)

In recent years, deductive program verification has improved to a degree that makes it feasible for real-world programs. Following this observation, the main goal of the BMBF-supported Verisoft XT project is (a) the creation of methods and tools which allow the pervasive formal verification of integrated computer systems, and (b) the prototypical realization of four concrete, industrial application tasks.In this paper, we report on the Verisoft XT subproject Avionics, where formal verification is being applied to a commercial embedded operating system. The goal is to use deductive techniques to verify functional correctness of the PikeOS system, which is a microkernel-based partitioning hypervisor.We present our approach to verifying the microkernel's system calls, using a system call for changing the priority of threads as an example. In particular, (a) we give an overview of the tool chain and the verification methodology, (b) we explain the hardware model and how assembly semantics is specified so that functions whose implementation contain assembly can be verified, and (c) we describe the verification of the system call itself.
Gesture-Based Interface for Connection and Control of Multi-device in a Tabletop Display Environment
Authors: Hyunglae Lee, Heeseok Jeong, Joongho Lee, Ki-Won Yeom, Ji-Hyung Park
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

In this paper, we propose a gesture-based interface for connection and control of multiple devices in a ubiquitous computing environment. With simple selection and pointing gestures, users can easily control connections between multiple devices as well as manage information or data between them. Based on a robust gesture recognition algorithm and a virtual network computing technology, we implemented this concept in an intelligent meeting room consisting of a tabletop, interactive wall displays, and other popular devices such as laptops and mobile devices. We also performed a preliminary user study in this environment, and the results show the usability of the suggested interface.
An inference model for semantic entailment in natural language
Authors: Rodrigo De Salvo Braz, Roxana Girju, Vasin Punyakanok, Dan Roth, Mark Sammons
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 3 (2005)

Semantic entailment is the problem of determining if the meaning of a given sentence entails that of another. This is a fundamental problem in natural language understanding that provides a broad framework for studying language variability and has a large number of applications. This paper presents a principled approach to this problem that builds on inducing representations of text snippets into a hierarchical knowledge representation along with a sound optimization-based inferential mechanism that makes use of it to decide semantic entailment. A preliminary evaluation on the PASCAL text collection is presented.
Adapting naturally occurring test suites for evaluation of clinical question answering
Authors: Dina Demner-Fushman
Venue: Software Engineering, Testing, and Quality Assurance for Natural Language Processing (2008)

This paper describes the structure of a test suite for evaluation of clinical question answering systems; presents several manually compiled resources found useful for test suite generation; and describes the adaptation of these resources for evaluation of a clinical question answering system.
Brain Processes and Neurofeedback for Performance Enhancement of Precision Motor Behavior
Authors: B. Hatfield, A. Haufler, J. Contreras-Vidal
Venue: Proceedings of the 5th International Conference on Foundations of Augmented Cognition. Neuroergonomics and Operational Neuroscience: Held as Part of HCI International 2009 (2009)

Based on a number of empirical investigations of cerebral cortical dynamics during precision aiming tasks (i.e. marksmanship) employing electroencephalography (EEG) refinement of cortical activity and attenuation of nonessential cortico-cortical communication with the motor planning regions of the brain results in superior performance. Employment of EEG neurofeedback during the aiming period of target shooting designed to reduce cortical activation resulted in improved performance in skilled marksmen. Such an effect implies that refinement of cortical activity is causally related to performance. Recently, we examined cerebral cortical dynamics during the stress of competitive target shooting and observed increased activation and cortico-cortical communication between non-motor and motor regions relative to a practice-alone condition. As predicted, this finding was associated with degradation of shooting performance. These findings imply that neurofeedback targeted to brain regions related to emotional responding may preserve the cortical dynamics associated with superior performance resulting in improved accuracy of precision aiming performance.
On the Soundness Property for SQL Queries of Fine-grained Access Control in DBMSs
Authors: Jie Shi, Hong Zhu, Ge Fu, Tao Jiang
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

The fine-grained access control approaches in DBMSs should satisfy soundness property which requires the answer of a query returned by the approach under the control of fine-grained access control is consistent with the answer when there is no fine-grained access control. However, existing techniques cannot guarantee soundness property for all SQL queries. Therefore, for an approach, there is a practical need to state that, for which kinds of SQL queries, soundness property can be guaranteed by this approach. In this paper,we present our initial e ort for this objective. We firstly proposed a new algorithm with query modification. Then,we refine, extend and enhance the theory about soundness property, and state that, for which kinds of SQL queries, the soundness property is guaranteed by the proposed algorithm.Finally, we implement the algorithm using query modification and performance evaluation has also been conducted,which indicates this approach is feasible.
A Study on Effective Methods of Visual Inspection for Reused-Parts by Inspectors
Authors: Toshiyuki Matsumoto, Hideki Shirai, Keisuke Shida
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

In order to promote recycling in the recycling industry, it is essential that suppliers perform a strict inspection before shipping the products using reused or recycled parts. The industry is facing pressures to further improve and standardize inspection quality and efficiency on recycled parts or products. This study thus developed an effective visual inspection method for products using reused parts by inspectors at Recycling Plant N, for assuring product quality. First, a survey was conducted to investigate the current situation at the subject plant. Secondly, another set of surveys was conducted for the 13 inspectors. The survey included a video analysis, a questionnaire survey analysis, and an analysis of eye movements using an eye-tracker, and after the analyses, the differences were specified. Thirdly, by considering the inspection method and inspection orders used by the experienced inspectors, appropriate inspection items, inspection order, and inspection method could be devised.