101,982 research outputs found
Memory requirement reduction of deep neural networks for field programmable gate arrays using low-bit quantization of parameters
No full textEffective employment of deep neural networks (DNNs) in mobile devices and embedded systems, like field programmable gate arrays, is hampered by requirements for memory and computational power. In this paper we propose a method that employs a non-uniform fixed-point quantization and a virtual bit shift (VBS) to improve the accuracy of the quantization of the DNN weights. We evaluate our method in a speech enhancement application, where a fully connected DNN is used to predict the clean speech spectrum from the input noisy speech spectrum. A DNN is optimized, its memory requirement is calculated, and its performance is evaluated using the short-time objective intelligibility (STOI) metric. The application of the low-bit quantization leads to a 50% reduction of the DNN memory requirement while the STOI performance drops only by 2.7%
Brilliant blue G-assisted peeling of the internal limiting membrane in macular hole surgery
No full textDye-assisted internal limiting membrane (ILM) peeling and gas tamponade is the surgery of choice for idiopathic macular holes. Indocyanine green and trypan blue have been extensively used to stain the ILM. However, the retinal toxicity of indocyanine green and non-uniform staining with trypan blue has necessitated development of newer vital dyes. Brilliant blue G has recently been introduced as one such dye with adequate ILM staining and no reported retinal toxicity. We performed a 23-gauge pars plana vitrectomy with brilliant blue G-assisted ILM peeling in six patients with idiopathic macular holes, to assess the staining characteristics and short-term adverse effects of this dye. Adequate staining assisted in the complete removal of ILM and closure of macular holes in all cases. There was no evidence of intraoperative or postoperative dye-related toxicity. Brilliant blue G appears to be safe dye for ILM staining in macular hole surgery
SPECIES DISTRIBUTION MODELING OF MUSK DEER USING REMOTE SENSING AND G.I.S, UTTARAKHAND
No full textAbstract: Musk deer (Moschus chrysogaster) is considered Endangered by International Union for Conservation of Nature (IUCN) and is under Schedule-I of the Indian Wildlife (Protection) Act, 1972, because of its illicit hunting for musk as well as habitat loss. The present study aims to analyze the present distribution pattern of Musk Deer in the Himalayan region of Uttarakhand. Precipitation of the driest month (Bio14), mean temperature of warmest quarter (Bio10), annual mean temperature ( Bio1) and land use land cover were the major contributing variables to the model with area under Receiver Operating Characteristics (ROC) curve being 0.924. Using the Global Climate Models (GCM) MaxEnt and MIROC6, we projected the distribution of the endangered Musk Deer in the Himalayan region of Uttarakhand for the years 2021-2040, 2041-2060, 2061-2080, and 2081-2100. Future climate change will either widen, narrow, or shift the climatic niche of many species, which may cause those species' geographic ranges to change. Overall, the shift of habitat shows a latitudinal pattern.
Keywords: Musk Deer, Species Distribution Modelling (SDM), MaxEnt, Uttarakhand, Bioclimatic variables.
Title: SPECIES DISTRIBUTION MODELING OF MUSK DEER USING REMOTE SENSING AND G.I.S, UTTARAKHAND
Author: Arushi Lohani, Dr. Suneet Naithani, Dr. G. Areendran, Sunny Joshi
International Journal of Life Sciences Research
ISSN 2348-313X (Print), ISSN 2348-3148 (online)
Vol. 10, Issue 4, October 2022 - December 2022
Page No: 47-56
Research Publish Journals
Website: www.researchpublish.com
Published Date: 18-November-2022
DOI: https://doi.org/10.5281/zenodo.7335477
Paper Download Link (Source)
https://www.researchpublish.com/papers/species-distribution-modeling-of-musk-deer-using-remote-sensing-and-gis-uttarakhandInternational Journal of Life Sciences Research, ISSN 2348-313X (Print), ISSN 2348-3148 (online), Research Publish Journals, Website: www.researchpublish.co
Bibliographie Hilarion G. Petzold 1958 – 2009 mit Anhang als Einführung
No full textDieses 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
No full textWe 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
No full textPhotograph of author Samuel G. Freedman, at NT Daily Slash meeting in the Mayborn School of Journalism at UNT
The Right to Strike under the United States Constitution: Theory, Practice, and Possible Implications for Canada
No full textAnswering 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
No full textRanking 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
Author inscription in The Chinese slave-girl: a story of woman's life in China
No full textThis edition includes a gift inscription by author Rev. J.A. Davis, "To Rev. A. G. Russell with the warmest regards of the author J.A. Davis."Davis, John Agnell, 1839-1897
- …
