No abstract

No abstract

Health monitoring of civil infrastructures is a key application of Internet of things (IoT), while edge computing is an important component of IoT. In this context, swarms of autonomous inspection robots, which can replace current manual inspections, are examples of edge devices. Incorporation of pretrained deep learning algorithms into these robots for autonomous damage detection is a challenging problem since these devices are typically limited in computing and memory resources. This study introduces a solution based on network pruning using Taylor expansion to utilize pretrained deep convolutional neural networks for efficient edge computing and incorporation into inspection robots. Results from comprehensive experiments on two pretrained networks (i.e., VGG16 and ResNet18) and two types of prevalent surface defects (i.e., crack and corrosion) are presented and discussed in detail with respect to performance, memory demands, and the inference time for damage detection. It is shown that the proposed approach significantly enhances resource efficiency without decreasing damage detection performance.

Internet of things (IoT) applications have become increasingly popular in recent years, with applications ranging from building energy monitoring to personal health tracking and activity recognition. In order to leverage these data, automatic knowledge extraction -whereby we map from observations to interpretable states and transitions -must be done at scale. As such, we have seen many recent IoT data sets include annotations with a human expert specifying states, recorded as a set of boundaries and associated labels in a data sequence.ese data can be used to build automatic labeling algorithms that produce labels as an expert would. Here, we refer to human-specified boundaries as breakpoints. Traditional changepoint detection methods only look for statistically-detectable boundaries that are defined as abrupt variations in the generative parameters of a data sequence. However, we observe that breakpoints occur on more subtle boundaries that are non-trivial to detect with these statistical methods. In this work, we propose a new unsupervised approach, based on deep learning, that outperforms existing techniques and learns the more subtle, breakpoint boundaries with a high accuracy. rough extensive experiments on various real-world data sets -including human-activity sensing data, speech signals, and electroencephalogram (EEG) activity traces -we demonstrate the effectiveness of our algorithm for practical applications. Furthermore, we show that our approach achieves significantly be er performance than previous methods.

We study blind estimation of transmission power of a node based on received power measurements obtained under wireless fading. Specifically, the setup consists of a set of monitors that measure the signal power received from the transmitter, and the goal is to utilize these measurements to estimate the transmission power in the absence of any prior knowledge of the transmitter's location or any statistical distribution of its power. Towards this end, we exploit spatial diversity in received-power measurements and cooperation among the multiple monitoring nodes; based on theoretical analysis we obtain the Maximum Likelihood (ML) estimate, derive fundamental geometrical insights and show that this estimate is asymptotically optimal. Finally, we provide numerical results comparing the performance of the estimators through simulations and on a data-set of field measurements.

No abstract

Quality of service for high-bandwidth or delay-sensitive applications in the Internet, such as streaming media and online games, can be significantly improved by replicating server content. We present a decentralized algorithm that allocates server resources to replicated servers in large-scale clientserver networks to reduce network distance between each client and the nearby replicated server hosting the resources of interest to that client. Preliminary simulation results show that our algorithm converges quickly to an allocation that reduces the expected client-server distance by almost half compared to the distance when the assignment of replicated servers is done at random.

No abstract