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

19th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2024

作者： Chen, Jiebin Hu, Ziqiang Ye, Renjie Zhang, Qishan Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Xianda College of Economics and Humanities Shanghai International Studies University Shanghai China

ISBN: (纸本)9789819623723

Large-scale graphs have become prevalent with the advent of the big data era. Distributed graph computing systems are commonly used for processing and analyzing large-scale graphs, with graph partitioning being a key prerequisite for their efficient computation. Graph partitioning aims to balance the load across partitions while minimizing the number of cut-edges. Moreover, it should achieve high efficiency and scalability. However, the existing popular graph partitioning algorithms do not fully take into account the internal topology of real-world graphs, which affects the final partition quality and convergence. Meanwhile, they easily fall into the local optimum due to partition load constraints. This paper introduces a Novel Optimized Balanced Graph Partitioning algorithm (NOBGP). First, we propose an initialization strategy based on label propagation of core vertices to achieve initial partitions with good locality and accelerate convergence. Second, we optimize the label propagation process to ensure balanced partitions and propose a probability-based disruption strategy to avoid the local optimum. We implement NOBGP on the distributed graph computing framework GraphX. Extensive experimental results on real-world graphs show that the proposed algorithm is scalable and performs better than the existing algorithms. We also run PageRank and Louvain applications using the graph partitioning results to demonstrate the efficiency of our algorithm. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Multilevel Characteristic Basis Function Method with ACA for Accelerated Solution of Electrically Large Scattering Problems

引用

Transactions of Nanjing University of Aeronautics and Astronautics 2018年第3期35卷 449-454页

作者： Li Chenlu Sun Yufa Wang Zhonggen Wang Guohua Key Laboratory of Intelligent Computing & Signal Processing Ministry of EducationAnhui University College of Electrical and Information Engineering Anhui University of Science and Technology

The multilevel characteristic basis function method(MLCBFM)with the adaptive cross approximation(ACA)algorithm for accelerated solution of electrically large scattering problems is studied in this *** the conventional MLCBFM based on Foldy-Lax multiple scattering equations,the improvement is only made in the generation of characteristic basis functions(CBFs).However,it does not provide a change in impedance matrix filling and reducing matrix calculation procedure,which is *** reality,all the impedance and reduced matrix of each level of the MLCBFM have low-rank property and can be calculated ***,ACA is used for the efficient generation of two-level CBFs and the fast calculation of reduced matrix in this *** results are given to demonstrate the accuracy and efficiency of the method.

关键词： multilevel characteristic basis function method(MLCBFM) adaptive cross approximation(ACA) characteristic basis functions(CBFs) electromagnetic scattering

来源：评论

学校读者我要写书评

暂无评论

Optimal Ternary Cubic Two-Weight Codes

引用

Chinese Journal of Electronics 2018年第4期27卷 734-738页

作者： SHI Minjia HUANG Daitao SOL Patrick Key Laboratory of Intelligent Computing & Signal Processing Ministry of EducationAnhui University School of Mathematical Sciences Anhui University CNRS/LAGA University of Paris 8

We study trace codes with defining set L,a subgroup of the multiplicative group of an extension of degree m of a certain ring of order 27. These codes are abelian, and their ternary images are quasi-cyclic of coindex three(a.k.a. cubic codes). Their Lee weight distributions are computed by using Gauss sums. These codes have three nonzero weights when m is singly-even. When m is odd, under some hypothesises on the size of L, we obtain two new infinite families of two-weight codes which are optimal. Applications of the image codes to secret sharing schemes are also given.

关键词： Three-weight codes Two-weight codes Gauss sums Trace codes

来源：评论

学校读者我要写书评

暂无评论

Fusion of multi-spectral image and panchromatic image based on support vector regression

引用

Journal of Beijing Institute of Technology 2012年第2期21卷 269-277页

作者：胡根生梁栋 Key Laboratory of Intelligent Computing and Signal Processing Ministry of EducationAnhui University School of Electronics and Information Engineering Anhui University

In our study, support vector value contourlet transform is constructed by using support vector regression model and directional filter banks. The transform is then used to decompose source images at multi-scale, multi-direction and multi-resolution. After that, the super-resolved multi-spectral image is reconstructed by utilizing the strong learning ability of support vector regression and the correlation between multi-spectral image and panchromatic image. Finally, the super-resolved multi- spectral image and the panchromatic image are fused based on regions at different levels. Our experi- ments show that, the learning method based on support vector regression can improve the effect of super-resolution of multi-spectral image. The fused image preserves both high space resolution and spectrum information of multi-spectral image.

关键词： image processing image fusion support vector regression super-resolution

来源：评论

学校读者我要写书评

暂无评论

Analysis of asymptotically tight approximation SER for cooperative NOMA systems

引用

High Technology Letters 2021年第3期27卷 249-255页

作者： Xu Lei Cai Jing Yao Yijing Zhu Dingcheng Fang Hongyu Li Xiaohui Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui UniversityHefei 230039P.R.China

The closed-form formula derivation of the power domain cooperative non-orthogonal multiple access(NOMA)system is of great significance for further improving the performance of the ***,the system performance formulas of the channel capacity and the paired bit error rate pairwise error probability(PEP)are too complicated,which have increased the difficulty in system performance ***,based on the amplify forward(AF)relay cooperative NOMA model,the signal interference noise ratio(SINR)formulas of the two user nodes are *** the assumption of that,the symbol error rate(SER)of each user is fair,the simplification condition of moment generating function(MGF)with the harmonic mean form is *** with the SER calculation formula of MGF,the system SER asymptotically tight approximation formula with simple structure is derived at high signal-to-noise ratio(SNR).The Monte Carlo simulation results show that,the formula can accurately describe the SER performance of the power domain cooperative NOMA system with the non-ideal successive interference cancellation(SIC)system when SNR is *** the condition of certain total power,the optimal power allocation factor is solved in order to minimize the total system SER.

关键词： non-orthogonal multiple access(NOMA) amplify forward(AF) symbol error rate(SER) moment generating function(MGF)

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Transformer Network for Vehicle Detection

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Tian, Chunwei Liu, Kai Zhang, Bob Huang, Zhixiang Lin, Chia-Wen Zhang, David Harbin Institute of Technology School of Computer Science and Technology Harbin15001 China Macao Special Administrative Region of China PAMI Research Group University of Macau 999078 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Key Laboratory of Electromagnetic Environmental Sensing Hefei230601 China National Tsing Hua University Department of Electrical Engineering Institute of Communications Engineering Hsinchu Taiwan School of Data Science Shenzhen518172 China

Stable consumer electronic systems can assist traffic better. Good traffic consumer electronic systems require collaborative work between traffic algorithms and hardware. However, performance of popular traffic algorithms containing vehicle detection methods based on deep networks via learning data relation rather than learning differences in different lighting and occlusions is limited. In this paper, we present a dynamic Transformer network for vehicle detection (DTNet). DTNet utilizes a dynamic convolution to guide a deep network to dynamically generate weights to enhance adaptability of an obtained detector. Taking into relations of different information account, a mixed attention mechanism based channel attention and Transformer is exploited to strengthen relations of channels and pixels to extract more salient information for vehicle detection. To overcome the drawback of difference in an image account, a translation-variant convolution relies on spatial location information to refine obtained structural information for vehicle detection. Experimental results illustrate that our DTNet is competitive for vehicle detection. Code of the proposed DTNet can be obtained at https://***/hellloxiaotian/DTNet. © 2025 IEEE.

关键词： Dynamic convolution Hybrid Attention Mechanism Transformer Vehicle Detection

来源：评论

学校读者我要写书评

暂无评论

Design of observer-based discrete repetitive-control system based on 2D model

引用

Journal of Central South University 2014年第11期21卷 4236-4243页

作者：王昭鸿易灵芝兰永红陈才学 Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education (College of Information Engineering Xiangtan University)

A discrete observer-based repetitive control(RC) design method for a linear system with uncertainties was presented based on two-dimensional(2D) system theory. Firstly, a 2D discrete model was established to describe both the control behavior within a repetition period and the learning process taking place between periods. Next, by converting the designing problem of repetitive controller into one of the feedback gains of reconstructed variables, the stable condition was obtained through linear matrix inequality(LMI) and also the gain coefficient of repetitive system. Numerical simulation shows an exceptional feasibility of this proposal with remarkable robustness and tracking speed.

关键词： state observer two-dimensional discrete system repetitive control linear matrix inequality

来源：评论

学校读者我要写书评

暂无评论

Interblock-interference-free precoding using square-root decomposition for faster-than-Nyquist signaling

引用

Digital Communications and Networks 2025年

作者： Yan Wang Qiang Li Liping Li Yingsong Li Xingwang Li Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei 230601 China School of Physics and Electronic Information Engineering Henan Polytechnic University Jiaozuo China

Precodings using square-root decomposition, including Cholesky and G-To-Minus-Half (GTMH) precodings, are promising for eliminating the Faster-Than-Nyquist (FTN)-induced Intersymbol-Interference (ISI). However, the existing precodings using square-root decomposition either ignore Interblock-Interference (IBI) or increase the signal power, deteriorating the Bit Error Rate (BER) performance for high-order modulations and severe ISI. To overcome these drawbacks, we adopt two approaches for constructing the circular ISI matrix. The first approach inserts a Cyclic Prefix/Suffix (CPS) after each precoded symbol block, while the second approach replaces the linear convolution of the FTN shaping and the matched filter by the circular convolution, resulting in the Circular FTN (CFTN). Using these two approaches, we propose three IBI-free precodings, i.e., CPS-Cholesky, CFTN-Cholesky and CFTN-GTMH precodings. Furthermore, employing QR decomposition shows that the GTMH and Cholesky precodings can be converted interchangeably. Thus, we demonstrate that the GTMH precoding is essentially equivalent to the Cholesky precoding. Simulation results indicate that the BER performance of three IBI-free precodings approaches Nyquist performance for moderate ISI. However, as ISI intensifies, the CPS-Cholesky scheme increases the transmit power, causing BER performance degradation. In contrast, the CFTN-Cholesky and CFTN-GTMH precodings maintain optimal BER performance even for severe ISI. Considering 128-amplitude phase shift keying with a code rate of 1/2, the BER loss of CFTN-Cholesky and CFTN-GTMH precodings for the ideal BER of 10-5 is approximately 0.002 dB and 0.005 dB when packing factor is 0.7 and roll-off factor is 0.3. To the best knowledge of the authors, this is the optimal performance achievable through precoding.

关键词： Faster-than-Nyquist Intersymbol-interference Interblock-interference Bit error rate Precoding

来源：评论

学校读者我要写书评

暂无评论

Staggered Grid Scheme for the FFT-Based Methods

引用

Chinese Journal of Electronics 2019年第5期28卷 1066-1072页

作者： XIE Jiaye KONG Weibin PANG Lili SONG Weiju HUANG Zhixiang WU Xianliang Industrial Center Nanjing Institute of Technology State Key Laboratory of Millimeter Waves College of Information Engineering Yancheng Institute of Technology Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University

A staggered grid scheme is proposed to reduce both the total memory requirement and the CPU time of generating the corrected near matrix in the FFTbased methods. Two sets of Cartesian grids are used to project the source points and the field points, *** proposed method does not lower the efficiency of computing far matrix-vector products, compared with the traditional uniform Cartesian grid scheme. Some numerical experiments are provided to demonstrate both the correctness and the efficiency of the proposed method.

关键词： Green’s function Singularity RFG-FFT Staggered grid scheme Corrected near matrix

来源：评论

学校读者我要写书评

暂无评论

Joint utility optimization algorithm for secure hybrid spectrum sharing

引用

High Technology Letters 2022年第4期28卷 373-383页

作者： WANG Yi HUANG Rong XU Yaohua JIANG Fang BAI Na TANG Tao HU Yanjun Key Laboratory of Intelligent Computing&Signal Processing Ministry of EducationAnhui UniversityHefei 230601P.R.China

As the rapid development of wireless communication networks has resulted in better user experiences,the spectrum resources occupied and energy consumption have increased considerably and resulted in great *** address the energy consumption and cost problems of spectrum sharing in cognitive radio networks,a hybrid spectrum sharing model combining the free spectrum of authorized users and the leased spectrum of mobile network operators is *** on the hybrid model,a function of throughput and costs,including energy consumption and transaction costs,is constructed,and a joint utility optimization problem is *** transactions between secondary users and primary users are performed on the consortium blockchain on which users can directly trade spectrum and the transaction information is *** order to improve the joint utility,the Lagrange multiplier method is used to achieve the optimal solution for the sensing time,the number of secondary users involved in sensing,and the transmission *** simulation results show that the joint utility optimization algorithm proposed in this paper can achieve higher joint utility under the constraints of the minimum throughput requirement and maximum transmission power.

关键词： spectrum sharing power control joint utility blockchain

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：