scholarly journals New Method for Image Analyze using Mathematical Method of Graph theory and it's Application in Robot Laser Hardening

2015 ◽  
Vol 19 (1) ◽  
pp. 28-35
Author(s):  
Matej Babič

Large amount of data is transferred through the internet, which is highly insecure. This can cause disruption of data due to attacks. To resist those attacks, the analysts are centered on the distinctive sort of systems to verify the information from assaults. Some of the techniques are AES, DES, and Digital Signatures etc. These techniques are not providing abnormal state proficient of security. So, in order to increase the efficiency level, we proposed a new method called KAN algorithm which is an extension of RSA algorithm to enhance the security of normal data by utilizing graph theory approach. This algorithm can be applicable for military basis and highly information secure system.


Author(s):  
Олександр Анатолійович Рева ◽  
Юрій Костянтинович Давидовський

The subject matters of the article are design, creation and modernization of the computer networks. The goal is to create algorithm which will allow to build new network design based on an existing one using graph theory and optimization algorithms. The tasks to be solved are: to make a review of the rates of modernization of the computer networks; to analyze the market of telecom companies that offer to create network design; to seek for the automated solutions of this task; to create a method of automated network modernization which allow to decrease human influence on the network creation process; to create software implementation of such method on test environment. The methods used are: graph theory, optimization algorithms, algorithmic modelling. The following results were obtained: based on the prepared analysis and data from such sources as Cisco, Nokia, DataGroup etc. were described the need and importance of the specialists and solutions which can create high-quality network design; were noted the criteria to describe the network from the point of view of a network-provider company like reliability, quality of service and cost of network design and implementation; the network was described using graphs and based on the graph theory was selected the most efficient graph-network – divalent graph topology; during the creation of the new method was used common approach but with one important improvement which allows not to build a completely new network to add its structure to the existing one but to modernize an existing network topology to increase cost-efficiency of the design. Conclusions. The scientific novelty of the results obtained is as follows: 1) the networks were described as graphs that should allow to use algorithmic modelling to the process of data transfer through the network in the future; 2) new method has optimized the process of the network design by using and considering the resources that are already in use by network provides such as routers, switches and communication channels. In the future there is an idea to improve this method by adding a module of network modelling which will allow not only to create network design but also to describe its advantages and disadvantages


2018 ◽  
Vol 19 (6) ◽  
pp. 636-639
Author(s):  
Irena Nowotyńska ◽  
Stanisław Kut ◽  
Krzysztof Kogut

The main problem occurring during the laser hardening of tools is the lack of continuity and diversity of surface layer properties as a result of the use of many parallel hardening paths. As a consequence, there may be a forgiven or under-hardened area between successive paths. The paper presents the original method of laser hardening of tools, especially bending, using a laser beam splitter. Such a hardening method enables simultaneous heating and tempering of the tool corner and the surfaces adjoining it at the desired width in one pass with the same parameters. As a consequence, the hardened layer is uniform on the surface of the corner and adjacent surfaces, i.e. without forgiven or unhardened areas. The use of this method requires equipping the hardening laser head with a divider, whose task is to distribute the laser beam to separate parts of the beam with adjustable width by means of appropriately placed mirrors. The new method of hardening not only eliminates the problem of so-called hardening marks created as a result of laser hardening, which directly affects the quality, durability and durability of the tool, but is also much more efficient and also beneficial for economic reasons.


2021 ◽  
Vol 58 (1) ◽  
pp. 3428-3434
Author(s):  
W. W. P. M. T. M. Karunasena, G. S. Wijesiri

DNA is a complex molecule that consists of biological information that is passed down from generation to generation. With the evolution over time, there are different kinds of species that evolved from a common ancestor because of the occurrence of DNA sequence rearrangements. DNA sequence similarity analysis is a major challenge since the number of sequences is rapidly increasing in the DNA database. In this research, we based a mathematical method to analyze the similarity of two DNA sequences using Graph Theory. This mathematical method started by modeling a weighted directed graph for each DNA sequence, constructing its adjacency matrix, and converting it to the representative vector for each graph. From these vectors, the similarity was determined by distance measurements such as Euclidean, Cosine, and Correlation. By keeping this method as the based method, we will check whether it is applicable for any DNA fragments in considered genomes and molecular similarity coefficients can be used as distance measurements. We will obtain similarities using the graph spectrum instead of the representative vector. Then we will compare the results from the representative vector and that of the graph spectrum. The modified method is tested by using the mitochondrial DNA of Human, Gorilla, and Orangutan. It gives the same result when the number of nucleotides in DNA fragments is increased.


2020 ◽  
pp. 52-59
Author(s):  
A. E. Semenov ◽  
R.P. Belikov

Predicting injury in any field of activity is an integral part of a broader trend: predicting working conditions. This direction is a new method and is in the process of formation. However, in comparison with the existing areas of forecasting (demographic, fundamental research, economic, etc.), there are general principles that should be used. What is common is the mathematical apparatus and the principle itself. An independent source of information for forecasting, its reliability, and places of concentration. According to most researchers, the most reliable method for predicting injuries is the mathematical method of analysis.


2020 ◽  
Vol 497 (3) ◽  
pp. 2954-2973
Author(s):  
Trystan S Lambert ◽  
R C Kraan-Korteweg ◽  
T H Jarrett ◽  
L M Macri

ABSTRACT We present the galaxy group catalogue for the recently completed 2MASS Redshift Survey (2MRS; Macri et al. 2019) which consists of 44 572 redshifts, including 1041 new measurements for galaxies mostly located within the Zone of Avoidance. The galaxy group catalogue is generated by using a novel, graph-theory based, modified version of the friends-of-friends algorithm. Several graph-theory examples are presented throughout this paper, including a new method for identifying substructures within groups. The results and graph-theory methods have been thoroughly interrogated against previous 2MRS group catalogues and a Theoretical Astrophysical Observatory (TAO) mock by making use of cutting-edge visualization techniques including immersive facilities, a digital planetarium, and virtual reality. This has resulted in a stable and robust catalogue with on-sky positions and line-of-sight distances within 0.5 and 2 Mpc, respectively, and has recovered all major groups and clusters. The final catalogue consists of 3022 groups, resulting in the most complete ‘whole-sky’ galaxy group catalogue to date. We determine the 3D positions of these groups, as well as their luminosity and comoving distances, observed and corrected number of members, richness metric, velocity dispersion, and estimates of R200 and M200. We present three additional data products, i.e. the 2MRS galaxies found in groups, a catalogue of subgroups, and a catalogue of 687 new group candidates with no counterparts in previous 2MRS-based analyses.


Sign in / Sign up

Export Citation Format

Share Document