We continue to consider one of the cybernetic methods in biology related to the study of DNA chains. Exactly, we are considering the problem of reconstructing the distance matrix for DNA chains. Such a matrix is forme...We continue to consider one of the cybernetic methods in biology related to the study of DNA chains. Exactly, we are considering the problem of reconstructing the distance matrix for DNA chains. Such a matrix is formed on the basis of any of the possible algorithms for determining the distances between DNA chains, as well as any specific object of study. At the same time, for example, the practical programming results show that on an average modern computer, it takes about a day to build such a 30 × 30 matrix for mnDNAs using the Needleman-Wunsch algorithm;therefore, for such a 300 × 300 matrix, about 3 months of continuous computer operation is expected. Thus, even for a relatively small number of species, calculating the distance matrix on conventional computers is hardly feasible and the supercomputers are usually not available. Therefore, we started publishing our variants of the algorithms for calculating the distance between two DNA chains, then we publish algorithms for restoring partially filled matrices, i.e., the inverse problem of matrix processing. Previously, we used the method of branches and boundaries, but in this paper we propose to use another new algorithm for restoring the distance matrix for DNA chains. Our recent work has shown that even greater improvement in the quality of the algorithm can often be achieved without improving the auxiliary heuristics of the branches and boundaries method. Thus, we are improving the algorithms that formulate the greedy function of this method only. .展开更多
The construction of moral education in primary and secondary schools is facingmany dilemmas,such as formalism,passivity,task-type,Tacitus trap and new media interaction.There is a high degree of coupling between the p...The construction of moral education in primary and secondary schools is facingmany dilemmas,such as formalism,passivity,task-type,Tacitus trap and new media interaction.There is a high degree of coupling between the progressive,stepped and interlocking supply of Problem Chain mode and the demand of moral education construction in primary and secondary schools.Problem Chain mode is helpful to solve the problems of teaching content,teaching effects and educational object in moral education construction in primary and secondary schools.展开更多
A class of second-order two-point boundary value problem on a measure chain was considered. Under some suitable conditions, by using the Leggett-Williams fixed point theorem in an appropriate cone, the existence of at...A class of second-order two-point boundary value problem on a measure chain was considered. Under some suitable conditions, by using the Leggett-Williams fixed point theorem in an appropriate cone, the existence of at least three positive solutions to this nonlinear problem was obtained.展开更多
In this paper,a novel location inventory routing(LIR)model is proposed to solve cold chain logistics network problem under uncertain demand environment. The goal of the developed model is to optimize costs of location...In this paper,a novel location inventory routing(LIR)model is proposed to solve cold chain logistics network problem under uncertain demand environment. The goal of the developed model is to optimize costs of location,inventory and transportation.Due to the complex of LIR problem( LIRP), a multi-objective genetic algorithm(GA), non-dominated sorting in genetic algorithm Ⅱ( NSGA-Ⅱ) has been introduced. Its performance is tested over a real case for the proposed problems. Results indicate that NSGA-Ⅱ provides a competitive performance than GA,which demonstrates that the proposed model and multi-objective GA are considerably efficient to solve the problem.展开更多
文摘We continue to consider one of the cybernetic methods in biology related to the study of DNA chains. Exactly, we are considering the problem of reconstructing the distance matrix for DNA chains. Such a matrix is formed on the basis of any of the possible algorithms for determining the distances between DNA chains, as well as any specific object of study. At the same time, for example, the practical programming results show that on an average modern computer, it takes about a day to build such a 30 × 30 matrix for mnDNAs using the Needleman-Wunsch algorithm;therefore, for such a 300 × 300 matrix, about 3 months of continuous computer operation is expected. Thus, even for a relatively small number of species, calculating the distance matrix on conventional computers is hardly feasible and the supercomputers are usually not available. Therefore, we started publishing our variants of the algorithms for calculating the distance between two DNA chains, then we publish algorithms for restoring partially filled matrices, i.e., the inverse problem of matrix processing. Previously, we used the method of branches and boundaries, but in this paper we propose to use another new algorithm for restoring the distance matrix for DNA chains. Our recent work has shown that even greater improvement in the quality of the algorithm can often be achieved without improving the auxiliary heuristics of the branches and boundaries method. Thus, we are improving the algorithms that formulate the greedy function of this method only. .
文摘The construction of moral education in primary and secondary schools is facingmany dilemmas,such as formalism,passivity,task-type,Tacitus trap and new media interaction.There is a high degree of coupling between the progressive,stepped and interlocking supply of Problem Chain mode and the demand of moral education construction in primary and secondary schools.Problem Chain mode is helpful to solve the problems of teaching content,teaching effects and educational object in moral education construction in primary and secondary schools.
文摘A class of second-order two-point boundary value problem on a measure chain was considered. Under some suitable conditions, by using the Leggett-Williams fixed point theorem in an appropriate cone, the existence of at least three positive solutions to this nonlinear problem was obtained.
基金Natural Science Foundation of Shanghai,China(No.15ZR1401600)the Fundamental Research Funds for the Central Universities,China(No.CUSF-DH-D-2015096)
文摘In this paper,a novel location inventory routing(LIR)model is proposed to solve cold chain logistics network problem under uncertain demand environment. The goal of the developed model is to optimize costs of location,inventory and transportation.Due to the complex of LIR problem( LIRP), a multi-objective genetic algorithm(GA), non-dominated sorting in genetic algorithm Ⅱ( NSGA-Ⅱ) has been introduced. Its performance is tested over a real case for the proposed problems. Results indicate that NSGA-Ⅱ provides a competitive performance than GA,which demonstrates that the proposed model and multi-objective GA are considerably efficient to solve the problem.
