Reinvent Cloud Software Stacks for Resource Disaggregation
Due to the unprecedented development of low-latency interconnect technology, building large-scale disaggregated architecture is drawing more and more attention from both industry and academia. Resource disaggregation is a new way to organize the ...
FedIERF: Federated Incremental Extremely Random Forest for Wearable Health Monitoring
Wearable health monitoring is a crucial technical tool that offers early warning for chronic diseases due to its superior portability and low power consumption. However, most wearable health data is distributed across different organizations, such ...
Top-down Text-Level Discourse Rhetorical Structure Parsing with Bidirectional Representation Learning
Early studies on discourse rhetorical structure parsing mainly adopt bottom-up approaches, limiting the parsing process to local information. Although current top-down parsers can better capture global information and have achieved particular ...
FDNet: A Deep Learning Approach with Two Parallel Cross Encoding Pathways for Precipitation Nowcasting
With the goal of predicting the future rainfall intensity in a local region over a relatively short period time, precipitation nowcasting has been a long-time scientific challenge with great social and economic impact. The radar echo extrapolation ...
Chinese Named Entity Recognition Augmented with Lexicon Memory
Inspired by the concept of content-addressable retrieval from cognitive science, we propose a novel fragmentbased Chinese named entity recognition (NER) model augmented with a lexicon-based memory in which both characterlevel and word-level ...
Cognition: Accurate and Consistent Linear Log Parsing Using Template Correction
Logs contain runtime information for both systems and users. As many of them use natural language, a typical log-based analysis needs to parse logs into the structured format first. Existing parsing approaches often take two steps. The first step ...
Dalea: A Persistent Multi-Level Extendible Hashing with Improved Tail Performance
Persistent memory (PM) promises byte-addressability, large capacity, and durability. Main memory systems, such as key-value stores and in-memory databases, benefit from such features of PM. Due to the great popularity of hashing index in main ...
VTensor: Using Virtual Tensors to Build a Layout-Oblivious AI Programming Framework
Tensors are a popular programming interface for developing artificial intelligence (AI) algorithms. Layout refers to the order of placing tensor data in the memory and will affect performance by affecting data locality; therefore the deep neural ...
Path-Based Multicast Routing for Network-on-Chip of the Neuromorphic Processor
Network-on-Chip (NoC) is widely adopted in neuromorphic processors to support communication between neurons in spiking neural networks (SNNs). However, SNNs generate enormous spiking packets due to the one-to-many traffic pattern. The spiking ...
CA-DTS: A Distributed and Collaborative Task Scheduling Algorithm for Edge Computing Enabled Intelligent Road Network
Edge computing enabled Intelligent Road Network (EC-IRN) provides powerful and convenient computing services for vehicles and roadside sensing devices. The continuous emergence of transportation applications has caused a huge burden on roadside ...
Side-Channel Analysis for the Re-Keying Protocol of Bluetooth Low Energy
In the era of the Internet of Things, Bluetooth low energy (BLE/BTLE) plays an important role as a well-known wireless communication technology. While the security and privacy of BLE have been analyzed and fixed several times, the threat of side-...
Accurate Robotic Grasp Detection with Angular Label Smoothing
Grasp detection is a visual recognition task where the robot makes use of its sensors to detect graspable objects in its environment. Despite the steady progress in robotic grasping, it is still difficult to achieve both real-time and high ...
Model Checking for Probabilistic Multiagent Systems
In multiagent systems, agents usually do not have complete information of the whole system, which makes the analysis of such systems hard. The incompleteness of information is normally modelled by means of accessibility relations, and the ...
Parallel Bounded Search for the Maximum Clique Problem
Given an undirected graph, the Maximum Clique Problem (MCP) is to find a largest complete subgraph of the graph. MCP is NP-hard and has found many practical applications. In this paper, we propose a parallel Branch-and- Bound (BnB) algorithm to ...