检索结果-内蒙古大学图书馆

Challenge-Aware RGBT Tracking 1

学校读者我要写书评

暂无评论

16th European Conference on Computer Vision, ECCV 2020

作者： Li, Chenglong Liu, Lei Lu, Andong Ji, Qing Tang, Jin Key Lab of Intelligent Computing and Signal Processing of Ministry of Education Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Computer Science and Technology Anhui University Hefei230601 China

ISBN: (数字)9783030585426

ISBN: (纸本)9783030585419

RGB and thermal source data suffer from both shared and specific challenges, and how to explore and exploit them plays a critical role to represent the target appearance in RGBT tracking. In this paper, we propose a novel challenge-aware neural network to handle the modality-shared challenges (e.g., fast motion, scale variation and occlusion) and the modality-specific ones (e.g., illumination variation and thermal crossover) for RGBT tracking. In particular, we design several parameter-shared branches in each layer to model the target appearance under the modality-shared challenges, and several parameter-independent branches under the modality-specific ones. Based on the observation that the modality-specific cues of different modalities usually contains the complementary advantages, we propose a guidance module to transfer discriminative features from one modality to another one, which could enhance the discriminative ability of some weak modality. Moreover, all branches are aggregated together in an adaptive manner and parallel embedded in the backbone network to efficiently form more discriminative target representations. These challenge-aware branches are able to model the target appearance under certain challenges so that the target representations can be learnt by a few parameters even in the situation of insufficient training data. From the experimental results we will show that our method operates at a real-time speed while performing well against the state-of-the-art methods on three benchmark datasets. © 2020, Springer Nature Switzerland AG.

关键词： Computers

The interior penalty virtual element method for fourth-order singular perturbation problems

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Feng, Fang Yu, Yue School of Mathematics and Statistics Nanjing University of Science and Technology Nanjing China School of Mathematics and Computational Science Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Xiangtan University Hunan Xiangtan411105 China

This paper is dedicated to the numerical solution of a fourth-order singular perturbation problem using the interior penalty virtual element method (IPVEM) proposed in [42]. The study introduces modifications to the jumps and averages in the penalty term, as well as presents an automated mesh-dependent selection of the penalty parameter. Drawing inspiration from the modified Morley finite element methods, we leverage the conforming interpolation technique to handle the lower part of the bilinear form. Through our analysis, we establish optimal convergence in the energy norm and provide a rigorous proof of uniform convergence concerning the perturbation parameter in the lowest-order case. © 2023, CC BY-NC-ND.

关键词： Numerical methods

An Overlapping Local Community Detection Algorithm Based on Node Transitivity and Modularity Density 15th

学校读者我要写书评

暂无评论

An Overlapping Local Community Detection Algorithm Based on ...

15th CCF Conference on Computer Supported Cooperative Work and Social computing, Chinese CSCW 2020

作者： Huang, Xintong Wu, Ling Guo, Kun College of Mathematics and Computer Sciences Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350116 China

ISBN: (纸本)9789811625398

The local community detection (LCD) method can discover the local community structure in which the seed node is located. Compared with global community detection, local community detection is characterized by its low cost and high efficiency. However, most existing LCD methods only return a non-overlapping community. Individuals in the real world may participate in multiple communities, which can only be discovered by using overlapping local community detection methods. In this study, an overlapping local community detection algorithm based on modularity and node transitivity. First, the scope and structure information of the overlapping communities are obtained according to the node transitivity. Second, NMF is used to obtain the number of overlapping communities. Finally, the local modularity density based on edge weights is used to refine the detected local communities. The experimental results validate the high performance of our method to the other method in comparison. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Complex networks

A Distributed Storage Middleware Based on HBase and Redis 15th

学校读者我要写书评

暂无评论

A Distributed Storage Middleware Based on HBase and Redis

15th CCF Conference on Computer Supported Cooperative Work and Social computing, Chinese CSCW 2020

作者： Xu, Lingling Chen, Yuzhong Guo, Kun College of Mathematics and Computer Science Fuzhou University Fuzhou350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350108 China

ISBN: (纸本)9789811625398

In the era of big data, traditional relational databases face challenges in massive data storage. HBase is a non-relational database based on column storage which is used widely for big data storage. The writing performance of HBase is high, but the unbalanced load caused by its uneven data storage strategy is the bottleneck of its reading performance. HBase needs to access disks to get query results. Therefore, the efficiency of disk access has a great impact on the query performance of HBase. In view of the above problems, this paper proposes a storage middleware which utilizes HBase for load balancing and Redis for memory caching. Specifically, we improve HBase’s original load balancing algorithm for Regions and RegionServers and customize a Redis cache eviction algorithm according to the data’s query and update frequency. Furthermore, the coprocessor of HBase is used to synchronize data between HBase and Redis. Experiments on synthetic datasets show that the proposed storage middleware achieves better writing and reading performance than HBase. The load balancing algorithm employed in the middleware is better than HBase's original algorithm. The hit rate of the customized cache eviction algorithm is also higher than that of the LRU algorithm. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Cache memory

An Evolutionary Multi-Objective Neural Architecture Search Approach to Advancing Cognitive Diagnosis in intelligent education

学校读者我要写书评

暂无评论

IEEE Transactions on Evolutionary Computation 2024年 1-1页

作者： Yang, Shangshang Ma, Haiping Bi, Ying Tian, Ye Zhang, Limiao Jin, Yaochu Zhang, Xingyi School of Artificial Intelligence Anhui University Hefei China Institutes of Physical Science and Information Technology Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China School of Electrical and Information Engineering Computational Intelligence Laboratory Zhengzhou University Zhengzhou China School of Computer Science and Technology Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui University Hefei China Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui University Hefei Anhui China School of Engineering Westlake University Hangzhou China

As a pivotal technique in intelligent education systems, cognitive diagnosis (CD) serves to reveal students’ knowledge proficiency for better tackling subsequent tasks. Unfortunately, due to pursuing high model interpretability, existing manually designed models for CD often hold simplistic architectures, which cannot cope with intricate data in modern education platforms. Furthermore, the bias of human design limits the emergence of novel and effective CD models. To develop interpretable and more effective models, thus this paper proposes an evolutionary multi-objective neural architecture search (NAS) approach for CD. Specifically, we first adopt a comprehensive search space for the NAS task of CD: all candidate models can be encompassed by a general model that deals with three distinct types of inputs. Then, an innovative model interpretability objective is devised to formulate the architecture search task as a bi-objective optimization problem (BOP). To solve the BOP, we employ a multi-objective genetic programming (MOGP) as the search strategy to explore the search space. To make the employed MOGP search well, all architectures are first encoded by trees for easy optimization, and we devise a genetic operation and a population initialization strategy to expedite its convergence. Finally, the proposed approach is actually a MOGP-based NAS approach for CD. Extensive experiments show that CD models searched by the proposed approach exhibit significantly better performance than existing models and hold as good interpretability as handcrafted models. Besides, the effectiveness of the proposed MOGP search strategy, the devised objective, and tailored strategies are validated. IEEE

关键词： Computer architecture

The Design and Implementation of KMeans Based on Unified Batch and Streaming processing 15th

学校读者我要写书评

暂无评论

The Design and Implementation of KMeans Based on Unified Bat...

15th CCF Conference on Computer Supported Cooperative Work and Social computing, Chinese CSCW 2020

作者： Chen, Hao Guo, Kun Chen, Yuzhong Guo, Hong College of Mathematics and Computer Science Fuzhou University Fuzhou350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350108 China

ISBN: (纸本)9789811625398

Clustering algorithms aim at gathering similar data points from a dataset in an unsupervised manner. Although the batch clustering algorithms have relatively high accuracy, they cannot make use of the dynamic clustering results efficiently. The requirement of using the whole dataset in calculation results in the problems of resource waste and high time cost. On the contrary, incremental clustering only needs to update the varied part of a model upon the arrival of new data, which makes it unnecessary to recluster the whole data all the time. The feature is very suitable for the streaming data process, but it decreases the accuracy of the algorithms and cannot satisfy the low latency requirement of real-time data processing. In response to this problem, the paper proposes a novel unified batch and streaming clustering model (UBSCM) based on streaming computation, which includes a streaming cluster feature updating mechanism (SCFUM). The Flink framework is used to implement a new streaming KMeans algorithm based on UBSCM (KMeansUBSP). The experiments on the real-world datasets validate that the new streaming KMeans algorithm is effective in clustering the batch and streaming data in a unified manner. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Clustering algorithms

A general alternating-direction implicit Newton method for solving complex continuous-time algebraic Riccati matrix equation

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Li, Shifeng Jiang, Kai Zhang, Juan Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Hunan Key Laboratory for Computation and Simulation in Science and Engineering School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China

In this paper, applying the Newton method, we transform the complex continuous-time algebraic Riccati matrix equation into a Lyapunov equation. Then, we introduce an efficient general alternating-direction implicit (GADI) method to solve the Lyapunov equation. The inexact Newton-GADI method is presented to save computational amount effectively. Moreover, we analyze the convergence of the Newton-GADI method. The convergence rate of the Newton-GADI and Newton-ADI methods is compared by analyzing their spectral radii. Furthermore, we give a way to select the quasi-optimal parameter. Corresponding numerical tests are shown to illustrate the effectiveness of the proposed algorithms. © 2022, CC BY-SA.

关键词： Newton-Raphson method

FOURIER NEURAL SOLVER FOR LARGE SPARSE LINEAR ALGEBRAIC SYSTEMS

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Cui, Chen Jiang, Kai Liu, Yun Shu, Shi Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China

Large sparse linear algebraic systems can be found in a variety of scientific and engineering fields, and many scientists strive to solve them in an efficient and robust manner. In this paper, we propose an interpretable neural solver, the Fourier Neural Solver (FNS), to address them. FNS is based on deep learning and Fast Fourier transform. Because the error between the iterative solution and the ground truth involves a wide range of frequency modes, FNS combines a stationary iterative method and frequency space correction to eliminate different components of the error. Local Fourier analysis reveals that the FNS can pick up on the error components in frequency space that are challenging to eliminate with stationary methods. Numerical experiments on the anisotropy diffusion equation, convection-diffusion equation, and Helmholtz equation show that FNS is more efficient and more robust than the state-of-the-art neural *** Codes 65F10 65N22 68T07 35Q68 Copyright © 2022, The Authors. All rights reserved.

关键词： Fourier analysis

Multitask kernel-learning parameter prediction method for solving time-dependent linear systems

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Jiang, Kai Zhang, Juan Zhou, Qi Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Hunan key Laboratory for Computation and Simulation in Science and Engineering School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China

Matrix splitting iteration methods play a vital role in solving large sparse linear systems. Their performance heavily depends on the splitting parameters, however, the approach of selecting optimal splitting parameters has not been well developed. In this paper, we present a multitask kernel-learning parameter prediction method to automatically obtain relatively optimal splitting parameters, which contains simultaneous multiple parameters prediction and a data-driven kernel learning. For solving time-dependent linear systems, including linear differential systems and linear matrix systems, we give a new matrix splitting Kronecker product method, as well as its convergence analysis and preconditioning strategy. Numerical results illustrate our methods can save an enormous amount of time in selecting the relatively optimal splitting parameters compared with the exists methods. Moreover, our iteration method as a preconditioner can effectively accelerate GMRES. As the dimension of systems increases, all the advantages of our approaches becomes significantly. Especially, for solving the differential Sylvester matrix equation, the speedup ratio can reach tens to hundreds of times when the scale of the system is larger than one hundred thousand. Copyright © 2022, The Authors. All rights reserved.

关键词： Linear systems