38 Result(s)
within
Hua** Zhu
Computer Science
Algorithm Analysis and Problem Complexity
-
Chapter and Conference Paper
You Need to Look Globally: Discovering Representative Topology Structures to Enhance Graph Neural Network
Graph Neural Networks (GNNs) have shown great ability in modeling graph-structured data. However, most current models aggregate information from the local neighborhoods of a node. They may fail to explicitly e...
-
Article
Open AccessTop k Optimal Sequenced Route Query with POI Preferences
The optimal sequenced route (OSR) query, as a popular problem in route planning for smart cities, searches for a minimum-distance route passing through several POIs in a specific order from a starting position...
-
Article
Open AccessQuerying Optimal Routes for Group Meetup
Motivated by location-based social networks which allow people to access location-based services as a group, we study a novel variant of optimal sequenced route (OSR) queries, optimal sequenced route for group me...
-
Chapter and Conference Paper
The Design of Inspection Robot Navigation Systems Based on Distributed Vision
This paper focuses on inspection robot navigation systems based on distributed vision in order to solve the navigation problem for indoor inspection robots in an unknown environment. Firstly, the robot platfor...
-
Chapter and Conference Paper
IMU-Aided Ultra-wideband Based Localization for Coal Mine Robots
Robotic mining equipment is playing an increasingly important role in coal mine operations. Due to the complexity of underground occlusion environment, the localization methods available are limited, which res...
-
Chapter and Conference Paper
Long-Term Real-Time Correlation Filter Tracker for Mobile Robot
Computer vision has received a significant attention in recent years, which is one of the important parts for robots to apperceive external environment. Discriminative Correlation Filter (DCF) based trackers g...
-
Chapter and Conference Paper
Further Evidence for Role of Promoter Polymorphisms in TNF Gene in Alzheimer’s Disease
Tumor necrosis factor (TNF) expression level is associated with regulating effects on Alzheimer’s disease (AD) development. And several TNF SNPs have been reported to associate with AD, however, it is unclear whe...
-
Chapter and Conference Paper
A Novel Approach Based on Bi-Random Walk to Predict Microbe-Disease Associations
An increasing number of clinical observations have confirmed that the microbes inhabiting in human body have critical impacts on the progression of human disease, which provides promising insights into underst...
-
Chapter and Conference Paper
Distributed Multi-user, Multi-key Searchable Encryptions Resilient Fault Tolerance
In this paper, a construction of distributed multi-user, multi-key searchable encryptions is proposed and analyzed. Our scheme leverages a combination of the Shamir’s threshold secret key sharing, the Pohlig-H...
-
Chapter and Conference Paper
Universally Composable Oblivious Database in the Presence of Malicious Adversaries
The core technique for constructing oblivious database is to get efficient implementations of oblivious transfer. This paper studies universally composable 1-out-of-n oblivious transfer (OT
-
Chapter and Conference Paper
The Chained Mesh-Under Routing (C-MUR) for Improving IPv6 Packet Arrival Rate over Wireless Sensor Networks
The 6LoWPAN protocol is used in delivering IPv6 packet over IEEE 802.15.4 based wireless sensor networks (WSNs). In 6LoWPAN, adaptation layer is introduced in the protocol stack so that routing can be performe...
-
Chapter and Conference Paper
Maximizing the Lifetime of Unreliable Sensor Networks with Delay Constraint via Genetic Algorithm
Energy saving is a key issue for prolonging the runtime of Wireless Sensor Network (WSN). In real-time applications of WSN, it is required to deliver data to the sink within a delay constraint. It is significa...
-
Chapter and Conference Paper
Sustainable Pseudo-random Number Generator
Barak and Halevi (BH) have proposed an efficient architecture for robust pseudorandom generators that ensure resilience in the presence of attackers with partial knowledge or partial controls of the generators...
-
Chapter and Conference Paper
Similarity Measurement and Feature Selection Using Genetic Algorithm
This paper proposes a novel approach to search for the optimal combination of a measure function and feature weights using an evolutionary algorithm. Different combinations of measure function and feature weig...
-
Chapter and Conference Paper
Adaptive and Composable Non-interactive String-Commitment Protocols
In this paper, a non-interactive string-commitment protocol in the common reference string model is presented and analyzed. We show that the proposed (length-flexible) commitment protocol realizes the universa...
-
Chapter and Conference Paper
Universally Composable Non-committing Encryptions in the Presence of Adaptive Adversaries
Designing non-committing encryptions tolerating adaptive adversaries is a challenging task. In this paper, a simple implementation of non-committing encryptions is presented and analyzed in the strongest secur...
-
Chapter and Conference Paper
Error-free, Multi-bit Non-committing Encryption with Constant Round Complexity
This paper studies error-free, multi-bit non-committing encryptions in the universally composable (UC) framework with constant round complexity. Previous efficient protocols such as the Beaver’s protocol and t...
-
Chapter and Conference Paper
Adaptive and Composable Non-committing Encryptions
In this paper, a new non-committing encryption protocol without failure during the course of a channel setup procedure is constructed and analyzed in the universally composable (UC) framework. We show that the...
-
Chapter and Conference Paper
Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions
In this paper, a new implementation of universally composable, 1-out-of-2 oblivious transfer in the presence of static adversaries is presented and analyzed. Our scheme is constructed from the state-of-the-art...
-
Chapter and Conference Paper
Black-Box Constructions for Fully-Simulatable Oblivious Transfer Protocols
This paper studies constructions of \(k \choose 1\) - oblivious transfer protocols in a black-box way. The security of
