Let X be a metric space with an ordering structure,A: X→X is a operator and x≤Ax for any x∈X. In this paper we prove a new fixed point theorem, which generalizes famous caristi fixed point theorem.
[Objective]Foxtail mosaic virus(FoMV)infects gramineous and dicotyledonous plants.In this study,we sought to construct a viral vector based on FoMV to express exogenous proteins in plants.[Method]A recombinant viral e...[Objective]Foxtail mosaic virus(FoMV)infects gramineous and dicotyledonous plants.In this study,we sought to construct a viral vector based on FoMV to express exogenous proteins in plants.[Method]A recombinant viral expression vector was constructed by inserting the promotor of Potato virus X(PVX)and exogenous gene sequences into the 3’non-coding region of the FoMV coat protein gene.[Results]The plasmid pCB301-FoMV-CP-PVXprom-GFP expressed green fluorescent protein in inoculated Nicotiana benthamiana leaves.[Conclusion]A recombinant viral expression vector was constructed successfully.展开更多
Background knowledge is important for data mining, especially in complicated situation. Ontological engineering is the successor of knowledge engineering. The sharable knowledge bases built on ontology can be used to ...Background knowledge is important for data mining, especially in complicated situation. Ontological engineering is the successor of knowledge engineering. The sharable knowledge bases built on ontology can be used to provide background knowledge to direct the process of data mining. This paper gives a common introduction to the method and presents a practical analysis example using SVM (support vector machine) as the classifier. Gene Ontology and the accompanying annotations compose a big knowledge base, on which many researches have been carried out. Microarray dataset is the output of DNA chip. With the help of Gene Ontology we present a more elaborate analysis on microarray data than former researchers. The method can also be used in other fields with similar scenario.展开更多
The standard method to construct a finite field requires a primitive irreducible polynomial of a given degree. Therefore, it is difficult to apply for the construction of huge finite fields. To avoid this problem, we ...The standard method to construct a finite field requires a primitive irreducible polynomial of a given degree. Therefore, it is difficult to apply for the construction of huge finite fields. To avoid this problem, we propose a new method to construct huge finite fields with the characteristic p = 5 by using an Artin-Schreier tower. Utilizing the recursive basis of the Artin-Schreier tower, we define a nmltiplication algorithm The algorithm can explicitly calculate the multiplication of two elements on the top finite field of this tower, without any primitive element. We also define a linear recurrence equation as an application, which produces a sequence of numbers, and call the new pseudorandom number generator Abstract Syntax Tree （AST） for p = 5. The experircental results show that our new pseudorandom number generator can produce a sequence of numbers with a long period.展开更多
文摘Let X be a metric space with an ordering structure,A: X→X is a operator and x≤Ax for any x∈X. In this paper we prove a new fixed point theorem, which generalizes famous caristi fixed point theorem.
基金Supported by Key Laboratory Open Foundation Project of Hunan Education Department(18K100)Graduate Research Innovation Project of Hunan Province(CX2018B800)~~
文摘[Objective]Foxtail mosaic virus(FoMV)infects gramineous and dicotyledonous plants.In this study,we sought to construct a viral vector based on FoMV to express exogenous proteins in plants.[Method]A recombinant viral expression vector was constructed by inserting the promotor of Potato virus X(PVX)and exogenous gene sequences into the 3’non-coding region of the FoMV coat protein gene.[Results]The plasmid pCB301-FoMV-CP-PVXprom-GFP expressed green fluorescent protein in inoculated Nicotiana benthamiana leaves.[Conclusion]A recombinant viral expression vector was constructed successfully.
基金Project (No. 20040248001) supported by the Ph.D. Programs Foun-dation of Ministry of Education of China
文摘Background knowledge is important for data mining, especially in complicated situation. Ontological engineering is the successor of knowledge engineering. The sharable knowledge bases built on ontology can be used to provide background knowledge to direct the process of data mining. This paper gives a common introduction to the method and presents a practical analysis example using SVM (support vector machine) as the classifier. Gene Ontology and the accompanying annotations compose a big knowledge base, on which many researches have been carried out. Microarray dataset is the output of DNA chip. With the help of Gene Ontology we present a more elaborate analysis on microarray data than former researchers. The method can also be used in other fields with similar scenario.
基金supported by Overseas Scholars Research Fund of Heilongjiang Provinicial Education Department
文摘The standard method to construct a finite field requires a primitive irreducible polynomial of a given degree. Therefore, it is difficult to apply for the construction of huge finite fields. To avoid this problem, we propose a new method to construct huge finite fields with the characteristic p = 5 by using an Artin-Schreier tower. Utilizing the recursive basis of the Artin-Schreier tower, we define a nmltiplication algorithm The algorithm can explicitly calculate the multiplication of two elements on the top finite field of this tower, without any primitive element. We also define a linear recurrence equation as an application, which produces a sequence of numbers, and call the new pseudorandom number generator Abstract Syntax Tree （AST） for p = 5. The experircental results show that our new pseudorandom number generator can produce a sequence of numbers with a long period.
