Subgraph matching is a classical graph task, which finds all subgraphs that are isomorphic to the query graph in a labeled data graph. According to the theoretical basis, there are three types of subgraph matching methods: exploration-based methods, state-space representation methods, and multi-way join methods. Each of these methods has its advantages, but their common feature is a large amount of computation. In order to improve the computation efficiency, some representative subgraph matching methods have their own parallel optimization methods, but these parallel optimization methods are not universal. To overcome the drawbacks and improve the efficiency of parallel computing, we propose an isolate-set-based parallel subgraph matching framework. The parallel framework can flexibly adapt different subgraph matching methods without changing the sequential methods themselves. We partition the search tree into several decoupled subtrees and prune the subtrees to reduce computation overheads. And then, parallel subgraph matching is implemented on the decoupled pruned subtrees. To demonstrate the proposed method’s effectiveness empirically, we parallelize several representative subgraph matching methods in our framework and compare their performance with the sequential methods. The results show that our parallel framework is adapted to representative sequential methods, outperforms the sequential methods by a large margin, and achieves a speedup of 10x-50x on a 64-core x86 machine.
{"title":"Isolate-Set-Based In-Memory Parallel Subgraph Matching Framework","authors":"Hang Qie, Y. Dou","doi":"10.1145/3569966.3570004","DOIUrl":"https://doi.org/10.1145/3569966.3570004","url":null,"abstract":"Subgraph matching is a classical graph task, which finds all subgraphs that are isomorphic to the query graph in a labeled data graph. According to the theoretical basis, there are three types of subgraph matching methods: exploration-based methods, state-space representation methods, and multi-way join methods. Each of these methods has its advantages, but their common feature is a large amount of computation. In order to improve the computation efficiency, some representative subgraph matching methods have their own parallel optimization methods, but these parallel optimization methods are not universal. To overcome the drawbacks and improve the efficiency of parallel computing, we propose an isolate-set-based parallel subgraph matching framework. The parallel framework can flexibly adapt different subgraph matching methods without changing the sequential methods themselves. We partition the search tree into several decoupled subtrees and prune the subtrees to reduce computation overheads. And then, parallel subgraph matching is implemented on the decoupled pruned subtrees. To demonstrate the proposed method’s effectiveness empirically, we parallelize several representative subgraph matching methods in our framework and compare their performance with the sequential methods. The results show that our parallel framework is adapted to representative sequential methods, outperforms the sequential methods by a large margin, and achieves a speedup of 10x-50x on a 64-core x86 machine.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"22 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87549640","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}
{"title":"A Fast Attitude Estimation Method Using Homography Matrix","authors":"YongYong Duan, Lei Zhao, Zongling Wu, Yujie Yang","doi":"10.1145/3403746.3403922","DOIUrl":"https://doi.org/10.1145/3403746.3403922","url":null,"abstract":"","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"61 1","pages":"164-168"},"PeriodicalIF":0.0,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84958146","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-07-12DOI: 10.1109/JCSSE.2017.8025912
R. Petrasch
Microservices need to communicate via inter-service communication mechanism. This leads to service integration that requires the aspect of messaging and event handling to be considered during the specification of microservices. Therefore, the application of Enterprise Integration Patterns (EIP) in the context of the design of microservice architectures seems to be a promising approach for microservice architecture engineering. This paper presents a model-based approach for microservice architectural design and service integration through formal models using the UML and UML profiles. A domain model (bounded contexts) is used as a starting point. UML component diagrams are extended so that microservices can be modeled. Enterprise integration patterns are applied to the microservice diagrams providing a precise microservice specification that can be used for further simulations, transformations, or code generation tasks.
{"title":"Model-based engineering for microservice architectures using Enterprise Integration Patterns for inter-service communication","authors":"R. Petrasch","doi":"10.1109/JCSSE.2017.8025912","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025912","url":null,"abstract":"Microservices need to communicate via inter-service communication mechanism. This leads to service integration that requires the aspect of messaging and event handling to be considered during the specification of microservices. Therefore, the application of Enterprise Integration Patterns (EIP) in the context of the design of microservice architectures seems to be a promising approach for microservice architecture engineering. This paper presents a model-based approach for microservice architectural design and service integration through formal models using the UML and UML profiles. A domain model (bounded contexts) is used as a starting point. UML component diagrams are extended so that microservices can be modeled. Enterprise integration patterns are applied to the microservice diagrams providing a precise microservice specification that can be used for further simulations, transformations, or code generation tasks.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"8 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79572789","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-07-12DOI: 10.1109/JCSSE.2017.8025909
Piyatap Promrit, W. Suntiamorntut
This paper proposed real-time lane detection system for automotive application based on field programmable gate array (FPGA). The proposed system has two main. The first one is pre-processing with statistic and blob detection, and the second one is real-time lane detection algorithm. To meet real-time system, using the simple algorithm on a clear image by pre-processing. Experiments and comparisons show that the proposed algorithm works in real-time based on FPGA. The full HD resolution @60 fps is streaming to FPGA for processing at 116.67 MHz.
{"title":"Design and development of lane detection based on FPGA","authors":"Piyatap Promrit, W. Suntiamorntut","doi":"10.1109/JCSSE.2017.8025909","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025909","url":null,"abstract":"This paper proposed real-time lane detection system for automotive application based on field programmable gate array (FPGA). The proposed system has two main. The first one is pre-processing with statistic and blob detection, and the second one is real-time lane detection algorithm. To meet real-time system, using the simple algorithm on a clear image by pre-processing. Experiments and comparisons show that the proposed algorithm works in real-time based on FPGA. The full HD resolution @60 fps is streaming to FPGA for processing at 116.67 MHz.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"102 1","pages":"1-4"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88947911","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-07-12DOI: 10.1109/JCSSE.2017.8025899
Jean-Charles Coetsier, Rachsuda Jiamthapthaksin
Support Vector Machine (SVM) is one of the most popular machine learning algorithm to perform classification tasks and help organizations in different ways to improve their efficiency. A lot of studies have been made to improve SVM including speed, accuracy, and/or scalability. The algorithm possesses parameters that need precision tuning to perform well. This work proposes a novel parallelized parameter selection using Flower Pollination Algorithm (FPA) to quickly find the optimal parameters of SVM. In particular, MapReduce algorithm introduced in big data framework is applied to both FPA and SVM, which forms a fully distributed algorithm to support a large dataset. The experimental results of Parallelized FPA-SVM on real datasets show its outstanding speed in generating optimal models while maintaining high accuracy.
{"title":"Parallelized FPA-SVM: Parallelized parameter selection and classification using Flower Pollination Algorithm and Support Vector Machine","authors":"Jean-Charles Coetsier, Rachsuda Jiamthapthaksin","doi":"10.1109/JCSSE.2017.8025899","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025899","url":null,"abstract":"Support Vector Machine (SVM) is one of the most popular machine learning algorithm to perform classification tasks and help organizations in different ways to improve their efficiency. A lot of studies have been made to improve SVM including speed, accuracy, and/or scalability. The algorithm possesses parameters that need precision tuning to perform well. This work proposes a novel parallelized parameter selection using Flower Pollination Algorithm (FPA) to quickly find the optimal parameters of SVM. In particular, MapReduce algorithm introduced in big data framework is applied to both FPA and SVM, which forms a fully distributed algorithm to support a large dataset. The experimental results of Parallelized FPA-SVM on real datasets show its outstanding speed in generating optimal models while maintaining high accuracy.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"6 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86273085","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-07-12DOI: 10.1109/JCSSE.2017.8025919
Poonyavee Kasemsuwan, V. Visoottiviseth
OSPF is one of a widely deployed intra-domain routing protocol in enterprise network operation around the world. As the protocol itself was introduced about two decades ago, it contains many known attacks which some of them can be patched by a newer version of the router firmware. Nevertheless, a reckless or a poor practice of network operator could jeopardize the system by forgetting to enable the OSPF authentication or use a password that can be easily guessed. Moreover, a lot of routers that still in operating out there are running with the out-of-date firmware, which surely contains security holes. Attacks on routing protocol could lead to severe damage to the network. In this paper, we introduce OSV as a tool to detect the OSPF network vulnerability by checking password strength and performing ten penetration testing against the target OSPF network. OSV also generates a report to inform any vulnerability found to help the network operator detect their security issues. We confirm the validation and the performance of OSV tool by testing it with Quagga and Cisco routers.
{"title":"OSV: OSPF vulnerability checking tool","authors":"Poonyavee Kasemsuwan, V. Visoottiviseth","doi":"10.1109/JCSSE.2017.8025919","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025919","url":null,"abstract":"OSPF is one of a widely deployed intra-domain routing protocol in enterprise network operation around the world. As the protocol itself was introduced about two decades ago, it contains many known attacks which some of them can be patched by a newer version of the router firmware. Nevertheless, a reckless or a poor practice of network operator could jeopardize the system by forgetting to enable the OSPF authentication or use a password that can be easily guessed. Moreover, a lot of routers that still in operating out there are running with the out-of-date firmware, which surely contains security holes. Attacks on routing protocol could lead to severe damage to the network. In this paper, we introduce OSV as a tool to detect the OSPF network vulnerability by checking password strength and performing ten penetration testing against the target OSPF network. OSV also generates a report to inform any vulnerability found to help the network operator detect their security issues. We confirm the validation and the performance of OSV tool by testing it with Quagga and Cisco routers.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"81 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79783074","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-07-12DOI: 10.1109/JCSSE.2017.8025920
Manachai Toahchoodee
Injuries and sudden illnesses are leading causes of mortality and disability worldwide. Pre-hospital Emergency Medical Service is the Medical service which focuses on helping the emergency patients from traumatic condition, preventing from disabilities and deaths, and associating the patients from severe condition to get the proper treatment on time. This could increase the survival rate dramatically. However, the Pre-hospital Emergency Medical Service nowadays still facing some limitations which prevent the treatment from getting to the accident site on time. In this paper, we propose ARSA, the Rescuer Supporting System for the Pre-hospital Emergency Medical Service. The system helps the patients to send the emergency request to the nearest paramedics and the medical supplies transporters. Therefore, the help could be sent directly to the patient site without having to wait for the ambulance sent from the EMS agency. This could immensely increases the survival rate of the emergency patients.
{"title":"ARSA-the pervasive Rescuer Supporting System for the Pre-hospital Emergency Medical Service","authors":"Manachai Toahchoodee","doi":"10.1109/JCSSE.2017.8025920","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025920","url":null,"abstract":"Injuries and sudden illnesses are leading causes of mortality and disability worldwide. Pre-hospital Emergency Medical Service is the Medical service which focuses on helping the emergency patients from traumatic condition, preventing from disabilities and deaths, and associating the patients from severe condition to get the proper treatment on time. This could increase the survival rate dramatically. However, the Pre-hospital Emergency Medical Service nowadays still facing some limitations which prevent the treatment from getting to the accident site on time. In this paper, we propose ARSA, the Rescuer Supporting System for the Pre-hospital Emergency Medical Service. The system helps the patients to send the emergency request to the nearest paramedics and the medical supplies transporters. Therefore, the help could be sent directly to the patient site without having to wait for the ambulance sent from the EMS agency. This could immensely increases the survival rate of the emergency patients.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"115 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83531919","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-07-12DOI: 10.1109/JCSSE.2017.8025906
Pichit Promsutipong, Vishnu Kotrajaras
Enemy plays an important role in providing challenge in action-platform games. Our intention is to generate enemies automatically. To ensure that our enemies can be used in actual games, we need to evaluate their qualities. Using human players for the evaluation is not feasible if we generate a lot of enemies or if we are going to use the algorithm in actual games. Our approach is to create a player AI that can play action-platform games with the same performance as human players. That AI's battle performance will then be used to evaluate the generated enemies. This paper presents the definition of battle performance and the AI implementation, combining FSM, search and rule-based heuristics. The AI is shown to perform similar to human players.
{"title":"Enemy evaluation AI for 2D action-platform game","authors":"Pichit Promsutipong, Vishnu Kotrajaras","doi":"10.1109/JCSSE.2017.8025906","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025906","url":null,"abstract":"Enemy plays an important role in providing challenge in action-platform games. Our intention is to generate enemies automatically. To ensure that our enemies can be used in actual games, we need to evaluate their qualities. Using human players for the evaluation is not feasible if we generate a lot of enemies or if we are going to use the algorithm in actual games. Our approach is to create a player AI that can play action-platform games with the same performance as human players. That AI's battle performance will then be used to evaluate the generated enemies. This paper presents the definition of battle performance and the AI implementation, combining FSM, search and rule-based heuristics. The AI is shown to perform similar to human players.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"26 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86326190","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-07-12DOI: 10.1109/JCSSE.2017.8025905
Pannakorn Chao-angthong, A. Suchato, P. Punyabukkana
Each of the dialects of Thai Language has a distinct identity associated with its accents. The conversation between different native speakers of these dialects despite their standard language origination cannot be avoided when visiting each region. Communication with people who understand only the Northern Thai Dialect (NTD) brought us to the idea of inventing the Northern Thai Dialect Text to Speech (NTD-TTS). This idea derives from the same concept as a translating program; after getting text input in the Center Thai Dialect (CTD), the TTS system will translate and synthesize speech output in NTD. TTS used a software structure and modified two components: Grapheme to Phoneme (G2P) and Speech models. The NTD-G2P conversion was created by using rule-based and dictionary-based approaches. It was evaluated by 100 randomly selected sentences from ORCHID. The NTD-G2P reports a conversion accuracy of 83.19% on the syllable level and it is used for implementing the NTD-corpus. The sentence selections were presented to train the NTD speech model. The selection chosen covers 95.32% in the first percentile of phoneme distribution in the NTD-corpus. After connecting the speech models to the TTS system, the whole system was evaluated with Mean Opinion Score (MOS) and the comprehension on the syllable level by the native speakers. The NTD-MOS evaluations indicated that the accent, naturalness, and intelligibility of synthetic speech ranged from “acceptable” to “good”. The test set of the NTD-TTS system earned a good MOS and high comprehension percentage from the NTD native listeners. The results are 3.73 in the accent, 3.68 in the naturalness, 3.63 in the intelligibility, and the comprehension percentage is 97.16%.
泰国语的每一种方言都有与其口音相关的独特身份。在访问每个地区时，这些方言的不同母语人士之间的对话是不可避免的，尽管他们的标准语言来源。与只懂泰国北部方言(NTD)的人交流使我们产生了发明泰国北部方言文本到语音(NTD- tts)的想法。这一理念源于与翻译程序相同的概念;TTS系统在获得CTD文本输入后，对NTD语音输出进行翻译和合成。TTS采用了一种软件结构，并对两个部分进行了修改:Grapheme to Phoneme (G2P)和Speech模型。NTD-G2P转换是通过使用基于规则和基于字典的方法创建的。它是通过从ORCHID中随机选择的100个句子来评估的。NTD-G2P在音节水平上的转换准确率为83.19%，用于实现ntd语料库。通过句子选择来训练NTD语音模型。所选择的音素覆盖了ntd语料库中音素分布前百分位数的95.32%。将语音模型与TTS系统连接后，用平均意见评分(Mean Opinion Score, MOS)和母语使用者在音节水平上的理解能力对整个系统进行评价。NTD-MOS评价表明，合成语音的口音、自然度和可理解性在“可接受”到“良好”之间。NTD- tts系统的测试集获得了NTD母语听众良好的MOS和较高的理解率。结果口音分3.73分，自然度分3.68分，可理解度分3.63分，理解率为97.16%。
{"title":"Northern Thai Dialect Text to Speech","authors":"Pannakorn Chao-angthong, A. Suchato, P. Punyabukkana","doi":"10.1109/JCSSE.2017.8025905","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025905","url":null,"abstract":"Each of the dialects of Thai Language has a distinct identity associated with its accents. The conversation between different native speakers of these dialects despite their standard language origination cannot be avoided when visiting each region. Communication with people who understand only the Northern Thai Dialect (NTD) brought us to the idea of inventing the Northern Thai Dialect Text to Speech (NTD-TTS). This idea derives from the same concept as a translating program; after getting text input in the Center Thai Dialect (CTD), the TTS system will translate and synthesize speech output in NTD. TTS used a software structure and modified two components: Grapheme to Phoneme (G2P) and Speech models. The NTD-G2P conversion was created by using rule-based and dictionary-based approaches. It was evaluated by 100 randomly selected sentences from ORCHID. The NTD-G2P reports a conversion accuracy of 83.19% on the syllable level and it is used for implementing the NTD-corpus. The sentence selections were presented to train the NTD speech model. The selection chosen covers 95.32% in the first percentile of phoneme distribution in the NTD-corpus. After connecting the speech models to the TTS system, the whole system was evaluated with Mean Opinion Score (MOS) and the comprehension on the syllable level by the native speakers. The NTD-MOS evaluations indicated that the accent, naturalness, and intelligibility of synthetic speech ranged from “acceptable” to “good”. The test set of the NTD-TTS system earned a good MOS and high comprehension percentage from the NTD native listeners. The results are 3.73 in the accent, 3.68 in the naturalness, 3.63 in the intelligibility, and the comprehension percentage is 97.16%.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"1 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79641865","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-07-12DOI: 10.1109/JCSSE.2017.8025904
O. Chieochan, Anukit Saokaew, E. Boonchieng
This research aims to prototype a smart Lingzhi mushroom farm. This research applied the use of IOT with a sensor to measure and monitors the humidity in the Lingzhi mushroom farm. The humidity data processed through NETPIE was developed and provided by NECTEC as a free service for IOT. Humidity data was stored into a NET FEED (a sub service from NETPIE) and displayed on mobile devices and computers through NET FREEBOARD (another sub service of NETPIE). This research also controlled sprinkler and fog pumps automatically and the functional status (switching on and off for periods of time) pushes notifications through LINE API on the LINE Application. The equipment and tools used in this research were NodeMCU, humidity sensor, RTC (real time clock), relay module, sprinkler and fog pumps. C++ and Node.JS were used as programming. The services and protocol used were NETPIE (Network Platform for internet of everything) with subservices such as NETPIE FEED, NETPIE FREEBOARD, and NETPIE REST API. The results of the research showed that using IOT with the sensor enhanced the prototype of smart farming.
{"title":"IOT for smart farm: A case study of the Lingzhi mushroom farm at Maejo University","authors":"O. Chieochan, Anukit Saokaew, E. Boonchieng","doi":"10.1109/JCSSE.2017.8025904","DOIUrl":"https://doi.org/10.1109/JCSSE.2017.8025904","url":null,"abstract":"This research aims to prototype a smart Lingzhi mushroom farm. This research applied the use of IOT with a sensor to measure and monitors the humidity in the Lingzhi mushroom farm. The humidity data processed through NETPIE was developed and provided by NECTEC as a free service for IOT. Humidity data was stored into a NET FEED (a sub service from NETPIE) and displayed on mobile devices and computers through NET FREEBOARD (another sub service of NETPIE). This research also controlled sprinkler and fog pumps automatically and the functional status (switching on and off for periods of time) pushes notifications through LINE API on the LINE Application. The equipment and tools used in this research were NodeMCU, humidity sensor, RTC (real time clock), relay module, sprinkler and fog pumps. C++ and Node.JS were used as programming. The services and protocol used were NETPIE (Network Platform for internet of everything) with subservices such as NETPIE FEED, NETPIE FREEBOARD, and NETPIE REST API. The results of the research showed that using IOT with the sensor enhanced the prototype of smart farming.","PeriodicalId":6460,"journal":{"name":"2017 14th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"182 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2017-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76045312","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
扫码关注我们
求助内容：
应助结果提醒方式：