933 research outputs found
C. C. Mehta
No full textOn the life and works of Chandravadan Chimanlal Mehta, b. 1901, Gujarati author
SuppFig1 – Supplemental material for An Automated Text Message Navigation Program Improves the Show Rate for Outpatient Colonoscopy
No full textSupplemental material, SuppFig1 for An Automated Text Message Navigation Program Improves the Show Rate for Outpatient Colonoscopy by Nadim Mahmud, Sahil D. Doshi, Mary S. Coniglio, Michelle Clermont, Donna Bernard, Catherine Reitz, Vandana Khungar, David A. Asch and Shivan J. Mehta in Health Education & Behavior</p
Mobilities in Religious Knowledge: Phiroz Mehta and the Logics of Transreligiosity in 1970s–80s South London
No full textThis paper examines transreligiosity in the context of the transmission of South Asian concepts of spirituality to the UK in the 20th century. Between the 1920s and 1990s, Indian teacher and author Phiroz Mehta (1902–1994) crossed borders in a colonial and postcolonial shuttling between India and the UK but also transgressed conceptual and practice borders of religion, teaching Indian religious concepts to post-Christian spiritual seekers in 1970s–80s South London. Mehta cultivated an elasticity between many religious and philosophical traditions, recognising the post-institutional fatigue of subjects who sought alternative forms of ‘belonging without believing’. Privileging the domestic space for teaching, as well as transitory ‘camp’ gatherings in the UK and Germany, Mehta often operated in the social margins, combining teachings from Hinduism, Buddhism, and Christianity with Zoroastrianism, Judaism (specifically Kabbalah), and Daoism. He offered his tutees the freedom to practice religion in whatever way they chose by drawing on a broad range of traditions concurrently to create a transreligiosity. This paper examines Panagiotopoulos and Roussou’s ‘transgressional webs of practising individualised forms of alternative spirituality’ in relation to Mehta’s followers in the 1970s-1980s and asks how transreligiosity relates to other theoretical analyses, such as religious exoticism, bricolage, religious appropriation, cultural re-articulation or assemblage. This paper focuses on qualitative interviews with original members of the Mehta community conducted between 2021 and 2022.</p
Design and development of a mechatronic training simulator for adult ECMO
No full textWidespread adoption of Extracorporeal Membrane Oxygenation (ECMO) in adults has been limited by unfamiliarity with the procedure, including cannulation and safe handling of the ECMO equipment. We present the design and development of a mechatronic training simulator for ECMO that can help medical professionals acquire the needed skills, gain familiarity, and reduce errors by practicing before performing the procedure on real patients. The trainer is designed as an ultrasound-compatible, wholesome simulator with realistic components such as synthetic blood vessels, cannulation pads, and a color-changing blood simulant to simulate oxygenation and deoxygenation. The simulator is integrated with a mathematical model of human physiology to simulate real-time patient vitals and training scenarios, and to control the trainer hardware. We present results related to successful cannulation under ultrasound scanning and a simple patient scenario of hypovolemia.Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2021-05-01The student, Iti Mehta, accepted the attached license on 2019-04-24 at 10:58.The student, Iti Mehta, submitted this Thesis for approval on 2019-04-24 at 11:11.This Thesis was approved for publication on 2019-04-24 at 12:45.DSpace SAF Submission Ingestion Package generated from Vireo submission #13873 on 2019-08-22 at 15:08:02Made available in DSpace on 2019-08-23T20:36:09Z (GMT). No. of bitstreams: 2
MEHTA-THESIS-2019.pdf: 84393765 bytes, checksum: 74f0edf247057995595372eb8076e513 (MD5)
LICENSE.txt: 4206 bytes, checksum: 30fb64a86cfc352d6579ccb023b2a936 (MD5)
Previous issue date: 2019-04-24Embargo set by: Seth Robbins for item 112203
Lift date: 2021-08-23T20:36:18Z
Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD systemU of I Only Restriction Lifted for Item 112203 on 2021-08-24T09:15:24Z
Optimal Bioeconomic Management Strategies for Prevention and Control of Invasive Alien Species
No full textPaper removed by author. Please see the current version, available online January 8, 2007: Mehta, S.V. et al. Optimal detection and control strategies for invasive species management. Ecological Economics (2007), doi:10.1016/j.ecolecon.2006.10.024Environmental Economics and Policy,
Design and implementation of a phase locked loop for high-speed serial links
No full textThe student, Rushabh Mehta, accepted the attached license on 2016-04-25 at 13:40.The student, Rushabh Mehta, submitted this Thesis for approval on 2016-04-25 at 13:46.This Thesis was approved for publication on 2016-04-27 at 14:52.DSpace SAF Submission Ingestion Package generated from Vireo submission #9475 on 2016-07-07 at 13:50:45Made available in DSpace on 2016-07-07T20:27:59Z (GMT). No. of bitstreams: 2
MEHTA-THESIS-2016.pdf: 13984347 bytes, checksum: 4ecb06c5c270bc1beffb061eeae85eef (MD5)
LICENSE.txt: 4210 bytes, checksum: e6aea67d4e02d64f06671bb40ada2274 (MD5)
Previous issue date: 2016-04-27Recent advances in the semiconductor industry and process technology scaling have increased the demand for fast, robust computing. The thirst for high-processing, low power ICs is ever increasing. This has pushed the demand for high data rates in wireless and wireline communication systems in the multi-Gbps range. With higher data rates, the I/O links need to scale proportionally. However, the I/O channel bandwidth has not scaled appropriately making it the biggest bottleneck in high-speed links. Parallel links have not been able to match this increasing system performance due to issues such as crosstalk, timing skew and packaging costs. Thus there is a need for high-speed serial links. For high-speed transmission of data, there arises a need for high-speed on chip clocking circuits making the use of Phase-Locked Loops (PLLs) imperative.
This thesis includes an overview of high-speed links along with the need for PLLs. An in-depth understanding of PLL theory, loop dynamics and behavioral and transistor level simulation follows. Performance metrics such as phase noise, random jitter and deterministic jitter are discussed. Finally, this thesis concludes with an insight into All Digital Phase-Locked Loops (ADPLLs).Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2018-05-01Embargo set by: Seth Robbins for item 93174
Lift date: 2018-07-07T20:28:14Z
Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD systemEmbargo set by: Seth Robbins for item 93174
Lift date: 2018-07-07T20:35:34Z
Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD systemU of I Only Restriction Lifted for Item 93174 on 2018-07-08T09:15:20Z
Optimal stopping problems and combinatorial optimization under uncertainty
No full textSubmission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-09-16 without embargo termsThe student, Vasileios Livanos, accepted the attached license on 2024-04-22 at 13:36.The student, Vasileios Livanos, submitted this Dissertation for approval on 2024-04-22 at 13:44.This Dissertation was approved for publication on 2024-04-23 at 12:30.DSpace SAF Submission Ingestion Package generated from Vireo submission #20542 on 2024-09-16 at 00:35:46This thesis studies optimal stopping and combinatorial optimization problems in an uncertain environment. Optimal stopping captures many natural scenarios in which decisions have to be made without knowledge of the future and cannot be amended later on. In combinatorial optimization settings the objective is to optimize a function over distinct elements subject to certain feasibility constraints. Combinatorial optimization has been classically studied in the full-information setting where the entire input is known a priori. Combining combinatorial optimization with an uncertain environment leads to settings in which algorithms have only partial knowledge of the input, which is revealed element-by-element and all decisions of an algorithm have to be immediate and irrevocable. Such settings of optimization under uncertainty arise naturally in applications in which knowledge of the future cannot be obtained, either inherently or due to prohibiting costs or noise. In this thesis we focus on two settings. The first is a classical model in optimal stopping theory, the prophet inequality, in which an algorithm has to pick one of many random variables whose realizations are observed sequentially and compares against a prophet who knows all realizations in advance. The second setting is rounding a solution to a linear program in an online manner via the use of an Online Contention Resolution Scheme (OCRS) which is very useful in settings of combinatorial optimization under uncertainty. We initiate the study of prophet inequalities for independent and identically distributed (I.I.D.) random variables for cost minimization, showing distribution-dependent constant-factor guarantees for the competitive ratio that are qualitatively different from the maximization setting. In addition, we unify the maximization and minimization I.I.D. prophet inequalities via the theory of extreme values and show that the competitive ratio of both settings is governed by a single function that depends only on the extreme value index. We also obtain similar results for the objective of competition complexity, which captures how many more random variables an algorithm needs to observe in order to beat the prophet. We then ask how our guarantees change if we allow our algorithms the ability to ask simple questions to an oracle that has knowledge of the future. Motivating this, we establish an equivalence between this setting and the top-1-of-m setting in which the algorithm can select m values but is judged only for the best one among them. For the oracle-augmented model, we obtain guarantees on the competitive ratio and the probability of selecting the maximum realization that are almost tight asymptotically with respect to the number of oracle calls, for both the I.I.D. case and the case of non-identical random variables whose arrival order is controlled by an adversary. Afterwards, we turn to more general combinatorial optimization settings where multiple elements can be selected. We design optimal greedy OCRSs for special cases of matroids and provide matching upper bounds to show their optimality. We then use greedy OCRSs to obtain algorithms with significantly improved guarantees on the competitive ratio for prophet inequalities with a submodular objective function under several combinatorial feasibility constraints such as matroids, matchings and knapsacks
Cell-Free Heme Exhibits Dose Dependent Lethality in a Murine Model of Sepsis
No full textFrom the Washington University Office of Undergraduate Research Digest (WUURD), Vol. 13, 05-01-2018. Published by the Office of Undergraduate Research. Joy Zalis Kiefer, Director of Undergraduate Research and Associate Dean in the College of Arts & Sciences; Lindsey Paunovich, Editor; Helen Human, Programs Manager and Assistant Dean in the College of Arts and Sciences Mentor(s): Kenneth Rem
- …
