QCA implementation of a multichannel filter for image processing.
Quad-tree Based Finite Volume Method for Diffusion Equations with Application to SAR Imaged Filtering
In this paper we present a method to remove the noise by applying the Perona Malik algorithm working on an irregular computational grid. This grid is obtained with a quad-tree technique and is adapted to the image intensities—pixels with similar intensities can form large elements. We apply this algorithm to remove the speckle noise present in SAR images, i.e., images obtained by radars with a synthetic aperture enabling to increase their resolution in an electronic way. The presence of the speckle...
Qualitative reasoning in Bayesian networks.
Some probabilistic inference rules which can be compared with the inference rules of preferential logic are given and it will be shown how they work in graphical models, allowing qualitative plausible reasoning in Bayesian networks.
Quantitative Steinitz's Theorems with Applications to Multifingered Grasping.
Quantum coherent spaces and linear logic
Quantum Coherent Spaces were introduced by Girard as a quantum framework where to interpret the exponential-free fragment of Linear Logic. Aim of this paper is to extend Girard's interpretation to a subsystem of linear logic with bounded exponentials. We provide deduction rules for the bounded exponentials and, correspondingly, we introduce the novel notion of bounded exponentials of Quantum Coherent Spaces. We show that the latter provide a categorical model of our system. In order to do that,...
Quantum coherent spaces and linear logic
Quantum Coherent Spaces were introduced by Girard as a quantum framework where to interpret the exponential-free fragment of Linear Logic. Aim of this paper is to extend Girard's interpretation to a subsystem of linear logic with bounded exponentials. We provide deduction rules for the bounded exponentials and, correspondingly, we introduce the novel notion of bounded exponentials of Quantum Coherent Spaces. We show that the latter provide a categorical model of our system. In order to do that,...
Quantum computing.
Quantum finite automata with control language
Bertoni et al. introduced in Lect. Notes Comput. Sci.2710 (2003) 1–20 a new model of 1-way quantum finite automaton (1qfa) called 1qfa with control language (1qfc). This model, whose recognizing power is exactly the class of regular languages, generalizes main models of 1qfa's proposed in the literature. Here, we investigate some properties of 1qfc's. In particular, we provide algorithms for constructing 1qfc's accepting the inverse homomorphic images and quotients of languages accepted...
Quasi-completely right disjunctive languages.
Quasiconvex relaxation of multidimensional control problems with integrands f(t, ξ, v)
We prove a general relaxation theorem for multidimensional control problems of Dieudonné-Rashevsky type with nonconvex integrands f(t, ξ, v) in presence of a convex control restriction. The relaxed problem, wherein the integrand f has been replaced by its lower semicontinuous quasiconvex envelope with respect to the gradient variable, possesses the same finite minimal value as the original problem, and admits a global minimizer. As an application, we provide existence theorems for the image registration...
Quasiconvex relaxation of multidimensional control problems with integrands f(t, ξ, v)
We prove a general relaxation theorem for multidimensional control problems of Dieudonné-Rashevsky type with nonconvex integrands f(t, ξ, v) in presence of a convex control restriction. The relaxed problem, wherein the integrand f has been replaced by its lower semicontinuous quasiconvex envelope with respect to the gradient variable, possesses the same finite minimal value as the original problem, and admits a global minimizer. As an application, we provide existence theorems for the image registration...
Quasi-hierarchical evolution algorithm for flow assignment in survivable connection-oriented networks
The main objective of this paper is to develop an effective evolutionary algorithm (EA) for the path-assignment problem in survivable connection-oriented networks. We assume a single-link failure scenario, which is the most common and frequently reported failure event. Since the network flow is modeled as a non-bifurcated multicommodity flow, the discussed optimization problem is NP-complete. Thus, we develop an effective heuristic algorithm based on an evolutionary algorithm. The main novelty of...
Quasi-Optimal Range Searching in Spaces of Finite VC-Dimension.
Quasiperfect domination in triangular lattices
A vertex subset S of a graph G is a perfect (resp. quasiperfect) dominating set in G if each vertex v of G∖S is adjacent to only one vertex ( ∈ 1,2 vertices) of S. Perfect and quasiperfect dominating sets in the regular tessellation graph of Schläfli symbol 3,6 and in its toroidal quotients are investigated, yielding the classification of their perfect dominating sets and most of their quasiperfect dominating sets S with induced components of the form , where ν ∈ 1,2,3 depends only on S.
Quelles tuiles ! (Pavages apériodiques du plan et automates bidimensionnels)
La récente découverte des “quasicristaux” et leurs liens avec les pavages de Penrose ont entraîné un regain d'intérêt pour les pavages apériodiques du plan. Nous montrons ici que le pavage régulier de Robinson est engendré par un automate fini bidimensionnel, et qu'il donne une généralisation à deux dimensions du pliage de papier.
Quelques aspects du problème
Quelques langages algébriques
Quelques mots sur la droite projective réelle
Quelques problèmes d'informatique
Quelques problèmes logico-linguistiques