Vulnerability of sewer network – graph theoretic approach

2020 ◽  
Vol 196 ◽  
pp. 370-376
Author(s):  
Balaraman Ganesan ◽  
Sundareswaran Raman ◽  
Sujatha Ramalingam ◽  
Mustafa Erkan Turan ◽  
Goksen Bacak-Turan
Kybernetes ◽  
2019 ◽  
Vol 49 (6) ◽  
pp. 1767-1782
Author(s):  
Goldina Ghosh ◽  
C.B. Akki ◽  
Nivedita Kasturi

Purpose The purpose of this study is data generated from any social networking sites may provide some hidden knowledge on a particular domain. Based on this concept the previous paper had proved that social connectivity enhancement takes place through triadic closure and embeddedness in terms of social network graph-theoretic approach. Further, the work was justified by genetic algorithm (GA) where observation showed how interdisciplinary work can occur because of crossover, and therefore, different groups of researchers could be identified. Further enhancement of the work has been focused on in this paper. Design/methodology/approach In continuation with the previous work, this paper detects other possible fields related to “high graded researchers” who can share the information with the other group of researchers (“imminent high graded” and “new researchers”) using particle swarm optimization (PSO) technique. Findings While exploitation was done using GA in the previous work, exploration is done in the current work based on PSO using the same grade score value to the objective function. Both the velocity and direction of high graded researchers in this extended work could be derived, which was not possible using GA. Originality/value This could help the next two levels of researchers (“imminent high graded researchers” and “new researchers”) in expanding their research fields in line with the fields of high graded researchers.


Genetics ◽  
2003 ◽  
Vol 165 (4) ◽  
pp. 2235-2247
Author(s):  
Immanuel V Yap ◽  
David Schneider ◽  
Jon Kleinberg ◽  
David Matthews ◽  
Samuel Cartinhour ◽  
...  

AbstractFor many species, multiple maps are available, often constructed independently by different research groups using different sets of markers and different source material. Integration of these maps provides a higher density of markers and greater genome coverage than is possible using a single study. In this article, we describe a novel approach to comparing and integrating maps by using abstract graphs. A map is modeled as a directed graph in which nodes represent mapped markers and edges define the order of adjacent markers. Independently constructed graphs representing corresponding maps from different studies are merged on the basis of their common loci. Absence of a path between two nodes indicates that their order is undetermined. A cycle indicates inconsistency among the mapping studies with regard to the order of the loci involved. The integrated graph thus produced represents a complete picture of all of the mapping studies that comprise it, including all of the ambiguities and inconsistencies among them. The objective of this representation is to guide additional research aimed at interpreting these ambiguities and inconsistencies in locus order rather than presenting a “consensus order” that ignores these problems.


2020 ◽  
Vol 1706 ◽  
pp. 012115
Author(s):  
P Sangeetha ◽  
M Shanmugapriya ◽  
R Sundareswaran ◽  
K Sowmya ◽  
S Srinidhi

Sign in / Sign up

Export Citation Format

Share Document