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

A Unified Stream and Batch Graph computing Model for Community Detection 17th

学校读者我要写书评

暂无评论

A Unified Stream and Batch Graph Computing Model for Commu...

17th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2022

作者： Dai, Jinkun Wu, Ling Guo, Kun Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China College of Computer and Data Science Fuzhou University Fuzhou350108 China Key Laboratory of Spatial Data Mining and Information Sharing Ministry of Education Fuzhou350108 China

ISBN: (纸本)9789819923557

An essential challenge in graph data analysis and mining is to simply and effectively deal with large-scale network data that is expanding dynamically. Although batch-based parallel graph computation frameworks have better accuracy, they cannot process incremental data on time and need to be recomputed. To process real-time data, stream processing applications need to be redeveloped, which increases the redundancy of work, and some existing dynamic graph computation schemes are not generalizable. This paper proposes a unified stream and batch graph computing model(USBGM). The model is compatible with both stream and batch graph computing. Graph operators and algorithms developed based on the model can handle stream and batch graph data in a unified manner. The experiments on real-world and artificial networks verified the effectiveness and efficiency of the model. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Population dynamics

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

An Evolutionary Network Architecture Search Framework with Adaptive Multimodal Fusion for Hand Gesture Recognition

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Xia, Yizhang Song, Shihao Hou, Zhanglu Xu, Junwen Zou, Juan Liu, Yuan Yang, Shengxiang Hunan Engineering Research Center of Intelligent System Optimization and Security Key Laboratory of Intelligent Computing and Information Processing Ministry of Education of China Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University Hunan Province Xiangtan411105 China The Centre for Computational Intelligence School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom

Hand gesture recognition (HGR) based on multimodal data has attracted considerable attention owing to its great potential in applications. Various manually designed multimodal deep networks have performed well in multimodal HGR (MHGR), but most of existing algorithms require a lot of expert experience and time-consuming manual trials. To address these issues, we propose an evolutionary network architecture search framework with the adaptive multimodel fusion (AMF-ENAS). Specifically, we design an encoding space that simultaneously considers fusion positions and ratios of the multimodal data, allowing for the automatic construction of multimodal networks with different architectures through decoding. Additionally, we consider three input streams corresponding to intra-modal surface electromyography (sEMG), intra-modal accelerometer (ACC), and inter-modal sEMG-ACC. To automatically adapt to various datasets, the ENAS framework is designed to automatically search a MHGR network with appropriate fusion positions and ratios. To the best of our knowledge, this is the first time that ENAS has been utilized in MHGR to tackle issues related to the fusion position and ratio of multimodal data. Experimental results demonstrate that AMF-ENAS achieves state-of-the-art performance on the Ninapro DB2, DB3, and DB7 datasets. Copyright © 2024, The Authors. All rights reserved.

关键词： Evolutionary algorithms

CA-Edit: Causality-Aware Condition Adapter for High-Fidelity Local Facial Attribute Editing

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Xian, Xiaole He, Xilin Niu, Zenghao Zhang, Junliang Xie, Weicheng Song, Siyang Yu, Zitong Shen, Linlin Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Key Laboratory of Intelligent Information Processing China University of Exeter United Kingdom Great Bay University China

For efficient and high-fidelity local facial attribute editing, most existing editing methods either require additional finetuning for different editing effects or tend to affect beyond the editing regions. Alternatively, inpainting methods can edit the target image region while preserving external areas. However, current inpainting methods still suffer from the generation misalignment with facial attributes description and the loss of facial skin details. To address these challenges, (i) a novel data utilization strategy is introduced to construct datasets consisting of attribute-text-image triples from a data-driven perspective, (ii) a Causality-Aware Condition Adapter is proposed to enhance the contextual causality modeling of specific details, which encodes the skin details from the original image while preventing conflicts between these cues and textual conditions. In addition, a Skin Transition Frequency Guidance technique is introduced for the local modeling of contextual causality via sampling guidance driven by low-frequency alignment. Extensive quantitative and qualitative experiments demonstrate the effectiveness of our method in boosting both fidelity and editability for localized attribute editing. The code is available at https://***/connorxian/CA-Edit. © 2024, CC BY.

关键词：

Paired 2-Disjoint Path Covers of Burnt Pancake Graphs with Faulty Elements

学校读者我要写书评

暂无评论

SSRN

SSRN 2024年

作者： Li, Pingshan Chen, Congzhen Liu, Xianglin Xiangtan University China School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China Key Laboratory of Intelligent Computing & Information Processing of Education China Key Laboratory for Computation and Simulation in Science and Engineering China National Center for Applied Mathematics in Hunan China Guangxi Vocational University of Agriculture Guangxi Nanning530007 China

It is a key issue in parallel processing to find $k$-disjoint paths in the underlying graph of an interconnected network such that these disjoint paths pass through all vertices of the network, this is known as paired $k$-disjoint path cover problems or unpaired $k$-disjoint path cover problems. In 2024, Dvo\v{r}\'{a}k and Gu (Theoretical Computer Science, $986 (2024) 114327$) showed that there exist two disjoint paths whose vertices partition the vertex of the burnt pancake graph even if it contains at most $n-4$ faulty elements (vertices or edges) and they proposed an open problem: is it possible to improve the upper bound $n-4$ to $n-3$? In this paper, we provide a positive answer to this problem. © 2024, The Authors. All rights reserved.

关键词： Hamiltonians

Privacy-Preserving Push-Pull Method for Decentralized Optimization via State Decomposition

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Cheng, Huqiang Liao, Xiaofeng Li, Huaqing Zhao, You Key Laboratory of Dependable Services Computing in Cyber Physical Society Ministry of Education College of Computer Science Chongqing University Chongqing400044 China Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing College of Electronic and Information Engineering Southwest University Chongqing400715 China

Distributed optimization is manifesting great potential in multiple fields, e.g., machine learning, control, and resource allocation. Existing decentralized optimization algorithms require sharing explicit state information among the agents, which raises the risk of private information leakage. To ensure privacy security, combining information security mechanisms, such as differential privacy and homomorphic encryption, with traditional decentralized optimization algorithms is a commonly used means. However, this would either sacrifice optimization accuracy or incur heavy computational burden. To overcome these shortcomings, we develop a novel privacy-preserving decentralized optimization algorithm, called PPSD, that combines gradient tracking with a state decomposition mechanism. Specifically, each agent decomposes its state associated with the gradient into two substates. One substate is used for interaction with neighboring agents, and the other substate containing private information acts only on the first substate and thus is entirely agnostic to other agents. For the strongly convex and smooth objective functions, PPSD attains a R-linear convergence rate. Moreover, the algorithm can preserve the agents’ private information from being leaked to honest-but-curious neighbors. Simulations further confirm the results. © 2023, CC BY.

关键词： Optimization

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-Preserving Talking Face Synthesis

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Deng, Kaijun Zheng, Dezhi Xie, Jindong Wang, Jinbao Xie, Weicheng Shen, Linlin Song, Siyang Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China Department of Computer Science University of Exeter United Kingdom

Accurately synthesizing talking face videos and capturing fine facial features for individuals with long hair presents a significant challenge. To tackle these challenges in existing methods, we propose a decomposed per-embedding Gaussian fields (DEGSTalk), a 3D Gaussian Splatting (3DGS)-based talking face synthesis method for generating realistic talking faces with long hairs. Our DEGSTalk employs Deformable Pre-Embedding Gaussian Fields, which dynamically adjust pre-embedding Gaussian primitives using implicit expression coefficients. This enables precise capture of dynamic facial regions and subtle expressions. Additionally, we propose a Dynamic Hair-Preserving Portrait Rendering technique to enhance the realism of long hair motions in the synthesized videos. Results show that DEGSTalk achieves improved realism and synthesis quality compared to existing approaches, particularly in handling complex facial dynamics and hair preservation. Our code will be publicly available at https://***/CVI-SZU/DEGSTalk. Copyright © 2024, The Authors. All rights reserved.

关键词： Gaussian distribution

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

A MULTI-CATEGORY INVERSE DESIGN NEURAL NETWORK AND ITS APPLICATION TO DIBLOCK COPOLYMERS

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Wei, Dan Zhou, Tiejun Huang, Yunqing Jiang, Kai Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China

In this work, we design a multi-category inverse design neural network to map ordered periodic structure to physical parameters. The neural network model consists of two parts, a classifier and Structure-Parameter-Mapping (SPM) subnets. The classifier is used to identify structure, and the SPM subnets are used to predict physical parameters for desired structures. We also present an extensible reciprocal-space data augmentation method to guarantee the rotation and translation invariant of periodic structures. We apply the proposed network model and data augmentation method to two-dimensional diblock copolymers based on the Landau-Brazovskii model. Results show that the multi-category inverse design neural network is high accuracy in predicting physical parameters for desired structures. Moreover, the idea of multi-categorization can also be extended to other inverse design *** Codes 68T07, 35R30, 35Q68, 74E15, 03C64 Copyright © 2022, The Authors. All rights reserved.

关键词： Block copolymers