Search results for "NUMBER"
showing 10 items of 3939 documents
On the suffix automaton with mismatches
2007
International audience; In this paper we focus on the construction of the minimal deterministic finite automaton S_k that recognizes the set of suffixes of a word w up to k errors. We present an algorithm that makes use of S_k in order to accept in an efficient way the language of all suffixes of w up to k errors in every window of size r, where r is the value of the repetition index of w. Moreover, we give some experimental results on some well-known words, like prefixes of Fibonacci and Thue-Morse words, and we make a conjecture on the size of the suffix automaton with mismatches.
Vecchi e nuovi problemi in tema di intervento dei creditori nell’esecuzione (note a margine di Cass. S.U. n. 61 del 7 gennaio 2014)
2015
Nel contributo in oggetto l'autore, muovendo dalla decisione delle Sezioni Unite della Cassazione n. 61 del 7 gennaio 2014, coglie l'occasione per riesaminare le vecchie e nuove problematiche sottese all’intervento dei creditori nel processo esecutivo. Il primo tema affrontato è quello della par condicio creditorum, che viene esaminata nella sua storia evolutiva dal Code Napoleon, al suo periodo di massima estensione, dato dal codice del 1940, fino al suo ridimensionamento a seguito delle riforme del 2005. Esamina quindi la possibilità del possibile superamento quoad effectum della distinzione tra intervento di creditori con titolo e senza titolo, alla luce delle evoluzioni della giurisprud…
The b-chromatic number of power graphs
2003
The b-chromatic number of a graph G is defined as the maximum number k of colors that can be used to color the vertices of G, such that we obtain a proper coloring and each color i, with 1 ≤ i≤ k, has at least one representant x_i adjacent to a vertex of every color j, 1 ≤ j ≠ i ≤ k. In this paper, we discuss the b-chromatic number of some power graphs. We give the exact value of the b-chromatic number of power paths and power complete binary trees, and we bound the b-chromatic number of power cycles.
New high-sensitivity searches for neutrons converting into antineutrons and/or sterile neutrons at the HIBEAM/NNBAR experiment at the European Spalla…
2021
Abstract The violation of baryon number, B , is an essential ingredient for the preferential creation of matter over antimatter needed to account for the observed baryon asymmetry in the Universe. However, such a process has yet to be experimentally observed. The HIBEAM/NNBAR program is a proposed two-stage experiment at the European Spallation Source to search for baryon number violation. The program will include high-sensitivity searches for processes that violate baryon number by one or two units: free neutron–antineutron oscillation ( n → n ̄ ) via mixing, neutron–antineutron oscillation via regeneration from a sterile neutron state ( n → [ n ′ , n ̄ ′ ] → n ̄ ), and neutron disappearan…
Protection intellectuelle de la base de données «Microsol database ©»
2011
Ce document n'est pas un brevet. Certificat délivré par l' Agence pour la Protection des Programmes. Support CD-ROM. N°adhérent: 87.75.4 Logibox conservé par l'adhérent: 67757. Protection intellectuelle de la plateforme GenoSol qui permettra d’avoir un référentiel de la biodiversité microbienne des sols
A simulation function approach for best proximity point and variational inequality problems
2017
We study sufficient conditions for existence of solutions to the global optimization problem min(x is an element of A) d(x, fx), where A, B are nonempty subsets of a metric space (X, d) and f : A -> B belongs to the class of proximal simulative contraction mappings. Our results unify, improve and generalize various comparable results in the existing literature on this topic. As an application of the obtained theorems, we give some solvability theorems of a variational inequality problem.
Normal, Abby Normal, Prefix Normal
2014
A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present results about the number \(\textit{pnw}(n)\) of prefix normal words of length n, showing that \(\textit{pnw}(n) =\Omega\left(2^{n - c\sqrt{n\ln n}}\right)\) for some c and \(\textit{pnw}(n) = O \left(\frac{2^n (\ln n)^2}{n}\right)\). We introduce efficient algorithms for testing the prefix normal property and a “mechanical algorithm” for computing prefix normal forms. We also include games which can be played with prefix normal words. In these games Alice wishes t…
Pseudo-Planar Organic Heterojunctions by Sequential Printing of Quasi-Miscible Inks
2021
This work deals with the interfacial mixing mechanism of picoliter (pL)-scale droplets produced by sequential inkjet printing of organic-based inks onto ITO/PET surfaces at a moderately high Weber number (~101). Differently from solution dispensing processes at a high Bond number such as spin coating, the deposition by inkjet printing is strictly controlled by droplet velocity, ink viscosity, and surface tension. In particular, this study considers the interfacial mixing of droplets containing the most investigated donor/acceptor couple for organic solar cells, i.e., poly(3-hexylthiophene) (P3HT) and (6,6)-phenyl-C61-butyric acid methyl ester (PCBM), showing how low-viscosity and low-surfac…
Convergence Analysis of Distributed Set-Valued Information Systems
2016
This paper focuses on the convergence of information in distributed systems of agents communicating over a network. The information on which the convergence is sought is not rep- resented by real numbers, as often in the literature, rather by sets. The dynamics of the evolution of information across the net- work is accordingly described by set-valued iterative maps. While the study of convergence of set-valued iterative maps is highly complex in general, this paper focuses on Boolean maps, which are comprised of arbitrary combinations of unions, intersections, and complements of sets. For these important class of systems, we provide tools to study both global and local convergence. A distr…
A branch-and-cut algorithm for the Team Orienteering Problem
2017
The Team Orienteering Problem aims at maximizing the total amount of profit collected by a fleet of vehicles while not exceeding a predefined travel time limit on each vehicle. In the last years, several exact methods based on different mathematical formulations were proposed. In this paper, we present a new two-index formulation with a polynomial number of variables and constraints. This compact formulation, reinforced by connectivity constraints, was solved by means of a branch-and-cut algorithm. The total number of instances solved to optimality is 327 of 387 benchmark instances, 26 more than any previous method. Moreover, 24 not previously solved instances were closed to optimality.