scholarly journals Secure Sharing of Data using an Algorithm Namely KAN

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.

2018 ◽  
Vol 16 (2) ◽  
pp. 527-535 ◽  
Author(s):  
J. BEYZA ◽  
J. M. Yusta ◽  
G. J. Correa ◽  
H. F. Ruiz

2014 ◽  
Vol 602-605 ◽  
pp. 3363-3366
Author(s):  
Yi Ming Sun ◽  
Chun Lei Han

In order to automatically identify the mobile phones' reviews that the users comment on the mobile phone on the internet and obtain valuable information from the reviews, this paper presents the process of constructing ontology for the mobile phones' reviews and preliminarily establish a domain ontology of the mobile phones' reviews. The ontology construction adopts the Protégé tool and the Seven Steps method of Stanford University research. The ontology can provide convenience for the semantic information mining on Web mobile phones' reviews, and it can provide a new method to effectively mine the use feelings of the phone from a large number of mobile phone users' reviews.


2017 ◽  
Vol 8 (6) ◽  
pp. 4475-4488 ◽  
Author(s):  
Takayoshi Yoshimura ◽  
Satoshi Maeda ◽  
Tetsuya Taketsugu ◽  
Masaya Sawamura ◽  
Keiji Morokuma ◽  
...  

The reaction mechanism of the cationic rhodium(i)–BINAP complex catalysed isomerisation of allylic amines was explored using the artificial force induced reaction method with the global reaction route mapping strategy.


2016 ◽  
Vol 46 (7) ◽  
pp. 914-923 ◽  
Author(s):  
Jonathan L.W. Ruppert ◽  
Marie-Josée Fortin ◽  
Eldon A. Gunn ◽  
David L. Martell

The fragmentation and loss of old-growth forest has led to the decline of many forest-dwelling species that depend on old-growth forest as habitat. Emblematic of this issue in many areas of the managed boreal forest in Canada is the threatened woodland caribou (Rangifer tarandus caribou (Gmelin, 1788)). We develop a methodology to help determine when and how timber can be harvested to best satisfy both industrial timber supply and woodland caribou habitat requirements. To start, we use least-cost paths based on graph theory to determine the configuration of woodland caribou preferred habitat patches. We then developed a heuristic procedure to schedule timber harvesting based on a trade-off between merchantable wood volume and the remaining amount of habitat and its connectivity during a planning cycle. Our heuristic can attain 84% of the potential woodland caribou habitat that would be available in the absence of harvesting at the end of a 100 year planning horizon. Interestingly, this is more than that which is attained by the current plan (50%) and a harvesting plan that targets high volume stands (32%). Our results indicate that our heuristic procedure (i.e., an ecologically tuned optimization approach) may better direct industrial activities to improve old-growth habitat while maintaining specified timber production levels.


2015 ◽  
Vol 30 ◽  
pp. 196-202 ◽  
Author(s):  
A. Mikolajczak ◽  
D. Maréchal ◽  
T. Sanz ◽  
M. Isenmann ◽  
V. Thierion ◽  
...  

2000 ◽  
Vol 18 (4-5) ◽  
pp. 553
Author(s):  
Leslie A. Kuhn ◽  
Brandon Hespenheide ◽  
Andrew J. Rader ◽  
M.F. Thorpe
Keyword(s):  

1983 ◽  
Vol 48 (8) ◽  
pp. 2097-2117 ◽  
Author(s):  
Vladimír Kvasnička

A graph-theory formalism of the organic chemistry is suggested. The molecular system is considered as a multigraph with loops, the vertices are evaluated by their mapping onto the vocabulary of vertex labels (e.g. atomic symbols). A multiedge of multiplicity t corresponds to a t-tuple (single, double, triple, etc) bond. The chemical reaction of molecular systems is treated by the transformation of graphs. The suggested graph-theory approach allows to formalize many notions and concepts that are naturally emerging in the computer simulation of organic chemistry.


Sign in / Sign up

Export Citation Format

Share Document