ppxscal/embedding_network huggingface dataset:
Perceptual Color Correction: A Variational Perspective
Authors: Edoardo Provenzi
Venue: Computational Color Imaging: Second International Workshop, CCIW 2009, Saint-Etienne, France, March 26-27, 2009. Revised Selected Papers (2009)

Variational techniques provide a powerful tool for understanding image features and creating new efficient algorithms. In the past twenty years, this machinery has been also applied to color images. Recently, a general variational framework that incorporates the basic phenomenological characteristics of the human visual system has been built. Here we recall the structure of this framework and give noticeable examples. We then propose a new analytic expression for a parameter that regulates contrast enhancement. This formula is defined in terms of intrinsic image features, so that the parameter no longer needs to be empirically set by a user, but it is automatically determined by the image itself.
Algebra for Infinite Forests with an Application to the Temporal Logic EF
Authors: Mikołaj Bojańczyk, Tomasz Idziaszek
Venue: Proceedings of the 20th International Conference on Concurrency Theory (2009)

We define an extension of forest algebra for ¿-forests. We show how the standard algebraic notions (free object, syntactic algebra, morphisms, etc.) extend to the infinite case. To prove its usefulness, we use the framework to get an effective characterization of the ¿-forest languages that are definable in the temporal logic that uses the operator EF (exists finally).
Semi-supervised training for the averaged perceptron POS tagger
Authors: Drahomíra "johanka" Spoustová, Jan Hajič, Jan Raab, Miroslav Spousta
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

This paper describes POS tagging experiments with semi-supervised training as an extension to the (supervised) averaged perceptron algorithm, first introduced for this task by (Collins, 2002). Experiments with an iterative training on standard-sized supervised (manually annotated) dataset (106 tokens) combined with a relatively modest (in the order of 108 tokens) unsupervised (plain) data in a bagging-like fashion showed significant improvement of the POS classification task on typologically different languages, yielding better than state-of-the-art results for English and Czech (4.12 % and 4.86 % relative error reduction, respectively; absolute accuracies being 97.44 % and 95.89 %).
Designing Data Warehouses for Geographic OLAP Querying by Using MDA
Authors: Octavio Glorio, Juan Trujillo
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

Data aggregation in Geographic Information Systems (GIS) is a desirable feature, spatial data are integrated in OLAP engines for this purpose. However, the development and operation of those systems is still a complex task due to methodologies followed. There are some ad hoc solutions that deal only with isolated aspects and do not provide developer and analyst with an intuitive, integrated and standard framework for designing all relevant parts. To overcome these problems, we have defined a model driven approach to accomplish Geographic Data Warehouse (GDW) development. Then, we have defined a data model required to implement and query spatial data. Its modeling is defined and implemented by using an extension of UML metamodel and it is also formalized by using OCL language. In addition, the proposal has been verified against a example scenario with sample data sets. For this purpose, we have accomplished a developing tool based on Eclipse platform and MDA standard. The great advantage of this solution is that developers can directly include spatial data at conceptual level, while decision makers can also conceptually make geographic queries without being aware of logical details.
Using Meaning of Coefficients of the Reliability Polynomial for Their Faster Calculation
Authors: Alexey Rodionov, Olga Rodionova, Hyunseung Choo
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

We propose some new approaches to the problem of obtaining the reliability polynomial of a random graph. The meaning of coefficients of the reliability polynomial in one of its presentation is used for the significant reducing of calculations while the factoring method underlies. Experiments shows significant speeding up in compare with well known package Maple 11 (up to 2000 times on the standard lattice example).
Reusing Patterns through Design Refinement
Authors: Jason O. Hallstrom, Neelam Soundarajan
Venue: Proceedings of the 11th International Conference on Software Reuse: Formal Foundations of Reuse and Domain Engineering (2009)

Refinement concepts, such as procedural and data refinement, are among the most important ideas of software engineering. In this paper, we investigate the idea of design refinement, the process of refining a set of design patterns to arrive at application-specific design components, and ultimately, to system implementations. The approach also enables designers to refine a given pattern to arrive at more specialized versions of that pattern --sub-patterns-- thus enabling the creation of pattern hierarchies.We present three contributions: (i) We explore the concept of design refinement and consider what it means for such a refinement to be correct, in the sense of being faithful to the pattern being refined. (ii) We describe a two-part formalism for documenting patterns and sub-patterns. A pattern contract captures the requirements and behavioral guarantees associated with a given pattern, while a subcontract captures the ways in which the pattern is specialized for use in a particular application or sub-pattern. Contracts and subcontracts serve as the basis for validating the correctness of a given refinement. (iii) We consider how related patterns may be organized into suitable hierarchies based on the notion of design refinement. We focus on variations of the standard Observer pattern as examples. A key feature of our formalism is that while it enables us to specify patterns and sub-patterns precisely, it allows us to do so without compromising their flexibility.
Daisie: Information State Dialogues for Situated Systems
Authors: Robert J. Ross, John Bateman
Venue: Proceedings of the 12th International Conference on Text, Speech and Dialogue (2009)

In this paper, we report on an information-state update (ISU) based dialogue management framework developed specifically for the class of situated systems. Advantages and limitations of the underlying ISU methodology and its supporting tools are first discussed, followed by an overview of the situated dialogue framework. Notable features of the new framework include its ISU basis, an assumption of agency in domain applications, a tightly-coupled, plugin-based integration mechanism, and a function-based contextualization process. In addition to reporting on these features, we also compare the framework to existing works both inside and outside of the situated dialogue domain.
Relevance Feedback in Image Retrieval Based on RSVM
Authors: Ya-Li Qi
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Support vector machines（SVM） are favored for relevance feedback in content-based image retrieval by utilizing both positive and negative feedbacks. This paper uses Incremental Reduced Support Vector Machines to get the support vectors and the non-support vectors, then utilizes both positive and negative feedbacks for image retrieval based on SVM. It needn’t use the results of retrieval to train SVM again as traditional method. Experimental results show that the model has good effectiveness.
A Practical Comparison of Motion Planning Techniques for Robotic Legs in Environments with Obstacles
Authors: Tristan B. Smith, Daniel Chavez-Clemente
Venue: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology (2009)

ATHLETE is a large six-legged tele-operated robot. Each foot is a wheel; travel can be achieved by walking, rolling, or some combination of the two. Operators control ATHLETE by selecting parameterized commands from a command dictionary. While rolling can be done efficiently, any motion involving steps is cumbersome - each step can require multiple commands and take many minutes to complete. In this paper, we consider four different algorithms that generate a sequence of commands to take a step. We consider a baseline heuristic, a randomized motion planning algorithm, and two variants of A* search. Results for a variety of terrains are presented, and we discuss the quantitative and qualitative tradeoffs between the approaches.
Benefit and Evaluation of Interactive 3D Process Data Visualization for the Presentation of Complex Problems
Authors: Dorothea Pantförder, Birgit Vogel-Heuser, Karin Schweizer
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

The increasing complexity of industrial plants and more intelligent equipment technology lead to a growing amount of process data. The approach of interactive 3D process data visualization and associated training concepts for processes without a process model can assists operators to analyze complex processes. This paper describes a set of experiments that analyzed the benefits of a 3D data presentation as part of an HMI in combination with different types of operator training in process control.
Usability and User Acceptance for Personal Health Records: A Perspective from Healthcare Citizens
Authors: A. Ant Ozok, Ayse P. Gurses, Huijuan Wu, Melissa Nelson, David Moen, June Wei
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

Personal Health Records (PHR) allow patients to carry their own health records in some format for their own review purposes as well as across doctors and other care providers. This study aimed at determining the usability and user acceptance issues involving a Web-based personal health record system. The study indicated that such a Web-based system was found useful by the patients and they would be willing to enter and retrieve information regarding their own health from the system. A usable interface allows mobility and ease of information sharing using the system.
Space as a Resource in Creative Design Practices
Authors: Dhaval Vyas, Gerrit Veer, Dirk Heylen, Anton Nijholt
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

Based on longitudinal ethnographic fieldwork in two industrial design departments and two design companies, we explore the role of spatial arrangements for supporting creative design practices within different design studios. From our results, we show that designers explicitly make use of the physical space for 1) communicating and inspiring design ideas, 2) exploring design solutions and 3) managing design projects. We believe that these design practices could bring insightful implications for developing ubiquitous technologies to support the design profession.
Gestural Abstraction and Restatement: From Iconicity to Metaphor
Authors: Nicla Rossini
Venue: Cross-Modal Analysis of Speech, Gestures, Gaze and Facial Expressions: COST Action 2102 International Conference Prague, Czech Republic, October 15-18, 2008 Revised Selected and Invited Papers (2009)

The question of abstraction and metaphor in gesture is particularly controversial. Some scholars such as David McNeill, who first introduced this concept for gestures in a systematic way, think that gesture can convey abstract meaning and metaphoric thought, while others believe that gestures can only be considered to be iconic representations. This question will be addressed here by means of an analysis of cases of "on-line" abstraction in the gestural production concurrent with restatements of path descriptions.
On the prepositions which introduce an adjunct of duration
Authors: Frank Van Eynde
Venue: Proceedings of the Third ACL-SIGSEM Workshop on Prepositions (2006)

This paper deals with the prepositions which introduce an adjunct of duration, such as the English for and in. On the basis of both crosslingual and monolingual evidence these adjuncts are argued to be ambiguous between a floating and an anchored interpretation. To capture the distinction in formal terms I employ the framework of Head-driven Phrase Structure Grammar, enriched with a number of devices which are familiar from Discourse Representation Theory. The resulting analysis is demonstrated to be relevant for machine translation, natural language generation and natural language understanding.
Laguerre polynomials as Jensen polynomials of Laguerre-Pólya entire functions
Authors: Dimitar K. Dimitrov, Youssèf Ben Cheikh
Venue: Journal of Computational and Applied Mathematics (2009)

We prove that the only Jensen polynomials associated with an entire function in the Laguerre-Polya class that are orthogonal are the Laguerre polynomials.
A New Discussion for the Strategy of Information Systems Development Based on the CAS Theory
Authors: Liu Chuling, Xie Zanfu, Chen Chaotian
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

A new exploration strategy for information system based on the Complex Adaptive System (CAS) Theory is proposed in this paper, and the modularized exploitation method is taken as an example. The steps of the modularization exploration for information system have been summarized through the instruction of the CAS theory, and the improvement of the efficiency in the modularization exploration for the information system is discussed. Specifically for the deficiency that exists in the traditional method of modularization exploitation.
Simulation of Market Mechanism in Promoting Demand Side Management by Open-agents Model
Authors: Kehu Zhang, Zhaojun Ji, Xiandong Tan
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

Demand side management (DSM) plays an important role in energy efficiency. How to simulate DSM with market mechanism is important for policy maker and is also a complex issue. The paper studies the impacts of establishing DSM market mechanism with DSM charge in China by an open-agents model. It consists of a government agent, 15 sectoral agents and human experts, open to human experts. The government agent sets forth the strategy for raising electric power price within the scope prescribed by Consumer Price Index (CPI). The industrial sector agent sets forth strategy for maintaining profits after the rise in its costs. The human experts will intervene in all the agents when necessary. The analysis results show that DSM charge by 1% in electricity tariff bill in 2002 would make CPI rise by 0.069, save energy 72.2TWh, save coal used in thermal power plants around 27.65Mtce. The energy intensity would be fallen by 1.67%, and around 70Mt CO2 and other pollutant emissions would be avoided.
A concept lattice based outlier mining method in low-dimensional subspaces
Authors: Jifu Zhang, Yiyong Jiang, Kai H. Chang, Sulan Zhang, Jianghui Cai, Lihua Hu
Venue: Pattern Recognition Letters (2009)

Traditional outlier mining methods identify outliers from a global point of view. It is usually difficult to find deviated data points in low-dimensional subspaces using these methods. The concept lattice, due to its straight-forwardness, conciseness and completeness in knowledge expression, has become an effective tool for data analysis and knowledge discovery. In this paper, a concept lattice based outlier mining algorithm (CLOM) for low-dimensional subspaces is proposed, which treats the intent of every concept lattice node as a subspace. First, sparsity and density coefficients, which measure outliers in low-dimensional subspaces, are defined and discussed. Second, the intent of a concept lattice node is regarded as a subspace, and sparsity subspaces are identified based on a predefined sparsity coefficient threshold. At this stage, whether the intent of any ancestor node of a sparsity subspace is a density subspace is identified based on a predefined density coefficient threshold. If it is a density subspace, then the objects in the extent of the node whose intent is a sparsity subspace are defined as outliers. Experimental results on a star spectral database show that CLOM is effective in mining outliers in low-dimensional subspaces. The accuracy of the results is also greatly improved.
PDSC: Clustering Object Paths from RFID Data Sets
Authors: Huifang Deng, Guosheng Lin
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Radio Frequency Identification (RFID) is playing a more and more important role in our life. How to analyze and discover knowledge from RFID data sets is an urgent and challenging research field. Each tracking object will form a path when it moves through different locations. We present a novel algorithm called PDSC (Path Division and Segments Clustering) to cluster such path data. Considering that there may be some common segments among paths although the full paths are not so similar in general and the common segments may reveal some interesting patterns, we focus on segments clustering in this paper. Firstly we develop an algorithm to divide paths into segments. Secondly a novel similarity definition and algorithm are proposed to measure the similarity of two path segments. Finally we develop a robust clustering algorithm to discover segment clusters. An experimental system is developed to visualize data in every phase. Experimental results demonstrate that PDSC correctly discovers the common path segments.
Efficient exploration and learning of whole body kinematics
Authors: Matthias Rolf, Jochen J. Steil, Michael Gienger
Venue: Proceedings of the 2009 IEEE 8th International Conference on Development and Learning (2009)

We present a neural network approach to early motor learning. The goal is to explore the needs for boot-strapping the control of hand movements in a biologically plausible learning scenario. The model is applied to the control of hand postures of the humanoid robot ASIMO by means of full upper body movements. For training, we use an efficient online scheme for recurrent reservoir networks consisting of supervised backpropagation-decorrelation output adaptation and an unsupervised intrinsic plasticity reservoir optimization. We demonstrate that the network can acquire accurate inverse models for the highly redundant ASIMO, applying bi-manual target motions and exploiting all upper body degrees of freedom. We show that very few, but highly symmetric training data is sufficient to generate excellent generalization capabilities to untrained target motions. We also succeed in reproducing real motion recorded from a human demonstrator, massively differing from the training data in range and dynamics. The demonstrated generalization capabilities provide a fundamental prerequisite for an autonomous and incremental motor learning in an developmentally plausible way. Our exploration process - though not yet fully autonomous - clearly shows that goal-directed exploration can, in contrast to “babbling” of joints angles, be done very efficiently even for many degrees of freedom and non-linear kinematic configurations as ASIMOs.
An Architecture for Automated Reasoning Systems for Genome-Wide Studies
Authors: Angelo Nuzzo, Alberto Riva, Mario Stefanelli, Riccardo Bellazzi
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

The massive amounts of data generated by high-throughput experiments makes modern biomedical research a data-intensive discipline, shifting the research methodology from a hypothesis-based approach to a hypothesis-free one. A formal procedure should be defined to properly design a study, understand the outcomes and plan improvements for each task performed during the experiments. Such formal approach needs the identification of a high-level conceptual model of the knowledge discovery process occurring in genome-wide studies: this is what existing computational tools lack. Starting from an epistemological model of the discovery process proposed for diagnostic reasoning, we describe how the design and execution of modern genome-wide studies can be modelled using the same framework. We show the general validity of the model, how it can be instantiated to model typical scenarios of genome-wide studies, and how we use it to develop tools aimed at building semi-automated reasoning systems.
Facilitating Idea Generation Using Personas
Authors: Der-Jang Yu, Wen-Chi Lin
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

Persona and scenario are important design tools for new concept development. Usually, scenario is used to generate ideas, and persona is for evaluation. This article proposes a new approach that embeds persona data in scenario-based design for idea generation. It includes a persona dataset, a facilitation process, and a working field. The persona dataset is a user profile collected in ethnographic research and categorized by subjects, motives, activities, goals and behaviors. The facilitation process helps designer create new ideas via re-matching the elements in the persona dataset. The working fields allow the freedom of implementing with different sizes of the designer team and persona dataset. This new approach provides a direct and effective way that materializes designers' internal experiences and persona data to create new ideas and scenarios.
Integration of a Methodology for Cluster-Based Retrieval in jColibri
Authors: Albert Fornells, Juan Antonio Recio-García, Belén Díaz-Agudo, Elisabet Golobardes, Eduard Fornells
Venue: Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development (2009)

One of the key issues in Case-Based Reasoning (CBR) systems is the efficient retrieval of cases when the case base is huge and/or it contains uncertainty and partial knowledge. Although many authors have focused on proposing case memory organizations for improving the retrieval performance, there is not any free open source framework which offers this kind of capabilities. This work presents a plug-in called Thunder for the jcolibri framework. Thunder provides a methodology integrated in a graphical environment for managing the case retrieval from cluster based organizations. A case study based on tackling a Textual CBR problem using Self-Organizing Maps as case memory organizing technique is successfully tested.