conclusions it can be concluded that the rsm is an effective method for the optimization of recombinant protein expression using synthetic genes in e. coli. results the proposed optimum fermentation condition consisted of 7.81 g l-1 glucose, od 600 nm prior induction 1.66 and induction temperature of 30.27°c. the model prediction of 0.267 g l-1 of rhifn-β and 0.961 g l-1 of acetate at the optim...

in order to possibility of improving physiological traits, yield and yield components of safflower (carthamus tinctorius cv. sina) by anti-transpiration application in rainfed condition, a research was carried out in factorial based on randomized complete block design (rcdb) with three replications in miyaneh region (east azarbaijan province - iran) in 2011. the treatments antitranspirant rate ...

heterogeneous proton exchange membranes (pem) are synthesized using the dry phase inversion technique. the casting solutions are prepared by dispersing a finely ground cation exchange resin particle in n,n-dimethylacetamide (dmac) solution of polyvinyl-chloride (pvc). results show that ion exchange capacity is increased with the addition of 1 %-wt nanosilica (from 0.14 to 0.27 meq/g) while it i...

In the present paper the Dirichlet problem for semilinear elliptic and parabolic equations in general form is considered. New condition guaranteeing the global solvability of this problem for a wide class of superlinear sources, including e u and |u|p−1u , p > 1 , is formulated. For sublinear case (for example ln(1+ |u|) or |u|p−1u , p < 1) this condition is automatically fulfilled. Our approac...

This paper concerns on the fast and efficient solution of n × n symmetric ill conditioned Toeplitz systems T n (f)x = b, where the generating function f is a priori known, nonnegative real valued, having isolated roots of even order. The preconditioner setting that we propose is a product of a band Toeplitz matrix and matrices that belong to any trigonometric algebra. The proposed scheme tries ...

Let G be a graph of su¢ ciently large order n; and let the largest eigenvalue (G) of its adjacency matrix satis…es (G) > p bn2=4c: Then G contains a cycle of length t for every t n=320: This condition is sharp: the complete bipartite graph T2 (n) with parts of size bn=2c and dn=2e contains no odd cycles and its largest eigenvalue is equal to p bn2=4c: This condition is stable: if (G) is close t...