background: transient gene expression (tge) gained popularity over the last decade as a rapid method for the production of milligram to gram quantities of recombinant proteins for preclinical studies in biophama industry. thereby, the optimization of the tge technique for chinese hamster ovary (cho) as the dominant host for the production of biotherapeutics is of great interest to reach the val...

The gaining returns in line with risks is always a major concern for market play-ers. This study compared the selection of stock portfolios based on the strategy of buying and retaining winning stocks and the purchase strategy based on the level of investment risks. In this study, the two-step optimization algorithms NSGA-II and SPEA-II were used to optimize the stock portfolios. In order to de...

We employ local meta-models to enhance the efficiency of evolution strategies in the optimization of computationally expensive problems. The method involves the combination of second order local regression meta-models with the Covariance Matrix Adaptation Evolution Strategy. Experiments on benchmark problems demonstrate that the proposed meta-models have the potential to reliably account for th...

Several evolutionary approaches have been applied to global optimization problems with significant success. Evolution strategies proved to be efficient global optimizers. However, these algorithms have several parameters which the setting is not simple. Thus, it is crucial to investigate how to set dynamically these parameters during the search. In this paper, a new parameter-less evolution str...

An extension of the evolution strategy formixed-integer optimizationproblems is introduced. The resulting generalized evolution strategy is applied to the problem of optical multilayer coating design and the results are compared with results obtained by standard methods. The generalized evolution strategy as a synthesis method does not require the existence of a starting design, and it competes...

Evolution strategies (ES) are efficient optimization methods for continuous problems. However, many combinatorial optimization methods can not be represented by using continuous representations. The development of the network random key representation which represents trees by using real numbers allows one to use ES for combinatorial tree problems. In this paper we apply ES to tree problems usi...

This study further investigates the complete-basis-functions parameterization method (CBFP) for Evolution Strategies (ES), and its application to a challenging real-life high-dimensional physics optimization problem, namely Femtosecond Laser Pulse Shaping. The CBFP method, which was introduced recently for tackling efficiently the learning task of n-variables functions, is combined here, for th...

This paper proves that, for a normal membership conditional term rewriting system (MCTRS), (1) a reducible term has a needed redex if the MCTRS is nonoverlapping, and (2) whether a redex is nv-needed is decidable.

We study superdevelopments in the weak lambda calculus of Çaǧman and Hindley, a confluent variant of the standard weak lambda calculus in which reduction below lambdas is forbidden. In contrast to developments, a superdevelopment from a term M allows not only residuals of redexes in M to be reduced but also some newly created ones. In the lambda calculus there are three ways new redexes may be ...

A rewrite sequence is said to be outermost-fair if every outer-most redex occurrence is eventually eliminated. Outermost-fair rewriting is known to be (head-)normalising for almost orthogonal rewrite systems. In this paper we study (head-)normalisation for the larger class of weakly orthogonal rewrite systems. Normalisation is established and a counterexample against head-normalisation is provi...