A distributed algorithm f o r finding an ear decomposition of an asynchronous communication network with n nodes and m links is presented in this paper. At the completion of the algorithm either the ears are correctly labeled o r the nodes are informed that there exists no ear decomposition. First we present a novel algorithm to check the existence of an ear decomposition which uses O(m) messag...

we report a case of a 68-year-old female who was a known case of diabetes mellitus and chronic liver disease and presented with complaints of dry cough and other constitutional symptoms since one month. during initial investigations, the patient was found to have peripheral blood eosinophilia. upon investigating further,the patient was found to have mediastinal lymphadenopathy and fine-needle a...

CoAP is a RESTful application protocol for constrained nodes and networks. Through the Observe option, clients can observe changes in the state of resources and obtain a current representation of the last resource state. This document defines a new mechanism in CoAP Observe so that a CoAP client can conditionally observe a resource on a CoAP server, only being informed about state changes meeti...

We consider the communication from a cooperative sensor network to a mobile access point. We assume that sensors are informed with a global message and some nodes are misinformed with random messages. Nodes transmit to the mobile access point in a pre-scheduled order. We derive an achievable rate for the information retrieval process when d sensors are transmitting at a time. For the Gaussian m...

Functional subnetwork extraction is commonly used to explore the brain’s modular structure. However, reliable subnetwork extraction from functional magnetic resonance imaging (fMRI) data remains challenging due to the pronounced noise in neuroimaging data. In this paper, we proposed a high order relation informed approach based on hypergraph to combine the information from multi-task data and r...

In this paper we tackle the problem of service discovery in mobile wireless networks by exploiting an informed random walk based search, which is implemented directly atop the data link layer. The algorithm can be used both to discover a service and route data packets back to the requesting node, without any routing layer support. The information driving a search consists of the estimated dista...

The use of Network Lifetime Maximization while disseminating queries to appropriate regions since data queries often include geographic attributes and apply Ant Colony Optimization clustering is proposed here. The protocol, uses energy aware and geographically-informed neighbor selection heuristics to route a packet towards the destination region to improve the link stability during data transf...