Search results for " Generalized"
showing 10 items of 87 documents
Daily streamlow prediction with uncertainty in ephemeral catchments using the GLUE methodology
2009
Abstract The Generalised Likelihood Uncertainty Estimation (GLUE) approach is presented here as a tool for estimating the predictive uncertainty of a rainfall–runoff model. The GLUE methodology allows to recognise the possible equifinality of different parameter sets and assesses the likelihood of a parameters set being acceptable simulator when model predictions are compared to observed field data. The results of the GLUE methodology depend greatly on the choice of the likelihood measure and on the choice of the threshold which determines if a parameters set is behavioural or not. Moreover the sampling size has a strong influence on the uncertainty assessment of the response of a rainfall–…
On general conditional prevision assessments
2009
In this paper we consider general conditional random quantities of the kind $X|Y$, where $X$ and $Y$ are finite discrete random quantities. Then, we introduce the notion of coherence for conditional prevision assessments on finite families of general conditional random quantities. Moreover, we give a compound prevision theorem and we examine the relation between the previsions of $X|Y$ and $Y|X$. Then, we give some results on random gains and, by a suitable alternative theorem, we obtain a characterization of coherence. We also propose an algorithm for the checking of coherence. Finally, we briefly examine the case of imprecise conditional prevision assessments by introducing the notions of…
Differential geometric LARS via cyclic coordinate descent method
2012
We address the problem of how to compute the coefficient path implicitly defined by the differential geometric LARS (dgLARS) method in a high-dimensional setting. Although the geometrical theory developed to define the dgLARS method does not need of the definition of a penalty function, we show that it is possible to develop a cyclic coordinate descent algorithm to compute the solution curve in a high-dimensional setting. Simulation studies show that the proposed algorithm is significantly faster than the prediction-corrector algorithm originally developed to compute the dgLARS solution curve.
New lower bounds for the minimum distance of generalized algebraic geometry codes
2013
Abstract In this paper, we give a new lower bound for generalized algebraic geometry codes with which we are able to construct some new linear codes having better parameters compared with the ones known in the literature. Moreover, we give a relationship between a family of generalized algebraic geometry codes and algebraic geometry codes. Finally, we propose a decoding algorithm for such a family.
Best proximity point theorems for rational proximal contractions
2013
Abstract We provide sufficient conditions which warrant the existence and uniqueness of the best proximity point for two new types of contractions in the setting of metric spaces. The presented results extend, generalize and improve some known results from best proximity point theory and fixed-point theory. We also give some examples to illustrate and validate our definitions and results. MSC:41A65, 46B20, 47H10.
Impact of common property (E.A.) on fixed point theorems in fuzzy metric spaces
2011
We observe that the notion of common property (E.A.) relaxes the required containment of range of one mapping into the range of other which is utilized to construct the sequence of joint iterates. As a consequence, a multitude of recent fixed point theorems of the existing literature are sharpened and enriched.
An Ecology and Economy Coupling Model. A global stationary state model for a sustainable economy in the Hamiltonian formalism
2020
Abstract The severity of the two deeply correlated crises, the environmental and the economic ones, needs to be faced also in theoretical terms; thus, the authors propose a model yielding a global “stationary state”, following the idea of a “steady-state economics” by Georgescu-Rogen and Herman Daly, by constructing only one dynamical system of ecological and economic coupled variables. This is possible resorting to the generalized Volterra model, that, translated in the Hamiltonian formalism and its Hamilton equations, makes possible to “conjugate” every pair of variables, one economic, the other one ecological, in describing the behavior in time of a unique dynamical system. Applying the …
Regular and singular pulse and front solutions and possible isochronous behavior in the short-pulse equation: Phase-plane, multi-infinite series and …
2014
In this paper we employ three recent analytical approaches to investigate the possible classes of traveling wave solutions of some members of a family of so-called short-pulse equations (SPE). A recent, novel application of phase-plane analysis is first employed to show the existence of breaking kink wave solutions in certain parameter regimes. Secondly, smooth traveling waves are derived using a recent technique to derive convergent multi-infinite series solutions for the homoclinic (heteroclinic) orbits of the traveling-wave equations for the SPE equation, as well as for its generalized version with arbitrary coefficients. These correspond to pulse (kink or shock) solutions respectively o…
Lightweight LCP construction for very large collections of strings
2016
The longest common prefix array is a very advantageous data structure that, combined with the suffix array and the Burrows-Wheeler transform, allows to efficiently compute some combinatorial properties of a string useful in several applications, especially in biological contexts. Nowadays, the input data for many problems are big collections of strings, for instance the data coming from "next-generation" DNA sequencing (NGS) technologies. In this paper we present the first lightweight algorithm (called extLCP) for the simultaneous computation of the longest common prefix array and the Burrows-Wheeler transform of a very large collection of strings having any length. The computation is reali…
Quasi conjunction, quasi disjunction, t-norms and t-conorms: Probabilistic aspects
2013
We make a probabilistic analysis related to some inference rules which play an important role in nonmonotonic reasoning. In a coherence-based setting, we study the extensions of a probability assessment defined on $n$ conditional events to their quasi conjunction, and by exploiting duality, to their quasi disjunction. The lower and upper bounds coincide with some well known t-norms and t-conorms: minimum, product, Lukasiewicz, and Hamacher t-norms and their dual t-conorms. On this basis we obtain Quasi And and Quasi Or rules. These are rules for which any finite family of conditional events p-entails the associated quasi conjunction and quasi disjunction. We examine some cases of logical de…