108,871 research outputs found
Recent advances in drug delivery technology/ Raj K. Keservani, Anil K. Sharma, and Rajesh Kumar Kesharwani [editors].
No full textIncludes bibliographical references and index."[This book] is a pivotal reference source for the latest scholarly research on the application of pharmaceutical technology to optimize techniques for drug delivery in patients"--Provided by publisher.Personalized approach in nanomedicine: understanding adverse effects and their risk assessment / Maria Vlasova, Boris V. Smirin -- Drug delivery strategies for tolerogenic therapy for autoimmune diseases in an antigen-specific manner / Kevin J. Peine [and 3 others] -- Cancer drug delivery: pharmacogenetics, biomarkers, and targeted therapies / Jai N. Patel, Jeryl Villadolid -- Genomics and proteomic approach in the treatment of various human diseases: applications of genomics and proteomics / Urmila Jarouliya, Raj K. Keservani -- Bioinformatics and its therapeutic applications / Sarvesh Kumar Gupta, Kamal Kumar Chaudhary, Nidhi Mishra -- An overview and therapeutic applications of nutraceutical and functional foods / Raj K. Keservani, Anil K. Sharma, Rajesh K. Kesharwani -- Phytoparmaceuticals and its applications in therapy / Alejandra Hernández-Ceruelos, Sergio Muñoz-Juarez, Patricia Vázquez-Alvarado -- A perspective on the phytopharmaceuticals responsible for the therapeutic applications / Rajesh K. Joshi -- Phytopharmaceutical applications of nutraceutical and functional foods / Dhan Prakash, Charu Gupta -- Cosmeceuticals: safety, efficacy and potential benefits / Long Chiau Ming [and 5 others] -- Cosmeceuticals: camel and other milk -- natural skin maintenance / Reuven Yagil -- Resealed erythrocytes as drug carriers and its therapeutic applications / Prabhakar Singh, Sudhakar Singh, Rajesh Kumar Kesharwani -- New herbal approaches for the treatment of diabetic kidney diseases and its therapeutic implications / Durgavati Yadav [and 3 others].1 online resource (509 pages)
Online Public Shaming on Twitter- Dataset
No full text<p>This dataset contains about 870k unlabelled and 1227 labelled collection of tweet ids of several public shaming events in Twitter. Go through the included README file.</p>
<p>Refer to the paper below for more details.</p>
<p>Basak, Rajesh, Shamik Sural, Niloy Ganguly, and Soumya K. Ghosh. "Online Public Shaming on Twitter: Detection, Analysis, and Mitigation." IEEE Transactions on Computational Social Systems (2019)</p>
Tight Lower Bounds for Approximate & Exact k-Center in Rd
No full textIn the discrete k-Center problem, we are given a metric space (P, dist) where \textbarP \textbar = n and the goal is to select a set C ? P of k centers which minimizes the maximum distance of a point in P from its nearest center. For any ? > 0, Agarwal and Procopiuc SODA'98, Algorithmica'02 designed an (1 + ?)-approximation algorithm1 for this problem in d-dimensional Euclidean space2 which runs in O(dn log k) + ( k? )O(k1-1/d) · nO(1) time. In this paper we show that their algorithm is essentially optimal: if for some d = 2 and some computable function f, there is an f(k)· ( 1? )o(k1-1/d) ·no(k1-1/d) time algorithm for (1 + ?)-approximating the discrete k-Center on n points in d-dimensional Euclidean space then the Exponential Time Hypothesis (ETH) fails. We obtain our lower bound by designing a gap reduction from a d-dimensional constraint satisfaction problem (CSP) to discrete d-dimensional k-Center. This reduction has the property that there is a fixed value ? (depending on the CSP) such that the optimal radius of k-Center instances corresponding to satisfiable and unsatisfiable instances of the CSP is \< 1 and = (1 + ?) respectively. Our claimed lower bound on the running time for approximating discrete k-Center in d-dimensions then follows from the lower bound due to Marx and Sidiropoulos SoCG'14 for checking the satisfiability of the aforementioned d-dimensional CSP. As a byproduct of our reduction, we also obtain that the exact algorithm of Agarwal and Procopiuc SODA'98, Algorithmica'02 which runs in nO(d·k1-1/d) time for discrete k-Center on n points in d-dimensional Euclidean space is asymptotically optimal. Formally, we show that if for some d = 2 and some computable function f, there is an f(k) · no(k1-1/d) time exact algorithm for the discrete k-Center problem on n points in d-dimensional Euclidean space then the Exponential Time Hypothesis (ETH) fails. Previously, such a lower bound was only known for d = 2 and was implicit in the work of Marx IWPEC'06. © Rajesh Chitnis and Nitin Saurabh; licensed under Creative Commons License CC-BY 4.
Joshua Davis: Author of Spare Parts
No full textCitation: K-State First (2016). Joshua Davis: Author of Spare Parts [Flier]. Manhattan, Kansas: K-State First.Flyer advertising Joshua Davis's author talk at Kansas State University
Steven Johnson Author Talk Poster
No full textK-State Book NetworkA poster advertising an author talk by Steven Johnson at Kansas State University on September 3, 2014. Steven Johnson's book "The Ghost Map" was the 2014-2015 common book
Winning over the Odds and the Predictions: A Critical Study of K V Raghupathi’s “Rajesh, the Musician”
No full textBorn in 1957, K.V. Raghupathi has been writing for nearly decades. His main forte is poetry. A leading voice inIndian English Poetry, he is currently teaching at Central University of Tamil Nadu, Thiruvarur. He has published nine collections in addition to four critical works and two books onYoga. His poetry is rooted in the abundance of philosophy, nature, transcendentalism, imagery and social perspectives. Besides being apoet his other passions include classical Karnatic music, bird watching and ancient and contemporary Indian philosophy.[i]
K V Raghupathi’s Rajesh, the Musician[ii]is one of the short stories in collection of short stories entitledThe Untouchable Piglet(2016). It is about the journey of a twenty-two year old low caste man Rajesh with a great desire to learn Karnatic [CARNATIC] music who is initially rejected to be taught music by two teachers on the reason that Rajesh is not a Brahmin. However, the short story amplifies how Rajesh, eventually, learns from another teacher and finally mastered the Karnatic music, against all odds, and becomes an outstanding musician. The short story reveals that one can attain success provided one has dedication and perseverance towards one’s goals.
 
Chiloscyphus chinnarensis Manju, K. P. Rajesh et Madhus., Acta Bot. Hung.
No full textChiloscyphus chinnarensis Manju, K.P.Rajesh et Madhus., Acta Bot. Hung. 53 (1–2): 152, 2011 (see Manju et al. 2011). TYPE: “ India, Kerala, Idukki district, Chinnar Wildlife Sanctuary, Kariveppin shola, alt.: 1,850 m, on trunk of trees. Coll.: Manju, C. N. and Rajesh, K. P. (87425c), 19 January 2003. Holotype: CALI, isotypes: CALI, EGR ”.Published as part of Söderström, Lars, Hagborg, Anders & Konrat, Matt Von, 2014, Early Land Plants Today: Index of Liverworts & Hornworts 2011 - 2012, pp. 61-85 in Phytotaxa 170 (2) on page 64, DOI: 10.11646/phytotaxa.170.2.1, http://zenodo.org/record/477961
From variability tolerance to approximate computing in parallel integrated architectures and accelerators
No full textThis book focuses on computing devices and their design at various levels to combat variability. The authors provide a review of key concepts with particular emphasis on timing errors caused by various variability sources. They discuss methods to predict and prevent, detect and correct, and finally conditions under which such errors can be accepted; they also consider their implications on cost, performance and quality. Coverage includes a comparative evaluation of methods for deployment across various layers of the system from circuits, architecture, to application software. These can be combined in various ways to achieve specific goals related to observability and controllability of the variability effects, providing means to achieve cross layer or hybrid resilience. · Covers challenges and opportunities in identifying microelectronic variability and the resulting errors at various layers in the system abstraction; · Enables readers to assess how various levels of circuit and system design can mitigate the effects of variability; · Demonstrates overall system architecture of what is now called “approximate computing” paradigm in massively parallel integrated architectures and accelerators
sj-pdf-1-jmx-10.1177_00222429221114317 - Supplemental material for Innovation Imprinting: Why Some Firms Beat the Post-IPO Innovation Slump
No full textSupplemental material, sj-pdf-1-jmx-10.1177_00222429221114317 for Innovation Imprinting: Why Some Firms Beat the Post-IPO Innovation Slump by Simone Wies, Christine Moorman and Rajesh K. Chandy in Journal of Marketing</p
CIRCA-GPUs: Increasing instruction reuse through inexact computing in GP-GPUs
No full text"Inexact computing" provides an opportunity for exploiting application characteristics to improve energy efficiency. This is particularly true of error-tolerant image processing applications that are often implemented using large scale parallel processing resources in general-purpose graphics processing units or GP-GPUs. GP-GPUs provide fine-grained parallel architecture by integrating a large number of relatively small and tightlycoupled processing cores. We propose CIRCA-GPUs, a method to jointly exploit fine-grained parallelism and inexact computing in GP-GPUs by reusing results of instructions across different cores and over time. This spatiotemporal instruction reuse with systematic approximation of computing results increases the rate of reuse to improve energy efficiency
- …
