Diversity and Distribution of Bulb-associated fungi of Fritillaria Cirrhosae Bulbus Source Plants used in Traditional Chinese Medicine

( Qian Gao ),( Fawu Dong ),( Jianying Xiang ) 한국균학회 2020 韓國菌學會誌 Vol.48 No.3

Diversity and community composition of bulb-associated fungi of Fritillaria Cirrhosae Bulbus source plants, which are used in traditional chinese medicine, in the eastern Himalaya- Hengduan Mountains, southwestern China, were estimated based on the internal transcribed spacer rDNA sequence analysis, using host plant species, geographic area, and plant phenology as variables. A total of 1,486 fungal sequences assigned to 251 operational taxonomical units (OTUs) were obtained from the bulbs. Fungal OTUs comprised 96.41% Ascomycotina, 3.52% Basidiomycotina, and 0.07% Zygomycotina. Sordariomycetes, Hypocreales, and Nectriaceae were the most frequent fungal lineages at each taxonomic rank. Fusarium, Ilyonectria, Tetracladium, Leptodontidium, and Tomentella were the top OTU-rich genera. Fusarium sp. 03, Ilyonectria rufa, Fusarium sp. 08, Ilyonectria sp. 03, and Leptodontidium orchidicola 03 represented the most frequent OTUs. Fusarium spp. were the most frequent general taxa. The distribution of fungal community exhibited preferences for host plant species, geographic area, and plant phenology. These findings are the foundation of our research on culturing and active metabolites of bulb-associated fungi of Fritillaria Cirrhosae Bulbus source plants.

A Dynamic Ontology-based Multi-Agent Context-Awareness User Profile Construction Method for Personalized Information Retrieval

Qian Gao,Young Im Cho 한국지능시스템학회 2012 INTERNATIONAL JOURNAL of FUZZY LOGIC and INTELLIGE Vol.12 No.4

With the increase in amount of data and information available on the web, there have been high demands on personalized information retrieval services to provide context-aware services for the web users. This paper proposes a novel dynamic multi-agent context-awareness user profile construction method based on ontology to incorporate concepts and properties to model the user profile. This method comprehensively considers the frequency and the specific of the concept in one document and its corresponding domain ontology to construct the user profile, based on which, a fuzzy c-means clustering method is adopted to cluster the user’"s interest domain, and a dynamic update policy is adopted to continuously consider the change of the users’" interest. The simulation result shows that along with the gradual perfection of the our user profile, our proposed system is better than traditional semantic based retrieval system in terms of the Recall Ratio and Precision Ratio.

An Ontology-Based Information Retrieval Model for Similarity Matching

Qian Gao,Young Im Cho,Sumei Xi 한국지능시스템학회 2012 한국지능시스템학회 학술발표 논문집 Vol.22 No.1

A New Approach to Solve the TSP using an Improved Genetic Algorithm

Gao, Qian,Cho, Young-Im,Xi, Su Mei Korean Institute of Intelligent Systems 2011 INTERNATIONAL JOURNAL of FUZZY LOGIC and INTELLIGE Vol.11 No.4

Genetic algorithms are one of the most important methods used to solve the Traveling Salesman Problem. Therefore, many researchers have tried to improve the Genetic Algorithm by using different methods and operations in order to find the optimal solution within reasonable time. This paper intends to find a new approach that adopts an improved genetic algorithm to solve the Traveling Salesman Problem, and compare with the well known heuristic method, namely, Kohonen Self-Organizing Map by using different data sets of symmetric TSP from TSPLIB. In order to improve the search process for the optimal solution, the proposed approach consists of three strategies: two separate tour segments sets, the improved crossover operator, and the improved mutation operator. The two separate tour segments sets are construction heuristic which produces tour of the first generation with low cost. The improved crossover operator finds the candidate fine tour segments in parents and preserves them for descendants. The mutation operator is an operator which can optimize a chromosome with mutation successfully by altering the mutation probability dynamically. The two improved operators can be used to avoid the premature convergence. Simulation experiments are executed to investigate the quality of the solution and convergence speed by using a representative set of test problems taken from TSPLIB. The results of a comparison between the new approach using the improved genetic algorithm and the Kohonen Self-Organizing Map show that the new approach yields better results for problems up to 200 cities.

A Dynamic Ontology-based Multi-Agent Context-Awareness User Profile Construction Method for Personalized Information Retrieval

Gao, Qian,Cho, Young Im Korean Institute of Intelligent Systems 2012 INTERNATIONAL JOURNAL of FUZZY LOGIC and INTELLIGE Vol.12 No.4

With the increase in amount of data and information available on the web, there have been high demands on personalized information retrieval services to provide context-aware services for the web users. This paper proposes a novel dynamic multi-agent context-awareness user profile construction method based on ontology to incorporate concepts and properties to model the user profile. This method comprehensively considers the frequency and the specific of the concept in one document and its corresponding domain ontology to construct the user profile, based on which, a fuzzy c-means clustering method is adopted to cluster the user's interest domain, and a dynamic update policy is adopted to continuously consider the change of the users' interest. The simulation result shows that along with the gradual perfection of the our user profile, our proposed system is better than traditional semantic based retrieval system in terms of the Recall Ratio and Precision Ratio.

Biocatalysis and Fermentation Technology : Relationship Between Morphology and Itaconic Acid Production by Aspergillus terreus

( Qian Gao ),( Ie Liu ),( Li Ming Liu ) 한국미생물 · 생명공학회 2014 Journal of microbiology and biotechnology Vol.24 No.2

The morphology of filamentous fungi closely correlates with the productivity in submerged culture. Using itaconic acid (IA) production by Aspergillus terreus as a research model, the quantitative relationship between the growth form of A. terreus and IA production was investigated. IA fermentation was scaled up from shake flasks to a 7 L stirred tank bioreactor based on the quantitative relationship. Our results demonstrated the following: (1) Three morphologies of A. terreus were formed by changing the inoculum level and shape of the flask. (2) Investigation of the effects of the three morphologies on broth rheology and IA production revealed the higher yield of IA on dry cell weight (DCW, IA/DCW) and yield of glucose on DCW (consumed glucose/DCW) were achieved during clump growth of A. terreus. (3) By varying the KH2PO4 concentration and culture temperature, the relationships between clump diameter and IA production were established, demonstrating that the yield of IA on DCW (R2 = 0.9809) and yield of glucose on DCW (R2 = 0.9421) were closely correlated with clump diameter. The optimum clump diameter range for higher IA production was 0.40-0.50 mm. (4) When the clump diameter was controlled at 0.45 mm by manipulating the mechanical stress in a 7 L fermentor, the yield of IA on DCW and yield of glucose on DCW were increased by 25.1% and 16.3%, respectively. The results presented in this study provide a potential approach for further enhancement of metabolite production by filamentous fungi.

A Multi-Agent Personalized Ontology Profile Based Query Refinement Approach for Information Retrieval

Qian Gao,Young Im Cho 제어로봇시스템학회 2013 제어로봇시스템학회 국제학술대회 논문집 Vol.2013 No.10

This paper proposes a multi-agent query refinement approach to comprehensively track the users’ behaviors. Based on the approach, this paper creates the personalized ontology profile, with which it refines and expands the users’ initial query. We use four agents in our entire system. First, we use Client Agent to verify user identities by creating a union user account and to monitor whether a device is ready to run a personalized ontology profile creation task; then we use a Personalized Ontology Profile Agent to create a personalized ontology profile which not only can consider the Knowledge structure but also consider the users’ behavior. Finally, we use a three level-strategy to expand the query automatically, and send back the retrieval results to the user. Based on the users’ feedback, we reformulate the expanded query. We compare our method with the conceptual retrieval method as well as WordNet-based expansion, and we prove that our method has better average precision ratio.

A New Approach to Solve the TSP using an Improved Genetic Algorithm

Qian Gao,Young Im Cho,Su mei Xi 한국지능시스템학회 2011 INTERNATIONAL JOURNAL of FUZZY LOGIC and INTELLIGE Vol.11 No.4

Genetic algorithms are one of the most important methods used to solve the Traveling Salesman Problem. Therefore, many researchers have tried to improve the Genetic Algorithm by using different methods and operations in order to find the optimal solution within reasonable time. This paper intends to find a new approach that adopts an improved genetic algorithm to solve the Traveling Salesman Problem, and compare with the well known heuristic method, namely, Kohonen Self-Organizing Map by using different data sets of symmetric TSP from TSPLIB. In order to improve the search process for the optimal solution, the proposed approach consists of three strategies: two separate tour segments sets, the improved crossover operator, and the improved mutation operator. The two separate tour segments sets are construction heuristic which produces tour of the first generation with low cost. The improved crossover operator finds the candidate fine tour segments in parents and preserves them for descendants. The mutation operator is an operator which can optimize a chromosome with mutation successfully by altering the mutation probability dynamically. The two improved operators can be used to avoid the premature convergence. Simulation experiments are executed to investigate the quality of the solution and convergence speed by using a representative set of test problems taken from TSPLIB. The results of a comparison between the new approach using the improved genetic algorithm and the Kohonen Self-Organizing Map show that the new approach yields better results for problems up to 200 cities.

A Subclass of Petri Net with Reachability Equivalent to State Equation Satisfiability: Live Single Branch Petri Net

Gao, Qian,Cho, Young Im Korean Institute of Intelligent Systems 2013 INTERNATIONAL JOURNAL of FUZZY LOGIC and INTELLIGE Vol.13 No.3

Petri Nets are a system description and analysis tool. Reachability is one of the most basic properties in Petri Net research. In a sense, reachability research is the foundation study for other dynamic properties of Petri Nets through which many problems involving Petri Nets can be described. Nowadays, there are two mature analysis methods-the matrix equation and the reachability tree. However, both methods are localized, i.e., it is difficult to find a general algorithm that can determine reachability for an arbitrary Petri Net, especially an unbounded Petri Net. This paper proposes and proves three propositions in order to present a subclass of a Petri Net, the live single-branch Petri Net, whose reachability is equivalent to the satisfiability of the state equation.

A Subclass of Petri Net with Reachability Equivalent to State Equation Satisfiability

Qian Gao,Young Im Cho 한국지능시스템학회 2013 INTERNATIONAL JOURNAL of FUZZY LOGIC and INTELLIGE Vol.13 No.3

Petri Nets are a system description and analysis tool. Reachability is one of the most basic properties in Petri Net research. In a sense, reachability research is the foundation study for other dynamic properties of Petri Nets through which many problems involving Petri Nets can be described. Nowadays, there are two mature analysis methods?the matrix equation and the reachability tree. However, both methods are localized, i.e., it is difficult to find a general algorithm that can determine reachability for an arbitrary Petri Net, especially an unbounded Petri Net. This paper proposes and proves three propositions in order to present a subclass of a Petri Net, the live single-branch Petri Net, whose reachability is equivalent to the satisfiability of the state equation.