Four peptides PSPP1,PSPP2,PSPP3 and PSPP4 were purified from the water-extract of Papaver somniferum pollen.Their sequences,with 21,17,13 and 16 amino acid residues respectively,have been determined by Edman degradati...Four peptides PSPP1,PSPP2,PSPP3 and PSPP4 were purified from the water-extract of Papaver somniferum pollen.Their sequences,with 21,17,13 and 16 amino acid residues respectively,have been determined by Edman degradation-N-terminal dansylation.PSPP2, PSPP3 and PSPP4 were synthesized using solid phase method.The immunopromotive activities of PSPP1,PSPP2,PSPP3,PSPP4 and the initially separated sample PSPP have been also observed by the methods of counting erythrocyte rosette forming cells(ERFC) and T-lymphocyte transformation test in vitro.展开更多
Based on stochastic optimization strategy, a formulation methodology is proposed for synthesizing distillation column sequences, allowing more than one middle component as the distributing components between a pair of...Based on stochastic optimization strategy, a formulation methodology is proposed for synthesizing distillation column sequences, allowing more than one middle component as the distributing components between a pair of key components in the non-sharp split. In order to represent and manipulate the distillation configuration structures, a new coding procedure is proposed in the form of one-dimensional array. Theoretically, an array can represent any kind of split(non-sharp and sharp). With the application of a binary sort tree approach, a robust flow sheet encoding and decoding procedure is developed so that the problem formulation and solution becomes tractable. In this paper,the synthesis problem is formulated as a mixed-integer nonlinear programming(MINLP) problem and an improved simulated annealing approach is adopted to solve the optimization problem. Besides, a shortcut method is applied to the evaluation of all required design parameters as well as the total function.展开更多
In this paper, by combining a stochastic optimization method with a refrigeration shaft work targeting method,an approach for the synthesis of a heat integrated complex distillation system in a low-temperature process...In this paper, by combining a stochastic optimization method with a refrigeration shaft work targeting method,an approach for the synthesis of a heat integrated complex distillation system in a low-temperature process is presented. The synthesis problem is formulated as a mixed-integer nonlinear programming(MINLP) problem,which is solved by simulated annealing algorithm under a random procedure to explore the optimal operating parameters and the distillation sequence structure. The shaft work targeting method is used to evaluate the minimum energy cost of the corresponding separation system during the optimization without any need for a detailed design for the heat exchanger network(HEN) and the refrigeration system(RS). The method presented in the paper can dramatically reduce the scale and complexity of the problem. A case study of ethylene cold-end separation is used to illustrate the application of the approach. Compared with the original industrial scheme, the result is encouraging.展开更多
The emergence and development of sequencing and DNA synthesis techniques have empowered us with the ability to read and write genomes,thereby enhancing our understanding and manipulation of biological processes.Over t...The emergence and development of sequencing and DNA synthesis techniques have empowered us with the ability to read and write genomes,thereby enhancing our understanding and manipulation of biological processes.Over the past two decades,numerous genomes ranging from kilobase-sized viruses to megabase-sized bacteria and yeast chromosomes have been artificially synthesized[1].Notably,the Synthetic Yeast Genome Project(Sc2.0)has successfully constructed all the chromosomes of Saccharomyces cerevisiae,with a strain containing 7.5 synthetic chromosomes also being generated[2–11].It is anticipated that collaborative efforts among scientists worldwide will soon lead to the creation of the first eukaryotic cell harboring a fully synthesized genome.Furthermore,synthetic genomes for higher eukaryotes are also emerging,as exemplified by the ongoing initial phase of the Synthetic Moss Genome Project(Syn-Moss)[12].展开更多
This paper provides a fast algorithm for Grobner bases of homogenous ideals of F[x, y] over a finite field F. We show that only the S-polynomials of neighbor pairs of a strictly ordered finite homogenours generating s...This paper provides a fast algorithm for Grobner bases of homogenous ideals of F[x, y] over a finite field F. We show that only the S-polynomials of neighbor pairs of a strictly ordered finite homogenours generating set are needed in the computing of a Grobner base of the homogenous ideal. It reduces dramatically the number of unnecessary S-polynomials that are processed. We also show that the computational complexity of our new algorithm is O(N2), where N is the maximum degree of the input generating polynomials. The new algorithm can be used to solve a problem of blind recognition of convolutional codes. This problem is a new generalization of the important problem of synthesis of a linear recurring sequence.展开更多
This paper provides a fast algorithm for Grobnerbases of homogenous ideals of F[x, y] over a finite field F. We show that only the 8-polynomials of neighbor pairs of a strictly ordered finite homogenours generating se...This paper provides a fast algorithm for Grobnerbases of homogenous ideals of F[x, y] over a finite field F. We show that only the 8-polynomials of neighbor pairs of a strictly ordered finite homogenours generating set are needed in the computing of a Grobner base of the homogenous ideal. It reduces dramatically the number of unnecessary 5-polynomials that are processed. We also show that the computational complexity of our new algorithm is O（N^2）, where N is the maximum degree of the input generating polynomials. The new algorithm can be used to solve a problem of blind recognition of convolutional codes. This problem is a new generalization of the important problem of synthesis of a linear recurring sequence.展开更多
DNA sequencing using reversible terminators, as one sequencing by synthesis strategy, has garnered a great deal of interest due to its popular application in the second-generation high-throughput DNA sequencing techno...DNA sequencing using reversible terminators, as one sequencing by synthesis strategy, has garnered a great deal of interest due to its popular application in the second-generation high-throughput DNA sequencing technology. In this review, we provided its history of develop- ment, classification, and working mechanism of this technology. We also outlined the screening strategies for DNA polymerases to accommodate the reversible terminators as substrates during polymerization; particularly, we introduced the ＂REAP＂ method developed by us. At the end of this review, we discussed current limitations of this approach and provided potential solutions to extend its application.展开更多
文摘Four peptides PSPP1,PSPP2,PSPP3 and PSPP4 were purified from the water-extract of Papaver somniferum pollen.Their sequences,with 21,17,13 and 16 amino acid residues respectively,have been determined by Edman degradation-N-terminal dansylation.PSPP2, PSPP3 and PSPP4 were synthesized using solid phase method.The immunopromotive activities of PSPP1,PSPP2,PSPP3,PSPP4 and the initially separated sample PSPP have been also observed by the methods of counting erythrocyte rosette forming cells(ERFC) and T-lymphocyte transformation test in vitro.
基金Supported by the 973 Program of China(2012CB720503)the Open Research Project of State Kay Laboratory of Chemical Engineering(SKL-Ch E-13B02)
文摘Based on stochastic optimization strategy, a formulation methodology is proposed for synthesizing distillation column sequences, allowing more than one middle component as the distributing components between a pair of key components in the non-sharp split. In order to represent and manipulate the distillation configuration structures, a new coding procedure is proposed in the form of one-dimensional array. Theoretically, an array can represent any kind of split(non-sharp and sharp). With the application of a binary sort tree approach, a robust flow sheet encoding and decoding procedure is developed so that the problem formulation and solution becomes tractable. In this paper,the synthesis problem is formulated as a mixed-integer nonlinear programming(MINLP) problem and an improved simulated annealing approach is adopted to solve the optimization problem. Besides, a shortcut method is applied to the evaluation of all required design parameters as well as the total function.
基金the National Basic Research Program of China(2010CB720500)the National Natural Science Foundation of China(21176178)
文摘In this paper, by combining a stochastic optimization method with a refrigeration shaft work targeting method,an approach for the synthesis of a heat integrated complex distillation system in a low-temperature process is presented. The synthesis problem is formulated as a mixed-integer nonlinear programming(MINLP) problem,which is solved by simulated annealing algorithm under a random procedure to explore the optimal operating parameters and the distillation sequence structure. The shaft work targeting method is used to evaluate the minimum energy cost of the corresponding separation system during the optimization without any need for a detailed design for the heat exchanger network(HEN) and the refrigeration system(RS). The method presented in the paper can dramatically reduce the scale and complexity of the problem. A case study of ethylene cold-end separation is used to illustrate the application of the approach. Compared with the original industrial scheme, the result is encouraging.
基金Elite Young Scientists Program of CAASNational Natural Science Foundation of China,Grant/Award Numbers:32150025,31725002+7 种基金Guangdong Provincial Key Laboratory of Synthetic Genomics,Grant/Award Number:2023B1212060054Shenzhen Outstanding Talents Training FundScience and Technology Planning Project of Guangdong Province,Grant/Award Number:2022A0505090009Bureau of International Cooperation,Chinese Academy of Sciences,Grant/Award Number:172644KYSB20180022Innovation Program of Chinese Academy of Agricultural SciencesShenzhen Science and Technology Program,Grant/Award Number:KQTD20180413181837372National Key Research and Development Program of China,Grant/Award Number:2022YFF1201800Shenzhen Key Laboratory of Synthetic Genomics,Grant/Award Number:ZDSYS201802061806209。
文摘The emergence and development of sequencing and DNA synthesis techniques have empowered us with the ability to read and write genomes,thereby enhancing our understanding and manipulation of biological processes.Over the past two decades,numerous genomes ranging from kilobase-sized viruses to megabase-sized bacteria and yeast chromosomes have been artificially synthesized[1].Notably,the Synthetic Yeast Genome Project(Sc2.0)has successfully constructed all the chromosomes of Saccharomyces cerevisiae,with a strain containing 7.5 synthetic chromosomes also being generated[2–11].It is anticipated that collaborative efforts among scientists worldwide will soon lead to the creation of the first eukaryotic cell harboring a fully synthesized genome.Furthermore,synthetic genomes for higher eukaryotes are also emerging,as exemplified by the ongoing initial phase of the Synthetic Moss Genome Project(Syn-Moss)[12].
基金the National Natural Science Foundation of China (Grant Nos. 10471091, 10671027)Foundation of Shanghai Education Committee (Grant No. 06FZ029)"One Hundred Talents Program" from University of Science and Technology of China
文摘This paper provides a fast algorithm for Grobner bases of homogenous ideals of F[x, y] over a finite field F. We show that only the S-polynomials of neighbor pairs of a strictly ordered finite homogenours generating set are needed in the computing of a Grobner base of the homogenous ideal. It reduces dramatically the number of unnecessary S-polynomials that are processed. We also show that the computational complexity of our new algorithm is O(N2), where N is the maximum degree of the input generating polynomials. The new algorithm can be used to solve a problem of blind recognition of convolutional codes. This problem is a new generalization of the important problem of synthesis of a linear recurring sequence.
基金the National Natural Science Foundation of China (Grant No. 60673082)Special Funds of Authors of Excellent Doctoral Dissertation in China (Grant No. 200084)
文摘This paper provides a fast algorithm for Grobnerbases of homogenous ideals of F[x, y] over a finite field F. We show that only the 8-polynomials of neighbor pairs of a strictly ordered finite homogenours generating set are needed in the computing of a Grobner base of the homogenous ideal. It reduces dramatically the number of unnecessary 5-polynomials that are processed. We also show that the computational complexity of our new algorithm is O（N^2）, where N is the maximum degree of the input generating polynomials. The new algorithm can be used to solve a problem of blind recognition of convolutional codes. This problem is a new generalization of the important problem of synthesis of a linear recurring sequence.
基金the National Natural Science Foundation of China (Grant No. 31270846)the Chinese Academy of Sciences "100-Talent Program" for the support of this work
文摘DNA sequencing using reversible terminators, as one sequencing by synthesis strategy, has garnered a great deal of interest due to its popular application in the second-generation high-throughput DNA sequencing technology. In this review, we provided its history of develop- ment, classification, and working mechanism of this technology. We also outlined the screening strategies for DNA polymerases to accommodate the reversible terminators as substrates during polymerization; particularly, we introduced the ＂REAP＂ method developed by us. At the end of this review, we discussed current limitations of this approach and provided potential solutions to extend its application.
