30 research outputs found

    Management of Sheetapitta through Shodhana and Shamana - A Case Study

    Get PDF
    Now a day’s cosmetic issue especially Urticaria has become a common problem in the society. Urticaria, commonly known as hives, usually occurs due to an allergic reaction. Sheetapitta is a similar condition in Ayurveda, as the symptoms are similar. Sheetapitta is comprised of two words Sheeta and Pitta. The condition occurs due to dominance of cold over Pitta Dosha. Due to exposure to cold wind, Kapha and Vata Doshas get aggravated and combine with Pitta Doshas. These spread all over the body and produce rashes on the surface of the skin. A 26 year old male student, presented with complaints of Reddish lesions over hands and back since 15-20 days associated with burning sensation, pain and itching which aggravated more during evening and night hours and on exposure to cold climate. The diagnosis was done as Sheetapitta with respect to Urticaria Pigmentosa. Its management was done successfully by following the principles of Shodhana and Shamana

    Introduction to Fluids in Motion

    Get PDF
    This paper serves as an introduction to the concept of fluid motion. It is an attempt made to introduce the fundamentals of fluid flow. Fluid motion manifests themselves in many different ways. Some common assumptions used to simplify a flow situation are related to fluid properties. Under certain conditions viscosity can affect the flow significantly. The compressibility of a gas in motion should be taken into account if the velocities are very high. Fluid flow analysis is used to predict the behavior of systems which involves fluid flow. Computational Fluid Dynamics is the method to perform Fluid flow analysis and utilizes numerical methods and algorithms to address the problem that includes fluid flow. This paper consists of a brief view of different types of flow,basic equations etc. At the outset the beginning is the description of the basic ideas of fluid flows, Flow patterns, methods to describe fluid motion etc. The paper ends with general analysis of fluid motion through ANSYS CFD software, because the visualization of flow patterns permit the development and better understanding in formulating a mathematical problem

    A rare case of a ruptured ovarian pregnancy

    Get PDF
    Ovarian pregnancy is a rare type of extrauterine pregnancy accounting for 1 to 3% of all extrauterine pregnancies. We report a rare case of a ruptured ovarian pregnancy. A 22 year old, gravida 2 para 1 living 1 was admitted with amenorrhea of 4 weeks and 6 days with chief complaints of severe acute lower abdomen pain. Urine pregnancy test was positive. Ultrasonogram pelvis revealed left sided ruptured adnexal mass with moderated hemoperitoneum. Laparotomy was performed and a diagnosis of ruptured ovarian pregnancy was made. Biopsy of the mass was taken which confirmed the diagnosis. Although ovarian pregnancy is rare, in any case of a ruptured ectopic pregnancy where the tubes are found to be normal on laparotomy, an ovarian pregnancy must be ruled out. Early detection and prompt diagnosis can preserve the future fertility of the woman

    Cloud Computing a A Paradigm Shift

    No full text

    An Optimization Algorithm for Finding Graph Circuits and Shortest Cyclic Paths in Directed/Undirected Graphs

    No full text
    Abstract — Computing combined circuits and shortest cyclic paths between two given nodes in undirected graphs is a fundamental operation over graphs. While a number of techniques exist for answering computing circuits and approximating node distances efficiently in directed graphs, but the actual circuit calculations, their generations and shortest cyclic paths in undirected graphs are often neglected. However, it is often essential to find out all combined circuits and shortest cyclic paths between two given nodes in an undirected graphs. In this paper, we have addressed this problem and presented an optimistic algorithm that not only supports calculation of circuits but also generates combined circuits and computes corresponding shortest cyclic paths in undirected graphs. This algorithm is also applicable to directed graphs as well
    corecore