2,239 research outputs found
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
No full textThe 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
Scientometric Portrait of Homi Jehangir Bhabha: The Father of Indian Nuclear Research Programme
No full textQuantitative and qualitative analysis with graphic representation of the publication productivity of a scientist facilitates easy and clear perception about the work of a scientist. Bhabha’s scientific work spanned over more than three decades (1933-1967) during which he published 104 publications, which could be classified into nine fields: Interaction of Radiation with Matter (4), Quantum Electrodynamics (5), Mathematical Physics (2), Cosmic Ray Physics (18), Elementary Particle Physics (14), Field Theory (15), General Physics (2), Nuclear Physics (4) and General (40). The highest number of publications (6) were published in 1941, 1945 and 1964 respectively. The average number of publications published per year was 3.05. His productivity coefficient was 0.05 which is a clear indicates that his publication productivity was quite consistent throughout his scientific career. He was single author in 79 of his publications and the main author in 24 publications indicates that he always preferred to work himself and lead the team as ‘mentor’. Bhabha had 22 collaborators during the period. Team of research collaborators working with a successful scientist documents the sociological aspect of history of science while generating knowledge by a leader in a domain.
Bhabha became a citable author in 1937. Bhabha received 1211 citations to his 30 publications out of 104 publications. Out of 104, 74 publications did not receive any citations. Out of 74 publications, 40 publications dealt subjects mainly of general interest. Bhabha’s 86.66 percent of cited publications received their first citations within four years of their publication indicates that his publications were noticed immediately and had direct impact among the fellow researchers working all over the world. His overall citation rate was 11.64 per cited publication. The highest citations 389 were received to the domain ‘Cosmic ray physics’. The highest number of citations received were 45 in 1938. His self-citations were only 24 (1.98%) and citations by others were 1187 (98.02%). The highest self citations were six in 1946. Bhabha’s mean diachronous self-citation rate was 1.98. The highest citation rate 28.4 was to the domain ‘Quantum electrodynamics. His single authored publications have received the highest number 863 (71.26%) of citations. Bhabha’s five publications have been cited more than 100 times each. His publications have been cited by the authors working in various diverse fields like nuclear physics, mathematical physics, instrumentation, optics, geophysics and geochemistry, condensed matter physics, applied physics, electrical and electronic engineering, mechanical engineering etc., indicating a very diverse influence and impact of Bhabha’s publications. Bhabha’s publications have also been cited by the Nobel laureates like V. L. Ginzberg, Wolfgang Pauli, H. A. Bethe, M. Born, W. Bothe, E. P. Wigner, H. Yukawa, P. M. S. Blackett and C. N. Yang which is an indication of his originality of ideas and high quality of publications
Energy transfers in small-scale and large-scale dynamos
No full textWe study energy transfers during magnetic energy growth in small-scale and large-scale dynamos. We perform direct numerical simulations for magnetic Prandtl number Pm =20 and 0.2 in a periodic box on 1024^3 grid. Energy fluxes and shell-to-shell energy transfers indicate that in small-scale dynamo for Pm =20, the magnetic energy growth takes place due to a non-local energy transfer from large-scale velocity field to small-scale magnetic field. On the other hand, in large-scale dynamo for Pm =0.2, local energy transfers from large-scale velocity field to large-scale magnetic field takes place
Rural Green Marketing: Challenges and Opportunities in India
No full textRural Green Marketing: Challenges and Opportunities in India
Author / Authors : Indal Kumar
Page no.194-203
Discipline : Applied Economics/ Management/ Commerce
Script/language : English/Roman
Category : Research paper
Keywords: Rural Green Product, Environmentally safe of rural market, opportunities and challenges of Green Marketing
Scientometric portrait of Nobel laureate Leland H. Hartwell
No full textLeland H. Hartwell was honoured with the Nobel Prize in Physiology or Medicine (2001) at his 62 years age and at 41 years of research publishing career. The first contribution of the author was in 1961 at the age of 22. The number of his contributions in a year peaked in 1997 when it touched 8. He had 108 publications during 1961 – 2001 in domains: Molecular Biology of Cell Cycle Regulation (43), Genetics of Cell Division (48), Genomic Re-arrangement and DNA Repair (9), Molecular Genetics of Yeast Cell Fission (5), and Drug Target Interaction (3) which were analysed for authorship pattern with his 101 collaborators. Most active researchers having number of publications with Leland H. Hartwell were : Weinert, T. A. (10), Garvik, B. M. (8), McLaughlin, C. S. (8), Jenness, D. D. (5). His productivity coefficient was 0.76 which clearly indicates that his productivity increased after 50 percentile age. Highest collaboration coefficient (1) for Leland H. Hartwell was found during 1963-1965, 1968-1969, 1977, 1981-1983, 1985-1990, 1996 and 1998-2001. Journals have been the most preferred channel of communication where, as many as 96 papers out of 108 have been published. The core journals publishing his papers were: Cell (14), Genetics (12), Mol. Cell Biol. (8), J. Bactariol. (7), J. Cell Biol. ( 7), Science (7) J. Mol. Biol.(6), Exp. Cell Res. (5), and Proc. Nat. Acad. Sci.(5). Publication density is 2.63 and Publication concentration is 14.63. Most prolific keywords in titles of publications were: Saccharomyces cerevisiae , Yeast , Cell division cycle , RAD9, DNA Damage , Genes , Cell cycle, Genetic control , Check point (s) , Cell division , Mutant of Yeast
Not Available
No full textNot AvailableSearch; Personalize: Your alerts; Your baskets; Your searches. Your alerts; Your baskets; Your searches. login. login. Home > Management of early blight disease of tomato cv 'Kashi Amrit' through fungicides, bioagents and cultural practices in India. World Vegetable Center. Information; Usage statistics; Files; Holdings. Record Details. Title: Management of early blight disease of tomato cv 'Kashi Amrit' through fungicides, bioagents and cultural practices in India. Author(s): Kumar, V. Gupta, RC Singh, PC Pandey, KK Kumar, R. Rai, AB Rai, M. Publication date: 2007. Subject(s): TOMATOES EARLY BLIGHT PLANT DISEASES FUNGICIDES PLANT DISEASE CONTROL DISEASE RESISTANCE ALTERNARIA SOLANI ALTERNARIA ALTERNATA GROWTH India IN …Not Availabl
Locally Recoverable Streaming Codes for Packet-Erasure Recovery
No full textStreaming codes are a class of packet-level erasure codes that are designed with the goal of ensuring recovery in low-latency fashion, of erased packets over a communication network. It is well-known in the streaming code literature, that diagonally embedding codewords of a [τ+1,τ+1-a] Maximum Distance Separable (MDS) code within the packet stream, leads to rate-optimal streaming codes capable of recovering from a arbitrary packet erasures, under a strict decoding delay constraint τ. Thus MDS codes are geared towards the efficient handling of the worst-case scenario corresponding to the occurrence of a erasures. In the present paper, we have an increased focus on the efficient handling of the most-frequent erasure patterns. We study streaming codes which in addition to recovering from a>1 arbitrary packet erasures under a decoding delay τ, have the ability to handle the more common occurrence of a single-packet erasure, while incurring smaller delay r<τ. We term these codes as (a,τ,r) locally recoverable streaming codes (LRSCs), since our single-erasure recovery requirement is similar to the requirement of locality in a coded distributed storage system. We characterize the maximum possible rate of an LRSC by presenting rate-optimal constructions for all possible parameters {a,τ,r}. Although the rate-optimal LRSC construction provided in this paper requires large field size, the construction is explicit. It is also shown that our (a,τ=a(r+1)-1,r) LRSC construction provides the additional guarantee of recovery from the erasure of h, 1 ≤ h ≤ a, packets, with delay h(r+1)-1. The construction thus offers graceful degradation in decoding delay with increasing number of erasures
Techniques for the performance analysis of queueing networks
No full textETDs are only available to UIUC Users without author permissionU of I OnlyAnalyzing the performance of queueing networks that do not admit a product form solution is a challenging problem. In this thesis we present some tools for doing so. Our attention is restricted to Markovian queueing networks.We first present a technique for bounding the performance of such networks. Assuming a steady state for functionals of the state, we obtain linear programs which bound the performance. This technique is illustrated using quadratic functionals to bound the performance of a class of Markovian queueing networks called reentrant lines. We also show how this technique may be applied to bound throughput and blocking probabilities in networks with buffer capacity constraints. In some cases bounds obtained using multimedial functional of the state are shown to approach the exact value when the degree of the multimedial increases.We also study another important technique for the analysis of queueing networks, namely, the fluid limit approach. This approach is used to establish the stability of a class of policies called Fluctuation Smoothing policies for open reentrant lines. We also show how the fluid limit approach can be used to obtain the asymptotic performance of closed queueing networks in heavy traffic. We then use fluid limits to establish the efficiency of Fluctuation Smoothing policies for closed reentrant lines, as well as the Harrison-Wein policy for two station closed reentrant lines.Made available in DSpace on 2011-05-07T14:22:46Z (GMT). No. of bitstreams: 2
license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5)
9712342.pdf: 3631108 bytes, checksum: 5422ba3637cbb350f0300bee0e301aca (MD5)
Previous issue date: 1996Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding ([email protected]) on 2011-05-07T15:06:04Z
Item is restricted indefinitely.Restriction data tranferred 2014-07-01T11:31:42-05:00
Original Data
Group with Access UIUC Users [automated]
Release Date: none
Reason: ETDs are only available to UIUC Users without author permissio
Clock multiplication techniques for high-speed I/Os
No full textGeneration of a low-jitter, high-frequency clock from a low-frequency reference clock using classical analog phase-locked loops (PLLs) requires a large loop filter capacitor and power hungry oscillator. Digital PLLs can help reduce area but their jitter performance is severely degraded by quantization error. In this dissertation different clock multiplication techniques have been explored that can be suitable for high-speed wireline systems. With the emphasis on ring oscillator based architecture using cascaded stages, three possible architectures are explored.
First, a scrambling TDC (STDC) is presented to improve deterministic jitter (DJ) performance when used with a low-frequency reference clock. A cascaded architecture with digital multiplying delay locked loop as the first stage and hybrid analog/digital PLL as the second stage is used to achieve low random jitter in a power efficient manner. Fabricated in a 90nm CMOS process, the prototype frequency synthesizer consumes 4.76mW power from a 1.0V supply and generates 160MHz and 2.56 GHz output clocks from a 1.25MHz crystal reference frequency. The long-term absolute jitter of the 60MHz digital MDLL and 2.56 GHz digital PLL outputs are 2.4 psrms and 4.18 psrms, while the peak-to-peak jitter is 22.1 ps and 35.2 ps, respectively. The proposed frequency synthesizer occupies an active die area of 0.16mm2 and achieves power efficiency of 1.86 mW/GHz.
Second, a hybrid phase/current-mode phase interpolator (HPC-PI) is presented to improve phase noise performance of ring oscillator-based fractional-N PLLs. The proposed HPC-PI alleviates the bandwidth trade-off between VCO phase noise suppression and ΔΣ quantization noise suppression. By combining the phase detection and interpolation functions into an XOR phase detector/interpolator (XOR PD-PI) block, accurate quantization error cancellation is achieved without using calibration. Use of a digital MDLL in front of the fractional-N PLL helps in alleviating the bandwidth limitation due to reference frequency and enables bandwidth extension even further. The extended bandwidth helps in suppressing the ring-VCO phase noise and lowering the in-band noise floor. Fabricated in 65nm CMOS process, the prototype generates fractional frequencies from 4.25 to 4.75 GHz, with an in-band phase noise floor of -104 dBc/Hz and 1.5 psrms integrated jitter. The clock multiplier achieves power efficiency of 2.4mW/GHz and FoM of -225.8 dB.
Finally, an efficient clock generation, recovery, and distribution techniques for flexible-rate transceivers are presented. Using a fixed-frequency low-jitter clock provided by an integer-N PLL, fractional frequencies are generated/recovered locally using multi-phase fractional clock multipliers. Fabricated in a 65nm CMOS, the prototype transceiver can be programmed to operate at any rate from 3-to-10 Gb/s. At 10 Gb/s, integrated jitter of the Tx output and recovered clock is 360 fsrms and 758 fsrms, respectively.Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2019-05-01The student, Romesh Kumar Nandwana, accepted the attached license on 2017-04-17 at 15:09.The student, Romesh Kumar Nandwana, submitted this Dissertation for approval on 2017-04-17 at 15:42.This Dissertation was approved for publication on 2017-04-19 at 08:46.DSpace SAF Submission Ingestion Package generated from Vireo submission #10816 on 2017-08-10 at 15:05:48Made available in DSpace on 2017-08-10T20:32:59Z (GMT). No. of bitstreams: 3
NANDWANA-DISSERTATION-2017.pdf: 11016809 bytes, checksum: 1b5e34fe2c8986eeef6902237bb6f311 (MD5)
LICENSE.txt: 4218 bytes, checksum: a246f466819d5f63b537a54ce4202fa9 (MD5)
PROQUEST_LICENSE.txt: 4564 bytes, checksum: 451c495ff0b82c7566e4aac529f530bf (MD5)
Previous issue date: 2017-04-19Embargo set by: Colleen Fallaw for item 102771
Lift date: 2019-08-10T21:27:21Z
Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD systemU of I Only Restriction Lifted for Item 102771 on 2019-08-11T09:15:10Z
Internet-of-Forensic (IoF): A blockchain based digital forensics framework for IoT applications
No full textDigital forensic in Internet-of-Thing (IoT) paradigm is critical due to its heterogeneity and lack of transparency of evidence processing. Moreover, cross-border legalization makes a hindrance in such process pertaining to the cloud forensic issues. This urges a forensic framework for IoT which provides distributed computing, decentralization, and transparency of forensic investigation of digital evidences in cross-border perspectives. To this end, we propose a framework for IoT forensics that addresses the above mentioned issues. The proposed solution called Internet-of-Forensics (IoF) considers a blockchain tailored IoT framework for digital forensics. It provides a transparent view of the investigation process that involves all the stakeholders (e.g., heterogeneous devices, and cloud service providers) in a single framework. It uses blockchain-based case chain to deal with the investigation process including chain-of-custody and evidence chain. Consensus is used for consortium to solve the problems of cross-border legalization. This is also beneficial for a transparent and ease of forensic reference. The programmable lattice-based cryptographic primitives produce reduced complexities. It shows benefits for power-aware devices and puts an add-on to the novelty of the presented idea. IoF is generic; hence, it can be used by autonomous security operation centers, cyber-forensic investigators and manually initiated evidences under chain-of-custody for man-made crimes. Security services are assured as required by the framework. IoF is experimented and compared with the other state-of-the-art frameworks. The outcomes and analysis prove the efficiency of IoF concerning complexity, time consumption, memory and CPU utilization, gas consumption, and energy analysis
- …
