检索结果-内蒙古大学图书馆

generation algorithm of grid model for complex terrain based on geodetic coordinate data transformation

MICROPROCESSORS AND MICROSYSTEMS 2020年 75卷 103065-103065页

作者： Zheng, Yuanpan Li, Guangyang Wang, Zeyu Huang, Wei Kong, Qingduan Xi, Guangyong Chen, Yan Chen, Guangyu Zhengzhou Univ Light Ind Sch Comp & Commun Engn Zhengzhou 450001 Peoples R China Engn Lab Henan Prov Emergency Management Platform Zhengzhou 450001 Peoples R China Henan Xinanli Secur Technol Co Ltd Zhengzhou 450001 Peoples R China

Grid model construction is one of the preconditions for computational fluid dynamics (CFD) simulation. As many environmental accidents or unfavorable incidents occur in complex real terrain circumstances, corresponding grid model generation algorithm for scenario simulation has become a hot research field. The digital elevation model (DEM) is common for three-dimensional terrain modeling. DEM data usually consist of a certain number of geodetic coordinates, however, CFD preprocessing platform can't identify geodetic coordinates directly. In this paper, firstly an algorithm of coordinate transformation was proposed, which could convert geodetic coordinates to Cartesian coordinates in the form of length (x), width (y) and height (z). Secondly, another algorithm that generates a complex real terrain grid model was recommended based on the algorithm mentioned previously, which could import converted terrain data into a gridding platform for constructing the CFD terrain grid model. Experiments' results showed that the terrain grid algorithm obtained through the combination of the two algorithms is highly geometrically consistent with real terrain. The algorithm provided by this study could give a more reliable and convenient basis for the application of CFD fine simulation in real complex terrain. (C) 2020 Elsevier B.V. All rights reserved.

关键词： generation algorithm Complex terrain Geodetic coordinate transformation Digital elevation model Computational fluid dynamics

来源：评论

学校读者我要写书评

暂无评论

Automatic generation algorithm analysis of dance movements based on music-action association

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2019年第2期22卷 S3553-S3561页

作者： He, Yun Zhang, Quancheng Shiyou Univ Mus Dept Xian Xian Shaanxi Peoples R China Shiyou Univ Dept Phys Educ Xian Xian 710065 Shaanxi Peoples R China

With the rapid development of intelligent algorithm technology and big data technology, the dance is more and more urgent to get accurate analysis of optimization algorithm. It not only achieves the fusion of music and movement for the driven motion which provides a platform for integration, but also uses the optimization algorithm to realize an important project which produces the progress in the dance, the analysis of the dance is based on the generation method of creative methods. This paper designs and implements the automatic generation algorithm of genetic algorithm which is based on the basic design idea of dance movements, the design will be the triangle program as a typical example, and it's generating test case as much as possible to complete path coverage in the specified range of data and input data. The experimental data shows that the algorithm generates test case which can not only complete the preset target path, and be able to complete a full. The generation of traversal target path meeting the required choreography. At the same time, the algorithm can coordinate the path of music and action to the greatest extent, and this algorithm lays the foundation for further integration of technology.

关键词： generation algorithm Music-action association Dance movements Automatic Analysis

来源：评论

学校读者我要写书评

暂无评论

Research on Uncertain Data generation algorithm 2

Research on Uncertain Data Generation Algorithm

引用

2017 IEEE 2nd International Conference on Big Data Analysis（ICBDA 2017）

作者： Ming Hu Hongmei Wang Dongkai Tang Fentian Li School of Computer Science and Engineering ChangChun University of Technology

ISBN: (纸本)9781509036202

Uncertain data mining is becoming a research hotspot with the emergence of uncertain data in sensor network,Web application and other *** to obtain effective uncertain data sets is a prerequisite for the study of clustering,classification,frequent itemsets mining,isolated point detection and so *** this paper,the representation model of uncertain data is analyzed,and corresponding uncertain data generation algorithms are proposed for different types of uncertain *** analysis and experiments show that the algorithm proposed in this paper has practicality as a tool.

关键词： uncertain data representation model data set generation algorithm tool

来源：评论

学校读者我要写书评

暂无评论

RESEARCH ON THE generation METHODS OF TOPOLOGICAL INTERLOCKING STRUCTURE ON SURFACES BASED ON GRID 29th

RESEARCH ON THE GENERATION METHODS OF TOPOLOGICAL INTERLOCKI...

引用

29th International Conference of the Association-for-Computer-Aided-Architectural-Design-Research-in-Asia (CAADRIA)

作者： Yu, Shufan Zhang, Yunsong Tong, Ziyu Tian, Shulin Nanjing Univ Sch Architecture & Urban Planning Nanjing Peoples R China

ISBN: (纸本)9789887891833

Topological Interlocking (TI) structures have inherent advantages due to the structural characteristics of their discrete units and the diverse representation forms of these units. Previous research has summarized various methods for generating TIs on planar or curved surfaces. However, existing digital generation tools still use relatively limited methods when generating on curved surfaces. Additionally, there needs to be more control over the overall morphology, resulting in incomplete units or units that fail to meet the expected shape requirements. This paper presents a summarized method for generating TI structures based on the Truchet vault. Furthermore, it adapts the generation of TI units on curved surface grids and investigates the results of this method on various types of grids. Moreover, this paper proposes ideas for optimizing the partitioning of surface grids. Based on these ideas, specific combinations of units and grids are selected, and finite element analysis is utilized to analyze the forces and displacements of different TI unit forms. The results demonstrate that TI structures with larger unit amplitudes and higher symmetry exhibit more uniform force transmission when subjected to the same load, reducing overall stress and displacement.

关键词： Topological Interlocking Truchet Tiling Finite Element Analysis (FEA) generation algorithm Parametric Design Spatial Grid

来源：评论

学校读者我要写书评

暂无评论

Using deep learning and genetic algorithms for melody generation and optimization in music

引用

SOFT COMPUTING 2023年第22期27卷 17419-17433页

作者： Dong, Ling Dazhou Vocat & Tech Coll Dazhou 635000 Sichuan Peoples R China

Music expresses thoughts and emotions in artistic form and is made up of different components including harmony, rhythm, and melody. Several musical elements are tied together during the songwriting process in order to generate melodies that are harmonic. A music melody is the essential element of any music to generate strong feelings from listeners and capture their interest. In the process of music appreciation, melody controls the emotional changes of music. It is an efficiently perceived part and the tone of a song. In recent years, Sichuan unvoiced music has developed rapidly and attracted much attention. This paper selects Sichuan unvoiced music as the main research theme and constructs a melody generation algorithm by utilizing the state-of-the-art techniques of deep learning (DL) and evolutionary algorithms (EAs) such as recurrent neural network-long short-term memory (RNN-LSTM) and genetic algorithm (GA). Firstly, this paper briefly describes the concept of DL algorithms, the deep generation model, and sequence to sequence model, as they constitute the technological foundation for this research. Secondly, this paper proposes a melody generation algorithm that utilizes RNN-LSTM for melody generation and GA for melody optimization. More specifically, the melody is generated by preprocessing data, creating, and training the RNN-LSTM model. A GA was used to determine the melodic fitness function for eight songs as the fitness function directly affects the selected termination condition. The fitness function can be thought of as either a person or an evolutionary rule. Finally, the average score of these songs, before and after evolution, is calculated, which demonstrates that the analysis and rotation creation methods are more precise and that the song's average melody score is higher. The method proposed in this study has been thoroughly compared to the existing approaches proposed in earlier studies, and it was found that the approach we propose is more effec

关键词： Sichuan region music Clear melody generation algorithm Deep learning Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

A big data and neural networks driven approach to design students management system

引用

SOFT COMPUTING 2024年第2期28卷 1669-1684页

作者： Fan, Jingjing Jiangsu Vocat Coll Tourism Sch Arts & Crafts Yangzhou 225000 Jiangsu Peoples R China

Designing a Student Management System based on big data and deep learning is paramount in the modern educational landscape. This innovative approach allows institutions to harness the power of vast datasets to gain actionable insights into student performance, preferences, and learning patterns. The research begins by identifying various facets and modules within the student ecosystem that impact student success, including examination results, health records, grades analysis, demographics, co-curricular activities, teacher information, and parental details. The data pertaining to these modules are inherently distributed, and the system organizes it into a unified format using the big data tool Apache Hadoop. The goal is to consolidate the data for utilization by deep learning models in predicting student success. Apache Hadoop, as a robust big data tool, facilitates efficient storage and analysis of large datasets. Subsequently, a Feed Forward Neural Network (FNN) model is developed to extract distinctive patterns indicative of student success. The planned FNN architecture incorporates 128 neurons and employs Rectified Linear Unit (RELU) and SoftMax activation functions to enhance predictive capabilities. The increased number of neurons in the model allows for a comprehensive exploration of all student data sources, thereby improving the true positive rate. Ultimately, the computation of execution and timely interventions by teachers, parents, and administration demonstrates heightened precision resulting from the analysis and rotation creation methods, leading to an efficient student management system. A thorough comparison with earlier approaches underscores its superior effectiveness, with a noteworthy 45% increase in accuracy and a significant 55% enhancement in precision.

关键词： Students management system Feed forwarding neural networks generation algorithm

来源：评论

学校读者我要写书评

暂无评论

Optimization of High-Speed Railway Line Planning With Passenger and Freight Transport Coordination

引用

IEEE ACCESS 2022年 10卷 110217-110247页

作者： Li, Shiqi Lang, Maoxiang Li, Siyu Chen, Xinghan Yu, Xueqiao Geng, Yixuan Beijing Jiaotong Univ Sch Traff & Transportat Beijing 100044 Peoples R China Beijing Jiaotong Univ Key Lab Transport Ind Big Data Applicat Technol C Beijing 100044 Peoples R China China Acad Railway Sci Corp Ltd Transportat & Econ Res Inst Beijing 100081 Peoples R China

This paper studies the line planning optimization problem based on the coordinate mode of high-speed railway (HSR) passenger trains and freight trains. The multi objective nonlinear mixed integer programming model of HSR passenger train and freight train line planning with passengers and freight is designed on the basis of comprehensive consideration of passenger and freight transport demand. Then, in order to simultaneously determine the types, origin and destination stations, operation sections, stop schemes, operation frequencies, and demand allocation of HSR passenger trains and freight trains, the model is solved iteratively using a hybrid heuristic algorithm combining a column generation algorithm and a genetic algorithm. Finally, a numerical experiment based on the operation data of China's Dalian-Harbin HSR line is implemented to verify the effectiveness of the proposed model and algorithm, and the solution performance of the CPLEX solver and the hybrid heuristic algorithm is compared. The results show that both the CPLEX solver and the hybrid heuristic algorithm can obtain the global optimal solution set. With the expansion of the scale of the problem, the solution quality and convergence efficiency of the hybrid heuristic algorithm have significantly improved, and it can solve large-scale problems and obtain satisfactory solutions within a shorter time.

关键词： High-speed rail transportation Freight handling Rail transportation Optimization Resource management Genetic algorithms Heuristic algorithms generation algorithm genetic algorithm high-speed railway passenger and freight transport coordination the line planning train candidate set

来源：评论

学校读者我要写书评

暂无评论

Geostatistical algorithm for evaluation of primary and secondary roughness

引用

GEOMECHANICS AND ENGINEERING 2021年第4期24卷 359-370页

作者： Nasab, Hojat Karimi-Nasab, Saeed Jalalifar, Hossein Shahid Bahonar Univ Kerman Dept Min Engn Kerman *** Iran Shahid Bahonar Univ Kerman Dept Oil Engn Kerman Iran

Joint roughness is combination of primary and secondary roughness. Ordinarily primary roughness is a geostatistical part of a joint surface that has a periodic nature but secondary roughness or unevenness is a statistical part of that which have a random nature. Using roughness generating algorithms is a useful method for evaluation of joint roughness. In this paper after determining geostatistical parameters of the joint profile, were presented two roughness generating algorithms using Mount-Carlo method for evaluation of primary (GJRGA(P)) and secondary (GJRGA(S)) roughness. These based on geostatistical parameters (range and sill) and statistical parameters (standard deviation of asperities height, SDH, and standard deviation of asperities angle, SDA) for generation two-dimensional joint roughness profiles. In this study different geostatistical regions were defined depending on the range and SDH. As SDH increases, the height of the generated asperities increases and asperities become sharper and at a specific range (a specific curve) relation between SDH and SDA is linear. As the range in GJRGA(P) becomes larger (the base of the asperities) the shape of asperities becomes flatter. The results illustrate that joint profiles have larger SDA with increase of SDH and decrease of range. Consequencely increase of SDA leads to joint roughness parameters such Z(2), Z(3) and R-p increases. The results showed that secondary roughness or unevenness has a great influence on roughness values. In general, it can be concluded that the shape and size of asperities are appropriate parameters to approach the field scale from the laboratory scale.

关键词： joint roughness classification geostatistical method generation algorithm JRC

来源：评论

学校读者我要写书评

暂无评论

Weakly Chordal Graphs: An Experimental Study

Weakly Chordal Graphs: An Experimental Study

引用

作者： Sudiksha Khanduja University of Windsor

学位级别：硕士

Graph theory is an important field that enables one to get general ideas about graphs and their properties. There are many situations (such as generating all linear layouts of weakly chordal graphs) where we want to generate instances to test algorithms for weakly chordal graphs. In my thesis, we address the algorithmic problem of generating weakly chordal graphs. A graph G=(V, E), where V is its vertices and E is its edges, is called a weakly chordal graph, if neither G nor its complement G', contains an induced chordless cycle on five or more vertices. Our work is in two parts. In the first part, we carry out a comparative study of two existing algorithms for generating weakly chordal graphs. The first algorithm for generating weakly chordal graphs repeatedly finds a two-pair and adds an edge between them. The second-generation algorithm starts by constructing a tree and then generates an orthogonal layout (also weakly chordal graph) based on this tree. Edges are then inserted into this orthogonal layout until there are $m$ edges. The output graphs from these two methods are compared with respect to several parameters like the number of four cycles, run times, chromatic number, the number of non-two-pairs in the graphs generated by the second method. In the second part, we propose an algorithm for generating weakly chordal graphs by edge deletions starting from an arbitrary input random graph. The algorithm starts with an arbitrary graph to be able to generate a weakly chordal graph by the basis of edge deletion. The algorithm iterates by maintaining weak chordality by preventing any hole or antihole configurations being formed for any successful deletion of an edge.

关键词： Antihole generation algorithm Graph Theory Hole Weakly Chordal Graphs

来源：评论

学校读者我要写书评

暂无评论

Quorum generation algorithm Based on the Longest-shortest Distance

引用

INTERNATIONAL JOURNAL OF ONLINE ENGINEERING 2013年第SPECIALISSUE.6期9卷 83-86页

作者： Li Meian Wang Buyu Gao Jing Inner Mongolia Agr Univ Coll Comp & Informat Engn Hohhot Peoples R China

Many algorithms on quorum generation have been proposed but those algorithms with cyclic quorum usually had a common defect that the nodes would congregate in a special area of the quorum at the end of the algorithm(Called this problem as CE). For resolving this problem, a new algorithm on quorum generation based on the longest-shortest distance has been proposed in this paper. This algorithm has the same quorum length and time complexity as Li's algorithm[8], but the space complexity is O( root N), lower than Li's algorithm[8]. And this algorithm has not the problem of CE. So based on the longest-shortest distance to chose a node to insert the quorum is an executive method on resolving the problem CE.

关键词： distance generation algorithm longestshortest distance quorum

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：