ppxscal/embedding_network huggingface dataset:
Performance evaluation of density-based clustering methods
Authors: Ramiz M. Aliguliyev
Venue: Information Sciences: an International Journal (2009)

With the development of the World Wide Web, document clustering is receiving more and more attention as an important and fundamental technique for unsupervised document organization, automatic topic extraction, and fast information retrieval or filtering. A good document clustering approach can assist computers in organizing the document corpus automatically into a meaningful cluster hierarchy for efficient browsing and navigation, which is very valuable for complementing the deficiencies of traditional information retrieval technologies. In this paper, we study the performance of different density-based criterion functions, which can be classified as internal, external or hybrid, in the context of partitional clustering of document datasets. In our study, a weight was assigned to each document, which defined its relative position in the entire collection. To show the efficiency of the proposed approach, the weighted methods were compared to their unweighted variants. To verify the robustness of the proposed approach, experiments were conducted on datasets with a wide variety of numbers of clusters, documents and terms. To evaluate the criterion functions, we used the WebKb, Reuters-21578, 20Newsgroups-18828, WebACE and TREC-5 datasets, as they are currently the most widely used benchmarks in document clustering research. To evaluate the quality of a clustering solution, a wide spectrum of indices, three internal validity indices and seven external validity indices, were used. The internal validity indices were used for evaluating the within-cluster scatter and between cluster separations. The external validity indices were used for comparing the clustering solutions produced by the proposed criterion functions with the ''ground truth'' results. Experiments showed that our approach significantly improves clustering quality. In this paper, we developed a modified differential evolution (DE) algorithm to optimize the criterion functions. This modification accelerates the convergence of DE and, unlike the basic DE algorithm, guarantees that the received solution will be feasible.
SOM-PORTRAIT: Identifying Non-coding RNAs Using Self-Organizing Maps
Authors: Tulio C. Silva, Pedro A. Berger, Roberto T. Arrial, Roberto C. Togawa, Marcelo M. Brigido, Maria Emilia Walter
Venue: Proceedings of the 4th Brazilian Symposium on Bioinformatics: Advances in Bioinformatics and Computational Biology (2009)

Recent experiments have shown that some types of RNA may control gene expression and phenotype by themselves, besides their traditional role of allowing the protein synthesis. Roughly speaking, RNAs can be divided into two classes: mRNAs, that are translated into proteins, and non-coding RNAs (ncRNAs), which play several cellular important roles besides protein coding. In recent years, many computational methods based on different theories and models have been proposed to distinguish mRNAs from ncRNAs. Particularly, Self-Organizing Maps (SOM), a neural network model, is time efficient for the training step, and present a straightforward implementation that allow easily increasing of the number of classes for clustering the input data. In this work, we propose a method for identifying non-coding RNAs using Self Organizing Maps, named SOM-PORTRAIT. We implemented the method and applied it to a data set containing Assembled ESTs of the Paracoccidioides brasiliensis fungus transcriptome. The obtained results were promising, with the advantage that the time and memory requirements needed to our SOM-PORTRAIT are much less than those needed for methods based on the Support Vector Machine (SVM) paradigm, like PORTRAIT.
A screen-space formulation for 2D and 3D direct manipulation
Authors: Jason L. Reisman, Philip L. Davidson, Jefferson Y. Han
Venue: Proceedings of the 22nd annual ACM symposium on User interface software and technology (2009)

Rotate-Scale-Translate (RST) interactions have become the de facto standard when interacting with two-dimensional (2D) contexts in single-touch and multi-touch environments. Because the use of RST has thus far focused almost entirely on 2D, there are not yet standard techniques for extending these principles into three dimensions. In this paper we describe a screen-space method which fully captures the semantics of the traditional 2D RST multi-touch interaction, but also allows us to extend these same principles into three-dimensional (3D) interaction. Just like RST allows users to directly manipulate 2D contexts with two or more points, our method allows the user to directly manipulate 3D objects with three or more points. We show some novel interactions, which take perspective into account and are thus not available in orthographic environments. Furthermore, we identify key ambiguities and unexpected behaviors that arise when performing direct manipulation in 3D and offer solutions to mitigate the difficulties each presents. Finally, we show how to extend our method to meet application-specific control objectives, as well as show our method working in some example environments.
A Semantic Accessibility Assessment Environment for Design and Development for the Web
Authors: Konstantinos Votis, Rui Lopes, Dimitrios Tzovaras, Luis Carriço, Spiridon Likothanassis
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

The Web is now increasingly being accessed by many people with disabilities. Thus, the great heterogeneity of Web application technologies as well as the provided Web content requires the introduction of accessibility aspects in order to fulfill the preferences for all people with disabilities or not. For that reason accessibility support at all stages of the design and development process of Web applications should be a solution that appears in the horizon. New developed Web applications should be fully adapted to different user needs, and totally accessible regardless of the specific condition of end users. Our approach introduces an advanced semantic accessibility assessment environment which initializes semantic models representing the most of main accessibility constrains and terms which are required for the design and development of Web applications, through the use of generic and domain ontologies. The proposed assessment environment can be used for the accessibility assessment of Web applications during the design and development phase.
Contract-Based Analysis of Automotive and Avionics Applications: The SPEEDS Approach
Authors: Werner Damm
Venue: Formal Methods for Industrial Critical Systems: 13th International Workshop, FMICS 2008, L'Aquila, Italy, September 15-16, 2008, Revised Selected Papers (2009)

The Speeds project has developed a layered meta-model of heterogeneous rich components and standardized approaches for the integration of commercial industry standard modeling tools to assemble system-level design models with contract-baed interface specifications by combining models expressed in any authoring tool compliant to the integration standard, including Matlab-Simulink/Stateflow, Rhapsody, and Scade. It is currently integrating a range of analysis methods supporting interface compliance testing and dominance analysis between contracts expressed in extended automata model, subsuming timed automata. The presentation focuses on real-time analysis methods, and demonstrates a methodology for assessing realizability of end-to-end latencies at system level, exploring the design space of possible system configurations meeting vertical resource assumptions, and assessing compliance to such vertical assumptions based on distributed real-time schedulability analysis for FlexRay and CAN bus based target architectures.
The TaskTracer system
Authors: Simone Stumpf, Xinlong Bao, Anton Dragunov, Thomas G. Dietterich, Jon Herlockel, Kevin Johnsrude, Lida Li, JianQiang Shen
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 4 (2005)

Knowledge workers spend the majority of their working hours processing and manipulating information. These users face continual costs as they switch between tasks to retrieve and create information. The TaskTracer project at Oregon State University investigates the possibilities of a desktop software system that will record in detail how knowledge workers complete tasks, and intelligently leverage that information to increase efficiency and productivity. Our approach assigns each observed user interface action to a task for which it is likely being performed. In this demonstration we show how we have applied machine learning in this environment.
From Parity and Payoff Games to Linear Programming
Authors: Sven Schewe
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

This paper establishes a surprising reduction from parity and mean payoff games to linear programming problems. While such a connection is trivial for solitary games, it is surprising for two player games, because the players have opposing objectives, whose natural translations into an optimisation problem are minimisation and maximisation, respectively. Our reduction to linear programming circumvents the need for concurrent minimisation and maximisation by replacing one of them, the maximisation, by approximation. The resulting optimisation problem can be translated to a linear programme by a simple space transformation, which is inexpensive in the unit cost model, but results in an exponential growth of the coefficients. The discovered connection opens up unexpected applications --- like μ-calculus model checking --- of linear programming in the unit cost model, and thus turns the intriguing academic problem of finding a polynomial time algorithm for linear programming in this model of computation (and subsequently a strongly polynomial algorithm) into a problem of paramount practical importance: All advancements in this area can immediately be applied to accelerate solving parity and payoff games, or to improve their complexity analysis. 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
Integrated speech enhancement method using noise suppression and dereverberation
Authors: Takuya Yoshioka, Tomohiro Nakatani, Masato Miyoshi
Venue: IEEE Transactions on Audio, Speech, and Language Processing (2009)

This paper proposes a method for enhancing speech signals contaminated by room reverberation and additive stationary noise. The following conditions are assumed. 1) Short-time spectral components of speech and noise are statistically independent Gaussian random variables. 2) A room's convolutive system is modeled as an autoregressive system in each frequency band. 3) A short-time power spectral density of speech is modeled as an all-pole spectrum, while that of noise is assumed to be time-invariant and known in advance. Under these conditions, the proposed method estimates the parameters of the convolutive system and those of the all-pole speech model based on the maximum likelihood estimation method. The estimated parameters are then used to calculate the minimum mean square error estimates of the speech spectral components. The proposed method has two significant features. 1) The parameter estimation part performs noise suppression and dereverberation alternately. (2) Noise-free reverberant speech spectrum estimates, which are transferred by the noise suppression process to the dereverberation process, are represented in the form of a probability distribution. This paper reports the experimental results of 1500 trials conducted using 500 different utterances. The reverberation time RT60 was 0.6 s, and the reverberant signal to noise ratio was 20, 15, or 10 dB. The experimental results show the superiority of the proposed method over the sequential performance of the noise suppression and dereverberation processes.
Software agents: completing patterns and constructing user interfaces
Authors: Jeffrey C. Schlimmer, Leonard A. Hermens
Venue: Journal of Artificial Intelligence Research (1993)

To support the goal of allowing users to record and retrieve information, this paper describes an interactive note-taking system for pen-based computers with two distinctive features. First, it actively predicts what the user is going to write. Second, it automatically constructs a custom, button-box user interface on request. The system is an example of a learning-apprentice software-agent. A machine learning component characterizes the syntax and semantics of the user's information. A performance system uses this learned information to generate completion strings and construct a user interface.
Research and Design of Interactive Data Transformation and Migration System for Heterogeneous Data Sources
Authors: Peng Cong, Zhang Xiaoyi
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

To solve the problems of data transformation and migration in heterogeneous environment, an interactive data transformation and migration method for heterogeneous data sources is proposed. The basic theory of data transformation and migration is discussed firstly, and then the methods of data extraction, cleaning, transformation and loading in heterogeneous environment are described in detail.
Efficient learning of action schemas and web-service descriptions
Authors: Thomas J. Walsh, Michael L. Littman
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

This work addresses the problem of efficiently learning action schemas using a bounded number of samples (interactions with the environment). We consider schemas in two languages--traditional STRIPS, and a new language STRIPS+WS that extends STRIPS to allow for the creation of new objects when an action is executed. This modification allows STRIPS+WS to model web services and can be used to describe web-service composition (planning) problems. We show that general STRIPS operators cannot be efficiently learned through raw experience, though restricting the size of action preconditions yields a positive result. We then show that efficient learning is possible without this restriction if an agent has access to a "teacher" that can provide solution traces on demand. We adapt this learning algorithm to efficiently learn web-service descriptions in STRIPS+WS.
Playing to learn game design skills in a game context
Authors: James Paul Gee, Elisabeth Hayes, Robert J. Torres, Ivan Alex Games, Kurt Squire, Katie Salen
Venue: Proceedings of the 8th international conference on International conference for the learning sciences - Volume 3 (2008)

This interactive session presents early research findings resulting from a game simulation currently called Gamestar Mechanic through which 70 middle and high school-age players learn to design video games. Gamestar Mechanic is an RPG (Role-Playing Game) style online game through which players "take on" the behaviors characteristic of professional game designers (e.g., designing games, accounting for variability change within a game's system, critiquing games). Reflecting on and practicing design can lead, we believe, to skills that are crucial for success in the modern, high-tech, global world. Game design is but a start in learning to think of complex interactions among variables, people, and technology, but it is also a domain that can help others reflect on complex interactions among systems. Early findings are showing that the pedagogical design of Gamestar Mechanic has the potential to help participants develop understanding of technical concepts particular to game design, systems-thinking skills, and other behaviors associated with the domain.
An integrated framework for the development of radio frequency identification technology in the logistics and supply chain management
Authors: L. C. Lin
Venue: Computers and Industrial Engineering (2009)

Radio Frequency Identification (RFID) features high storage capacity, remote access, excellent data security, and multiple-tag reading. Hence, RFID technology attracts attention from various industries, especially the logistics and retail industries. Due to the swift development of technology and the trend of globalization, the logistics managers are assigned the task to integrate the supply chain via information technology such as RFID. The goal is to achieve information sharing and reduction of total cost, thus the operation efficiency can be improved and competitive advantage can be enhanced. Thus, this research would first identify the key factors of RFID technology development in the logistics and supply chain management. A complete set of five dimensions and 24 factors with a hierarchy structure is presented. The Fuzzy Delphi and Fuzzy Analytic Hierarchy Process methods are adopted for analysis. A structural procedure of RFID system establishment is also constructed based on the key dimensions and factors, with the expectation of establishing the RFID system in an effective and efficient manner. Then, based on the experience of Taiwanese government and industry, the sequence of companies for adopting the RFID technology is discussed. Thus, an integrated framework for the development of RFID technology, which includes the hierarchy of factors, structural procedure, and sequence of adoption, is presented in this research; and it can be applied in other scenarios after the users make some modifications according to their specific needs.
A Holonic Chain Conveyor Control System: An Application
Authors: Jan Belle, Bart Saint Germain, Paul Verstraete, Paul Valckenaers, Osman Ali, Hendrik Brussel, Dirk Cattrysse
Venue: Proceedings of the 4th International Conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing (2009)

The control of the flow of goods through an extensive chain conveyor system is a complex task. The currently used control system (based on dispatching rules) is robust but does not take advantage of all opportunities. An alternative approach makes use of a planning algorithm to determine the routing decisions. This requires however an ad hoc algorithm and regular maintenance. The paper examines how the concepts and principles of Holonic Manufacturing Execution Systems can be used to control the product flow. This holonic multi-agent approach makes the control system adaptive and reactive and requires less maintenance. To illustrate how disturbances are handled, the holonic approach is applied to a cross-dock distribution center equipped with chain conveyors.
Drivers' quality ratings for switches in cars: assessing the role of the vision, hearing and touch senses
Authors: Gary Burnett, Ainojie Irune
Venue: Proceedings of the 1st International Conference on Automotive User Interfaces and Interactive Vehicular Applications (2009)

Sensory integration is critical to the perception of quality in automobile interior design. To investigate the relative contribution of the senses of vision, touch and hearing to the perception of quality for in-car switches, 30 participants rated eight switches taken from two vehicles when all senses were available and under various conditions of sensory deprivation: no hearing; no vision; no touch. Results indicated that touch had the greatest role to play in judgements of quality, enabling participants more easily to differentiate between the two vehicle designs. Furthermore, correlation and regression analyses for specific switches indicated that touch contributed up to three times as much to quality ratings compared to either the vision or hearing senses. Future research should aim to verify such findings and to establish which aspects of touch have particular influence.
Inclusion, subsumption, JJ-paths, and structured path testing: a Redress
Authors: D. F. Yates, N. Malevris
Venue: Software Testing, Verification Reliability (2009)

Introduced in 1976 by Hennell, Woodward, and Hedley, the Linear Code Sequence and Jump (LCSAJ) has since been named the jump-to-jump path (JJ-path). If all JJ-paths in a piece of code have been tested, then it is guaranteed, for example, that all of the code's branches and all of its statements will likewise have been tested. JJ-path testing is thus said to include both branch and statement testing. Over the years, much work has been carried out on the inclusion relation, and this is also true of a closely-linked relation that is known as subsumption. Not surprisingly, some of the work in the literature has focussed on the criteria of executing all JJ-paths and sequences of such, and how these criteria relate to other path coverage and test data criteria. Unfortunately, certain results involving JJ-paths in the context of inclusion, as portrayed in a widely referenced and influential paper, are in error. Consequently, the main purpose of this paper is to rectify this situation. Copyright &copy; 2008 John Wiley & Sons, Ltd.
MELB-MKB: lexical substitution system based on relatives in context
Authors: David Martinez, Su Nam Kim, Timothy Baldwin
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

In this paper we describe the MELB-MKB system, as entered in the SemEval-2007 lexical substitution task. The core of our system was the "Relatives in Context" unsupervised approach, which ranked the candidate substitutes by web-lookup of the word sequences built combining the target context and each substitute. Our system ranked third in the final evaluation, performing close to the top-ranked system.
Well-Founded and Partial Stable Semantics Logical Aspects
Authors: Pedro Cabalar, Sergei Odintsov, David Pearce
Venue: Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications (2009)

This paper is devoted to logical aspects of two closely related semantics for logic programs: the partial stable model semantics of Przymusinski [20] and the well-founded semantics of Van Gelder, Ross and Schlipf [24]. For many years the following problem remained open: Which (non-modal) logic can be regarded as yielding an adequate foundation for these semantics in the sense that its minimal models (appropriately defined) coincide with the partial stable models of a logic program? Initial work on this problem was undertaken by Cabalar [5] who proposed a frame-based semantics for a suitable logic which he called HT 2. Preliminary axiomatics of HT 2 was presented in [6]. In this paper we analyse HT 2 frames and identify them as structures of a logic N* having intuitionistic positive connectives and Routley negation and give a natural axiomatics for HT 2. We define a notion of minimal, total HT 2 model which we call partial equilibrium model. We show that for logic programs these models coincide with partial stable models, and we propose the resulting partial equilibrium logic as a logical foundation for partial stable and well-founded semantics. Finally, we discuss the strong equivalence for theories and programs in partial equilibrium logic.
Smart sensors for fast biological analysis
Authors: Massimo Lanzoni, Claudio Stagni, Bruno Riccò
Venue: Microelectronics Journal (2009)

This paper presents an updated overview of present works concerning the realization of biological sensors based on electronic devices. In particular, DNA sensors will be described and their main characteristics will be analyzed. As an example, a new sensor for DNA detection and analysis will be described in detail. The proposed approach is based on the use of non-volatile memories and does not require sample treatment nor sensor surface functionalization. Moreover, fabrication technology is widely compatible with the standard CMOS process. Experimental results show that the sensor has sufficient accuracy and sensitivity that can be further improved by suitable device engineering.