Zobrazeno 1 - 10
of 645
pro vyhledávání: '"Lalitha V"'
Publikováno v:
Critical Care Research and Practice, Vol 2023 (2023)
Background. Rapid shallow breathing index (RSBI) has been widely used as a predictor of extubation outcome in mechanically ventilated patients. We hypothesize that the rate of change of RSBI between the beginning and end of a 120-minute spontaneous b
Externí odkaz:
https://doaj.org/article/72ef85f18871403cac7329b70f1b4552
Autor:
Rameshwar, V. Arvind, Lalitha, V.
In this paper, we revisit the Recursive Projection-Aggregation (RPA) decoder, of Ye and Abbe (2020), for Reed-Muller (RM) codes. Our main contribution is an explicit upper bound on the probability of incorrect decoding, using the RPA decoder, over a
Externí odkaz:
http://arxiv.org/abs/2412.08129
We consider a distributed multi-user secret sharing (DMUSS) setting in which there is a dealer, $n$ storage nodes, and $m$ secrets. Each user demands a $t$-subset of $m$ secrets. Earlier work in this setting dealt with the case of $t=1$; in this work
Externí odkaz:
http://arxiv.org/abs/2312.15763
Publikováno v:
Annals of Thoracic Medicine, Vol 11, Iss 3, Pp 167-176 (2016)
Predicting successful liberation of patients from mechanical ventilation has been a focus of interest to clinicians practicing in intensive care. Various weaning indices have been investigated to identify an optimal weaning window. Among them, the ra
Externí odkaz:
https://doaj.org/article/db03987d45f54d1783fd35994bb86489
Autor:
Peter B Madrid, Sidharth Chopra, Ian D Manger, Lynne Gilfillan, Tiffany R Keepers, Amy C Shurtleff, Carol E Green, Lalitha V Iyer, Holli Hutcheson Dilks, Robert A Davey, Andrey A Kolokoltsov, Ricardo Carrion, Jean L Patterson, Sina Bavari, Rekha G Panchal, Travis K Warren, Jay B Wells, Walter H Moos, Raelyn L Burke, Mary J Tanga
Publikováno v:
PLoS ONE, Vol 8, Iss 4, p e60579 (2013)
BACKGROUND: The rapid development of effective medical countermeasures against potential biological threat agents is vital. Repurposing existing drugs that may have unanticipated activities as potential countermeasures is one way to meet this importa
Externí odkaz:
https://doaj.org/article/8f664db31ceb45f1adcae9b7d13042df
Maximally recoverable codes are a class of codes which recover from all potentially recoverable erasure patterns given the locality constraints of the code. In earlier works, these codes have been studied in the context of codes with locality. The no
Externí odkaz:
http://arxiv.org/abs/2105.03328
Autor:
Gupta, Shreya, Lalitha, V.
In distributed storage systems, cooperative regenerating codes tradeoff storage for repair bandwidth in the case of multiple node failures. In rack-aware distributed storage systems, there is no cost associated with transferring symbols within a rack
Externí odkaz:
http://arxiv.org/abs/2102.12421
We consider a generalization of the gradient coding framework where a dataset is divided across $n$ workers and each worker transmits to a master node one or more linear combinations of the gradients over its assigned data subsets. Unlike the convent
Externí odkaz:
http://arxiv.org/abs/2102.10163
Blockchain is a distributed ledger with wide applications. Due to the increasing storage requirement for blockchains, the computation can be afforded by only a few miners. Sharding has been proposed to scale blockchains so that storage and transactio
Externí odkaz:
http://arxiv.org/abs/2011.06201
The problem of data exchange between multiple nodes with storage and communication capabilities models several current multi-user communication problems like Coded Caching, Data Shuffling, Coded Computing, etc. The goal in such problems is to design
Externí odkaz:
http://arxiv.org/abs/2010.10459