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 an...
详细信息
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.
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, correspondin...
详细信息
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.
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 clus...
详细信息
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.
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(C...
详细信息
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.
A nonlinear substitution operation of bytes is the main strength factor of the Advanced Encryption Standard (AES) and other modern cipher systems. In this paper we have presented a new simple algorithm to generate key...
详细信息
A nonlinear substitution operation of bytes is the main strength factor of the Advanced Encryption Standard (AES) and other modern cipher systems. In this paper we have presented a new simple algorithm to generate key-dependent S-boxes and inverse S-boxes for block cipher systems. The quality of this algorithm was tested by using NIST tests, and changing only one bit of the secret key to generate new key-dependent S-boxes. The fact that the S-boxes are key-dependent and unknown is the main strength of the algorithm, since the linear and differential cryptanalysis require known S-boxes. In the second section of the paper, we analyze S-boxes. In the third section we describe the key-dependent S-boxes and inverse S-boxes generation algorithm. Afterwards, we experimentally investigate the quality of the generated key-dependent S-boxes. Comparison results suggest that the key-dependent S-boxes have good performance and can be applied to AES.
In 2012, Page presented a sequential combinatorial generation algorithm for generalized types of restricted weak integer compositions called second order restricted weak integer compositions. Second order restricted w...
详细信息
In 2012, Page presented a sequential combinatorial generation algorithm for generalized types of restricted weak integer compositions called second order restricted weak integer compositions. Second order restricted weak integer compositions cover various types of restricted weak integer compositions of n parts such as integer compositions, bounded compositions, and part wise integer compositions. In this paper, we present a parallel algorithm that derives from our parallelization of Page's sequential algorithm with a focus on load balancing for shared memory machines.
In this paper, we present two new ranking and unranking algorithms for z-sequences in Gray-code order. These algorithms are designed based on a loopless generation algorithm which is given for z-sequences correspondin...
详细信息
In this paper, we present two new ranking and unranking algorithms for z-sequences in Gray-code order. These algorithms are designed based on a loopless generation algorithm which is given for z-sequences corresponding to t-ary trees by Roelants van Baronaigien and Xiang et al. Up to our knowledge no other ranking and unranking algorithms are given for Gray-codes corresponding to t-ary trees. The time complexity of both algorithms for t-ary trees with n nodes is O(n(2)t).
A neuronal tree is a rooted tree with n leaves whose each internal node has at least two children;this class not only is defined based on the structure of dendrites in neurons, but also refers to phylogenetic trees or...
详细信息
A neuronal tree is a rooted tree with n leaves whose each internal node has at least two children;this class not only is defined based on the structure of dendrites in neurons, but also refers to phylogenetic trees or evolutionary trees. More precisely, neuronal trees are rooted-multistate phylogenetic trees whose size is defined as the number of leaves. In this paper, a new encoding over an alphabet of size 3 (minimal cardinality) is introduced for representing the neuronal trees with a given number of leaves. This encoding is used for generating neuronal trees with n leaves in A-order with constant average time and O(n) time complexity in the worst case. Also, new ranking and unranking algorithms are presented in time complexity of O(n) and O(n log n), respectively.
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 t...
详细信息
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
The paper addresses the problem of generating sentences from logical formulae. It describes a simple and efficient algorithm for generating text which has been developed for use in machine translation, but will have w...
详细信息
The paper addresses the problem of generating sentences from logical formulae. It describes a simple and efficient algorithm for generating text which has been developed for use in machine translation, but will have wider application in natural language processing. An important property of the algorithm is that the logical form used to generate a sentence need not be one which could have been produced by parsing the sentence: formal equivalence between logical forms is allowed for. This is necessary for a machine translation system, such as the one envisaged in this paper, which uses single declarative grammars of individual languages, and declarative statements of translation equivalences for transfer. In such a system, it cannot be guaranteed that transfer will produce a logical form in the same order as would have been produced by parsing some target-language sentence, and it is not practicable to define a normal form for the logical forms. The algorithm is demonstrated using a categorial grammar and a simple indexed logic, as this allows a particularly clear and elegant formulation. It is shown that the algorithm can be adapted to phrase-structure grammars, and to more complex semantic representations than that used here.
暂无评论