Pub Date : 2016-09-01DOI: 10.1109/IConAC.2016.7604910
Bo Wang, Yu-Ping Tian
This paper studies the consensus problem of discrete-time multi-agent systems with relative-state-dependent (RSD) measurement noises. Firstly, consensus is analyzed for noise-free systems under the switching topologies. Then, under a martingale-difference assumption on the noises, it is proved that, by giving a small distributed control gain, the mean square (m.s.) and almost sure (a.s.) consensus can be obtained for a class of switching topology satisfying the uniformly rooted (UR) and “period” assumption. Besides, a sufficient condition to guarantee the m.s. and a.s. consensus is given if the switching topology is UR and union-mode-finite (UMF). We also analyze the statistic properties of the final consensus point. Numerical examples are given to illustrate the effectiveness of the results.
{"title":"Consensus with relative-state-dependent noises in time-varying networks","authors":"Bo Wang, Yu-Ping Tian","doi":"10.1109/IConAC.2016.7604910","DOIUrl":"https://doi.org/10.1109/IConAC.2016.7604910","url":null,"abstract":"This paper studies the consensus problem of discrete-time multi-agent systems with relative-state-dependent (RSD) measurement noises. Firstly, consensus is analyzed for noise-free systems under the switching topologies. Then, under a martingale-difference assumption on the noises, it is proved that, by giving a small distributed control gain, the mean square (m.s.) and almost sure (a.s.) consensus can be obtained for a class of switching topology satisfying the uniformly rooted (UR) and “period” assumption. Besides, a sufficient condition to guarantee the m.s. and a.s. consensus is given if the switching topology is UR and union-mode-finite (UMF). We also analyze the statistic properties of the final consensus point. Numerical examples are given to illustrate the effectiveness of the results.","PeriodicalId":375052,"journal":{"name":"2016 22nd International Conference on Automation and Computing (ICAC)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123175153","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 : 2016-09-01DOI: 10.1109/IConAC.2016.7604936
Yaowang Li, S. Miao, Xing Luo, Jihong Wang
When energy storage is involved in the power system scheduling, the new challenge is presented as the storage facilities can be considered as either a generator (discharging) or a load (charging). To address this challenge, the paper proposes a method of optimization of power system scheduling with the first generation of compressed air energy storage (CAES) This model takes gas consumption cost as one of the operation cost, and it can reflect inherent operation constrains of a first generation CAES plant. With simplifications of the CAES system model, the relationship between the key variables used in CAES scheduling model are identified. An optimization model for scheduling of wind generations and CAES combined system is then developed. The objective of this optimization scheduling model is to maximize the combined system operation profit which involves in selling electricity revenue, penalty for deviation from declared output and gas consumption cost of CAES. Simulation studies are carried out with the operation data of the Huntorf CAES plant. The simulation results show that the optimization model works well for power system scheduling while the CAES and wind power generations are presented.
{"title":"Optimization model for the power system scheduling with wind generation and compressed air energy storage combination","authors":"Yaowang Li, S. Miao, Xing Luo, Jihong Wang","doi":"10.1109/IConAC.2016.7604936","DOIUrl":"https://doi.org/10.1109/IConAC.2016.7604936","url":null,"abstract":"When energy storage is involved in the power system scheduling, the new challenge is presented as the storage facilities can be considered as either a generator (discharging) or a load (charging). To address this challenge, the paper proposes a method of optimization of power system scheduling with the first generation of compressed air energy storage (CAES) This model takes gas consumption cost as one of the operation cost, and it can reflect inherent operation constrains of a first generation CAES plant. With simplifications of the CAES system model, the relationship between the key variables used in CAES scheduling model are identified. An optimization model for scheduling of wind generations and CAES combined system is then developed. The objective of this optimization scheduling model is to maximize the combined system operation profit which involves in selling electricity revenue, penalty for deviation from declared output and gas consumption cost of CAES. Simulation studies are carried out with the operation data of the Huntorf CAES plant. The simulation results show that the optimization model works well for power system scheduling while the CAES and wind power generations are presented.","PeriodicalId":375052,"journal":{"name":"2016 22nd International Conference on Automation and Computing (ICAC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128761613","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 : 2016-09-01DOI: 10.1109/IConAC.2016.7604976
Ikram Ullah, M. A. Shah
The Internet of Things (IoT) is an Internet-based architecture for the exchange of information and services amongst millions of devices. Due to massive use of IoT for various benefits, there are high security and privacy related issues which need to be addressed. Many techniques have been proposed for preserving location privacy in the context of IoT. Some of these techniques are based on anonymization and others on obfuscation. However, the existing research clearly lags in preserving location privacy in IoT and has common issues such as being specific or restricted to certain location. This research focuses on preserving location privacy in the context of IoT. In this paper, we propose an Enhanced Semantic Obfuscation Technique (ESOT) for preserving location privacy in the IoT. We compare the performance of ESOT with previously developed Semantic Obfuscation Technique (SOT). The results show that ESOT achieves better location privacy and provides a balance between privacy and utility of location services.
{"title":"A novel model for preserving Location Privacy in Internet of Things","authors":"Ikram Ullah, M. A. Shah","doi":"10.1109/IConAC.2016.7604976","DOIUrl":"https://doi.org/10.1109/IConAC.2016.7604976","url":null,"abstract":"The Internet of Things (IoT) is an Internet-based architecture for the exchange of information and services amongst millions of devices. Due to massive use of IoT for various benefits, there are high security and privacy related issues which need to be addressed. Many techniques have been proposed for preserving location privacy in the context of IoT. Some of these techniques are based on anonymization and others on obfuscation. However, the existing research clearly lags in preserving location privacy in IoT and has common issues such as being specific or restricted to certain location. This research focuses on preserving location privacy in the context of IoT. In this paper, we propose an Enhanced Semantic Obfuscation Technique (ESOT) for preserving location privacy in the IoT. We compare the performance of ESOT with previously developed Semantic Obfuscation Technique (SOT). The results show that ESOT achieves better location privacy and provides a balance between privacy and utility of location services.","PeriodicalId":375052,"journal":{"name":"2016 22nd International Conference on Automation and Computing (ICAC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114225573","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 : 2016-09-01DOI: 10.1109/IConAC.2016.7604935
Guanfeng Wang, Shuxia Wang
The stroke segmentation is one of the important factors for checking recognition rate of online freehand sketching that is an effective way for expressing, communicating and recording ideas during conceptual design. Strokes are divided into convex and concave stroke depending on whether is change the vector direction of preprocessing points. The paper proposes two kinds of segmentation methods for the former and analyzes their differences. To the latter, groups the preprocessing points and follows the rule that is the most of square number of the preprocessing points in unit length to segment the stroke. This paper develops a human-computer interface prototype system FSR, which makes system interface easy and friendly to user. The FRS system has been tested with a number of freehand sketches; the test results show that the algorithm achieves a satisfactory segmenting efficiency. Our method that tolerates high degrees of uncertainty and vague ideas does not rely on any domain-specific knowledge, and therefore it can be easily integrated with other high-level applications.
{"title":"Segmentation of online sketching using geometric feature","authors":"Guanfeng Wang, Shuxia Wang","doi":"10.1109/IConAC.2016.7604935","DOIUrl":"https://doi.org/10.1109/IConAC.2016.7604935","url":null,"abstract":"The stroke segmentation is one of the important factors for checking recognition rate of online freehand sketching that is an effective way for expressing, communicating and recording ideas during conceptual design. Strokes are divided into convex and concave stroke depending on whether is change the vector direction of preprocessing points. The paper proposes two kinds of segmentation methods for the former and analyzes their differences. To the latter, groups the preprocessing points and follows the rule that is the most of square number of the preprocessing points in unit length to segment the stroke. This paper develops a human-computer interface prototype system FSR, which makes system interface easy and friendly to user. The FRS system has been tested with a number of freehand sketches; the test results show that the algorithm achieves a satisfactory segmenting efficiency. Our method that tolerates high degrees of uncertainty and vague ideas does not rely on any domain-specific knowledge, and therefore it can be easily integrated with other high-level applications.","PeriodicalId":375052,"journal":{"name":"2016 22nd International Conference on Automation and Computing (ICAC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124000676","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 : 2016-09-01DOI: 10.1109/IConAC.2016.7604953
Sicong Ma, Siyan Li, Hongji Yang
As the World Wide Web has a huge number of information and update rapidly, the needs of people for searching information from the web increase dramatically. Meanwhile, most of current search engines can search a query from websites, but cannot present the most relevant results to users. The main challenge for search engines and meta search engines are how to describe and analyse a query more comprehensively. In order to solve this problem, this paper presents a meta-search engine named Personlised Meta Search Engine (PMSE) that has been used to adapt the web search processes to meet users' requirement. Firstly, a technique will enrich the given query by data mining and creative computing. Secondly, a new meta-search engine is developed to make the results more relevant. Finally, an example is used to demonstrate what the proposed approach will be described more comprehensively and to produce fewer but more precise answers to individual users.
{"title":"Utilising Creative Computing and data mining techniques to analyse queries in a meta-search system","authors":"Sicong Ma, Siyan Li, Hongji Yang","doi":"10.1109/IConAC.2016.7604953","DOIUrl":"https://doi.org/10.1109/IConAC.2016.7604953","url":null,"abstract":"As the World Wide Web has a huge number of information and update rapidly, the needs of people for searching information from the web increase dramatically. Meanwhile, most of current search engines can search a query from websites, but cannot present the most relevant results to users. The main challenge for search engines and meta search engines are how to describe and analyse a query more comprehensively. In order to solve this problem, this paper presents a meta-search engine named Personlised Meta Search Engine (PMSE) that has been used to adapt the web search processes to meet users' requirement. Firstly, a technique will enrich the given query by data mining and creative computing. Secondly, a new meta-search engine is developed to make the results more relevant. Finally, an example is used to demonstrate what the proposed approach will be described more comprehensively and to produce fewer but more precise answers to individual users.","PeriodicalId":375052,"journal":{"name":"2016 22nd International Conference on Automation and Computing (ICAC)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121467809","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 : 2016-09-01DOI: 10.1109/IConAC.2016.7604947
Z. Chu, Wei Sun, Jianping Wang
With the development of MEMS (Micro-electromechanical Systems), the wireless sensor networks (WSNs) have become an important communicating method for intelligent transportation application. Mathematics modeling, as an effective quantitative analysis method, is very important for conducting intelligent transportation performance research when WSNs are applied. Based on the channel contention mechanism of IEEE802.15.4 standard Media Access Control (MAC) layer unslotted mode, MAC layer mathematics performance model of throughput, goodput, average delay and collision rate is built by analyzing the state of node buffer, state of nodes, and the state of channel. In addtion, the MAC layer mathematics models and corresponding performance are simulated in MATLAB and QualNet respectively. The simulation results indicate that the mathematics models can be used for the real communication quantitative analysis of WSNs MAC layer communication.
{"title":"Research on MAC layer communication performance model of wireless sensor networks for intelligent transportation","authors":"Z. Chu, Wei Sun, Jianping Wang","doi":"10.1109/IConAC.2016.7604947","DOIUrl":"https://doi.org/10.1109/IConAC.2016.7604947","url":null,"abstract":"With the development of MEMS (Micro-electromechanical Systems), the wireless sensor networks (WSNs) have become an important communicating method for intelligent transportation application. Mathematics modeling, as an effective quantitative analysis method, is very important for conducting intelligent transportation performance research when WSNs are applied. Based on the channel contention mechanism of IEEE802.15.4 standard Media Access Control (MAC) layer unslotted mode, MAC layer mathematics performance model of throughput, goodput, average delay and collision rate is built by analyzing the state of node buffer, state of nodes, and the state of channel. In addtion, the MAC layer mathematics models and corresponding performance are simulated in MATLAB and QualNet respectively. The simulation results indicate that the mathematics models can be used for the real communication quantitative analysis of WSNs MAC layer communication.","PeriodicalId":375052,"journal":{"name":"2016 22nd International Conference on Automation and Computing (ICAC)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116627042","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 : 2016-09-01DOI: 10.1109/IConAC.2016.7604948
Henry Tandoh, Yi Cao, C. Avila
A typical challenge in the oil and gas industry when transporting hydrocarbon fluids, is the instabilities associated with the flow resulting from pressure and flow fluctuations. U-shape riser or platform to platform pipeline configuration also faces such difficulty and this negatively affects downstream facilities and production on the whole. This undesirable flow has stimulated several researches and investigation from time past in the quest to mitigate slugging. Active control scheme as a slug mitigation technique, operates at a greater choke valve opening than would be obtained using manual choking. This auspicious technique faces the challenge of having a controller that is robust and capable of producing the desired performance. A novel Inferential Slug Controller (ISC), an active control scheme, combines several topside measurement on a U-shape riser to produces a single control variable which is more sensitive to slug flow through a simple algebraic scheming. In this work, a method that can be used for slug control stability analysis was used to design an ISC. Further insight was drawn-out by performing several system stability analysis. The effectiveness of the proposed method was accessed using OLGA. The findings could possibly have consequences on the configuration and further expansion on the ISC technique.
{"title":"Stability of severe slug flow in U-shape riser","authors":"Henry Tandoh, Yi Cao, C. Avila","doi":"10.1109/IConAC.2016.7604948","DOIUrl":"https://doi.org/10.1109/IConAC.2016.7604948","url":null,"abstract":"A typical challenge in the oil and gas industry when transporting hydrocarbon fluids, is the instabilities associated with the flow resulting from pressure and flow fluctuations. U-shape riser or platform to platform pipeline configuration also faces such difficulty and this negatively affects downstream facilities and production on the whole. This undesirable flow has stimulated several researches and investigation from time past in the quest to mitigate slugging. Active control scheme as a slug mitigation technique, operates at a greater choke valve opening than would be obtained using manual choking. This auspicious technique faces the challenge of having a controller that is robust and capable of producing the desired performance. A novel Inferential Slug Controller (ISC), an active control scheme, combines several topside measurement on a U-shape riser to produces a single control variable which is more sensitive to slug flow through a simple algebraic scheming. In this work, a method that can be used for slug control stability analysis was used to design an ISC. Further insight was drawn-out by performing several system stability analysis. The effectiveness of the proposed method was accessed using OLGA. The findings could possibly have consequences on the configuration and further expansion on the ISC technique.","PeriodicalId":375052,"journal":{"name":"2016 22nd International Conference on Automation and Computing (ICAC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130026542","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 : 2016-09-01DOI: 10.1109/IConAC.2016.7604927
Wuqiao Luo, Yun Li
With the proliferating development of heuristic methods, it has become challenging to choose the most suitable ones for an application at hand. This paper evaluates the performance of these algorithms available in Matlab, as it is problem dependent and parameter sensitive. Further, the paper attempts to address the challenge that there exists no satisfied benchmarks to evaluation all the algorithms at the same standard. The paper tests five heuristic algorithms in Matlab, the Nelder-Mead simplex search, the Genetic Algorithm, the Genetic Algorithm with elitism, Simulated Annealing and Particle Swarm Optimization, with four widely adopted benchmark problems. The Genetic Algorithm has an overall best performance at optimality and accuracy, while PSO has fast convergence speed when facing unimodal problem.
{"title":"Benchmarking heuristic search and optimisation algorithms in Matlab","authors":"Wuqiao Luo, Yun Li","doi":"10.1109/IConAC.2016.7604927","DOIUrl":"https://doi.org/10.1109/IConAC.2016.7604927","url":null,"abstract":"With the proliferating development of heuristic methods, it has become challenging to choose the most suitable ones for an application at hand. This paper evaluates the performance of these algorithms available in Matlab, as it is problem dependent and parameter sensitive. Further, the paper attempts to address the challenge that there exists no satisfied benchmarks to evaluation all the algorithms at the same standard. The paper tests five heuristic algorithms in Matlab, the Nelder-Mead simplex search, the Genetic Algorithm, the Genetic Algorithm with elitism, Simulated Annealing and Particle Swarm Optimization, with four widely adopted benchmark problems. The Genetic Algorithm has an overall best performance at optimality and accuracy, while PSO has fast convergence speed when facing unimodal problem.","PeriodicalId":375052,"journal":{"name":"2016 22nd International Conference on Automation and Computing (ICAC)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121379585","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 : 2016-09-01DOI: 10.1109/IConAC.2016.7604898
Johannes Teiwes, Timo Bänziger, A. Kunz, K. Wegener
The increased availability of sensitive and compliant lightweight robots for use in assembly lines collaborating with the human promises significant improvements of different socio-technical aspects of work. Workplaces can be reorganized to assign monotonous or unergonomic tasks to the robot. Also unproductive jobs currently done by the human can be minimized by an improved work distribution. Since there is only little experience with the new generation of collaborating robots, the implementation of workplaces shared by human and robot is often influenced by subjective perspectives. In this paper, an approach to assess the collaboration potential of workplaces is presented. Based on existing standardised work descriptions, the suitability for human-robot collaboration can be derived and therefore a more objective evaluation and comparison of the whole assembly can be achieved.
{"title":"Identifying the potential of human-robot collaboration in automotive assembly lines using a standardised work description","authors":"Johannes Teiwes, Timo Bänziger, A. Kunz, K. Wegener","doi":"10.1109/IConAC.2016.7604898","DOIUrl":"https://doi.org/10.1109/IConAC.2016.7604898","url":null,"abstract":"The increased availability of sensitive and compliant lightweight robots for use in assembly lines collaborating with the human promises significant improvements of different socio-technical aspects of work. Workplaces can be reorganized to assign monotonous or unergonomic tasks to the robot. Also unproductive jobs currently done by the human can be minimized by an improved work distribution. Since there is only little experience with the new generation of collaborating robots, the implementation of workplaces shared by human and robot is often influenced by subjective perspectives. In this paper, an approach to assess the collaboration potential of workplaces is presented. Based on existing standardised work descriptions, the suitability for human-robot collaboration can be derived and therefore a more objective evaluation and comparison of the whole assembly can be achieved.","PeriodicalId":375052,"journal":{"name":"2016 22nd International Conference on Automation and Computing (ICAC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134114707","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 : 2016-09-01DOI: 10.1109/IConAC.2016.7604933
Dengkai Chen, Danping Ma, Jianjie Chu, Jintao He
This paper proposes an image-based method for product color design and constructs a color matching model on the basis of the CorelDRAW platform by establishing a reflection between the image words of colors and excellent color applications. The grey relation clustering method is applied to classify and simplify consumers' image words. Then, product color design options are found in combination with the case library to understand consumers' color requirements and improve the design efficiency. A case study of the color design of a special transportation vehicle is applied to verify the proposed method.
{"title":"The study of an image-based method for product color design","authors":"Dengkai Chen, Danping Ma, Jianjie Chu, Jintao He","doi":"10.1109/IConAC.2016.7604933","DOIUrl":"https://doi.org/10.1109/IConAC.2016.7604933","url":null,"abstract":"This paper proposes an image-based method for product color design and constructs a color matching model on the basis of the CorelDRAW platform by establishing a reflection between the image words of colors and excellent color applications. The grey relation clustering method is applied to classify and simplify consumers' image words. Then, product color design options are found in combination with the case library to understand consumers' color requirements and improve the design efficiency. A case study of the color design of a special transportation vehicle is applied to verify the proposed method.","PeriodicalId":375052,"journal":{"name":"2016 22nd International Conference on Automation and Computing (ICAC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134193633","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
扫码关注我们
求助内容：
应助结果提醒方式：