Ethnobotanical Study of Medicinal Plants used by the Local People in Vellore District, Tamilnadu, India

An ethnobotanical survey was conducted in and around Vellore district to study the various medicinal plants used by the people for the treatment of their ailments such as fever, cold, cough, diabetes, jaundice, diarrhoea, rheumatism, snake bite, and headache. The study also covered the methods used in plant extraction, and the dose, duration and mode of application

Ethnobotanical Survey of Folklore Plants for the Treatment of Jaundice and Snakebites in Vellore Districts of Tamilnadu, India

An ethnobotanical survey was undertaken to collect information from local people about the use of medicinal plants in Vellore district. Local people use certain folklore medicinal plants for the treatment of Jaundice and Snakebite. The Knowledge about the medicinal plants has been transmitted orally from generation. The investigations revealed that there are about 22 species of plants to treat Jaundice and Snakebite. Jaundice and Snakebite are the common problems among the local people. The study indicates that the local inhabitants rely on medicinal plants for treatment

Iron environment non-equivalence in both octahedral and tetrahedral sites in NiFe2O4 nanoparticles: study using Mössbauer spectroscopy with a high velocity resolution

Mössbauer spectrum of NiFe2O4 nanoparticles was measured at room temperature in 4096 channels. This spectrum was fitted using various models, consisting of different numbers of magnetic sextets from two to twelve. Non-equivalence of the 57Fe microenvironments due to various probabilities of different Ni2+ numbers surrounding the octahedral and tetrahedral sites was evaluated and at least 5 different microenvironments were shown for both sites. The fit of the Mössbauer spectrum of NiFe 2O4 nanoparticles using ten sextets showed some similarities in the histograms of relative areas of sextets and calculated probabilities of different Ni2+ numbers in local microenvironments. © 2012 American Institute of Physics

Affinity of Tau antibodies for solubilized pathological Tau species but not their immunogen or insoluble Tau aggregates predicts in vivo and ex vivo efficacy

BACKGROUND: A few tau immunotherapies are now in clinical trials with several more likely to be initiated in the near future. A priori, it can be anticipated that an antibody which broadly recognizes various pathological tau aggregates with high affinity would have the ideal therapeutic properties. Tau antibodies 4E6 and 6B2, raised against the same epitope region but of varying specificity and affinity, were tested for acutely improving cognition and reducing tau pathology in transgenic tauopathy mice and neuronal cultures. RESULTS: Surprisingly, we here show that one antibody, 4E6, which has low affinity for most forms of tau acutely improved cognition and reduced soluble phospho-tau, whereas another antibody, 6B2, which has high affinity for various tau species was ineffective. Concurrently, we confirmed and clarified these efficacy differences in an ex vivo model of tauopathy. Alzheimer’s paired helical filaments (PHF) were toxic to the neurons and increased tau levels in remaining neurons. Both toxicity and tau seeding were prevented by 4E6 but not by 6B2. Furthermore, 4E6 reduced PHF spreading between neurons. Interestingly, 4E6’s efficacy relates to its high affinity binding to solubilized PHF, whereas the ineffective 6B2 binds mainly to aggregated PHF. Blocking 4E6's uptake into neurons prevented its protective effects if the antibody was administered after PHF had been internalized. When 4E6 and PHF were administered at the same time, the antibody was protective extracellularly. CONCLUSIONS: Overall, these findings indicate that high antibody affinity for solubilized PHF predicts efficacy, and that acute antibody-mediated improvement in cognition relates to clearance of soluble phospho-tau. Importantly, both intra- and extracellular clearance pathways are in play. Together, these results have major implications for understanding the pathogenesis of tauopathies and for development of immunotherapies. ELECTRONIC SUPPLEMENTARY MATERIAL: The online version of this article (doi:10.1186/s13024-016-0126-z) contains supplementary material, which is available to authorized users

The Fundamental Group on Algebraic Topology

Algebraic topology is mostly about finding invariants for topological spaces. The fundamental group is the simplest, in some ways, and the most difficult in others. This project studies the fundamental group, its basic properties, some elementary computations, and a resulting theorem. In this paper, we will examine the construction and nature of the first homotopy group, which is more commonly known as the fundamental group of a topological space. We will first briefly cover the basics of point-set topology, then use these concepts to facilitate a rigorous study of the construction of the fundamental group

Triple Connected Domination Number of Graph

The concept of triple connected graphs with real life application was prefaced by considering the existence of a path containing any three vertices of a graph G. In this paper, we introduce a new domination parameter, called triple connected domination number of a graph. A subset S of V of a nontrivial graph G is said to be triple connected dominating set, if S is a dominating set and the induced sub graph is triple connected. The minimum cardinality undertake all triple connected dominating sets. Then which is called the triple connected domination number and is denoted by ?tc

A Semi-Total Domination Number of a Graph

This thesis work on the two parameters that is very important domination parameters, one parameter is known as domination number and other parameter is called as total domination number. S is defined as a set of vertices in a graph G. We characterize a set S of vertices in a graph G with no segregated vertices to be a semitotal overwhelming arrangement of G in the event that it is a ruling arrangement of G and furthermore every vertex in S is inside separation 2 of another vertex of S. The semitotal domination number, indicated by is the base cardinality of a semitotal ruling arrangement of G. We demonstrate that on the off chance that G is an associated graph on n ? 4 vertices, at that point and we describe the trees and diagrams of least degree 2 arriving at this bound

Fixed Point Theorem of Generalized Contradiction in Partially Ordered Cone Metric Spaces

In this thesis we discuss the newly introduced concept of cone metric spaces, prove some fixed point theorems existence results of contractive mappings defined on such cone metric space and improve some well-known results in the normal case. The purpose of this paper is to establish the generalization of contractive type mappings on complete cone metric spaces. Also all the results in this paper are new. The main aim of this paper is to prove fixed point theorems is cone metric spaces which extend the Banach contraction mapping and others. This is achieved by introducing different kinds of Cauchy sequences in cone metric spaces

A Study on Combinatories in Discrete Mathematics

The next two chapters deal with Set Theory and some related topics from Discrete Mathematics. This chapter develops the basic theory of sets and then explores its connection with combinatorics (adding and multiplying; counting permutations and combinations), while Chapter 5 treats the basic notions of numerosity or cardinality for finite and infinite sets.Most mathematicians today accept Set Theory as an adequate theoretical foundation for all of mathematics, even as the gold standard for foundations.* We will not delve very deeply into this aspect of Set Theory or evaluate the validity of the claim, though we will make a few observations on it as we proceed. Toward the end of our treatment, we will focus on how and why Set Theory has been axiomatized. But even disregarding the foundational significance of Set Theory, its ideas and terminology have become indispensable for a large number of branches of mathematics as well as other disciplines, including parts of computer science. This alone makes it worth exploring in an introductory study of Discrete Mathematics

A Study on Graph Theory of Path Graphs

A simple graph G = (V, E) consists of V , a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. Simple graphs have their limits in modeling the real world. Instead, we use multigraphs, which consist of vertices and undirected edges between these vertices, with multiple edges between pairs of vertices allowed. In the mathematical field of graph theory, a path graph or linear graph is a graph whose vertices can be listed in the order v1, v2, …, vn such that the edges are {vi, vi+1} where i = 1, 2, …, n ? 1. Equivalently, a path with at least two vertices is connected and has two terminal vertices (vertices that have degree 1), while all others (if any) have degree 2. Paths are often important in their role as subgraphs of other graphs, in which case they are called paths in that graph. A path is a particularly simple example of a tree, and in fact the paths are exactly the trees in which no vertex has degree 3 or more. A disjoint union of paths is called a linear forest