1,257 research outputs found
Comparison of several author indices for gauging academic productivity
No full textBackground
Many author indices exist to gauge academic productivity. Several of these indices are calculated based upon an author's scholarly publication record, but the measurement methodology to calculate each index varies considerably, and the precise function being used, as well as the end result, is often complex and difficult to assess.
Method
Two straightforward methods to weigh author productivity from the publication and citation record were evaluated as possible means for providing a clearer assessment of scholarly activity. The author characteristic index (termed c-index) assigns author rank for each publication based upon author position. The characteristic prime (c') -index normalizes author rank from author position, so that the total weight per publication is unity. The top 10 scholars with keyword 'celiac disease' in the Google Scholar database were then assessed using these metrics. Rankings according to total number of publications, h-index, and c- and c'-indices were compared, then tabulated along with total papers included for assessment, and mean values per paper for author position, number of authors, citations, and year of publication.
Results
The order of the top ten authors with keyword 'celiac disease' varied substantially depending upon whether the h-index, c-index, or c'-index was used as a gauge. The characteristic indices assign credit to authors according to their position in an author list. The affiliated metrics provided a more complete picture of scholarly activity.
Conclusions
Academic achievement by scholars, based upon quantitative publication characteristics, has recently become of interest for evaluating job candidates, for determining work performance, and for bestowing awards and honors. The characteristic indices as described herein are readily calculated and interpreted, and may improve the assessment of scholarly activity
FIGURE 1. Myristica beddomei subsp. beddomei A. Twig with leaves and fruit. B. Male inflorescence. C. Female inflorescence. D. Male flower. E. Androecium, exposed. F. Female flower. G. Gynoecium exposed. H. Fruits. I. Arillate seed. J in Status of the subspecies of Myristica beddomei (Myristicaceae), endemic to the Western Ghats, India
No full textFIGURE 1. Myristica beddomei subsp. beddomei A. Twig with leaves and fruit. B. Male inflorescence. C. Female inflorescence. D. Male flower. E. Androecium, exposed. F. Female flower. G. Gynoecium exposed. H. Fruits. I. Arillate seed. J. Bark exudate.Published as part of Govind, Murugan Govindakurup & Dan, Mathew, 2022, Status of the subspecies of Myristica beddomei (Myristicaceae), endemic to the Western Ghats, India, pp. 261-269 in Phytotaxa 541 (3) on page 264, DOI: 10.11646/phytotaxa.541.3.5, http://zenodo.org/record/639264
Myristica pushpangadaniana M. G. Govind & Dan 2022
No full text<p> <i>Myristica pushpangadaniana</i> M.G.Govind & Dan in Kottaim., <i>nom. nov.</i></p> <p> Replaced name: <i>Myristica beddomei</i> King (1891: 291) subsp. <i>sphaerocarpa</i> W.J. de Wilde (1997: 152).</p> <p> <i>Myristica pushpangadaniana</i> M.G. Govind & Dan (2022: 262), <i>nom. inval.</i></p> <p> Type:— INDIA. Tamil Nadu, Tinnevely District (now Tirunelveli), 11 Jul 1976, 1110 m, Eastern slopes of Western Ghats, Walaiyar Cardamom estate, <i>Kostermans 26276a</i> (holotype: L, digital image with barcode L0037563!; isotype: K, digital image with barcode K000880916!; US, digital image with barcode US00516998!).</p> <p>Distribution: — INDIA (Karnataka, Kerala & Tamil Nadu), Endemic.</p>Published as part of <i>Kottaimuthu, Ramalingam, 2023, Validation of Myristica pushpangadaniana (Myristicaceae), pp. 133-134 in Phytotaxa 584 (2)</i> on page 133, DOI: 10.11646/phytotaxa.584.2.7, <a href="http://zenodo.org/record/7639441">http://zenodo.org/record/7639441</a>
Structural and solvent modulation of symmetry-breaking charge-transfer pathways in molecular triads
No full textData presented in: Structural and solvent modulation of symmetry-breaking charge-transfer pathways in molecular triads, C. Govind, E. Balanikas, G. Sanil, D.T. Gryko and E. Vauthey, Chem. Sci. (2024) 15, 17362-1737, https://doi.org/10.1039/D4SC05419
Scientometric Insights into Research Contributions of Govind Ballabh Pant University of Agriculture and Technology
No full textThis study evaluates the research productivity and impact of Govind Ballabh Pant University of Agriculture and Technology using Scopus data (2001–2021). A total of 4,897 publications receiving 53,059 citations were analyzed with scientometric indicators including AGR, RGR, DT, collaboration measures, authorship, citations, and keywords. Results show a gradual growth in research output, with peak productivity during 2017–2021 and Kumar, A. as the most prolific author (165 publications)
Colloidal engines for innovative tests of information thermodynamics
No full textRecent theoretical developments in information thermodynamics elucidated the link between the acquired information and the entropy production through measurement and feedback control by generalizing the fluctuation theorems and the second law of thermodynamics. We summarize here our recent experimental studies based on the colloidal system that have been conducted to test the theoretical findings of information thermodynamics. In particular, we present the design principles of error-free and noisy information engines consisting of a colloidal particle in an optical trap that is capable of performing nearly error-free measurement and ultrafast feedback control. Our perspectives on future experimental studies are also presented. ?? 2020 The Author(s). Published by Informa UK Limited, trading as Taylor & Francis Group
Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth
No full textIn the General Factor problem, we are given an undirected graph G and for each vertex v ∈ V(G) a finite set B_v of non-negative integers. The task is to decide if there is a subset S ⊆ E(G) such that deg_S(v) ∈ B_v for all vertices v of G. Define the max-gap of a finite integer set B to be the largest d ≥ 0 such that there is an a ≥ 0 with [a,a+d+1] ∩ B = {a,a+d+1}. Cornuéjols showed in 1988 that if the max-gap of all sets B_v is at most 1, then the decision version of General Factor is polynomial-time solvable. This result was extended 2018 by Dudycz and Paluch for the optimization (i.e. minimization and maximization) versions. We present a general algorithm counting the number of solutions of a certain size in time (M+1)^{tw}n^{O(1)}, given a tree decomposition of width tw, where M is the maximum integer over all B_v. By using convolution techniques from van Rooij (2020), we improve upon the previous (M+1)^{3tw}n^{O(1)} time algorithm by Arulselvan et al. from 2018.
We prove that this algorithm is essentially optimal for all cases that are not trivial or polynomial time solvable for the decision, minimization or maximization versions. Our lower bounds show that such an improvement is not even possible for B-Factor, which is General Factor on graphs where all sets B_v agree with the fixed set B. We show that for every fixed B where the problem is NP-hard, our (max B+1)^{tw}n^{O(1)} algorithm cannot be significantly improved: assuming the Strong Exponential Time Hypothesis (SETH), no algorithm can solve B-Factor in time (max B+1-ε)^{tw}n^{O(1)} for any ε > 0. We extend this bound to the counting version of B-Factor for arbitrary, non-trivial sets B, assuming #SETH.
We also investigate the parameterization of the problem by cutwidth. Unlike for treewidth, having a larger set B does not appear to make the problem harder: we give a 2^{cutw}n^{O(1)} algorithm for any B and provide a matching lower bound that this is optimal for the NP-hard cases
Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)
No full textIn the general AntiFactor problem, a graph is given with a set
of forbidden degrees for every vertex and the
task is to find a set of edges such that the degree of in is not in
the set . Standard techniques (dynamic programming + fast convolution) can
be used to show that if is the largest forbidden degree, then the problem
can be solved in time if a tree decomposition of width
is given. However, significantly faster algorithms are possible if the sets
are sparse: our main algorithmic result shows that if every vertex has at
most forbidden degrees (we call this special case AntiFactor), then the
problem can be solved in time . That is, the
AntiFactor is fixed-parameter tractable parameterized by treewidth and
the maximum number of excluded degrees.
Our algorithm uses the technique of representative sets, which can be
generalized to the optimization version, but (as expected) not to the counting
version of the problem. In fact, we show that #AntiFactor is already
#W[1]-hard parameterized by the width of the given decomposition. Moreover, we
show that, unlike for the decision version, the standard dynamic programming
algorithm is essentially optimal for the counting version. Formally, for a
fixed nonempty set , we denote by -AntiFactor the special case where
every vertex has the same set of forbidden degrees. We show the
following lower bound for every fixed set : if there is an such
that #-AntiFactor can be solved in time on a tree decomposition of width , then the Counting Strong
Exponential-Time Hypothesis (#SETH) fails.Comment: v2: Proof of Lemma 7.1 in Section 7.1 revised by adding more
intermediate steps, minor correction
Review on Vaidyaka Paribhasha Pradipa- A Comprehensive Treatise of Indian Pharmaceuticals by Govind Sen
No full textVaidyaka Paribhasha Pradipa was written by Govind Sen, son of Krishna Vallabh Sen. Vidyotini Hindi Tika was written by Indradev Tripathi. The book Vaidyaka Paribhasha Pradipa consists of almost all references collected from various Samhitas regarding the fundamental principles and different Ayurvedic herbal pharmaceutical preparations and descriptions on Panchakarma. The whole content of the book is divided into 4 Khandas. Prathama khanda deals with Mana paribhasha, Dravya samgrahana vidhi, and shelf life of different Kalpana etc. Dwitiya khanda deals with Panchavidha kashaya kalpana and its Upakalpana and dose. Tritiya khanda deals with Sneha kalpana, Sandhana kalpana and Paribhasha of different Gana. Chaturtha khanda deals with Panchakarma procedures and Sneha murchana. The present book review mainly focuses to highlight the framework of Vaidyaka Paribhasha Pradipa, provides information about the author, details of 4 Khandas, a special contribution to the field of pharmaceutical science by the author. Thus, Vaidyaka Paribhasha Pradipa, the compilation book on Bhaishajya Kalpana is a very essential and mandatory book for those who aspire to gain basic, clear, and thorough knowledge in Ayurvedic pharmaceuticals. It is one of the indispensable reference books. The present book is designed to help the young practitioners who prepare medicines and graduates and post-graduate scholars get a clear idea of medicine preparation
Phytoplasma Diseases in Ornamental Crops
No full textAn extensive and update review of the literature reporting the phytoplasma associated diseases in a number of ornamental plants and their classification is presented with major emphasis to reports in the main floricultural areas. Symptomatology of reported diseases is described in the most relevant traditional species as well as in emerging species used in floriculture and gardening worldwide
- …
