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

Frequent Event Pattern Extraction of Drilling Time Series Using Change Point Detection and Event Sequence Generation

引用

IFAC-PapersOnLine 2023年第2期56卷 6168-6173页

作者： Yupeng Li Wenkai Hu Weihua Cao R. Bhushan Gopaluni Liang Cao Chao Gan Min Wu School of Automation China University of Geosciences Wuhan 430074 China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan 430074 China Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan 430074 China Department of Chemical and Biological Engineering University of British Columbia Vancouver BC V6T 1Z3 Canada

In drilling processes, non-stationary phases corresponding to shifts between operating conditions and changes in downhole formations typically lead to false alarms. Extracting these frequent event patterns is critical to build drilling process monitoring and fault diagnosis models. This study aims to extract the frequent event patterns associated with non-stationary phases in drilling time series. In this way, diversified information related to signal changes under normal conditions can be obtained, which is beneficial for suppressing false alarms and improving fault detection performance. The main contributions of this study are twofold: 1) a non-stationary phase detection method is proposed to extract drilling frequent event patterns based on t -distributed stochastic neighbor embedding and relative unconstrained least-squares importance fitting; 2) an event sequence generation method is proposed to express drilling frequent event patterns with a group of symbols. The effectiveness of the proposed method is demonstrated by data from a real drilling project.

关键词： Drilling processes pattern extraction change point detection event sequence generation frequent event pattern

来源：评论

学校读者我要写书评

暂无评论

Convergence Rate Analysis of Gaussian Belief Propagation for Markov Networks

引用

IEEE/CAA Journal of Automatica Sinica 2020年第3期7卷 668-673页

作者： Zhaorong Zhang Minyue Fu School of Electrical Engineering and Computer Science The University of Newcastle.University DriveNSW 2308Australia IEEE School of Automation Guangdong University of Technologyand Guangdong Key Laboratory of Intelligent Decision and Cooperative ControlGuangzhou 510006China

Gaussian belief propagation algorithm(GaBP) is one of the most important distributed algorithms in signal processing and statistical learning involving Markov networks. It is well known that the algorithm correctly computes marginal density functions from a high dimensional joint density function over a Markov network in a finite number of iterations when the underlying Gaussian graph is acyclic. It is also known more recently that the algorithm produces correct marginal means asymptotically for cyclic Gaussian graphs under the condition of walk summability(or generalised diagonal dominance). This paper extends this convergence result further by showing that the convergence is exponential under the generalised diagonal dominance condition,and provides a simple bound for the convergence rate. Our results are derived by combining the known walk summability approach for asymptotic convergence analysis with the control systems approach for stability analysis.

关键词： Belief propagation distributed algorithm distributed estimation Gaussian belief propagation Markov networks

来源：评论

学校读者我要写书评

暂无评论

Distributed Momentum-based Frank-Wolfe Algorithm for Stochastic Optimization

arXiv

引用

arXiv 2022年

作者： Hou, Jie Zeng, Xianlin Wang, Gang Sun, Jian Chen, Jie The Key Laboratory of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology Beijing100081 China Beijing Institute of Technology Chongqing Innovation Center Chongqing401120 China The School of Electronic and Information Engineering Tongji University Shanghai200082 China

—This paper considers distributed stochastic optimization, in which a number of agents cooperate to optimize a global objective function through local computations and information exchanges with neighbors over a network. Stochastic optimization problems are usually tackled by variants of projected stochastic gradient descent. However, projecting a point onto a feasible set is often expensive. The Frank-Wolfe (FW) method has well-documented merits in handling convex constraints, but existing stochastic FW algorithms are basically developed for centralized settings. In this context, the present work puts forth a distributed stochastic Frank-Wolfe solver, by judiciously combining Nesterov’s momentum and gradient tracking techniques for stochastic convex and nonconvex optimization over networks. It is shown that the convergence rate 1 of the proposed algorithm is O(k− 2) for convex optimization, and O(1/log2(k)) for nonconvex optimization. The efficacy of the algorithm is demonstrated by numerical simulations against a number of competing alternatives. Copyright © 2022, The Authors. All rights reserved.

关键词： Momentum

来源：评论

学校读者我要写书评

暂无评论

H∞ State Estimation for Time-Delayed Static Neural Networks Using an Improved Delay-Product-Type LKF

H∞ State Estimation for Time-Delayed Static Neural Networks...

引用

Chinese control Conference (CCC)

作者： Yong-He Lao Yu-Long Fan Liang-Tong Luo Chuan-Ke Zhang School of Automation China University of Geosciences Wuhan P. R. China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan P. R. China Ministry of Education Engineering Research Center of Intelligent Technology for Geo-Exploration Wuhan P. R. China

This paper is concerned with $H_{\infty}$ performance state estimation of static neural networks with a time-varying delay. First, a PI estimator with exponential term is used to estimate neuron states based on output measurement. Second, an augmented Lyapunov-Krasovskii functional (LKF) containing delay-product-type non-integral terms and single integral terms is constructed by introducing negative definite terms. After that, a criterion with less conservatism is derived based on extended reciprocally convex matrix inequality. Finally, a numerical example is provided to reveal the effectiveness of the proposed approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Gaussian Filter for Nonlinear System with Randomly Delayed Measurements and Correlated Noises

Design and Implementation of Gaussian Filter for Nonlinear S...

引用

Chinese control Conference (CCC)

作者： Weijie Cui Xinmei Wang Qian Hu Fei Du School of Automation China University of Geosciences Wuhan P. R. China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan P. R. China Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan P. R. China

A new Gaussian approximate (GA) filter for nonlinear systems with one-step randomly delayed measurement and correlated noise is proposed in this paper. Firstly, a general framework of Gaussian filter is designed under Gaussian assumption on the conditional density. Then, the implementation of Gaussian filter is transformed into the approximation of the Gaussian weighted integral in the proposed frame. Secondly, a new cubature Kalman filtering(CKF)algorithm is developed on the basis of the spherical-radial cubature rule. The efficiency and superiority of the proposed method are illustrated in the numerical examples.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Design of Variance-Constrained H∞State Estimation Algorithm for Delayed Memristive Neural Networks with Attacks: An Adaptive Event-Triggered Approach 8

Design of Variance-Constrained H∞State Estimation Algorithm...

引用

8th IEEE International Conference on Cloud Computing and Intelligence systems, CCIS 2022

作者： Gao, Yan Hu, Jun Yu, Hui Jia, Chaoqing Harbin University of Science and Technology Department of Mathematics Harbin150080 China Harbin University of Science and Technology School of Automation Harbin150080 China Harbin University of Science and Technology Heilongjiang Prov. Key Lab. of Optimization Control and Intelligent Analysis for Complex Systems Harbin150080 China

ISBN: (纸本)9781665477352

This paper studies the algorithm design of variance-constrained H∞ state estimation problem for delayed memristive neural networks with adaptive event-triggered mechanism. The denial-of-service attacks are modeled by a series of random variables obeying the Bernoulli distribution with known probability. In addition, the adaptive event-triggered mechanism is introduced into the sensor-to-estimator to avoid unnecessary resource consumption. Our purpose is to construct a finite-horizon state estimation algorithm, and sufficient condition is obtained for the estimation error system satisfying the H∞ performance requirement and the error variance boundedness. Finally, a numerical example is used to illustrate the feasibility of the presented H∞ state estimation algorithm. © 2022 IEEE.

关键词： State estimation

来源：评论

学校读者我要写书评

暂无评论

An Improved Synchronization Criterion for Time-Delayed Lur'e systems via Cubic Function Negative-Determination Lemma

An Improved Synchronization Criterion for Time-Delayed Lur'e...

引用

Chinese control Conference (CCC)

作者： Yu-Fei Peng Yu-Long Fan Yong He Xing-Chen Shangguan School of Automation China University of Geosciences Wuhan P. R. China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan P. R. China Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan P. R. China

In this paper, the master-slave synchronization issue of chaotic Lur’ e systems with time-varying-delay feedback control is investigated. Firstly, the synchronization problem of chaotic system is transformed into the stability problem of chaotic synchronization error system, which is studied based on Lyapunov-Krasovskii functional (LKF) method. Secondly, a novel augmented LKF with more cross terms that related to time-varying delay is proposed. Based on the application of the relaxation integral inequality and the reciprocally convex matrix inequality, an improved synchronization criterion is derived by using the cubic function negative-determination lemma. Finally, a numerical simulation example demonstrates the effectiveness and advantages of the proposed methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Cyber-physical -social systems for smart cities: An overview 1

Cyber-physical -social systems for smart cities: An overview

引用

1st IEEE International Conference on Digital Twins and Parallel Intelligence, DTPI 2021

作者： Anwar, Noreen Xiong, Gang Lu, Wanze Ye, Peijun Zhao, Hongxia Wei, Qinglai Institute of Automation Chinese Academy of Sciences The State Key Laboratory for Management and Control of Complex Systems Beijing China The Beijing Engineering Research Center of Intelligent Systems and Technology Institute of Automation The Cloud Computing Center Chinese Academy of Sciences China School of Artificial Intelligence and Automation Beijing University of Technology Beijing100124 China

ISBN: (纸本)9781665433372

Cyber-physical social systems (CPSS) include cyberspace, physical space, and social space. Since the introduction of CPSS, human relationships with machinery and the physical world have altered as a new paradigm. Recent estimates indicate that approximately 60 percent of the world's population will live in cities by 2030. Large, dense cities can be highly productive, innovative, and very green per capita, hence ideal for our future. However, the huge influx of new people poses enormous challenges to their administrations. Smart cities are becoming a reality, therefore, to achieve higher efficiency, optimum use of resources, management and to strengthen several features of modern towns, several elements of modern cities are automated and integrated into Information and Communications Technology (ICT). Cities and infrastructure are growing all over the world, in providing end-users with increased performance, comfort, visibility and convenience, the Smart Cities concept is critical. This paper will discuss smart cities and the CPSS concept intensively with some of its key technologies, challenges, and further development by using CPSS. © 2021 IEEE.

关键词： Smart city

来源：评论

学校读者我要写书评

暂无评论

Forget less,count better:a domain-incremental self-distillation learning benchmark for lifelong crowd counting

引用

Frontiers of Information Technology & Electronic Engineering 2023年第2期24卷 187-202页

作者： Jiaqi GAO Jingqi LI Hongming SHAN Yanyun QU James ZWANG Fei-Yue WANG Junping ZHANG Shanghai Key Laboratory of Intelligent Information Processing School of Computer ScienceFudan UniversityShanghai 200433China Institute of Science and Technology for Brain-inspired Intelligence Fudan UniversityShanghai 200433China Shanghai Center for Brain Science and Brain-inspired Technology Shanghai 201210China School of Information Science and Technology Xiamen UniversityXiamen 361005China College of Information Sciences and Technology the Pennsylvania State UniversityUniversity ParkPA 16802USA State Key Laboratory of Management and Control for Complex Systems Institute of AutomationChinese Academy of SciencesBeijing 100190China

Crowd counting has important applications in public safety and pandemic control.A robust and practical crowd counting system has to be capable of continuously learning with the newly incoming domain data in real-world scenarios instead of fitting one domain ***-the-shelf methods have some drawbacks when handling multiple domains:(1)the models will achieve limited performance(even drop dramatically)among old domains after training images from new domains due to the discrepancies in intrinsic data distributions from various domains,which is called catastrophic forgetting;(2)the well-trained model in a specific domain achieves imperfect performance among other unseen domains because of domain shift;(3)it leads to linearly increasing storage overhead,either mixing all the data for training or simply training dozens of separate models for different domains when new ones are *** overcome these issues,we investigate a new crowd counting task in incremental domain training setting called lifelong crowd *** goal is to alleviate catastrophic forgetting and improve the generalization ability using a single model updated by the incremental ***,we propose a self-distillation learning framework as a benchmark(forget less,count better,or FLCB)for lifelong crowd counting,which helps the model leverage previous meaningful knowledge in a sustainable manner for better crowd counting to mitigate the forgetting when new data arrive.A new quantitative metric,normalized Backward Transfer(nBwT),is developed to evaluate the forgetting degree of the model in the lifelong learning *** experimental results demonstrate the superiority of our proposed benchmark in achieving a low catastrophic forgetting degree and strong generalization ability.

关键词： Crowd counting Knowledge distillation Lifelong learning

来源：评论

学校读者我要写书评

暂无评论

DATA SMOOTHING FILLING METHOD BASED ON SCRNA-SEQ DATA ZERO-VALUE IDENTIFICATION

arXiv

引用

arXiv 2024年

作者： Jiang, Linfeng Zhu, Yuan School of Automation China University of Geosciences Hongshan District No. 388 Lumo Road Wuhan430074 China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Hongshan District No. 388 Lumo Road Wuhan430074 China Engineering Research Center of Intelligent Technology for Geo-Exploration Hongshan District No. 388 Lumo Road Wuhan430074 China

Single-cell RNA sequencing (scRNA-seq) determines RNA expression at single-cell resolution. It provides a powerful tool for studying immunity, regulation, and other life activities of cells. However, due to the limitations of the sequencing technique, the scRNA-seq data are represented with sparsity, which contains missing gene values, i.e., zero values, called dropout. Therefore, it is necessary to impute missing values before analyzing scRNA-seq data. However, existing imputation computation methods often only focus on the identification of technical zeros or imputing all zeros based on cell similarity. This study proposes a new method (SFAG) to reconstruct the gene expression relationship matrix by using graph regularization technology to preserve the high-dimensional manifold information of the data, and to mine the relationship between genes and cells in the data, and then uses a method of averaging the clustering results to fill in the identified technical zeros. Experimental results show that SFAG can help improve downstream analysis and reconstruct cell trajectory. © 2024, CC BY.

关键词： RNA

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：