ppxscal/embedding_network huggingface dataset:
An Evidence Accumulation Approach to Constrained Clustering Combination
Authors: Daniel Duarte Abdala, Xiaoyi Jiang
Venue: Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition (2009)

Constrained clustering has received substantial attention recently. This framework proposes to support the clustering process by prior knowledge in terms of constraints (on data items, cluster size, etc.). In this work we introduce clustering combination into the constrained clustering framework. It is argued that even if all clusterings of an ensemble satisfy the constraints, there is still a need of carefully considering the constraints in the combination method in order to avoid a violation in the final combined clustering. We propose an evidence accumulation approach for this purpose, which is quantitatively compared with constrained algorithms and unconstrained combination methods.
Acidification of Surface Soil in Croplands in the Semiarid Middle Tibet Plateau, China
Authors: Zhonghao Zhou, Shuhan Du, Gangcai Liu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

The research of temporal variability of fertility input rates and how this variation affects soil acidity is imperative in the semiarid agricultural areas. Through the investigation of soil pH in cropland in the semiarid middle Tibet Plateau, China, in 2008 and the analogy with the spatial-temporal variation of pH of soils and their causing factors, It was shown that significant changes of soil pH in the area occurred since the Second National Soil Survey in 1980s, With average pH values decreasing from 7.70 in 1980s to 7.22 in 2008. The annual nitrogen rates were significantly different during three periods: 1985-1990, 1990-1995, and 1995-2005, where mean annual N rates increased from 7.7 kg ha-1 yr-1 to 94.01 kg ha-1 yr-1, followed by a decrease to 49.09 kg ha-1 yr-1 and then increased to 169.82 kg ha-1 yr-1. Fertilizer input rates were causing nutrient imbalances, contributing to acidification. A significant increase of fertilizer input, particularly ammonium nitrogen fertilizer, most likely caused the severe acidification in Ustic Cambisols and Dar Aquic Cambisols. We recommend that reduce annual rate of ammonium nitrogen fertilizer to avoid acidification. Efforts should be made to readjust soil nutrient inputs to reach an optimal, sustainable level.
A Method of FAM for Pedestrian Behaviour Classification
Authors: Chunfang Zhang, Hui Sun, Hongxia Zhou, Ruitai Li
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

In this paper, we present the classification of motion, and make a conclusions under specific circumstances. In order to indicate a pedestrian’s movements, a complex number notation based on centroid is proposed. And according to the different sorts of movements, a set of standard image contours are made. Different behaviour matrices based on spatio-temporal are acquired through Hidden Markov Models (HMM). A Procrustes Mean Shape Distance (PMSD)analysis method is presented in order to get the degree to which two contours are resembled. AS a final result, a learning Fuzzy Associative Memory (FAM) is proposed to infer behavior classification of a walker,and an evaluation of six kinds of gaits involving walking, side walking, jumping, crouching, uphill and downhill is given with a 62.5% recognition rate achieved. Experiment results shows the system computational cost has been effectively reduced ,the robustness of method has been validated by experiments.
Dimensions of Collaboration in Global Software Engineering Teams: Explorations of 'Collaborative Technology Fit'
Authors: Tony Clear
Venue: Proceedings of the 2009 Fourth IEEE International Conference on Global Software Engineering (2009)

Working in global software engineering teams (GSETs), presents a plethora of challenges. In addition to the global developers working directly within their teams, a number of further actors perform support roles through a set of ‘backstage’ activities which underpin the degree of “Collaborative Technology Fit” between the sites.While crucial to the success of GSETs, the work of these actors in establishing and maintaining alignment between the sites has been little researched. A novel “Theory of Collaborative Technology Fit (CTF)” incorporates these “technology-use mediation” activities in a multidimensional model and provides both a theorization and a diagnostic tool for potential use by a variety of Global Virtual Teams.Three field work studies that have utilized the model in various ways are reported in this presentation.
Transcriptional landscape estimation from tiling array data using a model of signal shift and drift
Authors: Pierre Nicolas, Aurélie Leduc, Stéphane Robin, Simon Rasmussen, Hanne Jarmer, Philippe Bessières
Venue: Bioinformatics (2009)

Motivation: High-density oligonucleotide tiling array technology holds the promise of a better description of the complexity and the dynamics of transcriptional landscapes. In organisms such as bacteria and yeasts, transcription can be measured on a genome-wide scale with a resolution >25 bp. The statistical models currently used to handle these data remain however very simple, the most popular being the piecewise constant Gaussian model with a fixed number of breakpoints. Results: This article describes a new methodology based on a hidden Markov model that embeds the segmentation of a continuous-valued signal in a probabilistic setting. For a computationally affordable cost, this framework (i) alleviates the difficulty of choosing a fixed number of breakpoints, and (ii) permits retrieving more information than a unique segmentation by giving access to the whole probability distribution of the transcription profile. Importantly, the model is also enriched and accounts for subtle effects such as signal ‘drift’ and covariates. Relevance of this framework is demonstrated on a Bacillus subtilis dataset. Availability: A software is distributed under the GPL. Contact: pierre.nicolas@jouy.inra.fr Supplementary information: Supplementary data is available at Bioinformatics online.
Design for China Migrant Workers: A Case of User Research and Mobile Product Concepts Development
Authors: Xin Liu, Jikun Liu, Jun Cai, Ying Liu, Xia Wang
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

The mobile user experience in China is far from optimal. The language styles, interactive modes and interfaces for most of the mobile communication products in Chinese marketplaces are just copies of those developed for Western users, which are difficult and not suitable for Asian people's thinking habits and usage customs. This especially applies to the needs of the poorly educated and users who are challenged by digital products. They are almost totally ignored by the mainstream of mobile product makers, even though a huge consumptive potential exists in those segments of consumers in the future years. This joint project of Tsinghua and Nokia, targeting the market segment of Chinese migrant workers, concentrates on user research and conceptual design for proper mobile communication products or service systems, with hopes to contribute to the corporate future design strategies and market development plans.
An analysis of procedure learning by instruction
Authors: Jim Blythe
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

Many useful planning tasks are handled by plan execution tools, such as PRS, that expand procedure definitions and keep track of several interacting goals and tasks. Learning by instruction is a promising approach to help users modifY the definitions of the procedures. However, the impact of the set of possible instructions on the performance of such systems is not well understood. We develop a framework in which instruction templates may be characterized in terms of syntactic transforms on task definitions, and use it to explore the properties of coverage, ambiguity and efficiency in the set of instructions that are understood by an implemented task learning system. We determine what kind of ambiguity is affected by the instruction set, and show how context-dependent interpretation can increase efficiency and coverage without increasing ambiguity.
A finite-state model of Georgian verbal morphology
Authors: Olga Gurevich
Venue: Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX (2006)

Georgian is a less commonly studied language with complex, non-concatenative verbal morphology. We present a computational model for generation and recognition of Georgian verb conjugations, relying on the analysis of Georgian verb structure as a word-level template. The model combines a set of finite-state transducers with a default inheritance mechanism.
From Marriages to Coalitions: A Soft CSP Approach
Authors: Stefano Bistarelli, Simon Foley, Barry O'Sullivan, Francesco Santini
Venue: Recent Advances in Constraints: 13th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2008, Rome, Italy, June 18-20, 2008, Revised Selected Papers (2009)

In this work we represent the Optimal Stable Marriage problem as a Soft Constraint Satisfaction Problem. In addition, we extend this problem from couples of individuals to coalitions of generic agents, in order to define new coalition-formation principles and stability conditions. In the coalition case, we suppose the preference value as a trust score, since trust can describe the belief of a node in the capabilities of another node, in its honesty and reliability. Semiring-based soft constraints represent a general and expressive framework that is able to deal with distinct concepts of optimality by only changing the related c-semiring structure, instead of using different ad-hoc algorithms. At last, we propose an implementation of the classical OSM problem using integer linear programming tools.
Temporal dynamic controllability revisited
Authors: Paul Morris, Nicola Muscettola
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 3 (2005)

An important issue for temporal planners is the ability to handle temporal uncertainty. We revisit the question of how to determine whether a given set of temporal requirements are feasible in the light of uncertain durations of some processes. In particular, we consider how best to determine whether a network is Dynamically Controllable, i.e., whether a dynamic strategy exisls for executing the network that is guaranteed to satisfy the requirements. Previous work has shown the existence of a pseudo-polynomial algorithm for testing Dynamic Controllability. Here, we simplify the previous framework, and present a strongly polynomial algorithm with a termination criterion based on the structure of the network.
Rapid Development of Scoped User Interfaces
Authors: Denis Dubé, Jacob Beard, Hans Vangheluwe
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

As the demand for domain- and formalism-specific visual modelling environments grows, the need to rapidly construct complex User Interfaces (UIs) increases. In this paper, we propose a Multi- Paradigm Modelling (MPM) approach whereby structure, visual appearance and above all reactive behaviour of a UI are explicitly modelled. These models are constructed at the most appropriate level of abstraction, using the most appropriate modelling formalisms. This allows for rapid application synthesis, easy adaptation to changing requirements, and simplified maintenance. In this paper, we introduce Scoped User Interfaces, and illustrate how one may model them using Hierarchically-linked Statecharts (HlS). The use of HlS is demonstrated through the rapid development of a DChart formalism-specific modelling environment.
Attacking decipherment problems optimally with low-order N-gram models
Authors: Sujith Ravi, Kevin Knight
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees that no decipherment key is overlooked. We carry out extensive empirical experiments showing how decipherment accuracy varies as a function of cipher length and n-gram order. We also make an empirical investigation of Shannon's (1949) theory of uncertainty in decipherment.
Proceedings of the Student Research Workshop at HLT-NAACL 2004 on XX
Venue: Human Language Technology Conference (2004)

We are pleased to present the 10 papers accepted for presentation at the HLT/NAACL 2004 Student Workshop to be held in Boston on May 2. The main mission of the workshop is to provide feedback for students' work in progress. Each presentation will be followed by comments on the work from a panel of senior researchers. This year, we received 12 submissions representing 4 countries.
Materialized aR-Tree in Distributed Spatial Data Warehouse
Authors: Marcin Gorawski, Rafal Malczok
Venue: Intelligent Data Analysis (2006)

In this paper we present a Spatial Data Warehouse system that we use for aggregation and analysis of huge amounts of spatial data. The data is generated by utilities meters communicating via radio. In order to provide sufficient efficiency for our system we propose data and workload distribution as well as advanced indexing techniques. The system is based on a cascaded star model, which is a spatial development of a standard star schema and contains interconnected and often nested star schemas. The cascaded star allows efficient storage and analysis of spatial data, whose range extends from meter measurement values to weather information. The indexing tree structure and operation is tightly integrated with the spatial character of the data. Thanks to an available memory evaluating mechanism the system is very flexible in the field of aggregates accuracy. We also implemented indexing structure updating mechanism. The system is written in Java; for the data base we use Oracle 9i. Basing on the wide variety of tests results, we prove that a distributed system significantly surpasses the centralized version in terms of efficiency. We also show that a selective materialization of indexing structure fragments strongly increases system efficiency.
Computational complexity of weighted threshold games
Authors: Edith Elkind, Leslie Ann Goldberg, Paul Goldberg, Michael Wooldridge
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Weighted threshold games are coalitional games in which each player has a weight (intuitively corresponding to its voting power), and a coalition is successful if the sum of its weights exceeds a given threshold. Key questions in coalitional games include finding coalitions that are stable (in the sense that no member of the coalition has any rational incentive to leave it), and finding a division of payoffs to coalition members (an imputation) that is fair. We investigate the computational complexity of such questions for weighted threshold games. We study the core, the least core, and the nucleolus, distinguishing those problems that are polynomial-time computable from those that are NP-hard, and providing pseudopolynomial and approximation algorithms for the NP-hard problems.
Designing an e-Learning Reactivate Promotion for Unpopular Collections in Academic Library
Authors: Bo-Yen Wang, Yuan-Hsun Liao, Chia-Ming Liu, Ming-Hsiang Su, Pao-Ta Yu
Venue: Proceedings of the 4th International Conference on E-Learning and Games: Learning by Playing. Game-based Education System Design and Development (2009)

In this paper, a promotion design to improve lending rate of collections in library has been developed. This main ideal of this design is focused on unpopular collections in library with theoretical basis on Long Tail theory proposed by Christ Anderson. According to Long Tail Theory, the unpopular merchandise could be promoted by several strategies such as developing multiple distribution channels for the products, letting the user as a participant in the process of marketing, and customizing the product involved with customer demand. The situation of unpopular collections in library was similar to the merchandise in the tail part of popularity distribution; it could be promoted through reactivate process. This research had analyzed the transaction of the reader lending records to find out the popular books and the unpopular books as the primary step in designing reactive promotion, therefore the process of library data mining could reflect the reader behavior in lending collection of library. Specific readers who had lent the unpopular reading may contribute the improvement in that lending frequency. This research had designed a reactivate promotion to recommend unpopular collections in library by broadcasting readers' interview. The advertisement job is accomplished by Near-Real system which was an e-Learning tool to perform readers' interview around the corners of library.
A new generic basis of "factual" and "implicative" association rules
Authors: Sadok Ben Yahia, Ghada Gasmi, Engelbert Mephu Nguifo
Venue: Intelligent Data Analysis (2009)

The extremely large number of association rules that can be drawn from - even reasonably sized datasets, bootstrapped the development of more acute techniques or methods to reduce the size of the reported rule sets. In this context, the battery of results provided by the Formal Concept Analysis (FCA) allowed one to define "irreducible" nuclei of association rule subset better known as generic bases. From such a condensed and reduced size set of association rules, it is possible to infer all association rules commonly via an adequate axiomatic system. In this paper, we introduce a novel informative generic basis of association rules, conveying two types of knowledge: "factual" and "implicative". We also present a valid and complete axiomatic system allowing one to infer the set of all association rules. Results of the experiments carried out on real-life datasets have shown important profits in terms of compactness of the introduced generic basis.
Information Requirements and Sharing for NGATS Function Allocation Concepts
Authors: Nhut Tan Ho, Patrick Martin, Joseph Bellissimo, Barry Berson
Venue: Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009 (2009)

To support the evaluation of feasible function allocation concepts for separation assurance systems, and to develop a better understanding of the specific information requirements for key tasks (resolving conflicts, avoiding weather, and merging and spacing), air traffic controllers and commercial pilots were interviewed for their goals, sub-goals, and the individual and shared information needed to perform the tasks. The key information requirements obtained can be used as input to ascertain which information is most needed for probing when measuring individual and shared situation awareness. The elicitation also provided insights into the interaction among the controllers, pilots, and automation, and their perception of the concepts' feasibility.
Mobile attachment: emotional attachment towards mobile devices and services
Authors: Alexander Meschtscherjakov
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

In my thesis I address the topic of mobile attachment. I provide a theoretical framework for mobile attachment together with influencing factors that indicate user's emotional attachment (EA) to mobile devices and services. I investigate how the concept of user experience (UX) and EA are linked together and I outline how user behavior driven experience sampling can be exploited to measure mobile attachment. My research will result in design suggestions how the creation of EA to mobile devices and services can be facilitated.
Swarm Intelligence in Modeling Adaptive Behavior of the Industry Cluster
Authors: Xiang Wei, Ye Feifan
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

Adaptation determines a healthy growth of the industry cluster. The agent-based industry cluster modeling is a helpful methodology in cluster development and it provides the combination of macro & micro quantitative analysis on adaptation. In order to make the model more realistic, the individual enterprise’’s adaptive behavior should be modeled. In this paper, by analyzing and comparing adaptations found in both industry cluster and natural swarms, several adaptation behaviors for individual enterprise are represented under the inspiration of swarm intelligence mechanisms in detail. They are the individual’s core capability forming adaptation based on division of labor, the cooperative adaptation based on cooperative transport, and the competitive adaptation based on ant system algorithm. Integrated with the proposed swarm intelligence-based adaptation, the framework of a multi-agent industry cluster model is also presented for future simulation.
Soft state in publish/subscribe
Authors: Zbigniew Jerzak, Christof Fetzer
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

Building survivable content-based publish/subscribe systems is difficult. Every node in a distributed publish/subscribe system stores a significant amount of routing state which can be easily corrupted due to message omissions, link and node failures. In this paper, we show how to build a soft state content-based publish/subscribe system where the whole state is stored at the edge of the publish/subscribe network, at the entity which is utilizing the state. This results in a robust and resilient system, as the routing state is permanently lost or corrupted only if the endpoint entity associated with the given state permanently fails.
Energy efficient sensor data logging with amnesic flash storage
Authors: Suman Nath
Venue: Proceedings of the 2009 International Conference on Information Processing in Sensor Networks (2009)

We present FlashLogger, an energy-efficient sensor data logging system that uses lazy amnesic compression in a flash-efficient manner. FlashLogger incorporates a suite of compression algorithms suitable for progressively compressing time series scalar, audio, and image data. It uses a novel data structure for efficiently organizing and querying compressed data on flash memory. All our methods are designed for the limited memory and processing capabilities typical of low power sensor nodes, and are prototyped on Tmote Sky platform running TinyOS. Evaluation of FlashLogger with several real world data sets shows orders of magnitude energy savings for both logging data and retrieving data within a time range.