Rhododendron aureum Georgi is a perennial evergreen dwarf shrub that grows at all elevations within the alpine tundra of northern China. Previous research has investigated the plant communities of R. aureum; however, little information is available regarding interspecific competition and underground soil microbial community composition. The objective of our study was to determine whether the pr...

A front-fixing finite element method is developed for the valuation of American put options on zero-coupon bonds under a class of one-factor models of short interest rates. Numerical results are presented to examine our method and to compare it with the usual finite element method. A conjecture concerning the behavior of the early exercise boundary near the option expiration date is proposed ac...

Maintaining system stability is one of the most critical problems in power system. Mainly, the stability problems arise when any fault occurs in the system or due to sudden increase in the load power. Thus, to maintain the stability of the system, different types of controllers are used in the literature; among them FACTS controller plays a major role. Among the different types of FACTS control...

A complement (C)-dependent antiglobulin assay was utilized to determine the reactivity of non-C-fixing monoclonal antibodies (MoAb) with human granulocyte-macrophage progenitor cells (CFU-GM). The variables of the assay were analyzed with non-C-fixing MoAb against Ia antigens, including CR11-462, which recognizes the same (or spatially close) determinant identified by the C-fixing anti-Ia MoAb ...

L. Fejes Tóth [1] introduced the notion of fixing system for a compact, convex body M ⊂ Rn. Such a system F ⊂ bd M stabilizes M with respect to translations. In particular, every minimal fixing system F is primitive, i.e., no proper subset of F is a fixing system. In [2] lower and upper bounds for cardinalities of mimimal fixing systems are indicated. Here we give an improved lower bound and sh...

We introduce a new efficient method to solve the continuous quadratic knapsack problem. This is a highly structured quadratic program that appears in different contexts. The method converges after O(n) iterations with overall arithmetic complexity O(n2). Numerical experiments show that in practice the method converges in a small number of iterations with overall linear complexity, and is faster...