Abstract: | A periphery transversal of a median graph G is introduced as a set of vertices that meets all the peripheral subgraphs of G. Using this concept, median graphs with geodetic number 2 are characterized in two ways. They are precisely the median graphs that contain a periphery transversal of order 2 as well as the median graphs for which there exists a profile such that the remoteness function is constant on G. Moreover, an algorithm is presented that decides in O(mlog n) time whether a given graph G with n vertices and m edges is a median graph with geodetic number 2. Several additional structural properties of the remoteness function on hypercubes and median graphs are obtained and some problems listed |
Description: | University of Ljubljana Institute of Mathematics, Physics and Mechanics Department of Mathematics Preprint series, Vol. 46 (2008), 1046 |
URI: | http://dyuthi.cusat.ac.in/purl/4237 |
Files | Size |
---|---|
Median Graphs, ... nd Geodetic Number Two.pdf | (256.4Kb) |
Abstract: | This paper attempts to develop an improved tool, which would read two dimensional(2D) cardiac MRI images and compute areas and volume of the scar tissue. Here the computation would be done on the cardiac MR images to quantify the extent of damage inflicted by myocardial infarction on the cardiac muscle (myocardium) using Interpolation |
Description: | PROCEEDINGS OF ICETECT 2011 |
URI: | http://dyuthi.cusat.ac.in/purl/4236 |
Files | Size |
---|---|
Area and Volume ... rt using Interpolation.pdf | (2.006Mb) |
Abstract: | In our study we use a kernel based classification technique, Support Vector Machine Regression for predicting the Melting Point of Drug – like compounds in terms of Topological Descriptors, Topological Charge Indices, Connectivity Indices and 2D Auto Correlations. The Machine Learning model was designed, trained and tested using a dataset of 100 compounds and it was found that an SVMReg model with RBF Kernel could predict the Melting Point with a mean absolute error 15.5854 and Root Mean Squared Error 19.7576 |
Description: | PROCEEDINGS OF ICETECT 2011 |
URI: | http://dyuthi.cusat.ac.in/purl/4235 |
Files | Size |
---|---|
Using Neural Ne ... Drug – like compounds.pdf | (1.156Mb) |
Abstract: | The median problem is a classical problem in Location Theory: one searches for a location that minimizes the average distance to the sites of the clients. This is for desired facilities as a distribution center for a set of warehouses. More recently, for obnoxious facilities, the antimedian was studied. Here one maximizes the average distance to the clients. In this paper the mixed case is studied. Clients are represented by a profile, which is a sequence of vertices with repetitions allowed. In a signed profile each element is provided with a sign from f+; g. Thus one can take into account whether the client prefers the facility (with a + sign) or rejects it (with a sign). The graphs for which all median sets, or all antimedian sets, are connected are characterized. Various consensus strategies for signed profiles are studied, amongst which Majority, Plurality and Scarcity. Hypercubes are the only graphs on which Majority produces the median set for all signed profiles. Finally, the antimedian sets are found by the Scarcity Strategy on e.g. Hamming graphs, Johnson graphs and halfcubes |
Description: | Ars Math. Contemp. 6 (2013) 127–145 |
URI: | http://dyuthi.cusat.ac.in/purl/4234 |
Files | Size |
---|---|
Consensus strat ... ned profiles on graphs.pdf | (315.9Kb) |
Abstract: | Magnetic Resonance Imaging play a vital role in the decision-diagnosis process of brain MR images. For an accurate diagnosis of brain related problems, the experts mostly compares both T1 and T2 weighted images as the information presented in these two images are complementary. In this paper, rotational and translational invariant form of Local binary Pattern (LBP) with additional gray scale information is used to retrieve similar slices of T1 weighted images from T2 weighted images or vice versa. The incorporation of additional gray scale information on LBP can extract more local texture information. The accuracy of retrieval can be improved by extracting moment features of LBP and reweighting the features based on users’ feedback. Here retrieval is done in a single subject scenario where similar images of a particular subject at a particular level are retrieved, and multiple subjects scenario where relevant images at a particular level across the subjects are retrieved |
Description: | International Journal of Electrical, Robotics, Electronics and Communications Engineering Vol:7 No:8, 2013 |
URI: | http://dyuthi.cusat.ac.in/purl/4233 |
Files | Size |
---|---|
Content Based I ... ross Different Classes.pdf | (1.187Mb) |
Abstract: | Antimedian graphs are introduced as the graphs in which for every triple of vertices there exists a unique vertex x that maximizes the sum of the distances from x to the vertices of the triple. The Cartesian product of graphs is antimedian if and only if its factors are antimedian. It is proved that multiplying a non-antimedian vertex in an antimedian graph yields a larger antimedian graph. Thin even belts are introduced and proved to be antimedian. A characterization of antimedian trees is given that leads to a linear recognition algorithm. |
URI: | http://dyuthi.cusat.ac.in/xmlui/purl/2009 |
Files | Size |
---|---|
Antimedian graphs.pdf | (151.5Kb) |
Dyuthi Digital Repository Copyright © 2007-2011 Cochin University of Science and Technology. Items in Dyuthi are protected by copyright, with all rights reserved, unless otherwise indicated.