This paper investigates group distributionally robust optimization (GDRO) with the goal of learning a model that performs well over m different distributions. First, we formulate GDRO as a stochastic convex-concave sa...
详细信息
Gait recognition is a technique to recognize subjects under long-distance conditions. Existing gait recognition methods generally rely on extracting different motion representations of body parts to capture the gait i...
详细信息
Gait recognition is a technique to recognize subjects under long-distance conditions. Existing gait recognition methods generally rely on extracting different motion representations of body parts to capture the gait information. However, the differences in appearance silhouettes between subjects are not discriminative enough to identify the distinct gaits. Therefore, exploring the representations of unique motion differences of subjects from the temporal domain is an effective way to boost gait recognition performance. In this paper, we propose a cross-view spatiotemporal aggregation network (CSTAN) to learn the most discriminative motion representations of subjects from multi-scale features. Particularly, CSTAN uses temporal contextual feature aggregation (TCFA) block to interact multi-scale features, increasing the diversity of temporal representations in feature sequences and producing suitable motion representations. Besides, a potential spatial feature assessment (PSFA) block is proposed to address the problem of missing silhouettes due to occlusion. Considering the multi-view context, we propose a cross-view prediction learning (CVPL) block to mitigate the impact of the view itself. By aggregating features in the spatiotemporal and view domains, CSTAN can learn a more appropriate representation of human motion differences. Extensive experiments on two public gait recognition datasets demonstrate the state-of-the-art performance of our proposed CSTAN. It is worth mentioning that the performance of CSTAN achieves a breakthrough in some complex environments, e.g., the subjects wearing different coats or carrying a bag. IEEE
The excessive proliferation of Low Earth Orbit (LEO) satellites inescapably bring the explosive growth of space data in LEO Satellite Networks (LSNs). Meanwhile, the stochastic arrivals of space data together with the...
详细信息
ISBN:
(数字)9798350368369
ISBN:
(纸本)9798350368376
The excessive proliferation of Low Earth Orbit (LEO) satellites inescapably bring the explosive growth of space data in LEO Satellite Networks (LSNs). Meanwhile, the stochastic arrivals of space data together with the time-varying satellite-ground links in LSNs pose significant challenges for offloading a large volume of space data from LSNs to ground stations. To circumvent these challenges, we systematically study the energy-constrained online data offloading problem to jointly optimize power allocation and task scheduling for LSNs. First, we leverage Lyapunov optimization to decouple our formulated long-term stochastic joint optimization problem into a set of per-time-slot subproblems. Then, each subproblem is decoupled into a task scheduling problem and a power allocation problem. Next, we derive the optimal solution to the power allocation problem and propose a multi-armed bandit based quasi-optimal solution to the task scheduling problem. Finally, extensive simulation results show that our proposed algorithm has superior performance over the state-of-the-art solutions.
Recent advances in single image super-resolution (SISR) have achieved remarkable performance through deep learning. However, the high computational cost hinders the deployment of SISR models on edge devices. Instead o...
Recent advances in single image super-resolution (SISR) have achieved remarkable performance through deep learning. However, the high computational cost hinders the deployment of SISR models on edge devices. Instead of proposing new SISR models, a new trend is emerging to improve network efficiency by reducing parameters, FLOPs, and inference time through slight modifications to the original models. However, recent methods usually focus on reducing only one of three metrics, i.e., FLOPs, parameters and inference time, which inevitably increases the other two metrics. In this paper, we propose a novel Adaptive Student Inference Network (ASIN) on popular SISR models, which aims at reducing FLOPs and inference time while maintaining the number of parameters and restoring clearer high-resolution images. Specifically, our ASIN divides a SISR model into three components (head, body and tail) and adopts various strategies for each part. For head and tail parts, to ensure the restored images contain more detailed information, a novel auxiliary Enhanced Teacher Network (ETNet) is designed, which is trained with the ground-truth images to obtain more prior knowledge to guide student network to extract more accurate textures using a new knowledge distillation method. For the body part, owing to the varying difficulties of the reconstructions in different regions, we propose an Adaptive Depth Predicted Module (ADPM) to dynamically shorten average depth of network to reduce the computational cost of overall network. Extensive experiments on two datasets demonstrate the effectiveness and state-of-the-art performance of our ASIN compared to its counterparts.
Advances in health-related behaviors, technical breakthroughs, and the spread of healthy living activities have expanded personal health evaluation on a broad scale. In medical applications, networks, data, and commun...
详细信息
In agriculture farming, pests and other plant diseases are the most imperative factor that causes significant hindrance to cucumber production and its quality. Farmers around the globe are currently facing difficulty ...
详细信息
Inline assembly code is common in system software to interact with the underlying hardware platforms. The safety and correctness of the assembly code is crucial to guarantee the safety of the whole system. In this pap...
详细信息
Inline assembly code is common in system software to interact with the underlying hardware platforms. The safety and correctness of the assembly code is crucial to guarantee the safety of the whole system. In this paper, we propose a practical Hoare-style program logic for verifying SPARC (Scalable Processor Architecture) assembly code. The logic supports modular reasoning about the main features of SPARCv8 ISA (instruction set architecture), including delayed control transfers, delayed writes to special registers, and register windows. It also supports relational reasoning for refinement verification. We have applied it to verify that there is a contextual refinement between a context switch routine in SPARCv8 and a switch primitive. The program logic and its soundness proof have been mechanized in Coq.
The synthesis of quantum circuits for multiplicative inverse over $\operatorname{GF}(2^{8})$ are discussed in this paper. We first convert the multiplicative inverse operation in $\operatorname{GF}(2^{8})$ to arithmet...
The synthesis of quantum circuits for multiplicative inverse over $\operatorname{GF}(2^{8})$ are discussed in this paper. We first convert the multiplicative inverse operation in $\operatorname{GF}(2^{8})$ to arithmetic operations in the composite field $\operatorname{GF}((2^{4})^{2})$ , and then discuss the expressions of the square calculation, the inversion calculation and the multiplication calculation separately in the finite field $\operatorname{GF}(2^{4})$ , where the expressions of multiplication calculation in $\operatorname{GF}(2^{4})$ are given directly in $\operatorname{GF}(2^{4})$ and given through being transformed into the composite field $\operatorname{GF}((2^{2})^{2})$ . Then the quantum circuits of these calculations are realized one by one. Finally, two quantum circuits for multiplicative inverse over $\operatorname{GF}(2^{8})$ are synthesized. They both use 21 qubits, the first quantum circuit uses 55 Toffoli gates and 107 CNOT gates and the second one uses 37 Toffoli gates and 209 CNOT gates. As an example of the application of multiplication inverse, we apply these quantum circuits to the implementations of the S-box quantum circuit of the AES cryptographic algorithm. Two quantum circuits for implementing the S-box of the AES cryptographic algorithm are presented. The first quantum circuit uses 21 qubits, 55 Toffoli gates, 131 CNOT gates and 4 NOT gates and the second one uses 21 qubits, 37 Toffoli gates, 233 CNOT gates and 4 NOT gates. Through the evaluation of quantum cost, the two quantum circuits of the S-box of AES cryptographic algorithm use less quantum resources than the existing schemes.
Network security risks are increasing at an exponential rate as Internet technology advances. Keeping the network protected is one of the most challenging of network security. Many security mechanisms were implemented...
详细信息
暂无评论