Pub Date : 2020-05-01DOI: 10.1109/ICCCS49078.2020.9118591
Wen Xiao, Liang Bo, Ramanpreet Kaur
This paper will demonstrate the design technique for LED lighting control using the Power Line Communication (PLC) technology based on the research. LEDs today are the most preferred lighting source due to their low power, high-efficiency and smaller size. Power lines used universally and are a generally accessible communication medium for PLC technology. In this paper, a master and slave architecture are presented which makes use of the half duplex communication where the master unit generates the data pulses and slave receives these pulses at a rate of 1 Kb/s to control the LEDs connected through the driver unit. This device is having ability to control more than one slave using the single master controller. The results have been added to show the successful communication established between the master and slave units. The proposed method is less expensive due to least circuitry and a simple design using half duplex communication. No complex protocols like ethernet employed in this design method.
{"title":"Design of LED Lighting System Based on Power line Communication","authors":"Wen Xiao, Liang Bo, Ramanpreet Kaur","doi":"10.1109/ICCCS49078.2020.9118591","DOIUrl":"https://doi.org/10.1109/ICCCS49078.2020.9118591","url":null,"abstract":"This paper will demonstrate the design technique for LED lighting control using the Power Line Communication (PLC) technology based on the research. LEDs today are the most preferred lighting source due to their low power, high-efficiency and smaller size. Power lines used universally and are a generally accessible communication medium for PLC technology. In this paper, a master and slave architecture are presented which makes use of the half duplex communication where the master unit generates the data pulses and slave receives these pulses at a rate of 1 Kb/s to control the LEDs connected through the driver unit. This device is having ability to control more than one slave using the single master controller. The results have been added to show the successful communication established between the master and slave units. The proposed method is less expensive due to least circuitry and a simple design using half duplex communication. No complex protocols like ethernet employed in this design method.","PeriodicalId":105556,"journal":{"name":"2020 5th International Conference on Computer and Communication Systems (ICCCS)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130079398","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}
Image features detection and matching algorithms play an important role in the field of machine vision. Among them, the computational efficiency and robust performance of the features detector descriptor selected by the algorithm have a great impact on the accuracy and time consumption of image matching. This paper comprehensively evaluates typical SIFT, SURF, ORB, BRISK, KAZE, AKAZE algorithms. The Oxford dataset is used to compare the robustness of various algorithms under illumination transformation, rotation transformation, scale transformation, blur transformation, and viewpoint transformation. Jitter video is also used to compare the anti-jitter ability for these algorithms. The indicators compared include: time of detecting features, time of matching images, total running time, number of detected feature points, accuracy, number of repeated feature points, and repetition rate. Experimental results show that, Under different transformations, each algorithm has its own advantages and disadvantages.
{"title":"Evaluation of Image Feature Detection and Matching Algorithms","authors":"Yiwen Ou, Zhiming Cai, Jian Lu, Jian Dong, Yufeng Ling","doi":"10.1109/ICCCS49078.2020.9118480","DOIUrl":"https://doi.org/10.1109/ICCCS49078.2020.9118480","url":null,"abstract":"Image features detection and matching algorithms play an important role in the field of machine vision. Among them, the computational efficiency and robust performance of the features detector descriptor selected by the algorithm have a great impact on the accuracy and time consumption of image matching. This paper comprehensively evaluates typical SIFT, SURF, ORB, BRISK, KAZE, AKAZE algorithms. The Oxford dataset is used to compare the robustness of various algorithms under illumination transformation, rotation transformation, scale transformation, blur transformation, and viewpoint transformation. Jitter video is also used to compare the anti-jitter ability for these algorithms. The indicators compared include: time of detecting features, time of matching images, total running time, number of detected feature points, accuracy, number of repeated feature points, and repetition rate. Experimental results show that, Under different transformations, each algorithm has its own advantages and disadvantages.","PeriodicalId":105556,"journal":{"name":"2020 5th International Conference on Computer and Communication Systems (ICCCS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130532866","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 : 2020-05-01DOI: 10.1109/ICCCS49078.2020.9118446
Liyuan Zhao, Li Li
In the era of 5G, network slicing is considered to be an effective solution for flexible network deployment and diversified services. It based on network virtualization technology to divide into multiple end-to-end virtual networks on the substrate physical network and in the form of services to meet the user that has customized appeal to network resource. This paper proposes a reinforcement learning algorithm based on collaborative relationship between node mapping and link mapping(RLCO). In the node mapping stage, we apply the policy network to calculate the probability of the physical node mapping to a virtual node. In the link mapping stage, we apply the Dijkstra algorithm. After the success of node and link mapping, the algorithm evaluates the mapping results respectively, and on this basis, defines the reward function of the RLCO algorithm. The difference characteristics of node and link are introduced into the reward function. The RLCO algorithm based on this reward function can make the result of network slicing mapping reach the global optimal. Furthermore, we compare the RLCO algorithm with the other three algorithms. The results show that the RLCO algorithm is superior to other three algorithms in terms of the acceptance rate of network slice requests and the long-term earning/cost ratio.
{"title":"Reinforcement Learning for Resource Mapping in 5G Network Slicing","authors":"Liyuan Zhao, Li Li","doi":"10.1109/ICCCS49078.2020.9118446","DOIUrl":"https://doi.org/10.1109/ICCCS49078.2020.9118446","url":null,"abstract":"In the era of 5G, network slicing is considered to be an effective solution for flexible network deployment and diversified services. It based on network virtualization technology to divide into multiple end-to-end virtual networks on the substrate physical network and in the form of services to meet the user that has customized appeal to network resource. This paper proposes a reinforcement learning algorithm based on collaborative relationship between node mapping and link mapping(RLCO). In the node mapping stage, we apply the policy network to calculate the probability of the physical node mapping to a virtual node. In the link mapping stage, we apply the Dijkstra algorithm. After the success of node and link mapping, the algorithm evaluates the mapping results respectively, and on this basis, defines the reward function of the RLCO algorithm. The difference characteristics of node and link are introduced into the reward function. The RLCO algorithm based on this reward function can make the result of network slicing mapping reach the global optimal. Furthermore, we compare the RLCO algorithm with the other three algorithms. The results show that the RLCO algorithm is superior to other three algorithms in terms of the acceptance rate of network slice requests and the long-term earning/cost ratio.","PeriodicalId":105556,"journal":{"name":"2020 5th International Conference on Computer and Communication Systems (ICCCS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132436152","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 : 2020-05-01DOI: 10.1109/ICCCS49078.2020.9118468
Peng Pengfei, Liu Yating, Zhou Linru
According to the distribution, dynamic and complexity of equipment support task planning base on network, combined with the relation of the organization structure of the equipment support command system, a master-slave interactive collaborative decision-making method based on network is proposed. By defining the concept of conflict degree based on vector angle, the method gives a quantitative method for the degree of conflict of group cooperative decision; The conflict degree judgment model and the decision variable adjustment model is constructed, and conflict elimination is completed though a network centric interactive collaborative approach, so that the opinion consensus problem of group decision making is solved. Dynamic simulation and analysis of decision making process based on Petri net model shows that this new method can effectively solve the problem of equipment support task-resource optimization matching and decision making under information condition, and has a good prospect in the new equipment support command information system construction.
{"title":"Research on Interactive Collaborative Decision-Making Method of Equipment Support Task Planning","authors":"Peng Pengfei, Liu Yating, Zhou Linru","doi":"10.1109/ICCCS49078.2020.9118468","DOIUrl":"https://doi.org/10.1109/ICCCS49078.2020.9118468","url":null,"abstract":"According to the distribution, dynamic and complexity of equipment support task planning base on network, combined with the relation of the organization structure of the equipment support command system, a master-slave interactive collaborative decision-making method based on network is proposed. By defining the concept of conflict degree based on vector angle, the method gives a quantitative method for the degree of conflict of group cooperative decision; The conflict degree judgment model and the decision variable adjustment model is constructed, and conflict elimination is completed though a network centric interactive collaborative approach, so that the opinion consensus problem of group decision making is solved. Dynamic simulation and analysis of decision making process based on Petri net model shows that this new method can effectively solve the problem of equipment support task-resource optimization matching and decision making under information condition, and has a good prospect in the new equipment support command information system construction.","PeriodicalId":105556,"journal":{"name":"2020 5th International Conference on Computer and Communication Systems (ICCCS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130880615","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 : 2020-05-01DOI: 10.1109/ICCCS49078.2020.9118457
Hamid Dhanyal, Wei-dong Hu, Hassan Feroz, H. Nawaz, Abdul Samad, Umar Farooq
In this article a high power (320 watt), high efficiency (greater than 56 %) LDMOS based power amplifier configuration is proposed. Proposed compact class-AB amplifier is designed using non-linear model of MRF8P29300, targeting S-band. Along with optimization using ADS, hybrid couplers are used to improve the performance of proposed amplifier, providing output power of 56 dBm. Other than design details, paper also present electromagnetic and thermal analysis for better understanding of amplifier characteristics. Moreover, measured results indicate that proposed amplifier achieved 14dB gain, gain flatness <0.7dB and input/output return loss <-12dB; which make proposed amplifier worthy and prospective candidate for surveillance and tracking radars.
{"title":"Miniaturized High-Efficiency Pulsed-Power Amplifier for Surveillance and Tracking Radar","authors":"Hamid Dhanyal, Wei-dong Hu, Hassan Feroz, H. Nawaz, Abdul Samad, Umar Farooq","doi":"10.1109/ICCCS49078.2020.9118457","DOIUrl":"https://doi.org/10.1109/ICCCS49078.2020.9118457","url":null,"abstract":"In this article a high power (320 watt), high efficiency (greater than 56 %) LDMOS based power amplifier configuration is proposed. Proposed compact class-AB amplifier is designed using non-linear model of MRF8P29300, targeting S-band. Along with optimization using ADS, hybrid couplers are used to improve the performance of proposed amplifier, providing output power of 56 dBm. Other than design details, paper also present electromagnetic and thermal analysis for better understanding of amplifier characteristics. Moreover, measured results indicate that proposed amplifier achieved 14dB gain, gain flatness <0.7dB and input/output return loss <-12dB; which make proposed amplifier worthy and prospective candidate for surveillance and tracking radars.","PeriodicalId":105556,"journal":{"name":"2020 5th International Conference on Computer and Communication Systems (ICCCS)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128994702","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 : 2020-05-01DOI: 10.1109/ICCCS49078.2020.9118555
A. A. Dahir, Zhihua Yu
Fiber Bragg Gratings (FBG) is one of the essential techniques that applied for limiting the dispersion, in this paper we use FBG which is widely used component to compensate dispersion with linear chirp and Tanh apodization function, and additionally we embedded low pass Gaussian filter in the electrical part of the system to improve the Q-factor of the performance and eye diagram. The Q-factor of the system is then investigated with and without the Low pass Gaussian filter. The Q-factor of 30km length of the system with FBG is 20.2748, and by using FBG and Low Pass Gaussian Filter, the Q-factor managed to reach 26.9039; We realize that using FBG and Low Pass Gaussian filter as dispersion compensation element gives a better system performance. The system is analyzed with various fiber lengths and evaluated by using optisystem ver15.
{"title":"Dispersion Compensation by Using FBG and Low Pass Gaussian Filter","authors":"A. A. Dahir, Zhihua Yu","doi":"10.1109/ICCCS49078.2020.9118555","DOIUrl":"https://doi.org/10.1109/ICCCS49078.2020.9118555","url":null,"abstract":"Fiber Bragg Gratings (FBG) is one of the essential techniques that applied for limiting the dispersion, in this paper we use FBG which is widely used component to compensate dispersion with linear chirp and Tanh apodization function, and additionally we embedded low pass Gaussian filter in the electrical part of the system to improve the Q-factor of the performance and eye diagram. The Q-factor of the system is then investigated with and without the Low pass Gaussian filter. The Q-factor of 30km length of the system with FBG is 20.2748, and by using FBG and Low Pass Gaussian Filter, the Q-factor managed to reach 26.9039; We realize that using FBG and Low Pass Gaussian filter as dispersion compensation element gives a better system performance. The system is analyzed with various fiber lengths and evaluated by using optisystem ver15.","PeriodicalId":105556,"journal":{"name":"2020 5th International Conference on Computer and Communication Systems (ICCCS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125375173","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 : 2020-05-01DOI: 10.1109/ICCCS49078.2020.9118604
Takuya Kondo, O. Uchida
When a large-scale disaster occurs, early evacuation of residents in areas where damage is expected is important to reduce human damage. For this reason, the Japan Meteorological Agency and local governments announce information on disasters and evacuation in Japan. However, there are cases where the residents cannot utilize such information. Then, in this study, we propose a system that encourages residents to evacuate quickly in the event of a large-scale disaster by providing disaster information in an easy-to-understand manner.
{"title":"Real-Time Disaster Information Providing System for Inducing Risk Perception","authors":"Takuya Kondo, O. Uchida","doi":"10.1109/ICCCS49078.2020.9118604","DOIUrl":"https://doi.org/10.1109/ICCCS49078.2020.9118604","url":null,"abstract":"When a large-scale disaster occurs, early evacuation of residents in areas where damage is expected is important to reduce human damage. For this reason, the Japan Meteorological Agency and local governments announce information on disasters and evacuation in Japan. However, there are cases where the residents cannot utilize such information. Then, in this study, we propose a system that encourages residents to evacuate quickly in the event of a large-scale disaster by providing disaster information in an easy-to-understand manner.","PeriodicalId":105556,"journal":{"name":"2020 5th International Conference on Computer and Communication Systems (ICCCS)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123239760","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 : 2020-05-01DOI: 10.1109/ICCCS49078.2020.9118578
Jayshree Ghorpade, B. Sonkamble
Data intensive processing and analysis has lead new research avenues to draw the attention of researchers and decision makers in the field of data and information sciences. The exponential rise in variety of data in today’s computerized era is laying new challenges for the society. Nevertheless, there are huge potentials and useful information present in the data. This undiscovered information is one of the most valuable assets for the data intensive scientific real-time applications. It is a vital factor for the efficient outcome and evolving advances in various technical aspects. Yet, a large number of sectors with varied data sources face difficulties with the variety of data. Processing this heterogeneous data is necessary to extract useful information, making it a decisive factor for the better survival of future with automation. Different Machine Learning techniques and tools are studied to perform predictive analysis of the continuous as well as categorical data.
{"title":"Predictive Analysis of Heterogeneous Data – Techniques & Tools","authors":"Jayshree Ghorpade, B. Sonkamble","doi":"10.1109/ICCCS49078.2020.9118578","DOIUrl":"https://doi.org/10.1109/ICCCS49078.2020.9118578","url":null,"abstract":"Data intensive processing and analysis has lead new research avenues to draw the attention of researchers and decision makers in the field of data and information sciences. The exponential rise in variety of data in today’s computerized era is laying new challenges for the society. Nevertheless, there are huge potentials and useful information present in the data. This undiscovered information is one of the most valuable assets for the data intensive scientific real-time applications. It is a vital factor for the efficient outcome and evolving advances in various technical aspects. Yet, a large number of sectors with varied data sources face difficulties with the variety of data. Processing this heterogeneous data is necessary to extract useful information, making it a decisive factor for the better survival of future with automation. Different Machine Learning techniques and tools are studied to perform predictive analysis of the continuous as well as categorical data.","PeriodicalId":105556,"journal":{"name":"2020 5th International Conference on Computer and Communication Systems (ICCCS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122562554","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 : 2020-05-01DOI: 10.1109/ICCCS49078.2020.9118462
T. Ijitona, Hong Yue, J. Soraghan, A. Lowit
A novel algorithm for the segmentation of dysarthric speech into silence, unvoiced and voiced (SUV) segments is presented. The proposed algorithm is based on the combination of short-time energy (STE), zero-crossing rate (ZCR) and linear prediction error variance (LPEV) or the segmentation problem. Extending the previous work in this field, the proposed method will address the difficulties in distinguishing between voiced and unvoiced segments in dysarthric speech. More precisely, the error variance of the linear prediction coefficients will be used to design a three-fold decision matrix that can accommodate the high variability in loudness experienced in dysarthric speech. In addition, a moving average threshold approach will be proposed in order to provide an “as-fit” segmentation technique that is fully automated and that will be able to handle highly severe dysarthric speech with varying loudness and ZCRs. The ability of the proposed fully-automated algorithm will be validated using real speech samples from healthy speakers, and speakers with ataxic dysarthria. The results of the proposed approach are compared with known methods using STE and ZCR. It is observed that the proposed classification method does not only show an improvement in segmentation performance but also provides consistent results in low signal energy situations.
{"title":"Improved Silence-Unvoiced-Voiced (SUV) Segmentation for Dysarthric Speech Signals using Linear Prediction Error Variance","authors":"T. Ijitona, Hong Yue, J. Soraghan, A. Lowit","doi":"10.1109/ICCCS49078.2020.9118462","DOIUrl":"https://doi.org/10.1109/ICCCS49078.2020.9118462","url":null,"abstract":"A novel algorithm for the segmentation of dysarthric speech into silence, unvoiced and voiced (SUV) segments is presented. The proposed algorithm is based on the combination of short-time energy (STE), zero-crossing rate (ZCR) and linear prediction error variance (LPEV) or the segmentation problem. Extending the previous work in this field, the proposed method will address the difficulties in distinguishing between voiced and unvoiced segments in dysarthric speech. More precisely, the error variance of the linear prediction coefficients will be used to design a three-fold decision matrix that can accommodate the high variability in loudness experienced in dysarthric speech. In addition, a moving average threshold approach will be proposed in order to provide an “as-fit” segmentation technique that is fully automated and that will be able to handle highly severe dysarthric speech with varying loudness and ZCRs. The ability of the proposed fully-automated algorithm will be validated using real speech samples from healthy speakers, and speakers with ataxic dysarthria. The results of the proposed approach are compared with known methods using STE and ZCR. It is observed that the proposed classification method does not only show an improvement in segmentation performance but also provides consistent results in low signal energy situations.","PeriodicalId":105556,"journal":{"name":"2020 5th International Conference on Computer and Communication Systems (ICCCS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126330873","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 : 2020-05-01DOI: 10.1109/ICCCS49078.2020.9118512
Zheng Su, Mukai Hao, Qiang Zhang, Bo Chai, Ting Zhao
In the last years, Knowledge Graph (KG) has been widely applied in domain knowledge modeling, and therefore has received more attention in the Ubiquitous Power Internet of Things (UPIoT) that consists of a large number of power terminal equipment and sensing devices. In this paper, we propose an automatic framework to construct power terminal equipment knowledge graph by extracting ontological information and instantiating objects from the relational data of power terminal equipment. First, the ontological concepts and the hierarchy between concepts are built by analyzing the data schemas of different types of devices and their properties. Then the knowledge graph for different types of device objects is constructed by instantiating every object and their binary relations. In addition, we give the relevant algorithms of automatically constructing the complete knowledge graph of power terminal equipment. We argue that the proposed approach will greatly facilitate the information sharing of multi-source heterogeneous data of power terminal equipment on the environment of UPIoT.
{"title":"Automatic Knowledge Graph Construction Based on Relational Data of Power Terminal Equipment","authors":"Zheng Su, Mukai Hao, Qiang Zhang, Bo Chai, Ting Zhao","doi":"10.1109/ICCCS49078.2020.9118512","DOIUrl":"https://doi.org/10.1109/ICCCS49078.2020.9118512","url":null,"abstract":"In the last years, Knowledge Graph (KG) has been widely applied in domain knowledge modeling, and therefore has received more attention in the Ubiquitous Power Internet of Things (UPIoT) that consists of a large number of power terminal equipment and sensing devices. In this paper, we propose an automatic framework to construct power terminal equipment knowledge graph by extracting ontological information and instantiating objects from the relational data of power terminal equipment. First, the ontological concepts and the hierarchy between concepts are built by analyzing the data schemas of different types of devices and their properties. Then the knowledge graph for different types of device objects is constructed by instantiating every object and their binary relations. In addition, we give the relevant algorithms of automatically constructing the complete knowledge graph of power terminal equipment. We argue that the proposed approach will greatly facilitate the information sharing of multi-source heterogeneous data of power terminal equipment on the environment of UPIoT.","PeriodicalId":105556,"journal":{"name":"2020 5th International Conference on Computer and Communication Systems (ICCCS)","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122332440","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
扫码关注我们
求助内容：
应助结果提醒方式：