"Data Structure and Algorithm",which is an important major subject in computer science,has a lot of problems in teaching activity.This paper introduces and analyzes the situation and problems in this course ..."Data Structure and Algorithm",which is an important major subject in computer science,has a lot of problems in teaching activity.This paper introduces and analyzes the situation and problems in this course study.A "programming factory" method is then brought out which is indeed a practice-oriented platform of the teachingstudy process.Good results are obtained by this creative method.展开更多
A robust and efficient algorithm is presented to build multiresolution models (MRMs) of arbitrary meshes without requirement of subdivision connectivity. To overcome the sampling difficulty of arbitrary meshes, edge c...A robust and efficient algorithm is presented to build multiresolution models (MRMs) of arbitrary meshes without requirement of subdivision connectivity. To overcome the sampling difficulty of arbitrary meshes, edge contraction and vertex expansion are used as downsampling and upsampling methods. Our MRMs of a mesh are composed of a base mesh and a series of edge split operations, which are organized as a directed graph. Each split operation encodes two parts of information. One is the modification to the mesh, and the other is the dependency relation among splits. Such organization ensures the efficiency and robustness of our MRM algorithm. Examples demonstrate the functionality of our method.展开更多
This paper describes the nearest neighbor (NN) search algorithm on the GBD(generalized BD) tree. The GBD tree is a spatial data structure suitable for two-or three-dimensional data and has good performance characteris...This paper describes the nearest neighbor (NN) search algorithm on the GBD(generalized BD) tree. The GBD tree is a spatial data structure suitable for two-or three-dimensional data and has good performance characteristics with respect to the dynamic data environment. On GIS and CAD systems, the R-tree and its successors have been used. In addition, the NN search algorithm is also proposed in an attempt to obtain good performance from the R-tree. On the other hand, the GBD tree is superior to the R-tree with respect to exact match retrieval, because the GBD tree has auxiliary data that uniquely determines the position of the object in the structure. The proposed NN search algorithm depends on the property of the GBD tree described above. The NN search algorithm on the GBD tree was studied and the performance thereof was evaluated through experiments.展开更多
Data structures used for an algorithm can have a great impact on its performance, particularly for the solution of large and complex problems, such as multi-objective optimization problems （MOPs）. Multi-objective ev...Data structures used for an algorithm can have a great impact on its performance, particularly for the solution of large and complex problems, such as multi-objective optimization problems （MOPs）. Multi-objective evolutionary algorithms （MOEAs） are considered an attractive approach for solving MOPs~ since they are able to explore several parts of the Pareto front simultaneously. The data structures for storing and updating populations and non-dominated solutions （archives） may affect the efficiency of the search process. This article describes data structures used in MOEAs for realizing populations and archives in a comparative way, emphasizing their computational requirements and general applicability reported in the original work.展开更多
Aiming to improve the maneuver performance of the strapdown inertial navigation attitude coning algorithm a new coning correction structure is constructed by adding a sample to the traditional compressed coning correc...Aiming to improve the maneuver performance of the strapdown inertial navigation attitude coning algorithm a new coning correction structure is constructed by adding a sample to the traditional compressed coning correction structure. According to the given definition of classical coning motion the residual coning correction error based on the new coning correction structure is derived. On the basis of the new structure the frequency Taylor series method is used for designing a coning correction structure coefficient and then a new coning algorithm is obtained.Two types of error models are defined for the coning algorithm performance evaluation under coning environments and maneuver environments respectively.Simulation results indicate that the maneuver accuracy of the new 4-sample coning algorithm is almost double that of the traditional compressed 4-sample coning algorithm. The new coning algorithm has an improved maneuver performance while maintaining coning performance compared to the traditional compressed coning algorithm.展开更多
PL/SQL is the most common language for ORACLE database application. It allows the developer to create stored program units (Procedures, Functions, and Packages) to improve software reusability and hide the complexity ...PL/SQL is the most common language for ORACLE database application. It allows the developer to create stored program units (Procedures, Functions, and Packages) to improve software reusability and hide the complexity of the execution of a specific operation behind a name. Also, it acts as an interface between SQL database and DEVELOPER. Therefore, it is important to test these modules that consist of procedures and functions. In this paper, a new genetic algorithm (GA), as search technique, is used in order to find the required test data according to branch criteria to test stored PL/SQL program units. The experimental results show that this was not fully achieved, such that the test target in some branches is not reached and the coverage percentage is 98%. A problem rises when target branch is depending on data retrieved from tables;in this case, GA is not able to generate test cases for this branch.展开更多
Tree logic, inherited from ambient logic, is introduced as the formal foundation of related programming language and type systems, In this paper, we introduce recursion into such logic system, which can describe the t...Tree logic, inherited from ambient logic, is introduced as the formal foundation of related programming language and type systems, In this paper, we introduce recursion into such logic system, which can describe the tree data more dearly and concisely. By making a distinction between proposition and predicate, a concise semantics interpretation for our modal logic is given. We also develop a model checking algorithm for the logic without △ operator. The correctness of the algorithm is shown. Such work can be seen as the basis of the semi-structured data processing language and more flexible type system.展开更多
Input-output data fitting methods are often used for unknown-structure nonlinear system modeling. Based on model-on-demand tactics, a multiple model approach to modeling for nonlinear systems is presented. The basic i...Input-output data fitting methods are often used for unknown-structure nonlinear system modeling. Based on model-on-demand tactics, a multiple model approach to modeling for nonlinear systems is presented. The basic idea is to find out, from vast historical system input-output data sets, some data sets matching with the current working point, then to develop a local model using Local Polynomial Fitting (LPF) algorithm. With the change of working points, multiple local models are built, which realize the exact modeling for the global system. By comparing to other methods, the simulation results show good performance for its simple, effective and reliable estimation.展开更多
目的探讨中医治疗梅尼埃病的方药规律,为临床提供参考。方法检索中国知网(CNKI)、万方数据知识服务平台(Wangfang Data)、维普中文期刊服务平台(VIP)、中国生物医学文献服务系统(SinoMed)、PubMed、Web of Science、Cochrane Library、E...目的探讨中医治疗梅尼埃病的方药规律,为临床提供参考。方法检索中国知网(CNKI)、万方数据知识服务平台(Wangfang Data)、维普中文期刊服务平台(VIP)、中国生物医学文献服务系统(SinoMed)、PubMed、Web of Science、Cochrane Library、Embase建库至2025年3月4日收录的中医药治疗梅尼埃病相关文献,提取方药数据后运用Excel2019统计中药使用频次、性味归经及功效类别,并采用Lantern5.0和RStudio对使用频率≥3%的高频中药进行隐结构建模、聚类分析及关联规则分析。结果共纳入397篇文献,提取441首处方,涉及222味中药,累计使用4848次。高频中药为白术、茯苓、泽泻、天麻等;药性以温、平、寒为主,药味多为甘、辛、苦,主要归脾、肺、胃经;功效以补虚、利水渗湿、平肝息风为主。隐结构分析得到21个隐变量、42个隐类及7个聚类模型,归纳出25个核心方剂,推断主要证型为痰湿中阻、肾精不足、肝阳上亢、气血亏虚。关联规则分析得到47条强关联规则,其中支持度最高的组合为茯苓→白术,置信度最高的组合为白术+陈皮+甘草→茯苓。结论梅尼埃病以肝肾亏虚、气血亏虚、髓海不足为本,风、火、痰、瘀扰窍为标,治疗应补虚泻实、调和阴阳,配合化痰祛湿、行气通滞、滋养肝肾及平肝潜阳等治法。展开更多
基金supported by NSF B55101680,NTIF B2090571,B2110140,SCUT x2rjD2116860,Y1080170,Y1090160,Y1100030,Y1100050,Y1110020 and S1010561121,G101056137
文摘"Data Structure and Algorithm",which is an important major subject in computer science,has a lot of problems in teaching activity.This paper introduces and analyzes the situation and problems in this course study.A "programming factory" method is then brought out which is indeed a practice-oriented platform of the teachingstudy process.Good results are obtained by this creative method.
文摘A robust and efficient algorithm is presented to build multiresolution models (MRMs) of arbitrary meshes without requirement of subdivision connectivity. To overcome the sampling difficulty of arbitrary meshes, edge contraction and vertex expansion are used as downsampling and upsampling methods. Our MRMs of a mesh are composed of a base mesh and a series of edge split operations, which are organized as a directed graph. Each split operation encodes two parts of information. One is the modification to the mesh, and the other is the dependency relation among splits. Such organization ensures the efficiency and robustness of our MRM algorithm. Examples demonstrate the functionality of our method.
文摘This paper describes the nearest neighbor (NN) search algorithm on the GBD(generalized BD) tree. The GBD tree is a spatial data structure suitable for two-or three-dimensional data and has good performance characteristics with respect to the dynamic data environment. On GIS and CAD systems, the R-tree and its successors have been used. In addition, the NN search algorithm is also proposed in an attempt to obtain good performance from the R-tree. On the other hand, the GBD tree is superior to the R-tree with respect to exact match retrieval, because the GBD tree has auxiliary data that uniquely determines the position of the object in the structure. The proposed NN search algorithm depends on the property of the GBD tree described above. The NN search algorithm on the GBD tree was studied and the performance thereof was evaluated through experiments.
基金supported by the Research Center of College of Computer and Information Sciences,King Saud University,Saudi Arabia
文摘Data structures used for an algorithm can have a great impact on its performance, particularly for the solution of large and complex problems, such as multi-objective optimization problems （MOPs）. Multi-objective evolutionary algorithms （MOEAs） are considered an attractive approach for solving MOPs~ since they are able to explore several parts of the Pareto front simultaneously. The data structures for storing and updating populations and non-dominated solutions （archives） may affect the efficiency of the search process. This article describes data structures used in MOEAs for realizing populations and archives in a comparative way, emphasizing their computational requirements and general applicability reported in the original work.
基金The National Natural Science Foundation of China(No.51375087)the Specialized Research Fund for the Doctoral Program of Higher Education(No.20110092110039)+2 种基金the Public Science and Technology Research Funds Projects of Ocean(No.201205035)the Scientific Innovation Research of College Graduates in Jiangsu Province(No.CXZZ12_0097)the Scientific Research Foundation of Graduate School of Southeast University(No.YBJJ1349)
文摘Aiming to improve the maneuver performance of the strapdown inertial navigation attitude coning algorithm a new coning correction structure is constructed by adding a sample to the traditional compressed coning correction structure. According to the given definition of classical coning motion the residual coning correction error based on the new coning correction structure is derived. On the basis of the new structure the frequency Taylor series method is used for designing a coning correction structure coefficient and then a new coning algorithm is obtained.Two types of error models are defined for the coning algorithm performance evaluation under coning environments and maneuver environments respectively.Simulation results indicate that the maneuver accuracy of the new 4-sample coning algorithm is almost double that of the traditional compressed 4-sample coning algorithm. The new coning algorithm has an improved maneuver performance while maintaining coning performance compared to the traditional compressed coning algorithm.
文摘PL/SQL is the most common language for ORACLE database application. It allows the developer to create stored program units (Procedures, Functions, and Packages) to improve software reusability and hide the complexity of the execution of a specific operation behind a name. Also, it acts as an interface between SQL database and DEVELOPER. Therefore, it is important to test these modules that consist of procedures and functions. In this paper, a new genetic algorithm (GA), as search technique, is used in order to find the required test data according to branch criteria to test stored PL/SQL program units. The experimental results show that this was not fully achieved, such that the test target in some branches is not reached and the coverage percentage is 98%. A problem rises when target branch is depending on data retrieved from tables;in this case, GA is not able to generate test cases for this branch.
基金Supported by the National Natural Sciences Foun-dation of China (60233010 ,60273034 ,60403014) ,863 ProgramofChina (2002AA116010) ,973 Programof China (2002CB312002)
文摘Tree logic, inherited from ambient logic, is introduced as the formal foundation of related programming language and type systems, In this paper, we introduce recursion into such logic system, which can describe the tree data more dearly and concisely. By making a distinction between proposition and predicate, a concise semantics interpretation for our modal logic is given. We also develop a model checking algorithm for the logic without △ operator. The correctness of the algorithm is shown. Such work can be seen as the basis of the semi-structured data processing language and more flexible type system.
基金This project was supported by National Natural Science Foundation (No. 69934020).
文摘Input-output data fitting methods are often used for unknown-structure nonlinear system modeling. Based on model-on-demand tactics, a multiple model approach to modeling for nonlinear systems is presented. The basic idea is to find out, from vast historical system input-output data sets, some data sets matching with the current working point, then to develop a local model using Local Polynomial Fitting (LPF) algorithm. With the change of working points, multiple local models are built, which realize the exact modeling for the global system. By comparing to other methods, the simulation results show good performance for its simple, effective and reliable estimation.
文摘目的探讨中医治疗梅尼埃病的方药规律,为临床提供参考。方法检索中国知网(CNKI)、万方数据知识服务平台(Wangfang Data)、维普中文期刊服务平台(VIP)、中国生物医学文献服务系统(SinoMed)、PubMed、Web of Science、Cochrane Library、Embase建库至2025年3月4日收录的中医药治疗梅尼埃病相关文献,提取方药数据后运用Excel2019统计中药使用频次、性味归经及功效类别,并采用Lantern5.0和RStudio对使用频率≥3%的高频中药进行隐结构建模、聚类分析及关联规则分析。结果共纳入397篇文献,提取441首处方,涉及222味中药,累计使用4848次。高频中药为白术、茯苓、泽泻、天麻等;药性以温、平、寒为主,药味多为甘、辛、苦,主要归脾、肺、胃经;功效以补虚、利水渗湿、平肝息风为主。隐结构分析得到21个隐变量、42个隐类及7个聚类模型,归纳出25个核心方剂,推断主要证型为痰湿中阻、肾精不足、肝阳上亢、气血亏虚。关联规则分析得到47条强关联规则,其中支持度最高的组合为茯苓→白术,置信度最高的组合为白术+陈皮+甘草→茯苓。结论梅尼埃病以肝肾亏虚、气血亏虚、髓海不足为本,风、火、痰、瘀扰窍为标,治疗应补虚泻实、调和阴阳,配合化痰祛湿、行气通滞、滋养肝肾及平肝潜阳等治法。
