Pub Date : 2017-11-01DOI: 10.1109/ICSAI.2017.8248386
Ying Zhou, Hongzhen Zheng, Fanchao Meng, Chunshan Li
This paper aims at the situation that customers' recovery requirements have been seldom considered on the vehicle routing problem with multi-distribution centers in logistics delivery, integrating reverse logistics on the basis of forward logistics delivery to research the process of simultaneous delivery and recovery. The nearest distance rules is proposed to distribute the customer nodes, so that the problem of multi-distribution centers can be transformed into a single distribution center problem. At the same time, considering feasible paths between nodes cannot be entirely guaranteed in real life, the model is proposed that nodes can be accessed multiple times but can only be served once. This paper employs the artificial bee colony algorithm to obtain the optimal vehicle path with the optimal total transportation cost. Finally, the validity and practical application value of both model and algorithm is verified with a numerical example.
{"title":"On the application of the vehicle routing problem with multi-distribution centers in reverse logistics","authors":"Ying Zhou, Hongzhen Zheng, Fanchao Meng, Chunshan Li","doi":"10.1109/ICSAI.2017.8248386","DOIUrl":"https://doi.org/10.1109/ICSAI.2017.8248386","url":null,"abstract":"This paper aims at the situation that customers' recovery requirements have been seldom considered on the vehicle routing problem with multi-distribution centers in logistics delivery, integrating reverse logistics on the basis of forward logistics delivery to research the process of simultaneous delivery and recovery. The nearest distance rules is proposed to distribute the customer nodes, so that the problem of multi-distribution centers can be transformed into a single distribution center problem. At the same time, considering feasible paths between nodes cannot be entirely guaranteed in real life, the model is proposed that nodes can be accessed multiple times but can only be served once. This paper employs the artificial bee colony algorithm to obtain the optimal vehicle path with the optimal total transportation cost. Finally, the validity and practical application value of both model and algorithm is verified with a numerical example.","PeriodicalId":285726,"journal":{"name":"2017 4th International Conference on Systems and Informatics (ICSAI)","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124378444","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}
In this paper, a contour map human facial recognition algorithm is proposed to implement the three-dimensional (3D) face recognition with the Kinect Xbox One. Since the scale of 3D depth data collected from Kinect is tremendous, the face recognition process cannot be handled in real time. To improve the speed and accuracy of the recognition process, the proposed algorithm turns the 3D depth data to the two-dimensional (2D) contour map. Furthermore, due to the 3D depth data obtained by Kinect, there is no need of expensive, ponderous and slow 3D scanners. Ten male and female subjects were involved in the validation experiment and the results verify that the proposed algorithm was feasible for face recognition. In addition, compared with other methods, Eigenface, Local Binary Patterns (LBP) and Linear Discriminant Analysis (LDA), the proposed algorithm has the better security and reliability.
针对Kinect Xbox One的三维人脸识别问题，提出了一种等高线地图人脸识别算法。由于Kinect采集的3D深度数据规模巨大，人脸识别过程无法实时处理。为了提高识别过程的速度和准确性，该算法将三维深度数据转换为二维等高线地图。此外，由于Kinect获得的3D深度数据，不需要昂贵、笨重和缓慢的3D扫描仪。通过10名男性和10名女性受试者进行验证实验，结果验证了所提出的算法在人脸识别方面的可行性。此外，与特征脸(Eigenface)、局部二值模式(Local Binary Patterns, LBP)和线性判别分析(Linear Discriminant Analysis, LDA)等方法相比，该算法具有更好的安全性和可靠性。
{"title":"3D face recognition based on kinect depth data","authors":"Zijun Cheng, Tianwei Shi, Wenhua Cui, Yunqi Dong, Xuehan Fang","doi":"10.1109/ICSAI.2017.8248353","DOIUrl":"https://doi.org/10.1109/ICSAI.2017.8248353","url":null,"abstract":"In this paper, a contour map human facial recognition algorithm is proposed to implement the three-dimensional (3D) face recognition with the Kinect Xbox One. Since the scale of 3D depth data collected from Kinect is tremendous, the face recognition process cannot be handled in real time. To improve the speed and accuracy of the recognition process, the proposed algorithm turns the 3D depth data to the two-dimensional (2D) contour map. Furthermore, due to the 3D depth data obtained by Kinect, there is no need of expensive, ponderous and slow 3D scanners. Ten male and female subjects were involved in the validation experiment and the results verify that the proposed algorithm was feasible for face recognition. In addition, compared with other methods, Eigenface, Local Binary Patterns (LBP) and Linear Discriminant Analysis (LDA), the proposed algorithm has the better security and reliability.","PeriodicalId":285726,"journal":{"name":"2017 4th International Conference on Systems and Informatics (ICSAI)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124092798","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 : 2017-11-01DOI: 10.1109/ICSAI.2017.8248286
Hui Zhong, Xiao Lin, Linhua Jiang
Saliency detection is a hot topic in the community of computer image and vision. In this paper, we present a new saliency detection method. Given an input image, our method first uses Harris corner detection technique to approximately locate the salient region, and then assign the saliency scores to each pixel, getting the center-prior based map. In addition, we employ Bayesian formula to further optimize it, obtaining the center-Bayesian map. On the other hand, we use the image boundary to generate boundary-based map. Finally, we merge them into a saliency map as our final saliency map. A large number of experimental results demonstrate that the proposed algorithm is superior to most existing algorithms.
{"title":"Finding saliency object via an integration approach","authors":"Hui Zhong, Xiao Lin, Linhua Jiang","doi":"10.1109/ICSAI.2017.8248286","DOIUrl":"https://doi.org/10.1109/ICSAI.2017.8248286","url":null,"abstract":"Saliency detection is a hot topic in the community of computer image and vision. In this paper, we present a new saliency detection method. Given an input image, our method first uses Harris corner detection technique to approximately locate the salient region, and then assign the saliency scores to each pixel, getting the center-prior based map. In addition, we employ Bayesian formula to further optimize it, obtaining the center-Bayesian map. On the other hand, we use the image boundary to generate boundary-based map. Finally, we merge them into a saliency map as our final saliency map. A large number of experimental results demonstrate that the proposed algorithm is superior to most existing algorithms.","PeriodicalId":285726,"journal":{"name":"2017 4th International Conference on Systems and Informatics (ICSAI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127592961","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 : 2017-11-01DOI: 10.1109/ICSAI.2017.8248438
Chunxiao Han, Xiaozhou Sun, S. Cui
In this paper, a high speed visible light communication transceiver module is designed, and a 100Mbps white light LED based visible light communication system is constructed based on this module. Without using a blue filter, we combined the pre-emphasis technology, modulation technology and the back-end equalization technology to improve the bandwidth and data transmission rate of the visible light communication system effectively. The system has advantages of low cost, low complexity, low power consumption and small transceiver module, which can be practical and industrialized.
{"title":"Design of 100Mbps white light LED based visible light communication system","authors":"Chunxiao Han, Xiaozhou Sun, S. Cui","doi":"10.1109/ICSAI.2017.8248438","DOIUrl":"https://doi.org/10.1109/ICSAI.2017.8248438","url":null,"abstract":"In this paper, a high speed visible light communication transceiver module is designed, and a 100Mbps white light LED based visible light communication system is constructed based on this module. Without using a blue filter, we combined the pre-emphasis technology, modulation technology and the back-end equalization technology to improve the bandwidth and data transmission rate of the visible light communication system effectively. The system has advantages of low cost, low complexity, low power consumption and small transceiver module, which can be practical and industrialized.","PeriodicalId":285726,"journal":{"name":"2017 4th International Conference on Systems and Informatics (ICSAI)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127680530","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 : 2017-11-01DOI: 10.1109/ICSAI.2017.8248310
Lingtao Zhang, Lin Zhao, Pai Sun, L. Zhang, Guohui Tian
Aiming at the situation that the dispatch center cannot parse the substation graphics data owing to the different standards between substation and dispatch center, a method of automatically generating the main wiring diagram is proposed by means of the substation topology relationship in the dispatching center. By analyzing the SSD file of the substation, the topology relation of the substation is obtained, and then the layout optimization objective function which including the length of the connecting lines and the uniformity of the layout is constructed, the initial layout is set according to the composition characteristics of the main wiring diagram. The simulated annealing algorithm is used to optimize the objective function. By setting the cooling schedule to control the main wiring diagram, the layout process automatically generates the main wiring diagram during the iterative optimization process. In order to reduce the search time, the paper improves the neighborhood search strategy of the traditional simulated annealing algorithm, and enhanced the search efficiency of simulated annealing algorithm. The new algorithm is applied to the automatic generation of the main wiring diagram of a substation, the results show that the algorithm can quickly generate the main wiring diagram, and the layout is uniform, the structure is clear and has fewer intersections.
{"title":"An automatic layout algorithm of main wiring diagram of substation based on improved simulated annealing algorithm","authors":"Lingtao Zhang, Lin Zhao, Pai Sun, L. Zhang, Guohui Tian","doi":"10.1109/ICSAI.2017.8248310","DOIUrl":"https://doi.org/10.1109/ICSAI.2017.8248310","url":null,"abstract":"Aiming at the situation that the dispatch center cannot parse the substation graphics data owing to the different standards between substation and dispatch center, a method of automatically generating the main wiring diagram is proposed by means of the substation topology relationship in the dispatching center. By analyzing the SSD file of the substation, the topology relation of the substation is obtained, and then the layout optimization objective function which including the length of the connecting lines and the uniformity of the layout is constructed, the initial layout is set according to the composition characteristics of the main wiring diagram. The simulated annealing algorithm is used to optimize the objective function. By setting the cooling schedule to control the main wiring diagram, the layout process automatically generates the main wiring diagram during the iterative optimization process. In order to reduce the search time, the paper improves the neighborhood search strategy of the traditional simulated annealing algorithm, and enhanced the search efficiency of simulated annealing algorithm. The new algorithm is applied to the automatic generation of the main wiring diagram of a substation, the results show that the algorithm can quickly generate the main wiring diagram, and the layout is uniform, the structure is clear and has fewer intersections.","PeriodicalId":285726,"journal":{"name":"2017 4th International Conference on Systems and Informatics (ICSAI)","volume":"C-29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126484752","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 : 2017-11-01DOI: 10.1109/ICSAI.2017.8248318
Meimei Duan, Xuesong Shao, Gaoying Cui, A. Zheng, Gege Tong, Gang Wu, Ciwei Gao
Based on the multi-time scale characteristic of demand response (DR), a rolling dispatch model which consists of three different time scales (i.e. day-ahead, in-day and real-time) was proposed. The model coordinately considered incentive-based DR resources of different time scales and price-based DR resources affected by real-time price on the demand side. It also considered different forecasting accuracy of renewable energy in multi-time scale and the generators of different ramping speeds (the conventional generator and the quick-start generator) on the supply side. Through the proposed triple-scale model, generators and DR resources in different time scales can be well dispatched and the operation costs of power system with renewable energy can be optimized. The testing results of the IEEE 5-bus system verified the effectiveness of the proposed rolling dispatch model.
{"title":"Rolling dispatch of demand response resources considering renewable energy accommodation","authors":"Meimei Duan, Xuesong Shao, Gaoying Cui, A. Zheng, Gege Tong, Gang Wu, Ciwei Gao","doi":"10.1109/ICSAI.2017.8248318","DOIUrl":"https://doi.org/10.1109/ICSAI.2017.8248318","url":null,"abstract":"Based on the multi-time scale characteristic of demand response (DR), a rolling dispatch model which consists of three different time scales (i.e. day-ahead, in-day and real-time) was proposed. The model coordinately considered incentive-based DR resources of different time scales and price-based DR resources affected by real-time price on the demand side. It also considered different forecasting accuracy of renewable energy in multi-time scale and the generators of different ramping speeds (the conventional generator and the quick-start generator) on the supply side. Through the proposed triple-scale model, generators and DR resources in different time scales can be well dispatched and the operation costs of power system with renewable energy can be optimized. The testing results of the IEEE 5-bus system verified the effectiveness of the proposed rolling dispatch model.","PeriodicalId":285726,"journal":{"name":"2017 4th International Conference on Systems and Informatics (ICSAI)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130052048","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 : 2017-11-01DOI: 10.1109/ICSAI.2017.8248270
Chengcheng Fan, Jianli Zheng, Yongyong Yang, Boyu Si
With the development of respiratory therapy, ventilator can enhance the treatment successful rate to the patients who suffered from the disease of respiratory system. In the using process of ventilator, patient's lung and tube condition varies with the change of morbid state, it's necessary to adjust the ventilating parameter, so it's indispensable to evaluate the lung and tube parameter. This thesis makes a design of ventilating parameter estimator, according to the pressure, flow, airway resistance, compliance, the RCC model is built and the Recursive Least Squares are used to estimate the patient's real-time airway resistance, lung compliance, tube compliance. Subsequently, according to the estimator's evaluation, the clinical engineer could adjust the ventilator's pressure support and compensate the rate of flow at the appropriate time. The experiment result shows that this RCC model could evaluate the respiratory parameters well and give support to the adaptive control of ventilator's pressure and flow for the purpose to enhance patient's ventilating comfort and decrease the respiratory disease.
{"title":"Design of respiratory parameter estimator based on linear RCC model","authors":"Chengcheng Fan, Jianli Zheng, Yongyong Yang, Boyu Si","doi":"10.1109/ICSAI.2017.8248270","DOIUrl":"https://doi.org/10.1109/ICSAI.2017.8248270","url":null,"abstract":"With the development of respiratory therapy, ventilator can enhance the treatment successful rate to the patients who suffered from the disease of respiratory system. In the using process of ventilator, patient's lung and tube condition varies with the change of morbid state, it's necessary to adjust the ventilating parameter, so it's indispensable to evaluate the lung and tube parameter. This thesis makes a design of ventilating parameter estimator, according to the pressure, flow, airway resistance, compliance, the RCC model is built and the Recursive Least Squares are used to estimate the patient's real-time airway resistance, lung compliance, tube compliance. Subsequently, according to the estimator's evaluation, the clinical engineer could adjust the ventilator's pressure support and compensate the rate of flow at the appropriate time. The experiment result shows that this RCC model could evaluate the respiratory parameters well and give support to the adaptive control of ventilator's pressure and flow for the purpose to enhance patient's ventilating comfort and decrease the respiratory disease.","PeriodicalId":285726,"journal":{"name":"2017 4th International Conference on Systems and Informatics (ICSAI)","volume":"35 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133984463","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 : 2017-11-01DOI: 10.1109/ICSAI.2017.8248331
I. Cornelius, J. Shuttleworth, Sandy Taramonli
Prediction of the location and movement of objects is a problem that has seen many solutions put forward based on Markov models. The usual method involves the use of historical data for building a stochastic model in order to make future predictions. Here we present a method for predicting movement of an object using a Markov Model that is not populated by historical data from previous experiments. The proposed method introduces a novel mechanism that dynamically updates the transition probability matrix through analysis of stochastic properties of the data as it is collected. The model gives high accuracy predictions on an object's immediate next movement using a range of orders with results ranging from 79% to 96% dependent upon the type of movement exhibited by the object and order of the model.
{"title":"A dynamic Markov model for nth-order movement prediction","authors":"I. Cornelius, J. Shuttleworth, Sandy Taramonli","doi":"10.1109/ICSAI.2017.8248331","DOIUrl":"https://doi.org/10.1109/ICSAI.2017.8248331","url":null,"abstract":"Prediction of the location and movement of objects is a problem that has seen many solutions put forward based on Markov models. The usual method involves the use of historical data for building a stochastic model in order to make future predictions. Here we present a method for predicting movement of an object using a Markov Model that is not populated by historical data from previous experiments. The proposed method introduces a novel mechanism that dynamically updates the transition probability matrix through analysis of stochastic properties of the data as it is collected. The model gives high accuracy predictions on an object's immediate next movement using a range of orders with results ranging from 79% to 96% dependent upon the type of movement exhibited by the object and order of the model.","PeriodicalId":285726,"journal":{"name":"2017 4th International Conference on Systems and Informatics (ICSAI)","volume":"407 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131892050","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}
This study aims to investigate how does market differences influence consumers behavior when reading online reviews. To this end, we propose a conceptual model from the perspective of content quality and source quality to explore the determinants of review helpfulness. We demonstrate that consumers ranking behaviors show differences in different movie markets, due to the cultural influences. We collected reviews from IMDB.com (the famous US movie database) and douban.com (the famous China movie database). The results demonstrate that there are significant differences across two different movie markets (China and US). Specifically, online reviews length, review extremity, reviewer centrality and reviewer experience have great positive impact on reviews usefulness. We found that long sentences and the extreme emotion has much bigger helpfulness and persuasive effects in individualist societies (US) than collectivist societies (China); while the effects of reviewer centrality and reviewer experience to review usefulness are inclined to be same in two markets. The findings give a better understanding of online reviewer behaviors across different markets and provide important insights into emerging movie markets such as China.
{"title":"Distinguishing consumer behavior diversities in different markets based on online reviews","authors":"Zhen Qiu, Jinbo Zhang, Di Liu, Qiyuan Wang, Chunyang Li, Xiaozhen Li, Wei Cui, Xueying Ding","doi":"10.1109/ICSAI.2017.8248521","DOIUrl":"https://doi.org/10.1109/ICSAI.2017.8248521","url":null,"abstract":"This study aims to investigate how does market differences influence consumers behavior when reading online reviews. To this end, we propose a conceptual model from the perspective of content quality and source quality to explore the determinants of review helpfulness. We demonstrate that consumers ranking behaviors show differences in different movie markets, due to the cultural influences. We collected reviews from IMDB.com (the famous US movie database) and douban.com (the famous China movie database). The results demonstrate that there are significant differences across two different movie markets (China and US). Specifically, online reviews length, review extremity, reviewer centrality and reviewer experience have great positive impact on reviews usefulness. We found that long sentences and the extreme emotion has much bigger helpfulness and persuasive effects in individualist societies (US) than collectivist societies (China); while the effects of reviewer centrality and reviewer experience to review usefulness are inclined to be same in two markets. The findings give a better understanding of online reviewer behaviors across different markets and provide important insights into emerging movie markets such as China.","PeriodicalId":285726,"journal":{"name":"2017 4th International Conference on Systems and Informatics (ICSAI)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130779388","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 : 2017-11-01DOI: 10.1109/ICSAI.2017.8248328
Jiru Yang, Jin Yang, Ciwei Gao, Yang Cao, Wei Tian, Weiqing Ma, Zhiyi Jia
The development of the global energy Internet can promote the effective allocation of resources. The division of the developmental stage of regional and national cross-border energy transactions will point out a developing direction. Therefore, this paper studies the division of developmental stages of the global energy Internet. This paper summarizes the evaluating indicators of the grid interconnection based on research data and analyzes key factors as characteristic indicators through the principal component analysis. Through clustering analysis, the global energy Internet is divided into six developmental stages, and the division model of developmental stages is established. Furthermore, the rising conditions of each stage is given.
{"title":"The division of developmental stages of the global energy Internet","authors":"Jiru Yang, Jin Yang, Ciwei Gao, Yang Cao, Wei Tian, Weiqing Ma, Zhiyi Jia","doi":"10.1109/ICSAI.2017.8248328","DOIUrl":"https://doi.org/10.1109/ICSAI.2017.8248328","url":null,"abstract":"The development of the global energy Internet can promote the effective allocation of resources. The division of the developmental stage of regional and national cross-border energy transactions will point out a developing direction. Therefore, this paper studies the division of developmental stages of the global energy Internet. This paper summarizes the evaluating indicators of the grid interconnection based on research data and analyzes key factors as characteristic indicators through the principal component analysis. Through clustering analysis, the global energy Internet is divided into six developmental stages, and the division model of developmental stages is established. Furthermore, the rising conditions of each stage is given.","PeriodicalId":285726,"journal":{"name":"2017 4th International Conference on Systems and Informatics (ICSAI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131052345","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
扫码关注我们
求助内容：
应助结果提醒方式：