Automatica最新文献

筛选
英文 中文
Equi-normalized robust positively invariant sets for linear difference inclusions 线性差分夹杂的等归一化稳健正不变集
IF 4.8 2区 计算机科学
Automatica Pub Date : 2024-09-21 DOI: 10.1016/j.automatica.2024.111930
Saša V. Raković , Paul Trodden
{"title":"Equi-normalized robust positively invariant sets for linear difference inclusions","authors":"Saša V. Raković ,&nbsp;Paul Trodden","doi":"10.1016/j.automatica.2024.111930","DOIUrl":"10.1016/j.automatica.2024.111930","url":null,"abstract":"<div><p>This note establishes the characterization, existence and uniqueness of equi-normalized polytopic robust positively invariant sets for linear difference inclusions. The computation of this set results in a nonconvex optimization problem. Although this may be reformulated exactly as a mixed integer linear programme, we propose a more practical and tractable alternative in the form of a fixed-point iteration based on linear programming. Convergence of the algorithm is established.</p></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"171 ","pages":"Article 111930"},"PeriodicalIF":4.8,"publicationDate":"2024-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0005109824004242/pdfft?md5=296bd675522f3c88e6856b48384e7426&pid=1-s2.0-S0005109824004242-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142271130","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Deep networks for system identification: A survey 用于系统识别的深度网络:调查
IF 4.8 2区 计算机科学
Automatica Pub Date : 2024-09-21 DOI: 10.1016/j.automatica.2024.111907
Gianluigi Pillonetto , Aleksandr Aravkin , Daniel Gedon , Lennart Ljung , Antônio H. Ribeiro , Thomas B. Schön
{"title":"Deep networks for system identification: A survey","authors":"Gianluigi Pillonetto ,&nbsp;Aleksandr Aravkin ,&nbsp;Daniel Gedon ,&nbsp;Lennart Ljung ,&nbsp;Antônio H. Ribeiro ,&nbsp;Thomas B. Schön","doi":"10.1016/j.automatica.2024.111907","DOIUrl":"10.1016/j.automatica.2024.111907","url":null,"abstract":"<div><p>Deep learning is a topic of considerable current interest. The availability of massive data collections and powerful software resources has led to an impressive amount of results in many application areas that reveal essential but hidden properties of the observations. System identification learns mathematical descriptions of dynamic systems from input–output data and can thus benefit from the advances of deep neural networks to enrich the possible range of models to choose from. For this reason, we provide a survey of deep learning from a system identification perspective. We cover a wide spectrum of topics to enable researchers to understand the methods, providing rigorous practical and theoretical insights into the benefits and challenges of using them. The main aim of the identified model is to predict new data from previous observations. This can be achieved with different deep learning-based modelling techniques and we discuss architectures commonly adopted in the literature, like feedforward, convolutional, and recurrent networks. Their parameters have to be estimated from past data to optimize the prediction performance. For this purpose, we discuss a specific set of first-order optimization tools that have emerged as efficient. The survey then draws connections to the well-studied area of kernel-based methods. They control the data fit by regularization terms that penalize models not in line with prior assumptions. We illustrate how to cast them in deep architectures to obtain deep kernel-based methods. The success of deep learning also resulted in surprising empirical observations, like the counter-intuitive behaviour of models with many parameters. We discuss the role of overparameterized models, including their connection to kernels, as well as implicit regularization mechanisms which affect generalization, specifically the interesting phenomena of benign overfitting and double-descent. Finally, we highlight numerical, computational and software aspects in the area with the help of applied examples.</p></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"171 ","pages":"Article 111907"},"PeriodicalIF":4.8,"publicationDate":"2024-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0005109824004011/pdfft?md5=369128fac8aa3dbd37df831300f34a92&pid=1-s2.0-S0005109824004011-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142271126","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Performance optimization for continuous network localization 连续网络定位的性能优化
IF 4.8 2区 计算机科学
Automatica Pub Date : 2024-09-21 DOI: 10.1016/j.automatica.2024.111903
Liangming Chen , Chenyang Liang , Yibei Li , Jie Mei , Lihua Xie
{"title":"Performance optimization for continuous network localization","authors":"Liangming Chen ,&nbsp;Chenyang Liang ,&nbsp;Yibei Li ,&nbsp;Jie Mei ,&nbsp;Lihua Xie","doi":"10.1016/j.automatica.2024.111903","DOIUrl":"10.1016/j.automatica.2024.111903","url":null,"abstract":"<div><div>Recent advances in linear localization of sensor networks allow sensors to localize themselves by using inter-sensor measurements, such as distances, bearings and interior angles. According to earlier works, linear localization algorithms’ performance is relatively poor, which, however, has not been adequately addressed in the existing literature. The aim of this paper is to improve the performance of linear and continuous localization algorithms. More specifically, we focus on improving three key aspects of linear localization algorithms’ performance, i.e., the stability margin, convergence rate and robustness against measurement noises. Firstly, we propose a unified description for networks’ linear localization algorithms, given different types of measurements, and show that the stability margin, convergence rate and robustness of linear localization algorithms are <em>commonly determined by one parameter</em>, namely, <em>the minimum eigenvalue of the network’s localization matrix</em>. Secondly, by carefully choosing the decision variable, we formulate the performance optimization problem as an eigenvalue optimization problem, and show the non-differentiability of the eigenvalue optimization problem. Thirdly, we propose a <em>distributed</em> optimization algorithm, which guarantees the convergence to an optimal solution of the eigenvalue optimization problem. Finally, simulation examples validate the effectiveness of the proposed distributed optimization algorithm.</div></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"171 ","pages":"Article 111903"},"PeriodicalIF":4.8,"publicationDate":"2024-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0005109824003972/pdfft?md5=b83e4f85681639649512cbb0fd10cf71&pid=1-s2.0-S0005109824003972-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142312271","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Linear–quadratic mean-field game for stochastic systems with partial observation 部分观测随机系统的线性-二次均场博弈
IF 4.8 2区 计算机科学
Automatica Pub Date : 2024-09-21 DOI: 10.1016/j.automatica.2024.111821
Min Li , Na Li , Zhen Wu
{"title":"Linear–quadratic mean-field game for stochastic systems with partial observation","authors":"Min Li ,&nbsp;Na Li ,&nbsp;Zhen Wu","doi":"10.1016/j.automatica.2024.111821","DOIUrl":"10.1016/j.automatica.2024.111821","url":null,"abstract":"<div><p>This paper is concerned with a class of linear–quadratic stochastic large-population problems with partial information, where the individual agent only has access to a noisy observation process related to the state. The dynamics of each agent follows a linear stochastic differential equation driven by the individual noise, and all agents are coupled together via the control average term. By studying the associated mean-field game and using the backward separation principle with a state decomposition technique, the decentralized optimal control can be obtained in the open-loop form through a forward–backward stochastic differential equation with the conditional expectation. The optimal filtering equation is also provided. Thanks to the decoupling method, the decentralized optimal control can also be further presented as the feedback of state filtering via the Riccati equation. The explicit solution of the control average limit is given, and the consistency condition system is discussed. Moreover, the related <span><math><mi>ɛ</mi></math></span>-Nash equilibrium property is verified. To illustrate the good performance of theoretical results, an example in finance is studied.</p></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"171 ","pages":"Article 111821"},"PeriodicalIF":4.8,"publicationDate":"2024-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0005109824003157/pdfft?md5=4447ef16e985c2c6533ddcdbf781b24a&pid=1-s2.0-S0005109824003157-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142271127","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Adaptive event-triggered output feedback control for uncertain parabolic PDEs 不确定抛物线 PDE 的自适应事件触发输出反馈控制
IF 4.8 2区 计算机科学
Automatica Pub Date : 2024-09-20 DOI: 10.1016/j.automatica.2024.111917
Chunting Ji , Zhengqiang Zhang , Shuzhi Sam Ge
{"title":"Adaptive event-triggered output feedback control for uncertain parabolic PDEs","authors":"Chunting Ji ,&nbsp;Zhengqiang Zhang ,&nbsp;Shuzhi Sam Ge","doi":"10.1016/j.automatica.2024.111917","DOIUrl":"10.1016/j.automatica.2024.111917","url":null,"abstract":"<div><p>Motivated by the linearized model of unstable burning in solid propellant rockets, this article addresses the adaptive event-triggered output feedback control of uncertain parabolic PDEs. First, we construct an adaptive identifier that consists of a gradient estimator, and then design a continuous-in-time controller. On this basis, we design a novel event-triggered output feedback controller and construct dynamic triggering conditions to assure the global asymptotic stability of the closed-loop system around the limit points. Furthermore, the parameter estimation is proven to converge to the true value when an additional constant input at the boundary is applied to the closed-loop system. Finally, simulation data verifies the effectiveness of the theoretical analysis.</p></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"171 ","pages":"Article 111917"},"PeriodicalIF":4.8,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0005109824004114/pdfft?md5=dfb5c6d883e559847a8d1f24131d823e&pid=1-s2.0-S0005109824004114-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142271129","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Data-driven security controller design for unknown networked systems 为未知网络系统设计数据驱动的安全控制器
IF 4.8 2区 计算机科学
Automatica Pub Date : 2024-09-17 DOI: 10.1016/j.automatica.2024.111843
Songlin Hu , Dong Yue , Zhongrui Jiang , Xiangpeng Xie , Jin Zhang
{"title":"Data-driven security controller design for unknown networked systems","authors":"Songlin Hu ,&nbsp;Dong Yue ,&nbsp;Zhongrui Jiang ,&nbsp;Xiangpeng Xie ,&nbsp;Jin Zhang","doi":"10.1016/j.automatica.2024.111843","DOIUrl":"10.1016/j.automatica.2024.111843","url":null,"abstract":"<div><p>This paper is concerned with security controller design of unknown networked systems under aperiodic denial-of-service (DoS) attacks, using only noise data but no model knowledge. First, a novel attack parameter-dependent stability criterion of linear networked systems under a class of time-constraint DoS attacks is proposed by using DoS attack parameter-dependent time-varying Lyapunov function method, where the considered system model, the state-feedback gain, and the lower and upper bounds of sleeping/active periods of DoS attack signal are known in advance. Based on this model-based stability condition and by combining tools from data-driven control theory, robust control theory, and switched system approach to security control, a new data-based stability criterion of all linear networked control systems (NCSs) which are consistent with the measured data and the assumed noise bound in the presence of DoS attacks is derived in terms of linear matrix inequalities. Based on this data-dependent parametrization, the data-driven security state-feedback controllers are designed correspondingly. Our control method guarantees the exponential stability properties robustly for all linear systems consistent with the measured data despite the presence of DoS attacks. As a byproduct, the proposed method embeds existing approaches for event-triggered control (ETC) into a general data-based event-triggered security control framework, which can be extended to co-design of data-based robust controller and event-triggering mechanism for uncertain NCSs under DoS attacks. Finally, the efficiency and superiority of the proposed methodology are verified through a numerical example.</p></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"171 ","pages":"Article 111843"},"PeriodicalIF":4.8,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0005109824003376/pdfft?md5=56d6f72563e302ae4c461677382f7e06&pid=1-s2.0-S0005109824003376-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142243452","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Weighted stochastic Riccati equations for generalization of linear optimal control 线性优化控制广义加权随机里卡提方程
IF 4.8 2区 计算机科学
Automatica Pub Date : 2024-09-17 DOI: 10.1016/j.automatica.2024.111901
Yuji Ito , Kenji Fujimoto , Yukihiro Tadokoro
{"title":"Weighted stochastic Riccati equations for generalization of linear optimal control","authors":"Yuji Ito ,&nbsp;Kenji Fujimoto ,&nbsp;Yukihiro Tadokoro","doi":"10.1016/j.automatica.2024.111901","DOIUrl":"10.1016/j.automatica.2024.111901","url":null,"abstract":"<div><p>This paper presents weighted stochastic Riccati (WSR) equations for designing multiple types of controllers for linear stochastic systems. The system matrices are independent and identically distributed (i.i.d.) to represent noise in the systems. While the stochasticity can invoke unpredictable control results, it is essentially difficult to design controllers for systems with i.i.d. matrices because the controllers can be solutions to non-algebraic equations. Although an existing method has tackled this difficulty, the method has not realized the generality because it relies on the special form of cost functions for risk-sensitive linear (RSL) control. Furthermore, designing controllers over an infinite-horizon remains challenging because many iterations of solving nonlinear optimization is needed. To overcome these problems, the proposed WSR equations employ a weighted expectation of stochastic equations. Solutions to the WSR equations provide multiple types of controllers characterized by the weight, which contain stochastic optimal and RSL controllers. Two approaches calculating simple recursive formulas are proposed to solve the WSR equations without solving the nonlinear optimization. Moreover, designing the weight yields a novel controller termed the robust RSL controller that has both a risk-sensitive policy and robustness to randomness occurring in stochastic controller design.</p></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"171 ","pages":"Article 111901"},"PeriodicalIF":4.8,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0005109824003959/pdfft?md5=8292659d9f0c1c3712bba76f74739b8e&pid=1-s2.0-S0005109824003959-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142243453","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Asynchronous approximate Byzantine consensus: A multi-hop relay method and tight graph conditions 异步近似拜占庭共识:多跳中继方法和紧密图条件
IF 4.8 2区 计算机科学
Automatica Pub Date : 2024-09-16 DOI: 10.1016/j.automatica.2024.111908
Liwei Yuan , Hideaki Ishii
{"title":"Asynchronous approximate Byzantine consensus: A multi-hop relay method and tight graph conditions","authors":"Liwei Yuan ,&nbsp;Hideaki Ishii","doi":"10.1016/j.automatica.2024.111908","DOIUrl":"10.1016/j.automatica.2024.111908","url":null,"abstract":"<div><p>We study a multi-agent resilient consensus problem, where some agents are of the Byzantine type and try to prevent the normal ones from reaching consensus. In our setting, normal agents communicate with each other asynchronously over multi-hop relay channels with delays. To solve this asynchronous Byzantine consensus problem, we develop the multi-hop weighted mean subsequence reduced (MW-MSR) algorithm. The main contribution is that we characterize a tight graph condition for our algorithm to achieve Byzantine consensus, which is expressed in the novel notion of strictly robust graphs. We show that the multi-hop communication is effective for enhancing the network’s resilience against Byzantine agents. As a result, we also obtain novel conditions for resilient consensus under the malicious attack model, which are tighter than those known in the literature. Furthermore, the proposed algorithm can be viewed as a generalization of the conventional flooding-based algorithms, with less computational complexity. Lastly, we provide numerical examples to show the effectiveness of the proposed algorithm.</p></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"171 ","pages":"Article 111908"},"PeriodicalIF":4.8,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0005109824004023/pdfft?md5=4ef54f80a2e094e0b844d771ed36118c&pid=1-s2.0-S0005109824004023-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142242031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Synthesis of discretized Lyapunov functional method and the Lyapunov matrix approach for linear time delay systems 线性时延系统的离散李雅普诺夫函数法和李雅普诺夫矩阵法的合成
IF 4.8 2区 计算机科学
Automatica Pub Date : 2024-09-15 DOI: 10.1016/j.automatica.2024.111793
Irina V. Alexandrova, Aleksandr I. Belov
{"title":"Synthesis of discretized Lyapunov functional method and the Lyapunov matrix approach for linear time delay systems","authors":"Irina V. Alexandrova,&nbsp;Aleksandr I. Belov","doi":"10.1016/j.automatica.2024.111793","DOIUrl":"10.1016/j.automatica.2024.111793","url":null,"abstract":"<div><p>The famous discretized Lyapunov functional method of K. Gu employing the functionals of general structure with piecewise linear matrix kernels is known to deliver effective stability conditions in the form of linear matrix inequalities (LMIs). In parallel, the role of the delay Lyapunov matrix for linear time-invariant systems with delay was recently revealed. In Gomez et al. (2019), it was shown that the positive definiteness of a beautiful block matrix which involves the delay Lyapunov matrix values at several discretization points of the delay interval constitutes a necessary and sufficient condition for the exponential stability. The only drawback is that the dimension of the block matrix turns out to be very high in practice. In this study, we significantly reduce the dimension by combining the delay Lyapunov matrix framework with the discretized Lyapunov functional method. The component of the latter method that pertains to the discretization of the functional derivative is replaced with bounding the difference between the values of the functional possessing a prescribed derivative and its discretized counterpart. The key breakthrough lies in the fact that the structure of the block matrix is kept the same as in Gomez et al. (2019). Numerical examples show the superiority of our method in many cases compared to the other techniques known in the literature.</p></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"171 ","pages":"Article 111793"},"PeriodicalIF":4.8,"publicationDate":"2024-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0005109824002875/pdfft?md5=f246ce4b9a6d60ba694d7fb04896ae61&pid=1-s2.0-S0005109824002875-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142233855","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On stability analysis of stochastic neutral-type systems with multiple delays 论多延迟随机中性型系统的稳定性分析
IF 4.8 2区 计算机科学
Automatica Pub Date : 2024-09-13 DOI: 10.1016/j.automatica.2024.111905
Zhao-Yan Li , YunXia Song , Xing Li , Bin Zhou
{"title":"On stability analysis of stochastic neutral-type systems with multiple delays","authors":"Zhao-Yan Li ,&nbsp;YunXia Song ,&nbsp;Xing Li ,&nbsp;Bin Zhou","doi":"10.1016/j.automatica.2024.111905","DOIUrl":"10.1016/j.automatica.2024.111905","url":null,"abstract":"<div><p>This note is concerned with the stability analysis problem of stochastic neutral-type time-delay systems with multiple delays. A less restrictive constraint is imposed to ensure that the difference operator (which appears on the left hand side of the stochastic neutral-type time-delay systems) possesses the property that “exponentially converging input implies exponentially converging state”. Such a constraint is necessary and sufficient for the strong stability of the difference equation associated with the system in the deterministic setting, and thus cannot be further relaxed.</p></div>","PeriodicalId":55413,"journal":{"name":"Automatica","volume":"171 ","pages":"Article 111905"},"PeriodicalIF":4.8,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0005109824003996/pdfft?md5=a091ca12892e43d89d77451e78fb4860&pid=1-s2.0-S0005109824003996-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142229999","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信