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

SSRN 2023年

作者： Huang, Zhenhua Zhou, Wenhao Li, Kunhao Jia, Zhaohong School of Internet Anhui University Feixi Road Hefei230039 China Key Lab of Intelligent Computing and Signal Processing of Ministry of Education Hefei China

Graph neural networks (GNNs) have shown great success in graph processing. However, current message-passing-based GNNs have limitations in feature aggregations and update mechanisms that rely on a fixed mode, resulting in inadequate representations of the neighborhood structure's richness. Furthermore, the convolution layer in most GNNs lacks flexibility and multi-channels compared to convolutional neural networks (CNNs). CNNs employ multiple channels, where different kernels capture shared patterns of images. To address the limitations, we propose a novel scalab.e graph convolution network (SGCN). SGCN enhances structural information learning by introducing an expressive feature aggregation mechanism. Drawing inspiration from the design of CNNs, SGCN designs graph-shaped kernels to perform multi-channel convolutions on the subgraph structure. A sampler based on degree centrality is employed to simplify the computation costs. Extensive experiments demonstrate that SGCN achieved state-of-the-art performances on various scales of graph datasets (accuracy improved up to 5.38%). © 2023, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

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

arXiv

引用

arXiv 2024年

作者： Yang, Shangshang Chen, Mingyang Wang, Ziwen Yu, Xiaoshan Zhang, Panpan Ma, Haiping Zhang, Xingyi Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Anhui Hefei230601 China Anhui Province Key Laboratory of Intelligent Computing and Applications China Department of Information Materials 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. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Distributed solving Sylvester equations with fractional order dynamics

引用

Control Theory and Technology 2021年第2期19卷 249-259页

作者： Songsong Cheng Shu Liang Yuan Fan Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Electrical Engineering and AutomationAnhui UniversityHefei230601AnhuiChina Key Laboratory of Knowledge Automation for Industrial Processes of Ministry of Education School of Automation and Electrical EngineeringUniversity of Science and Technology BeijingBeijing100083China

This paper addresses distributed computation Sylvester equations of the form AX+XB=C with fractional order *** partitioning parameter matrices A,B and C,we transfer the problem of distributed solving Sylvester equations as two distributed optimization models and design two fractional order continuous-time algorithms,which have more design freedom and have potential to obtain better convergence performance than that of existing first order ***,rewriting distributed algorithms as corresponding frequency distributed models,we design Lyapunov functions and prove that proposed algorithms asymptotically converge to an exact or least squares ***,we validate the effectiveness of proposed algorithms by providing a numerical example.

关键词： Fractional order calculus Distributed optimization Sylvester equation Frequency distributed model Convergence

来源：评论

学校读者我要写书评

暂无评论

A Multi-Stage Expensive Constrained Multi-Objective Optimization Algorithm Based on Ensemble Infill Criterion

引用

IEEE Transactions on Evolutionary Computation 2024年 1-1页

作者： Wu, Haofeng Chen, Qingda Chen, Jiaxin Jin, Yaochu Ding, Jinliang Zhang, Xingyi Chai, Tianyou State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang China School of Computer Science and Technology Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China

Surrogate-assisted evolutionary algorithms (SAEAs) rely on the infill criterion to select candidate solutions for expensive evaluations. However, in the context of expensive constrained multi-objective optimization problems (ECMOPs) with complex feasible regions, guiding the optimization algorithm towards the constrained Pareto optimal front and achieving a balance between feasibility, convergence, diversity, exploration, and exploitation using a single infill criterion pose significant challenges. We propose an ensemble infill criterion-based multi-stage SAEA (EIC-MSSAEA) to tackle these challenges. Specifically, EIC-MSSAEA comprises three stages. In the first stage, we ignore constraints to facilitate the rapid traversal of infeasible obstacles. In the second stage, only one constraint is activated at a time to increase algorithm diversity. Finally, in the last stage, we activate all constraints to improve overall feasibility. In each stage, EIC-MSSAEA first employs NSGA-III as the underlying baseline solver to explore the search space, in which promising solutions are then selected by an ensemble infill criterion that incorporates multiple base-infill criteria to measure the feasibility, convergence, diversity, and uncertainty of candidate solutions. Experimental results demonstrate the competitiveness of EIC-MSSAEA against state-of-the-art SAEAs for ECMOPs. IEEE

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

An ultra-wideband high-isolation dual-port MIMO antenna design

An ultra-wideband high-isolation dual-port MIMO antenna desi...

引用

International Applied Computational Electromagnetics Society Symposium (ACES)

作者： Shuangqing Cao Minquan Li Zhenfa Zi Zhonghui Li Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei China School of Physics and Materials Engineering Hefei Normal University Hefei China

ISBN: (数字)9798350355581

ISBN: (纸本)9798350355598

In this paper, an antenna for ultra-wideband multiple-input and multiple-output (UWB-MIMO) is designed. The design comprises two hexagonal monopole antennas. In order to achieve ultra-wideband characteristics and mitigate the coupling, a stepped microstrip line structure for impedance matching and T-shaped defective ground structure are employed, which optimizes the broadband characteristics and achieves high isolation characteristics. The antenna achieves a wide impedance bandwidth of 3.5 GHz to 13.9 GHz (relative bandwidth of 119%). Furthermore, the isolation between the two feed ports of the antenna exceeds 18 dB, the envelope correlation coefficient (ECC) is less than 0.012, and it exhibits favorable radiation characteristics.

关键词： Correlation coefficient Time-frequency analysis Impedance matching Bandwidth Microstrip antennas Ultra wideband antennas Envelope detectors Impedance Microstrip Gain

来源：评论

学校读者我要写书评

暂无评论

Dual-layer Broadband High-gain Circularly Polarized Patch Antenna with L-shaped Stub

Dual-layer Broadband High-gain Circularly Polarized Patch An...

引用

2023 IEEE International Workshop on Electromagnetics: Applications and Student Innovation Competition, iWEM 2023

作者： Li, Wen Xue, Wei Li, Yingsong Loh, Tian Hong Chung, Kwok L. Harbin Engineering University College of Information and Communication Engineering Harbin150001 China Anhui University The Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Hefei China National Physical Laboratory Electromagnetic and Eletrochemical Technologies Department Middlesex United Kingdom Huizhou University School of Computing Science and Engineering Huizhou516007 China

ISBN: (纸本)9798350336740

This paper introduced a dual-layer broadband high-gain circularly polarized (CP) antenna. The proposed broadband CP antenna consists of the radiating patch and couping structure, which is made up of opening slot patch and L-shaped stub. An axial-ratio bandwidth of 26 % (4.36-5.66 GHz) is shown by this proposed dual-layer CP patch antenna with a simulated -10-dB reflection coefficient bandwidth of 37 % (4.23-6.15 GHz). The broadband characteristics offered by this CP antenna are promising for a wide range of future applications. © 2023 IEEE.

关键词： Microstrip antennas

来源：评论

学校读者我要写书评

暂无评论

An Empirical Study on Neural Networks Pruning: Trimming for Reducing Memory or Workload

An Empirical Study on Neural Networks Pruning: Trimming for ...

引用

Data-driven Optimization of Complex Systems (DOCS), International Conference on

作者： Kaiwen Xiao Xiaodong Cai Ke Xu School of Artificial Intelligence Anhui University Hefei China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Hefei China

Most of existing studies on neural network pruning only consider memory-based pruning strategies. However pruning for computational workload is often more important in hardware deployments due to a greater focus on model computation reductions. In addition, most pruning schemes restore model accuracy during pruning at the expense of adding hyperparameters, extending training time and training complexity. This work proposes a statistical-based globally soft iterative pruning scheme. With little extra calculation, an extremely sparse model can be obtained without additional hyperparameters and extended training time. Moreover, this work proposes the concept of computational intensity to balance model memory and computational workload during pruning. Focusing on memory orientated pruning, we can achieve $\mathbf{303}\times, \mathbf{100}\times$ and $\mathbf{25}\times$ parameter compression on LeNet-5 (MNIST), VGG (CIFAR-10) and AlexNet (ImageNet) models, respectively. In particular, combined with cluster quantization, the LeNet-5 model parameters can be compressed to $\mathbf{3232}\times$ . Focusing on workload orientated pruning, we can reduce the computation by $\mathbf{7}.\mathbf{6}\times$ on the AlexNet model, without accuracy loss, significantly higher than prior work. In addition, in order to verify the versatility of the pruning method, we also migrate the pruning task to the object detection and implement $\mathbf{10}\times$ parameter compression and $\mathbf{2}.\mathbf{8}\times$ computation compression for YOLOv2 with reduced mAP within 1%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Electrochemical protein biosensors for disease marker detection:progress and opportunities

引用

Microsystems & Nanoengineering 2024年第3期10卷 1-20页

作者： Lanpeng Guo Yunong Zhao Qing Huang Jing Huang Yanbing Tao Jianjun Chen Hua-Yao Li Huan Liu School of Integrated Circuits Wuhan National Laboratory for OptoelectronicsOptics Valley LaboratoryHuazhong University of Science and TechnologyWuhan 430074China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Integrated CircuitsAnhui UniversityHefei 230601China School of Optoelectronic Materials and Technology Jianghan UniversityWuhan 430056China Department of Otorhinolaryngology Union HospitalTongji Medical CollegeHuazhong University of Science and Technology1277 Jiefang AvenueWuhan 430022China Wenzhou Institute of Advanced Manufacturing Technology Huazhong University of Science and TechnologyWenzhou 325000China

The development of artificial intelligence-enabled medical health care has created both opportunities and challenges for next-generation biosensor *** are extensively used as biological macromolecular markers in disease diagnosis and the analysis of therapeutic *** protein biosensors have achieved desirable specificity by using the specific antibody–antigen binding principle in ***,the active centers of protein biomarkers are surrounded by a peptide matrix,which hinders charge transfer and results in insufficient sensor ***,electrode-modified materials and transducer devices have been designed to increase the sensitivity and improve the practical application prospects of electrochemical protein *** this review,we summarize recent reports of electrochemical biosensors for protein biomarker *** highlight the latest research on electrochemical protein biosensors for the detection of cancer,viral infectious diseases,inflammation,and other *** corresponding sensitive materials,transducer structures,and detection principles associated with such biosensors are also addressed ***,we present an outlook on the use of electrochemical protein biosensors for disease marker detection for the next few years.

关键词： diagnosis specificity Electrochemical

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Neural Architecture Search for Transformer in Knowledge Tracing

arXiv

引用

arXiv 2023年

作者： Yang, Shangshang Yu, Xiaoshan Tian, Ye Yan, Xueming Ma, Haiping Zhang, Xingyi Anhui University China Guangdong University of Foreign Studies China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education China

Transformer has achieved excellent performance in the knowledge tracing (KT) task, but they are criticized for the manually selected input features for fusion and the defect of single global context modelling to directly capture students’ forgetting behavior in KT, when the related records are distant from the current record in terms of time. To address the issues, this paper first considers adding convolution operations to the Transformer to enhance its local context modelling ability used for students’ forgetting behavior, then proposes an evolutionary neural architecture search approach to automate the input feature selection and automatically determine where to apply which operation for achieving the balancing of the local/global context modelling. In the search space design, the original global path containing the attention module in Transformer is replaced with the sum of a global path and a local path that could contain different convolutions, and the selection of input features is also considered. To search the best architecture, we employ an effective evolutionary algorithm to explore the search space and also suggest a search space reduction strategy to accelerate the convergence of the algorithm. Experimental results on the two largest and most challenging education datasets demonstrate the effectiveness of the architecture found by the proposed approach. Copyright © 2023, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

A Simple Controllab.e Left-Right-Hand Circularly Polarized Antenna for GPS L2 Using Arc-like Slots

A Simple Controllable Left-Right-Hand Circularly Polarized A...

引用

IEEE Asia-Pacific Conference on Antennas and Propagation (APCAP)

作者： Lulu Meng Sixian Qian Zhixiang Huang Yingsong Li Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University China

A single-layer, polarization adjustable circular-polarization (CP) antenna with four arc-like slots has been designed for GPS L2 band. The created antenna uses four arc-like slots to tune the phase difference to form a CP antenna, where the arc-like slots with a specific size relationship are etched on the patch. By adjusting the radius of the arc-like slots, Left-handed -circular-polarization (LHCP) and Right-handed-circular-polarization (RHCP) can be realized easily with simple structure. Simulations and optimizations show that the constructed CP-antenna has a good axial-ratio bandwidth of 10 MHz and impedance-bandwidth of 40 MHz and 30 MHz for LHCP and RHCP application.

关键词： Polarization Slot antennas Bandwidth Directive antennas Antenna feeds Optimization Global Positioning System

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：