Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Search Results: 1 - 10 of 100 matches for " Akula Meghana "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Amyloidogenic Pituitary Prolactinoma  [PDF]
Pidakala Premalatha, Inuganti Venkata Renuka, Thumma Rayapa Reddy, Akula Meghana
International Journal of Otolaryngology and Head & Neck Surgery (IJOHNS) , 2016, DOI: 10.4236/ijohns.2016.53024
Abstract: Prolactinomas are the most common benign pituitary neoplasms and the common cause of hyperprolactinemia. Most of them arise in women of reproductive age. In men, they are often functionally silent, but present with manifestations secondary to pressure effects when they become macro adenomas. We present a case of prolactinoma in a 54-year old male patient who presented with pressure effects because of the tumor, as head ache and bi-temporal hemianopsia. MRI Brain scan was done to identify the tumor. The patient underwent trans-sphenoidal resection of the pituitary macro adenoma. Histological examination revealed spheroid amyloid deposits, almost replacing the adenoma. No medical treatment was given but the tumor recurred after 6 months and a repeat surgery was done for total excision.
Popular Matchings -- structure and cheating strategies
Meghana Nasre
Computer Science , 2013,
Abstract: We consider the cheating strategies for the popular matchings problem. The popular matchings problem can be defined as follows: Let G = (A U P, E) be a bipartite graph where A denotes a set of agents, P denotes a set of posts and the edges in E are ranked. Each agent ranks a subset of posts in an order of preference, possibly involving ties. A matching M is popular if there exists no matching M' such that the number of agents that prefer M' to M exceeds the number of agents that prefer M to M'. Consider a centralized market where agents submit their preferences and a central authority matches agents to posts according to the notion of popularity. Since a popular matching need not be unique, we assume that the central authority chooses an arbitrary popular matching. Let a1 be the sole manipulative agent who is aware of the true preference lists of all other agents. The goal of a1 is to falsify her preference list to get better always, that is, to improve the set of posts that she gets matched to as opposed to what she got when she was truthful. We show that the optimal cheating strategy for a single agent to get better always can be computed in O(\sqrt{n}m) time when preference lists are allowed to contain ties and in O(m+n) time when preference lists are all strict. Here n = |A| + |P| and m = |E|. To compute the cheating strategies, we develop a switching graph characterization of the popular matchings problem involving ties. The switching graph characterization was studied for the case of strict lists by McDermid and Irving (J. Comb. Optim. 2011) and it was open for the case of ties. The switching graph characterization for the case of ties is of independent interest and answers a part of the open questions posed by McDermid and Irving.
Bilateral double teeth—A case report  [PDF]
Sandip Kulkarni, S. M. Meghana, Monica Yadav
Open Journal of Stomatology (OJST) , 2012, DOI: 10.4236/ojst.2012.24063
Abstract: Developmental anomalies can occur as a result of conjoining or twinning defects. These include fusion, gemination and concrescence. Such anomalies occur more often in the deciduous than in the permanent dentition and only a few cases involving molar and premolar teeth have been reported in the literature. Cases of bilateral double teeth are less frequent than unilateral and prevalence seems to be higher in the anterior region. The present article is a rare case report of simultaneous occurrence of double teeth in permanent dentition involving the mandibular premolar-molar teeth in a 45-year-old male patient. Clinical observation along with radiographic examination was used to arrive at a diagnosis.
New Hardness Results in Rainbow Connectivity
Prabhanjan Ananth,Meghana Nasre
Computer Science , 2011,
Abstract: A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists a (geodesic) rainbow path between every pair of vertices. The (strong) rainbow connectivity of a graph $G$, denoted by ($src(G)$, respectively) $rc(G)$ is the smallest number of colors required to edge color the graph such that the graph is (strong) rainbow connected. It is known that for \emph{even} $k$ to decide whether the rainbow connectivity of a graph is at most $k$ or not is NP-hard. It was conjectured that for all $k$, to decide whether $rc(G) \leq k$ is NP-hard. In this paper we prove this conjecture. We also show that it is NP-hard to decide whether $src(G) \leq k$ or not even when $G$ is a bipartite graph.
Gluino-driven Radiative Breaking, Higgs Boson Mass, Muon $\mathbf{g-2}$, and the Higgs Diphoton Decay in SUGRA Unification
Akula, Sujeet;Nath, Pran
High Energy Physics - Phenomenology , 2013,
Abstract: We attempt to reconcile seemingly conflicting experimental results on the Higgs boson mass, the anomalous magnetic moment of the muon, null results in search for supersymmetry at the LHC within the 8\TeV data and results from $B$-physics, all within the context of supersymmetric grand unified theories. Specifically, we consider a supergravity grand unification model with non-universal gaugino masses where we take the $\mathrm{SU}(3)_C$ gaugino field to be much heavier than the other gaugino and sfermion fields at the unification scale. This construction naturally leads to a large mass splitting between the slepton and squark masses, due to the mass splitting between the electroweak gauginos and the gluino. The heavy Higgs bosons and Higgsinos also follow the gluino toward large masses. We carry out a Bayesian Monte Carlo analysis of the parametric space and find that it can simultaneously explain the large Higgs mass, and the anomalous magnetic moment of the muon, while producing a negligible correction to the Standard Model prediction for $\mathcal{B}r(B^0_s\to\mu^+\mu^-)$. We also find that the model leads to an excess in the Higgs diphoton decay rate. A brief discussion of the possibility of detection of the light particles is given. Also discussed are the implications of the model for dark matter.
Automation Tool for Comparing the Two Different Printouts From the Same Application for PCL3GUI Based HP Inkjet Printers
Akula Bhargavaram,Shanta Rangaswami
International Journal of Computer Science and Communication Networks , 2012,
Abstract: PCL(Printer Control language) is a page description language (PDL) developed by Hewlett-Packard as a printer protocol. Most of the HP Inkjet Printers accept PCL3GUI commands in order to process a print job. Today printers support several features. Printer driver plays a vital role in the product’s success. It takes several months to ensure that all print features and value added content are working correctly as per designed. Currently, a human tester is required to make a judgment whether or not the printed output is correct by visually comparing the output on paper to the document within the printing application or comparing to a printed gold master. This process is both time consuming, labor intensive, costly and error prone given that the pass-fail decision is dependent on a trained observer reviewing the prints. In order to eliminate these drawbacks an automation tool is developed to automate the manual testing process
Biological Computing Fundamentals and Futures
Balaji Akula,James Cusick
Computer Science , 2009,
Abstract: The fields of computing and biology have begun to cross paths in new ways. In this paper a review of the current research in biological computing is presented. Fundamental concepts are introduced and these foundational elements are explored to discuss the possibilities of a new computing paradigm. We assume the reader to possess a basic knowledge of Biology and Computer Science
Fluorine-18 Radiochemistry: A Novel Thiol-Reactive Prosthetic Group, [18F]FBAMPy  [PDF]
Thomas M. Moore, Murthy R. Akula, George W. Kabalka
Natural Science (NS) , 2016, DOI: 10.4236/ns.2016.81001
Abstract: A novel thiol-reactive bifunctional agent, an analogue of fluorobenzaldehyde-O-[6-(2,5-dioxo-2,5- dihydro-pyrrol-1-yl)-hexyl]oxime, (FBAM) has been synthesized. The new prosthetic group, [18F]- FBAMPy, replaces the 4-fluorophenyl moiety with a 2-fluoropyridinyl moiety leading to increased polarity (FBAM analytical HPLC Rf = 6.4 min; FBAMPy Rf = 4.8 min) while retaining the sulfur-reactive pendant. By altering the polarity of the molecule, this new prosthetic group should have significant impact in coupling it with small peptides and other biomolecules.
Patient interest in video recording of colonoscopy: A survey
Meghana Raghavendra, Douglas K Rex
World Journal of Gastroenterology , 2010,
Abstract: AIM: To find if patients are interested in obtaining a video recording of their colonoscopy procedure.METHODS: We conducted a survey of outpatients presenting for colonoscopy regarding their interest in obtaining a video recording of their colonoscopy.RESULTS: Two hundred and forty-eight patients (mean age 57.9 years; 57% male) were surveyed. Two hundred and one patients (81%) were interested in obtaining a video recording. No significant predictors of patients’ interest in the video recording were identified. After reading a brief educational paragraph explaining missed lesions during colonoscopy, 135 patients (54%) were more interested in having a video recording, and none were less interested. One hundred and fifty-six patients (63%) were willing to pay for a video recording. In multivariable analyses, younger age was predictive of willingness to pay for a video recording. Prior history of colorectal cancer and a family history of colorectal cancer were predictive of willingness to pay a greater amount.CONCLUSION: Patients undergoing colonoscopy expressed substantial interest in obtaining a videorecording of their procedure. Awareness of missing lesions during colonoscopy increased interest in having a videorecording.
Akula S R Lingeswara Rao
Journal of Global Research in Computer Science , 2012,
Abstract: Advances in sensing and tracking technology enable location-based applications but they also create significant privacy risks. Anonymity can provide a high degree of privacy, save service users from dealing with service providers’ privacy policies, and reduce the service providers’ requirements for safeguarding private information. However, guaranteeing anonymous usage of location- based services requires that the precise location information transmitted by a user cannot be easily used to re-identify the subject. This paper presents middle-ware architecture and algorithms that can be used by a centralized location broker service. The adaptive algorithms adjust the resolution of location information along spatial or temporal dimensions to meet specified anonymity constraints based on the entities that may be using location services within a given area. Using a model based on automotive traffic counts and cartographic material, we estimate the realistically expected spatial resolution for different anonymity constraints. The median resolution generated by our algorithms is 125 meters. Thus, anonymous location-based requests for urban areas would have the same accuracy currently needed for E-911 services; this would provide sufficient resolution for way finding, automated bus routing services and similar location- dependent services.
Page 1 /100
Display every page Item

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