The core-based approach in multipoint communication broadens the solution space in terms of QoSefficiency of solutions in inter and intra-domain routing. In an earlier work [KH03a], we showed that the constrained cost minimization solutions in core-based approach proposed to date are restrictive in their search to a subrange of solutions, and we proposed SPAN, a generic framework to process in ...

The aim of this paper is to solve the portfolio problem when security returns are birandom variables. Two types of portfolio selection based on chance measure are provided according to birandom theory. Since the proposed optimization problems are difficult to solve by traditional methods, a hybrid intelligent algorithm by integrating birandom simulation and genetic algorithm is designed. Finall...

Let P,Q ⊆ R be two n-point multisets and Ar ≥ b be a set of λ inequalities on x and y, where A ∈ Rλ×2, r = [y ], and b ∈ R. Define the constrained Minkowski sum (P ⊕Q)Ar≥b as the multiset {(p + q)|p ∈ P, q ∈ Q,A(p + q) ≥ b}. Given P , Q, Ar ≥ b, an objective function f : R → R, and a positive integer k, the Minkowski Sum Selection Problem is to find the k largest objective value among all objec...

The aim of this study was to see in monkeys if neurons in dentate and lateral interposed deep cerebellar nuclei are preferentially active in relation to certain movements relative to others. Simple and compound digit movements were trained with digits, hand, and elbow constrained in a cast. The constrained simple movement was flexion of Thumb or Index; the constrained compound movement, flexion...