74.6 The Euclidean Algorithm and Fibonacci

1990 ◽  
Vol 74 (467) ◽  
pp. 47 ◽  
Author(s):  
Ian Cook
Keyword(s):  
2017 ◽  
Vol 9 (1) ◽  
Author(s):  
František Marko ◽  
Alexandr N. Zubkov ◽  
Martin Juráš

AbstractWe develop a public-key cryptosystem based on invariants of diagonalizable groups and investigate properties of such a cryptosystem first over finite fields, then over number fields and finally over finite rings. We consider the security of these cryptosystem and show that it is necessary to restrict the set of parameters of the system to prevent various attacks (including linear algebra attacks and attacks based on the Euclidean algorithm).


Author(s):  
Shunjiang Ma ◽  
Gaicheng Liu ◽  
Zhiwu Huang

With the development of sports in colleges and universities, the research on innovation reform of sports industry has been deepened. Therefore, based on the above situation, a study of the status quo and development direction of sports industry in colleges and universities based on the Euclid algorithm is proposed. In the research here, according to the traditional sports industry concept to sum up, and then according to the advantages of computer technology to deal with the relevant data. In order to realize good overlap between data, an application of Euclidean algorithm is proposed. In the test of Euclidean algorithm, the efficiency and function of the algorithm are tested comprehensively, and the test results show that the research is feasible.


2003 ◽  
Vol 32 (2) ◽  
pp. 548-556 ◽  
Author(s):  
Xinmao Wang ◽  
Victor Y. Pan

2021 ◽  
Author(s):  
Xingang Jia ◽  
Qiuhong Han ◽  
Zuhong Lu

Abstract Background: Phages are the most abundant biological entities, but the commonly used clustering techniques are difficult to separate them from other virus families and classify the different phage families together.Results: This work uses GI-clusters to separate phages from other virus families and classify the different phage families, where GI-clusters are constructed by GI-features, GI-features are constructed by the togetherness with F-features, training data, MG-Euclidean and Icc-cluster algorithms, F-features are the frequencies of multiple-nucleotides that are generated from genomes of viruses, MG-Euclidean algorithm is able to put the nearest neighbors in the same mini-groups, and Icc-cluster algorithm put the distant samples to the different mini-clusters. For these viruses that the maximum element of their GI-features are in the same locations, they are put to the same GI-clusters, where the families of viruses in test data are identified by GI-clusters, and the families of GI-clusters are defined by viruses of training data.Conclusions: From analysis of 4 data sets that are constructed by the different family viruses, we demonstrate that GI-clusters are able to separate phages from other virus families, correctly classify the different phage families, and correctly predict the families of these unknown phages also.


Sign in / Sign up

Export Citation Format

Share Document