Results 231 to 240 of about 11,402,368 (291)
The Mathematical Intelligencer, 2015 This is an elementary article which has its origins in a lecture given to high-school students. It begins with a discussion of the discrete mean value property for functions defined on an integer lattice, and connections with random walks and the discrete Dirichlet problem.
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2002
This paper treats a practical problem that arises in the area of stochastic process algebras. The problem is the efficient computation of the mean value of the maximum of phase-type distributed random variables. The maximum of phase-type distributed random variables is again phase-type distributed, however, its representation grows exponentially in the
Bohnenkamp, Henrik, Haverkort, Boudewijn
openaire +1 more source
This paper treats a practical problem that arises in the area of stochastic process algebras. The problem is the efficient computation of the mean value of the maximum of phase-type distributed random variables. The maximum of phase-type distributed random variables is again phase-type distributed, however, its representation grows exponentially in the
Bohnenkamp, Henrik, Haverkort, Boudewijn
openaire +1 more source
Means and the mean value theorem
International Journal of Mathematical Education in Science and Technology, 2009Let I be a real interval. We call a continuous function μ : I × I → ℝ a proper mean if it is symmetric, reflexive, homogeneous, monotonic and internal. Let f : I → ℝ be a differentiable and strictly convex or strictly concave function. If a, b ∈ I with a ≠ b, then there exists a unique number ξ between a and b such that f(b) − f(a) = f ′(ξ)(b − a).
Jorma K. Merikoski +2 more
openaire +1 more source
International Journal of Shape Modeling, 2006
Summary: Geometry editing operations commonly use mesh encodings which capture the shape properties of the models. Given modified positions for a set of anchor vertices, the encoding is used to compute the positions for the rest of the mesh vertices, preserving the model shape as much as possible.
Vladislav Kraevoy, Alla Sheffer
openaire +2 more sources
Summary: Geometry editing operations commonly use mesh encodings which capture the shape properties of the models. Given modified positions for a set of anchor vertices, the encoding is used to compute the positions for the rest of the mesh vertices, preserving the model shape as much as possible.
Vladislav Kraevoy, Alla Sheffer
openaire +2 more sources
Computer Aided Geometric Design, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2010
This chapter presents the technique to determine mean performance characteristics of queueing models, generally known as mean value analysis (MVA). The term MVA is usually associated with queueing networks (QNs). However, the MVA techniqueis also very powerful when studying single-station queueing models.
Adan, I.J.B.F., Wal, van der, J.
openaire +1 more source
This chapter presents the technique to determine mean performance characteristics of queueing models, generally known as mean value analysis (MVA). The term MVA is usually associated with queueing networks (QNs). However, the MVA techniqueis also very powerful when studying single-station queueing models.
Adan, I.J.B.F., Wal, van der, J.
openaire +1 more source
SIAM Journal on Mathematical Analysis, 1977
We find the best possible constants $K_i = K_i (\varphi )$, $i = 1,2$, for inequalities of the kind \[f(t)\int_0^t {\varphi (f(s))ds \leqq K_i \varphi (f(t))} \int_0^t {f(s)ds} \] when $\varphi $ is a given positive function, valid for all functions f such that $f(0) = 0$ and either $(i = 2)f$ is increasing and convex, or $(i = 2)f$ is increasing.
openaire +2 more sources
We find the best possible constants $K_i = K_i (\varphi )$, $i = 1,2$, for inequalities of the kind \[f(t)\int_0^t {\varphi (f(s))ds \leqq K_i \varphi (f(t))} \int_0^t {f(s)ds} \] when $\varphi $ is a given positive function, valid for all functions f such that $f(0) = 0$ and either $(i = 2)f$ is increasing and convex, or $(i = 2)f$ is increasing.
openaire +2 more sources
Ukrainian Mathematical Journal, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources