470 research outputs found
Masquerade Syndrome
No full text<p>Masquerade Syndrome, Koushik Tripathy MD, DNB, Rashmi Singh MBBS, Rohan Chawla MD, FRCS, Yog Raj Sharma MS, Rajpal Vohra MD, Ravi Bypareddy MD, Subodh Kumar Singh MD<br>DOS Times - Vol. 20, No. 3 September, 2014</p>
<p> </p
Recent Advances in Management of Diabetic Macular Edema
No full text<p>Recent advances in management of diabetic macular edema: Koushik Tripathy, MD; Yog Raj Sharma, MS; Karthikeya R, MBBS; Rohan Chawla, FRCS; Varun Gogia, MD; Subodh Kumar Singh, MD; Pradeep Venkatesh, MD; Rajpal Vohra, MD</p>
<p>Current Diabetes Reviews, 2015, 11, 79-97</p
Evolution of Vitreous Substitutes
No full text<p>Evolution of Vitreous Substitutes: Ravi Bypareddy MD, DNB, Obuli Ramchandran N. MBBS, Koushik Tripathy MD, DNB, Subodh Kumar Singh MBBS, Harshinder Singh MD, Rohan Chawla MD, Rajpal Vohra MD, Yog Raj Sharma MS<br>DOS times, Vol. 20, No. 5</p>
<p> </p
Traumatic retinal detachment
No full text<p>Traumatic retinal detachment: Monika Kapoor, Rohan Chawla, Koushik Tripathy, Ravi Bypareddy, Babulal Kumawat, Subodh Kumar Singh, Pradeep Venkatesh, Rajpal Vohra, Yog Raj Sharma<br>DOS Times- Vol 20, No. 8, February, 2015</p>
<p> </p
Clinical profile of Medicolegal cases presenting to eye casualty in a tertiary care centre in India
No full text<p>Clinical profile of Medicolegal cases presenting to eye casualty in a tertiary care centre in India. Koushik Tripathy, Harsh Inder Singh, Subodh Kumar Singh, Yog Raj Sharma, Pradeep Venkatesh, Rajpal Vohra, Rohan Chawla, Alkananda Behera, Rashmi Singh<br>Ocutron, 2014; The annual conference of Ocular Trauma Society of India<br>2014-10 | conference-paper</p>
<p> </p
Unfolding-based Partial Order Reduction
No full textPartial order reduction (POR) and net unfoldings are two alternative methods to tackle state-space explosion caused by concurrency. In this paper, we propose the combination of both approaches in an effort to combine their strengths. We first define, for an abstract execution model, unfolding semantics parameterized over an arbitrary independence relation. Based on it, our main contribution is a novel stateless POR algorithm that explores at most one execution per Mazurkiewicz trace, and in general, can explore exponentially fewer, thus achieving a form of super-optimality. Furthermore, our unfolding-based POR copes with non-terminating executions and incorporates state caching. On benchmarks with busy-waits, among others, our experiments show a dramatic reduction in the number of executions when compared to a state-of-the-art DPOR
Anatomical and functional outcomes of prophylactic laser of choroidal coloboma
No full text<p>Anatomical and functional outcomes of prophylactic laser of choroidal coloboma.Koushik Tripathy, Yog Raj Sharma, Harsh Inder Singh, Subodh Kumar Singh, Pradeep Venkatesh, Rajpal Vohra, Varun Gogia, Ravi Bypareddy, Babulal Kumawat46th Annual Scientific Congress of The Royal Australian and New Zealand College of Ophthalmologists to be held at the Brisbane Convention and Exhibition Centre Brisbane, Australia on 22 to 26 November 2014</p>
<p>2014-11 | conference-poster</p>
<p>- See more at: https://orcid.org/my-orcid#sthash.c1sXoqNm.dpuf</p
Fundal coloboma: ocular features and role of prophylactic laser in 415 eyes
No full text<p>Fundal coloboma: ocular features and role of prophylactic laser in 415 eyes: Babulal Kumawat, Koushik Tripathy, Yog Raj Sharma, Rohan Chawla, Harsh Inder Singh, Subodh Kumar Singh, Ravi Bypareddy, Pradeep Venkatesh, Rajpal Vohra<br>EP-RET-0806: SOE 2015 Congress (The annual conference of 'The European Society of Ophthalmology'), 6-9 June 2015, Vienna, Austria<br>2015-06 | conference-poster</p>
<p>URL: http://soe2015.org/</p>
<p> </p
Doctor of Philosophy
No full textdissertationMessage passing (MP) has gained a widespread adoption over the years, so much so, that even heterogeneous embedded multicore systems are running programs that are developed using message passing libraries. Such a phenomenon is a shift in computing practices, since, traditionally MP programs have been developed specifically for high performance computing. With growing importance and the complexity of MP programs in today\u27s times, it becomes absolutely imperative to have formal tools and sound methodologies that can help reason about the correctness of the program. It has been demonstrated by many researchers in the area of concurrent program verification that a suitable strategy to verify programs which rely heavily on nondeterminism, is dynamic verification. Dynamic verification integrates the best features of testing and model checking. In the area of MP program verification, however, there have been only a handful of dynamic verifiers. These dynamic verifiers, despite their strengths, suffer from the explosion in execution scenarios. All existing dynamic verifiers, to our knowledge, exhaustively explore the nondeterministic choices in an MP program. It is apparent that an MP program with many nondeterministic constructs will quickly inundate such tools. This dissertation focuses on the problem of containing the exponential space of execution scenarios (or interleavings) while providing a soundness and completeness guarantee over safety properties of MP programs (specifically deadlocks). We present a predictive verification methodology and an associated framework, called MAAPED(Messaging Application Analysis with Predictive Error Discovery), that operates in polynomial time over MP programs to detect deadlocks among other safety property violations. In brief, we collect a single execution trace of an MP program and without re-running other execution schedules, reliably construct the artifacts necessary to predict any mishappening in an unexplored execution schedule with the aforementioned formal guarantee. The main contributions of the thesis are the following: The Functionally Irrelevant Barrier Algorithm to increase program productivity and ease in verification complexity. A sound pragmatic strategy to reduce the interleaving space of existing dynamic verifiers which is complete only for a certain class of MPI programs. A generalized matches-before ordering for MP programs. A predictive polynomial time verification framework as an alternate solution in the dynamic MP verification landscape. A soundness and completeness proof for the predictive framework\u27s deadlock detection strategy for many formally characterized classes of MP programs. In the process of developing solutions that are mentioned above, we also collected important experiences relating to the development of dynamic verification schedulers. We present those experiences as a minor contribution of this thesis
- …
