4,753 research outputs found
Polistes (Polistella) strigosus subsp. atratus Das & Gupta 1989
a) Polistes (Polistella) strigosus atratus Das & Gupta, 1989 Polistes (Polistella) strigosus atratus Das and Gupta, 1989: 81. Type data: Holotype female, NZC. Type locality: Belonia, Tripura, India. Material examined. INDIA: Meghalaya: Umiam Shillong, 21.vi.2019, 1 ♀, Coll. M. Mohan. Distribution. India: Assam, Bihar, Delhi, Manipur, Meghalaya (new record), Sikkim, Tripura, Uttarakhand, West Bengal. (Das & Gupta 1989, Carpenter 1996, Gupta 1997, Jonathan et al. 2000b, Jonathan & Kundu 2003, Kundu et al. 2010).Published as part of Gawas, Sandesh M., Kumar, Girish, Pannure, Arati, Gupta, Ankita & Carpenter, James M., 2020, An annotated distributional checklist of Vespidae (Hymenoptera: Vespoidea) of India, pp. 1-87 in Zootaxa 4784 (1) on pages 50-51, DOI: 10.11646/zootaxa.4784.1.1, http://zenodo.org/record/386231
Improved algorithm for dynamic b-Matching
Recently there has been extensive work on maintaining (approximate)
maximum matchings in dynamic graphs. We consider a generalisation of
this problem known as the maximum b-matching: Every node v has a positive integral capacity bv, and the goal is to maintain an approximate) maximum cardinality subset of edges that contains at most bv edges incident on every node v. The maximum matching problem is a special case of this problem where bv = 1 for every node v.
Bhattacharya, Henzinger and Italiano [ICALP 2015] showed how to maintain a O(1) approximate maximum b-matching in a graph in O(log3 n) amortised update time. Their approximation ratio was a large (double digit) constant.
We significantly improve their result both in terms of approximation
ratio as well as update time. Specifically, we design a randomised dynamic algorithm that maintains a (2 + )-approximate maximum b-matching in expected amortised O(1= 4) update time. Thus, for every constant 2 (0; 1), we get expected amortised O(1) update time. Our algorithm generalises the framework of Baswana, Gupta, Sen [FOCS 2011] and Solomon [FOCS 2016] for maintaining a maximal matching in a dynamic graph
sj-docx-1-dhj-10.1177_20552076211039032 - Supplemental material for Change in cardiometabolic risk factors among Asian Indian adults recruited in a mHealth-based diabetes prevention trial
Supplemental material, sj-docx-1-dhj-10.1177_20552076211039032 for Change in cardiometabolic risk factors among Asian Indian adults recruited in a mHealth-based diabetes prevention trial by Shruti Muralidharan, Harish Ranjani, Ranjit Mohan Anjana, Yashdeep Gupta, Samita Ambekar, Varsha Koppikar, N Jagannathan, Sidhant Jena, Nikhil Tandon, Steven Allender and Viswanathan Mohan in Digital Health</p
Bibliographics for the 983 eprints in the live archives of E-LIS : trends and status report up to 7th July 2004, based on author-self-archiving metadata
The priority for ideas and philosophy related to "Network Theory" have been traced back and documented by Braun(2004),and credit goes to Karinthy(1929).The IT has empowered to realise it, as the most practical phenomena and it is no more a humour. The OAI (Open Archives Initiatives)and ACIS (Academic Contributor Information System)are progressive in the direction ,which may lead to realise the "Collective Genius" at global level. Focus of present study is on Author-Self-Archiving (A-S-A)Metadata of the 983 Eprints in the Live Archives of the E-LIS (EPrints of Library and Information Science),which were approved till 7th July 2004.The A-S-A Metadata was used for librametric analysis. Self-explanatory bibliographics are illustrated.The highlights include: Conference papers (34%); highest approval, June 2004 (28%); published archives (76%);not refereed (52%); not in public domain (60%); highest self-archiving-author (De Robbio, Antonella).The Nos. of EPrints having single JITA domain specifications were: Theoretical and general aspects of libraries and information(27); Information use and sociology of information(80);Users,literacy and reading(13);Libraries as physical collections(30);Publishing and legal issues(57);Management(13);Industry, profession and education(36);Information sources, supports, channels(113) ; Information treatment for information services, Information functions and techniques (101); Technical services libraries, archives and museums(25); Housing technologies(1); Information technology and library technology(92); and Inter-domainery (395) i.e. having specifications of two or more than two JITA classes
INSPEC database analysis for Knowledge Management records
The study deals with the Knowledge Management papers covered in the INSPEC, an international database on Information Science, Physical Sciences, Engineering and Computer Sciences. The papers have been analysed in terms of their content and other scientometric parameters
Cyclic dna codes over the ring z4 + uz4 + u2 z4
In this work, we have investigated the one generator cyclic DNA codes with reverse and reverse complement constraints over the ring R = Z4 +uZ4 +u2 Z4 with u3 = 0. Skew cyclic codes with reverse complement constraint are constructed over R. We have also determined a one-to-one correspondence between the elements of the ring R and DNA codons satisfying the Watson-Crick complement. Finally, we have established some examples which satisfy the given constraints
sj-pdf-1-pie-10.1177_09544089211073296 - Supplemental material for Exploring Casting Defects of AA7075 Alloy in the Gravity Die Casting Simulation of an IC Engine Block
Supplemental material, sj-pdf-1-pie-10.1177_09544089211073296 for Exploring Casting Defects of AA7075 Alloy in the Gravity Die Casting Simulation of an IC Engine Block by T. Aneesh, K. Pawan, L. Mohan, P. Hari Krishna, Tapano Kumar Hotta, Chinmaya Prasad Mohanty and Manoj Gupta in Proceedings of the Institution of Mechanical Engineers, Part E: Journal of Process Mechanical Engineering</p
Factorization of isometries of hyperbolic 4-space and a discreteness condition:
Gilman's NSDC condition is a sufficient condition for the discreteness of a two generator subgroup of PSL(2,C). We address the question of the extension of this condition to subgroups of isometries of hyperbolic 4-space. While making this new construction, namely the NSDS condition, we are led to ask whether every orientation preserving isometry of hyperbolic 4-space can be factored into the product of two half-turns. We use some techniques developed by Wilker to first, define a half-turn suitably in dimension 4 and then answer the former question. It turns out that defining a half-turn in this way in any dimension n enables us to generalize some of Gilman's theorems to dimension greater than or equal to 4. We also give an exposition on part of Wilker's work and give new proofs for some of his results.Ph.D.Includes bibliographical references (p. 52-53)by Karan Mohan Pur
Designing a successful library school field experience
To share the library school field experience paradigm that the authors developed after their successful participation as a supervisor and student.
Design/methodology/approach – A review of field experience literature is provided. The field experience paradigms and perspectives pertaining to the supervisor and the student are explained. The paradigm is suggested as a model for field experience participants and their supervisors.
Findings – The field experience paradigm for the supervisors elucidates the stages – planning, training, mentoring and evaluation. The paradigm for students explains the phases – awareness, interests, planning and participation.
Research limitations/implications – The focus of the field experience, from which the paradigm emanated, was to train and prepare the student for agricultural librarianship in an academic library. The application of the paradigm may vary for different situations.
Practical implications – The paradigm is expected to be useful for supervisors and students of field experience programs.
Originality/value – This paradigm stems from the participation of the authors as a field experience supervisor and student. The steps and methods the authors followed will help advance future field experience programs
- …
