10,226 research outputs found
Dr Radhakrishnan as a Philosopher
No full textDr Radhakrishnan’s thinking was Upanishadic. He also firmly believed in the birth of a new order based on ancient Indian wisdom. Drawing his inspiration from the Vedas, the Upanisads and the Gita, Radhakrishnan believed that humanity must become one. What kind of religion did Radhakrishnan advocate? Not a credal or dogmatic one, not an intellectual theology disputing over dogmas and contemplations. Radhakrishnan takes pride in the fact that Hinduism is not bound up with a creed or a dogma, with a founder – prophet or a historical personality, with a book like the Bible or the Quran, but a “persistent search for truth on the basis of a continuously renewed experience”. Radhakrishnan, as an ardent Hindu, could not transcend Hinduism itself. He was respectful of all religions, but it is ultimately Hindu standards by which he judged other religions. Hinduism was always for him the ideal religion, of course, a Hinduism re-interpreted, purged of all that he found distasteful in it. That President Radhakrishnan was a dhvajasthambalam in the temple of our nation’s consciousness: upright and resplendent in rough weather and fair, inspiring us to a higher purpose. K R Srinivas Iyengar noted that without the reserves of the spirit, the inner poise, the hidden fire, all other endowments cannot count for much. And the spirit that moved and sustained our ancient Indian Rishis and Acharyas is not foreign to Professor Radhakrishna
Set Membership with Non-Adaptive Bit Probes
No full textWe consider the non-adaptive bit-probe complexity of the set membership problem, where a set S of size at most n from a universe of size m is to be represented as a short bit vector in order to answer membership queries of the form "Is x in S?" by non-adaptively probing the bit vector at t places. Let s_N(m,n,t) be the minimum number of bits of storage needed for such a scheme. In this work, we show existence of non-adaptive and adaptive schemes for a range of t that improves an upper bound of Buhrman, Miltersen, Radhakrishnan and Srinivasan (2002) on s_N(m,n,t). For three non-adaptive probes, we improve the previous best lower bound on s_N(m,n,3) by Alon and Feige (2009)
Blattisocius trigonae Radhakrishnan & Ramaraju 2017
No full textBlattisocius trigonae Radhakrishnan & Ramaraju, 2017 Blattisocius trigonae Radhakrishnan & Ramaraju, 2017: 842. Collection records in India. Coimbatore, Tamil Nadu,on Trigona iridipennis (Hymenoptera: Apidae)(Radhakrishnan & Ramaraju, 2017). Notes: This species was described in the genus Blattisocius, but the illustration clearly shows a species of Laelapidae. It is not possible to identify it to the genus level on the basis of the available information.Published as part of Bandyopadhyay, Pritha, Karmakar, Krishna & Halliday, Bruce, 2023, Checklist of Indian mites in the family Laelapidae (Acari: Mesostigmata), pp. 401-424 in Zootaxa 5249 (4) on page 415, DOI: 10.11646/zootaxa.5249.4.1, http://zenodo.org/record/769457
Radhakrishnan (S.) Religion in a Changing World
No full textNguyen Van Phong Joseph. Radhakrishnan (S.) Religion in a Changing World. In: Archives de sociologie des religions, n°26, 1968. p. 202
Property B: Two-Coloring Non-Uniform Hypergraphs
No full textThe following is a classical question of Erdős (Nordisk Matematisk Tidskrift, 1963) and of Erdős and Lovász (Colloquia Mathematica Societatis János Bolyai, vol. 10, 1975). Given a hypergraph ℱ with minimum edge-size k, what is the largest function g(k) such that if the expected number of monochromatic edges in ℱ is at most g(k) when the vertices of ℱ are colored red and blue randomly and independently, then we are guaranteed that ℱ is two-colorable? Duraj, Gutowski and Kozik (ICALP 2018) have shown that g(k) ≥ Ω(log k). On the other hand, if ℱ is k-uniform, the lower bound on g(k) is much higher: g(k) ≥ Ω(√{k / log k}) (Radhakrishnan and Srinivasan, Rand. Struct. Alg., 2000). In order to bridge this gap, we define a family of locally-almost-uniform hypergraphs, for which we show, via the randomized algorithm of Cherkashin and Kozik (Rand. Struct. Alg., 2015), that g(k) can be much higher than Ω(log k), e.g., 2^Ω(√{log k}) under suitable conditions
Retrieval optical solitons of perturbed Radhakrishnan-Kundu-Lakshmanan equation
No full textIn this paper, the soliton behavior of the (2+1)-dimensional perturbed Radhakrishnan-Kundu-Lakshmanan equation utilizing by the new Kudryashov method is investigated. First of all, the nonlinear ordinary differential equation form of the perturbed Radhakrishnan-Kundu-Lakshmanan equation has been obtained by inserting the complex wave transformation into nonlinear partial differential equation form of the perturbed Radhakrishnan-Kundu-Lakshmanan equation. The algorithm of the proposed method has been expressed and applied to the obtained nonlinear ordinary differential equation. Then, a polynomial expression has been achieved and converted to linear algebraic system. After solving and selecting the appropriate solution set, different soliton solutions of the investigated perturbed Radhakrishnan-Kundu-Lakshmanan equation has been derived. Finally, 3D and 2D graphics of some solutions are depicted for chosen suitable parameters.</p
Retrieval optical solitons of perturbed Radhakrishnan–Kundu–Lakshmanan equation
No full textIn this paper, the soliton behavior of the (2+1)-dimensional perturbed Radhakrishnan-Kundu-Lakshmananequation utilizing by the new Kudryashov method is investigated. First of all, the nonlinear ordinary differentialequation form of the perturbed Radhakrishnan-Kundu-Lakshmanan equation has been obtained by inserting thecomplex wave transformation into nonlinear partial differential equation form of the perturbed Radhakrishnan-Kundu-Lakshmanan equation. The algorithm of the proposed method has been expressed and applied to the ob-tained nonlinear ordinary differential equation. Then, a polynomial expression has been achieved and converted tolinear algebraic system. After solving and selecting the appropriate solution set, different soliton solutions of theinvestigated perturbed Radhakrishnan-Kundu-Lakshmanan equation has been derived. Finally, 3D and 2D graph-ics of some solutions are depicted for chosen suitable parameters.</p
S. Radhakrishnan. Religion in a changing World, vol. I
No full textRoux Jean-Paul. S. Radhakrishnan. Religion in a changing World, vol. I. In: Revue de l'histoire des religions, tome 175, n°1, 1969. p. 103
V. Radhakrishnan—Scientist Par Excellence
No full text56-57Prof. V.
Radhakrishnan, who entered the heavenly abode on the 3rd of March 2011, was
fondly known as RAD to all his friends. He was the Director of the Raman
Research Institute, Bangalore
from 1972 to 1994, and a distinguished astrophysicist in his own right
An appropriate tribute to Sarvepalli Radhakrishnan Sarvepalli
No full textRadhakrishnan was born on 5 September 1888. A distinguished scholar of comparative religion and philosophy, he wrote prodigiously and taught in many institutions, including the Universities of Mysore, Calcutta and Oxford
- …
