Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2020 ( 9 )

2019 ( 537 )

2018 ( 596 )

2017 ( 634 )

Custom range...

Search Results: 1 - 10 of 319867 matches for " N. K. Shah "
All listed articles are free for downloading (OA Articles)
Page 1 /319867
Display every page Item
The Cardiorenal Syndrome: A Review
B. N. Shah,K. Greaves
International Journal of Nephrology , 2011, DOI: 10.4061/2011/920195
Abstract: Cardiorenal syndrome (CRS) is the umbrella term used to describe clinical conditions in which cardiac and renal dysfunctions coexist. Much has been written on this subject, but underlying pathophysiological mechanisms continue to be unravelled and implications for management continue to be debated. A classification system—incorporating five subtypes—has recently been proposed though it has yet to permeate into day-to-day clinical practice. CRS has garnered much attention from both the cardiological and nephrological communities since the condition is associated with significant morbidity and mortality. Renal dysfunction is highly prevalent amongst patients with heart failure and has been shown to be as powerful and independent a marker of adverse prognosis as ejection fraction. Similarly, patients with renal failure are considerably more likely to suffer cardiovascular disease than matched subjects from the general population. This paper begins by reviewing the epidemiology and classification of CRS before going on to consider the different pathological mechanisms underlying cardiorenal dysfunction. We then focus on management strategies and conclude by discussing future directions in the diagnosis and management of patients suffering with CRS.
Thermolysis of Semicarbazones to the Corresponding Azines Through Reactive N-Substituted Isocyanate Intermediates
S. N. Shah,N. K. Chudgar
Molecules , 2000, DOI: 10.3390/50400657
Abstract: Thermolysis of semicarbazones (I) to azines (II) occurs through reactive N-substituted isocyanate intermediates (Ia) which can be converted in situ to carbamates and Nsubstituted ureas.
Modeling and verification of hemispherical solar still using ANSYS CFD
Hitesh N. Panchal, P. K. Shah
International Journal of Energy and Environment , 2013,
Abstract: In every efficient solar still design, water temperature, vapor temperature and distillate output, and difference between water temperature and inner glass cover temperatures are very important. Here, two dimensional three phase model of hemispherical solar still is made for evaporation as well as condensation process in ANSYS CFD. Simulation results like water temperature, vapor temperature, distillate output compared with actual experimental results of climate conditions of Mehsana (latitude of 23° 59’ and longitude of 72° 38) of hemispherical solar still. Water temperature and distillate output were good agreement with actual experimental results. Study shows that ANSYS-CFD is very powerful as well as efficient tool for design, comparison purpose of hemispherical solar still.
Modelling and verification of single slope solar still using ANSYS-CFX
Hitesh N Panchal, P. K. Shah
International Journal of Energy and Environment , 2011,
Abstract: Solar distillation method is an easy, small scale and cost effective technique for providing safe water. It requires an energy input as heat and the solar radiation can be source of energy. Solar still is a device which uses process of solar distillation. Here, a two phase, three dimensional model was made for evaporation as well as condensation process in solar still by using ANSYS CFX method to simulate the present model. Simulation results of solar still compared with actual experiment data of single basin solar still at climate conditions of Mehsana (23°12’ N, 72°30’). There is a good agreement with experimental results and simulation results of distillate output, water temperature and heat transfer coefficients. Overall study shows the ANSYS CFX is a powerful tool for diagnostic as well as analysis of solar still.
Graceful and odd graceful labeling of some graphs
S K Vaidya,N H Shah
International Journal of Mathematics and Soft Computing , 2013,
Abstract: In this paper, we prove that the square graph of bistar Bn,n, the splitting graph of Bn,n and the splitting graph of star K1,n are graceful graphs. We also prove that the splitting graph and theshadow graph of bistar Bn,n admit odd graceful labeling.
Pharmacological potential of Trichosanthes dioica – an edible plant.
Biren N. Shah,A. K. Seth
Hygeia : Journal for Drugs and Medicines , 2010,
Abstract: Trichosanthes dioica Roxb. (Family: Cucurbitaceae), commonly known as “Sespadula” in English and “Parwal” in Hindi, is widely grown throughout India. Fruits of this plant are used as vegetable in Indian traditional food system from time immemorial. Besides fruits, other parts of the plant, such as the leaves and tender shoots, have also been used in the traditional system of medicine since ancient times. Pointed gourd has been used for overcoming problems like constipation, fever, skin infection, wounds and also improves appetite and digestion. The immature fruits are used as vegetable and as ingredients of soup, stew, curry, sweet, or eaten fried and as dorma with roe stuffing. The present review describes the morphological and pharmacological aspects of Trichosanthes dioica and summarizes the most interesting findings obtained in the preclinical and clinical research related to the plant.
Biren. N. Shah,Avinash. K. Seth
Hygeia : Journal for Drugs and Medicines , 2011,
Abstract: A microwave assisted extraction technique wasdeveloped to optimize the extraction of mucilage from the fruits of Abelmoschusesculentus plant. The plant has been extracted by conventional andmicrowave assisted methods for the isolation of mucilage. Microwave extractionat 160 Wintensity and 40 min heating duration increase 11.55% in the yield of mucilagewhen compared to 1 h conventional heating method. Theproducts obtained by both the methods were of similar nature chemically. Thedeveloped microwave procedure can be used successfully in commercial androutine laboratory isolation of mucilage.
Shah, N.H.; K. T. Shukla
Revista Investigación Operacional , 2010,
Abstract: In this article, an inventory model is developed when supplier offers the retailer a credit period to settle the account, if the retailer orders a large quantity. The proposed study is meant for demand declining market. Shortages are not allowed and the effect of inflation is incorporated. The units in inventory are subject to constant rate of deterioration. The total cost is minimized for deteriorating items in demand declining market under inflation when the supplier offers a credit period to the retailer if the order quantity is greater than or equal to a pre – specified quantity. An easy – to – use algorithm is exhibited to find the optimal order quantity and the replenishment time. The mathematical formulation is explored by a numerical example. The sensitivity analysis of parameters on the optimal solution is carried out.
Some New Families of Prime Cordial Graphs
S K Vaidya,N H Shah
Journal of Mathematics Research , 2011, DOI: 10.5539/jmr.v3n4p21
Abstract: In this paper some new families of prime cordial graphs are investigated. We prove that the square graph of path $P_{n}$ is a prime cordial graph for $n=6$ and $n geq 8$ while the square graph of cycle $C_{n}$ is a prime cordial graph for $n geq {10}$. We also show that the shadow graph of $K_{1,n}$ for $n geq 4$ and the shadow graph of $B_{n,n}$ are prime cordial graphs. Moreover we prove that the graphs obtained by mutual duplication of a pair of edges as well as mutual duplication of a pair of vertices from each of two copies of cycle $C_{n}$ admit prime cordial labeling.
Some New Results on Prime Cordial Labeling
S. K. Vaidya,N. H. Shah
ISRN Combinatorics , 2014, DOI: 10.1155/2014/607018
Abstract: A prime cordial labeling of a graph with the vertex set is a bijection such that each edge is assigned the label 1 if and 0 if ; then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph which admits a prime cordial labeling is called a prime cordial graph. In this work we give a method to construct larger prime cordial graph using a given prime cordial graph . In addition to this we have investigated the prime cordial labeling for double fan and degree splitting graphs of path as well as bistar. Moreover we prove that the graph obtained by duplication of an edge (spoke as well as rim) in wheel admits prime cordial labeling. 1. Introduction We consider a finite, connected, undirected, and simple graph with vertices and edges which is also denoted as . For standard terminology and notations related to graph theory we follow Balakrishnan and Ranganathan [1] while for any concept related to number theory we refer to Burton [2]. In this section we provide brief summary of definitions and other required information for our investigations. Definition 1. The Graph labeling is an assignment of numbers to the vertices or edges or both subject to certain condition(s). If the domain of the mapping is the set of vertices (edges), then the labeling is called a vertex labeling (edge labeling). Many labeling schemes have been introduced so far and they are explored as well by many researchers. Graph labelings have enormous applications within mathematics as well as to several areas of computer science and communication networks. Various applications of graph labeling are reported in the work of Yegnanaryanan and Vaidhyanathan [3]. For a dynamic survey on various graph labeling problems along with an extensive bibliography we refer to Gallian [4]. Definition 2. A labeling is called binary vertex labeling of and is called the label of the vertex of under . Notation 1. If for an edge , the induced edge labeling is given by . Then Definition 3. A binary vertex labeling of a graph is called a cordial labeling if and . A graph is cordial if it admits cordial labeling. The concept of cordial labeling was introduced by Cahit [5]. The notion of prime labeling was originated by Entringer and was introduced by Tout et al. [6]. Definition 4. A prime labeling of a graph is an injective function such that for, every pair of adjacent vertices and , . The graph which admits a prime labeling is called a prime graph. The concept of prime labeling has attracted many researchers as the study of prime numbers is of great importance because
Page 1 /319867
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.