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

arXiv 2023年

作者： Rikos, Apostolos I. Jiang, Wei Charalambous, Themistoklis Johansson, Karl H. Department of Electrical and Computer Engineering Division of Systems Engineering Boston University BostonMA02215 United States Hong Kong Hong Kong Department of Electrical and Computer Engineering School of Engineering University of Cyprus Nicosia1678 Cyprus Department of Electrical Engineering and Automation School of Electrical Engineering Aalto University Espoo Finland Division of Decision and Control Systems KTH Royal Institute of Technology StockholmSE-100 44 Sweden Digital Futures United Kingdom

In this paper, we focus on an asynchronous distributed optimization problem. In our problem, each node is endowed with a convex local cost function, and is able to communicate with its neighbors over a directed communication network. Furthermore, we assume that the communication channels between nodes have limited bandwidth, and each node suffers from processing delays. We present a distributed algorithm which combines the Alternating Direction Method of Multipliers (ADMM) strategy with a finite time quantized averaging algorithm. In our proposed algorithm, nodes exchange quantized valued messages and operate in an asynchronous fashion. More specifically, during every iteration of our algorithm each node (i) solves a local convex optimization problem (for the one of its primal variables), and (ii) utilizes a finite-time quantized averaging algorithm to obtain the value of the second primal variable (since the cost function for the second primal variable is not decomposable). We show that our algorithm converges to the optimal solution at a rate of O(1/k) (where k is the number of time steps) for the case where the local cost function of every node is convex and not-necessarily differentiable. Finally, we demonstrate the operational advantages of our algorithm against other algorithms from the literature. © 2023, CC BY.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

SPP-CNN: An Efficient Framework for Network Robustness Prediction

arXiv

引用

arXiv 2023年

作者： Wu, Chengpei Lou, Yang Wang, Lin Li, Junli Li, Xiang Chen, Guanrong The College of Computer Science Sichuan Normal University Chengdu610066 China The Key Laboratory of System Control and Information Processing Ministry of Education Shanghai200240 China The Department of Computer Science National Yang Ming Chiao Tung University Hsinchu300 Taiwan The Department of Automation Shanghai Jiao Tong University Shanghai200240 China The Institute of Complex Networks and Intelligent Systems Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai201210 China The Department of Control Science and Engineering Tongji University Shanghai200240 China The Department of Electrical Engineering City University of Hong Kong Hong Kong

This paper addresses the robustness of a network to sustain its connectivity and controllability against malicious attacks. This kind of network robustness is typically measured by the time-consuming attack simulation, which returns a sequence of values that record the remaining connectivity and controllability after a sequence of node- or edge-removal attacks. For improvement, this paper develops an efficient framework for network robustness prediction, the spatial pyramid pooling convolutional neural network (SPP-CNN). The new framework installs a spatial pyramid pooling layer between the convolutional and fully-connected layers, overcoming the common mismatch issue in the CNN-based prediction approaches and extending its generalizability. Extensive experiments are carried out by comparing SPP-CNN with three state-of-the-art robustness predictors, namely a CNN-based and two graph neural networks-based frameworks. Synthetic and real-world networks, both directed and undirected, are investigated. Experimental results demonstrate that the proposed SPP-CNN achieves better prediction performances and better generalizability to unknown datasets, with significantly lower time-consumption, than its counterparts. © 2023, CC BY.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Distributed time-varying formation control with uncertainties based on an event-triggered mechanism

引用

Science China(Information Sciences) 2021年第3期64卷 167-176页

作者： Xiaoduo LI Yumeng BAI Xiwang DONG Qingdong LI Zhang REN Science and Technology on Aircraft Control Laboratory School of Automation Science and Electrical EngineeringBeihang University Department of Electrical and Computer Engineering University of Wisconsin-Madison Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University

This paper investigates the distributed time-varying formation(TVF) problems for general linear multi-agent systems(MASs) subject to matched bounded uncertainties based on an adaptive event-triggered mechanism. A TVF protocol was designed with an event-triggered mechanism by introducing adaptive weights into the formation control protocol and triggering condition, and the large chattering phenomenon was avoided by the σ-modification adaptive law. According to the Lyapunov stability theory, proof has been established that the MASs in the presence of uncertainties can realize the expected formation that satisfies the given feasible condition. Finally, an example is provided to verify the effectiveness of the proposed algorithm.

关键词： formation control multi-agent systems event-triggered adaptive control

来源：评论

学校读者我要写书评

暂无评论

Cyber-Physical Systems Based Business Models

Cyber-Physical Systems Based Business Models

引用

IEEE International Conference on automation, Quality and Testing, Robotics, AQTR

作者： Eugen Pop Daniela Gî fu Mihnea Alexandru Moisescu Automatics and Industrial Informatics Department Faculty of Automatic Control and Computers University "Politehnica" of Bucharest R&#x0026 D Institute for Automation - IPA SA Romania Institute of Computer Science Romanian Academy &#x2013 Ia&#x0219 i branch Faculty of Computer Science "Alexandru Ioan Cuza" University of Ia&#x0219 i Romania Automatics and Industrial Informatics Department Faculty of Automatic Control and Computers University "Politehnica" of Bucharest Romania

Currently, the use of cyber-physical systems is becoming widespread in various fields, primarily, because they enable many innovative functionalities through their networking. These systems include complex computation elements that interacts with the physical environment through sensors or actuators. Their solutions are based on sharing of hardware equipment and software services, targeting to provide added value proposition for various customers. The research and development in this domain are going on not only in the technical direction, but is also targeting the value creation for customers, in a technical and business-oriented manner. This paper presents a cyber-physical systems-based business model realized through services composition. The service composition framework integrates Web services which can be interconnected and can be accessed by mobile clients through smartphones, on mobile and wireless communications channels. The response time for multiuser requests for services access is evaluated, because it is an important quality of service performance criteria of our e-business model service composition framework. The results are promising.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deep Learning-Based Prediction of Subsurface Oil Reservoir Pressure Using Spatio-Temporal Data

Deep Learning-Based Prediction of Subsurface Oil Reservoir P...

引用

Annual Conference of Industrial Electronics Society

作者： Haibo Cheng Yunpeng He Peng Zeng Shichao Li Valeriy Vyatkin State Key Laboratory of Robotics Shenyang Institute of Automation Chinese Academy of Sciences Shenyang China Key Laboratory of Networked Control Systems Chinese Academy of Sciences Shenyang China Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Shenyang China University of Chinese Academy of Sciences Beijing China Department of Computer Science Electrical and Space Engineering Luleå University of Technology Luleå Sweden Department of Electrical Engineering and Automation Aalto University Helsinki Finland

Prediction of subsurface oil reservoir pressure are critical to hydrocarbon production. However, the accurate pressure estimation faces great challenges due to the complexity and uncertainty of reservoir. The underground seepage flow and petrophysical parameters (permeability and porosity) are important but difficult to measure in oilfield. Deep learning methods have been successfully used in reservoir engineering and oil & gas production process. In this study, the effective but inaccessible subsurface seepage fields are not used, only the spatial coordinates and temporal information are selected as model input to predict reservoir pressure. A stacked GRU-based deep learning model is proposed to map the relationship between spatio-temporal data and reservoir pressure. The proposed deep learning method is verified by using a three-dimensional reservoir model, and compared with commonly-used methods. The results show that the stacked GRU model has a better performance and higher accuracy than other deep learning or machine learning methods in pressure prediction.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Object Detection at Sea Using Ensemble Methods Across Spectral Ranges

引用

IFAC-PapersOnLine 2021年第16期54卷 1-6页

作者： Frederik E.T. Schöller Martin K. Plenge-Feidenhans’l Jonathan D. Stets Mogens Blanke Automation and Control Group Department of Electrical Engineering Technical University of Denmark DK-2800 Kgs. Lyngby Denmark Section of Image Analysis and Computger Graphics Department of Applied Mathematics and Computer Science DTU

Having the option of a temporally unmanned bridge when conditions allow, while maintaining or even enhancing navigational safety, is a long term aim in the maritime industry. Such a system requires excellent perception of the environment using an array of sensors. This paper investigates performance of object detection at sea using electro-optical sensors in relevant spectral ranges and discusses how missed detection risk is minimised for objects within navigation range. Using a combination of cameras in visible, near- and far infrared ranges, convolutional neural networks are employed for object detection. Ensemble techniques are suggested to minimise the amount of missed detections and it is shown how optimisation of confidence thresholds can be used to increase performance. The results are based on image data from vessels in near-coast operation in Danish waters.

关键词： Multi-modal sensor fusion Deep learning Detection performance Object detection at sea computer vision Autonomous Marine Vehicles

来源：评论

学校读者我要写书评

暂无评论

Quantized Distributed Nonconvex Optimization Algorithms with Linear Convergence under the Polyak–Lojasiewicz Condition

引用

IEEE Transactions on Automatic control 2025年

作者： Xu, Lei Yi, Xinlei Sun, Jiayue Shi, Yang Johansson, Karl H. Yang, Tao Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China University of Victoria Department of Mechanical Engineering VictoriaBCV8W 2Y2 Canada Tongji University Shanghai Institute of Intelligent Science and Technology Shanghai201804 China KTH Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm100 44 Sweden

This paper considers distributed optimization for minimizing the average of local nonconvex cost functions, by using local information exchange over undirected communication networks. To reduce the required communication capacity, we introduce an encoder–decoder scheme. By integrating it with distributed gradient tracking and proportional integral algorithms, respectively, we then propose two quantized distributed nonconvex optimization algorithms. Assuming the global cost function satisfies the Polyak–Lojasiewicz condition, which does not require the global cost function to be convex and the global minimizer is not necessarily unique, we show that our proposed algorithms linearly converge to a global optimal point. Moreover, we show that a low data rate is sufficient to guarantee linear convergence when the algorithm parameters are properly chosen. The theoretical results are illustrated by numerical examples. © 1963-2012 IEEE.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Selection of Cancer Biomarkers from Microarray Gene Expression Data Utilizing the Bi-Objective Optimization Method

Selection of Cancer Biomarkers from Microarray Gene Expressi...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Hanjing Jiang Jianqing Lin Huachao Zhu Yabing Huang Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China Institute of Artificial Intelligence School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China School of Computer Science Wuhan University Wuhan China Department of Pathology Renmin Hospital of Wuhan University Wuhan China

Cancer-associated biomarker genes play an indispensable role in the intricate tapestry of cancer development and manifestation. The expression of biomarkers in different types of tumor cells has beneficial implications for shedding light on the development of various cancers, guiding clinical diagnosis, and treatment. Microarray technology enables the expression levels of thousands of genes in samples to be sequenced simultaneously. However, sparse and high-dimensional microarray data present a formidable challenge in identifying biomarker genes. This study presents EREF-NSGA2, a novel method for cancer biomarker selection from microarray data, employing a hybrid gene selection approach. Firstly, the combination of the wrapper and embedded gene selection methods is proposed to filter the microarray data, which efficiently decreases the search space of the algorithm. After that, the improved NSGA-II algorithm is used to search the genes subset obtained from the previous step to reach the optimal subset of cancer biomarker genes. The proposed EREF-NSGA2 is compared with other reported methods on six cancer benchmark gene expression datasets. A detailed biological analysis is performed to analyze the relationship between the selected genes and the cancer data sets they belong to. To summarize, EREF-NSGA2 proves its effectiveness in selecting a feature subset comprising the fewest genes while maintaining the highest classification accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Single-Cell Clustering Algorithm Based on Structure Perturbation Non-Negative Matrix Factorization

A Single-Cell Clustering Algorithm Based on Structure Pertur...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Hanjing Jiang Meineng Wang Luping Zhang Yu-An Huang Yangyuan Li Yabing Huang Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China Institute of Artificial Intelligence School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China School of Computer Science and Technology China University of Mining and Technology Xuzhou China School of Mathematics and Computer Science Yichun University Yichun China School of Information Engineering East China University of Technology Nanchang China School of Computer Science Northwestern Polytechnical University Xi’an China Department of Pathology Renmin Hospital of Wuhan University Wuhan China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

The advent of single-cell RNA sequencing (scRNA-seq) has facilitated the acquisition of high-resolution data regarding cell heterogeneity across various tissues. A fundamental and critical step in the analysis of scRNA-seq data is cell type identification. An appropriate graph construction strategy can reflect the topological structure between cells and allows for detailed exploration of the relationships between cells and genes. Given the sparsity of scRNA-seq data and the pronounced noise generated by shallow sequencing, choosing an appropriate graph construction strategy has become a significant challenge. In this paper, we propose a single-cell clustering method, named Sc-PNNMF, based on structural perturbation of nonnegative matrix factorization. Sc-PNNMF employs a structural perturbation algorithm to optimize the gene expression matrix. The optimized matrix guides the matrix factorization process, effectively overcoming the impact of data sparsity and significant noise in gene expression data on the graph construction strategy. We compared the clustering abilities of Sc-PNNMF with five other methods on ten real datasets.

关键词： Sequential analysis Perturbation methods Clustering methods RNA Noise Clustering algorithms Sparse matrices Gene expression Unsupervised learning Periodic structures

来源：评论

学校读者我要写书评

暂无评论

Relational Prompt-based Pre-trained Language Models for Social Event Detection

arXiv

引用

arXiv 2024年

作者： Pu, L.I. Xiaoyan, Y.U. Peng, Hao Xian, Yantuan Wang, Linqin Li, S.U.N. Zhang, Jingyun Philip, S.Y.U. Faculty of Information Engineering and Automation Yunnan Key Laboratory of Artificial Intelligence Kunming University of Science and Technology Kunming650500 China School of Computer Science and Technology Beijing Institute of Technology Beijing100081 China School of Cyber Science and Technology Beihang University No. 37 Xue Yuan Road Haidian District Beijing100191 China School of Control and Computer Engineering North China Electric Power University Beijing102206 China Department of Computer Science University of Illinois at Chicago ChicagoIL60607 United States

Social Event Detection (SED) aims to identify significant events from social streams, and has a wide application ranging from public opinion analysis to risk management. In recent years, Graph Neural Network (GNN) based solutions have achieved state-of-the-art performance. However, GNN-based methods often struggle with missing and noisy edges between messages, affecting the quality of learned message embedding. Moreover, these methods statically initialize node embedding before training, which, in turn, limits the ability to learn from message texts and relations simultaneously. In this paper, we approach social event detection from a new perspective based on Pre-trained Language Models (PLMs), and present RPLM (Relational prompt-based Pre-trained Language Models for Social Event Detection). We first propose a new pairwise message modeling strategy to construct social messages into message pairs with multi-relational sequences. Secondly, a new multi-relational prompt-based pairwise message learning mechanism is proposed to learn more comprehensive message representation from message pairs with multi-relational prompts using PLMs. Thirdly, we design a new clustering constraint to optimize the encoding process by enhancing intra-cluster compactness and inter-cluster dispersion, making the message representation more distinguishable. We evaluate the RPLM on three real-world datasets, demonstrating that the RPLM model achieves state-of-the-art performance in offline, online, low-resource, and long-tail distribution scenarios for social event detection tasks. Copyright © 2024, The Authors. All rights reserved.

关键词： Risk assessment

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：