The generalized travelling salesman problem(GTSP),a generalization of the well-known travelling salesman problem(TSP),is considered for our study.Since the GTSP is NP-hard and very complex,finding exact solutions is h...The generalized travelling salesman problem(GTSP),a generalization of the well-known travelling salesman problem(TSP),is considered for our study.Since the GTSP is NP-hard and very complex,finding exact solutions is highly expensive,we will develop genetic algorithms(GAs)to obtain heuristic solutions to the problem.In GAs,as the crossover is a very important process,the crossovermethods proposed for the traditional TSP could be adapted for the GTSP.The sequential constructive crossover(SCX)and three other operators are adapted to use in GAs to solve the GTSP.The effectiveness of GA using SCX is verified on some GTSP Library(GTSPLIB)instances first and then compared against GAs using the other crossover methods.The computational results show the success of the GA using SCX for this problem.Our proposed GA using SCX,and swap mutation could find average solutions whose average percentage of excesses fromthe best-known solutions is between 0.00 and 14.07 for our investigated instances.展开更多
Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Ukkonen algorithm is deeply investigated and a new algorithm, which...Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Ukkonen algorithm is deeply investigated and a new algorithm, which decreases the number of memory operations in construction and keeps the result tree sequential, is proposed. The experiment result shows that both the construction and the matching procedure are more efficient than Ukkonen algorithm.展开更多
The leaning of structures happens all around the world and generates impacts on different extents;thus, it is important to learn about the causes behind. In this report, the sequential construction of a typical leanin...The leaning of structures happens all around the world and generates impacts on different extents;thus, it is important to learn about the causes behind. In this report, the sequential construction of a typical leaning structure, the Tower of Pisa, is discussed and simulated by using a finite element code, PLAXIS. The simulation is performed on a two-dimensional plane with simplifications taken into consideration in making modeling feasible under limitations. Three distinct models are built with one as a control variable, while the other two models are set up with exact eccentricity. Data are obtained from the analysis and are plotted in a graph to clearly show the relationship between the tilting angle and construction phases. With reasonable and completed simulation, the study is able to show the significant role compressible subsoil plays in impacting the tilting performance of a tall building.展开更多
The program construction process is based on rigorous mathematical reasoning,which leads to a fully correct algorithmic program via step-by-step refinement of the program specifications.The existing program constructi...The program construction process is based on rigorous mathematical reasoning,which leads to a fully correct algorithmic program via step-by-step refinement of the program specifications.The existing program construction methods'refinement process is partly based on individual subjective speculation and analysis,which lacks a precise guidance method.Meanwhile,efficiency factors have usually been ignored in the construction process,and most of the constructed abstract programs cannot be run directly by machines.In order to solve these problems,a novel program construction method for the sequence statistical class algorithms based on bidirectional scan induction is proposed in this paper.The method takes into account the efficiency factor and thus improves the Morgan's refinement calculus.Furthermore,this paper validates the method's feasibility using an efficiency-sensitive sequential statistics class algorithm as a program construction example.The method proposed in this paper realizes the correctness construction process from program specifications to efficient executable programs.展开更多
With the continuous development of urbanization construction, rail transit has received more and more attention. For the current subway station, the main structure of open-cut subway station plays an important role in...With the continuous development of urbanization construction, rail transit has received more and more attention. For the current subway station, the main structure of open-cut subway station plays an important role in it. Therefore, the leakage problem with high frequency should be analyzed in time and dealt with reasonably. In this paper, the construction technology of leakage treatment for the main structure of open-cut subway station is analyzed for reference.展开更多
基金the Deanship of Scientific Research,Imam Mohammad Ibn Saud Islamic University(IMSIU),Saudi Arabia,for funding this research work through Grant No.(221412020).
文摘The generalized travelling salesman problem(GTSP),a generalization of the well-known travelling salesman problem(TSP),is considered for our study.Since the GTSP is NP-hard and very complex,finding exact solutions is highly expensive,we will develop genetic algorithms(GAs)to obtain heuristic solutions to the problem.In GAs,as the crossover is a very important process,the crossovermethods proposed for the traditional TSP could be adapted for the GTSP.The sequential constructive crossover(SCX)and three other operators are adapted to use in GAs to solve the GTSP.The effectiveness of GA using SCX is verified on some GTSP Library(GTSPLIB)instances first and then compared against GAs using the other crossover methods.The computational results show the success of the GA using SCX for this problem.Our proposed GA using SCX,and swap mutation could find average solutions whose average percentage of excesses fromthe best-known solutions is between 0.00 and 14.07 for our investigated instances.
基金supported by the National Natural Science Foundation of China(6050203260672068).
文摘Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Ukkonen algorithm is deeply investigated and a new algorithm, which decreases the number of memory operations in construction and keeps the result tree sequential, is proposed. The experiment result shows that both the construction and the matching procedure are more efficient than Ukkonen algorithm.
文摘The leaning of structures happens all around the world and generates impacts on different extents;thus, it is important to learn about the causes behind. In this report, the sequential construction of a typical leaning structure, the Tower of Pisa, is discussed and simulated by using a finite element code, PLAXIS. The simulation is performed on a two-dimensional plane with simplifications taken into consideration in making modeling feasible under limitations. Three distinct models are built with one as a control variable, while the other two models are set up with exact eccentricity. Data are obtained from the analysis and are plotted in a graph to clearly show the relationship between the tilting angle and construction phases. With reasonable and completed simulation, the study is able to show the significant role compressible subsoil plays in impacting the tilting performance of a tall building.
基金Supported by the National Natural Science Foundation of China(62262031)the Jiangxi Provincial Natural Science Foundation(20232BAB202010)+1 种基金the Science and Technology Project of Education Department of Jiangxi Province(GJJ210307,GJJ2200302)the Cultivation Project for Academic and Technical Leader in Major Disciplines in Jiangxi Province(20232BCJ22013)。
文摘The program construction process is based on rigorous mathematical reasoning,which leads to a fully correct algorithmic program via step-by-step refinement of the program specifications.The existing program construction methods'refinement process is partly based on individual subjective speculation and analysis,which lacks a precise guidance method.Meanwhile,efficiency factors have usually been ignored in the construction process,and most of the constructed abstract programs cannot be run directly by machines.In order to solve these problems,a novel program construction method for the sequence statistical class algorithms based on bidirectional scan induction is proposed in this paper.The method takes into account the efficiency factor and thus improves the Morgan's refinement calculus.Furthermore,this paper validates the method's feasibility using an efficiency-sensitive sequential statistics class algorithm as a program construction example.The method proposed in this paper realizes the correctness construction process from program specifications to efficient executable programs.
文摘With the continuous development of urbanization construction, rail transit has received more and more attention. For the current subway station, the main structure of open-cut subway station plays an important role in it. Therefore, the leakage problem with high frequency should be analyzed in time and dealt with reasonably. In this paper, the construction technology of leakage treatment for the main structure of open-cut subway station is analyzed for reference.
文摘顺序任务流(sequential task flow,STF)将对共享数据的访问表示为任务之间的依赖关系,STF运行时系统通过任务构造、依赖分析和任务依赖图(task dependence graph,TDG)生成、任务调度实现异步并行,这3个环节的开销直接影响并行程序的性能.目前以STF为核心的AceMesh运行时系统,在SW39000处理器上仅使用单主核构图、多从核执行的方式.然而,SW39000处理器离散访存性能较弱,细粒度任务构图离散访存增多,构图更容易成为瓶颈.对此,提出了一种利用多从核辅助主核进行构图的算法.首先,分析在依赖分析和TDG生成过程中的并行性,在SW39000处理器上实现了一种基于胖任务依赖图(fatTDG)的多核辅助并行构图算法PFBH(parallelized fatTDG building algorithm with helpers)并进行优化.其次,针对线程间的主存资源竞争问题,提出构图与执行并行中从核资源调节方法及参数选择.最终,在5类典型应用下进行实验测试.与单核串行构图系统相比,在细粒度任务场景下最高加速为1.75倍;与SW39000处理器上的OpenACC模型相比,AceMesh最高可达2倍加速.
