Displaying 61 – 80 of 227

Showing per page

The formation of a tree leaf

Qinglan Xia (2007)

ESAIM: Control, Optimisation and Calculus of Variations

In this article, we build a mathematical model to understand the formation of a tree leaf. Our model is based on the idea that a leaf tends to maximize internal efficiency by developing an efficient transport system for transporting water and nutrients. The meaning of “the efficient transport system” may vary as the type of the tree leave varies. In this article, we will demonstrate that tree leaves have different shapes and venation patterns mainly because they have adopted different efficient...

The Friendship Theorem

Karol Pąk (2012)

Formalized Mathematics

In this article we prove the friendship theorem according to the article [1], which states that if a group of people has the property that any pair of persons have exactly one common friend, then there is a universal friend, i.e. a person who is a friend of every other person in the group

The impact of uncertain parameters on ratchetting trends in hypoplasticity

Chleboun, Jan, Runcziková, Judita, Krejčí, Pavel (2023)

Programs and Algorithms of Numerical Mathematics

Perturbed parameters are considered in a hypoplastic model of granular materials. For fixed parameters, the model response to a periodic stress loading and unloading converges to a limit state of strain. The focus of this contribution is the assessment of the change in the limit strain caused by varying model parameters.

The inverse carrier problem

Grant B. Gustafson, Miroslav Laitoch (2002)

Czechoslovak Mathematical Journal

The problem was motivated by Borůvka’s definitions of the carrier and the associated carrier. The inverse carrier problem is precisely defined and partially solved. Examples are given.

The inverse maximum flow problem considering l∞ norm

Adrian Deaconu (2008)

RAIRO - Operations Research

The problem is to modify the capacities of the arcs from a network so that a given feasible flow becomes a maximum flow and the maximum change of the capacities on arcs is minimum. A very fast O(m⋅log(n)) time complexity algorithm for solving this problem is presented, where m is the number of arcs and n is the number of nodes of the network. The case when both, lower and upper bounds of the flow can be modified so that the given feasible flow becomes a maximum flow is also discussed. The algorithm...

The island model as a Markov dynamic system

Robert Schaefer, Aleksander Byrski, Maciej Smołka (2012)

International Journal of Applied Mathematics and Computer Science

Parallel multi-deme genetic algorithms are especially advantageous because they allow reducing the time of computations and can perform a much broader search than single-population ones. However, their formal analysis does not seem to have been studied exhaustively enough. In this paper we propose a mathematical framework describing a wide class of island-like strategies as a stationary Markov chain. Our approach uses extensively the modeling principles introduced by Vose, Rudolph and their collaborators....

Currently displaying 61 – 80 of 227