Pub Date : 2013-06-12DOI: 10.1109/ICCA.2013.6565175
Yong Yang, Bo Yang, X. Guan
We focus on downlink scheduling and resource allocation for orthogonal frequency division multiplexing (OFDM) wireless networks. From a perspective of network operators, the base station (BS) will charge the downlink users to earn revenue and pay for electricity consumption. The aim of network operators is to achieve better profits while ensuring network stability. In the context of smart grid, the BS can harvest renewable energy and store energy in order to cut down electricity cost. The challenge is that it is hard to obtain the accurate statistic knowledge of electricity price, random rate requests and renewable energy. Furthermore, we have to deal with the dynamic data rate requests from downlink users with heterogeneous quality of service (QoS) requirements. To handle the coupling between congestion control, energy consumption and radio resource allocation, we propose a pricing-based crosslayer scheduling and energy management algorithm PCSM based on Lyapunov optimization: the energy management can well regulate the electricity charging rate in case of interrupting the downlink service; the data rate pricing-based congestion control scheme collects proper revenue by setting data rate price to carry out flow control and profit maximization; the radio resource allocation can achieve adaptive allocation by using cross-layer information from the network layer as well as energy storage condition. Theoretical analysis shows that it can achieve a near-optimal performance when stabilizing the network and that its effectiveness is also validated through simulation results.
{"title":"Pricing-based cross-layer scheduling and energy management over OFDM downlink networks","authors":"Yong Yang, Bo Yang, X. Guan","doi":"10.1109/ICCA.2013.6565175","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6565175","url":null,"abstract":"We focus on downlink scheduling and resource allocation for orthogonal frequency division multiplexing (OFDM) wireless networks. From a perspective of network operators, the base station (BS) will charge the downlink users to earn revenue and pay for electricity consumption. The aim of network operators is to achieve better profits while ensuring network stability. In the context of smart grid, the BS can harvest renewable energy and store energy in order to cut down electricity cost. The challenge is that it is hard to obtain the accurate statistic knowledge of electricity price, random rate requests and renewable energy. Furthermore, we have to deal with the dynamic data rate requests from downlink users with heterogeneous quality of service (QoS) requirements. To handle the coupling between congestion control, energy consumption and radio resource allocation, we propose a pricing-based crosslayer scheduling and energy management algorithm PCSM based on Lyapunov optimization: the energy management can well regulate the electricity charging rate in case of interrupting the downlink service; the data rate pricing-based congestion control scheme collects proper revenue by setting data rate price to carry out flow control and profit maximization; the radio resource allocation can achieve adaptive allocation by using cross-layer information from the network layer as well as energy storage condition. Theoretical analysis shows that it can achieve a near-optimal performance when stabilizing the network and that its effectiveness is also validated through simulation results.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123648619","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}
Pub Date : 2013-06-12DOI: 10.1109/ICCA.2013.6564900
M. Er, Zhifei Shao, Ning Wang
Extreme Learning Machine (ELM) has attracted many researchers as a universal function approximator because of its extremely fast learning speed and good generalization performance. Recently, a new trend in ELM emerges to combine it with ridge regression, which has been shown improved stability and generalization performance. However, this ridge parameter is determined through a trial-and-error manner, an unsatisfactory approach for automatic learning applications. In this paper, the differences between ridge ELM and ordinary Neural Networks are discussed as well as special properties of ridge ELM and various approaches to derive the ridge parameter. Furthermore, a semi-cross-validation ridge parameter selection procedure based on the special properties of ridge ELM is proposed. This approach, termed as Semi-Cross-validation Ridge ELM (SC-R-ELM), is also demonstrated to achieve robust and reliable results in 11 regression data sets.
{"title":"A systematic method to guide the choice of ridge parameter in ridge extreme learning machine","authors":"M. Er, Zhifei Shao, Ning Wang","doi":"10.1109/ICCA.2013.6564900","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6564900","url":null,"abstract":"Extreme Learning Machine (ELM) has attracted many researchers as a universal function approximator because of its extremely fast learning speed and good generalization performance. Recently, a new trend in ELM emerges to combine it with ridge regression, which has been shown improved stability and generalization performance. However, this ridge parameter is determined through a trial-and-error manner, an unsatisfactory approach for automatic learning applications. In this paper, the differences between ridge ELM and ordinary Neural Networks are discussed as well as special properties of ridge ELM and various approaches to derive the ridge parameter. Furthermore, a semi-cross-validation ridge parameter selection procedure based on the special properties of ridge ELM is proposed. This approach, termed as Semi-Cross-validation Ridge ELM (SC-R-ELM), is also demonstrated to achieve robust and reliable results in 11 regression data sets.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124237621","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}
Pub Date : 2013-06-12DOI: 10.1109/ICCA.2013.6564954
M. J. Tippett, C. Zheng, J. Bao
An approach to distributed plant-wide analysis and control of networked systems with varying time delay in discrete time is presented, with a particular focus on chemical process systems. Plant-wide stability and performance conditions are ensured by putting constraints on the dissipativity properties of the plant-wide system, which is a linear function of the dissipativity properties of individual subsystems. To facilitate this, dynamic supply rates in the form of quadratic difference forms are used, which provide less conservative stability conditions than traditional forms of dissipativity and allow for the effect of time delays to be captured. The control design procedure includes a global planning stage where the required dissipativity of each controller is determined, followed by the independent synthesis of each controller which may take the form of either a linear controller or model predictive controller. This framework may be extended to consider additional forms of uncertainty.
{"title":"Dissipativity based analysis and control of process networks with varying time delay","authors":"M. J. Tippett, C. Zheng, J. Bao","doi":"10.1109/ICCA.2013.6564954","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6564954","url":null,"abstract":"An approach to distributed plant-wide analysis and control of networked systems with varying time delay in discrete time is presented, with a particular focus on chemical process systems. Plant-wide stability and performance conditions are ensured by putting constraints on the dissipativity properties of the plant-wide system, which is a linear function of the dissipativity properties of individual subsystems. To facilitate this, dynamic supply rates in the form of quadratic difference forms are used, which provide less conservative stability conditions than traditional forms of dissipativity and allow for the effect of time delays to be captured. The control design procedure includes a global planning stage where the required dissipativity of each controller is determined, followed by the independent synthesis of each controller which may take the form of either a linear controller or model predictive controller. This framework may be extended to consider additional forms of uncertainty.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129855317","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}
Pub Date : 2013-06-12DOI: 10.1109/ICCA.2013.6564938
Zhenhao Zhu, Zhang Tao, Baoji Wan
Based on the analysis of the pixel value difference (PVD) histograms of the cover and stego-images, a special steganalyzer is proposed for the edge adaptive image steganography based on least-significant-bit matching revisited (EA-LSBMR). The EA-LSBMR steganography utilizes the sharper edge regions within the cover images to embed the secret message firstly, which achieves a higher security. However, there exists unavoidable weakness: abnormal increasing at some position of the PVD histogram. The special steganslytic method is designed using the weakness of the EA-LSBMR steganography. Extensive experimental results show that the proposed method can defeat the EA-LSBMR steganography effectively.
{"title":"A special detector for the edge adaptive image steganography based on LSB matching revisited","authors":"Zhenhao Zhu, Zhang Tao, Baoji Wan","doi":"10.1109/ICCA.2013.6564938","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6564938","url":null,"abstract":"Based on the analysis of the pixel value difference (PVD) histograms of the cover and stego-images, a special steganalyzer is proposed for the edge adaptive image steganography based on least-significant-bit matching revisited (EA-LSBMR). The EA-LSBMR steganography utilizes the sharper edge regions within the cover images to embed the secret message firstly, which achieves a higher security. However, there exists unavoidable weakness: abnormal increasing at some position of the PVD histogram. The special steganslytic method is designed using the weakness of the EA-LSBMR steganography. Extensive experimental results show that the proposed method can defeat the EA-LSBMR steganography effectively.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128039394","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}
Pub Date : 2013-06-12DOI: 10.1109/ICCA.2013.6565188
Liang Li, Yongcheng Li, Qing Ling
The Dantzig selector is a linear regression model which aims to sparsely represent a response vector by regressors. This paper introduces two fast algorithms which solve the Dantzig selector. One algorithm is linearized alternating direction method (LADMM) which utilizes the separable structure to solve the Dantzig selector; another is a variant of Dantzig selector with sequential optimization (DASSO) which utilizes the sparsity prior to solve the Dantzig selector. We numerically compare the two algorithms on standard data sets, and show that taking advantage of properties of the problem itself enables designing fast algorithms.
{"title":"Fast algorithms to solve the Dantzig selector","authors":"Liang Li, Yongcheng Li, Qing Ling","doi":"10.1109/ICCA.2013.6565188","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6565188","url":null,"abstract":"The Dantzig selector is a linear regression model which aims to sparsely represent a response vector by regressors. This paper introduces two fast algorithms which solve the Dantzig selector. One algorithm is linearized alternating direction method (LADMM) which utilizes the separable structure to solve the Dantzig selector; another is a variant of Dantzig selector with sequential optimization (DASSO) which utilizes the sparsity prior to solve the Dantzig selector. We numerically compare the two algorithms on standard data sets, and show that taking advantage of properties of the problem itself enables designing fast algorithms.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128902891","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}
Pub Date : 2013-06-12DOI: 10.1109/ICCA.2013.6564981
Huabiao Qin, Cong Yu, Lianxiang Guo, Yanxi Zhou
Developing multi-hop communication in vehicular ad hoc networks (VANET) is a challenging problem. The rapidly changing topology and frequent network disconnections of vehicles cause failure or inefficiency in traditional ad hoc routing protocols. This paper propose Adaptive State Aware Routing (ASAR) Protocol, which solve these problems by adaptively selecting an optimal route with an estimated transmission delay model that takes into account real-time vehicle density and average speed. Simulation results show that the proposed ASAR protocol effectively increases the data delivery ratio, and significantly reduces the end to end delay and routing overhead, which is better than other existing VANET routing protocols.
{"title":"Adaptive state aware routing protocol for vehicle ad hoc network in urban scenarios","authors":"Huabiao Qin, Cong Yu, Lianxiang Guo, Yanxi Zhou","doi":"10.1109/ICCA.2013.6564981","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6564981","url":null,"abstract":"Developing multi-hop communication in vehicular ad hoc networks (VANET) is a challenging problem. The rapidly changing topology and frequent network disconnections of vehicles cause failure or inefficiency in traditional ad hoc routing protocols. This paper propose Adaptive State Aware Routing (ASAR) Protocol, which solve these problems by adaptively selecting an optimal route with an estimated transmission delay model that takes into account real-time vehicle density and average speed. Simulation results show that the proposed ASAR protocol effectively increases the data delivery ratio, and significantly reduces the end to end delay and routing overhead, which is better than other existing VANET routing protocols.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122148816","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}
Pub Date : 2013-06-12DOI: 10.1109/ICCA.2013.6564898
Li Li, Binhai Wang, Beidou Li, Peng Xiao, Wanguo Wang, Yibin Li
Based on SmartGuard, a mobile robot for substation inspection, we propose an image based visual servo control system to precisely make the cameras with the pan & tilt to capture the substation equipment we expected to inspect. The vision control system contents of an image acquisition system, a pan & tilt and an embedded servo control system. The proposed approach firstly uses SURF local feature to take the offset of the new acquired image and the template image, which is invariant to light, scale and rotation. Without the calibration of the pan & tilt and the vision system, we calculate the Jacobian matrix based on the test movement. Then we take the servo until the image feature reach to the object image. Using this image based vision system, SmartGuard can avoid the effect of the motion error and the repeating errors of pan & tilt system, and take the precisely image of the power equipments for automatic optical inspection system.
{"title":"The application of image based visual servo control system for smart guard","authors":"Li Li, Binhai Wang, Beidou Li, Peng Xiao, Wanguo Wang, Yibin Li","doi":"10.1109/ICCA.2013.6564898","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6564898","url":null,"abstract":"Based on SmartGuard, a mobile robot for substation inspection, we propose an image based visual servo control system to precisely make the cameras with the pan & tilt to capture the substation equipment we expected to inspect. The vision control system contents of an image acquisition system, a pan & tilt and an embedded servo control system. The proposed approach firstly uses SURF local feature to take the offset of the new acquired image and the template image, which is invariant to light, scale and rotation. Without the calibration of the pan & tilt and the vision system, we calculate the Jacobian matrix based on the test movement. Then we take the servo until the image feature reach to the object image. Using this image based vision system, SmartGuard can avoid the effect of the motion error and the repeating errors of pan & tilt system, and take the precisely image of the power equipments for automatic optical inspection system.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122305019","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}
Pub Date : 2013-06-12DOI: 10.1109/ICCA.2013.6565084
Zhitao Liu, Youyi Wang, Jian Du
In this paper, fuzzy model predictive control(FMPC) is applied to the speed control of permanent magnet synchronous machine(PMSM) in electric vehicles(EVs). PMSM are being widely used in vehicle industry, but as its highly nonlinear model, it is difficult to regulate the motor speed. In order to improve the performance of EVs, model predictive control is used to control PMSM based on the Takagi-Sugeno fuzzy approach. The proposed FMPC for the PMSM is used to regulate the speed to track the driving cycle, and simulation results are given to shown the effectiveness of the proposed controller.
{"title":"Fuzzy model predictive control of a permanent magnet synchronous motor in electric vehicles","authors":"Zhitao Liu, Youyi Wang, Jian Du","doi":"10.1109/ICCA.2013.6565084","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6565084","url":null,"abstract":"In this paper, fuzzy model predictive control(FMPC) is applied to the speed control of permanent magnet synchronous machine(PMSM) in electric vehicles(EVs). PMSM are being widely used in vehicle industry, but as its highly nonlinear model, it is difficult to regulate the motor speed. In order to improve the performance of EVs, model predictive control is used to control PMSM based on the Takagi-Sugeno fuzzy approach. The proposed FMPC for the PMSM is used to regulate the speed to track the driving cycle, and simulation results are given to shown the effectiveness of the proposed controller.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127244812","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}
Pub Date : 2013-06-12DOI: 10.1109/ICCA.2013.6564867
Xiaohui Li, Zhenping Sun, Qing-yang Chen, Daxue Liu
A path tracking algorithm with adaptive preview distance based on roadside sampling is proposed in order to solve the path tracking control problems of autonomous driving in the complex off-road environment. The proposed lateral and longitudinal control laws involve both feedback control and feedforward control. We have reformulated the lateral control problem as an optimal control problem, and the designed trajectory is planned by taking the kinematic constrains of the vehicle and the preview road information pertaining to road curvature and road width into account. The desired lateral control command is directly decided by the curvature of the planned circular curves and the longitudinal velocity is planned by utilizing the preview information and the planned circular curves. In the meantime, the feedback control laws are designed by adopting inverse model of the vehicle dynamics. We implement our control method on the 14-DOF vehicle simulation model. And the simulation results are presented and discussed.
{"title":"An adaptive preview path tracker for off-road autonomous driving","authors":"Xiaohui Li, Zhenping Sun, Qing-yang Chen, Daxue Liu","doi":"10.1109/ICCA.2013.6564867","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6564867","url":null,"abstract":"A path tracking algorithm with adaptive preview distance based on roadside sampling is proposed in order to solve the path tracking control problems of autonomous driving in the complex off-road environment. The proposed lateral and longitudinal control laws involve both feedback control and feedforward control. We have reformulated the lateral control problem as an optimal control problem, and the designed trajectory is planned by taking the kinematic constrains of the vehicle and the preview road information pertaining to road curvature and road width into account. The desired lateral control command is directly decided by the curvature of the planned circular curves and the longitudinal velocity is planned by utilizing the preview information and the planned circular curves. In the meantime, the feedback control laws are designed by adopting inverse model of the vehicle dynamics. We implement our control method on the 14-DOF vehicle simulation model. And the simulation results are presented and discussed.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126095857","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}
Pub Date : 2013-06-12DOI: 10.1109/ICCA.2013.6565014
Jiaxiang Luo, Yueming Hu
Setup (changeover) time is often needed by the processes with operations of cleaning or changing fixtures. Its length strongly depends on the immediately succeeding operation sometimes. The scheduling problems with such setup times are called to have sequence dependent setups. This paper focuses on a single machine scheduling problem with sequence dependent setups to minimize total weighted tardiness. A greedy randomized adaptive search procedure (GRASP) combined with path relinking (PR) is proposed for the NP-hard problem. In the algorithm, our main contributions are a new iterated filter-and-fan (IFF) algorithm in the improvement phase of GRASP and a block insertion based path construction method in PR. We compare our algorithm with discrete differential evolution (DDE), discrete particle swarm optimization (DPSO) and single IFF algorithm on a set of test instances from literature. The results show that the algorithm performs very competitively.
{"title":"A new GRASP and path relinking for single machine scheduling with sequence dependent setups","authors":"Jiaxiang Luo, Yueming Hu","doi":"10.1109/ICCA.2013.6565014","DOIUrl":"https://doi.org/10.1109/ICCA.2013.6565014","url":null,"abstract":"Setup (changeover) time is often needed by the processes with operations of cleaning or changing fixtures. Its length strongly depends on the immediately succeeding operation sometimes. The scheduling problems with such setup times are called to have sequence dependent setups. This paper focuses on a single machine scheduling problem with sequence dependent setups to minimize total weighted tardiness. A greedy randomized adaptive search procedure (GRASP) combined with path relinking (PR) is proposed for the NP-hard problem. In the algorithm, our main contributions are a new iterated filter-and-fan (IFF) algorithm in the improvement phase of GRASP and a block insertion based path construction method in PR. We compare our algorithm with discrete differential evolution (DDE), discrete particle swarm optimization (DPSO) and single IFF algorithm on a set of test instances from literature. The results show that the algorithm performs very competitively.","PeriodicalId":336534,"journal":{"name":"2013 10th IEEE International Conference on Control and Automation (ICCA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125458532","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
扫码关注我们
求助内容：
应助结果提醒方式：