We propose a new proportional-integral-derivative (PID) controller design method for an automatic voltage regulation (AVR) system based on approximate model matching in the frequency domain. The parameters of the PID controller are obtained by approximate frequency response matching between the closed-loop control system and a reference model with the desired specifications. Two low frequency points are required for matching the frequency response, and the design method yields linear algebraic equations, solution of which gives the controller parameters. The effectiveness of the proposed method is demonstrated through examples taken from the literature and comparison with some popular methods.
{"title":"A frequency domain design of PID controller for an AVR system","authors":"Md. Nishat Anwar, S. Pan","doi":"10.1631/jzus.C1300218","DOIUrl":"https://doi.org/10.1631/jzus.C1300218","url":null,"abstract":"We propose a new proportional-integral-derivative (PID) controller design method for an automatic voltage regulation (AVR) system based on approximate model matching in the frequency domain. The parameters of the PID controller are obtained by approximate frequency response matching between the closed-loop control system and a reference model with the desired specifications. Two low frequency points are required for matching the frequency response, and the design method yields linear algebraic equations, solution of which gives the controller parameters. The effectiveness of the proposed method is demonstrated through examples taken from the literature and comparison with some popular methods.","PeriodicalId":49947,"journal":{"name":"Journal of Zhejiang University-Science C-Computers & Electronics","volume":"15 1","pages":"293 - 299"},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.C1300218","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67533948","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The frequent outbreak of severe foodborne diseases (e.g., haemolytic uraemic syndrome and Listeriosis) in 2011 warns of a potential threat that world trade could spread fatal pathogens (e.g., enterohemorrhagic Escherichia coli). The epidemic potential from trade involves both intra-proliferation and inter-diffusion. Here, we present a worldwide vegetable trade network and a stochastic computational model to simulate global trade-mediated epidemics by considering the weighted nodes and edges of the network and the dual-scale dynamics of epidemics. We address two basic issues of network structural impact in global epidemic patterns: (1) in contrast to the prediction of heterogeneous network models, the broad variability of node degree and edge weights of the vegetable trade network do not determine the threshold of global epidemics; (2) a ‘penetration effect’, by which community structures do not restrict propagation at the global scale, quickly facilitates bridging the edges between communities, and leads to synchronized diffusion throughout the entire network. We have also defined an appropriate metric that combines dual-scale behavior and enables quantification of the critical role of bridging edges in disease diffusion from widespread trading. The unusual structure mechanisms of the trade network model may be useful in producing strategies for adaptive immunity and reducing international trade frictions.
{"title":"Modeling dual-scale epidemic dynamics on complex networks with reaction diffusion processes","authors":"Xiaogang Jin, Yong Min","doi":"10.1631/jzus.C1300243","DOIUrl":"https://doi.org/10.1631/jzus.C1300243","url":null,"abstract":"The frequent outbreak of severe foodborne diseases (e.g., haemolytic uraemic syndrome and Listeriosis) in 2011 warns of a potential threat that world trade could spread fatal pathogens (e.g., enterohemorrhagic Escherichia coli). The epidemic potential from trade involves both intra-proliferation and inter-diffusion. Here, we present a worldwide vegetable trade network and a stochastic computational model to simulate global trade-mediated epidemics by considering the weighted nodes and edges of the network and the dual-scale dynamics of epidemics. We address two basic issues of network structural impact in global epidemic patterns: (1) in contrast to the prediction of heterogeneous network models, the broad variability of node degree and edge weights of the vegetable trade network do not determine the threshold of global epidemics; (2) a ‘penetration effect’, by which community structures do not restrict propagation at the global scale, quickly facilitates bridging the edges between communities, and leads to synchronized diffusion throughout the entire network. We have also defined an appropriate metric that combines dual-scale behavior and enables quantification of the critical role of bridging edges in disease diffusion from widespread trading. The unusual structure mechanisms of the trade network model may be useful in producing strategies for adaptive immunity and reducing international trade frictions.","PeriodicalId":49947,"journal":{"name":"Journal of Zhejiang University-Science C-Computers & Electronics","volume":"15 1","pages":"265 - 274"},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.C1300243","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67534104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. Cuadrado-Gallego, A. Abran, Pablo Rodríguez-Soria, Miguel A. Lara
The use of functional size measurement (FSM) methods in software development organizations is growing during the years. Also, object oriented (OO) techniques have become quite a standard to design the software and, in particular, Use Cases is one of the most used techniques to specify functional requirements. Main FSM methods do not include specific rules to measure the software functionality from its Use Cases analysis. To deal with this issue some other methods like Kramer’s functional measurement method have been developed. Therefore, one of the main issues for those organizations willing to use OO functional measurement method in order to facilitate the use cases count procedure is how to convert their portfolio functional size from the previously adopted FSM method towards the new method. The objective of this research is to find a statistical relationship for converting the software functional size units measured by the International Function Point Users Group (IFPUG) function point analysis (FPA) method into Kramer-Smith’s use cases points (UCP) method and vice versa. Methodologies for a correct data gathering are proposed and results obtained are analyzed to draw the linear and non-linear equations for this correlation. Finally, a conversion factor and corresponding conversion intervals are given to establish the statistical relationship.
{"title":"An experimental study on the conversion between IFPUG and UCP functional size measurement units","authors":"J. Cuadrado-Gallego, A. Abran, Pablo Rodríguez-Soria, Miguel A. Lara","doi":"10.1631/jzus.C1300102","DOIUrl":"https://doi.org/10.1631/jzus.C1300102","url":null,"abstract":"The use of functional size measurement (FSM) methods in software development organizations is growing during the years. Also, object oriented (OO) techniques have become quite a standard to design the software and, in particular, Use Cases is one of the most used techniques to specify functional requirements. Main FSM methods do not include specific rules to measure the software functionality from its Use Cases analysis. To deal with this issue some other methods like Kramer’s functional measurement method have been developed. Therefore, one of the main issues for those organizations willing to use OO functional measurement method in order to facilitate the use cases count procedure is how to convert their portfolio functional size from the previously adopted FSM method towards the new method. The objective of this research is to find a statistical relationship for converting the software functional size units measured by the International Function Point Users Group (IFPUG) function point analysis (FPA) method into Kramer-Smith’s use cases points (UCP) method and vice versa. Methodologies for a correct data gathering are proposed and results obtained are analyzed to draw the linear and non-linear equations for this correlation. Finally, a conversion factor and corresponding conversion intervals are given to establish the statistical relationship.","PeriodicalId":49947,"journal":{"name":"Journal of Zhejiang University-Science C-Computers & Electronics","volume":"15 1","pages":"161-173"},"PeriodicalIF":0.0,"publicationDate":"2014-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.C1300102","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67533028","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Fengfei Zhao, Zhengyang Qin, Zhuo Shao, Jun Fang, Bo-yan Ren
Reinforcement learning (RL) in real-world problems requires function approximations that depend on selecting the appropriate feature representations. Representational expansion techniques can make linear approximators represent value functions more effectively; however, most of these techniques function well only for low dimensional problems. In this paper, we present the greedy feature replacement (GFR), a novel online expansion technique, for value-based RL algorithms that use binary features. Given a simple initial representation, the feature representation is expanded incrementally. New feature dependencies are added automatically to the current representation and conjunctive features are used to replace current features greedily. The virtual temporal difference (TD) error is recorded for each conjunctive feature to judge whether the replacement can improve the approximation. Correctness guarantees and computational complexity analysis are provided for GFR. Experimental results in two domains show that GFR achieves much faster learning and has the capability to handle large-scale problems.
{"title":"Greedy feature replacement for online value function approximation","authors":"Fengfei Zhao, Zhengyang Qin, Zhuo Shao, Jun Fang, Bo-yan Ren","doi":"10.1631/jzus.C1300246","DOIUrl":"https://doi.org/10.1631/jzus.C1300246","url":null,"abstract":"Reinforcement learning (RL) in real-world problems requires function approximations that depend on selecting the appropriate feature representations. Representational expansion techniques can make linear approximators represent value functions more effectively; however, most of these techniques function well only for low dimensional problems. In this paper, we present the greedy feature replacement (GFR), a novel online expansion technique, for value-based RL algorithms that use binary features. Given a simple initial representation, the feature representation is expanded incrementally. New feature dependencies are added automatically to the current representation and conjunctive features are used to replace current features greedily. The virtual temporal difference (TD) error is recorded for each conjunctive feature to judge whether the replacement can improve the approximation. Correctness guarantees and computational complexity analysis are provided for GFR. Experimental results in two domains show that GFR achieves much faster learning and has the capability to handle large-scale problems.","PeriodicalId":49947,"journal":{"name":"Journal of Zhejiang University-Science C-Computers & Electronics","volume":"15 1","pages":"223 - 231"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.C1300246","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67534169","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We propose a robust scheme to achieve the synchronization of chaotic systems with modeling mismatches and parametric variations. The proposed algorithm combines high-order sliding mode and feedback control. The sliding mode is used to estimate the synchronization error between the master and the slave as well as its time derivatives, while feedback control is used to drive the slave track the master. The stability of the proposed design is proved theoretically, and its performance is verified by some numerical simulations. Compared with some existing synchronization algorithms, the proposed algorithm shows faster convergence and stronger robustness to system uncertainties.
{"title":"Robust synchronization of chaotic systems using slidingmode and feedback control","authors":"Li-li Li, Ying Liu, Qi-guo Yao","doi":"10.1631/jzus.C1300266","DOIUrl":"https://doi.org/10.1631/jzus.C1300266","url":null,"abstract":"We propose a robust scheme to achieve the synchronization of chaotic systems with modeling mismatches and parametric variations. The proposed algorithm combines high-order sliding mode and feedback control. The sliding mode is used to estimate the synchronization error between the master and the slave as well as its time derivatives, while feedback control is used to drive the slave track the master. The stability of the proposed design is proved theoretically, and its performance is verified by some numerical simulations. Compared with some existing synchronization algorithms, the proposed algorithm shows faster convergence and stronger robustness to system uncertainties.","PeriodicalId":49947,"journal":{"name":"Journal of Zhejiang University-Science C-Computers & Electronics","volume":"15 1","pages":"211 - 222"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.C1300266","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67534696","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
R. Uthra, S. V. Kasmir Raja, A. Jeyasekar, A. Lattanze
Any node in a wireless sensor network is a resource constrained device in terms of memory, bandwidth, and energy, which leads to a large number of packet drops, low throughput, and significant waste of energy due to retransmission. This paper presents a new approach for predicting congestion using a probabilistic method and controlling congestion using new rate control methods. The probabilistic approach used for prediction of the occurrence of congestion in a node is developed using data traffic and buffer occupancy. The rate control method uses a back-off selection scheme and also rate allocation schemes, namely rate regulation (RRG) and split protocol (SP), to improve throughput and reduce packet drop. A back-off interval selection scheme is introduced in combination with rate reduction (RR) and RRG. The back-off interval selection scheme considers channel state and collision-free transmission to prevent congestion. Simulations were conducted and the results were compared with those of decentralized predictive congestion control (DPCC) and adaptive duty-cycle based congestion control (ADCC). The results showed that the proposed method reduces congestion and improves performance.
{"title":"A probabilistic approach for predictive congestion control in wireless sensor networks","authors":"R. Uthra, S. V. Kasmir Raja, A. Jeyasekar, A. Lattanze","doi":"10.1631/jzus.C1300175","DOIUrl":"https://doi.org/10.1631/jzus.C1300175","url":null,"abstract":"Any node in a wireless sensor network is a resource constrained device in terms of memory, bandwidth, and energy, which leads to a large number of packet drops, low throughput, and significant waste of energy due to retransmission. This paper presents a new approach for predicting congestion using a probabilistic method and controlling congestion using new rate control methods. The probabilistic approach used for prediction of the occurrence of congestion in a node is developed using data traffic and buffer occupancy. The rate control method uses a back-off selection scheme and also rate allocation schemes, namely rate regulation (RRG) and split protocol (SP), to improve throughput and reduce packet drop. A back-off interval selection scheme is introduced in combination with rate reduction (RR) and RRG. The back-off interval selection scheme considers channel state and collision-free transmission to prevent congestion. Simulations were conducted and the results were compared with those of decentralized predictive congestion control (DPCC) and adaptive duty-cycle based congestion control (ADCC). The results showed that the proposed method reduces congestion and improves performance.","PeriodicalId":49947,"journal":{"name":"Journal of Zhejiang University-Science C-Computers & Electronics","volume":"15 1","pages":"187 - 199"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.C1300175","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67533477","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Liwen Liu, Y. Li, Ming Zhang, Lianghao Wang, Dongxiao Li
Both time-of-flight (ToF) cameras and passive stereo can provide the depth information for their corresponding captured real scenes, but they have innate limitations. ToF cameras and passive stereo are intrinsically complementary for certain tasks. It is desirable to appropriately leverage all the available information by ToF cameras and passive stereo. Although some fusion methods have been presented recently, they fail to consider ToF reliability detection and ToF based improvement of passive stereo. As a result, this study proposes an approach to integrating ToF cameras and passive stereo to obtain high-accuracy depth maps. The main contributions are: (1) An energy cost function is devised to use data from ToF cameras to boost the stereo matching of passive stereo; (2) A fusion method is used to combine the depth information from both ToF cameras and passive stereo to obtain high-accuracy depth maps. Experiments show that the proposed approach achieves improved results with high accuracy and robustness.
{"title":"K-nearest neighborhood based integration of time-of-flight cameras and passive stereo for high-accuracy depth maps","authors":"Liwen Liu, Y. Li, Ming Zhang, Lianghao Wang, Dongxiao Li","doi":"10.1631/jzus.C1300194","DOIUrl":"https://doi.org/10.1631/jzus.C1300194","url":null,"abstract":"Both time-of-flight (ToF) cameras and passive stereo can provide the depth information for their corresponding captured real scenes, but they have innate limitations. ToF cameras and passive stereo are intrinsically complementary for certain tasks. It is desirable to appropriately leverage all the available information by ToF cameras and passive stereo. Although some fusion methods have been presented recently, they fail to consider ToF reliability detection and ToF based improvement of passive stereo. As a result, this study proposes an approach to integrating ToF cameras and passive stereo to obtain high-accuracy depth maps. The main contributions are: (1) An energy cost function is devised to use data from ToF cameras to boost the stereo matching of passive stereo; (2) A fusion method is used to combine the depth information from both ToF cameras and passive stereo to obtain high-accuracy depth maps. Experiments show that the proposed approach achieves improved results with high accuracy and robustness.","PeriodicalId":49947,"journal":{"name":"Journal of Zhejiang University-Science C-Computers & Electronics","volume":"15 1","pages":"174 - 186"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.C1300194","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67533840","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yong Wang, Xiaolu Ma, Yunteng Lao, Haifeng Yu, Yong Liu
The vehicle routing problem (VRP) is a well-known combinatorial optimization issue in transportation and logistics network systems. There exist several limitations associated with the traditional VRP. Releasing the restricted conditions of traditional VRP has become a research focus in the past few decades. The vehicle routing problem with split deliveries and pickups (VRPSPDP) is particularly proposed to release the constraints on the visiting times per customer and vehicle capacity, that is, to allow the deliveries and pickups for each customer to be simultaneously split more than once. Few studies have focused on the VRPSPDP problem. In this paper we propose a two-stage heuristic method integrating the initial heuristic algorithm and hybrid heuristic algorithm to study the VRPSPDP problem. To validate the proposed algorithm, Solomon benchmark datasets and extended Solomon benchmark datasets were modified to compare with three other popular algorithms. A total of 18 datasets were used to evaluate the effectiveness of the proposed method. The computational results indicated that the proposed algorithm is superior to these three algorithms for VRPSPDP in terms of total travel cost and average loading rate.
{"title":"A two-stage heuristic method for vehicle routing problem with split deliveries and pickups","authors":"Yong Wang, Xiaolu Ma, Yunteng Lao, Haifeng Yu, Yong Liu","doi":"10.1631/jzus.C1300177","DOIUrl":"https://doi.org/10.1631/jzus.C1300177","url":null,"abstract":"The vehicle routing problem (VRP) is a well-known combinatorial optimization issue in transportation and logistics network systems. There exist several limitations associated with the traditional VRP. Releasing the restricted conditions of traditional VRP has become a research focus in the past few decades. The vehicle routing problem with split deliveries and pickups (VRPSPDP) is particularly proposed to release the constraints on the visiting times per customer and vehicle capacity, that is, to allow the deliveries and pickups for each customer to be simultaneously split more than once. Few studies have focused on the VRPSPDP problem. In this paper we propose a two-stage heuristic method integrating the initial heuristic algorithm and hybrid heuristic algorithm to study the VRPSPDP problem. To validate the proposed algorithm, Solomon benchmark datasets and extended Solomon benchmark datasets were modified to compare with three other popular algorithms. A total of 18 datasets were used to evaluate the effectiveness of the proposed method. The computational results indicated that the proposed algorithm is superior to these three algorithms for VRPSPDP in terms of total travel cost and average loading rate.","PeriodicalId":49947,"journal":{"name":"Journal of Zhejiang University-Science C-Computers & Electronics","volume":"15 1","pages":"200 - 210"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.C1300177","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67533531","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We propose a new power conversion system for a permanent magnet synchronous generator (PMSG) based grid-connected wind energy conversion system (WECS) operating with fully-controlled back-to-back current-source converters. On the generator side, two independent current-source rectifiers (CSRs) with space-vector pulse width modulation (SVPWM) are employed to regulate and stabilize DC-link currents. Between DC-link and the electrical grid, a direct-type three-phase five-level current-source inverter (CSI) is inserted as a buffer to regulate real and reactive power fed to the grid and thus adjusts the grid side power-factor. We also present a current-based maximum power point tracking (MPPT) scheme, which helps the generator extract the maximum power through closed-loop regulation of the generator speed. By applying the multilevel modulation and control strategies to the grid-side five-level CSI, a multilevel output current waveform with less distortion is produced, and the bulk requirement of the output capacitor filter to eliminate the harmonic current is reduced. All the proposed concepts are verified by simulation models built in a PSIM environment.
{"title":"A power conversion system for PMSG-based WECS operating with fully-controlled current-source converters","authors":"J. Bao, Wei-bing Bao, Yu-ling Li","doi":"10.1631/jzus.C1300231","DOIUrl":"https://doi.org/10.1631/jzus.C1300231","url":null,"abstract":"We propose a new power conversion system for a permanent magnet synchronous generator (PMSG) based grid-connected wind energy conversion system (WECS) operating with fully-controlled back-to-back current-source converters. On the generator side, two independent current-source rectifiers (CSRs) with space-vector pulse width modulation (SVPWM) are employed to regulate and stabilize DC-link currents. Between DC-link and the electrical grid, a direct-type three-phase five-level current-source inverter (CSI) is inserted as a buffer to regulate real and reactive power fed to the grid and thus adjusts the grid side power-factor. We also present a current-based maximum power point tracking (MPPT) scheme, which helps the generator extract the maximum power through closed-loop regulation of the generator speed. By applying the multilevel modulation and control strategies to the grid-side five-level CSI, a multilevel output current waveform with less distortion is produced, and the bulk requirement of the output capacitor filter to eliminate the harmonic current is reduced. All the proposed concepts are verified by simulation models built in a PSIM environment.","PeriodicalId":49947,"journal":{"name":"Journal of Zhejiang University-Science C-Computers & Electronics","volume":"15 1","pages":"232 - 240"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.C1300231","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67533962","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Based on the work in Ding and Ding (2008), we develop a modified stochastic gradient (SG) parameter estimation algorithm for a dual-rate Box-Jenkins model by using an auxiliary model. We simplify the complex dual-rate Box-Jenkins model to two finite impulse response (FIR) models, present an auxiliary model to estimate the missing outputs and the unknown noise variables, and compute all the unknown parameters of the system with colored noises. Simulation results indicate that the proposed method is effective.
在Ding and Ding(2008)的基础上，我们利用辅助模型开发了一种改进的双速率Box-Jenkins模型的随机梯度(SG)参数估计算法。我们将复杂的双速率Box-Jenkins模型简化为两个有限脉冲响应(FIR)模型，提出了一个辅助模型来估计缺失输出和未知噪声变量，并计算了带有彩色噪声的系统的所有未知参数。仿真结果表明，该方法是有效的。
{"title":"Stochastic gradient algorithm for a dual-rate Box-Jenkins model based on auxiliary model and FIRmode","authors":"Jing Chen, Ruifeng Ding","doi":"10.1631/jzus.C1300072","DOIUrl":"https://doi.org/10.1631/jzus.C1300072","url":null,"abstract":"Based on the work in Ding and Ding (2008), we develop a modified stochastic gradient (SG) parameter estimation algorithm for a dual-rate Box-Jenkins model by using an auxiliary model. We simplify the complex dual-rate Box-Jenkins model to two finite impulse response (FIR) models, present an auxiliary model to estimate the missing outputs and the unknown noise variables, and compute all the unknown parameters of the system with colored noises. Simulation results indicate that the proposed method is effective.","PeriodicalId":49947,"journal":{"name":"Journal of Zhejiang University-Science C-Computers & Electronics","volume":"15 1","pages":"147-152"},"PeriodicalIF":0.0,"publicationDate":"2014-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.C1300072","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67532153","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：