Search results for "nimi"
showing 10 items of 596 documents
Nomi di piante e nomi di santi. San Giovanni nella lessicografia botanica siciliana
2022
A Mario Alinei si deve l’idea che alcune porzioni del lessico della nostra lingua siano più conservative di altre e che esse manifestino traccia, nelle circostanze più fortunate, delle diverse stratificazioni iconimiche prodottesi secolarmente. Il contributo rintraccia, nella lessicografia dialettale siciliana, i tipi lessicali legati alla agiofitonimia, concentrandosi in particolare sulle erbe dedicate a san Giovanni. Si propongono percorsi motivazionali anche alla luce di ipotesi etimologiche inedite.
Theoretical study on hydration of two particular diazanaphthalenes
2005
Abstract Cinnoline (1) and Phthalazine (2), diazanaphthalenes involved in certain biological reactions, have been studied computational with the purpose of comparing their protonation and covalent hydration mechanisms. Geometry optimizations of neutral, mono- and di-protonated cations and hydrated products were performed at HF, DFT/B3LYP levels of theory using 6-311G* basis set and single points energies were calculated at the MP2 level of theory using the same basis set. In agreement with experimental results, calculations predict a two-step mechanism resulting in a hydrated cation in which the OH of the water is located depending on the position of both nitrogen in the diazanaphthalene mo…
Hidden Markov random field model and Broyden–Fletcher–Goldfarb–Shanno algorithm for brain image segmentation
2018
International audience; Many routine medical examinations produce images of patients suffering from various pathologies. With the huge number of medical images, the manual analysis and interpretation became a tedious task. Thus, automatic image segmentation became essential for diagnosis assistance. Segmentation consists in dividing the image into homogeneous and significant regions. We focus on hidden Markov random fields referred to as HMRF to model the problem of segmentation. This modelisation leads to a classical function minimisation problem. Broyden-Fletcher-Goldfarb-Shanno algorithm referred to as BFGS is one of the most powerful methods to solve unconstrained optimisation problem. …
On Ibn Ezra's Procedure and Shapley Value
2014
We examine ibn Ezra's procedure (Rabinovitch 1973; O'Neill 1982) historically used to solve the Rights Arbitration problem in the general framework of bankruptcy problems. When the greatest claim is larger than or equal to the estate, the procedure is a maximal game (Aumann 2010). However, when the greatest claim is smaller than the estate, the axioms of efficiency (the whole estate is distributed) and satiation are difficult to satisfy simultaneously. We discuss both axioms to show that their importance and necessity are radically different. From then, for the part of the estate not covered by the greatest claim, we examine four possible procedures: the minimal overlap rule, Alcalde et al.…
Multiple solutions for parametric double phase Dirichlet problems
2020
We consider a parametric double phase Dirichlet problem. Using variational tools together with suitable truncation and comparison techniques, we show that for all parametric values [Formula: see text] the problem has at least three nontrivial solutions, two of which have constant sign. Also, we identify the critical parameter [Formula: see text] precisely in terms of the spectrum of the [Formula: see text]-Laplacian.
Epichristoffel Words and Minimization of Moore Automata
2014
This paper is focused on the connection between the combinatorics of words and minimization of automata. The three main ingredients are the epichristoffel words, Moore automata and a variant of Hopcroft's algorithm for their minimization. Epichristoffel words defined in [14] generalize some properties of circular sturmian words. Here we prove a factorization property and the existence of the reduction tree, that uniquely identifies the structure of the word. Furthermore, in the paper we investigate the problem of the minimization of Moore automata by defining a variant of Hopcroft's minimization algorithm. The use of this variant makes simpler the computation of the running time and consequ…
Transition Function Complexity of Finite Automata
2011
State complexity of finite automata in some cases gives the same complexity value for automata which intuitively seem to have completely different complexities. In this paper we consider a new measure of descriptional complexity of finite automata -- BC-complexity. Comparison of it with the state complexity is carried out here as well as some interesting minimization properties are discussed. It is shown that minimization of the number of states can lead to a superpolynomial increase of BC-complexity.
The Complexity of Probabilistic versus Quantum Finite Automata
2002
We present a language Ln which is recognizable by a probabilistic finite automaton (PFA) with probability 1 - ? for all ? > 0 with O(log2 n) states, with a deterministic finite automaton (DFA) with O(n) states, but a quantum finite automaton (QFA) needs at least 2?(n/log n) states.
Non-constructive Methods for Finite Probabilistic Automata
2007
Size (the number of states) of finite probabilistic automata with an isolated cut-point can be exponentially smaller than the size of any equivalent finite deterministic automaton. The result is presented in two versions. The first version depends on Artin's Conjecture (1927) in Number Theory. The second version does not depend on conjectures but the numerical estimates are worse. In both versions the method of the proof does not allow an explicit description of the languages used. Since our finite probabilistic automata are reversible, these results imply a similar result for quantum finite automata.
NON-CONSTRUCTIVE METHODS FOR FINITE PROBABILISTIC AUTOMATA
2008
Size (the number of states) of finite probabilistic automata with an isolated cut-point can be exponentially smaller than the size of any equivalent finite deterministic automaton. However, the proof is non-constructive. The result is presented in two versions. The first version depends on Artin's Conjecture (1927) in Number Theory. The second version does not depend on conjectures not proved but the numerical estimates are worse. In both versions the method of the proof does not allow an explicit description of the languages used. Since our finite probabilistic automata are reversible, these results imply a similar result for quantum finite automata.