We present in this paper the systems we participated with in the Semantic Textual Similarity task at SEM 2013. The Semantic Textual Similarity Core task (STS) computes the degree of semantic equivalence between two sentences where the participant systems will be compared to the manual scores, which range from 5 (semantic equivalence) to 0 (no relation). We combined multiple text similarity meas...

We introduce the concept of control centrality to quantify the ability of a single node to control a directed weighted network. We calculate the distribution of control centrality for several real networks and find that it is mainly determined by the network's degree distribution. We show that in a directed network without loops the control centrality of a node is uniquely determined by its lay...

The analysis and visualization of weighted networks pose many challenges, which have led to the development of techniques for extracting the network’s backbone, a subgraph composed of only the most significant edges. Weighted edges are particularly common in bipartite projections (e.g. networks of coauthorship, co-attendance, co-sponsorship), which are often used as proxies for one-mode network...

Biological taxonomy is at the heart of species identifications. Such identifications are instrumental in biodiversity studies, ecological assessment, and phylogenetic analysis, among other studies. Fuzzy measures and classification integration was used to analyze shape groups of the diatom Asterionella using fuzzy Fourier shape coefficients and fuzzy morphometric measures. Based on this analysi...

We aim to generalize Büchi’s fundamental theorem on the coincidence of recognizable and MSO-definable languages to a weighted timed setting. For this, we investigate weighted timed automata and show how we can extend Wilke’s relative distance logic with weights taken from an arbitrary semiring. We show that every formula in our logic can effectively be transformed into a weighted timed automato...

Fuzzy logic control is a methodology bridging artificial intelligence and traditional control theory. This methodology is usually applied in the only cases when accuracy is not of high necessity or importance. On the other hand, as it is stated in (TI SPRA028, Jan.1993), “Fuzzy Logic can address complex control problems, such as robotic arm movement, chemical or manufacturing process control, a...

What prevents the Geospatial Semantic Web from taking off is not a missing architecture and protocol stack but, beside other aspects, the question of how Web services can be semi-automatically discovered and whether and to what degree they satisfy user requirements. Two approaches turned out to be useful for semanticenabled geospatial information retrieval: subsumption reasoning and similarity ...

In this paper we study the model-checking problem for weighted timed automata and the weighted CTL logic ; we also study the finiteness of bisimulations of weighted timed automata. Weighted timed automata are timed automata extended with costs on both edges and locations. When the costs act as stopwatches, we get stopwatch automata with the restriction that the stopwatches cannot be reset nor t...

Ontologies are a crucial tool for formally specifying the vocabulary and the concepts of agent platforms, so, to share information, agents that use different vocabularies must be able to translate data from one ontological framework to another. The treatment of uncertainty plays a key role in the ontology mapping, as the degree of overlapping between concepts can not be represented logically. T...

Weighted timed automata (WTA) model quantitative aspects of real-time systems like continuous consumption of memory, power or financial resources. They accept quantitative timed languages where every timed word is mapped to a value, e.g., a real number. In this paper, we prove a Nivat theorem for WTA which states that recognizable quantitative timed languages are exactly those which can be obta...