ppxscal/embedding_network huggingface dataset:
Scalar Processing Overhead on SIMD-Only Architectures
Authors: Arnaldo Azevedo Filho, Ben Juurlink
Venue: Proceedings of the 2009 20th IEEE International Conference on Application-specific Systems, Architectures and Processors (2009)

The Cell processor consists of a general-purpose core and eight cores with a complete SIMD instruction set. Although originally designed for multimedia and gaming, it is currently being used for a much broader range of applications.In this paper we evaluate if the Cell SPEs could benefit significantly from a scalar processing unit using two methodologies. In the first methodology the scalar processing overhead is eliminated by replacing all scalar data types by the quadword data type. This methodology is feasible only for relatively small kernels. In the second methodology SPE performance is compared to the performance of a similarly configured PPU, which supports scalar operations. Experimental results show that the scalar processing overhead ranges from 19% to 57% for small kernels and from 12% to 39% for large kernels. Solutions to eliminate this overhead are also discussed.
Lowness for Demuth Randomness
Authors: Rod Downey, Keng Meng Ng
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

We show that every real low for Demuth randomness is of hyperimmune-free degree.
XPath+: A Tool for Linked XML Documents Navigation
Authors: Paulo Caetano Da Silva, Valéria Cesário Times
Venue: Proceedings of the 6th International XML Database Symposium on Database and XML Technologies (2009)

Links are basic elements in the World Wide Web. The use of links in XML documents goes further than in the WWW, since XML links express the semantics of a relationship. XLink has been proposed by the W3C as a standard for representing links in XML. However, most of the current query languages found in literature, like XPath, do not support navigation over XML links, making its adoption difficult by software developers. In this paper, an extension for the XPath query language is proposed, namely XPath+, which provides a means of navigating through both internal and external links. Particularly, both the syntax and semantics of XPath+ are given, along with some results derived from the implementation of our work.
Proceedings of the eighth international conference on Generative programming and component engineering
Venue: Generative Programming And Component Engineering (2009)

Welcome to the Eighth International Conference on Generative Programming and Compo-nent Engineering (GPCE'09). GPCE provides a venue for researchers and practitioners interested in foundational techniques for enhancing the productivity, quality, and time-to-market in software development that stems from deploying standard components and automating program generation. This year, GPCE is co-located with MODELS, the premier conference on model-driven engineering, and with SLE, the conference on software language engineering. This combination provides the attendees of all three conferences with a comprehensive overview of current research at the intersection of programming and modeling languages and software engineering. This volume contains the papers presented at the conference as well as the abstracts of the keynote presentations. GPCE'09 attracted 62 submissions with authors from 26 different countries. Each submission was reviewed by at least three members of the program committee. The submissions were discussed intensively during a week-long electronic program committee meeting. As a result of this meeting, 18 research papers and one tool demonstration were selected for presentation at the conference. The conference program also includes two keynote presentations, one by Rishiyur S. Nikhil and another by James R. Cordy, which will be held jointly with SLE.
Invariant Checking for Programs with Procedure Calls
Authors: Guillem Godoy, Ashish Tiwari
Venue: Proceedings of the 16th International Symposium on Static Analysis (2009)

Invariants are a crucial component of the overall correctness of programs. We explore the theoretical limits for doing automatic invariant checking and show that invariant checking is decidable for a large class of programs that includes some recursive programs. The proof uses known results like the decidability of Presburger arithmetic and the semilinearity of the Parikh image of a regular language. Removing some of the restrictions on the program model leads to undecidability of the invariant checking problem.
Movie table: tangible interaction with movies
Authors: David Raposo, Teresa Chambel
Venue: Proceedings of the 13th International MindTrek Conference: Everyday Life in the Ubiquitous Era (2009)

Video is nowadays largely used and becoming more and more pervasive in everyday life. With the propagation of digital cameras, high bandwidth Internet connections and video sharing websites, it is very easy to access digital video in private and public scenarios, but not always in the most convenient or natural way. People have developed sophisticated skills for sensing and manipulating their physical environments and objects, most of which are not employed in interaction with the digital world today [2]. Tangible User Interfaces are built upon those skills by giving physical forms to digital information. They use physical spaces, surfaces and objects either to control and represent digital information, through individual and collaborative interfaces, allowing computer mediated interactions in physical locations and social contexts where a traditional computer may be difficult or unnatural to use. The adoption and development of tangible media is complemented by the vision of Ambient Intelligence, foreseeing that technology will seamlessly merge into people's everyday activities and environments [6]. As such, designers are faced with the challenge to create a seamless extension of the physical affordance of the objects into digital domain and build natural and intuitive interfaces that fit these new usage contexts.
Simulating and Detecting Radiation-Induced Errors for Onboard Machine Learning
Authors: Robert Granat, Kiri L. Wagstaff, Benjamin Bornstein, Benyang Tang, Michael Turmon
Venue: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology (2009)

Spacecraft processors and memory are subjected to high radiation doses and therefore employ radiation-hardened components. However, these components are orders of magnitude more expensive than typical desktop components, and they lag years behind in terms of speed and size. We have integrated algorithm-based fault tolerance (ABFT) methods into onboard data analysis algorithms to detect radiation-induced errors, which ultimately may permit the use of spacecraft memory that need not be fully hardened, reducing cost and increasing capability at the same time. We have also developed a lightweight software radiation simulator, BITFLIPS, that permits evaluation of error detection strategies in a controlled fashion, including the specification of the radiation rate and selective exposure of individual data structures. Using BITFLIPS, we evaluated our error detection methods when using a support vector machine to analyze data collected by the Mars Odyssey spacecraft. We observed good performance from both an existing ABFT method for matrix multiplication and a novel ABFT method for exponentiation. These techniques bring us a step closer to "rad-hard" machine learning algorithms.
Multimodal Labeling
Authors: Leon Rothkrantz, Pascal Wiggers
Venue: Proceedings of the 12th International Conference on Text, Speech and Dialogue (2009)

This paper is about automated labeling of emotions. Prototypes have been developed for extraction of features from facial expressions and speech. To train such systems data is needed. In this paper we report about the recordings of semi-spontaneous emotions. Multimodal emotional reactions are evoked in 21 controlled contexts. The purpose of this database is to make it a benchmark for the current and future emotion recognition studies in order to compare the results from different research groups. Validation of the recorded data is done online. Over 60 users scored the apex images (1.272 ratings), audio clips (201 ratings) and video clips (503 ratings) on the valence and arousal scale. Textual validation is done based on Whissell's Dictionary of Affect in Language. A comparison is made between the scores of all four validation methods and the results showed some clusters for distinct emotions.
A Teletraffic Perspective on Relay-Node Selection Strategy in VoP2P System
Authors: Wen Kang Jia, Yaw-Chung Chen
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

This paper gives a theoretical approach to modeling and simulating the Grade of Service (GoS) of Voice over Peer-to-Peer Session Initiation Protocol system which is created based on various teletraffic parameters. VoP2P features a particular service characteristic due to its different GoS models originated from circuit switched telephone networks. Especially, most voice session in VoP2P is indirectly connected because peer-nodes usually locate behind NATs. This situation forces peer-node to select one or more relay-node for establishing sessions. However, the relay-node is a constrained resource because every relay-node can only support very limited relay services in VoP2P network. There are two strategies, the S2RS (Staged Single-Relay Strategy) and MRS (Multi-Relay Strategy), to solve the relay-node issue. We adopt three new parameters in VoP2P call-loss models, the first is callee-attendance rate, which is due to the characteristic of destination peer-nodes with a lower attendance probability; the second is call-blocking rate, which is a traditional definition just because the relay-node reaches the limitation of resource; the third is handoff-dropping rate (aka handoff-loss rate), which is caused by the relay-node being removed frequently. The simulation results provide useful reference in the study of teletraffic of VoP2P system.
On the Cubicity of AT-Free Graphs and Circular-Arc Graphs
Authors: L. Sunil Chandran, Mathew C. Francis, Naveen Sivadasan
Venue: Graph Theory, Computational Intelligence and Thought: Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday (2009)

A unit cube in k dimensions (k-cube) is defined as the Cartesian product R 1×R 2× ¿ ×R k where R i (for 1 ≤ i ≤ k) is a closed interval of the form [a i ,a i + 1] on the real line. A graph G on n nodes is said to be representable as the intersection of k-cubes (cube representation in k dimensions) if each vertex of G can be mapped to a k-cube such that two vertices are adjacent in G if and only if their corresponding k-cubes have a non-empty intersection. The cubicity of G denoted as cub(G) is the minimum k for which G can be represented as the intersection of k-cubes.An interesting aspect about cubicity is that many problems known to be NP-complete for general graphs have polynomial time deterministic algorithms or have good approximation ratios in graphs of low cubicity. In most of these algorithms, computing a low dimensional cube representation of the given graph is usually the first step.We give an O(bw·n) algorithm to compute the cube representation of a general graph G in bw + 1 dimensions given a bandwidth ordering of the vertices of G, where bw is the bandwidth of G. As a consequence, we get O(Δ) upper bounds on the cubicity of many well-known graph classes such as AT-free graphs, circular-arc graphs and cocomparability graphs which have O(Δ) bandwidth. Thus we have: 1 cub(G) ≤ 3Δ¿ 1, if G is an AT-free graph. 1 cub(G) ≤ 2Δ + 1, if G is a circular-arc graph. 1 cub(G) ≤ 2Δ, if G is a cocomparability graph. Also for these graph classes, there are constant factor approximation algorithms for bandwidth computation that generate orderings of vertices with O(Δ) width. We can thus generate the cube representation of such graphs in O(Δ) dimensions in polynomial time.
Towards an understanding of the consumer acceptance of mobile wallet
Authors: Dong-Hee Shin
Venue: Computers in Human Behavior (2009)

This study seeks to validate a comprehensive model of consumer acceptance in the context of mobile payment. It uses the unified theory of acceptance and use of technology (UTAUT) model with constructs of security, trust, social influence, and self-efficacy. Structural equation modeling is used to construct a predictive model of attitudes toward the mobile wallet. Individuals' responses to questions about attitude and intention to adopt/use a mobile wallet were collected and analyzed with various factors modified from UTAUT. While the model confirms the classical role of technology acceptance factors (i.e., perceived usefulness and ease of use are key antecedents to users' attitude), the results also show that users' attitudes and intentions are influenced by perceived security and trust. In the extended model, the moderating effects of demographics on the relations among the variables were found to be significant. The proposed model brings together extant research on mobile payment and provides an important cluster of antecedents to eventual technology acceptance via constructs of behavioral intention to use and actual system usage.
A lexically-driven algorithm for disfluency detection
Authors: Matthew Snover, Bonnie Dorr, Richard Schwartz
Venue: Proceedings of HLT-NAACL 2004: Short Papers on XX (2004)

This paper describes a transformation-based learning approach to disfluency detection in speech transcripts using primarily lexical features. Our method produces comparable results to two other systems that make heavy use of prosodic features, thus demonstrating that reasonable performance can be achieved without extensive prosodic cues. In addition, we show that it is possible to facilitate the identification of less frequently disfluent discourse markers by taking speaker style into account.
Security Vulnerabilities of a Remote User Authentication Scheme Using Smart Cards Suited for a Multi-server Environment
Authors: Youngsook Lee, Dongho Won
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

Recently, Liu et al. have proposed an efficient scheme for a remote user authentication using smart cards suited for a multi-server environment. This work reviews Liu et al,'s scheme and provides a security analysis on the scheme. Our analysis shows that Liu et al.'s scheme does not achieve its fundamental goal not only of mutual authentication bur also of password security. We demonstrate these by mounting a user impersonation attack and an off-line password guessing attack, respectively, on Liu et al.'s scheme.
Bionic Self-learning of Two-wheeled Robot Based on Skinner's Operant Conditioning
Authors: Hong-ge Ren, Xiao-gang Ruan
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

Aiming at the problem about the posture balance control of two-wheeled self-balancing mobile robot, a learning algorithm that it is made up of BP neural network and eligibility traces based on the operant conditioning theory is put forward as a learning mechanism of the two-wheeled robot. The algorithm utilizes the characters of eligibility traces about quicker learning speed, higher reliability, ability in resolving effect about delay, and combines with BP neural network, so that the two-wheeled robot can obtain the movement balance skills of controlling like a human or animal by interacting, studying and training with unknown environmental, and realize the posture balance control of the two-wheeled robot. Finally, some simulation experiments have been done in the undisturbed and disturbed environment respectively. The simulation results show that a learning mechanism of the complex learning algorithm consisted by BP neural network and eligibility traces based on Skinner’s operant conditioning theory can realize the posture balance control to the two-wheeled robot, and reveal the better dynamic character and robustness. And it also has the higher research significance in theory and the application value in project.
Cycle-minors and subdivisions of wheels
Authors: Galen E. Turner,  III
Venue: Journal of Graph Theory (2009)

In this paper we prove two results. The first is an extension of a result of Dirac which says that any set of n vertices of an n-connected graph lies in a cycle. We prove that if V&prime; is a set of at most 2n vertices in an n-connected graph G, then G has, as a minor, a cycle using all of the vertices of V&prime;. The second result says that if G is an n+1-connected graph with maximum vertex degree &Delta; then G contains a subgraph that is a subdivision of W2n if and only if &Delta;&ge;2n. &copy; 2009 Wiley Periodicals, Inc. J Graph Theory 62: 100&ndash;108, 2009
Manifold-Based Combination of Visual Features and Keyword Features for Image Retrieval
Authors: Jing Li, Fuqiang Liu, Zhipeng Li, Jianzhu Cui
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

To bridge the semantic gap between low-level visual features and high-level semantic concepts, this paper puts forward a novel semi-supervised learning framework of combining visual and keyword features. We assume all of images in the database have been annotated. In this framework, the visual space graph (VSG) and keyword space graph (KSG) are first constructed by means of manifold-based algorithm to explore the submanifold of Visual space and keyword space. Then, semantic space graph (SSG) is constructed by using neighbor information of KSG and VSF. Afterwards, the VSG and KSG are modified and unified by propagating semantic matrix. Finally, we propose a flexible ranking formula and introduce different relevance feedback methods of different query styles. Experimental results on COREL 5000 images show our method improves image retrieval performance from all aspects.
Research on Network Security Situation Awareness Technology Based on Artificial Immunity System
Authors: Liu Nian, Wang Diangang, Huang Xuemei, Liu Sunjun, Zhao Kui
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

With the applying of artificial immune technology in the field of network security situation awareness, this article puts forward a new immune network security situation awareness model to enable self-learning and self-adapting of network system, and increase its immunity and viability. When network is under attack, it can find out the current network security situation and future trend in an all-around way, provide grounds for reasonable and accurate response to guarantee the usability of system.
Distributed language models
Authors: Thorsten Brants, Peng Xu
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Tutorial Abstracts (2009)

Language models are used in a wide variety of natural language applications, including machine translation, speech recognition, spelling correction, optical character recognition, etc. Recent studies have shown that more data is better data, and bigger language models are better language models: the authors found nearly constant machine translation improvements with each doubling of the training data size even at 2 trillion tokens (resulting in 400 billion n-grams). Training and using such large models is a challenge. This tutorial shows efficient methods for distributed training of large language models based on the MapReduce computing model. We also show efficient ways of using distributed models in which requesting individual n-grams is expensive because they require communication between different machines.
Reasoning within fuzzy description logics
Authors: Umberto Straccia
Venue: Journal of Artificial Intelligence Research (2001)

Description Logics (DLs) are suitable, well-known, logics for managing structured knowledge. They allow reasoning about individuals and well defined concepts, i.e. set of individuals with common properties. The experience in using DLs in applications has shown that in many cases we would like to extend their capabilities. In particular, their use in the context of Multimedia Information Retrieval (MIR) leads to the convincement that such DLs should allow the treatment of the inherent imprecision in multimedia object content representation and retrieval. In this paper we will present a fuzzy extension of ALC, combining Zadeh's fuzzy logic with a classical DL. In particular, concepts becomes fuzzy and, thus, reasoning about imprecise concepts is supported. We will define its syntax, its semantics, describe its properties and present a constraint propagation calculus for reasoning in it.
Managing architectural decision models with dependency relations, integrity constraints, and production rules
Authors: Olaf Zimmermann, Jana Koehler, Frank Leymann, Ronny Polley, Nelly Schuster
Venue: Journal of Systems and Software (2009)

Software architects consider capturing and sharing architectural decisions increasingly important; many tacit dependencies exist in this architectural knowledge. Architectural decision modeling makes these dependencies explicit and serves as a foundation for knowledge management tools. In practice, however, text templates and informal rich pictures rather than models are used to capture the knowledge; a formal definition of model entities and their relations is missing in the current state of the art. In this paper, we propose such a formal definition of architectural decision models as directed acyclic graphs with several types of nodes and edges. In our models, architectural decision topic groups, issues, alternatives, and outcomes form trees of nodes connected by edges expressing containment and refinement, decomposition, and triggers dependencies, as well as logical relations such as (in)compatibility of alternatives. The formalization can be used to verify integrity constraints and to organize the decision making process; production rules and dependency patterns can be defined. A reusable architectural decision model supporting service-oriented architecture design demonstrates how we use these concepts. We also present tool support and give a quantitative evaluation.
The Evaluation of Operating Posture in Typing the QWERTY Keyboard on PDA
Authors: Han-Chi Hsiao, Fong-Gong Wu, Ronald Hsi, Chih-I Ho, Wen-Zhou Shi, Chien-Hsu Chen
Venue: Proceedings of the International Conference on Ergonomics and Health Aspects of Work with Computers: Held as Part of HCI International 2009 (2009)

In this research, we observed the user's posture while using PDA. 30 participants typed the keys with standard QWERTY keyboard on the PDA. At the end of the experiments the participants who have professional background in design were asked to complete an open-ended questionnaire, which is in order to evaluate the usability of the PDA. In the final, we presented the suggestion of design criterion for keyboard, as to provide the references for future PDA design. The statistical result of the posture while using the PDA revealed that the most users held PDA with both hands and pressed keys with both thumbs. The findings in this research suggest that when we design small input devices such as PDA in the future, the stability of the keyboard usage should be taken into considerations to enhance its input performance and improve user experience.