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.展开更多
The new curriculum standard requires high school physics teaching to adhere to a more open teaching concept, adhere to the physics teaching to highlight the experimental ability, awaken students' thinking with pro...The new curriculum standard requires high school physics teaching to adhere to a more open teaching concept, adhere to the physics teaching to highlight the experimental ability, awaken students' thinking with problems, and cultivate students' ability to ask, explore and solve problems. Therefore, the problem is not only a clue that runs through physics teaching, but also a starting point to explore new knowledge. Problem-based teaching is an effective way to cultivate students' scientific thinking and scientific methods. High school physics teachers should use the problem chain as a guide in teaching practice, according to students' cognitive status, to stimulate students' interest in learning and exploring science, so as to more efficiently promote the development of students' core quality in physics.展开更多
The problem chain teaching method is a kind of teaching mode based on the problem consciousness guidance, which carries out the corresponding teaching activities through the interlocking problem design, guides the stu...The problem chain teaching method is a kind of teaching mode based on the problem consciousness guidance, which carries out the corresponding teaching activities through the interlocking problem design, guides the students to think deeply and explore with effective problems, and promotes the students' all-round development. Designing problem chains in the special teaching of "basic principles of Marxism" can effectively improve the teaching quality. The special teaching based on the problem chain design will help the "principle" class to become an ideological and political class with advanced "formula", "craftsmanship" exquisite, "packaging" fashion, and lead college students to establish a scientific world outlook, values and outlook on life. This paper focuses on the connotation, presentation and design of problem chains.展开更多
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.展开更多
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. .展开更多
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.展开更多
The biggest bottleneck in DNA computing is exponential explosion, in which the DNA molecules used as data in information processing grow exponentially with an increase of problem size. To overcome this bottleneck and ...The biggest bottleneck in DNA computing is exponential explosion, in which the DNA molecules used as data in information processing grow exponentially with an increase of problem size. To overcome this bottleneck and improve the processing speed, we propose a DNA computing model to solve the graph vertex coloring problem. The main points of the model are as follows： The exponential explosion prob- lem is solved by dividing subgraphs, reducing the vertex colors without losing the solutions, and ordering the vertices in subgraphs; and the bio-operation times are reduced considerably by a designed parallel polymerase chain reaction （PCR） technology that dramatically improves the processing speed. In this arti- cle, a 3-colorable graph with 61 vertices is used to illustrate the capability of the DNA computing model. The experiment showed that not only are all the solutions of the graph found, but also more than 99% of false solutions are deleted when the initial solution space is constructed. The powerful computational capability of the model was based on specific reactions among the large number of nanoscale oligonu- cleotide strands. All these tiny strands are operated by DNA self-assembly and parallel PCR. After thou- sands of accurate PCR operations, the solutions were found by recognizing, splicing, and assembling. We also prove that the searching capability of this model is up to 0（3^59）. By means of an exhaustive search, it would take more than 896 000 years for an electronic computer （5 x 10^14 s-1） to achieve this enormous task. This searching capability is the largest among both the electronic and non-electronic computers that have been developed since the DNA computing model was proposed by Adleman＇s research group in 2002 （with a searching capability of 0（2^20））.展开更多
We extend the classical newsvendor problem by introducing a downside risk constraint from the perspective of inventory control. At the beginning of a replenishment period the newsvendor will place an order, then he wi...We extend the classical newsvendor problem by introducing a downside risk constraint from the perspective of inventory control. At the beginning of a replenishment period the newsvendor will place an order, then he will review the inventory level at the end of the period. If the inventory level is positive then he will bear the holding cost and if the inventory level is negative then he will bear the backorder cost. The optimal order quantity has a simple form. We analyze the form of the optimal order quantity when we restrict that the probability that the cost level is larger than or equal to a fixed cost constant is less than a fixed value of probability. At last, we analyze the case that the fixed cost constant is equal to the expected cost.展开更多
文摘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.
文摘The new curriculum standard requires high school physics teaching to adhere to a more open teaching concept, adhere to the physics teaching to highlight the experimental ability, awaken students' thinking with problems, and cultivate students' ability to ask, explore and solve problems. Therefore, the problem is not only a clue that runs through physics teaching, but also a starting point to explore new knowledge. Problem-based teaching is an effective way to cultivate students' scientific thinking and scientific methods. High school physics teachers should use the problem chain as a guide in teaching practice, according to students' cognitive status, to stimulate students' interest in learning and exploring science, so as to more efficiently promote the development of students' core quality in physics.
文摘The problem chain teaching method is a kind of teaching mode based on the problem consciousness guidance, which carries out the corresponding teaching activities through the interlocking problem design, guides the students to think deeply and explore with effective problems, and promotes the students' all-round development. Designing problem chains in the special teaching of "basic principles of Marxism" can effectively improve the teaching quality. The special teaching based on the problem chain design will help the "principle" class to become an ideological and political class with advanced "formula", "craftsmanship" exquisite, "packaging" fashion, and lead college students to establish a scientific world outlook, values and outlook on life. This paper focuses on the connotation, presentation and design of problem chains.
文摘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.
文摘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. .
基金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.
基金The authors are grateful for the support from the National Natural Science Foundation of China （61632002, 61379059, and 61572046）.
文摘The biggest bottleneck in DNA computing is exponential explosion, in which the DNA molecules used as data in information processing grow exponentially with an increase of problem size. To overcome this bottleneck and improve the processing speed, we propose a DNA computing model to solve the graph vertex coloring problem. The main points of the model are as follows： The exponential explosion prob- lem is solved by dividing subgraphs, reducing the vertex colors without losing the solutions, and ordering the vertices in subgraphs; and the bio-operation times are reduced considerably by a designed parallel polymerase chain reaction （PCR） technology that dramatically improves the processing speed. In this arti- cle, a 3-colorable graph with 61 vertices is used to illustrate the capability of the DNA computing model. The experiment showed that not only are all the solutions of the graph found, but also more than 99% of false solutions are deleted when the initial solution space is constructed. The powerful computational capability of the model was based on specific reactions among the large number of nanoscale oligonu- cleotide strands. All these tiny strands are operated by DNA self-assembly and parallel PCR. After thou- sands of accurate PCR operations, the solutions were found by recognizing, splicing, and assembling. We also prove that the searching capability of this model is up to 0（3^59）. By means of an exhaustive search, it would take more than 896 000 years for an electronic computer （5 x 10^14 s-1） to achieve this enormous task. This searching capability is the largest among both the electronic and non-electronic computers that have been developed since the DNA computing model was proposed by Adleman＇s research group in 2002 （with a searching capability of 0（2^20））.
基金Supported by the National Natural Science Foundation of China (70471034, A0324666)
文摘We extend the classical newsvendor problem by introducing a downside risk constraint from the perspective of inventory control. At the beginning of a replenishment period the newsvendor will place an order, then he will review the inventory level at the end of the period. If the inventory level is positive then he will bear the holding cost and if the inventory level is negative then he will bear the backorder cost. The optimal order quantity has a simple form. We analyze the form of the optimal order quantity when we restrict that the probability that the cost level is larger than or equal to a fixed cost constant is less than a fixed value of probability. At last, we analyze the case that the fixed cost constant is equal to the expected cost.
