102,460 research outputs found
Henosepilachna circellaris
Henosepilachna circellaris (Weise) Epilachna circellaris Weise, 1908: 216 (BMNH). Henosepilachna circellaris: Jadwiszczak & Wegrzynowicz, 2003: 141. Jadwiszczak & Wegrzynowicz (2003) listed H. circellaris as distributed in India in the world catalogue of Epilachninae, though Weise (1908) listed ‘Tharrawaddy’ (now in Myanmar) as its type locality. In Poorani’s (2004) updated online checklist of the Indian Subcontinent fauna, the author of H. circellaris was wrongly cited as Korschefsky and it was also wrongly mentioned as present in India (Karnataka). Distribution: Myanmar (Tharrawaddy).Published as part of Poorani, J., Booth, R. G., Gracy, R. Gandhi, Anuradha, C., Thanigairaj, R. & Swathi, R. S., 2021, Immature stages, host plants and natural enemies of Henosepilachna implicata (Mulsant) (Coleoptera: Coccinellidae) with DNA sequence data and a new synonym and notes on some Indian species of Epilachnini, pp. 533-546 in Zootaxa 4970 (3) on pages 543-544, DOI: 10.11646/zootaxa.4970.3.5, http://zenodo.org/record/476683
FIGURE 3 in Immature stages, host plants and natural enemies of Henosepilachna implicata (Mulsant) (Coleoptera: Coccinellidae) with DNA sequence data and a new synonym and notes on some Indian species of Epilachnini
FIGURE 3. Henosepilachna implicata, variants collected from Trichy, Tamil Nadu.Published as part of Poorani, J., Booth, R. G., Gracy, R. Gandhi, Anuradha, C., Thanigairaj, R. & Swathi, R. S., 2021, Immature stages, host plants and natural enemies of Henosepilachna implicata (Mulsant) (Coleoptera: Coccinellidae) with DNA sequence data and a new synonym and notes on some Indian species of Epilachnini, pp. 533-546 in Zootaxa 4970 (3) on page 538, DOI: 10.11646/zootaxa.4970.3.5, http://zenodo.org/record/476683
Matching in power graphs of finite groups
Funding: The author Swathi V V acknowledges the support of Council of Scientific and Industrial Research, India (CSIR) (Grant No-09/874(0029)/2018-EMR-I), and DST, Government of India, ‘FIST’ (No.SR/FST /MS-I/2019/40).The power graph P(G) of a finite group G is the undirected simple graph with vertex set G, where two elements are adjacent if one is a power of the other. In this paper, the matching numbers of power graphs of finite groups are investigated. We give upper and lower bounds, and conditions for the power graph of a group to possess a perfect matching. We give a formula for the matching number for any finite nilpotent group. In addition, using some elementary number theory, we show that the matching number of the enhanced power graph Pe(G) of G (in which two elements are adjacent if both are powers of a common element) is equal to that of the power graph of G.Peer reviewe
Bibliographie Hilarion G. Petzold 1958 – 2009 mit Anhang als Einführung
Dieses Archiv enthält die Gesamtbibliographie der Werke des Autors nebst einiger Texte „Über H. G. Petzold“ im Schlussteil der Bibliographie sowie einen Anhang mit einer Einführung in die Architektur des Werkes in seinem wissenslogischen Aufbau als Ausarbeitung seines „Tree of Science Modells“ (2007).This archive contains the complete bibliography of the author and some texts about H. G. Petzold, moreover an epilogue with an introduction to the architecture of the works in its epistemological structure and composition and as an elaborations of Petzold’s „Tree of Science Modell (2007).https://www.fpi-publikation.de/polyloge/01-2009-petzold-h-g-gesamtbibliographie-h-g-petzold-1958-2009-updating-november2009/peerReviewedpublishedVersio
Dispelling the Myths Behind First-author Citation Counts
We conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
Recommended from our members
3346: Samuel G. Freedman, author, 2013
Photograph of author Samuel G. Freedman, at NT Daily Slash meeting in the Mayborn School of Journalism at UNT
Sex trafficking of girls and women : Evidence from Anantapur district, Andhra Pradesh
A crucial gap in the trafficking literature from India is the dearth of primary data and micro studies that could be used for vulnerability mapping of the source areas and addressing the identified risk factors. The present paper is a small attempt to contribute to plugging the gap in the context of Andhra Pradesh, identified as a hot spot in the trafficking literature. This paper is based on case studies of 78 women who had been trafficked from their places of origin in Anantapur district in Andhra Pradesh to metropolitan cities across India and who have since returned to their homes. The paper attempted to identify the individual and family circumstances that contribute to the causes of trafficking, to highlight in particular the gendered vulnerabilities that set these women up for trafficking, and to capture the process of the trafficking experience. The findings of the study are located in the dynamic interplay of the social structural context and specificities of the district that contribute to causes of trafficking and the individual circumstances and agency of the women. The case studies reported in this paper are a pointer to the compelling urgency of interventions that will go beyond the forced / voluntary divide in trafficking and sex work.Andhra Pradesh, India, trafficking
The Right to Strike under the United States Constitution: Theory, Practice, and Possible Implications for Canada
Answering critics of the Canadian Supreme Court's judgment in B.C. Health, the author argues that the Court laid the foundation for a principled and durable doctrine protecting constitutional labour rights, one that goes directly to the heart of the matter — the inequality of workers’ power in the employment relation. In the author’s view, two paths could lead from B.C. Health to the recognition of Charter protec- tion for a right to strike: one that treats the right as an accessory to col- lective bargaining, and one that upholds the right directly on the basis of the Charter values of equality and participation. The author supports the latter approach, contending that constitutional rights should be defined in relation to fundamental values, in a way that is not contingent on time-bound or fact-sensitive assessments about the role of strikes within a particular collective bargaining regime. Although a Charter right to strike may involve the courts in difficult choices about when to defer to legislative policy decisions, and courts may lack the institutional capac- ity to deal effectively with labour law issues, the author points out that judges can look to ILO standards for expert guidance. Noting that the U.S. experience in this area might be of considerable use to Canadians, the author concludes by providing an overview of American case law concerning a constitutional right to strike.Peer reviewe
G-Rank: Unsupervised Continuous Learn-to-Rank for Edge Devices in a P2P Network
Ranking algorithms in traditional search engines are powered by enormous training data sets that are meticulously engineered and curated by a centralized entity. Decentralized peer-to-peer (p2p) networks such as torrenting applications and Web3 protocols deliberately eschew centralized databases and computational architectures when designing services and features. As such, robust search-and-rank algorithms designed for such domains must be engineered specifically for decentralized networks, and must be lightweight enough to operate on consumer-grade personal devices such as a smartphone or laptop computer. We introduce G-Rank, an unsupervised ranking algorithm designed exclusively for decentralized networks. We demonstrate that accurate, relevant ranking results can be achieved in fully decentralized networks without any centralized data aggregation, feature engineering, or model training. Furthermore, we show that such results are obtainable with minimal data preprocessing and computational overhead, and can still return highly relevant results even when a user’s device is disconnected from the network. G-Rank is highly modular in design, is not limited to categorical data, and can be implemented in a variety of domains with minimal modification. The results herein show that unsupervised ranking models designed for decentralized p2p networks are not only viable, but worthy of further research.https://github.com/awrgold/G-RankComputer Scienc
- …
