Search results for "formal languages"

Photoreceptors, lightness constancy and color vision.

1986

Mapping wordnets from the perspective of inter-lingual equivalence

2017

Mapping wordnets from the perspective of inter-lingual equivalence This paper explores inter-lingual equivalence from the perspective of linking two large lexico-semantic databases, namely the Princeton WordNet of English and the plWordnet ( pl. Slowosiec ) of Polish. Wordnets are built as networks of lexico-semantic relations between words and their meanings, and constitute a type of monolingual dictionary cum thesaurus. The development of wordnets for different languages has given rise to many wordnet linking projects (e.g. EuroWordNet, Vossen, 2002). Regardless of a linking method used, these projects require defining rules for establishing equivalence links between wordnet building bloc…

Contrasting the form and use of reformulation markers

2007

This article deals with the form and use of reformulation markers in research papers written in English, Spanish and Catalan. Considering the form and frequency of the markers, English papers tend to prefer simple fixed markers and include fewer reformulators than Spanish and Catalan. On the contrary, formal Catalan and Spanish papers include more markers, some of which are complex and allow for some structural variability. As for use, reformulation markers establish dynamic relationships between portions of discourse which can be identified in our corpus with expansion, reduction and permutation. The analysis of the corpus shows that English authors usually reformulate to add more informa…

A differential equation approach to implicit sweeping processes

2019

International audience; In this paper, we study an implicit version of the sweeping process. Based on methods of convex analysis, we prove the equivalence of the implicit sweeping process with a differential equation, which enables us to show the existence and uniqueness of the solution to the implicit sweeping process in a very general framework. Moreover, this equivalence allows us to give a characterization of nonsmooth Lyapunov pairs and invariance for implicit sweeping processes. The results of the paper are illustrated with two applications to quasistatic evolution variational inequalities and electrical circuits.

Semantic Word Error Rate for Sentence Similarity

2016

Sentence similarity measures have applications in several tasks, including: Machine Translation, Paraphrase Iden- tification, Speech Recognition, Question-answering and Text Summarization. However, measures designed for these tasks are aimed at assessing equivalence rather than resemblance, partly departing from human cognition of similarity. While this is reasonable for these activities, it hinders the applicability of sentence similarity measures to other tasks. We therefore propose a new sentence similarity measure specifically designed for resemblance evaluation, in order to cover these fields better. Experimental results are discussed.

A challenging family of automata for classical minimization algorithms

2010

In this paper a particular family of deterministic automata that was built to reach the worst case complexity of Hopcroft's state minimization algorithm is considered. This family is also challenging for the two other classical minimization algorithms: it achieves the worst case for Moore's algorithm, as a consequence of a result by Berstel et al., and is of at least quadratic complexity for Brzozowski's solution, which is our main contribution. It therefore constitutes an interesting family, which can be useful to measure the efficiency of implementations of well-known or new minimization algorithms.

An Analysis of Bilevel Linear Programming Solving Parameters Based on Factoraggregation Approach

2013

We introduce the notion of factoraggregation,which is a special construction of general aggregation operators, and apply it for an analysis of optimal solution parameters for bilevel linear programming problems. The aggregation observes lower level objective functions considering the classes of equivalence generated by an objective function on the upper level. The proposed method is illustrated with numerical and graphical examples.

Conformal equivalence of visual metrics in pseudoconvex domains

2017

We refine estimates introduced by Balogh and Bonk, to show that the boundary extensions of isometries between smooth strongly pseudoconvex domains in $\C^n$ are conformal with respect to the sub-Riemannian metric induced by the Levi form. As a corollary we obtain an alternative proof of a result of Fefferman on smooth extensions of biholomorphic mappings between pseudoconvex domains. The proofs are inspired by Mostow's proof of his rigidity theorem and are based on the asymptotic hyperbolic character of the Kobayashi or Bergman metrics and on the Bonk-Schramm hyperbolic fillings.

The Reconstruction of Polyominoes from Approximately Orthogonal Projections

2001

The reconstruction of discrete two-dimensional pictures from their projection is one of the central problems in the areas of medical diagnostics, computer-aided tomography, pattern recognition, image processing, and data compression. In this note, we determine the computational complexity of the problem of reconstruction of polyominoes from their approximately orthogonal projections. We will prove that it is NP-complete if we reconstruct polyominoes, horizontal convex polyominoes and vertical convex polyominoes. Moreover we will give the polynomial algorithm for the reconstruction of hv-convex polyominoes that has time complexity O(m3n3).

AC is Equivalent to the Coherence Principle. Corrigendum to my Paper "Induction Principles for Sets"

2009

Theorem 3.7 of [1] is corrected. Two coherence principles and the ultrafilter property for partial functions contained in a relation are formulated. The equivalence of the coherent principles with AC and the equivalence of the ultrafilter property with BPI is shown.