6,397 research outputs found
I Was Addicted to Sex With Married Women
No full textAs a young man, Akhil Sharma revelled in the most dangerous of liaisons, having sex with other men's wives – until the thrill began to pall
An unusual cause of joint swelling
No full textAman Sharma, Sunil Dogra, Rajiv Mahajan, Ajay Wanchu and Surjit Sing
Maldives Resorts: Eco-Friendly Vacations
No full textLuxurious, exclusive and remote, the Maldives are the ultimate beach escape. They’re also a case study in the risks of global warming. Writer Akhil Sharma visits the country’s most eco-friendly resorts and discovers a remarkable cuisine worth protecting
Recollections of a Hindu Hedonist
No full textNovelist Akhil Sharma grew up in a teetotaling Indian household. Here, he tells how discovering a passion for great wine helped him create a new identity out of a painful past
sj-docx-1-pie-10.1177_09544089231169646 - Supplemental material for Surface pre-reacted glass reinforced dental composite: Performance assessment of physicochemical, static mechanical, dynamic mechanical and wear properties
No full textSupplemental material, sj-docx-1-pie-10.1177_09544089231169646 for Surface pre-reacted glass reinforced dental composite: Performance assessment of physicochemical, static mechanical, dynamic mechanical and wear properties by Shiv Ranjan Kumar and Ajay Sharma in Proceedings of the Institution of Mechanical Engineers, Part E: Journal of Process Mechanical Engineering</p
sj-docx-3-pie-10.1177_09544089231169646 - Supplemental material for Surface pre-reacted glass reinforced dental composite: Performance assessment of physicochemical, static mechanical, dynamic mechanical and wear properties
No full textSupplemental material, sj-docx-3-pie-10.1177_09544089231169646 for Surface pre-reacted glass reinforced dental composite: Performance assessment of physicochemical, static mechanical, dynamic mechanical and wear properties by Shiv Ranjan Kumar and Ajay Sharma in Proceedings of the Institution of Mechanical Engineers, Part E: Journal of Process Mechanical Engineering</p
sj-docx-2-pie-10.1177_09544089231169646 - Supplemental material for Surface pre-reacted glass reinforced dental composite: Performance assessment of physicochemical, static mechanical, dynamic mechanical and wear properties
No full textSupplemental material, sj-docx-2-pie-10.1177_09544089231169646 for Surface pre-reacted glass reinforced dental composite: Performance assessment of physicochemical, static mechanical, dynamic mechanical and wear properties by Shiv Ranjan Kumar and Ajay Sharma in Proceedings of the Institution of Mechanical Engineers, Part E: Journal of Process Mechanical Engineering</p
sj-docx-1-pie-10.1177_09544089221111291 - Supplemental material for Estimation of fatigue crack growth rate in different zones of friction stir welded AA7039
No full textSupplemental material, sj-docx-1-pie-10.1177_09544089221111291 for Estimation of fatigue crack growth rate
in different zones of friction stir welded AA7039 by Chaitanya Sharma, Vijay Verma, Basanthkumar and
Sumit Kumar Sharma, Ajay Tripathi, Sanjay Kumar Singh, Pankaj Sonia in Proceedings of the Institution of Mechanical Engineers, Part E: Journal of Process Mechanical Engineering</p
Interview with Lakshmi Raj Sharma, Author of The Tailor’s Needle
No full textInterview with Indian writer Lakshmi Raj Sharma, author of 'The Tailor's needle
Near-Optimal Dispersion on Arbitrary Anonymous Graphs
No full textGiven an undirected, anonymous, port-labeled graph of n memory-less nodes, m edges, and degree Δ, we consider the problem of dispersing k ≤ n robots (or tokens) positioned initially arbitrarily on one or more nodes of the graph to exactly k different nodes of the graph, one on each node. The objective is to simultaneously minimize time to achieve dispersion and memory requirement at each robot. If all k robots are positioned initially on a single node, depth first search (DFS) traversal solves this problem in O(min{m,kΔ}) time with Θ(log(k+Δ)) bits at each robot. However, if robots are positioned initially on multiple nodes, the best previously known algorithm solves this problem in O(min{m,kΔ}⋅ log ) time storing Θ(log(k+Δ)) bits at each robot, where ≤ k/2 is the number of multiplicity nodes in the initial configuration. In this paper, we present a novel multi-source DFS traversal algorithm solving this problem in O(min{m,kΔ}) time with Θ(log(k+Δ)) bits at each robot, improving the time bound of the best previously known algorithm by O(log ) and matching asymptotically the single-source DFS traversal bounds. This is the first algorithm for dispersion that is optimal in both time and memory in arbitrary anonymous graphs of constant degree, Δ = O(1). Furthermore, the result holds in both synchronous and asynchronous settings
- …
