Search results for "Probabilistic analysis"

showing 10 items of 23 documents

A Probabilistic Analysis About the Concepts of Difficulty and Usefulness of a Molecular Ranking Classification

2013

Discerning between the concepts of difficulty and usefulness of a molecular ranking classification is of significant importance in virtual design chemistry. Here, both concepts are viewed from the statistical and practical point of view according to the standard definitions of enrichment and statistical significance p-values. These parameters are useful not only to compare distinct rankings obtained for the same molecular database, but also in order to compare the ones established in distinct molecular sets from an objective point of view.

Models StatisticalPoint (typography)Computer sciencebusiness.industryGeneral MedicineMachine learningcomputer.software_genrePharmaceutical PreparationsRankingDrug DesignDrug DiscoveryComputer-Aided DesignMolecular MedicineProbabilistic analysis of algorithmsArtificial intelligencebusinesscomputerAlgorithmsCurrent Computer Aided-Drug Design
researchProduct

Probabilistic Analysis of Non-Local 1-D Continuum under Random Load

2008

Non-Local Mechanics Probabilistic Analysis Random LoadsSettore ICAR/08 - Scienza Delle Costruzioni
researchProduct

Path Integral Methods for the Probabilistic Analysis of Nonlinear Systems Under a White-Noise Process

2020

Abstract In this paper, the widely known path integral method, derived from the application of the Chapman–Kolmogorov equation, is described in details and discussed with reference to the main results available in literature in several decades of contributions. The most simple application of the method is related to the solution of Fokker–Planck type equations. In this paper, the solution in the presence of normal, α-stable, and Poissonian white noises is first discussed. Then, application to barrier problems, such as first passage problems and vibroimpact problems is described. Further, the extension of the path integral method to problems involving multi-degrees-of-freedom systems is anal…

Nonlinear systemComputer scienceMechanical Engineering0103 physical sciencesPath integral formulationApplied mathematicsProbabilistic analysis of algorithmsWhite noiseSafety Risk Reliability and Quality010301 acoustics01 natural sciencesSafety Research010305 fluids & plasmasASCE-ASME J Risk and Uncert in Engrg Sys Part B Mech Engrg
researchProduct

A probabilistic rainfall model to estimate the leading-edge lifetime of wind turbine blade coating system

2021

Rain-induced leading-edge erosion of wind turbine blades is associated with high repair and maintenance costs. For efficient operation and maintenance, erosion models are required that provide estimates of blade coating lifetime at a real scale. In this study, a statistical rainfall model is established that describes probabilistic distributions of rain parameters that are critical for site-specific leading-edge erosion assessment. A new droplet size distribution (DSD) is determined based on two years’ onshore rainfall data of an inland site in the Netherlands and the obtained DSD is compared with those from the literature. Joint probability distribution functions of rain intensities and dr…

Probabilistic analysisScale (ratio)Turbine bladeMeteorologyRenewable Energy Sustainability and the EnvironmentProbabilistic logicLeading-edge erosionTurbineAnalytical methodWind speedWind turbine bladelaw.inventionVDP::Teknologi: 500Joint probability distributionlawErosionEnvironmental scienceProbabilistic analysis of algorithmsLong term analysis
researchProduct

Ultrametric Vs. Quantum Query Algorithms

2014

Ultrametric algorithms are similar to probabilistic algorithms but they describe the degree of indeterminism by p-adic numbers instead of real numbers. This paper introduces the notion of ultrametric query algorithms and shows an example of advantages of ultrametric query algorithms over deterministic, probabilistic and quantum query algorithms.

Quantum queryDegree (graph theory)Computer scienceComputer Science::Information RetrievalProbabilistic logicMathematics::General TopologyCondensed Matter::Disordered Systems and Neural NetworksIndeterminismMathematics::Metric GeometryProbabilistic analysis of algorithmsQuantum algorithmAlgorithmUltrametric spaceComputer Science::DatabasesMathematicsofComputing_DISCRETEMATHEMATICSReal number
researchProduct

Quantum query algorithms for certain functions and general algorithm construction techniques

2007

Quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given in a black box, but the aim is to compute function value for arbitrary input using as few queries as possible. In this paper we concentrate on quantum query algorithm designing tasks. The main aim of research was to find new efficient algorithms and develop general algorithm designing techniques. We present several exact quantum query algorithms for certain problems that are better than classical counterparts. Next we introduce algorithm transformation methods that allow significant enlarging of sets of exactly computable functions. Finally, we propose quantum algorithm designing methods. G…

Quantum sortComputable functionTheoretical computer scienceQuantum phase estimation algorithmAlgorithm designProbabilistic analysis of algorithmsQuantum algorithmQuantum informationAlgorithmQuantum computerMathematicsSPIE Proceedings
researchProduct

Non-stationary dynamic analysis of random structures via virtual distortion method

2009

Settore ICAR/08 - Scienza Delle CostruzioniProbabilistic Analysis Uncertain Structures Virtual Distortion Method Kronecker Algebra
researchProduct

Probabilistic analysis of truss structures with uncertain parameters (virtual distortion method approach)

2004

A new approach for probabilistic characterization of linear elastic redundant trusses with uncertainty on the various members subjected to deterministic loads acting on the nodes of the structure is presented. The method is based on the simple observation that variations of structural parameters are equivalent to superimposed strains on a reference structure depending on the axial forces on the elastic modulus of the original structure as well as on the uncertainty (virtual distortion method approach). Superposition principle may be applied to separate contribution to mechanical response due to external loads and parameter variations. Statically determinate trusses dealt with the proposed m…

Statically indeterminatebusiness.industryMechanical EngineeringLinear elasticityProbabilistic logicAerospace EngineeringTrussTruss structureOcean EngineeringStatistical and Nonlinear PhysicsAsymptotic expansionStructural engineeringCondensed Matter PhysicsVirtual distortion methodSuperposition principleNuclear Energy and EngineeringDistortionUncertain structureProbabilistic analysis of algorithmsbusinessAsymptotic expansionSafety Risk Reliability and QualityCivil and Structural EngineeringMathematics
researchProduct

A probabilistic condensed representation of data for stream mining

2014

Data mining and machine learning algorithms usually operate directly on the data. However, if the data is not available at once or consists of billions of instances, these algorithms easily become infeasible with respect to memory and run-time concerns. As a solution to this problem, we propose a framework, called MiDEO (Mining Density Estimates inferred Online), in which algorithms are designed to operate on a condensed representation of the data. In particular, we propose to use density estimates, which are able to represent billions of instances in a compact form and can be updated when new instances arrive. As an example for an algorithm that operates on density estimates, we consider t…

Task (computing)Association rule learningData stream miningSimple (abstract algebra)Computer scienceProbabilistic logicProbabilistic analysis of algorithmsAlgorithm designData miningRepresentation (mathematics)computer.software_genrecomputer2014 International Conference on Data Science and Advanced Analytics (DSAA)
researchProduct

Communication complexity in a 3-computer model

1996

It is proved that the probabilistic communication complexity of the identity function in a 3-computer model isO(√n).

Theoretical computer scienceGeneral Computer ScienceComputer scienceApplied MathematicsDivergence-from-randomness modelProbabilistic logicComputer Science ApplicationsProbabilistic CTLWorst-case complexityIdentity functionProbabilistic analysis of algorithmsPhysics::Chemical PhysicsCommunication complexityDecision tree modelAlgorithmica
researchProduct