Doyle, Linda
Deep Activity Recognition Models with Triaxial Accelerometers
Alsheikh, Mohammad Abu (Nanyang Technological University) | Selim, Ahmed (Trinity College Dublin) | Niyato, Dusit (Nanyang Technological University) | Doyle, Linda (Trinity College Dublin) | Lin, Shaowei (Institute for Infocomm Research) | Tan, Hwee-Pink (Singapore Management University)
Despite the widespread installation of accelerometers in almost all mobile phones and wearable devices, activity recognition using accelerometers is still immature due to the poor recognition accuracy of existing recognition methods and the scarcity of labeled training data. We consider the problem of human activity recognition using triaxial accelerometers and deep learning paradigms. This paper shows that deep activity recognition models (a) provide better recognition accuracy of human activities, (b) avoid the expensive design of handcrafted features in existing systems, and (c) utilize the massive unlabeled acceleration samples for unsupervised feature extraction. We show substantial recognition improvement on real world datasets over state-of-the-art methods of human activity recognition using triaxial accelerometers.
A Combinatorial Optimisation Approach to Designing Dual-Parented Long-Reach Passive Optical Networks
Cambazard, Hadrien, Mehta, Deepak, O'Sullivan, Barry, Quesada, Luis, Ruffini, Marco, Payne, David, Doyle, Linda
We present an application focused on the design of resilient long-reach passive optical networks. We specifically consider dual-parented networks whereby each customer must be connected to two metro sites via local exchange sites. An important property of such a placement is resilience to single metro node failure. The objective of the application is to determine the optimal position of a set of metro nodes such that the total optical fibre length is minimized. We prove that this problem is NP-Complete. We present two alternative combinatorial optimisation approaches to finding an optimal metro node placement using: a mixed integer linear programming (MIP) formulation of the problem; and, a hybrid approach that uses clustering as a preprocessing step. We consider a detailed case-study based on a network for Ireland. The hybrid approach scales well and finds solutions that are close to optimal, with a runtime that is two orders-of-magnitude better than the MIP model.