195 resultados para Bernoulli
Resumo:
In this paper, we present and apply a new three-dimensional model for the prediction of canopy-flow and turbulence dynamics in open-channel flow. The approach uses a dynamic immersed boundary technique that is coupled in a sequentially staggered manner to a large eddy simulation. Two different biomechanical models are developed depending on whether the vegetation is dominated by bending or tensile forces. For bending plants, a model structured on the Euler-Bernoulli beam equation has been developed, whilst for tensile plants, an N-pendula model has been developed. Validation against flume data shows good agreement and demonstrates that for a given stem density, the models are able to simulate the extraction of energy from the mean flow at the stem-scale which leads to the drag discontinuity and associated mixing layer.
Resumo:
We address the problem of scheduling a multiclass $M/M/m$ queue with Bernoulli feedback on $m$ parallel servers to minimize time-average linear holding costs. We analyze the performance of a heuristic priority-index rule, which extends Klimov's optimal solution to the single-server case: servers select preemptively customers with larger Klimov indices. We present closed-form suboptimality bounds (approximate optimality) for Klimov's rule, which imply that its suboptimality gap is uniformly bounded above with respect to (i) external arrival rates, as long as they stay within system capacity;and (ii) the number of servers. It follows that its relativesuboptimality gap vanishes in a heavy-traffic limit, as external arrival rates approach system capacity (heavy-traffic optimality). We obtain simpler expressions for the special no-feedback case, where the heuristic reduces to the classical $c \mu$ rule. Our analysis is based on comparing the expected cost of Klimov's ruleto the value of a strong linear programming (LP) relaxation of the system's region of achievable performance of mean queue lengths. In order to obtain this relaxation, we derive and exploit a new set ofwork decomposition laws for the parallel-server system. We further report on the results of a computational study on the quality of the $c \mu$ rule for parallel scheduling.
Resumo:
Several studies have reported high performance of simple decision heuristics multi-attribute decision making. In this paper, we focus on situations where attributes are binary and analyze the performance of Deterministic-Elimination-By-Aspects (DEBA) and similar decision heuristics. We consider non-increasing weights and two probabilistic models for the attribute values: one where attribute values are independent Bernoulli randomvariables; the other one where they are binary random variables with inter-attribute positive correlations. Using these models, we show that good performance of DEBA is explained by the presence of cumulative as opposed to simple dominance. We therefore introduce the concepts of cumulative dominance compliance and fully cumulative dominance compliance and show that DEBA satisfies those properties. We derive a lower bound with which cumulative dominance compliant heuristics will choose a best alternative and show that, even with many attributes, this is not small. We also derive an upper bound for the expected loss of fully cumulative compliance heuristics and show that this is moderateeven when the number of attributes is large. Both bounds are independent of the values ofthe weights.
Resumo:
Neste trabalho começamos por apresentar os problemas clássicos do cálculo das variações e controlo óptimo determinísticos, dando ênfase ás condições necessárias de optimalidade de Euler-Lagrange e Princípioípio do Máximo de Pontryagin (Capítulo 1). No Capítulo 2 demonstramos o Teorema de Noether do cálculo das variações e uma sua extensão ao controlo óptimo. Como exemplos de aplicação mencionamos as leis de conservação de momento e energia da mecânica, válidas ao longo das extremais de Euler-Lagrange ou das extremais de Pontryagin. Numa segunda parte do trabalho introduzimos o cálculo das variações estocástico (Capítulo 3) e demonstramos um teorema de Noether estocástico obtido recententemente por Jacky Cresson (Capítulo 4). O Capítulo 5 ´e dedicado á programação dinâmica: caso discreto e contínuo, caso determinístico e estocástico.
Resumo:
The problem of prediction is considered in a multidimensional setting. Extending an idea presented by Barndorff-Nielsen and Cox, a predictive density for a multivariate random variable of interest is proposed. This density has the form of an estimative density plus a correction term. It gives simultaneous prediction regions with coverage error of smaller asymptotic order than the estimative density. A simulation study is also presented showing the magnitude of the improvement with respect to the estimative method.
Resumo:
We consider the asymptotic behaviour of the realized power variation of processes of the form ¿t0usdBHs, where BH is a fractional Brownian motion with Hurst parameter H E(0,1), and u is a process with finite q-variation, q<1/(1¿H). We establish the stable convergence of the corresponding fluctuations. These results provide new statistical tools to study and detect the long-memory effect and the Hurst parameter.
Resumo:
In this note we prove an existence and uniqueness result for the solution of multidimensional stochastic delay differential equations with normal reflection. The equations are driven by a fractional Brownian motion with Hurst parameter H > 1/2. The stochastic integral with respect to the fractional Brownian motion is a pathwise Riemann¿Stieltjes integral.
Resumo:
We develop several results on hitting probabilities of random fields which highlight the role of the dimension of the parameter space. This yields upper and lower bounds in terms of Hausdorff measure and Bessel-Riesz capacity, respectively. We apply these results to a system of stochastic wave equations in spatial dimension k >- 1 driven by a d-dimensional spatially homogeneous additive Gaussian noise that is white in time and colored in space.
Resumo:
In a recent paper, Komaki studied the second-order asymptotic properties of predictive distributions, using the Kullback-Leibler divergence as a loss function. He showed that estimative distributions with asymptotically efficient estimators can be improved by predictive distributions that do not belong to the model. The model is assumed to be a multidimensional curved exponential family. In this paper we generalize the result assuming as a loss function any f divergence. A relationship arises between alpha connections and optimal predictive distributions. In particular, using an alpha divergence to measure the goodness of a predictive distribution, the optimal shift of the estimate distribution is related to alpha-covariant derivatives. The expression that we obtain for the asymptotic risk is also useful to study the higher-order asymptotic properties of an estimator, in the mentioned class of loss functions.
Resumo:
In this paper we establish the existence and uniqueness of a solution for different types of stochastic differential equation with random initial conditions and random coefficients. The stochastic integral is interpreted as a generalized Stratonovich integral, and the techniques used to derive these results are mainly based on the path properties of the Brownian motion, and the definition of the Stratonovich integral.
Resumo:
This paper is devoted to prove a large-deviation principle for solutions to multidimensional stochastic Volterra equations.
Resumo:
We prove a characterization of the support of the law of the solution for a stochastic wave equation with two-dimensional space variable, driven by a noise white in time and correlated in space. The result is a consequence of an approximation theorem, in the convergence of probability, for equations obtained by smoothing the random noise. For some particular classes of coefficients, approximation in the Lp-norm for p¿1 is also proved.