REMOVAL OF DEGENERACY IN THE TOPOLOGICAL INDICES OF COSPECTRAL GRAPHS USING EDGE WEIGHTED MOLECULAR GRAPHS

Two graphs having the same number of vertices connected in the same way are said to be isomorphic. Topological matrices representing such graphs will have the same eigen value spectrum. Hence isomorphic graphs are also known as co spectral or iso spectral graphs.  There are certain molecular graphs representing chemically different substances which are found to be co spectral graphs. Therefore the molecular descriptors calculated using topological matrices will not be able to distinguish between these molecules.  Under such circumstances, edge weighted topological matrices can be formulated so that, their eigen value spectrum will be unique. The edge weighted molecular graphs with bond length as the weight for the edges in adjacency and distance matrices distinguish between the molecules having similar molecular graphs. So different molecules having the same molecular graph will have the same topological indices, but the edge weighted adjacency and distance matrices have the ability to overcome this problem of degeneracy

User Perception of Library Services in Public Libraries in Western Tamilnadu with special reference to Salem District: a Case Study

Public libraries are always called ‘People’s University’ as it provides education to all and to improve Information literacy, empowerment, and cultural heritage. Public libraries facilitate a variety of services to the user community. This study has made an attempt to investigate the current trends of user perception in terms of library services and availability of resources in public libraries in western Tamilnadu particularly in District Central Public Library at Salem. This study tried to focus to evaluate regarding the gender and age wise distribution, Marital status and Educational qualifications, Occupation wise distribution, and Membership status, Residence wise distribution, Availability of library resources, Frequency of Library visit, and Time spent in Library, Purpose of visiting the Library, Information search pattern, Level of satisfaction about Journals / Magazines, and Level of satisfaction regarding Internet services, and Opinion about overall library services etc. For data analysis, a total number of 200 well-designed questionnaires were selected and distributed to the user community who are coming to Salem district public library. Out of 200 samples, we received only 186 dully filled questionnaires were returned. Further, the data has been worked out with relevant statistical tools such as simple percentage and average and so on

User Perception of Library Services in Public Libraries in Western Tamilnadu with special reference to Salem District: a Case Study

Public libraries are always called ‘People’s University’ as it provides education to all and to improve Information literacy, empowerment, and cultural heritage. Public libraries facilitate variety of services to the user community. This study has made an attempt to investigate the current trends of user perception in terms of library services and availability of resources in public libraries in western Tamilnadu particularly in District Central Public Library at Salem. This study tired to focus to evaluate regarding the gender and age wise distribution, Marital status and Educational qualifications, Occupation wise distribution, and Membership status, Residence wise distribution, Availability of library resources, Frequency of Library visit, and Time spent in Library, Purpose of visiting the Library, Information search pattern, Level of satisfaction about Journals / Magazines, and Level of satisfaction regarding Internet services, and Opinion about overall library services etc. For data analysis, a total number of 200 well designed questionnaires were selected and distributed to the user community who are coming to Salem district public library. Out of 200 samples, we received only 186 dully filled questionnaires were returned. Further, the data has been worked out with relevant statistical tools such as simple percentage and average and so on

Effect of axial mixing in gas absorption

The effect of axial mixing in the liquid phase on the performance of a gas absorption column was studied using the experimental data of Michael Brittan for the carbon dioxide and water system. In this study, piston flow conditions were assumed for the gas phase. A one-parameter mathematical model, which characterized the flow regimes in both the gas and the liquid phases undergoing plug flow conditions, was first curve fitted for its unknown parameter (i.e. the Number of Transfer Units) by a non-linear regression analysis procedure. The AAPD (i.e. the Average Absolute Percentage Deviation between the predicted value of the gas phase concentration and the experimental data) was also computed for each set of data. An attempt was made to curve-fit a two-parameter mathematical model, which assumed plug flow in the gas phase but axial mixing in the water phase, by a similar non-linear regression analysis procedure. However, in the iterative technique used, the values of the unknown parameters (i.e. , the water phase axial mixing parameter and the number of transfer units) failed to converge. As an alternate to this procedure a graphical method was used to study the effect of the axial mixing parameter on the value of the AAPD . The results obtained from the analysis of the two mathematical models were examined. A comparison showed that the AAPD computed for both the models were very close; hence, it was concluded that the effect of axial mixing in the water phase, for the nitrogen carbon dioxide-water system based on the data obtained by Brittan and Woodburn⁽²⁾ has little influence on the gas-absorption column--Abstract, Pages iv-v

Visual servoing-based augmented reality

The notion of Augmented Reality (AR) is to mix computer-generated, synthetic elements (3D/2D graphics, 3D audio) with real world in such a way that the synthetic elements appear to be part of the real world. There are various techniques to accomplish this, including magnetic tracking of position and orientation, and video-based tracking. This paper focuses on the video-based AR i

A system for synthetic vision and augmented reality in future flight decks

Rockwell Science Center is investigating novel human-computer interaction techniques for enhancing the situational awareness in future flight decks. One aspect is to provide intuitive displays that provide the vital information and the spatial awareness by augmenting the real world with an overlay of relevant information registered to the real world. Such Augmented Reality (AR) techniques can be employed during bad weather scenarios to permit flying in Visual Flight Rules (VFR) in conditions which would normally require Instrumental Flight Rules (IFR). These systems could easily be implemented on heads-up displays (HUD). The advantage of AR systems vs. purely synthetic vision (SV) systems is that the pilot can relate the information overlay to real objects in the world, whereas SV systems provide a constant virtual view, where inconsistencies can hardly be detected. The development of components for such a system led to a demonstrator implemented on a PC. A camera grabs video images which are overlaid with registered information. Orientation of the camera is obtained from an inclinometer and a magnetometer; position is acquired from GPS. In a possible implementation in an airplane, the on-board attitude information can be used for obtaining correct registration. If visibility is sufficient, computer vision modules can be used to fine-tune the registration by matching visual cues with database features. This technology would be especially useful for landing approaches. The current demonstrator provides a frame-rate of 15 fps, using a live video feed as background with an overlay of avionics symbology in the foreground. In addition, terrain rendering from a 1 arc sec. digital elevation model database can be overlaid to provide synthetic vision in case of limited visibility. For true outdoor testing (on ground level), the system has been implemented on a wearable computer

Integrity and domination integrity of gear graphs

C.A. Barefoot, et. al. [4] introduced the concept of the integrity of a graph. It is an useful measure of vulnerability and it is defined as follows. I(G) = min{|S| + m(G − S) : S ⊂ V (G)}, where m(G − S) denotes the order of the largest component in G − S. Unlike the connectivity measures, integrity shows not only the difficulty to break down the network but also the damage that has been caused. A subset S of V (G) is said to be an I-set if I(G) = |S| + m(G − S). We introduced a new vulnerability parameter in [4],namely domination integrity of a graph G. It is a defined as DI(G) = min{|S| + m(G − S)}, where S is a dominating set of G and m(G − S) denotes the order of the largest component in G − S. K.S. Bagga,et. al. [2] gave a formula for I(K2 × Cn). In this paper, we give a correct formula for I(K2 × Cn). We find some results on the integrity and domination integrity of gear graphs.Publisher's Versio

Computational complexity of domination integrity in graphs

In a graph G, those dominating sets S which give minimum value for |S| + m(G−S), where m(G−S) denotes the maximum order of a component of G−S, are called dominating integrity sets of G (briefly called DI-sets of G). This concept combines two important aspects namely domination and integrity in graphs. In this paper, we Show that the decision problem domination integrity is NP-complete even when restricted to planar or chordal graphs.Publisher's Versio

Distance majorization sets in graphs

Let G = (V, E) be a simple graph. A subset D of V (G) is said to be a distance majorization set (or dm - set) if for every vertex u ∈ V − D, there exists a vertex v ∈ D such that d(u, v) ≥ deg(u) + deg(v). The minimum cardinality of a dm - set is called the distance majorization number of G (or dm - number of G) and is denoted by dm(G), Since the vertex set of G is a dm - set, the existence of a dm – set in any graph is guaranteed. In this paper, we find the dm - number of standard graphs like Kn, K1,n, Km,n, Cn, Pn, compute bounds on dm− number and dm- number of self complementary graphs and mycielskian of graphs.Publisher's Versio