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

A mixed structure of full-rate and low-detection complexity cooperative relay transmission scheme

Journal of Computational Information Systems 2014年第21期10卷 9339-9349页

作者： Jiang, Ran Meng, Fanzhi Li, Xiaohui Key Lab of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China

Since the single-antenna relay cooperative communication systems have a serious defect in reliability of data transmission, while the MIMO communication systems have difficulty in design and decoding, we propose a mixed structure of full-rate and low-detection complexity cooperative relay transmission scheme based on full-rate relay cooperative transmission model, which combines the advantages of cyclic delay diversity (CDD) technology and linear constellation precoding (LCP) technology. This scheme can excavation diversity gain by using single antenna terminal and multiple antenna simultaneously, moreover, the decoding complexity is low. The bit error rate (BER) performance is improved with the number of the antenna or the multipath or the relay nodes increases.

关键词： Cooperative communication

来源：评论

学校读者我要写书评

暂无评论

On dynamic weighting of data in clustering with K-alpha means

On dynamic weighting of data in clustering with K-alpha mean...

引用

2010 20th International Conference on Pattern Recognition, ICPR 2010

作者： Chen, Si-Bao Wang, Hai-Xian Luo, Bin Key Lab. of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei Anhui 230039 China Key Lab. of Child Development and Learning Science Research Center for Learning Science Southeast University Nanjing Jiangsu 210096 China

ISBN: (纸本)9780769541099

Although many methods of refining initialization have appeared, the sensitivity of K-Means to initial centers is still an obstacle in applications. In this paper, we investigate a new class of clustering algorithm, K-Alpha Means (KAM), which is insensitive to the initial centers. With K-Harmonic Means as a special case, KAM dynamically weights data points during iteratively updating centers, which deemphasizes data points that are close to centers while emphasizes data points that are not close to any centers. Through replacing minimum operator in K-Means by alpha-mean operator, KAM significantly improves the clustering performances. © 2010 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Consensus Disturbance Rejection of Nonlinear Multi-Agent Systems Over Cooperation-Competition Networks

Consensus Disturbance Rejection of Nonlinear Multi-Agent Sys...

引用

2021 China Automation Congress, CAC 2021

作者： Wang, Qiang He, Wangli Tan, Dayu Zhong, Weimin Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of Education East China University of Science and Technology Shanghai China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China

ISBN: (纸本)9781665426473

This study addresses the consensus problem for nonlinear multi-agent systems (MASs) under the exogenous disturbances over cooperation-competition networks. Firstly, for judging the disturbances produced by the exogenous environment, a disturbance observer-based approach is developed and incorporated into the controller. Secondly, two novel nonlinear control protocols depended on state feedback and output feedback control are constructed to guarantee consensus for MASs over the signed directed graph, respectively. Thirdly, theoretical guarantees on the effectiveness of the proposed controller in steering the system to a bipartite leader-following consensus with exogenous disturbances are derived. Finally, numerical simulations inspired by a real-world physical MAS are provided to illustrate the effectiveness of the proposed controllers. © 2021 IEEE

关键词： Feedback control

来源：评论

学校读者我要写书评

暂无评论

DisenGCD: A Meta Multigraph-assisted Disentangled Graph Learning Framework for Cognitive Diagnosis 38

DisenGCD: A Meta Multigraph-assisted Disentangled Graph Lear...

引用

38th Conference on Neural Information processing Systems, NeurIPS 2024

作者： Yang, Shangshang Chen, Mingyang Wang, Ziwen Yu, Xiaoshan Zhang, Panpan Ma, Haiping Zhang, Xingyi Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Anhui Hefei230601 China Anhui Province Key Laboratory of Intelligent Computing and Applications China Department of Information Materials and Intelligent Sensing Laboratory of Anhui Province China

Existing graph learning-based cognitive diagnosis (CD) methods have made relatively good results, but their student, exercise, and concept representations are learned and exchanged in an implicit unified graph, which makes the interaction-agnostic exercise and concept representations be learned poorly, failing to provide high robustness against noise in students' interactions. Besides, lower-order exercise latent representations obtained in shallow layers are not well explored when learning the student representation. To tackle the issues, this paper suggests a meta multigraph-assisted disentangled graph learning framework for CD (DisenGCD), which learns three types of representations on three disentangled graphs: student-exercise-concept interaction, exercise-concept relation, and concept dependency graphs, respectively. Specifically, the latter two graphs are first disentangled from the interaction graph. Then, the student representation is learned from the interaction graph by a devised meta multigraph learning module;multiple learnable propagation paths in this module enable current student latent representation to access lower-order exercise latent representations, which can lead to more effective nad robust student representations learned;the exercise and concept representations are learned on the relation and dependency graphs by graph attention modules. Finally, a novel diagnostic function is devised to handle three disentangled representations for prediction. Experiments show better performance and robustness of DisenGCD than state-of-the-art CD methods and demonstrate the effectiveness of the disentangled learning framework and meta multigraph module. The source code is availab.e at https://***/BIMK/intelligent-education/tree/main/DisenGCD. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A contourlet-based interpolation restoration method for super-resolution of SAR image

A contourlet-based interpolation restoration method for supe...

引用

2009 Asia-Pacific Conference on Synthetic Aperture Radar, APSAR 2009

作者： Zhang, Xiaohua Cao, Kun Jiao, Licheng Key Lab. of Intelligent Perception and Image Understanding of the Ministry of Education of China Institute of Intelligent Information Processing Xidian University Xi'an 710071 China

ISBN: (纸本)9781424427314

As is well known that the quality of a digital image is affected by many factors, such as the distance between the acquisition system and the object, the acquisition environment conditions, and the resolution of the image sensors employed, and so on. So how to obtain high quality images has become a difficult task in practical applications. Image super-resolution reconstruction (SRR) is a signal processing approach which can produces a high-resolution (HR) image from observed multiple low-resolution (LR) images. The purpose of this study is to evaluate the potential application of SR techniques to synthetic aperture radar (SAR). In this paper, a LR image is used to extract high frequency information and reconstruct a high resolution image by an interpolation- restoration method based on contourlet transform to solve the problem of SRR. Experimental results show that the method has the superior performance in subjective visual quality. ©2009 IEEE.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Policy iteration-based adaptive optimal control for Markov jump systems: a transition-probability-free asynchronous approach

引用

Science China(Information Sciences) 2024年第11期67卷 363-364页

作者： Weidi CHENG Chengcheng REN Shuping HE Changyin SUN Key Laboratory of Intelligent Computing and Signal Processing (Ministry of Education) School of Electrical Engineering and Automation Anhui University Anhui Engineering Laboratory of Human-Robot Integration System and Intelligent Equipment School of Electrical Engineering and Automation Anhui University Information Materials and Intelligent Sensing Laboratory of Anhui Province Engineering Research Center of Autonomous Unmanned System Technology (Ministry of Education) School of Artificial Intelligence Anhui University

The controller and filter design problems of Markov jump systems(MJSs) have gained significant attention over the past few decades. These studies include various aspects,including stochastic stabilization [1], optimal tracking control [2], and dissipative filter design [3]. Although numerous publications address the optimal controller design for MJSs, the issue of hidden MJSs, particularly those with mismatched jumping modes between the system and the controller, has rarely been explored.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Conditional Generative Adversarial Defogging Algorithm Based on Polarization Characteristics 33

Conditional Generative Adversarial Defogging Algorithm Based...

引用

第33届中国控制与决策会议

作者： Jingjing Zhang Kangsheng Bao Xin Zhang Fudong Nian Teng Li Yuzhou Zeng Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education (Anhui university) Key Laboratory of Polarized Light Imaging and Detection Technology in Anhui Province Hefei No.6 High School Hefei University

ISBN: (纸本)9781665431293

To overcome image degradation under the conditions of haze,and fog,a method using conditional generative adversarial defogging algorithm based on polarization characteristic is *** original images with different polarization angles were obtained from the original image,and then the polarization images were characterized using Stokes *** the relationship between Stokes vector and polarization image,each polarization image with different angles is input into the same network to extract *** the same time,the enhanced network is used to extract the characteristics of the fog area in the polarization image,and the polarization information is extracted by layer jump connection,which is fused with the image features of different *** constructing the loss function and obtaining the optimal solution,the fog-free image is finally *** results show that a clear image can be reconstructed in fog situations by using conditional generative adversarial network-based on polarization characteristics,and the structural similarity is improved by about 10%,the peak signal to noise ratio is increased by about 0.5.

关键词： polarization characteristics conditional generative adversarial network image processing image defogging feature fusion enhanced network

来源：评论

学校读者我要写书评

暂无评论

Dynamic clustering algorithm in mobile wireless sensor network

引用

Journal of Information and Computational Science 2015年第13期12卷 4897-4907页

作者： Wang, Bingting Liang, Hui Lin, Qibin Zhang, Yangyi Wang, Yujie Hong, Peilin Hu, Yanjun Department of Electronic and Electrical Engineering Chuzhou University Chuzhou China Department of Electronic Engineering and Information Science University of Science and Technology of China Hefei China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China

In this paper, we analyzed the blindness of traditional clustering algorithms, which select cluster head based on residual energy. Then we proposed the Dynamic Clustering Algorithm (DCA) in Mobile Wireless Sensor Network, which takes into consideration residual buffer level when selecting cluster heads and allots time slots dynamically base on the occupied buffer level. We analyzed the energy model of the proposed DCA algorithm and calculated the optimal distance between cluster heads. Simulation results show that our DCA clustering algorithm has good performances in terms of residual energy, data transmission and network lifetime by comparing it with LEACH and LEACH-CI. ©, 2015, Journal of Information and Computational Science. All right reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Person re-identification with density-distance unsupervised salience learning 8th

Person re-identification with density-distance unsupervised ...

引用

8th International Conference on Image and Graphics, ICIG 2015

作者： Zhou, Baoliang Zheng, Aihua Jiang, Bo Li, Chenglong Tang, Jin Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology AnHui University Hefei China Key Laboratory of Industry Image Processing and Analysis in Anhui Province Hefei China

ISBN: (纸本)9783319219684

Human salience of pedestrians images is distinctive and has been shown importantly in person re-identification (or pedestrians identification) problem. Thus, how to obtain the salient area of pedestrian images is important for this salience based pedestrians identification problem. In this paper, we first show that this kind of salient area detection can be formulated as a kind of outlier detection problem, and then propose a novel unsupervised salience learning method using a local outlier-detection technique for person re-identification task. The main feature of the proposed salience computation method is that it exploits both distance and density information simultaneously. Experimental results on several datasets show the effectiveness of the proposed salience based person re-identification method. © Springer International Publishing Switzerland 2015.

关键词： Statistics

来源：评论

学校读者我要写书评

暂无评论

On Isodual Double Toeplitz Codes

引用

Journal of Systems Science & Complexity 2024年第5期37卷 2196-2206页

作者： SHI Minjia XU Li SOLÉ Patrick Key Laboratory of Intelligent Computing and Signal Processing Ministry of EducationSchool of Mathematical SciencesAnhui UniversityHefei 230601China State Key Laboratory of Information Security Institute of Information EngineeringChinese Academy of SciencesBeijing 100093China CNRS University of Aix MarseilleCentrale MarseilleI2MMarseille 13284France

Double Toeplitz(shortly DT)codes are introduced here as a generalization of double circulant *** authors show that such a code is isodual,hence formally self-dual(FSD).FSD codes form a far-reaching generalization of self-dual codes,the most important class of codes of rate ***-dual DT codes are characterized as double circulant or double ***,even binary DT codes are characterized as double *** examples obtained by exhaustive search show that the codes constructed have best-known minimum distance,up to one unit,amongst formally self-dual codes,and sometimes improve on the known *** q=2,the authors find four improvements on the best-known values of the minimum distance of FSD *** F4 an explicit construction of DT codes,based on quadratic residues in a prime field,performs equally *** authors show that DT codes are asymptotically good over ***,the authors construct DT codes arbitrarily close to the asymptotic Varshamov-Gilbert bound for codes of rate one half.

关键词： Double circulant codes double Toeplitz codes isodual codes formally self-dual codes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：