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

Chinese Automation Congress (CAC)

作者： Liu Hu Luefeng Chen Jie Hu Min Wu Witold Pedrycz Kaoru Hirota School of Automation China University of Geosciences Wuhan China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems and the Engineering Research Center of Intelligent Technology for Geo-Exploration School of Automation Ministry of Education China University of Geosciences Wuhan China Department of Electrical and Computer Engineering University of Alberta Edmonton Canada Systems Research Institute Polish Academy of Sciences Warsaw Poland The Department of Computer Engineering Istinye University Sariyer/Istanbul Turkey Tokyo Institute of Technology Yokohama Japan The Tokyo Institute of Technology Tokyo Japan

In the process of steel plate production, predicting the plate shape is of great significance for producing high-quality and consistently stable plate shapes. This paper presents a model that predicts both the defect types and flatness of the plate, providing theoretical support for setting process parameters in roller quenching production. First, the parameters of the quenching process are analyzed to identify their characteristics. Then, the K-Means clustering algorithm and correlation analysis are employed to process the quenching process parameters. A gradient boosting decision tree (GBDT) model is used to predict the defect types and flatness of the steel plates. Finally, industrial production data is utilized for experimental validation. The obtained experimental results verify the reliability of the proposed method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Di-Graphgan: An Enhanced Adversarial Learning Framework for Accurate Spatial-Temporal Traffic Forecasting Under Data Missing Scenarios

SSRN

引用

SSRN 2023年

作者： Li, Lincan Bi, Jichao Yang, Kaixiang Luo, Fengji School of Control Science and Engineering Zhejiang University Hangzhou310012 China Zhejiang Institute of Industry and Information Technology Hangzhou310012 China School of Computer Science and Engineering South China University of Technology Guangzhou510641 China School of Civil Engineering The University of Sydney Sydney2006 Australia

Nowadays, various disturbances in urban transportation data acquisition/processing/storage lead to the inevitable data missing problem, which undermines the valuable traffic information and greatly threats the reliability of existing benchmark traffic prediction models. Inspired from the powerful generative learning ability of GANs, we propose an integrated spatiotemporal Data imputation Graph Attention Generative Adversarial Networks (Di-GraphGAN) for accurate and efficient spatial-temporal traffic forecasting under data missing scenarios. Specifically, we first propose a traffic data imputation module named DI-LSTM, which adopts the architecture of LSTM Network with an extra Time Damping unit to accurately estimating the missing values. Then, we facilitate Di-GraphGAN with an original developed Task-Efficient Graph Attention Networks (TE-GAT) for better graph representation learning and a Temporal Contextual Attention (TCA) mechanism to capture the dynamic spatiotemporal traffic patterns. Finally, extensive evaluations are conducted on two real-world traffic speed datasets from China, demonstrating that Di-GraphGAN achieves state-of-the-art performance in both traffic forecasting and spatiotemporal data imputation tasks. © 2023, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

A Formation control for Multi-Agent Systems for Event-Trigger-Based Variable Gain controllers

A Formation Control for Multi-Agent Systems for Event-Trigge...

引用

Annual Conference of Industrial Electronics Society

作者： Daiki Asada Takuya Nakagawa Yoshikatsu Hoshi Hidetoshi Oya Shunya Nagai Graduate School of Integrative Science and Engineering Tokyo City University Tokyo Japan The Department of Computer Science Tokyo City University Tokyo Japan Department of Electronics and Control Engineering National Institute of Technology (KOSEN) Niihama College Ehime Japan

This paper deals with a design problem for a new event-trigger-based variable gain controller which achieves consensus for multi-agent systems (MASs) with the leader-follower structure. The proposed variable gain controller consists of stabilizing state feedback laws, state feedback inputs for consensus, and compensation inputs with adjustable parameters, and is designed by taking relative positions into account explicitly. In this paper, we show that sufficient conditions for the existence of the proposed formation control system are given in terms of Linear Matrix Inequalities (LMIs).

关键词：

来源：评论

学校读者我要写书评

暂无评论

Graph Attention Network for Word Embeddings 7th

Graph Attention Network for Word Embeddings

引用

7th International Conference on Artificial Intelligence and Security, ICAIS 2021

作者： Long, Yunfei Xu, Huosheng Qi, Pengyuan Zhang, Liguo Li, Jun College of Computer Science and Technology Harbin Engineering University Harbin150001 China Wuhan Digital Engineering Institute Wuhan430000 China China Industrial Control Systems Cyber Emergency Research Team Beijing100000 China

ISBN: (纸本)9783030786113

The word embeddings approaches have attracted extensive attention and widely used in many natural language processing (NLP) tasks. Relatedness between words can be reflected in vector space by word embeddings. However, the current word embeddings approaches commonly do not explore the context-specific information of word deeply in the overall corpus. In this paper, we propose to use graph attention network for word embeddings. We build a large single word graph for a corpus based on word order, then learn a word embeddings graph attention network (WEGAT) for the corpus. Our WEGAT is initialized with one-hot representation for word. We propose to use masked language model (MLM) as supervised task. In addition, through the text classification experiment, it is showed that accuracy of the word embeddings represented by WEGAT is higher than the current method for the same classification method. © 2021, Springer Nature Switzerland AG.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

scIAC: clustering scATAC-seq data based on Student’s t-distribution similarity imputation and denoising autoencoder

scIAC: clustering scATAC-seq data based on Student’s t-dist...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Wei Lan Jin Ye Xun Sun Xiaoshu Zhu Qingfeng Chen Yi Pan School of computer electronic and information and Guangxi Key Laboratory of Multimedia Communications and Network Technology Guangxi University Nanning China School of computer electronic and information Guangxi University Nanning China School of Computer Science and Engineering Yulin Normal University Yulin China School of Computer Science and Control Engineering Shenzhen Institute of Advanced Technology Shenzhen China

ISBN: (数字)9781665468190

ISBN: (纸本)9781665468206

Assay of single cell transposase-accessible chromatin with high-throughput sequencing (scATAC-seq) have enabled massively profiling of the chromatin accessibility landscape at the single-cell level. The essential step in analyzing scATAC-seq data is to cluster the cells into different clusters and utilize the clustering information in the subsequent downstream analysis. However, there are some challenges in the clustering analysis of scATAC-seq data. For example, scATAC-seq data are often high-dimensional and extremely sparse, as well as featuring high loss rate or noise. In this study, we proposed the scIAC to address these challenges of scATACseq data. In particular, scIAC combines the Student’s t-distribution similarity imputation and the denoising autoencoder based on the Zero-inflated Negative Binomial (ZINB) distribution. The Student’s t-distribution similarity imputation is used to solve the problem of high sparsity and high loss rate. The denoising autoencoder is employ to extract features which are useful for clustering and to reduce data noises. In addition, the self-training soft K-means and pairwise constraints are utilized in the clustering phase to enhance clustering performance. The experimental validation on several datasets shows that the proposed method performed better than other state-of-the-art methods. In conclusion, scIAC is an effective method to accurately cluster and identify cell types in scATAC-seq data.

关键词： Sequential analysis Runtime Clustering methods Noise reduction Neural networks Feature extraction Data models

来源：评论

学校读者我要写书评

暂无评论

Distributed Optimization with Finite Bit Adaptive Quantization for Efficient Communication and Precision Enhancement

Distributed Optimization with Finite Bit Adaptive Quantizati...

引用

IEEE Conference on Decision and control

作者： Apostolos I. Rikos Wei Jiang Themistoklis Charalambous Karl H. Johansson Artificial Intelligence Thrust of the Information Hub The Hong Kong University of Science and Technology (Guangzhou) Guangzhou China Department of Computer Science and Engineering The Hong Kong University of Science and Technology Clear Water Bay Hong Kong China Department of Electrical Engineering and Automation School of Electrical Engineering Aalto University Espoo Finland Department of Electrical and Computer Engineering School of Engineering University of Cyprus Nicosia Cyprus Division of Decision and Control Systems KTH Royal Institute of Technology SE-100 44 Stockholm Sweden

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

In realistic distributed optimization scenarios, individual nodes possess only partial information and communicate over bandwidth constrained channels. For this reason, the development of efficient distributed algorithms is essential. In our paper we addresses the challenge of unconstrained distributed optimization. In our scenario each node’s local function exhibits strong convexity with Lipschitz continuous gradients. The exchange of information between nodes occurs through 3-bit bandwidth-limited channels (i.e., nodes exchange messages represented by a only 3 -bits). Our proposed algorithm respects the network’s bandwidth constraints by leveraging zoom-in and zoom-out operations to adjust quantizer parameters dynamically. We show that during our algorithm’s operation nodes are able to converge to the exact optimal solution. Furthermore, we show that our algorithm achieves a linear convergence rate to the optimal solution. We conclude the paper with simulations that highlight our algorithm’s unique characteristics.

关键词： Adaptation models Quantization (signal) Heuristic algorithms Bandwidth Distributed algorithms Optimization Convergence

来源：评论

学校读者我要写书评

暂无评论

Asymptotic properties of distributed social sampling algorithm

引用

Science China(Information Sciences) 2020年第1期63卷 152-166页

作者： Qian LIU Xingkang HE Haitao FANG The Key Laboratory of Systems and Control Academy of Mathematics and Systems ScienceChinese Academy of Sciences School of Mathematical Sciences University of Chinese Academy of Sciences ACCESS Linnaeus Centre School of Electrical Engineering and Computer ScienceKTH Royal Institute of Technology

Social sampling is a novel randomized message passing protocol inspired by social communication for opinion formation in social networks. In a typical social sampling algorithm, each agent holds a sample from the empirical distribution of social opinions at initial time, and it collaborates with other agents in a distributed manner to estimate the initial empirical distribution by randomly sampling a message from current distribution estimate. In this paper, we focus on analyzing the theoretical properties of the distributed social sampling algorithm over random networks. First, we provide a framework based on stochastic approximation to study the asymptotic properties of the algorithm. Then, under mild conditions, we prove that the estimates of all agents converge to a common random distribution, which is composed of the initial empirical distribution and the accumulation of quantized error. Besides, by tuning algorithm parameters, we prove the strong consistency, namely, the distribution estimates of agents almost surely converge to the initial empirical distribution. Furthermore, the asymptotic normality of estimation error generated by distributed social sample algorithm is addressed. Finally, we provide a numerical simulation to validate the theoretical results of this paper.

关键词： social networks opinion formation social sampling stochastic approximation random networks asymptotic normality

来源：评论

学校读者我要写书评

暂无评论

Global Convergence Guarantees of (A)GIST for a Family of Nonconvex Sparse Learning Problems

引用

IEEE Transactions on Cybernetics 2022年第5期52卷 3276-3288页

作者： Zhang, Hengmin Qian, Feng Shang, Fanhua Du, Wenli Qian, Jianjun Yang, Jian East China University of Science and Technology Key Laboratory of Advanced Control and Optimization for Chemical Processes of Ministry of Education School of Information Science and Engineering Shanghai200237 China Shanghai Institute of Intelligent Science and Technology Tongji University Shanghai200092 China Xidian University Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education School of Artificial Intelligence Xi'an710071 China Peng Cheng Laboratory Shenzhen518066 China Nanjing University of Science and Technology Pca Laboratory Key Lab. of Intelligent Percept. and Syst. for High-Dimensional Information of Ministry of Education Nanjing210094 China Nanjing University of Science and Technology Jiangsu Key Laboratory of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing210094 China

In recent years, most of the studies have shown that the generalized iterated shrinkage thresholdings (GISTs) have become the commonly used first-order optimization algorithms in sparse learning problems. The nonconvex relaxations of the \ell _{0} -norm usually achieve better performance than the convex case (e.g., \ell _{1} -norm) since the former can achieve a nearly unbiased solver. To increase the calculation efficiency, this work further provides an accelerated GIST version, that is, AGIST, through the extrapolation-based acceleration technique, which can contribute to reduce the number of iterations when solving a family of nonconvex sparse learning problems. Besides, we present the algorithmic analysis, including both local and global convergence guarantees, as well as other intermediate results for the GIST and AGIST, denoted as (A)GIST, by virtue of the Kurdyka-Lojasiewica (KL) property and some milder assumptions. Numerical experiments on both synthetic data and real-world databases can demonstrate that the convergence results of objective function accord to the theoretical properties and nonconvex sparse learning methods can achieve superior performance over some convex ones. © 2013 IEEE.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Skeleton-Based Multi-Stream Adaptive Graph Convolutional Network for Indoor Scene Action Recognition

Skeleton-Based Multi-Stream Adaptive Graph Convolutional Net...

引用

Chinese Automation Congress (CAC)

作者： Jiazhuo Li Luefeng Chen Min Li Min Wu Witold Pedrycz Kaoru Hirota School of Automation China University of Geosciences Wuhan China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems and the Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education School of Automation China University of Geosciences Wuhan China Department of Electrical and Computer Engineering University of Alberta Edmonton AB Canada Polish Academy of Sciences Systems Research Institute Warsaw Poland Department of Computer Engineering Istinye University Sariyer/Istanbul Turkey Tokyo Institute of Technology Yokohama Japan Tokyo Institute of Technology Tokyo Japan

With the rapid advances in computer vision, human action recognition has gradually received attention, but the current methods still exhibit some problems in indoor environments. The human skeleton, as the framework of human motion, contains high-quality actional feature information, and the skeleton-based action recognition method effectively avoid the interference of interior background noise and has advantages in indoor action recognition. The outstanding effect of graph convolutional networks on graph structure data processing has led to its rapid development and wide application in skeleton-based action recognition. Second-order skeletal information also contains a large number of actional features but is not effectively utilized. The artificial predefined topology of the human skeleton map has limitations, and cannot reflect the interaction between limbs. To solve the above problems, this article designs an adaptive weighted multi-stream graph convolutional network (AM-GCN) based on skeletal information, using an attention mechanism to enhance the network's ability to extract actional features, and an adaptive layer to make the construction graph more flexible, incorporating second-order skeletal features through a dual-stream architecture. In this article, the NTU-RGB+D dataset has been used for the experiments, the results show that the method in this article has good results.

关键词：

来源：评论

学校读者我要写书评

暂无评论

High Information Density and Low Coverage Data Storage in DNA with Efficient Channel Coding Schemes

arXiv

引用

arXiv 2024年

作者： Ding, Yi He, Xuan Nguyen, Tuan Thanh Song, Wentu Yakhini, Zohar Yaakobi, Eitan Pan, Linqiang Tang, Xiaohu Cai, Kui Information Coding and Transmission Key Lab of Sichuan Province Southwest Jiaotong University Sichuan Chengdu611756 China Cluster Singapore University of Technology and Design 487372 Singapore Faculty of Computer Science Technion - Israel Institute of Technology Haifa3200003 Israel School of Computer Science RUNI Herzliya4615200 Israel Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Hubei Wuhan430074 China

DNA-based data storage has been attracting significant attention due to its extremely high data storage density, low power consumption, and long duration compared to conventional data storage media. Despite the recent advancements in DNA data storage technology, significant challenges remain. In particular, various types of errors can occur during the processes of DNA synthesis, storage, and sequencing, including substitution errors, insertion errors, and deletion errors. Furthermore, the entire oligo may be lost. In this work, we report a DNA-based data storage architecture that incorporates efficient channel coding schemes, including different types of error-correcting codes (ECCs) and constrained codes, for both the inner coding and outer coding for the DNA data storage channel. We also carried out large scale experiments to validate our proposed DNA-based data storage architecture. Specifically, 1.61 and 1.69 MB data were encoded into 30,000 oligos each, with information densities of 1.731 and 1.815, respectively. It has been found that the stored information can be fully recovered without any error at average coverages of 4.5 and 6.0, respectively. This experiment achieved the highest net information density and lowest coverage among existing DNA-based data storage experiments (with standard DNA), with data recovery rates and coverage approaching theoretical optima. Copyright © 2024, The Authors. All rights reserved.

关键词： Channel coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：