p-clean properties in amalgamated rings

Let A be a ring. Then A is called p-clean ring if each element in A express as the sum of an idempotent and pure element. Let f : A → B be a ring homomorphism and J be an ideal of B. The amalgamation of A with B along J with respct to f is a new ring structure introduced and studied by Anna et al. in 2009. This construction is a generalization of the amalgamated duplication of a ring along an ideal and other classical constructions such as the A + XB[X] and A + XB[[X]] constuctions. In this paper, the transfer of the notion of p-clean rings to the amalgamation of rings along ideal is studied. In particular, the necessary and sufficient conditions for  amalgamation to be a p-clean ring are studied

Superpower graphs of finite groups

Funding: Ajay Kumar is supported by CSIR-UGC JRF, New Delhi, India, through Ref No.: 19/06/2016(i) EU-V/Roll No. 417267. Lavanya Selvaganesh is partially supported by SERB, India, through Grant No. MTR/2018/000254 under the scheme MATRICS. T. Tamizh Chelvam is supported by CSIR Emeritus Scientist Scheme of Council of Scientific and Industrial Research (No.21(1123)/20/EMR-II), Government of India.For a finite group G, the superpower graph S(G) of G is an undirected simple graph with vertex set G and two vertices are adjacent in S(G) if and only if the order of one divides the order of the other in G. The aim of this paper is to provide tight bounds for the vertex connectivity, discuss Hamiltonian-like properties of superpower graph of finite non-abelian groups having an element of exponent order. We also give some general results about superpower graphs and their relation to other graphs such as the Gruenberg–Kegel graph.Peer reviewe

A Note on Strongly Gorenstein X-Flat Modules

Mao and Ding introduced the concept of injective modules. D. Bennis and N. Mahdou introduced and studied the concept of strongly Gorenstein projective and injective modules. In this article, we have introduced and examined strongly Gorenstein-flat modules, which are the generalizations of strongly flat modules. Further, we have linked them with the strongly Gorenstein-projective module

A Note On Strongly Gorenstein X-Flat Modules

Mao and Ding introduced the concept of injective modules. D. Bennis and N. Mahdou introduced and studied the concept of strongly Gorenstein projective and injective modules. In this article, we have introduced and examined strongly Gorenstein-flat modules, which are the generalizations of strongly flat modules. Further, we have linked them with the strongly Gorenstein-projective module

Degradation aspects of water formation and transport in Proton Exchange Membrane Fuel Cell: A review

This review paper summarises the key aspects of Proton Exchange Membrane Fuel Cell (PEMFC) degradation that are associated with water formation, retention, accumulation, and transport mechanisms within the cell. Issues related to loss of active surface area of the catalyst, ionomer dissolution, membrane swelling, ice formation, corrosion, and contamination are also addressed and discussed. The impact of each of these water mechanisms on cell performance and durability was found to be different and to vary according to the design of the cell and its operating conditions. For example, the presence of liquid water within Membrane Electrode Assembly (MEA), as a result of water accumulation, can be detrimental if the operating temperature of the cell drops to sub-freezing. The volume expansion of liquid water due to ice formation can damage the morphology of different parts of the cell and may shorten its life-time. This can be more serious, for example, during the water transport mechanism where migration of Pt particles from the catalyst may take place after detachment from the carbon support. Furthermore, the effect of transport mechanism could be augmented if humid reactant gases containing impurities poison the membrane, leading to the same outcome as water retention or accumulation. Overall, the impact of water mechanisms can be classified as aging or catastrophic. Aging has a long-term impact over the duration of the PEMFC life-time whereas in the catastrophic mechanism the impact is immediate. The conversion of cell residual water into ice at sub-freezing temperatures by the water retention/ accumulation mechanism and the access of poisoning contaminants through the water transport mechanism are considered to fall into the catastrophic category. The effect of water mechanisms on PEMFC degradation can be reduced or even eliminated by (a) using advanced materials for improving the electrical, chemical and mechanical stability of the cell components against deterioration, and (b) implementing effective strategies for water management in the cell

ADOPTION OF AN INTEGRATED NEAR FIELD COMMUNICATION AND NATURAL LANGUAGE PROCESSING SYSTEM TOWARD IMPROVEMENT OF TELEHEALTH SOLUTIONS

Telehealth is the usage of digital medical data and telecommunication technologies to aid long-distance clinical healthcare. Proper maintenance of a patient’s medical record has been a hindrance toward the growth of Telehealth services. The patient’s data, particularly emergency data, must be available to medical personnel within a short time frame and independent of potential interruption of network connections. In this paper, we propose a Near Field Communication (NFC) wristband that provides access to the medical details, history and contact details of a patient. By this, the doctor or the paramedical officer can provide the patient with the best treatment within a short period of time. This system comes in handy even if the patient is unconscious/unable to answer. The doctor or the paramedical officer can quickly draft a patient’s report and send it to the hospital. The proposed framework consists of the following four stages: (i) obtaining emergency medical data with the help of NFC chips, (ii) converting medical report into digital text using Optical Character Recognition (OCR), (iii) structuring the narrative medical text into organized data using NLP and (iv) comparative analysis of the selected content. An image database with 1200 medical case histories has been utilized for the algorithm development and validation. The OCR algorithms for converting images to text produced more than 98% on average and NLP algorithm produced around 94.1% accuracy. Overall, the performance of the system from NFC reader till analysis of the specific field is more than 95%. The developed OCR and NLP integrated software helps the doctor or the health officer to immediately convert it into text format and the unstructured text is quickly organized into the respective fields. </jats:p

Superpower graphs of finite groups

For a finite group G, the superpower graph S(G) of G is an undirected simple graph with vertex set G and two vertices are adjacent in S(G) if and only if the order of one divides the order of the other in G. The aim of this paper is to provide tight bounds for the vertex connectivity, discuss Hamiltonian-like properties of superpower graph of finite non-abelian groups having an element of exponent order.We also give some general results about superpower graphs and their relation to other graphs such as the Gruenberg–Kegel graph

Recent developments on the power graph of finite groups - a survey

Algebraic graph theory is the study of the interplay between algebraic structures (both abstract as well as linear structures) and graph theory. Many concepts of abstract algebra have facilitated through the construction of graphs which are used as tools in computer science. Conversely, graph theory has also helped to characterize certain algebraic properties of abstract algebraic structures. In this survey, we highlight the rich interplay between the two topics viz groups and power graphs from groups. In the last decade, extensive contribution has been made towards the investigation of power graphs. Our main motive is to provide a complete survey on the connectedness of power graphs and proper power graphs, the Laplacian and adjacency spectrum of power graph, isomorphism, and automorphism of power graphs, characterization of power graphs in terms of groups. Apart from the survey of results, this paper also contains some new material such as the contents of Section 2 (which describes the interesting case of the power graph of the Mathieu group M_{11}) and subsection 6.1 (where conditions are discussed for the reduced power graph to be not connected). We conclude this paper by presenting a set of open problems and conjectures on power graphs.<br/

Recent developments on the power graph of finite groups - a survey

Algebraic graph theory is the study of the interplay between algebraic structures (both abstract as well as linear structures) and graph theory. Many concepts of abstract algebra have facilitated through the construction of graphs which are used as tools in computer science. Conversely, graph theory has also helped to characterize certain algebraic properties of abstract algebraic structures. In this survey, we highlight the rich interplay between the two topics viz groups and power graphs from groups. In the last decade, extensive contribution has been made towards the investigation of power graphs. Our main motive is to provide a complete survey on the connectedness of power graphs and proper power graphs, the Laplacian and adjacency spectrum of power graph, isomorphism, and automorphism of power graphs, characterization of power graphs in terms of groups. Apart from the survey of results, this paper also contains some new material such as the contents of Section 2 (which describes the interesting case of the power graph of the Mathieu group M_{11}) and subsection 6.1 (where conditions are discussed for the reduced power graph to be not connected). We conclude this paper by presenting a set of open problems and conjectures on power graphs.<br/