Search results for "PROBA"

showing 10 items of 3964 documents

Probabilistic Flood Hazard Mapping Using Bivariate Analysis Based on Copulas

2017

This study presents a methodology to extract probabilistic flood hazard maps in an area subject to flood risk, taking into account uncertainties in the definition of design hydrographs. Particularly, the authors present a new method to produce probabilistic inundation and flood hazard maps in which the hydrological input (i.e., synthetic flood design event) to a 2D hydraulic model has been obtained by using a bivariate statistical analysis (copulas) to generate flood peak discharges and volumes. This study also aims to quantify the contribution of boundary conditions’ uncertainty in order to evaluate the effect of this uncertainty source on probabilistic flood hazard mapping. Different comb…

Multivariate statisticsFlood myth0208 environmental biotechnologyCopula (linguistics)Settore ICAR/02 - Costruzioni Idrauliche E Marittime E IdrologiaProbabilistic logicHydrograph02 engineering and technologyBuilding and ConstructionBivariate analysisFlood Risk Mapping020801 environmental engineeringRisk managementFlood hazard mapping100-year floodStatisticsEconometricsEnvironmental scienceFlood risk and hazard mapping; Uncertainty analysis; Copula; Sicily.Uncertainty analysisSafety Risk Reliability and QualityUncertainty analysisCivil and Structural Engineering
researchProduct

Rejection odds and rejection ratios: A proposal for statistical practice in testing hypotheses

2016

Much of science is (rightly or wrongly) driven by hypothesis testing. Even in situations where the hypothesis testing paradigm is correct, the common practice of basing inferences solely on p-values has been under intense criticism for over 50 years. We propose, as an alternative, the use of the odds of a correct rejection of the null hypothesis to incorrect rejection. Both pre-experimental versions (involving the power and Type I error) and post-experimental versions (depending on the actual data) are considered. Implementations are provided that range from depending only on the p-value to consideration of full Bayesian analysis. A surprise is that all implementations -- even the full Baye…

Bayes' ruleFOS: Computer and information sciencesComputer sciencemedia_common.quotation_subjectBayesian probabilityBayesian01 natural sciencesArticle050105 experimental psychologyStatistical powerOddsMethodology (stat.ME)010104 statistics & probabilityFrequentist inferenceBayes factorsEconometrics0501 psychology and cognitive sciencesp-value0101 mathematicsFrequentistPsychology(all)General PsychologyStatistics - Methodologymedia_commonMathematicsStatistical hypothesis testingApplied Mathematics05 social sciencesBayes factorSurpriseOddsNull hypothesisType I and type II errorsJournal of Mathematical Psychology
researchProduct

Probabilistic Self-Localization and Mapping - An Asynchronous Multirate Approach

2008

[EN] In this paper, we present a set of robust and efficient algorithms with O(N) cost for the solution of the Simultaneous Localization And Mapping (SLAM) problem of a mobile robot. First, we introduce a novel object detection method, which is mainly based on multiple line fitting method for landmark detection with regular constrained angles. Second, a line-based pose estimation method is proposed, based on LeastSquares (LS). This method performs the matching of lines, providing the global pose estimation under assumption of known Data-Association. Finally, we extend the FastSLAM (FActored Solution To SLAM) algorithm for mobile robot self-localisation and mapping by considering the asynchr…

Computer scienceLinear systemProbabilistic logicProbabilisticKalman filterLinear-quadratic regulatorFilter (signal processing)FastSLAMLinear-quadratic-Gaussian controlLeast squaresINGENIERIA DE SISTEMAS Y AUTOMATICAComputer Science ApplicationsMappingControl and Systems EngineeringControl theoryLocalizationElectrical and Electronic EngineeringPoseMultirate fusionIEEE Robotics & Automation Magazine
researchProduct

Exploiting historical rainfall and landslide data in a spatial database for the derivation of critical rainfall thresholds

2017

Critical rainfall thresholds for landslides are powerful tools for preventing landslide hazard. The thresholds are commonly estimated empirically starting from rainfall events that triggered landslides in the past. The creation of the appropriate rainfall–landslide database is one of the main efforts in this approach. In fact, an accurate agreement between the landslide and rainfall information, in terms of location and timing, is essential in order to correctly estimate the rainfall–landslide relationships. A further issue is taking into account the average moisture conditions prior the triggering event, which reasonably may be crucial in determining the sufficient amount of precipitation.…

Antecedent rainfall condition010504 meteorology & atmospheric sciencesMeteorology0211 other engineering and technologiesSoil ScienceContext (language use)02 engineering and technologyRainfall–landslide database01 natural sciencesImage analysisEnvironmental ChemistryRainfall thresholds; Rainfall–landslide database; Image analysis; Antecedent rainfall conditions; Sicily; LithologyPrecipitationSicily0105 earth and related environmental sciencesEarth-Surface ProcessesWater Science and TechnologyEvent (probability theory)021110 strategic defence & security studiesGlobal and Planetary ChangeRainfall thresholdsSpatial databaseSettore ICAR/02 - Costruzioni Idrauliche E Marittime E IdrologiaAntecedent rainfall conditionsGeologyLandslideRainfall thresholdPollutionHazardRunoff modelLithologyHyetographImage analysiGeologyEnvironmental Earth Sciences
researchProduct

One-Pion Charm Baryon Transitions in a Relativistic Three-Quark Model

1998

We study one-pion transitions between charm baryon states in the framework of a relativistic three-quark model. We calculate the charm baryon-pion coupling factors that govern the S-wave, P-wave and D-wave one-pion transitions from the s-wave and the lowest lying p-wave charm baryon states down to the s-wave charm baryon states. For these we obtain: g_{\Sigma_c\Lambda_c\pi}=8.88 GeV^{-1}, f_{\Lambda_{c1}\Sigma_c\pi}=0.52 and f_{\Lambda_{c1}^*\Sigma_c\pi}=21.5 GeV^{-2}. We compare our rate predictions for the one-pion transitions with experimental results.

PhysicsNuclear and High Energy PhysicsParticle physicsQuark modelHigh Energy Physics::PhenomenologyNuclear TheorySigmaFOS: Physical sciencesAstrophysics::Cosmology and Extragalactic AstrophysicsLambdaCoupling (probability)BaryonHigh Energy Physics - PhenomenologyPionHigh Energy Physics - Phenomenology (hep-ph)High Energy Physics::ExperimentCharm (quantum number)Nuclear Experiment
researchProduct

Brownian dynamics simulations with hard-body interactions: Spherical particles

2012

A novel approach to account for hard-body interactions in (overdamped) Brownian dynamics simulations is proposed for systems with non-vanishing force fields. The scheme exploits the analytically known transition probability for a Brownian particle on a one-dimensional half-line. The motion of a Brownian particle is decomposed into a component that is affected by hard-body interactions and into components that are unaffected. The hard-body interactions are incorporated by replacing the affected component of motion by the evolution on a half-line. It is discussed under which circumstances this approach is justified. In particular, the algorithm is developed and formulated for systems with spa…

PhysicsNumerical analysisFOS: Physical sciencesGeneral Physics and AstronomyProteinsComputational Physics (physics.comp-ph)Condensed Matter - Soft Condensed MatterModels BiologicalDiffusionMotionProbability theoryModels ChemicalProtein Interaction MappingBrownian dynamicsSoft Condensed Matter (cond-mat.soft)Computer SimulationStatistical physicsColloidsPhysical and Theoretical ChemistryPhysics - Computational PhysicsBrownian motionAlgorithms
researchProduct

Choosing Optimal Seed Nodes in Competitive Contagion.

2019

International audience; In recent years there has been a growing interest in simulating competitive markets to find out the efficient ways to advertise a product or spread an ideology. Along this line, we consider a binary competitive contagion process where two infections, A and B, interact with each other and diffuse simultaneously in a network. We investigate which is the best centrality measure to find out the seed nodes a company should adopt in the presence of rivals so that it can maximize its influence. These nodes can be used as the initial spreaders or advertisers by firms when two firms compete with each other. Each node is assigned a price tag to become an initial advertiser whi…

Big Datagame theoryComputer scienceProcess (engineering)01 natural sciencescompetitive contagionMicroeconomics010104 statistics & probabilityArtificial IntelligenceNode (computer science)Computer Science (miscellaneous)seed nodes0101 mathematicsOriginal ResearchSmall numbercentrality measures010102 general mathematicsStochastic game[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]complex networksComplex networkProduct (business)CentralityGame theorycompetitive marketingInformation SystemsFrontiers in big data
researchProduct

Image classification based on 2D feature motifs

2013

The classification of raw data often involves the problem of selecting the appropriate set of features to represent the input data. In general, various features can be extracted from the input dataset, but only some of them are actually relevant for the classification process. Since relevant features are often unknown in real-world problems, many candidate features are usually introduced. This degrades both the speed and the predictive accuracy of the classifier due to the presence of redundancy in the candidate feature set. In this paper, we study the capability of a special class of motifs previously introduced in the literature, i.e. 2D irredundant motifs, when they are exploited as feat…

pattern discoveryContextual image classificationProbabilistic latent semantic analysisExploitComputer sciencebusiness.industryScale-invariant feature transformPattern recognitioncomputer.software_genreDigital imageComputingMethodologies_PATTERNRECOGNITIONclassificationimage analysisVisual WordArtificial intelligenceData miningbusinessClassifier (UML)computerImage compression
researchProduct

Literatura ovidiana (Ars Amandi y Reprobatio amoris) en la educación medieval

2004

La tradición de las obras ovidianas, sobre todo su Ars amandi y Reprobatio amoris, fueron una fuente inagotable de inspiración para gran parte de los autores medievales y renacentistas. Se analiza en este artículo las razones de su utilización como material docente en los siglos XII y XIII, y como se fusionaron ambos textos con la tradición cristiana (santos Padres de la Iglesia, autores monacales, etc.) y con la filosofía moral aristotélica, dando nuevos modelos de comportamiento amoroso. -canet@uv.es

Siglos XII y XIIIObras ovidianasObras ovidianas; Ars amandi; Reprobatio amoris; Educación medieval; Siglos XII y XIIIReprobatio amorisUNESCO::CIENCIAS DE LAS ARTES Y LAS LETRAS::Teoría análisis y crítica literariasArs amandiEducación medieval:CIENCIAS DE LAS ARTES Y LAS LETRAS::Teoría análisis y crítica literarias [UNESCO]
researchProduct

Self-stabilizing Balls & Bins in Batches

2016

A fundamental problem in distributed computing is the distribution of requests to a set of uniform servers without a centralized controller. Classically, such problems are modelled as static balls into bins processes, where m balls (tasks) are to be distributed to n bins (servers). In a seminal work, [Azar et al.; JoC'99] proposed the sequential strategy Greedy[d] for n = m. When thrown, a ball queries the load of d random bins and is allocated to a least loaded of these. [Azar et al.; JoC'99] showed that d=2 yields an exponential improvement compared to d=1. [Berenbrink et al.; JoC'06] extended this to m ⇒ n, showing that the maximal load difference is independent of m for d=2 (in contrast…

Mathematical optimizationMarkov chainSelf-stabilization0102 computer and information sciencesNew variantExpected value01 natural sciencesBinExponential functionCombinatorics010104 statistics & probability010201 computation theory & mathematicsTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYServerBall (bearing)0101 mathematicsMathematicsProceedings of the 2016 ACM Symposium on Principles of Distributed Computing
researchProduct