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

Stochastic Link Flow Model for Signalized Traffic Networks with Uncertainty in Demand

IFAC-PapersOnLine 2018年第9期51卷 458-463页

作者： Lin, S. Pan, T.L. Lam, W.H.K. Zhong, R.X. Schutter, B. De School of Computer and Control Engineering University of Chinese Academy of Sciences Key Laboratory of System Control and Information Processing Ministry of Education BeijingShanghai China Department of Civil and Structural Engineering The Hong Kong Polytechnic University Hong KongSAR Hong Kong School of Engineering Sun Yat-Sen University Guangzhou China Delft Center for Systems and Control Delft University of Technology Delft Netherlands

In order to investigate the stochastic features in urban traffic dynamics, we propose a Stochastic Link Flow Model (SLFM) for signalized traffic networks with demand uncertainties. In the proposed model, the link traffic state is described using four different link state modes, and the probability for each link state mode is determined based on the stochastic link states. The SLFM model is expressed as a finite mixture approximation of the link state probabilities and the dynamic link flow models for all the four link state modes. Using data from microscopic traffic simulator SUMO, we illustrate that the proposed model can provide a reliable estimation of the link traffic states, and as well as good estimations on the link state uncertainties propagating within a signalized traffic network. © 2018

关键词： Stochastic models Routers Stochastic systems Street traffic control Traffic signals Vehicle actuated signals Demand uncertainty Finite mixtures Stochastic features Stochastic traffic Traffic networks Traffic simulators Uncertainty in demand Urban traffic networks

来源：评论

学校读者我要写书评

暂无评论

Research on Modeling and Simulation of Smart Substation Cyber-Physical System Considering Coupling Analysis

引用

Journal of Physics: Conference Series 2021年第1期1771卷

作者： Huifeng Yang Liandong Chen Kai Cheng Gang Li Xinying Wang State Grid Hebei Information & Telecommunication Branch Shijiazhuang Hebei China North China Electric Power University/School of Control and Computer Engineering Baoding Hebei China

With the rapid development of Internet of Things and communication technologies, substations are becoming more intelligent, which brings opportunities for cyber attacks, threatens the safety of substations, and the high coupling of equipment in substations increases the threat. This paper analyzes and studies the information-physical characteristics and equipment coupling problems of smart substations, constructs a smart substation CPS model based on the balance equation of state quantity, and designs a line fault simulation example to verify the stability of the model.

关键词：

来源：评论

学校读者我要写书评

暂无评论

No 8-Instant ZTD (Zhang Time Discretization) Formula with Quintic Precision or Higher as Proved

No 8-Instant ZTD (Zhang Time Discretization) Formula with Qu...

引用

Chinese Automation Congress (CAC)

作者： Yunong Zhang Kangze Zheng Jinjin Guo School of Computer Science and Engineering Sun Yat-sen University Guangzhou P. R. China Guangdong Key Laboratory of Modern Control Technology Guangzhou P. R. China Research Institute of Sun Yat-sen University in Shenzhen Shenzhen P. R. China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Guangzhou P. R. China

ISBN: (数字)9781665426473

ISBN: (纸本)9781665426480

Since 2014, Zhang time discretization (ZTD, also termed Zhang et al. discretization) formulas have been put forward as a new method for time discretization by Zhang et al. Originally, ZTD formulas were used to obtain discrete Zhang neural network (ZNN) model from continuous ZNN one. ZTD formulas were also used later to discretize other continuous-time systems. So far, ZTD formulas with various number of instants have been proposed and applied, and the highest precisions of the 2-instant ZTD formula to 7-instant ZTD formulas have been discovered. Instinctively, we want to find out the highest precision of 8-instant ZTD formulas. During our investigation, we ascertain that any convergent 8-instant ZTD formula cannot possess quintic precision or higher. Combined with previous work, we conclude that any 8-instant ZTD formula converges with a truncation error in proportion to the 4-th power of the sampling interval or greater. The conclusion is proved in our paper.

关键词： Automation Stability criteria Neural networks Finite wordlength effects Thermal stability

来源：评论

学校读者我要写书评

暂无评论

Monitoring Model of Coal Mill in Power Plant Based on Big Data and BP Neural Network

Monitoring Model of Coal Mill in Power Plant Based on Big Da...

引用

Chinese Automation Congress (CAC)

作者： Yanping Li Liang Tian Yaokui Gao Yongping Li School of control and computer Engineering North China Electric Power University Beijing China School of control and computer Engineering North China Electric Power University Baoding China Electrical Power Design and Explore Institute of Inner Mongolia Co. Ltd Hohhot China

In order to monitor the wear condition of grinding roller of coal mill in power plant and improve the reliability of production equipment, it is necessary to establish a state monitoring model with high accuracy and good prediction effect. It has been shown that the power of coal mill can reflect the wear degree of grinding roller. If the voltage and power factor of coal mill are constant, grinding current can be used to replace the power of coal mill. In this paper, through collecting field historical operation data and data preprocessing, the current model of coal mill is established by using double hidden layers BP (Back Propagation) neural network to predict the wear state of grinding roller. The simulation results show that compared with single hidden layer, double hidden layers BP neural network can improve the performance of the network, so as to improve the prediction accuracy of the model and provide basis for the follow-up maintenance of coal mill, which has certain practical engineering significance.

关键词： Coal Neural networks Data models Predictive models Power generation Mathematical model Training

来源：评论

学校读者我要写书评

暂无评论

AI and Reading Fluency for Brazilian Portuguese: A Preliminary Study

SSRN

引用

SSRN 2023年

作者： Rodrigues, Aline Do Nascimento Ribeiro, Gabriela L. Silva, Victor H.A. Carvalho, Wesley S. Ramírez, Miguel A. Alves, Luciana M. Finger, Marcelo Navas, Ana Luiza G.P. Ribeiro, Carlos H.C. Computer Science Division Aeronautics Institute of Technology Praça Mal. Eduardo Gomes 50 SP Sao Jose dos Campos12228-900 Brazil Federal University of Minas Gerais Medicine Faculty Department of Speech Therapy Av. Prof. Alfredo Balena 190 MG Belo Horizonte30130-100 Brazil University of Sao Paulo Escola Politecnica Department of Telecommunications and Control Engineering Av. Prof. Luciano Gualberto trav. 3 158 SP Sao Paulo05508-010 Brazil University of Sao Paulo Institute of Mathematics and Statistics Department of Computer Science Rua do Matao 1010 SP Sao Paulo05508-090 Brazil University of Sao Paulo Escola Politecnica Department of Electronic Systems Engineering Av. Prof. Luciano Gualberto trav. 3 158 SP Sao Paulo05508-010 Brazil School of Medical Sciences of Santa Casa de Sao Paulo Department of Speech Therapy R. Dr. Cesario Motta Jr. 61 SP Sao Paulo01221-020 Brazil

Automatic assessment of oral reading fluency — either for completely autonomous operation or as a facilitator for human decision making — is a likely requirement for timely interventions regarding educational policies for Literacy, especially at the initial years of formal Education. Countries with huge populations such as Brazil have a more urgent demand for such automated procedures, considering the scale of the evaluation needs and the disproportional lack of specialized personnel, compared to more advanced countries. Nevertheless, computational methods as educational aids for Literacy evaluation have been developed mainly for English and other languages associated with those high income countries. Therefore there is an obvious need for studies on languages and countries (especially those with large educational populations) that are less developed. We report on a computational model for fluency assessment based on an automatic speech recognizer (ASR) readily available in the software literature, trained via a deep learning model on a publicly available dataset for Brazilian Portuguese. The model was previously trained for ASR purposes, and therefore was not designed for Literacy assessment of children, this aspect was dealt with through a series of pre and post-processing of the audio samples. Extensive comparative results on reading oral fluency for standardized assessment texts considering the proposed automated process compared to a benchmark by human expert annotations showed a high matching for measures on word and word error rates, despite the fact that the learning model did not include samples from the target population. © 2023, The Authors. All rights reserved.

关键词： Computational methods

来源：评论

学校读者我要写书评

暂无评论

Sample Complexity Lower Bounds for Linear System Identification

Sample Complexity Lower Bounds for Linear System Identificat...

引用

IEEE Annual Conference on Decision and control

作者： Yassir Jedra Alexandre Proutiere Division of Decision and Control Systems School of Electrical Engineering and Computer Science Royal institute of Technology (KTH) Stockholm Sweden

ISBN: (数字)9781728113982

ISBN: (纸本)9781728113999

This paper establishes problem-specific sample complexity lower bounds for linear system identification problems. The sample complexity is defined in the PAC framework: it corresponds to the time it takes to identify the system parameters with prescribed accuracy and confidence levels. By problem-specific, we mean that the lower bound explicitly depends on the system to be identified (which contrasts with minimax lower bounds), and hence really captures the identification hardness specific to the system. We consider both uncontrolled and controlled systems. For uncontrolled systems, the lower bounds are valid for any linear system, stable or not, and only depend on the system finite-time controllability gramian. A simplified lower bound depending on the spectrum of the system only is also derived. In view of recent finite-time analysis of classical estimation methods (e.g. ordinary least squares), our sample complexity lower bounds are tight for many systems. For controlled systems, our lower bounds are not as explicit as in the case of uncontrolled systems, but could well provide interesting insights into the design of control policy with minimal sample complexity.

关键词： Complexity theory Linear systems Estimation Optimization Heuristic algorithms controllability

来源：评论

学校读者我要写书评

暂无评论

Robust Trajectory Tracking control for Underactuated Autonomous Underwater Vehicles

Robust Trajectory Tracking Control for Underactuated Autonom...

引用

IEEE Conference on Decision and control

作者： Shahab Heshmati-alamdari Alexandros Nikou Dimos V. Dimarogonas Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden

ISBN: (数字)9781728113982

ISBN: (纸本)9781728113999

This paper addresses the tracking control problem of 3D trajectories for underactuated underwater robotic vehicles operating in an uncertain workspace including obstacles. In particular, a robust Nonlinear Model Predictive control (NMPC) scheme is presented for the case of underactuated Autonomous Underwater Vehicles (AUVs) (i.e., vehicles actuated only in surge, heave and yaw). The purpose of the controller is to steer the underactuated AUV to a desired trajectory with guaranteed input and state constraints inside a dynamic environment where the knowledge of the operating workspace is constantly updated on-line via the vehicle's on-board sensors. In particular, obstacle avoidance with any of the detected obstacles is guaranteed, despite the model dynamic uncertainties and the presence of external disturbances representing ocean currents and waves. The proposed feedback control law consists of two parts: an online law which is the outcome of a Finite Horizon Optimal control Problem (FHOCP) solved for the nominal dynamics; and a state feedback law which is tuned offline and guarantees that the real trajectories remain bounded in a hyper-tube centered along the nominal trajectories for all times. Finally, a simulation study verifies the performance and efficiency of the proposed approach.

关键词： Trajectory Underwater vehicles Vehicle dynamics Robot sensing systems Robustness

来源：评论

学校读者我要写书评

暂无评论

Exploring the Pan-Relationship Between Disease and Symptom Related to Coronary Heart Disease from Chinese Electronic Medical Records 15th

Exploring the Pan-Relationship Between Disease and Symptom R...

引用

15th International Conference on Intelligent Computing, ICIC 2019

作者： Yang, Ronggen Wang, Yichen Wang, Bo Gong, Lejun Faculty of Intelligent Science and Control Engineering Jinling Institute of Technology Nanjing211169 China Jiangsu Key Lab of Big Data Security and Intelligent Processing School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210046 China School of Geography and Bioinformatics Nanjing University of Posts and Telecommunication Nanjing China

ISBN: (纸本)9783030267650

Electronic Medical Records (EMRs) arises from the clinical treatment process, which reflects a patient’s physical condition, the disease, the treatment process, etc. It has an important significance for the recovery of the patient. As the amount of electronic medical records continues to increase, people are actively looking for ways to get the valid data contained in electronic medical records. More effective methods are urgently needed for processing EMRs. In this paper, 108 real EMRs of coronary heart disease were analyzed, through named entity recognition and entity relation extraction. Pan-relationship between entities was defined in the process. Experimental results showed the analysis of pan-relation between coronary heart disease and symptom is helpful for treatment of coronary heart disease. © 2019, Springer Nature Switzerland AG.

关键词： Diseases

来源：评论

学校读者我要写书评

暂无评论

Toward Tractable Global Solutions to Maximum-Likelihood Estimation Problems via Sparse Sum-of-Squares Relaxations

Toward Tractable Global Solutions to Maximum-Likelihood Esti...

引用

IEEE Annual Conference on Decision and control

作者： Diogo Rodrigues Mohamed R. Abdalmoaty Hakan Hjalmarsson Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden

ISBN: (数字)9781728113982

ISBN: (纸本)9781728113999

In system identification, the maximum-likelihood method is typically used for parameter estimation owing to a number of optimal statistical properties. However, in many cases, the likelihood function is nonconvex. The solutions are usually obtained by local numerical optimization algorithms that require good initialization and cannot guarantee global optimality. This paper proposes a computationally tractable method that computes the maximum-likelihood parameter estimates with posterior certification of global optimality via the concept of sum-of-squares polynomials and sparse semidefinite relaxations. It is shown that the method can be applied to certain classes of discrete-time linear models. This is achieved by taking advantage of the rational structure of these models and the sparsity in the maximum-likelihood parameter estimation problem. The method is illustrated on a simulation model of a resonant mechanical system where standard methods struggle.

关键词： Optimization Maximum likelihood estimation Computational modeling Parameter estimation Random variables Convergence

来源：评论

学校读者我要写书评

暂无评论

A Non-Stop Double Buffering Mechanism for Dataflow Architecture

引用

Journal of computer Science & Technology 2018年第1期33卷 145-157页

作者： Xu Tan Xiao-Wei Shen Xiao-Chun Ye Da Wang Dong-Rui Fan Lunkai Zhang Wen-Ming Li Zhi-Min Zhang Zhi-Min Tang State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing 100049 China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi 214125 China Department of Computer Science The University of Chicago Chicago IL 60637 U.S.A.

Double buffering is an effective mechanism to hide the latency of data transfers between on-chip and off-chip memory. However, in dataflow architecture, the swapping of two buffers during the execution of many tiles decreases the performance because of repetitive filling and draining of the dataflow accelerator. In this work, we propose a non-stop double buffering mechanism for dataflow architecture. The proposed non-stop mechanism assigns tiles to the processing element array without stopping the execution of processing elements through optimizing control logic in dataflow architecture. Moreover, we propose a work-flow program to cooperate with the non-stop double buffering mechanism. After optimizations both on control logic and on work-flow program, the filling and draining of the array needs to be done only once across the execution of all tiles belonging to the same dataflow graph. Experimental results show that the proposed double buffering mechanism for dataftow architecture achieves a 16.2% average efficiency improvement over that without the optimization.

关键词： non-stop double buffering dataflow architecture high-performance computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：