Search results for "Analysis of algorithms"
showing 10 items of 29 documents
Case-studies on average-case analysis for an elementary course on algorithms
1999
Average-case algorithm analysis is usually viewed as a tough subject by students in the first courses in computer science. Traditionally, these topics are fully developed in advanced courses with a clear mathematical orientation. The work presented here is not an alternative to this, rather, it presents the analysis of algorithms (and average-case in particular) adapted to the mathematical background of students in an elementary course on algorithms or programming by using two selected case-studies.
Three-circle method in the investigations of shapes of gas bubble clusters in two-phase flow
1991
We present an attempt of formulating a quantitative criterion for division into homogeneous and heterogeneous flow patterns basing on the probabilistic analysis of gas bubble distribution in the liquid
Motif patterns in 2D
2008
AbstractMotif patterns consisting of sequences of intermixed solid and don’t-care characters have been introduced and studied in connection with pattern discovery problems of computational biology and other domains. In order to alleviate the exponential growth of such motifs, notions of maximal saturation and irredundancy have been formulated, whereby more or less compact subsets of the set of all motifs can be extracted, that are capable of expressing all others by suitable combinations. In this paper, we introduce the notion of maximal irredundant motifs in a two-dimensional array and develop initial properties and a combinatorial argument that poses a linear bound on the total number of …
Reliability Analysis of a Controlled Stage-Constructed and Reinforced Embankment on Soft Ground Using 2D and 3D Models
2020
Geosynthetic reinforcement has become a very practical technique to improve geotechnical structure safety. In spite of improved soil behavior, structures are affected by uncertainties related to soil and reinforcement material properties. This paper aims to present a reliability analysis in order to take statistical information (uncertainties) into account in a safety analysis of reinforced embankments. The analysis was used in a case study on a controlled stage-constructed embankment on soft ground in order to investigate its probabilistic stability. Modeling was performed by commercial geotechnical software usage (GeoStudio and RocScience packs, SIGMA/W+SLOPE/W and SLIDE³, respectively) a…
Frequency Prediction of Functions
2012
Prediction of functions is one of processes considered in inductive inference. There is a "black box" with a given total function f in it. The result of the inductive inference machine F( ) is expected to be f(n+1). Deterministic and probabilistic prediction of functions has been widely studied. Frequency computation is a mechanism used to combine features of deterministic and probabilistic algorithms. Frequency computation has been used for several types of inductive inference, especially, for learning via queries. We study frequency prediction of functions and show that that there exists an interesting hierarchy of predictable classes of functions.
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.
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…
Average-case analysis in an elementary course on algorithms
1998
Average-case algorithm analysis is usually viewed as a tough subject by students in the first courses in Computer Science. Traditionally, these topics are fully developed in advanced courses with a clear mathematical orientation. The work presented here is not an alternative to this, but, it presents the analysis of algorithms (and average-case in particular) adapted to the mathematical background of students in an elementary course on Algorithms or Programming by using some specially selected examples.
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…
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.