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

Generalized-Extended-State-Observer and Equivalent-Input-Disturbance Methods for Active Disturbance Rejection: Deep Observation and Comparison

引用

IEEE/CAA Journal of Automatica Sinica 2023年第4期10卷 957-968页

作者： Jinhua She Kou Miyamoto Qing-Long Han Min Wu Hiroshi Hashimoto Qing-Guo Wang School of Engineering Tokyo University of TechnologyHachiojiTokyo 192-0982Japan K.Miyamoto is with the Institute of Technology Shimizu CorporationKotoTokyo 135-0044Japan School of Science Computing and Engineering TechnologiesSwinburne University of TechnologyMelbourneVIC 3122Australia School of Automation China University of GeosciencesWuhan 430074 Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of EducationWuhan 430074China School of Industrial Technology Advanced Institute of Industrial TechnologyTokyo 140-0011Japan Institute of Artificial Intelligence and Future Networks Beijing Normal UniversityZhuhai 519087 Guangdong Key Lab of AI and Multi-Modal Data Processing Guangdong Provincial Key Laboratory of Interdisciplinary Research and Application for Data Science BNUHKBU United International College Zhuhai 519087China

Active disturbance-rejection methods are effective in estimating and rejecting disturbances in both transient and steady-state *** paper presents a deep observation on and a comparison between two of those methods:the generalized extended-state observer(GESO)and the equivalent input disturbance(EID)from assumptions,system configurations,stability conditions,system design,disturbance-rejection performance,and extensibility.A time-domain index is introduced to assess the disturbance-rejection performance.A detailed observation of disturbance-suppression mechanisms reveals the superiority of the EID approach over the GESO method.A comparison between these two methods shows that assumptions on disturbances are more practical and the adjustment of disturbance-rejection performance is easier for the EID approach than for the GESO method.

关键词： Active disturbance-rejection control(ADRC) disturbance observer(DOB) equivalent input disturbance(EID) extendedstate observer(ESO) generalized extended-state observer(GESO)

来源：评论

学校读者我要写书评

暂无评论

TFGDA: Exploring Topology and Feature Alignment in Semi-supervised Graph Domain Adaptation through Robust Clustering 38

TFGDA: Exploring Topology and Feature Alignment in Semi-supe...

引用

38th Conference on Neural Information processing Systems, NeurIPS 2024

作者： Dan, Jun Liu, Weiming Xie, Chunfeng Yu, Hua Dong, Shunjie Tan, Yanchao Zhejiang University China Queen Mary University of London United Kingdom Dalian University of Technology China Shanghai Jiao Tong University China Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China Fujian Key Laboratory of Network Computing and Intelligent Information Processing China

Semi-supervised graph domain adaptation, as a branch of graph transfer learning, aims to annotate unlabeled target graph nodes by utilizing transferable knowledge learned from a label-scarce source graph. However, most existing studies primarily concentrate on aligning feature distributions directly to extract domain-invariant features, while ignoring the utilization of the intrinsic structure information in graphs. Inspired by the significance of data structure information in enhancing models' generalization performance, this paper aims to investigate how to leverage the structure information to assist graph transfer learning. To this end, we propose an innovative framework called TFGDA. Specially, TFGDA employs a structure alignment strategy named STSA to encode graphs' topological structure information into the latent space, greatly facilitating the learning of transferable features. To achieve a stable alignment of feature distributions, we also introduce a SDA strategy to mitigate domain discrepancy on the sphere. Moreover, to address the overfitting issue caused by label scarcity, a simple but effective RNC strategy is devised to guide the discriminative clustering of unlabeled nodes. Experiments on various benchmarks demonstrate the superiority of TFGDA over SOTA methods. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Gradient-Based Differential kWTA Network With Application to Competitive Coordination of Multiple Robots

引用

IEEE/CAA Journal of Automatica Sinica 2022年第8期9卷 1452-1463页

作者： Mei Liu Xiaoyan Zhang Mingsheng Shang Long Jin School of Information Science and Engineering Lanzhou UniversityLanzhou 730000 State Key Laboratory of Tibetan Intelligent Information Processing and Application Xining 810016China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714China Shenzhen Research Institute Lanzhou UniversityShenzhen 518063China

Aiming at the k-winners-take-all(kWTA)operation,this paper proposes a gradient-based differential kWTA(GDk WTA)*** obtaining the network,theorems and related proofs are provided to guarantee the exponential convergence and noise resistance of the proposed GD-kWTA ***,numerical simulations are conducted to substantiate the preferable performance of the proposed network as compared with the traditional ***,the GD-k WTA network,backed with a consensus filter,is utilized as a robust control scheme for modeling the competition behavior in the multi-robot coordination,thereby further demonstrating its effectiveness and feasibility.

关键词： Consensus filter k-winners-take-all(kWTA) multirobot coordination noise resistance

来源：评论

学校读者我要写书评

暂无评论

A Time-Efficient Distributed Constant Conditional Functional Dependency Discovery Algorithm for data Consistency

A Time-Efficient Distributed Constant Conditional Functional...

引用

IEEE Annual International Computer Software and Applications Conference (COMPSAC)

作者： Junchao Chen Jian-tao Zhou Xinyu Hao Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Engineering Laboratory for Big Data Analysis Technology College of Computer Science Inner Mongolia University Engineering Research Center of Ecological Big Data Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Hohhot China

ISBN: (数字)9798350376968

ISBN: (纸本)9798350376975

The accuracy of data analysis depends on data quality, and addressing data consistency issues is a key challenge to improve it. Constant Conditional Functional Dependency (CCFD) is an effective approach that ensures data consistency by enforcing bindings of semantically related values, thus providing quality assurance for data analysis and decision-making processes. However, with the growth of data scale, especially the increasing number of data tuples and attributes, existing single-machine CCFD discovery algorithms face issues of low computational efficiency and lengthy computation time. This paper proposes a time-efficient distributed CCFD discovery algorithm (DCCFD). Through the optimization of data preprocessing and index mapping, the data organization structure is enhanced, laying the foundation for the discovery of CCFDs under distributed conditions. The Spark parallel computing framework is used to partition the dataset, which accelerates the parallel loading and processing of data. Additionally, this algorithm ensures accuracy and processing speed when discovering dependencies by efficiently generating frequent itemsets and verifying CCFDs in parallel. Experiments on multiple real datasets show that, especially with the complex Airline dataset, the DCCFD algorithm not only accurately discovers CCFDs, but also reduces the average running time by 75.64% compared with the preCFDMiner algorithm.

关键词： Accuracy data preprocessing Software algorithms Distributed databases Parallel processing Software Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Simple and Efficient Knowledge Graph Attention Network for Recommendation

Simple and Efficient Knowledge Graph Attention Network for R...

引用

2023 International Conference on Cyber-Physical Social Intelligence, ICCSI 2023

作者： Li, Yangding Fu, Shaobin Feng, Hao Zeng, Yangyang Wang, Jinghao Jiang, Zhihao Zhang, Lvyun Hunan Provincial Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University School of Information Science and Engineering Changsha China Shenzhen Lazada Software Technology Company Limited Shenzhen China Hechi University School of Big Data and Computer Science Guangxi China

ISBN: (纸本)9798350312492

Existing methods for modeling recommendation systems based on knowledge graphs include embedding-based, pathbased, and propagation-based methods. The embedding-based approach is flexible but more suitable for intra-graph applications, the path-based approach can model complex relationships but has a high computational cost, and the propagation-based approach considers global information but may introduce noise. This study proposed a simple and efficient model, called SEKGAT, which comprehensive the ideology of path-based and propagation approach to personalized recommendation by aggregating the user preferences through graph attention mechanism and fusing multiple feature representations on the knowledge graph into item features through pooling aggregators. Experimental results for the CTR prediction and Top-K recommendation tasks on three datasets of real-world scenarios show that our model approach is competitive. © 2023 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Efficient QoS data Prediction Based on Tensor Kernel Paradigm-Tensor Decomposition

Efficient QoS Data Prediction Based on Tensor Kernel Paradig...

引用

International Conference on Networking and Network Applications (NaNA)

作者： Hong Xia Jing Xu Qingyi Dong Hui Jia Yanping Chen Xi’an Key Laboratory of Big Data and Intelligent Computing Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing School of Computer Science and Technology Xi’an University of Posts and Telecommunications Xi’an Shaanxi China

ISBN: (数字)9798350376777

ISBN: (纸本)9798350376784

In the Mobile Edge computing (MEC) environment, the prediction efficiency is low when user recommendation is based on Quality of Service (QoS) data due to network environment and other factors. Traditional methods use Collaborative Filtering (CF) or tensor decomposition methods to mine the relationship between historical QoS data for prediction, but there are problems with prediction accuracy and efficiency. Given this, this paper proposes an efficient QoS data prediction method (CTT) combining tensor kernel paradigm-tensor decomposition. The method first introduces the tensor kernel norm to approximate the tensor rank function to better capture the spatio-temporal correlation of real QoS data; Second, tensor decomposition is combined to address inefficiencies. Experimental results on the public QoS dataset WS-Dream show that the method significantly improves the runtime while guaranteeing prediction accuracy and applies to scenarios with different data missing densities.

关键词： Tensors Accuracy Runtime Multi-access edge computing Computational modeling Quality of service Predictive models

来源：评论

学校读者我要写书评

暂无评论

GLSNet: A Global Guided Local Feature Stepwise Aggregation Network for polyp segmentation

引用

Biomedical Signal processing and Control 2024年 87卷

作者： Pan, Xiaoying Ma, Chenyang Mu, Yaya Bi, Manrong Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi‘an710121 China Xi'an Key Laboratory of Big Data and Intelligent Computing Xi‘an710121 China School of Computer Science & Technology Xi'an University of Post & Telecommunications Xi‘an710121 China

Accurate polyp segmentation is of great significance for the prevention and diagnosis of early colon cancer. Transformer-based image segmentation models have been proposed for polyp segmentation with good results, however, these methods do not sufficiently consider the negative impact of background noise in different levels of features, resulting in the loss of local details. To alleviate this problem, we propose a GLSNet (A Global Guided Local Feature Stepwise Aggregation Network for polyp segmentation) network, including a spatial feature enhancement (SFE) module, a globally guided local feature enhancement (GLFE) module, and a feature stepwise aggregation (FSA) module. SFE can enhance the spatial feature representation of polyps to better capture the polyp information in the features. GLFE uses high-level features to filter noise in low-level features to capture polyp information hidden in shallow features;FSA fuses the semantic and positional information of polyps across scales to obtain the final segmentation results. Qualitative and quantitative experiments were conducted on 7 benchmark datasets, and the experimental results demonstrated that GLSNet outperforms other existing methods and has stronger generalization performance. In particular, we achieved a mean Dice of 92.9% on the large-scale Kvasir dataset, and mean Dice of 81.3% and 81.6% on CVC-ColonDB and ETIS, respectively, which are significantly higher than those of the competing methods. © 2023

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Graph Prompt Clustering

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年第7期47卷 5794-5805页

作者： Chen, Man-Sheng Lai, Pei-Yuan Liao, De-Zhang Wang, Chang-Dong Lai, Jian-Huang Sun Yat-sen University School of Computer Science and Engineering Guangzhou510275 China Guangxi Zhuang Autonomous Region Information Center Guangxi Key Laboratory of Digital Infrastructure Nanning530219 China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou510006 China Ministry of Education Key Laboratory of Machine Intelligence and Advanced Computing Beijing100816 China South China Technology Commercialization Center Guangzhou510006 China Guangdong University of Technology School of Information Engineering Guangzhou510006 China Guangdong Key Laboratory of Information Security Technology Guangzhou510033 China Ministry of Education Beijing100044 China

Due to the wide existence of unlabeled graph-structured data (e.g., molecular structures), the graph-level clustering has recently attracted increasing attention, whose goal is to divide the input graphs into several disjoint groups. However, the existing methods habitually focus on learning the graphs embeddings with different graph reguralizations, and seldom refer to the obvious differences in data distributions of distinct graph-level datasets. How to characteristically consider multiple graph-level datasets in a general well-designed model without prior knowledge is still challenging. In view of this, we propose a novel Graph Prompt Clustering (GPC) method. Within this model, there are two main modules, i.e., graph model pretraining as well as prompt and finetuning. In the graph model pretraining module, the graph model is pretrained by a selected source graph-level dataset with mutual information maximization and self-supervised clustering regularization. In the prompt and finetuning module, the network parameters of the pretrained graph model are frozen, and a groups of learnable prompt vectors assigned to each graph-level representation are trained for adapting different target graph-level datasets with various data distributions. Experimental results across six benchmark datasets demonstrate the impressive generalization capability and effectiveness of GPC compared with the state-of-the-art methods. © 1979-2012 IEEE.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

Text Matching application for integration between industry and education 14

Text Matching application for integration between industry a...

引用

14th International Conference on Measuring technology and Mechatronics Automation, ICMTMA 2022

作者： Luo, Yuxuan Li, Xiaoge School of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Shaanxi Xi'an710121 China Xi'an Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi'an710121 China

ISBN: (纸本)9781665499781

A new talent training mode of collaboration between industry and education was proposed, which aims to reduce the gaps of talent definition between enterprise demand and college education. We formulates scenario as a text matching task of similarity between courses details and job position information, developed a ERNIE+DPCNN based model for the task. The model has been benchmarked on LCQMC dataset, the results show that it achieves the art-of state performance of Acc 0.8809, Recall 0.8745, and FX score 0.8739, We conducted many experiments about the text similarity calculation between domains of industry and educations. The experiment results show our approach has much potential to optimize the curriculum system while applying in this field. © 2022 IEEE

关键词： Industries Training Mechatronics Automation Collaboration Benchmark testing Task analysis

来源：评论

学校读者我要写书评

暂无评论

PSMiner: A Pattern-Aware Accelerator for High-Performance Streaming Graph Pattern Mining 23

PSMiner: A Pattern-Aware Accelerator for High-Performance St...

引用

Proceedings of the 60th Annual ACM/IEEE Design Automation Conference

作者： Hao Qi Yu Zhang Ligang He Kang Luo Jun Huang Haoyu Lu Jin Zhao Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China and Zhejiang-HUST Joint Research Center for Graph Processing Zhejiang Lab China Department of Computer Science University of Warwick United Kingdom

ISBN: (纸本)9798350323481

Streaming Graph Pattern Mining (GPM) has been widely used in many application fields. However, the existing streaming GPM solution suffers from many unnecessary explorations and isomorphism tests, while the existing static GPM ones require many repetitive operations to compute the full graph. In this paper, we propose a pattern-aware incremental execution approach and design the first streaming GPM accelerator called PSMiner, which integrates multiple optimizations to reduce redundant computation and improve computing efficiency. We have conducted extensive experiments. The results show that compared with the state-of-the-art software and hardware solutions, PSMiner achieves the average speedups of 770.9× and 60.4×, respectively.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：