Search results for "Data type"
showing 10 items of 1183 documents
Diffraction by m-bonacci gratings
2015
We present a simple diffraction experiment with m-bonacci gratings as a new interesting generalization of the Fibonacci ones. Diffraction by these nonconventional structures is proposed as a motivational strategy to introduce students to basic research activities. The Fraunhofer diffraction patterns are obtained with the standard equipment present in most undergraduate physics labs and are compared with those obtained with regular periodic gratings. We show that m-bonacci gratings produce discrete Fraunhofer patterns characterized by a set of diffraction peaks which positions are related to the concept of a generalized golden mean. A very good agreement is obtained between experimental and …
Testing the USLE-M family of models at the Sparacia experimental site in south Italy
2017
The modified Universal Soil Loss Equation (USLE-M) was empirically deduced by a statistical analysis of the original data set of soil loss measurements used to derive the Universal Soil Loss Equation (USLE). The USLE-M, including the effect of runoffin the event rainfall-runofferosivity factor, is characterized by a better capacity to predict event soil loss. At first, in this paper, using the soil erosion representative variables of USLE-M and the reference condition adopted in the USLE, the dimensional analysis and the self-similarity theory are applied to theoretically deduce a multiplicative equation similar to the USLE-M. Then using the database of the Sparacia experimental site, the a…
Multiple solutions for a Dirichlet problem with p-Laplacian and set-valued nonlinearity
2008
AbstractThe existence of a negative solution, of a positive solution, and of a sign-changing solution to a Dirichlet eigenvalue problem with p-Laplacian and multi-valued nonlinearity is investigated via sub- and supersolution methods as well as variational techniques for nonsmooth functions.
A function whose graph has positive doubling measure
2014
We show that a doubling measure on the plane can give positive measure to the graph of a continuous function. This answers a question by Wang, Wen and Wen. Moreover we show that the doubling constant of the measure can be chosen to be arbitrarily close to the doubling constant of the Lebesgue measure.
Planar maps whose second iterate has a unique fixed point
2007
Let a>0, F: R^2 -> R^2 be a differentiable (not necessarily C^1) map and Spec(F) be the set of (complex) eigenvalues of the derivative F'(p) when p varies in R^2. (a) If Spec(F) is disjoint of the interval [1,1+a[, then Fix(F) has at most one element, where Fix(F) denotes the set of fixed points of F. (b) If Spec(F) is disjoint of the real line R, then Fix(F^2) has at most one element. (c) If F is a C^1 map and, for all p belonging to R^2, the derivative F'(p) is neither a homothety nor has simple real eigenvalues, then Fix(F^2) has at most one element, provided that Spec(F) is disjoint of either (c1) the union of the number 0 with the intervals ]-\infty, -1] and [1,\infty[, or (c2) t…
Approximate fixed points of set-valued mapping in b-metric space
2016
We establish existence results related to approximate fixed point property of special types of set-valued contraction mappings, in the setting of b-metric spaces. As consequences of the main theorem, we give some fixed point results which generalize and extend various fixed point theorems in the existing literature. A simple example illustrates the new theory. Finally, we apply our results to establishing the existence of solution for some differential and integral problems.
Combinatorial isomorphism between Fibonacci classes
2008
Abstract In 1985 Simion and Schmidt showed that the set S n (T 3) of length n permutations avoiding the set of patterns T 3={123, 132, 213} is counted by (the second order) Fibonacci numbers. They also presented a constructive bijection between the set F n–1 of length (n–1) binary strings with no two consecutive 1s and S n (T 3). In 2005, Egge and Mansour generalized the first Simion-Simion’s result and showed that S n (T p ), the set of permutations avoiding the patterns T p ={12…p, 132, 213}, is counted by the (p–1)th order Fibonacci numbers. In this paper we extend the second Simion-Schmidt’s result by giving a bijection between the set of length (n–1) binary strings with no (p–1) consec…
Criteria for the solubility and non-simplicity of finite groups
2005
Abstract Some criteria of the non-simplicity of a finite group by graph theoretical terms are derived. This is then used to establish conditions under which a finite group is soluble.
Potential approach in marginalizing Gibbs models
1999
Abstract Given an undirected graph G or hypergraph potential H model for a given set of variables V , we introduce two marginalization operators for obtaining the undirected graph G A or hypergraph H A associated with a given subset A ⊂ V such that the marginal distribution of A factorizes according to G A or H A , respectively. Finally, we illustrate the method by its application to some practical examples. With them we show that potential approach allow defining a finer factorization or performing a more precise conditional independence analysis than undirected graph models. Finally, we explain connections with related works.
A bijection between words and multisets of necklaces
2012
Two of the present authors have given in 1993 a bijection Phi between words on a totally ordered alphabet and multisets of primitive necklaces. At the same time and independently, Burrows and Wheeler gave a data compression algorithm which turns out to be a particular case of the inverse of Phi. In the present article, we show that if one replaces in Phi the standard permutation of a word by the co-standard one (reading the word from right to left), then the inverse bijection is computed using the alternate lexicographic order (which is the order of real numbers given by continued fractions) on necklaces, instead of the lexicographic order as for Phi(-1). The image of the new bijection, ins…