ppxscal/embedding_network huggingface dataset:
First-Order Universality for Real Programs
Authors: Thomas Anberrée
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

J. Raymundo Marcial---Romero and M. H. Escardó described a functional programming language with an abstract data type Real for the real numbers and a non-deterministic operator . We show that this language is universal at first order, as conjectured by these authors: all computable, first-order total functions on the real numbers are definable. To be precise, we show that each computable function $f\colon\mathbb{R}\to\mathbb{R}$ we consider is the extension of the denotation of some program , in a model based on powerdomains, described in previous work. Whereas this semantics is only an approximate one, in the sense that programs may have a denotation strictly below their true outputs, our result shows that, to compute a given function, it is in fact always possible to find a program with a faithful denotation. We briefly indicate how our proof extends to show that functions taken from a large class of computable, first-order partial functions in several arguments are definable.
SPASS Version 3.5
Authors: Christoph Weidenbach, Dilyana Dimova, Arnaud Fietzke, Rohit Kumar, Martin Suda, Patrick Wischnewski
Venue: Proceedings of the 22nd International Conference on Automated Deduction (2009)

SPASS is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. This system description provides an overview of our recent developments in SPASS 3.5 including subterm contextual rewriting, improved split backtracking, a significantly faster FLOTTER implementation with additional control flags, completely symmetric implementation of forward and backward redundancy criteria, faster parsing with improved support for big files, faster and extended sort module, and support for include commands in input files. Finally, SPASS 3.5 can now parse files in TPTP syntax, comes with a new converter tptp2dfg and is distributed under a BSD style license.
WCAG 2.0 Test Samples Repository
Authors: Shadi Abou-Zahra, Michael Cooper
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

The WCAG 2.0 Test Samples Repository resembles an extensive test suite for Web accessibility evaluation tools. It provides Web content that demonstrates accessible and inaccessible coding practice. It can be used to examine how Web accessibility evaluation tools detect inaccessible Web content, and to help the calibration of their performance. However, unlike test suites, Test Samples are not an exhaustive set of test cases for all situations and coding practices. They are therefore not a definitive measurement of compliance but one of the metrics for assessing such compliance. The WCAG 2.0 Test Samples are also useful for the developers of authoring tools, of user agents, or of Web content. This paper introduces the implementation of the WCAG 2.0 Test Samples Repository.
An Application for Active Elderly Follow-Up Based on DVB-T Platforms
Authors: Maria Jesus Falagan, Juan Luis Villalar, Maria Teresa Arredondo
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)

This paper describes the T-CUIDA project, an ongoing collaborative initiative, partially funded by the Spanish Government, which aims at designing and developing an application for promoting active elderly in their habitual environments. The platform takes advantage of the DVB-T infrastructure, the European digital TV broadcasting system, recently deployed in Spain. Design for All principles are applied in a multimodal and personalized approach to provide a complementary set of services that help aged people to keep themselves physically and mentally dynamic. The final system is about to be conveniently evaluated during six months by more than a hundred of potential users in four different locations around the country.
A Texture Based Shoe Retrieval System for Shoe Marks of Real Crime Scenes
Authors: Francesca Dardi, Federico Cervelli, Sergio Carrato
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

Shoeprints found on the crime scene contain useful information for the investigator: being able to identify the make and model of the shoe that left the mark on the crime scene is important for the culprit identification. Semi-automatic and automatic systems have already been proposed in the literature to face the problem, however all previous works have dealt with synthetic cases, i.e. shoe marks which have not been taken from a real crime scene but are artificially generated with different noise adding techniques.Here we propose a descriptor based on the Mahalanobis distance for the retrieval of shoeprint images. The performance test of the proposed descriptor is performed on real crime scenes shoe marks and the results are promising.
Design of the Test Stimuli for the Evaluation of Concatenation Cost Functions
Authors: Milan Legát, Jindřich Matoušek
Venue: Proceedings of the 12th International Conference on Text, Speech and Dialogue (2009)

A large number of methods for measuring of audible discontinuities, which occur at concatenation points in synthesized speech, have been proposed in recent years. However, none of them proved to be comparatively better than others across all languages and recording conditions and the presented results have sometimes even been in contradiction. What is more, none of the tested concatenation cost functions seem to be reliably reflecting the human perception of such discontinuities. Thus, the design of the concatenation cost functions is still an open issue, and there is a lot of work remaining to be done. In this paper, we deal with the problem of preparing the test stimuli for evaluating the performance of these functions, which is, in our opinion, one of the key aspects in this field.
Bipartite Graph Matching Computation on GPU
Authors: Cristina Nader Vasconcelos, Bodo Rosenhahn
Venue: Proceedings of the 7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition (2009)

The Bipartite Graph Matching Problem is a well studied topic in Graph Theory. Such matching relates pairs of nodes from two distinct sets by selecting a subset of the graph edges connecting them. Each edge selected has no common node as its end points to any other edge within the subset. When the considered graph has huge sets of nodes and edges the sequential approaches are impractical, specially for applications demanding fast results. In this paper we investigate how to compute such matching on Graphics Processing Units (GPUs) motivated by its increasing processing power made available with decreasing costs. We present a new data-parallel approach for computing bipartite graph matching that is efficiently computed on today's graphics hardware and apply it to solve the correspondence between 3D samples taken over a time interval.
The Analysis of Customer Data Mining Based on System Dynamics
Authors: Yan Dan
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

System Dynamics is not only tool of simulation, but also method of data mining. With the model of System Dynamics, the hidden knowledge is revealed, and future state is forecasted, which are both data mining. The paper analyzes the process of mining data with the example of customer in market. It expatiates that the change of customer in different conditions is predicted, to mining the customer knowledge with simulation. It is new idea for System Dynamics to mining data.
Some characterizations for SOC-monotone and SOC-convex functions
Authors: Jein-Shan Chen, Xin Chen, Shaohua Pan, Jiawei Zhang
Venue: Journal of Global Optimization (2009)

We provide some characterizations for SOC-monotone and SOC-convex functions by using differential analysis. From these characterizations, we particularly obtain that a continuously differentiable function defined in an open interval is SOC-monotone (SOC-convex) of order n ¿ 3 if and only if it is 2-matrix monotone (matrix convex), and furthermore, such a function is also SOC-monotone (SOC-convex) of order n ¿ 2 if it is 2-matrix monotone (matrix convex). In addition, we also prove that Conjecture 4.2 proposed in Chen (Optimization 55:363---385, 2006) does not hold in general. Some examples are included to illustrate that these characterizations open convenient ways to verify the SOC-monotonicity and the SOC-convexity of a continuously differentiable function defined on an open interval, which are often involved in the solution methods of the convex second-order cone optimization.
DD-PREF: a language for expressing preferences over sets
Authors: Marie DesJardins, Kiri L. Wagstaff
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

In many application domains, it is useful to be able to represent and reason about a user's preferences over sets of objects. We present a representation language, DD-PREF (for Diversity and Depth PREFerences), for specifying the desired diversity and depth of sets of objects where each object is represented as a vector of feature values. A strong diversity preference for a particular feature indicates that the user would like the set to include objects whose values are evenly dispersed across the range of possible values for that feature. A strong depth preference for a feature indicates that the user is interested in specific target values or ranges. Diversity and depth are complementary, but are not necessarily opposites. We define an objective function that, when maximized, identifies the subset of objects that best satisfies a statement of preferences in DD-PREF. Exhaustively searching the space of all possible subsets is intractable for large problem spaces; therefore, we also present an efficient greedy algorithm for generating preferred object subsets. We demonstrate the expressive power of DD-PREF and the performance of our greedy algorithm by encoding and applying qualitatively different preferences for multiple tasks on a blocks world data set. Finally, we provide experimental results for a collection of Mars rover images, demonstrating that we can successfully capture individual preferences of different users, and use them to retrieve high-quality image subsets.
Ripples: utilizing per-contact visualizations to improve user interaction with touch displays
Authors: Daniel Wigdor, Sarah Williams, Michael Cronin, Robert Levy, Katie White, Maxim Mazeev, Hrvoje Benko
Venue: Proceedings of the 22nd annual ACM symposium on User interface software and technology (2009)

We present Ripples, a system which enables visualizations around each contact point on a touch display and, through these visualizations, provides feedback to the user about successes and errors of their touch interactions. Our visualization system is engineered to be overlaid on top of existing applications without requiring the applications to be modified in any way, and functions independently of the application's responses to user input. Ripples reduces the fundamental problem of ambiguity of feedback when an action results in an unexpected behaviour. This ambiguity can be caused by a wide variety of sources. We describe the ambiguity problem, and identify those sources. We then define a set of visual states and transitions needed to resolve this ambiguity, of use to anyone designing touch applications or systems. We then present the Ripples implementation of visualizations for those states, and the results of a user study demonstrating user preference for the system, and demonstrating its utility in reducing errors.
Methods for Quantifying Emotion-Related Gait Kinematics
Authors: Elizabeth Crane, Melissa Gross, Ed Rothman
Venue: Proceedings of the 3rd International Conference on Virtual and Mixed Reality: Held as Part of HCI International 2009 (2009)

Quantitative models of whole body expressive movement can be developed by combining methods form biomechanics, psychology, and statistics. The purpose of this paper was to use motion capture data to assess emotion-related gait kinematics of hip and shoulder sagittal plane movement to evaluate the feasibility of using functional data analysis (FDA) for developing quantitative models. Overall, FDA was an effective method for comparing gait waveforms and emotion-related kinematics were associated with emotion arousal level.
Modeling and Simulation of Complex Interdependent Systems: A Federated Agent-Based Approach
Authors: Emiliano Casalicchio, Emanuele Galli, Salvatore Tucci
Venue: Critical Information Infrastructure Security: Third International Workshop, CRITIS 2008, Rome, Italy, October13-15, 2008. Revised Papers (2009)

Critical Interdependent Infrastructures are complex interdependent systems, that if damaged or disrupted can seriously compromise the welfare of our society. This research, part of the CRESCO project, faces the problem of interdependent critical infrastructures modeling and simulation proposing an agent-based solution. The approach we put forward, named Federated ABMS, relies on discrete agent-based modeling and simulation and federated simulation. Federated ABMS provides a formalism to model compound complex systems, composed of interacting systems, as federation of interacting agents and sector specific simulation models. This paper describes the formal model as well it outlines the steps that characterize the Federated ABMS methodology, here applied to a target system, composed of a communication network and of a power grid. Moreover we conclude the paper with a thorough discussion of implementation issues.
Design and Realization of Authentication System of Information Appliance
Authors: Cai Li-min
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Authentication is one of the crucial techniques adopted in the development of information appliance(IA). The thesis introduces authentication technology of network, sets up a two-level authentication system of IA according to the features of embedded information appliance, presents a detailed description of the key technology and carries out an experiment to prove feasibility of the project. 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
Valuation uncertainty and imperfect introspection in second-price auctions
Authors: David R. M. Thompson, Kevin Leyton-Brown
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

In auction theory, agents are typically presumed to have perfect knowledge of their valuations. In practice, though, they may face barriers to this knowledge due to transaction costs or bounded rationality. Modeling and analyzing such settings has been the focus of much recent work, though a canonical model of such domains has not yet emerged. We begin by proposing a taxonomy of auction models with valuation uncertainty and showing how it categorizes previous work. We then restrict ourselves to single-good sealed-bid auctions, in which agents have (uncertain) independent private values and can introspect about their own (but not others') valuations through possibly costly and imperfect queries. We investigate second-price auctions, performing equilibrium analysis for cases with both discrete and continuous valuation distributions. We identify cases where every equilibrium involves either randomized or asymmetric introspection. We contrast the revenue properties of different equilibria, discuss steps the seller can take to improve revenue, and identify a form of revenue equivalence across mechanisms.
Make3D: depth perception from a single still image
Authors: Ashutosh Saxena, Min Sun, Andrew Y. Ng
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

Humans have an amazing ability to perceive depth from a single still image; however, it remains a challenging problem for current computer vision systems. In this paper, we will present algorithms for estimating depth from a single still image. There are numerous monocular cues--such as texture variations and gradients, defocus, color/haze, etc.--that can be used for depth perception. Taking a supervised learning approach to this problem, in which we begin by collecting a training set of single images and their corresponding ground-truth depths, we learn the mapping from image features to the depths. We then apply these ideas to create 3-d models that are visually-pleasing as well as quantitatively accurate from individual images. We also discuss applications of our depth perception algorithm in robotic navigation, in improving the performance of stereovision, and in creating large-scale 3-d models given only a small number of images.
Mobile hosts in enterprise service integration
Authors: Satish Narayana Srirama, Matthias Jarke
Venue: International Journal of Web Engineering and Technology (2009)

Mobile data services in combination with profluent web services are seemingly the path-breaking domain in current information systems research. In the Mobile Web Service (MWS) sphere, resource-constrained mobile terminals are used as both web service clients and providers (mobile hosts). Mobile hosts enable seamless integration of user-specific services into the enterprise. This paper addresses several technical aspects of the MWS provisioning domain, such as providing proper Quality of Service (QoS), especially in terms of security and reasonable scalability, and discovery aspects of the huge number of services possible with each mobile host that provides some services. The paper also discusses the features, components and realisation details of our enterprise service-bus-technology-based integration framework, which ensures QoS and discovery of MWS and helps in providing a bird's-eye view of the mobile enterprise.
Measurements of Temperature and Residual Strain during Fatigue of a CFRP Composite Using FBG Sensors
Authors: Xiaoyan Shen, Yuchi Lin
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

Fatigue behaviour is a major point for structural materials. In this paper temperature and residual strain during fatigue of a carbon fiber reinforced polymer (CFRP) are measured. CFRP beam specimens, with fiber Bragg grating (FBG) sensors and thermocouples embedded at selected locations, are subjected to three-point bending cyclic loading at 0.1Hz, 1Hz, 10Hz and 20Hz. Thermocouples are used to measure the temperature while FBGs can sense the temperature and strain as well. From the experimental results, transient steep peaks of temperature increases (up to 2.3°C) are discovered at the beginning of loading. The temperature increments due to fatigue are around 1.0°C, which are not relevant to frequencies from 0.1Hz to 20Hz. The residual strains of 10με-20με during fatigue are reported, independent of loading frequency and FBG location.
JSR-282 status report
Authors: Peter Dibble, Andy Wellings
Venue: Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems (2009)

The Real-Time Specification for Java (RTSJ) was the first Java Community Process' Java Specification Request (JSR-1). The initial version of the specification was produced in June 2000 in parallel with a Reference Implementation. Inevitably, the completion of the RI showed us bugs and inconsistency. Many of these were been removed in the 1.0.1 version of the specification that was released in August 2004, and the 1.0.2 version of the specification that was released in July 2006 (see www.rtsj.org). However, minor releases such as these are limited to issues that can be construed as bug fixes or clarifications. As commercial products have appeared and user experienced has been accrued, some enhancements to the RTSJ have been requested. These enhancement requests form the basis for the scope of JSR 282. This short paper summarizes the progress that has been made.
Testing low-degree polynomials over prime fields
Authors: Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra, David Zuckerman
Venue: Random Structures Algorithms (2009)

We present an efficient randomized algorithm to test if a given function f : &Fopf; <stack>pn</stack> &rarr; &Fopf;p (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed-Muller codes over prime fields. For a given integer t and a given real ε > 0, the algorithm queries f at O($ O({{1}\over{\epsilon}}+t.p^{{2t \over p-1}+1}) $) points to determine whether f can be described by a polynomial of degree at most t. If f is indeed a polynomial of degree at most t, our algorithm always accepts, and if f has a relative distance at least ε from every degree t polynomial, then our algorithm rejects f with probability at least $ {1\over 2} $. Our result is almost optimal since any such algorithm must query f on at least $ \Omega ( {1 \over \epsilon} + p^ {t+1 \over p-1})$ points. &copy; 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009 A preliminary version of this paper appeared in 45th Symposium on Foundations of Computer Science, 2004. Most of this work was done while the author (Patthak) was at the University of Texas at Austin. This work was done while the author (Rudra) was at the University of Texas at Austin.
High-Level Synthesis: Past, Present, and Future
Authors: Grant Martin, Gary Smith
Venue: IEEE Design Test (2009)

Editor's note:This article presents the history and evolution of HLS from research to industry adoption. The authors offer insights on why earlier attempts to gain industry adoption were not successful, why current HLS tools are finally seeing adoption, and what to expect as HLS evolves toward system-level design.&#x2014;Andres Takach, Mentor Graphics
NaXi Pictographs Input Method Based on Primitives
Authors: Hai Guo, Jingying Zhao
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

Naxi pictograph is the only still using hieroglyph all over the world, which does a positive role in the research for evolution history of human language. Through the analysis for the characteristics and information processing of Naxi pictograph, this paper proposes a transcription scheme of Naxi Pictograph input method from phonetic into primitives, and also optimizes this scheme. Based on Windows XP platform, the input method based on primitives is developed through adopting IMM-IME interface, and obtains remarkable economical efficiency and social performance.
Building a Text Classifier by a Keyword and Wikipedia Knowledge
Authors: Qiang Qiu, Yang Zhang, Junping Zhu, Wei Qu
Venue: Proceedings of the 5th International Conference on Advanced Data Mining and Applications (2009)

Traditional approach for building text classifiers usually require a lot of labeled documents, which are expensive to obtain. In this paper, we propose a new text classification approach based on a keyword and Wikipedia knowledge, so as to avoid labeling documents manually. Firstly, we retrieve a set of related documents about the keyword from Wikipedia. And then, with the help of related Wikipedia pages, more positive documents are extracted from the unlabeled documents. Finally, we train a text classifier with these positive documents and unlabeled documents. The experiment result on 20Newsgroup dataset show that the proposed approach performs very competitively compared with NB-SVM, a PU learner, and NB, a supervised learner.