The Experts below are selected from a list of 89361 Experts worldwide ranked by ideXlab platform
Naoko Ideguchi - One of the best experts on this subject based on the ideXlab platform.
-
Patients-pharmacists Interactive Communication system for remote medication support
The 6th 2013 Biomedical Engineering International Conference, 2013Co-Authors: Kohei Tsuruoka, Takeshi Toda, Shinya Ozaki, Naoko IdeguchiAbstract:TeleCommunication systems for the pharmacists to support the outpatient medical treatment have been gaining attention. However in the conventional systems, low usability and interactivity of the system became key problems to support medication. In this research, we developed a patients-pharmacists Interactive Communication system and investigated it's benefit through a 2-month field trial. We carried out the trial for thirty-five outpatients plus their family, and four pharmacists in a dispensing pharmacy in Yokohama. The result showed high effectiveness of the proposed user-interface to the medication compliance and adherence.
-
ISMICT - Field trial of patients-pharmacists Interactive Communication system for remote medication support
2013 7th International Symposium on Medical Information and Communication Technology (ISMICT), 2013Co-Authors: Kohei Tsuruoka, Takeshi Toda, Shinya Ozaki, Naoko IdeguchiAbstract:TeleCommunication systems for the pharmacists to support the outpatient medical treatment have been gaining attention. However in the conventional systems, low usability and interactivity of the system became key problems to support medication. In this research, we developed a patients-pharmacists Interactive Communication system and investigated it's benefit through a 2-month field trial. We carried out the trial for thirty-five outpatients plus their family, and four pharmacists in a dispensing pharmacy in Yokohama. The result showed high effectiveness of the proposed user-interface to the medication compliance and adherence.
Pavan Santhana Krishna Nuggehalli - One of the best experts on this subject based on the ideXlab platform.
-
Worst-Case Interactive Communication and Enhancing Sensor Network Lifetime
arXiv: Information Theory, 2007Co-Authors: Samar Agnihotri, Pavan Santhana Krishna NuggehalliAbstract:We are concerned with the problem of maximizing the worst-case lifetime of a data-gathering wireless sensor network consisting of a set of sensor nodes directly communicating with a base-station.We propose to solve this problem by modeling sensor node and base-station Communication as the Interactive Communication between multiple correlated informants (sensor nodes) and a recipient (base-station). We provide practical and scalable Interactive Communication protocols for data gathering in sensor networks and demonstrate their efficiency compared to traditional approaches. In this paper, we first develop a formalism to address the problem of worst-case Interactive Communication between a set of multiple correlated informants and a recipient. We realize that there can be different objectives to achieve in such a Communication scenario and compute the optimal number of messages and bits exchanged to realize these objectives. Then, we propose to adapt these results in the context of single-hop data-gathering sensor networks. Finally, based on this proposed formalism, we propose a clustering based Communication protocol for large sensor networks and demonstrate its superiority over a traditional clustering protocol.
-
Enhancing Sensor Network Lifetime Using Interactive Communication
arXiv: Information Theory, 2007Co-Authors: Samar Agnihotri, Pavan Santhana Krishna NuggehalliAbstract:We are concerned with maximizing the lifetime of a data-gathering wireless sensor network consisting of set of nodes directly communicating with a base-station. We model this scenario as the m-message Interactive Communication between multiple correlated informants (sensor nodes) and a recipient (base-station). With this framework, we show that m-message Interactive Communication can indeed enhance network lifetime. Both worst-case and average-case performances are considered.
-
Energy Conscious Interactive Communication for Sensor Networks
arXiv: Information Theory, 2007Co-Authors: Samar Agnihotri, Pavan Santhana Krishna NuggehalliAbstract:In this work, we are concerned with maximizing the lifetime of a cluster of sensors engaged in single-hop Communication with a base-station. In a data-gathering network, the spatio-temporal correlation in sensor data induces data-redundancy. Also, the interaction between two communicating parties is well-known to reduce the Communication complexity. This paper proposes a formalism that exploits these two opportunities to reduce the number of bits transmitted by a sensor node in a cluster, hence enhancing its lifetime. We argue that our approach has several inherent advantages in scenarios where the sensor nodes are acutely energy and computing-power constrained, but the base-station is not so. This provides us an opportunity to develop Communication protocols, where most of the computing and Communication is done by the base-station. The proposed framework casts the sensor nodes and base-station Communication problem as the problem of multiple informants with correlated information communicating with a recipient and attempts to extend extant work on Interactive Communication between an informant-recipient pair to such scenarios. Our work makes four major contributions. Firstly, we explicitly show that in such scenarios interaction can help in reducing the Communication complexity. Secondly, we show that the order in which the informants communicate with the recipient may determine the Communication complexity. Thirdly, we provide the framework to compute the $m$-message Communication complexity in such scenarios. Lastly, we prove that in a typical sensor network scenario, the proposed formalism significantly reduces the Communication and computational complexities.
-
ISIT - Enhancing Sensor Network Lifetime Using Interactive Communication
2007 IEEE International Symposium on Information Theory, 2007Co-Authors: Samar Agnihotri, Pavan Santhana Krishna Nuggehalli, Ramesh R. RaoAbstract:We are concerned with maximizing the lifetime of a data-gathering wireless sensor network consisting of set of nodes directly communicating with a base-station. We model this scenario as the m-message Interactive Communication between multiple correlated informants (sensor nodes) and a recipient (base-station). With this framework, we show that m-message Interactive Communication can indeed enhance network lifetime. Both worst-case and average-case performances are considered.
Kohei Tsuruoka - One of the best experts on this subject based on the ideXlab platform.
-
Patients-pharmacists Interactive Communication system for remote medication support
The 6th 2013 Biomedical Engineering International Conference, 2013Co-Authors: Kohei Tsuruoka, Takeshi Toda, Shinya Ozaki, Naoko IdeguchiAbstract:TeleCommunication systems for the pharmacists to support the outpatient medical treatment have been gaining attention. However in the conventional systems, low usability and interactivity of the system became key problems to support medication. In this research, we developed a patients-pharmacists Interactive Communication system and investigated it's benefit through a 2-month field trial. We carried out the trial for thirty-five outpatients plus their family, and four pharmacists in a dispensing pharmacy in Yokohama. The result showed high effectiveness of the proposed user-interface to the medication compliance and adherence.
-
ISMICT - Field trial of patients-pharmacists Interactive Communication system for remote medication support
2013 7th International Symposium on Medical Information and Communication Technology (ISMICT), 2013Co-Authors: Kohei Tsuruoka, Takeshi Toda, Shinya Ozaki, Naoko IdeguchiAbstract:TeleCommunication systems for the pharmacists to support the outpatient medical treatment have been gaining attention. However in the conventional systems, low usability and interactivity of the system became key problems to support medication. In this research, we developed a patients-pharmacists Interactive Communication system and investigated it's benefit through a 2-month field trial. We carried out the trial for thirty-five outpatients plus their family, and four pharmacists in a dispensing pharmacy in Yokohama. The result showed high effectiveness of the proposed user-interface to the medication compliance and adherence.
Klim Efremenko - One of the best experts on this subject based on the ideXlab platform.
-
Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
Journal of the ACM, 2018Co-Authors: Mark Braverman, Ran Gelles, Klim Efremenko, Bernhard HaeuplerAbstract:We study coding schemes for multiparty Interactive Communication over synchronous networks that suffer from stochastic noise, where each bit is independently flipped with probability v. We analyze the minimal overhead that must be added by the coding scheme to succeed in performing the computation despite the noise. Our main result is a lower bound on the Communication of any noise-resilient protocol over a synchronous star network with n parties (where all parties communicate in every round). Specifically, we show a task that can be solved by communicating T bits over the noise-free network, but for which any protocol with success probability of 1−o(1) must communicate at least Ω (T flog n log log n) bits when the channels are noisy. By a 1994 result of Rajagopalan and Schulman, the slowdown we prove is the highest one can obtain on any topology, up to a log log n factor. We complete our lower bound with a matching coding scheme that achieves the same overhead; thus, the capacity of (synchronous) star networks is Θ (log log n/log n). Our bounds prove that, despite several previous coding schemes with rate &Omega (1) for certain topologies, no coding scheme with constant rate &Omega (1) exists for arbitrary n-party noisy networks.
-
List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
SIAM Journal on Computing, 2017Co-Authors: Mark Braverman, Klim EfremenkoAbstract:In this paper, we extend the notion of list decoding to the setting of Interactive Communication and study its limits. In particular, we show that any protocol can be encoded, with a constant rate, into a list-decodable protocol which is resilient to a noise rate of up to $\frac{1}{2}-\varepsilon$, and that this is tight. Using our list-decodable construction, we study a more nuanced model of noise where the adversary can corrupt up to a fraction $\alpha$ of Alice's Communication and up to a fraction $\beta$ of Bob's Communication. We use list decoding to characterize fully the region $\mathcal{R}_U$ of pairs $(\alpha,\beta)$ for which unique decoding with a constant rate is possible. The region $\mathcal{R}_U$ turns out to be quite unusual in its shape. In particular, it is bounded by a piecewise-differentiable curve with infinitely many pieces. We show that outside this region the rate must be exponential. This suggests that in some error regimes, list decoding is necessary for optimal unique decoding. ...
-
Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback
IEEE Transactions on Information Theory, 2016Co-Authors: Klim Efremenko, Ran Gelles, Bernhard HaeuplerAbstract:We provide tight upper and lower bounds on the noise resilience of Interactive Communication over noisy channels with feedback. In this setting, we show that the maximal fraction of noise that any nonadaptive protocol can withstand is 1/3. In addition, we provide a simple and efficient nonadaptive coding scheme that succeeds as long as the fraction of noise is at most $1/3-\varepsilon $ . Surprisingly, both bounds hold regardless of whether the parties send bits or symbols from an arbitrarily large alphabet. We also consider Interactive Communication over erasure channels. We provide a coding scheme that withstands the optimal tolerable erasure rate of $1/2-\varepsilon $ [Franklin et al. , IEEE Trans. Info. Theory , 2015], but operates in a much simpler and more efficient way than the previous schemes. Our coding scheme works with an alphabet of size 4, in contrast to prior schemes in which the alphabet size grows as $\varepsilon \to 0$ . Building on the above algorithm with a fixed alphabet size, we are able to devise a protocol for binary erasure channels that tolerates erasure rates of up to $1/3-\varepsilon $ .
-
maximal noise in Interactive Communication over erasure channels and channels with feedback
Conference on Innovations in Theoretical Computer Science, 2015Co-Authors: Klim Efremenko, Ran Gelles, Bernhard HaeuplerAbstract:We provide tight upper and lower bounds on the noise resilience of Interactive Communication over noisy channels with feedback. In this setting, we show that the maximal fraction of noise that any robust protocol can resist is 1/3. Additionally, we provide a simple and efficient robust protocol that succeeds as long as the fraction of noise is at most 1/3--e. Surprisingly, both bounds hold regardless of whether the parties send bits or symbols from an arbitrarily large alphabet. We also consider Interactive Communication over erasure channels. We provide a protocol that matches the optimal tolerable erasure rate of 1/2--e of previous protocols (Franklin et al., CRYPTO '13) but operates in a much simpler and more efficient way. Our protocol works with an alphabet of size 4, in contrast to prior protocols in which the alphabet size grows as e ╰ 0. Building on the above algorithm with a fixed alphabet size, we are able to devise a protocol for binary erasure channels that tolerates erasure rates of up to 1/3--e.
-
Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback
arXiv: Data Structures and Algorithms, 2015Co-Authors: Klim Efremenko, Ran Gelles, Bernhard HaeuplerAbstract:We provide tight upper and lower bounds on the noise resilience of Interactive Communication over noisy channels with feedback. In this setting, we show that the maximal fraction of noise that any robust protocol can resist is 1/3. Additionally, we provide a simple and efficient robust protocol that succeeds as long as the fraction of noise is at most 1/3 - \epsilon. Surprisingly, both bounds hold regardless of whether the parties send bits or symbols from an arbitrarily large alphabet. We also consider Interactive Communication over erasure channels. We provide a protocol that matches the optimal tolerable erasure rate of 1/2 - \epsilon of previous protocols (Franklin et al., CRYPTO '13) but operates in a much simpler and more efficient way. Our protocol works with an alphabet of size 4, in contrast to prior protocols in which the alphabet size grows as epsilon goes to zero. Building on the above algorithm with a fixed alphabet size, we are able to devise a protocol for binary erasure channels that tolerates erasure rates of up to 1/3 - \epsilon.
Samar Agnihotri - One of the best experts on this subject based on the ideXlab platform.
-
Worst-Case Interactive Communication and Enhancing Sensor Network Lifetime
arXiv: Information Theory, 2007Co-Authors: Samar Agnihotri, Pavan Santhana Krishna NuggehalliAbstract:We are concerned with the problem of maximizing the worst-case lifetime of a data-gathering wireless sensor network consisting of a set of sensor nodes directly communicating with a base-station.We propose to solve this problem by modeling sensor node and base-station Communication as the Interactive Communication between multiple correlated informants (sensor nodes) and a recipient (base-station). We provide practical and scalable Interactive Communication protocols for data gathering in sensor networks and demonstrate their efficiency compared to traditional approaches. In this paper, we first develop a formalism to address the problem of worst-case Interactive Communication between a set of multiple correlated informants and a recipient. We realize that there can be different objectives to achieve in such a Communication scenario and compute the optimal number of messages and bits exchanged to realize these objectives. Then, we propose to adapt these results in the context of single-hop data-gathering sensor networks. Finally, based on this proposed formalism, we propose a clustering based Communication protocol for large sensor networks and demonstrate its superiority over a traditional clustering protocol.
-
Enhancing Sensor Network Lifetime Using Interactive Communication
arXiv: Information Theory, 2007Co-Authors: Samar Agnihotri, Pavan Santhana Krishna NuggehalliAbstract:We are concerned with maximizing the lifetime of a data-gathering wireless sensor network consisting of set of nodes directly communicating with a base-station. We model this scenario as the m-message Interactive Communication between multiple correlated informants (sensor nodes) and a recipient (base-station). With this framework, we show that m-message Interactive Communication can indeed enhance network lifetime. Both worst-case and average-case performances are considered.
-
Energy Conscious Interactive Communication for Sensor Networks
arXiv: Information Theory, 2007Co-Authors: Samar Agnihotri, Pavan Santhana Krishna NuggehalliAbstract:In this work, we are concerned with maximizing the lifetime of a cluster of sensors engaged in single-hop Communication with a base-station. In a data-gathering network, the spatio-temporal correlation in sensor data induces data-redundancy. Also, the interaction between two communicating parties is well-known to reduce the Communication complexity. This paper proposes a formalism that exploits these two opportunities to reduce the number of bits transmitted by a sensor node in a cluster, hence enhancing its lifetime. We argue that our approach has several inherent advantages in scenarios where the sensor nodes are acutely energy and computing-power constrained, but the base-station is not so. This provides us an opportunity to develop Communication protocols, where most of the computing and Communication is done by the base-station. The proposed framework casts the sensor nodes and base-station Communication problem as the problem of multiple informants with correlated information communicating with a recipient and attempts to extend extant work on Interactive Communication between an informant-recipient pair to such scenarios. Our work makes four major contributions. Firstly, we explicitly show that in such scenarios interaction can help in reducing the Communication complexity. Secondly, we show that the order in which the informants communicate with the recipient may determine the Communication complexity. Thirdly, we provide the framework to compute the $m$-message Communication complexity in such scenarios. Lastly, we prove that in a typical sensor network scenario, the proposed formalism significantly reduces the Communication and computational complexities.
-
ISIT - Enhancing Sensor Network Lifetime Using Interactive Communication
2007 IEEE International Symposium on Information Theory, 2007Co-Authors: Samar Agnihotri, Pavan Santhana Krishna Nuggehalli, Ramesh R. RaoAbstract:We are concerned with maximizing the lifetime of a data-gathering wireless sensor network consisting of set of nodes directly communicating with a base-station. We model this scenario as the m-message Interactive Communication between multiple correlated informants (sensor nodes) and a recipient (base-station). With this framework, we show that m-message Interactive Communication can indeed enhance network lifetime. Both worst-case and average-case performances are considered.