SearcharxivSearch

arXiv subjects

Jun Gu

Publications and source records attributed to Jun Gu.

15 recordsLinked to original sources

TodyNet: Temporal Dynamic Graph Neural Network for Multivariate Time Series Classification

Multivariate time series classification (MTSC) is an important data mining task, which can be effectively solved by popular deep learning technology. Unfortunately, the existing deep learning-based methods neglect the hidden dependencies in different dimensions and also rarely consider the unique dynamic features of time series, which lack sufficient feature extraction capability to obtain satisfactory classification accuracy. To address this problem, we propose a novel temporal dynamic graph neural network (TodyNet) that can extract hidden spatio-temporal dependencies without undefined graph structure. It enables information flow among isolated but implicit interdependent variables and captures the associations between different time slots by dynamic graph mechanism, which further improves the classification performance of the model. Meanwhile, the hierarchical representations of graphs cannot be learned due to the limitation of GNNs. Thus, we also design a temporal graph pooling layer to obtain a global graph-level representation for graph learning with learnable temporal parameters. The dynamic graph, graph information propagation, and temporal convolution are jointly learned in an end-to-end framework. The experiments on 26 UEA benchmark datasets illustrate that the proposed TodyNet outperforms existing deep learning-based methods in the MTSC tasks.

cs.LG

OmniWheg: An Omnidirectional Wheel-Leg Transformable Robot

This paper presents the design, analysis, and performance evaluation of an omnidirectional transformable wheel-leg robot called OmniWheg. We design a novel mechanism consisting of a separable omni-wheel and 4-bar linkages, allowing the robot to transform between omni-wheeled and legged modes smoothly. In wheeled mode, the robot can move in all directions and efficiently adjust the relative position of its wheels, while it can overcome common obstacles in legged mode, such as stairs and steps. Unlike other articles studying whegs, this implementation with omnidirectional wheels allows the correction of misalignments between right and left wheels before traversing obstacles, which effectively improves the success rate and simplifies the preparation process before the wheel-leg transformation. We describe the design concept, mechanism, and the dynamic characteristic of the wheel-leg structure. We then evaluate its performance in various scenarios, including passing obstacles, climbing steps of different heights, and turning/moving omnidirectionally. Our results confirm that this mobile platform can overcome common indoor obstacles and move flexibly on the flat ground with the new transformable wheel-leg mechanism, while keeping a high degree of stability.

cs.RO

Establishing a non-hydrostatic global atmospheric modeling system (iAMAS) at 3-km horizontal resolution with online integrated aerosol feedbacks on the Sunway supercomputer of China

During the era of global warming and highly urbanized development, extreme and high impact weather as well as air pollution incidents influence everyday life and might even cause the incalculable loss of life and property. Although with the vast development of numerical simulation of atmosphere, there still exists substantial forecast biases objectively. To predict extreme weather, severe air pollution, and abrupt climate change accurately, the numerical atmospheric model requires not only to simulate meteorology and atmospheric compositions and their impacts simultaneously involving many sophisticated physical and chemical processes but also at high spatiotemporal resolution. Global atmospheric simulation of meteorology and atmospheric compositions simultaneously at spatial resolutions of a few kilometers remains challenging due to its intensive computational and input/output (I/O) requirement. Through multi-dimension-parallelism structuring, aggressive and finer-grained optimizing, manual vectorizing, and parallelized I/O fragmenting, an integrated Atmospheric Model Across Scales (iAMAS) was established on the new Sunway supercomputer platform to significantly increase the computational efficiency and reduce the I/O cost. The global 3-km atmospheric simulation for meteorology with online integrated aerosol feedbacks with iAMAS was scaled to 39,000,000 processor cores and achieved the speed of 0.82 simulation day per hour (SDPH) with routine I/O, which enables us to perform 5-day global weather forecast at 3-km horizontal resolution with online natural aerosol impacts. The results demonstrate the promising future that the increasing of spatial resolution to a few kilometers with online integrated aerosol impacts may significantly improve the global weather forecast.

physics.ao-ph

Lightweight authenticated quantum key distribution protocols with key recycling

Quantum key distribution (QKD) has been developed for decades and several different QKD protocols have been proposed. But two difficulties limit the implementation of most QKD protocols. First, the involved participants are required to have heavy quantum capabilities, such as quantum joint operation, quantum register, and so on. Second, a hypothetical authenticated classical channel is used in most of the existing QKD protocols and this assumed channel does not exist in reality. To solve both the above limitations at the same time, this study proposes three lightweight authenticated QKD protocols with key recycling and shows these proposed protocols are robust under the collective attack.

quant-ph

On the lightweight authenticated semi-quantum key distribution protocol without Trojan horse attack

Recently, Tsai et al. (Laser Phys. Lett. 17, 075202, 2020) proposed a lightweight authenticated semi-quantum key distribution protocol for a quantum participant to share a secret key with a classical participant. However, this study points out that an attacker can use a modification attack to make both participants share a wrong key without being detected. To avoid this problem, an improvement is proposed here.

quant-ph

Collusion attack and counterattack on the quantum key agreement via non-maximally entangled cluster states

Recently, Li et al. (Int J Theor Phys: DOI: 10.1007/s10773-020-04588-w, 2020) proposed a multiparty quantum key agreement protocol via non-maximally entangled cluster states. They claimed that the proposed protocol can help all the involved participants have equal influence on the final shared key. However, this study points out a loophole that makes Li et al.'s protocol suffer from a collusion attack, i.e. several dishonest participants can conspire to manipulate the final shared key without being detected by others. To avoid this loophole, an improvement is proposed here.

quant-ph

Two attacks and counterattacks on the mutual semi-quantum key agreement protocol using Bell states

Recently, a mutual semi-quantum key agreement protocol using Bell states is proposed by Yan et al. (Mod. Phys. Lett. A, 34, 1950294, 2019). The proposed protocol tries to help a quantum participant share a key with a classical participant who just has limited quantum capacities. Yan et al. claimed that both the participants have the same influence on the final shared key. However, this study points out that the classical participant can manipulate the final shared key by himself/herself without being detected. To solve this problem, an improved method is proposed here.

quant-ph

Double C-NOT attack on a single-state semi-quantum key distribution protocol and its improvement

Recently, Zhang et al. proposed a single-state semi-quantum key distribution protocol (Int. J. Quantum Inf, 18, 4, 2020) to help a quantum participant to share a secret key with a classical participant. However, this study shows that an eavesdropper can use a double C-NOT attack to obtain parts of the final shared key without being detected by the participants. To avoid this problem, a modification is proposed here.

quant-ph

Permutation attack and counterattack on the two-party quantum key agreement over a collective noisy channel

Recently, Yang et al. (Quantum Inf Process 18, 74, 2019) proposed a two-party quantum key agreement protocol over a collective noisy channel. They claimed that their quantum key agreement protocol can ensure both of the participants have equal influence on the final shared key. However, this study shows that the participant who announces the permutation operation can manipulate the final shared key by himself/herself without being detected by the other. To avoid this loophole, an improvement is proposed here.

quant-ph

Improvement on "Secure multi-party quantum summation based on quantum Fourier transform"

Recently, Yang et al. (Quantum Inf Process:17:129, 2018) proposed a secure multi-party quantum summation protocol allowing the involved participants to sum their secrets privately. They claimed that the proposed protocol can prevent each participant's secret from being known by others. However, this study shows that the participant who prepares the initial quantum states can obtain other participants' secrets with an inverse quantum Fourier transform attack. A modification is then proposed here to solve this problem.

quant-ph

Wider Channel Attention Network for Remote Sensing Image Super-resolution

Recently, deep convolutional neural networks (CNNs) have obtained promising results in image processing tasks including super-resolution (SR). However, most CNN-based SR methods treat low-resolution (LR) inputs and features equally across channels, rarely notice the loss of information flow caused by the activation function and fail to leverage the representation ability of CNNs. In this letter, we propose a novel single-image super-resolution (SISR) algorithm named Wider Channel Attention Network (WCAN) for remote sensing images. Firstly, the channel attention mechanism is used to adaptively recalibrate the importance of each channel at the middle of the wider attention block (WAB). Secondly, we propose the Local Memory Connection (LMC) to enhance the information flow. Finally, the features within each WAB are fused to take advantage of the network's representation capability and further improve information and gradient flow. Analytic experiments on a public remote sensing data set (UC Merced) show that our WCAN achieves better accuracy and visual improvements against most state-of-the-art methods.

cs.CV

Semi-quantum private comparison protocol under an almost-dishonest third party

This study presents the first semi-quantum private comparison protocol under an almost-dishonest third party. The proposed protocol allows two classical participants to compare their secret information without compromising it's privacy. The security analyses indicate that the protocol is free from several well-known attacks.

quant-ph

Comment on 'Improving the security of protocols of quantum key agreement solely using Bell states and Bell measurement'

Designing a quantum key agreement (QKA) protocol is always a challenging task, because both the security and the fairness properties have to be considered simultaneously. Recently, Zhu et al. (Quantum Inf Process 14(11): 4245-4254) pointed out that Shukla et al.'s QKA protocol (Quantum Inf Process 13(11): 2391-2405) has some security flaws (which lead to the Participant Attack). Moreover, they proposed an improvement to avoid these weaknesses. However this study points out that the improved protocol also suffers from a colluding attack, i.e., two dishonest participants in the protocol can collaborate to manipulate the final secret key without being detected.

quant-ph

Design of Quantum Key Agreement Protocols with Strong Fairness Property

This study distinguishes the weak fairness property from the strong fairness property which is necessary in the quantum key agreement (QKA) and shows that most of the existing QKAs cannot achieve the strong fairness property with a key manipulation problem.To solve this problem, a model which describes the way to design a QKA with the strong fairness property is proposed. Based on the model, an example QKA is presented. Security analyses show that the proposed QKA is effective to resist not only outsider's eavesdropping attack but also insider's key manipulation.

quant-ph

Scaling and memory in recurrence intervals of Internet traffic

By studying the statistics of recurrence intervals, $τ$, between volatilities of Internet traffic rate changes exceeding a certain threshold $q$, we find that the probability distribution functions, $P_{q}(τ)$, for both byte and packet flows, show scaling property as $P_{q}(τ)=\frac{1}{\overlineτ}f(\fracτ{\overlineτ})$. The scaling functions for both byte and packet flows obeys the same stretching exponential form, $f(x)=A\texttt{exp}(-Bx^β)$, with $β\approx 0.45$. In addition, we detect a strong memory effect that a short (or long) recurrence interval tends to be followed by another short (or long) one. The detrended fluctuation analysis further demonstrates the presence of long-term correlation in recurrence intervals.

physics.data-an