ppxscal/embedding_network huggingface dataset:
Dynamic Growing Self-organizing Neural Network for Clustering
Authors: Daxin Tian, Yueou Ren, Qiuju Li
Venue: Proceedings of the 4th international conference on Advanced Data Mining and Applications (2008)

Neural Networks have been widely used in the field of intelligent information processing such as classification, clustering, prediction, and recognition. Unsupervised learning is the main method to collect and find features from large unlabeled data. In this paper a new unsupervised learning clustering neuron network--Dynamic Growing Self-organizing Neuron Network (DGSNN) is presented. It uses a new competitive learning rule--Improved Winner-Take-All (IWTA) and adds new neurons when it is necessary. The advantage of DGSNN is that it overcomes the usual problems of other clustering methods: dead units and prior knowledge of the number of clusters. In the experiments, DGSNN is applied to clustering tasks to check its ability and is compared with other clustering algorithms RPCL and WTA. The results show that DGSNN performs accurately and efficiently.
Verification, Least-Fixpoint Checking, Abstraction
Authors: Andreas Podelski
Venue: Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments (2008)

We consider verification algorithms in a wide sense. The out-come of a verification algorithm can be a definite (yes or no) answer, a "don't know" answer, or a conditional answer or no answer at all (divergence). We obtain these kinds of verification algorithms if we apply the existing technology of abstraction to least-fixpoint checking, i.e., checking whether the least fixpoint of a given operator in a given lattice is smaller than a given bound. The formulation of the verification algorithm as least-fixpoint checking is classical for the class of correctness properties that are reducible to non-reachability (validity of assertions, partial correctness, safety properties). We need to investigate the approach also for the class of correctness properties that are reducible to termination (validity of intermittent assertions, total correctness, liveness properties), for all classes of programs including procedural (recursive) programs and concurrent programs.
Priberam's Question Answering System in QA@CLEF 2007
Authors: Carlos Amaral, Adán Cassan, Helena Figueira, André Martins, Afonso Mendes, Pedro Mendes, Cláudia Pinto, Daniel Vidal
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

This paper accounts for Priberam's participation in the monolingual question answering (QA) track of CLEF 2007. In previous participations, Priberam's QA system obtained encouraging results both in monolingual and cross-language tasks. This year we endowed the system with syntactical processing, in order to capture the syntactic structure of the question. The main goal was to obtain a more tuned question categorisation and consequently a more precise answer extraction. Besides this, we provided our system with the ability to handle topic-related questions and to use encyclopaedic sources like Wikipedia. The paper provides a description of the improvements made in the system, followed by the discussion of the results obtained in Portuguese and Spanish monolingual runs.
Fast Radio Broadcasting with Advice
Authors: David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc
Venue: Proceedings of the 15th international colloquium on Structural Information and Communication Complexity (2008)

We study deterministic broadcasting in radio networks in the recently introduced framework of network algorithms with advice. We concentrate on the problem of trade-offs between the number of bits of information (size of advice) available to nodes and the time in which broadcasting can be accomplished. In particular, we ask what is the minimum number of bits of information that must be available to nodes of the network, in order to broadcast very fast. For networks in which constant time broadcast is possible under complete knowledge of the network we give a tight answer to the above question: O(n) bits of advice are sufficient but o(n) bits are not, in order to achieve constant broadcasting time in all these networks. This is in sharp contrast with geometric radio networks of constant broadcasting time: we show that in these networks a constant number of bits suffices to broadcast in constant time. For arbitrary radio networks we present a broadcasting algorithm whose time is inverse-proportional to the size of advice.
An Experimental Analysis of Undo in Ubiquitous Computing Environments
Authors: Marco Loregian, Marco P. Locatelli
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

All personal computer application are provided with an undo functionality, which can implement any of the models available in literature. Users are generally aware of what the undo function is expected to do, depending on the application in use. Ubiquitous computing systems are beginning to be understood and deployed in real life situations, but little attention has been paid to what users expect themselves to be able to do and undo in such systems. In this paper, we present the results of a survey we made to evaluate the perception of undo mechanisms with respect to a simple ubiquitous-computing environment. Our study shows that users already have a complex vision of undo encompassing advanced features such as context awareness and compensation.
A study on the relevance criteria for medical images
Authors: Shahram Sedghi, Mark Sanderson, Paul Clough
Venue: Pattern Recognition Letters (2008)

This paper reports the results of a study investigating the relevance criteria used by health care professionals when seeking medical images. Data was collected from 26 participants using a think-a-loud protocol and face-to-face interviews and analysed using the Straussian version of grounded theory (GT). Findings show that participants made use of 26 relevance criteria, although did not agree on the most important. Our findings suggest that users apply different criteria in different situations when evaluating the relevancy of medical images. In addition, we have investigated the coverage of relevance criteria to search statements from the medical track of ImageCLEF (ImageCLEFMed). Analysis indicates that some of the criteria identified by our participants could be included in new topics used for future incarnations of the medical image retrieval track.
Emergent Motion Characteristics of a Modular Robot through Genetic Algorithm
Authors: Sunil Pranit Lal, Koji Yamada, Satoshi Endo
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

In this paper we present an approach to transform individual behaviour of homogenous sub-systems to yield desired global behaviour of the overall system. As a test bed we consider the brittle star robot as the system which is composed of homogenous modules (sub-systems). Using genetic algorithm, the rotational motion of the individual modules is translated into rectilinear motion of the robot. We argue that given a set of sub-system level behaviours, it is better to discover intermediate system level infinitesimal behaviours as a stepping stone to developing desired system level global behaviour.
First General-Purpose Electronic Computer
Authors: Arthur W. Burks, Alice R. Burks
Venue: IEEE Annals of the History of Computing (1981)

The conception, development, and design of the ENIAC are presented in the context of a causal history. Early influences, particularly the differential analyzer and the work of Atanasoff, are detailed. Architecture, electronic and logical designs, basic elements, main units, and problem setup are described, together with the historical contributions to each aspect. Finally, the place of the ENIAC in the history of computers is delineated, both quantitatively and qualitatively, through a comparison with machines from the mechanical, electromechanical, and electronic technologies.Reproduced here with permission of Arthur W. Burks and Alice R. Burks
Entity clustering using 3D mesh simplification
Authors: Costin-Anton Boiangiu, Bogdan Raducanu
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

Entity clustering is a vital feature needed by any automatic content conversion system. Such a system constructs a digital document from a hard copy of a newspaper, book, etc. At application level, the system will process an image (typically black and white) and identify the various content layout elements, such as paragraphs, tables, images, columns, etc. Here is where the entity clustering mechanism comes into play. Its role is to group atomic entities (characters, points, lines) into layout elements. To achieve this, the system can take on different approaches. They mostly rely on the geometrical properties of the enclosed items, like their relative position, size, boundaries or alignment. This paper describes an approach based on 3D mesh reduction algorithms.
Underground Aesthetics: Rethinking Urban Computing
Authors: Arianna Bassoli, Johanna Brewer, Karen Martin, Paul Dourish, Scott Mainwaring
Venue: IEEE Pervasive Computing (2007)

At present, much work on urban computing focuses its efforts on solving the perceived problems of disconnection, disruption, and dislocation. A growing movement, however, points toward the value of considering a less instrumental account of city life. Through reflections on an ethnographic study of an urban motility site and the design of Undersound, a situated music exchange application, the authors explore how an aesthetic account of urban life might be leveraged to support not only an individual, but also a collective, experience of the city. This article is part of a special issue on Urban Computing.
An Infinitely-Often One-Way Function Based on an Average-Case Assumption
Authors: Edward A. Hirsch, Dmitry M. Itsykson
Venue: Proceedings of the 15th international workshop on Logic, Language, Information and Computation (2008)

We assume the existence of a function f that is computable in polynomial time but its inverse function is not computable in randomized average-case polynomial time. The cryptographic setting is, however, different: even for a weak one-way function, every possible adversary should fail on a polynomial fraction of inputs. Nevertheless, we show how to construct an infinitely-often one-way function based on f.
Effects of Mobility on Membership Estimation and Routing Services in Ad Hoc Networks
Authors: Juan Carlos García, Mari-Carmen Bañuls, Stefan Beyer, Pablo Galdámez
Venue: Proceedings of the 5th international symposium on Parallel and Distributed Processing and Applications (2007)

The use of MANET's (or Mobile Ad hoc NETworks) is becoming very popular. Power efficiency is a key issue in this type of network, as mobile devices usually rely on limited power supplies. One essential service, the routing protocol, employed to discover routes between nodes in the network, can greatly affect power consumption.Furthermore, many distributed applications require an additional membership service to keep track of the nodes that make up the system at any moment. In general, this information is not provided by routing services with the exception of the Optimised Link State Routing protocol (OLSR).The two services, routing and membership estimation, form a basic support to build other higher---level distributed services on ad hoc networks. To decrease the over-all power consumption these services should be optimized for the intended use of the network. In particular the degree of mobility can have an impact on the power consumption and performance of different approaches to routing and membership estimation.In this paper we present a study of two different approaches that combine a routing service with membership estimation. We compare the proactive OLSR with our own approach. Our approach consists of integrating a gossip-style failure detector with the reactive Dynamic Source Routing protocol (DSR).We present an analysis of the effects of mobility on the global performance and power consumption of the two approaches. We identify scenarios for which each approach is best suited.
Automatic Tracking of Escherichia Coli Bacteria
Authors: Jun Xie, Shahid Khan, Mubarak Shah
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

In this paper, we present an automatic method for estimating the trajectories of Escherichia coli bacteria from in vivo phase-contrast microscopy videos. To address the low-contrast boundaries in cellular images, an adaptive kernel-based technique is applied to detect cells in sequence of frames. Then a novel matching gain measure is introduced to cope with the challenges such as dramatic changes of cells' appearance and serious overlapping and occlusion. For multiple cell tracking, an optimal matching strategy is proposed to improve the handling of cell collision and broken trajectories. The results of successful tracking of Escherichia coli from various phase-contrast sequences are reported and compared with manually-determined trajectories, as well as those obtained from existing tracking methods. The stability of the algorithm with different parameter values is also analyzed and discussed.
Connectivity of Connected Bipartite Graphs with Two Orbits
Authors: Xiaodong Liang, Jixiang Meng
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Let X = (V,E) be a simple connected graph, the connectivity ¿(X) of X is the minimum cardinality of all vertex cut sets in X. Let x ¿ V(X), the set {x g :g ¿ Aut(X)} is called an orbit of Aut(X), the automorphism group of X. In this note, we prove that the connectivity of a connected bipartite graph with two orbits attains its minimum degree.
Relaxations for Compiled Over-Constrained Problems
Authors: Alexandre Papadopoulos, Barry O'Sullivan
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

In many real-world settings, e.g. product configuration, constraint satisfaction problems are compiled into automata or binary decision diagrams, which can be seen as instances of Darwiche's negation normal form. In this paper we consider settings in which a foreground set of constraints can be added to a set of consistent background constraints, that are compactly represented in a compiled form. When the set of foreground constraints introduces inconsistencies with the background constraints we wish to find relaxations of the problem by identifying the subset of the foreground constraints that do not introduce inconsistency; such a subset is called a relaxation. This paper is organised in two parts. First, two novel algorithms for finding relaxations based on automata are presented. They find the relaxation that is consistent with the largest (or smallest) number of solutions from amongst the longest ones (first algorithm), or from amongst the set-wise maximal ones (second algorithm). Then, we generalise our results by identifying the properties that the target compilation language must have for our approach to apply. Finally, we show empirically that on average our algorithms can be more than 500 times faster than a current state-of-the-art algorithm.
A review and classification of fuzzy mathematical programs
Authors: Adil Baykasoǧlu, Tolunay Göçken
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2008)

In this article, a review of fuzzy mathematical programming models according to fuzzy components is given. Fifteen types of the fuzzy mathematical programming models are identified in the proposed classification. All possible combinations of fuzzy components are considered in classifying fuzzy mathematical programs. Existing solution procedures which were proposed in the literature for solving fuzzy mathematical programs are also reviewed and discussed in the paper.
Unfolding Graph Transformation Systems: Theory and Applications to Verification
Authors: Paolo Baldan, Andrea Corradini, Barbara König
Venue: Concurrency, Graphs and Models: Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday (2008)

The unfolding of a system represents in a single branching structure all its possible computations: it is the cornerstone both of semantical constructions and of efficient partial order verification techniques. In this paper we survey the contributions we elaborated in the last decade with Ugo Montanari and other colleagues, concerning the unfolding of graph transformation systems, and its use in the definition of a Winskel style functorial semantics and in the development of methodologies for the verification of finite and infinite state systems.
Learning General Solutions through Multiple Evaluations during Development
Authors: Tuan-Hao Hoang, R. I. Mckay, Daryl Essam, Xuan Hoai Nguyen
Venue: Proceedings of the 8th international conference on Evolvable Systems: From Biology to Hardware (2008)

In this paper, we investigate whether performing multiple evaluations during development --- a technique we call Evolutionary Developmental Evaluation (EDE) --- could help developmental Genetic Programming (GP) evolve general solutions, solving not only the original (training) problem, but also unseen similar problems (with higher degrees of complexity). The hypothesis is tested on two families of regression problems, and the experimental results support the hypothesis.
Tableau Systems for Logics of Subinterval Structures over Dense Orderings
Authors: Davide Bresolin, Valentin Goranko, Angelo Montanari, Pietro Sala
Venue: Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods (2007)

We construct a sound, complete, and terminating tableau system for the interval temporal logic ${{\rm D}_\sqsubset}$ interpreted in interval structures over dense linear orderings endowed with strict subinterval relation (where both endpoints of the sub-interval are strictly inside the interval). In order to prove the soundness and completeness of our tableau construction, we introduce a kind of finite pseudo-models for our logic, called ${{\rm D}_\sqsubset}$-structures, and show that every formula satisfiable in ${{\rm D}_\sqsubset}$ is satisfiable in such pseudo-models, thereby proving small-model property and decidability in PSPACE of ${{\rm D}_\sqsubset}$, a result established earlier by Shapirovsky and Shehtman by means of filtration. We also show how to extend our results to the interval logic ${{\rm D}_\sqsubset}$ interpreted over dense interval structures with proper (irreflexive) subinterval relation, which differs substantially from ${{\rm D}_\sqsubset}$ and is generally more difficult to analyze. Up to our knowledge, no complete deductive systems and decidability results for ${{\rm D}_\sqsubset}$ have been proposed in the literature so far.
Stratification of Severity of Illness Indices: A Case Study for Breast Cancer Prognosis
Authors: Terence A. Etchells, Ana S. Fernandes, Ian H. Jarman, José M. Fonseca, Paulo J. Lisboa
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

Prognostic modelling involves grouping patients by risk of adverse outcome, typically by stratifying a severity of illness index obtained from a classifier or survival model. The assignment of thresholds on the risk index depends of pairwise statistical significance tests, notably the log-rank test. This paper proposes a new methodology to substantially improve the robustness of the stratification algorithm, by reference to a statistical and neural network prognostic study of longitudinal data from patients with operable breast cancer.
A Trust-Based Access Control with Feedback
Authors: Xiaoning Ma, Zhiyong Feng, Chao Xu, Jiafang Wang
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Now, the research about access control is still active. Some researchers discuss access control from new point of view. Trust has natural connection with access control. It will promote development of access control to use trust. There is a kind of access control problem we call “gambling” access control. After provider of service affords service to requestor, probability that provider gets designed results is close to probability that provider gets undersigned results. Faced to request, provider has to gamble. The traditional access control could not resolve this kind of problem. On the contrary, trust-based access control is suitable for this problem. In this paper, based on social cognitive theory, we design a trust-based access control (TBAC) with feedback. Based on provider’s goals, TBAC looks on trust to requestor as standard to whether give requestor the corresponding warranty or not. Besides, we use environment, feedback, and forecast, to realize adaptability.
Walking-Distance Introduced Queueing Theory
Authors: Daichi Yanagisawa, Akiyasu Tomoeda, Ayako Kimura, Katsuhiro Nishinari
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

We introduce the effect of delay in walking from the head of the queue to the service windows in the queueing theory, and obtain the suitable type of queueing system under various conditions. When there are plural service windows, the queueing theory indicates that a fork-type queue, which collects people into a single queue, is more efficient than a parallel-type queue, i.e., queues for each service windows. However, in the walking-distance introduced queueing theory, we find that the parallel-type queue is more efficient when sufficiently many people are waiting in queues, and service time is shorter than walking time. We also consider the situation where there are two kinds of people, whose service time is short and long. The analytical result says that we can decrease people's waiting time and their stress by setting up queues for each kind of people separately.
An ontology-based approach to learnable focused crawling
Authors: Hai-Tao Zheng, Bo-Yeong Kang, Hong-Gee Kim
Venue: Information Sciences: an International Journal (2008)

Focused crawling is aimed at selectively seeking out pages that are relevant to a predefined set of topics. Since an ontology is a well-formed knowledge representation, ontology-based focused crawling approaches have come into research. However, since these approaches utilize manually predefined concept weights to calculate the relevance scores of web pages, it is difficult to acquire the optimal concept weights to maintain a stable harvest rate during the crawling process. To address this issue, we proposed a learnable focused crawling framework based on ontology. An ANN (artificial neural network) was constructed using a domain-specific ontology and applied to the classification of web pages. Experimental results show that our approach outperforms the breadth-first search crawling approach, the simple keyword-based crawling approach, the ANN-based focused crawling approach, and the focused crawling approach that uses only a domain-specific ontology.
Ontologies as an interface between different design support systems
Authors: Minna Lanz, Timo Kallela, Eeva Järvenpää, Reijo Tuokko
Venue: Proceedings of the 9th WSEAS International Conference on Neural Networks (2008)

The aim of the present paper is to shortly review the problem field the companies are facing as the information should flow between different design support systems and introduce an approach to solve some of the arising problems. The CoreOntology forms the information structure for the Knowledge Base (KB) and standardizes the communication interface for the design support systems. In the present paper, an approach is proposed to share platform independent product, process and system related knowledge between the different design support systems through the KB.