ppxscal/embedding_network huggingface dataset:
Lattices with Interior and Closure Operators and Abstract Approximation Spaces
Authors: Gianpiero Cattaneo, Davide Ciucci
Venue: Transactions on Rough Sets X (2009)

The non---equational notion of abstract approximation space for roughness theory is introduced, and its relationship with the equational definition of lattice with Tarski interior and closure operations is studied. Their categorical isomorphism is proved, and the role of the Tarski interior and closure with an algebraic semantic of a S4---like model of modal logic is widely investigated.A hierarchy of three particular models of this approach to roughness based on a concrete universe is described, listed from the stronger model to the weaker one: (1) the partition spaces, (2) the topological spaces by open basis, and (3) the covering spaces.
Comparing corpora and lexical ambiguity
Authors: Patrick Ruch, Arnaud Gaudinat
Venue: Proceedings of the Workshop on Comparing Corpora (2000)

In this paper we compare two types of corpus, focusing on the lexical ambiguity of each of them. The first corpus consists mainly of newspaper articles and literature excerpts, while the second belongs to the medical domain. To conduct the study, we have used two different disambiguation tools. However, first of all, we must verify the performance of each system in its respective application domain. We then use these systems in order to assess and compare both the general ambiguity rate and the particularities of each domain. Quantitative results show that medical documents are lexically less ambiguous than unrestricted documents. Our conclusions show the importance of the application area in the design of NLP tools.
Choosing a distance metric for automatic word categorization
Authors: Emin Erkan Korkmaz, Göktürk Üçoluk
Venue: Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning (1998)

This paper analyzes the functionality of different distance metrics that can be used in a bottom-up unsupervised algorithm for automatic word categorization. The proposed method uses a modified greedy-type algorithm. The formulations of fuzzy theory are also used to calculate the degree of membership for the elements in the linguistic clusters formed. The unigram and the bigram statistics of a corpus of about two million words are used. Empirical comparisons are made in order to support the discussions proposed for the type of distance metric that would be most suitable for measuring the similarity between linguistic elements.
Approximating Node-Connectivity Augmentation Problems
Authors: Zeev Nutov
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

We consider the (undirected) Node Connectivity Augmentation (NCA) problem: given a graph J = (V,E J ) and connectivity requirements {r(u,v):u,v ¿ V}, find a minimum size set I of new edges (any edge is allowed) so that J + I contains r(u,v) internally disjoint uv-paths, for all u,v ¿ V. In the Rooted NCA there is s ¿ V so that r(u,v) > 0 implies u = s or v = s. For large values of k = max u,v ¿ V r(u,v), NCA is at least as hard to approximate as Label-Cover and thus it is unlikely to admit a polylogarithmic approximation. Rooted NCA is at least as hard to approximate as Hitting-Set. The previously best approximation ratios for the problem were O(k ln n) for NCA and O(ln n) for Rooted NCA. In [Approximating connectivity augmentation problems, SODA 2005] the author posed the following open question: Does there exist a function ρ(k) so that NCA admits a ρ(k)-approximation algorithm? In this paper we answer this question, by giving an approximation algorithm with ratios O(k ln 2 k) for NCA and O(ln 2 k) for Rooted NCA. This is the first approximation algorithm with ratio independent of n, and thus is a constant for any fixed k. Our algorithm is based on the following new structural result which is of independent interest. If ${\cal D}$ is a set of node pairs in a graph J, then the maximum degree in the hypergraph formed by the inclusion minimal tight sets separating at least one pair in ${\cal D}$ is O(¿2), where ¿ is the maximum connectivity of a pair in ${\cal D}$.
Towards Humanlike Social Touch for Prosthetics and Sociable Robotics: Three-Dimensional Finite Element Simulations of Synthetic Finger Phalanges
Authors: John-John Cabibihan, Shuzhi Sam Ge
Venue: Proceedings of the FIRA RoboWorld Congress 2009 on Advances in Robotics (2009)

Synthetic skins with humanlike characteristic would make it possible to address some of the psychosocial requirements of prosthetic hands as well as the safety and acceptance issues in social robotics. This paper describes the development of three-dimensional finite element models of synthetic finger phalanges. With the aim of duplicating the skin compliance of human finger phalanges, the model was used to investigate the effects of (i) introducing open pockets in the internal structure and (ii) combining different materials as external and internal layers. The results show that having pockets in the internal structure of the design can increase the skin compliance of the synthetic phalanges and make it comparable with the human counterpart. Moreover, having different layers can be used to satisfy skin compliance and other design requirements such as wear and tear.
SkyTree: scalable skyline computation for sensor data
Authors: Jongwuk Lee, Seung-won Hwang
Venue: Proceedings of the Third International Workshop on Knowledge Discovery from Sensor Data (2009)

Skyline queries have gained attention for supporting multi-criteria analysis of large-scale datasets. While a lot of skyline algorithms have been proposed, most of the algorithms build upon pre-computed index structures that cannot generally be supported over sensor data of dynamically changing attribute values. We aim to design a scalable non-index skyline computation algorithm for sensor data. More specifically, we propose Algorithm Sky Tree constructing a dynamic lattice that divides a specific region into several subregions based on a pivot point maximizing dominance region. Such structure enables to perform region-wise dominance tests, which eliminates unnecessary point-wise dominance tests. In addition, we ensure the progressiveness that has not been supported by any non-index algorithm, where we can identify k points maximizing the sum of dominance regions as the greedy approximation method. The k points are used to reduce communication cost between sensors in computing global skyline. Our evaluation results validate the efficiency of Algorithm SkyTree, both in terms of response time and communication overhead, over existing algorithms.
The Oxidizing Removal of the Fourth Instar Larvae of Chironomus Kiiensis in Drinking Water
Authors: Xingbin Sun, Cui Fuyi
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

Chironomus kiiensis larvae which cannot be exterminated by conventional disinfection process propagates prolifically in eutrophic water body, and it therefore turns to be a potential problem encountered in drinking water quality. In this paper, the quantitative experimental studies were carried out on inactivation of the fourth instar larvae of Chironomus kiiensis in the raw water using oxidants, such as chlorine (Cl2), chlorine dioxide (ClO2) and ozone (O3). The results showed that ozone and chlorine dioxide can be selected as effective oxidants for inactivation Chironomus kiiensis larvae because of their strong inactivation abilities. In addition, mortality of the fourth instar larvae of Chironomus kiiensis after pre-oxidation followed by coagulating-sedimentation process was investigated. The results showed that the 4th instar larvae of Chironomus kiiensis in the raw water could deposit with floccules followed by coagulating-sedimentation process, and sedimentation water was not affected by Chironomus kiiensis larvae. The fourth instar larvae of Chironomus kiiensis would die in 6h with the chlorine dioxide dose of 2.0mg/L. And the excessive propagation of Chironomus kiiensis larvae could be controlled effectively in sedimentation tank by chlorine dioxide pre-oxidation.
Phase field computations for surface diffusion and void electromigration in $${\mathbb{R}^3}$$
Authors: L&#x2019;ubom&#x00ed;r Ba&#x0148;as, Robert N&#x00fc;rnberg
Venue: Computing and Visualization in Science (2009)

We consider a finite element approximation of a phase field model for the evolution of voids by surface diffusion in an electrically conducting solid. The phase field equations are given by a degenerate Cahn&#x2013;Hilliard equation with an external forcing induced by the electric field. We describe the iterative scheme used to solve the resulting nonlinear discrete equations and present some numerical experiments in three space dimensions.
DEEP-SaM - Energy-Efficient Provisioning Policies for Computing Environments
Authors: Christian Bodenstein, Tim Püschel, Markus Hedwig, Dirk Neumann
Venue: Proceedings of the 6th International Workshop on Grid Economics and Business Models (2009)

The cost of electricity for datacenters is a substantial operational cost that can and should be managed, not only for saving energy, but also due to the ecologic commitment inherent to power consumption. Often, pursuing this goal results in chronic underutilization of resources, a luxury most resource providers do not have in light of their corporate commitments. This work proposes, formalizes and numerically evaluates DEEP-Sam, for clearing provisioning markets, based on the maximization of welfare, subject to utility-level dependant energy costs and customer satisfaction levels. We focus specifically on linear power models, and the implications of the inherent fixed costs related to energy consumption of modern datacenters and cloud environments. We rigorously test the model by running multiple simulation scenarios and evaluate the results critically. We conclude with positive results and implications for long-term sustainable management of modern datacenters.
Book Layout Analysis: TOC Structure Extraction Engine
Authors: Bodin Dresevic, Aleksandar Uzelac, Bogdan Radakovic, Nikola Todic
Venue: Advances in Focused Retrieval: 7th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2008, Dagstuhl Castle, Germany, December 15-18, 2008. Revised and Selected Papers (2009)

Scanned then OCRed documents usually lack detailed layout and structural information. We present a book specific layout analysis system used to extract TOC structure information from the scanned and OCRed books. This system was used for navigation purposes by the live books search project. We provide labeling scheme for the TOC sections of the books, high level overview for the book layout analysis system, as well as TOC Structure Extraction Engine. In the end we present accuracy measurements of this system on a representative test set.
Human evaluation of a German surface realisation ranker
Authors: Aoife Cahill, Martin Forst
Venue: Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics (2009)

In this paper we present a human-based evaluation of surface realisation alternatives. We examine the relative rankings of naturally occurring corpus sentences and automatically generated strings chosen by statistical models (language model, log-linear model), as well as the naturalness of the strings chosen by the log-linear model. We also investigate to what extent preceding context has an effect on choice. We show that native speakers do accept quite some variation in word order, but there are also clearly factors that make certain realisation alternatives more natural.
A Belief Model of Query Difficulty That Uses Subjective Logic
Authors: Christina Lioma, Roi Blanco, Raquel Mochales Palau, Marie-Francine Moens
Venue: Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory (2009)

The difficulty of a user query can affect the performance of Information Retrieval (IR) systems. This work presents a formal model for quantifying and reasoning about query difficulty as follows: Query difficulty is considered to be a subjective belief, which is formulated on the basis of various types of evidence. This allows us to define a belief model and a set of operators for combining evidence of query difficulty. The belief model uses subjective logic, a type of probabilistic logic for modeling uncertainties. An application of this model with semantic and pragmatic evidence about 150 TREC queries illustrates the potential flexibility of this framework in expressing and combining evidence. To our knowledge, this is the first application of subjective logic to IR.
Face Classification Using Gabor Wavelets and Random Forest
Authors: Vidyut Ghosal, Paras Tikmani, Phalguni Gupta
Venue: Proceedings of the 2009 Canadian Conference on Computer and Robot Vision (2009)

This paper presents a new face classification techniquebased on Gabor wavelets and Random Forest. Random Forest is a tree based classifier that consists of many decision trees. Each tree gives a classification and the output isthe aggregate of these classifications. The proposed algorithm first extracts features from the face images usingGabor wavelet transform and then uses the Random Forestalgorithm to classify the images based on the extracted features. But Gabor wavelet transform leads to high featuredimensions which increases the cost of computation. Theproposed algorithm uses a Random Forest which selects asmall set of most discriminant Gabor wavelet features. Onlythis small set of features is now used to classify the images resulting in a fast face recognition technique.
A gravitational task model with arbitrary anchor points for target sensitive real-time applications
Authors: Raphael Guerra, Gerhard Fohler
Venue: Real-Time Systems (2009)

Classic task models for real-time systems focus on execution windows expressing earliest start times and deadlines of tasks for feasibility. Only within these windows the execution of tasks is feasible, and it is considered of uniform utility.Some tasks, however, have target demands in addition: a task should preferably execute at a specific target point within its execution window, but can execute around this point, albeit at lower utility. Examples of such applications include control and media processing.In this paper, we present a task model based on a gravitational analogy to address these issues. Tasks are considered as massive bobs hanging on a pendulum: a single task, left to itself, will execute at the bottom, the target point. If a force, such as the weight of other tasks, is applied, it can be shifted around this point. Thus, tasks' importance and their utility around target points can be expressed. Since the execution of a task cannot be mapped to a point in time, the model allows tasks to express an arbitrary point with its execution to represent the whole execution. This point is called the anchor point.Moreover, we show an example of a scheduling algorithm for this model which finds an approximation to the best compromise of tasks' interests based on the equilibrium state of a pendulum. Nonetheless, this task model is not restricted to a particular scheduling algorithm.Results from a simulation study show the effectiveness of the approach.
Implications for Developing Information System on Nursing Administration --- Case Study on Nurse Scheduling System ---
Authors: Mitsuhiko Karashima, Naotake Hirasawa
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)

This research was focused on the nurse scheduling system as the supporting system for the nursing administration. In this research as a case study, the nurse scheduling system was developed by applying the human centered design process. The head nurses claimed that it was a higher workload for them to rearrange the imperfect roster of the first automated scheduling system than to make the roster from the beginning because the mathematical solution for the system cannot always propose the roster which has no violation. The nurse required the scheduling support system which supported her heuristic scheduling instead of the automated system. The nurse scheduling support system was developed and the other nurses were more satisfied with the system than with the conventional popular automated scheduling system. From the results of this research, the approach of the development of the supporting system for administration was discussed.
Using VRML Technology for Visualization of Relations between the Main Concepts of an Educational Course
Authors: Evgeny Eremin
Venue: Proceedings of the 17th International Conference on Conceptual Structures: Conceptual Structures: Leveraging Semantic Technologies (2009)

This paper proposes to use the VRML technology to save and display visual schemes of Topic Maps representing the structures of educational subjects. As learning purposes always require the careful selection of the most pertinent concepts from the total scientific knowledge, the rendering of Topic Maps for educational scope need not be too large. Special software has been developed to convert the original TM files into corresponding VRML 3D scenes. Processing of several computer science courses has already produced satisfactory images, and work to improve the visualization will continue.
Reaction Policy Model Based on Dynamic Organizations and Threat Context
Authors: Fabien Autrel, Nora Cuppens-Boulahia, Frédéric Cuppens
Venue: Proceedings of the 23rd Annual IFIP WG 11.3 Working Conference on Data and Applications Security XXIII (2009)

The tasks a system administrator must fulfill become more and more complex as information systems increase in complexity and connectivity. More specifically, the problem of the expression and update of security requirements is central. Formal models designed to express security policies have proved to be necessary since they provide non ambiguous semantics to analyze them. However, such models as RBAC or OrBAC are not used to express reaction requirements which specify the reaction policy to enforce when intrusions are detected. We present in this article an extension of the OrBAC model by defining dynamic organizations and threat contexts to enable the expression and enforcement of reaction requirements.
Classifying particle semantics in English verb-particle constructions
Authors: Paul Cook, Suzanne Stevenson
Venue: Proceedings of the Workshop on Multiword Expressions: Identifying and Exploiting Underlying Properties (2006)

Previous computational work on learning the semantic properties of verb-particle constructions (VPCs) has focused on their compositionality, and has left unaddressed the issue of which meaning of the component words is being used in a given VPC. We develop a feature space for use in classification of the sense contributed by the particle in a VPC, and test this on VPCs using the particle up. The features that capture linguistic properties of VPCs that are relevant to the semantics of the particle outperform linguistically uninformed word co-occurrence features in our experiments on unseen test VPCs.
The Construction of Mine Flood Preventing and Controlling Information System
Authors: Guangchao Wen, Yinsheng Deng, Jiangtao Xu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

The author proposes the research goals of the mine flood preventing and controlling information system by analyzing the present situation of mine flood research, details the basic ideas of the system architecture, briefly sums up the mine flood forecasting and computer assistance decision system architecture design, development platform choice and implementation of the system. The soft has been tested in WUKUANG of Pingdingshan mine field after the completion of the system and the result is good.
It's not all about "Green": energy use in low-income communities
Authors: Tawanna Dillahunt, Jennifer Mankoff, Eric Paulos, Susan Fussell
Venue: Proceedings of the 11th international conference on Ubiquitous computing (2009)

Personal energy consumption, specifically home energy consumption such as heating, cooling, and electricity, has been an important environmental and economic topic for decades. Despite the attention paid to this area, few researchers have specifically explored these issues within a community that makes up approximately 30% of U.S. households -- those below the federal poverty line. We present a study of 26 low-income households in two very different locations -- a small town in the Southern U.S. and a northerly metropolitan area. Through a photo-elicitation study and directed interviews, we explore the relationship between energy saving behaviors, external factors, and users' intrinsic values and beliefs. Most of our participants are committed to saving energy for non-financial reasons, even when not responsible for paying bills. Challenges to saving energy include safety and lack of control over the environment. We discuss how Ubicomp technologies for saving energy can address some of these challenges.
Brief paper: Residual generation and evaluation of networked control systems subject to random packet dropout
Authors: Yongqiang Wang, Hao Ye, Steven X. Ding, Guizeng Wang, Donghua Zhou
Venue: Automatica (Journal of IFAC) (2009)

In this paper, we address fault detection for networked control systems subject to random packet dropout. The packet dropout is assumed to be existing in the sensor-to-controller link and the controller-to-actuator link. Both parity space and observer based residual generation and evaluation approaches are proposed. In parity space based fault detection scheme, a new optimization index is proposed to deal with stochastic system parameters caused by random packet dropout, while in observer based scheme, this is accomplished by introducing a reference model. In order to evaluate performance of the designated threshold, the corresponding false alarm rate is given. The two fault detection schemes can ensure both robustness to packet dropout as well as disturbance and sensitivity to fault. An experimental study is employed to verify that the proposed method performs better than the existing approaches.
Regular tree languages definable in FO and in FOmod
Authors: Michael Benedikt, Luc Segoufin
Venue: ACM Transactions on Computational Logic (TOCL) (2009)

We consider regular languages of labeled trees. We give an effective characterization of the regular languages over such trees that are definable in first-order logic in the language of labeled graphs. These languages are the analog on trees of the &ldquo;locally threshold testable&rdquo; languages on strings. We show that this characterization yields a decision procedure for determining whether a regular tree language is first-order definable: The procedure is polynomial time in the minimal automaton presenting the regular language. We also provide an algorithm for deciding whether a regular language is definable in first-order logic supplemented with modular quantifiers.