We study the local convergence of critical Galton–Watson trees and Lévy under various conditionings. Assuming a very general monotonicity property on measurable functions random trees, we show that conditioned to have large function values always converge locally immortal trees. also derive ratio limit for satisfying property. Finally continuous-state branching processes, prove similar result.

Meta-heuristic algorithms inspired by the natural processes are part of the optimization algorithms that they have been considered in recent years, such as genetic algorithm, particle swarm optimization, ant colony optimization, Firefly algorithm. Recently, a new kind of evolutionary algorithm has been proposed that it is inspired by the human sociopolitical evolution process. This new algorith...

Contour, split and join trees can be defined as functors acting on the category of scalar fields, whose morphisms are value-preserving functions. The categorical definition provides a natural way to efficiently compute a variety of topological properties of all contours, sublevel or superlevel components in a scalar field. The result is a labeling of the contour, split or join tree and can be u...

The UCT (Upper Confidence Bounds applied to Trees) algorithm has allowed for significant improvements in a number of games, most notably the game of Go. Move groups is a modification that greatly reduces the branching factor at the cost of increased search depth and as such may be used to enhance the performance of UCT. From the results of the experiments, we conclude the general structure of g...

A rat skin preparation was developed to determine if the responses of the resistance vessels to local skin warming and cooling were abnormal in spontaneously hypertensive rats (SHR). A major advantage of this preparation is that all the skin resistance vessels from small arteries preceding the microcirculation to small arterioles can be studied by intravital microscopy techniques. An abdominal ...

A key feature of angiogenesis is directional control of endothelial cell (EC) morphogenesis and movement [1]. During angiogenic sprouting, endothelial "tip cells" directionally branch from existing vessels in response to biochemical cues such as VEGF or hypoxia and migrate and invade the surrounding extracellular matrix (ECM) in a process that requires ECM remodeling by matrix metalloproteases ...

A deterministic global optimization algorithm is proposed for locating the global minimum potentialenergy conformationsof oligopeptide chains. The ECEPP/3 detailed potential energy model is utilized to model the energetics of the atomic interactions. The minimization of the total potential energy is formulated on the set of peptide dihedral angles. Based on previous work on the microcluster and...

We propose a global optimization algorithm for stochastic nonlinear programs that uses a specialized spatial branch and bound (BB) strategy to exploit the nearly decomposable structure of the problem. In particular, at each node in the BB scheme, a lower bound is constructed by relaxing the so-called non-anticipativity constraints and an upper bound is constructed by fixing the first-stage vari...

We describe an algorithm, inspired by the biological behavior of ants, to efficiently determine intelligent moves and the genetic algorithm used to learn better strategies in a broad class of games. We present a class of games called Simple War Games that includes both deterministic and nondeterministic, perfect information, two-player, zero sum games. Simple War Games have a branching factor a...

In a team of multiple agents, the pursuance of a common goal is a defining characteristic. Since agents may have different capabilities, and effects of actions may be uncertain, a common goal can generally only be achieved through a careful cooperation between the different agents. In this work, we propose a novel two-stage planner that combines online planning at both team level and individual...