Search results for "randomness"

showing 10 items of 60 documents

Random Slicing: Efficient and Scalable Data Placement for Large-Scale Storage Systems

2014

The ever-growing amount of data requires highly scalable storage solutions. The most flexible approach is to use storage pools that can be expanded and scaled down by adding or removing storage devices. To make this approach usable, it is necessary to provide a solution to locate data items in such a dynamic environment. This article presents and evaluates the Random Slicing strategy, which incorporates lessons learned from table-based, rule-based, and pseudo-randomized hashing strategies and is able to provide a simple and efficient strategy that scales up to handle exascale data. Random Slicing keeps a small table with information about previous storage system insert and remove operations…

DesignComputer scienceDistributed computingPerformancestorage managementHash function0102 computer and information sciences02 engineering and technologyParallel computingUSable01 natural sciencesSlicingrandomized data distributionAffordable and Clean Energy0202 electrical engineering electronic engineering information engineeringRandomnessExperimentationscalabilityPseudorandom number generatorbusiness.industry020206 networking & telecommunicationsReliabilityData FormatPRNG010201 computation theory & mathematicsHardware and ArchitectureComputer data storageScalabilityTable (database)businessNetworking & Telecommunications
researchProduct

Introducing randomness in the analysis of chemical reactions: An analysis based on random differential equations and probability density functions

2021

[EN] In this work we consider a particular randomized kinetic model for reaction-deactivation of hydrogen peroxide decomposition. We apply the Random Variable Transformation technique to obtain the first probability density function of the solution stochastic process under general conditions. From the rst probability density function, we can obtain fundamental statistical information, such as the mean and the variance of the solution, at every instant time. The transformation considered in the application of the Random Variable Transformation technique is not unique. Then, the first probability density function can take different expressions, although essentially equivalent in terms of comp…

Differential equationComputational MechanicsRandom modelProbability density functionChemical reactionComputational MathematicsComputational Theory and MathematicsChemical kinetic modelRandom modelRandom variable transformation techniqueFirst probability density functionStatistical physicsMATEMATICA APLICADARandomnessMathematicsComputational and Mathematical Methods
researchProduct

Dimensions of random affine code tree fractals

2014

We calculate the almost sure Hausdorff dimension for a general class of random affine planar code tree fractals. The set of probability measures describing the randomness includes natural measures in random $V$-variable and homogeneous Markov constructions.

Discrete mathematicsCode (set theory)v-variable fractalsApplied MathematicsGeneral MathematicsProbability (math.PR)ta111Dynamical Systems (math.DS)self-similar setsTree (descriptive set theory)Box countingFractalIterated function systemMathematics - Classical Analysis and ODEsHausdorff dimensionClassical Analysis and ODEs (math.CA)FOS: MathematicsAffine transformationMathematics - Dynamical Systems28A80 60D05 37H99RandomnessMathematics - ProbabilityMathematics
researchProduct

Finite State Verifiers with Constant Randomness

2012

We give a new characterization of NL as the class of languages whose members have certificates that can be verified with small error in polynomial time by finite state machines that use a constant number of random bits, as opposed to its conventional description in terms of deterministic logarithmic-space verifiers. It turns out that allowing two-way interaction with the prover does not change the class of verifiable languages, and that no polynomially bounded amount of randomness is useful for constant-memory computers when used as language recognizers, or public-coin verifiers.

Discrete mathematicsFinite-state machine010102 general mathematics0102 computer and information sciencesGas meter prover01 natural sciencesRegular language010201 computation theory & mathematicsBounded functionProbabilistic automaton0101 mathematicsConstant (mathematics)Time complexityRandomnessMathematics
researchProduct

A novel hybrid model for air quality index forecasting based on two-phase decomposition technique and modified extreme learning machine.

2017

The randomness, non-stationarity and irregularity of air quality index (AQI) series bring the difficulty of AQI forecasting. To enhance forecast accuracy, a novel hybrid forecasting model combining two-phase decomposition technique and extreme learning machine (ELM) optimized by differential evolution (DE) algorithm is developed for AQI forecasting in this paper. In phase I, the complementary ensemble empirical mode decomposition (CEEMD) is utilized to decompose the AQI series into a set of intrinsic mode functions (IMFs) with different frequencies; in phase II, in order to further handle the high frequency IMFs which will increase the forecast difficulty, variational mode decomposition (VM…

EngineeringEnvironmental Engineering010504 meteorology & atmospheric sciencesSeries (mathematics)business.industryMode (statistics)010501 environmental sciences01 natural sciencesPollutionHilbert–Huang transformTest caseDifferential evolutionStatisticsEnvironmental ChemistrybusinessWaste Management and DisposalAir quality indexAlgorithmRandomness0105 earth and related environmental sciencesExtreme learning machineThe Science of the total environment
researchProduct

Cloudy with a Chance of Fuzzy: Building a Multicriteria Uncertainty Model for Construction Project Delivery Selection

2017

AbstractThe process of choosing a project delivery method is infused with cognitive uncertainties associated with the decision maker. Fuzzy uncertainties arise because of imprecise understanding and subsequent representation of these uncertainties by the decision maker, whereas random uncertainties arise from variance of these imprecisions. Since there are no well-defined rules for spontaneous decisions, in order to be consistently confident in the appropriateness of the chosen delivery method, a structured approach incorporating uncertainty is required. Previously unanswered questions such as (1) what are the sources of uncertainty in project delivery decisions, (2) how do decision makers …

EngineeringOperations researchManagement scienceIntegrated project deliverybusiness.industryProcess (engineering)0211 other engineering and technologies02 engineering and technologyVariance (accounting)Fuzzy logicComputer Science ApplicationsProcurementOrder (exchange)021105 building & construction0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingbusinessRepresentation (mathematics)RandomnessCivil and Structural EngineeringJournal of Computing in Civil Engineering
researchProduct

A probabilistic estimation and prediction technique for dynamic continuous social science models: The evolution of the attitude of the Basque Country…

2015

In this paper, a computational technique to deal with uncertainty in dynamic continuous models in Social Sciences is presented.Considering data from surveys,the method consists of determining the probability distribution of the survey output and this allows to sample data and fit the model to the sampled data using a goodness-of-fit criterion based the χ2-test. Taking the fitted parameters that were not rejected by the χ2-test, substituting them into the model and computing their outputs, 95% confidence intervals in each time instant capturing the uncertainty of the survey data (probabilistic estimation) is built. Using the same set of obtained model parameters, a prediction over …

FOS: Computer and information sciencesAttitude dynamicsProbabilistic predictionComputer sciencePopulationDivergence-from-randomness modelSample (statistics)computer.software_genreMachine Learning (cs.LG)Probabilistic estimationSocial scienceeducationProbabilistic relevance modeleducation.field_of_studyApplied MathematicsProbabilistic logicConfidence intervalComputer Science - LearningComputational MathematicsSocial dynamic modelsProbability distributionSurvey data collectionData miningMATEMATICA APLICADAcomputerApplied Mathematics and Computation
researchProduct

Finite state verifiers with constant randomness

2014

We give a new characterization of $\mathsf{NL}$ as the class of languages whose members have certificates that can be verified with small error in polynomial time by finite state machines that use a constant number of random bits, as opposed to its conventional description in terms of deterministic logarithmic-space verifiers. It turns out that allowing two-way interaction with the prover does not change the class of verifiable languages, and that no polynomially bounded amount of randomness is useful for constant-memory computers when used as language recognizers, or public-coin verifiers. A corollary of our main result is that the class of outcome problems corresponding to O(log n)-space …

FOS: Computer and information sciencesDiscrete mathematicsClass (set theory)Computer Science - Logic in Computer ScienceFinite-state machineGeneral Computer ScienceComputational Complexity (cs.CC)Binary logarithmLogic in Computer Science (cs.LO)Theoretical Computer ScienceComputer Science - Computational ComplexityBounded functionVerifiable secret sharingConstant (mathematics)Time complexityRandomnessMathematics
researchProduct

Diffusive energy growth in classical and quantum driven oscillators

1991

We study the long-time stability of oscillators driven by time-dependent forces originating from dynamical systems with varying degrees of randomness. The asymptotic energy growth is related to ergodic properties of the dynamical system: when the autocorrelation of the force decays sufficiently fast one typically obtains linear diffusive growth of the energy. For a system with good mixing properties we obtain a stronger result in the form of a central limit theorem. If the autocorrelation decays slowly or does not decay, the behavior can depend on subtle properties of the particular model. We study this dependence in detail for a family of quasiperiodic forces. The solution involves the ana…

Floquet theoryDynamical systems theoryStatistical and Nonlinear PhysicsQuantum chaossymbols.namesakeClassical mechanicsQuasiperiodic functionsymbolsHamiltonian (quantum mechanics)Mathematical PhysicsHarmonic oscillatorEigenvalues and eigenvectorsRandomnessMathematicsJournal of Statistical Physics
researchProduct

La relativité d’échelle dans la morphogenèse du vivant : fractal, déterminisme et hasard

2012

The Scale Relativity Theory has many biological applications from linear to non-linear and, from classical mechanics to quantum mechanics. Self-similar laws have been used as model for the description of a huge number of biological systems. Theses laws may explain the origin of basal life structures. Log-periodic behaviors of acceleration or deceleration can be applied to branching macroevolution, to the time sequences of major evolutionary leaps. The existence of such a law does not mean that the role of chance in evolution is reduced, but instead that randomness and contingency may occur within a framework which may itself be structured in a partly statistical way. The scale relativity th…

FractalScale relativitySurgeryBiological evolutionStatistical physicsMacroevolutionRandomnessMathematicsAnnales de Chirurgie Plastique Esthétique
researchProduct