Search

People with Dementia (PwD) suffer from a high risk of getting lost due to their cognitive deterioration, leading to potential safety hazards and significant search efforts. In this paper, we propose DEmentia Caring System (DECS), an effective crowdsourcing platform to search for missing PwD. Specifically, PwD carry our customized Bluetooth Low Energy (BLE) tags that broadcast BLE packets, which are detected and then uploaded by mobile volunteers via their smartphones. To further enhance search efficiency, DECS deploys BLE gateways as its infrastructure and analyzes PwD's daily spatial-temporal mobility patterns. DECS has been deployed in Hong Kong since 2019, supporting 3,100+ PwD's families with over 45,000 app downloads by volunteers. More importantly, it has successfully served the search for 254 missing cases. This paper reports the unique lessons and experiences learned through our 4-year citywide deployment of DECS.

Time series data, including univariate and multivariate ones, are characterized by unique composition and complex multi-scale temporal variations. They often require special consideration of decomposition and multi-scale modeling to analyze. Existing deep learning methods on this best ft to univariate time series only, and have not sufciently considered sub-series modeling and decomposition completeness. To address these challenges, we propose MSD-Mixer, a Multi-Scale Decomposition MLP-Mixer, which learns to explicitly decompose and represent the input time series in its diferent layers. To handle the multi-scale temporal patterns and multivariate dependencies, we propose a novel temporal patching approach to model the time series as multi-scale patches, and employ MLPs to capture intra- and inter-patch variations and channel-wise correlations. In addition, we propose a novel loss function to constrain both the mean and the autocorrelation of the decomposition residual for better decomposition completeness. Through extensive experiments on various real-world datasets for fve common time series analysis tasks, we demonstrate that MSD-Mixer consistently and signifcantly outperforms other state-of-the-art algorithms with better efciency. © 2024, VLDB Endowment. All rights reserved.

We stuWe study the forecasting problem for traffic with dynamic, possibly periodical, and joint spatial-temporal dependency between regions. Given the aggregated inflow and outflow traffic of regions in a city from time slots 0 to t−1 , we predict the traffic at time t for any region. Prior arts in the area often considered the spatial and temporal dependencies in a decoupled manner, or were rather computationally intensive in training with a large number of hyper-parameters which needed tuning. We propose ST-TIS, a novel, lightweight and accurate Spatial-Temporal Transformer with information fusion and region sampling for traffic forecasting. ST-TIS extends the canonical Transformer with information fusion and region sampling. The information fusion module captures the complex spatial-temporal dependency between regions. The region sampling module is to improve the efficiency and prediction accuracy, cutting the computation complexity for dependency learning from O(n2) to O(nn−−√) , where n is the number of regions. With far fewer parameters than state-of-the-art deep learning models, ST-TIS's offline training is significantly faster in terms of tuning and computation (with a reduction of up to 90% on training time and network parameters). Notwithstanding such training efficiency, extensive experiments show that ST-TIS is substantially more accurate in online prediction than state-of-the-art approaches (with an average improvement of 9.5% on RMSE, and 12.4% on MAPE compared to STDN and DSAN).

Image-to-markup generation aims at translating an image into markup (structured language) that represents both the contents and the structural semantics corresponding to the image. Recent encoder-decoder based approaches typically employ string decoders to model the string representation of the target markup, which cannot effectively capture the rich embedded structural information. In this paper, we propose TSDNet, a novel Tree-based Structure-aware Transformer Decoder NETwork to directly generate the tree representation of the target markup in a structure-aware manner. Specifically, our model learns to sequentially predict the node attributes, edge attributes, and node connectivities by multi-task learning. Meanwhile, we introduce a novel tree-structured attention to our decoder such that it can directly operate on the partial tree generated in each step to fully exploit the structural information. TSDNet doesn't rely on any prior assumptions on the target tree structure, and can be jointly optimized with encoders in an end-to-end fashion. We evaluate the performance of our model on public image-to-markup generation datasets, and demonstrate its ability to learn the complicated correlation from the structural information in the target markup with significant improvement over state-of-the-art methods by up to 5.6% in mathematical expression recognition and up to 35.34% in chemical formula recognition.

Docked bike systems have been widely deployed in many cities around the world. To the service provider, predicting the demand and supply of bikes at any station is crucial to offering the best service quality. The docked bike prediction problem is highly challenging because of the complicated joint spatial-temporal (ST) dependency as bikes are picked up and dropped off, the so-called “flows”, between stations. Prior works often considered the spatial and temporal dependencies separately using sequential network models, and based on locality assumptions. Without sufficiently capturing the joint spatial and temporal features, these approaches are not optimal for attaining the best prediction accuracy. We propose STGNN-DJD, a novel data-driven SpatialTemporal Graph Neural Network to solve the bike demand and supply prediction problem by unifiedly embedding the Dynamic and Joint ST Dependency in two novel ST graphs. Given station locations and historical rental data on bike flow over the past time slots 0 to t − 1, we seek to predict online the bike demand and supply at any station at time t. To extract joint spatial-temporal dependency, STGNN-DJD employs a graph generator to construct, at the beginning of time t, two graphs that embed the flow relationships between stations at various time slots (flow-convoluted graph) and dynamic demand-supply pattern correlation between stations (pattern correlation graph), respectively. Given the two spatial-temporal graphs, STGNN-DJD subsequently employs a graph neural network with novel flowbased and attention-based aggregators to generate embedding of each station for docked bike prediction. We have conducted extensive experiments on two large bike-sharing datasets. Our results confirm the effectiveness of STGNN-DJD as compared with other state-of-the-art approaches, with significant improvement on RMSE and MAE (by 20%−50%). We also provide a case study on dynamic dependencies between stations and demonstrate that the locality as

Covid-19 is primarily spread through contact with the virus which may survive on surfaces with a lifespan of hours or even days if not sanitized. To curb its spread, it is hence of vital importance to detect those who have been in contact with the virus for a sustained period of time, the so-called close contacts. Most of the existing digital approaches for contact tracing focus only on direct face-to-face contacts. There has been little work on detecting indirect environmental contact, which is to detect people coming into a contaminated area with the live virus, i.e., an area last visited by an infected person within the virus lifespan. In this work, we study automatic IoT contact tracing when the virus has a lifespan which may depend on the disinfection frequency at a location. Leveraging the ubiquity of WiFi signals, we propose vContact, a novel, private, pervasive and fully distributed WiFi-based IoT contact tracing approach. Users carrying an IoT device (phone, wearable, dongle, etc.) continuously scan WiFi access points (APs) and store their hashed IDs. Given a confirmed case, the signals are then uploaded to a server for other users to match in their local IoT devices for virus exposure notification. vContact is not based on device pairing, and no information of other users is stored locally. The confirmed case does not need to have the device for it to work properly. As WiFi data are sampled sporadically and asynchronously, vContact uses novel and effective signal processing approaches and a similarity metric to align and match signals at any time. We conduct extensive indoor and outdoor experiments to validate vContact performance. Our results demonstrate that vContact is effective and accurate for contact detection. The precision, recall and F1-score of contact detection are high (up to 90%) for close contact proximity (2m). Its performance is robust against AP numbers, AP changes and phone heterogeneity. Having implemented vContact as an Android SDK and

Covid-19 is primarily spread through contact with the virus which may survive on surfaces with a lifespan of hours or even days if not sanitized. To curb its spread, it is hence of vital importance to detect those who have been in contact with the virus for a sustained period of time, the so-called close contacts. Most of the existing digital approaches for contact tracing focus only on direct face-to-face contacts. There has been little work on detecting indirect environmental contact, which is to detect people coming into a contaminated area with the live virus, i.e., an area last visited by an infected person within the virus lifespan. In this work, we study automatic IoT contact tracing when the virus has a lifespan which may depend on the disinfection frequency at a location. Leveraging the ubiquity of WiFi signals, we propose vContact, a novel, private, pervasive and fully distributed WiFi-based IoT contact tracing approach. Users carrying an IoT device (phone, wearable, dongle, etc.) continuously scan WiFi access points (APs) and store their hashed IDs. Given a confirmed case, the signals are then uploaded to a server for other users to match in their local IoT devices for virus exposure notification. vContact is not based on device pairing, and no information of other users is stored locally. The confirmed case does not need to have the device for it to work properly. As WiFi data are sampled sporadically and asynchronously, vContact uses novel and effective signal processing approaches and a similarity metric to align and match signals at any time. We conduct extensive indoor and outdoor experiments to validate vContact performance. Our results demonstrate that vContact is effective and accurate for contact detection. The precision, recall and F1-score of contact detection are high (up to 90%) for close contact proximity (2m). Its performance is robust against AP numbers, AP changes and phone heterogeneity. Having implemented vContact as an Android SDK and

With the rapid advances and the penetration of the Internet of Things and sensors, a massive amount of trajectory data, given by discrete locations at certain timestamps, have been extracted or collected. Knowing the similarity between trajectories is fundamental to understanding their spatial-temporal correlation, with direct and far-reaching applications in contact tracing, companion detection, personalized marketing, etc. In this work, we consider the general and realistic sensing scenario that the locations of the trajectories may be noisy, and that these trajectories are sporadically sampled with randomness and asynchrony from the underlying continuous paths. Most of the prior work on trajectory similarity has not sufficiently considered the temporal dimension, or the issues of location noise and sporadic sampling, while others have limitations of strong assumptions such as a fixed known speed of users or the availability of a large amount of training data.We propose a novel and effective spatial-temporal measure termed STS (Spatial-Temporal Similarity) to evaluate the spatial-temporal overlap between any two trajectories. In order to account for the location noise and sporadic sampling, STS models each location in a trajectory as an observable outcome drawn from a probability distribution. With that, it efficiently reduces the need for training data by estimating a personalized spatial-temporal probability distribution of the object position from its own trajectory. Based on that, it subsequently computes the co-location probability and hence derives the similarity of any two trajectories. We have conducted extensive experiments to evaluate STS using real large-scale indoor (mall) and outdoor (taxi) datasets. Our results show that STS is substantially more accurate and robust than the state-of-the-art approaches, with an improvement of 63% on precision and 85% on mean rank.