Suppose two bounded subsets of IR are given. Parametrise the Minkowski combination of these sets by t. The Classical BrunnMinkowski Theorem asserts that the 1/n-th power of the volume of the convex combination is a concave function of t. A Brunn-Minkowski-style theorem is established for another geometric domain functional.

In this paper, we mainly consider the convolutions of slanted half-plane mappings and strip unit disk D. If f1 is a mapping f2 or mapping, then prove that * convex in some direction if locally univalent We also obtain two sufficient conditions for to be Our results extend many recent direction. Moreover, class harmonic including mappings, as consequence, any combination such sense-preserving co...

In this paper, the notion of $L$-convex fuzzy sublattices is introduced and their characterizations are given. Furthermore,  the notion of the degree to which an $L$-subset is an $L$-convex fuzzy sublattice is proposed and its some  characterizations are given. Besides, the $L$-convex fuzzy sublattice degrees of the homomorphic image and pre-image of an $L$-subset are studied. Finally, we obtai...

We define the inclusion certificate as a measure that expresses each point in the domain of a collection of functions as a convex combination of other points in the domain. Using inclusion certificates, we extend the convex extensions theory to enable simultaneous convexification of functions. We discuss conditions under which the domain of the functions can be reduced without affecting the sim...

Several computer algorithms for discovering patterns in groups of protein sequences are in use that are based on fitting the parameters of a statistical model to a group of related sequences. These include hidden Markov model (HMM) algorithms for multiple sequence alignment, and the MEME and Gibbs sampler algorithms for discovering motifs. These algorithms are sometimes prone to producing model...

In this paper we introduce a dynamic vehicle routing problem in which there are multiple vehicles and multiple priority classes of service demands. Service demands of each priority class arrive in the environment randomly over time and require a random amount of on-site service that is characteristic of the class. To service a demand, one of the vehicles must travel to the demand location and r...

We study the problem of asymptotic consensus as it occurs in a wide range of applications in both man-made and natural systems. In particular, we study systems with directed communication graphs that may change over time. We recently proposed a new family of convex combination algorithms in dimension one whose weights depend on the received values and not only on the communication topology. Her...

The recursive least squares (RLS)-type whitening algorithm is shown to be a useful solution for improving the convergence rate of the least mean square (LMS)-type whitening algorithm, but the RLStype algorithm with a constant forgetting factor requires a tradeoff between the convergence speed and steady-state misadjustment. By using a convex combination of two RLS algorithms with different forg...