Energy-Efficient Communication over the Unsynchronized Gaussian Diamond Network

Communication networks are often designed and analyzed assuming tight synchronization among nodes. However, in applications that require communication in the energy-efficient regime of low signal-to-noise ratios, establishing tight synchronization among nodes in the network can result in a significant energy overhead. Motivated by a recent result showing that near-optimal energy efficiency can be achieved over the AWGN channel without requiring tight synchronization, we consider the question of whether the potential gains of cooperative communication can be achieved in the absence of synchronization. We focus on the symmetric Gaussian diamond network and establish that cooperative-communication gains are indeed feasible even with unsynchronized nodes. More precisely, we show that the capacity per unit energy of the unsynchronized symmetric Gaussian diamond network is within a constant factor of the capacity per unit energy of the corresponding synchronized network. To this end, we propose a distributed relaying scheme that does not require tight synchronization but nevertheless achieves most of the energy gains of coherent combining.Comment: 20 pages, 4 figures, submitted to IEEE Transactions on Information Theory, presented at IEEE ISIT 201

Towards a Queueing-Based Framework for In-Network Function Computation

We seek to develop network algorithms for function computation in sensor networks. Specifically, we want dynamic joint aggregation, routing, and scheduling algorithms that have analytically provable performance benefits due to in-network computation as compared to simple data forwarding. To this end, we define a class of functions, the Fully-Multiplexible functions, which includes several functions such as parity, MAX, and k th -order statistics. For such functions we exactly characterize the maximum achievable refresh rate of the network in terms of an underlying graph primitive, the min-mincut. In acyclic wireline networks, we show that the maximum refresh rate is achievable by a simple algorithm that is dynamic, distributed, and only dependent on local information. In the case of wireless networks, we provide a MaxWeight-like algorithm with dynamic flow splitting, which is shown to be throughput-optimal

When is a Function Securely Computable?

A subset of a set of terminals that observe correlated signals seek to compute a given function of the signals using public communication. It is required that the value of the function be kept secret from an eavesdropper with access to the communication. We show that the function is securely computable if and only if its entropy is less than the "aided secret key" capacity of an associated secrecy generation model, for which a single-letter characterization is provided

The Balanced Unicast and Multicast Capacity Regions of Large Wireless Networks

We consider the question of determining the scaling of the $n^2$-dimensional balanced unicast and the $n 2^n$-dimensional balanced multicast capacity regions of a wireless network with $n$ nodes placed uniformly at random in a square region of area $n$ and communicating over Gaussian fading channels. We identify this scaling of both the balanced unicast and multicast capacity regions in terms of $\Theta(n)$, out of $2^n$ total possible, cuts. These cuts only depend on the geometry of the locations of the source nodes and their destination nodes and the traffic demands between them, and thus can be readily evaluated. Our results are constructive and provide optimal (in the scaling sense) communication schemes.Comment: 37 pages, 7 figures, to appear in IEEE Transactions on Information Theor

Assessment in Medical Education: Time to Move Ahead

Assessment is an integral part of the curriculum. However, the assessment tools, devised more than a century ago, have not kept up with changing scenario of health care and demand of the consumers. In the present scenario, what is tested is a one-time assessment at the exit examination as a surrogate marker for real and observable competence. Most Indian medical schools employ the traditional assessment tools that hardly permit testing of most competencies desirable of a physician; i.e., skills in communication, management, collaboration, professionalism, medical knowledge, health promotion, and counseling. Also, the competencies are not assessed in real time situations. A few medical schools have tried to bridge the gap by introducing the second generation tools, yet the overall approach and methodology is fraught with major drawback of fragmentation and non-contextualization. The physician is supposed to satisfy the patient in a holistic manner or in other words, win the trust. It is this trust primarily what needs to be assessed. The present article stresses on the need of a global assessment conducted on an ongoing/periodic basis, with adequate weightage given to the opinion/assessment of the consumer. Utility of some newer tools including mini clinical evaluation exercise (mini-CEX), direct observation of procedural skills (DOPS), multisource (360º), and portfolio based assessment is discussed. Finally, we introduce the reader to the concept of assessment of entrustable professional activities (EPAs). The concept of EPA helps integrate the theoretical concepts of individual competencies into a measurable parameter of Trust

A Deep Generative Framework for Paraphrase Generation

Paraphrase generation is an important problem in NLP, especially in question answering, information retrieval, information extraction, conversation systems, to name a few. In this paper, we address the problem of generating paraphrases automatically. Our proposed method is based on a combination of deep generative models (VAE) with sequence-to-sequence models (LSTM) to generate paraphrases, given an input sentence. Traditional VAEs when combined with recurrent neural networks can generate free text but they are not suitable for paraphrase generation for a given sentence. We address this problem by conditioning the both, encoder and decoder sides of VAE, on the original sentence, so that it can generate the given sentence's paraphrases. Unlike most existing models, our model is simple, modular and can generate multiple paraphrases, for a given sentence. Quantitative evaluation of the proposed method on a benchmark paraphrase dataset demonstrates its efficacy, and its performance improvement over the state-of-the-art methods by a significant margin, whereas qualitative human evaluation indicate that the generated paraphrases are well-formed, grammatically correct, and are relevant to the input sentence. Furthermore, we evaluate our method on a newly released question paraphrase dataset, and establish a new baseline for future research

Optimal Fidelity Selection for Improved Performance in Human-in-the-Loop Queues for Underwater Search

In the context of human-supervised autonomy, we study the problem of optimal fidelity selection for a human operator performing an underwater visual search task. Human performance depends on various cognitive factors such as workload and fatigue. We perform human experiments in which participants perform two tasks simultaneously: a primary task, which is subject to evaluation, and a secondary task to estimate their workload. The primary task requires participants to search for underwater mines in videos, while the secondary task involves a simple visual test where they respond when a green light displayed on the side of their screens turns red. Videos arrive as a Poisson process and are stacked in a queue to be serviced by the human operator. The operator can choose to watch the video with either normal or high fidelity, with normal fidelity videos playing at three times the speed of high fidelity ones. Participants receive rewards for their accuracy in mine detection for each primary task and penalties based on the number of videos waiting in the queue. We consider the workload of the operator as a hidden state and model the workload dynamics as an Input-Output Hidden Markov Model (IOHMM). We use a Partially Observable Markov Decision Process (POMDP) to learn an optimal fidelity selection policy, where the objective is to maximize total rewards. Our results demonstrate improved performance when videos are serviced based on the optimal fidelity policy compared to a baseline where humans choose the fidelity level themselves