An Efficient and Stable Algorithm for Learning Rotations

In recent years,china input in the construction of the network management is constantly increasing;information technology has improved continuously,but,making a variety of network security incidents occur frequently,due to the vulnerability of the computer network system inherent,a direct impact on national security and social and political stability. Because of the popularity of computers and large-scale development of the Internet, network security has been increasing as the theme. Reasonable safeguards against violations of resources; regular Internet user behavior and so on has been the public's expectations of future Internet. This paper described a stable method of getting telnet user’s account in development of network management based on telnet protocol.

Download Full-text

An Optimal and Stable Algorithm for Clustering Numerical Data

Algorithms ◽

10.3390/a14070197 ◽

2021 ◽

Vol 14 (7) ◽

pp. 197

Author(s):

Ali Seman ◽

Azizian Mohd Sapawi

Keyword(s):

Standard Deviation ◽

Real World ◽

Clustering Algorithm ◽

Numerical Data ◽

Zero Point ◽

The Other ◽

Suitable Alternative ◽

Stable Algorithm ◽

Real World Applications

In the conventional k-means framework, seeding is the first step toward optimization before the objects are clustered. In random seeding, two main issues arise: the clustering results may be less than optimal and different clustering results may be obtained for every run. In real-world applications, optimal and stable clustering is highly desirable. This report introduces a new clustering algorithm called the zero k-approximate modal haplotype (Zk-AMH) algorithm that uses a simple and novel seeding mechanism known as zero-point multidimensional spaces. The Zk-AMH provides cluster optimality and stability, therefore resolving the aforementioned issues. Notably, the Zk-AMH algorithm yielded identical mean scores to maximum, and minimum scores in 100 runs, producing zero standard deviation to show its stability. Additionally, when the Zk-AMH algorithm was applied to eight datasets, it achieved the highest mean scores for four datasets, produced an approximately equal score for one dataset, and yielded marginally lower scores for the other three datasets. With its optimality and stability, the Zk-AMH algorithm could be a suitable alternative for developing future clustering tools.

Download Full-text

Stable Numerical Evaluation of Finite Hankel Transforms and Their Application

International Journal of Analysis ◽

10.1155/2014/670562 ◽

2014 ◽

Vol 2014 ◽

pp. 1-11 ◽

Cited By ~ 1

Author(s):

Manoj P. Tripathi ◽

B. P. Singh ◽

Om P. Singh

Keyword(s):

Stability Analysis ◽

Heat Equation ◽

Numerical Experiments ◽

Numerical Evaluation ◽

Radiation Condition ◽

Hankel Transform ◽

Basis Functions ◽

Infinite Cylinder ◽

Stable Algorithm ◽

Hankel Transforms

A new stable algorithm, based on hat functions for numerical evaluation of Hankel transform of order ν>-1, is proposed in this paper. The hat basis functions are used as a basis to expand a part of the integrand, rf(r), appearing in the Hankel transform integral. This leads to a very simple, efficient, and stable algorithm for the numerical evaluation of Hankel transform. The novelty of our paper is that we give error and stability analysis of the algorithm and corroborate our theoretical findings by various numerical experiments. Finally, an application of the proposed algorithm is given for solving the heat equation in an infinite cylinder with a radiation condition.

Download Full-text