Pub Date : 2019-04-16DOI: 10.2991/IJNDC.K.190326.001
Zin Mar Kyu, Naw Lay Wah
{"title":"An Improved Semantic Role Labeling for Myanmar Text","authors":"Zin Mar Kyu, Naw Lay Wah","doi":"10.2991/IJNDC.K.190326.001","DOIUrl":"https://doi.org/10.2991/IJNDC.K.190326.001","url":null,"abstract":"","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121341932","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 : 2019-04-16DOI: 10.2991/IJNDC.K.190326.002
Kyi Pyar Zaw, Zin Mar Kyu
Warnings about the display of signs are important in several areas of application: machine language translation, text-to-speech, help for visually impaired and foreigners. There are some methods and are described in the literature. Some researchers recognize Myanmar handwritten characters based on structural and statistical characteristics. Myanmar’s character recognition system was developed to apply license plate recognition, date identification and number of numbers on bank checks, typed character recognition in the standard application form, bilingual design of Burmese symbols, with English symbols, Burmese handwritten character recognition. They are primarily based on pattern matching and normalized correlation with large databases of storage patterns.
{"title":"Character Segmentation and Recognition for Myanmar Warning Signboard Images","authors":"Kyi Pyar Zaw, Zin Mar Kyu","doi":"10.2991/IJNDC.K.190326.002","DOIUrl":"https://doi.org/10.2991/IJNDC.K.190326.002","url":null,"abstract":"Warnings about the display of signs are important in several areas of application: machine language translation, text-to-speech, help for visually impaired and foreigners. There are some methods and are described in the literature. Some researchers recognize Myanmar handwritten characters based on structural and statistical characteristics. Myanmar’s character recognition system was developed to apply license plate recognition, date identification and number of numbers on bank checks, typed character recognition in the standard application form, bilingual design of Burmese symbols, with English symbols, Burmese handwritten character recognition. They are primarily based on pattern matching and normalized correlation with large databases of storage patterns.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127644787","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 : 2019-04-16DOI: 10.2991/ijndc.k.190326.003
Sylvanus A. Ehikioya, A. Olukunle
The rapid growth and advances in information and communication technologies have fueled the phenomenal growth, development and adoption of Internet-of-things and web-centric applications such as e-commerce. E-commerce entails the exchange of goods and services online over the Internet where all transactions are driven electronically. E-commerce has tremendously influenced conventional business transactions. E-commerce has grown rapidly, a lot of individuals and organizations now offer e-commerce services. E-commerce activities involve the transfer and exchange of e-commerce data set on the Web. The set of e-commerce data represents information about e-commerce activities or entities in the domain of e-commerce. The need to develop secure, reliable, and error-free e-commerce applications that guarantee the correctness of online transactions is well documented [1] in the literature.
{"title":"A Formal Model of Distributed Security for Electronic Commerce Transactions Systems","authors":"Sylvanus A. Ehikioya, A. Olukunle","doi":"10.2991/ijndc.k.190326.003","DOIUrl":"https://doi.org/10.2991/ijndc.k.190326.003","url":null,"abstract":"The rapid growth and advances in information and communication technologies have fueled the phenomenal growth, development and adoption of Internet-of-things and web-centric applications such as e-commerce. E-commerce entails the exchange of goods and services online over the Internet where all transactions are driven electronically. E-commerce has tremendously influenced conventional business transactions. E-commerce has grown rapidly, a lot of individuals and organizations now offer e-commerce services. E-commerce activities involve the transfer and exchange of e-commerce data set on the Web. The set of e-commerce data represents information about e-commerce activities or entities in the domain of e-commerce. The need to develop secure, reliable, and error-free e-commerce applications that guarantee the correctness of online transactions is well documented [1] in the literature.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120965443","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 : 2019-04-16DOI: 10.2991/IJNDC.K.190326.004
M. A. Hoque, C. Davidson
The Internet-of-Things (IoT) is a vision for an internetwork of intelligent, communicating objects such as home appliances, vehicles, factory machines, wearable devices and various types of sensors. The convergence of technologies like ubiquitous wireless communications, machine learning, real-time analytics and embedded systems has made novel IoT applications possible in a multitude of domains. A combination of commercial interests and government initiatives have made smart homes, smart healthcare, smart cities, and smart transport primary areas of focus for IoT application development.
{"title":"Design and Implementation of an IoT-Based Smart Home Security System","authors":"M. A. Hoque, C. Davidson","doi":"10.2991/IJNDC.K.190326.004","DOIUrl":"https://doi.org/10.2991/IJNDC.K.190326.004","url":null,"abstract":"The Internet-of-Things (IoT) is a vision for an internetwork of intelligent, communicating objects such as home appliances, vehicles, factory machines, wearable devices and various types of sensors. The convergence of technologies like ubiquitous wireless communications, machine learning, real-time analytics and embedded systems has made novel IoT applications possible in a multitude of domains. A combination of commercial interests and government initiatives have made smart homes, smart healthcare, smart cities, and smart transport primary areas of focus for IoT application development.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116446280","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 : 2018-12-01DOI: 10.2991/IJNDC.2018.7.1.1
Farhan Rahman Wasee, R. M. A. Amin, Zareen Tasnim Raisa, Sadia Chowdhury, Tanisha Nourin Alam, R. Rahman
{"title":"Satellite Image Based Characterization for Monitoring Urbanization and Land Cover Change","authors":"Farhan Rahman Wasee, R. M. A. Amin, Zareen Tasnim Raisa, Sadia Chowdhury, Tanisha Nourin Alam, R. Rahman","doi":"10.2991/IJNDC.2018.7.1.1","DOIUrl":"https://doi.org/10.2991/IJNDC.2018.7.1.1","url":null,"abstract":"","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122134932","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 : 2018-12-01DOI: 10.2991/IJNDC.2018.7.1.4
Yindee Oonsrikaw, A. Thammano
{"title":"Modified Ant Colony Optimization Algorithm for Multiple-vehicle Traveling Salesman Problems","authors":"Yindee Oonsrikaw, A. Thammano","doi":"10.2991/IJNDC.2018.7.1.4","DOIUrl":"https://doi.org/10.2991/IJNDC.2018.7.1.4","url":null,"abstract":"","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126146297","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 : 2018-12-01DOI: 10.2991/IJNDC.2018.7.1.3
K. Toh
The problem of machine learning has been traditionally formulated as an optimization task where an error metric is minimized. In terms of solving the system of linear equations, an approximation is often sought-after according to a least error metric because it is difficult to have an exact match between the sample size and the number of model parameters. Such an approximation to the least error metric, particularly in the squared error form, can be determined analytically either in the primal solution space or in the dual solution space depending on the rank property of the covariance matrix. This optimization approach has been a popular choice due to its simplicity and tractability in analysis and implementation. The approach is predominant in engineering applications as evident from its pervasive adoption in statistical and shallow network learning.
{"title":"Kernel and Range Approach to Analytic Network Learning","authors":"K. Toh","doi":"10.2991/IJNDC.2018.7.1.3","DOIUrl":"https://doi.org/10.2991/IJNDC.2018.7.1.3","url":null,"abstract":"The problem of machine learning has been traditionally formulated as an optimization task where an error metric is minimized. In terms of solving the system of linear equations, an approximation is often sought-after according to a least error metric because it is difficult to have an exact match between the sample size and the number of model parameters. Such an approximation to the least error metric, particularly in the squared error form, can be determined analytically either in the primal solution space or in the dual solution space depending on the rank property of the covariance matrix. This optimization approach has been a popular choice due to its simplicity and tractability in analysis and implementation. The approach is predominant in engineering applications as evident from its pervasive adoption in statistical and shallow network learning.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126721238","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 : 2018-12-01DOI: 10.2991/IJNDC.2018.7.1.6
M. Swe, Nyein Nyein Myo
People use Twitter to share their feelings, news, events and to post their daily activities such as eating, drinking, travelling, etc. Therefore, malicious users can check everyone’s activities from their timeline and Twitter becomes a place for malicious users to commit the crimes. These malicious users create fake accounts and spread various fake news, links and photos. Most of the internet users are not awareness of these fake accounts; they accepted their requests and became victims for these fake users. Therefore, fake accounts detection on Twitter is necessary for everyone who uses the social networking sites.
{"title":"Blacklist Creation for Detecting Fake Accounts on Twitter","authors":"M. Swe, Nyein Nyein Myo","doi":"10.2991/IJNDC.2018.7.1.6","DOIUrl":"https://doi.org/10.2991/IJNDC.2018.7.1.6","url":null,"abstract":"People use Twitter to share their feelings, news, events and to post their daily activities such as eating, drinking, travelling, etc. Therefore, malicious users can check everyone’s activities from their timeline and Twitter becomes a place for malicious users to commit the crimes. These malicious users create fake accounts and spread various fake news, links and photos. Most of the internet users are not awareness of these fake accounts; they accepted their requests and became victims for these fake users. Therefore, fake accounts detection on Twitter is necessary for everyone who uses the social networking sites.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124753436","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 : 2018-12-01DOI: 10.2991/IJNDC.2018.7.1.2
Ajchara Phu-ang
At the present, the government encourages entrepreneurs used the innovation and digital technology for enhanced the competitiveness and increased the productivity. To success with the mention above, the entrepreneurs need to adopt the intelligence of the computer in the business. As well as the manufacturing industry, the one important in the manufacturing is to schedule the job plan or the scheduling plan. Nowadays, the industry applied the computer to calculate the schedule and hold the machine balancing in the manufacturing process. The Flexible Job Shop Scheduling Problem (FJSP) is the complex problem which is found in the manufacturing processes. This problem occurs when the staff cannot maintain a balance between the jobs and the machines. In recent years, the researcher in the operation research areas attends to create the metaheuristic algorithm for solving the FJSP. The differential evolution (DE) algorithm is one of the computational algorithms which used to solve the operation research optimization problem. There are several research works which have been proposed; for instance. Mohamed et al. [1] applied the DE algorithm for solving unconstrained global optimization problems. In this algorithm, their proposed a new directed mutation rule based on the weighted difference vector between the best and the worse solution. The local search is utilized to enhance the search capability and to increase the convergence rate. Furthermore, a dynamic nonlinear increased crossover probability scheme is proposed balance between the diversity and the convergence rate or between global exploration ability and local exploitation. The result of their algorithm indicates that the improved algorithm outperforms and is superior to other existing algorithms. Salehpour et al. [2] developed the new version of the DE algorithm with the fuzzy logic inference system. This paper uses a fuzzy logic inference system to dynamically tune the mutation factor of DE and improve its exploration and exploitation. A fuzzy system used to considering the variation, namely, number of generation and population. The results obtained show the really good behavior of the proposed method and comparison. Zou et al. [3] presented a Novel Modified Differential Evolution (NMDE) algorithm to solve constrained optimization problems. This algorithm modifies the scale factor of the original DE algorithm by an adaptive strategy. In the crossover operation of this paper, they use the uniform distribution when the stagnation happens to the solution. Moreover, a common penalty function method adopted to balance objective and constraint violations. Experimental results show that the NMDE algorithm has higher efficiency than the other methods in term of finding better feasible solutions of most constrained problems. Huang and Huang [4] proposed the DE algorithm with the ant system for solving the Optimal Reactive Power Dispatch (ORPD) problem. The purpose of ORPD is to reduce active power trans
{"title":"Discrete Differential Evolution Algorithm with the Fuzzy Machine Selection for Solving the Flexible Job Shop Scheduling Problem","authors":"Ajchara Phu-ang","doi":"10.2991/IJNDC.2018.7.1.2","DOIUrl":"https://doi.org/10.2991/IJNDC.2018.7.1.2","url":null,"abstract":"At the present, the government encourages entrepreneurs used the innovation and digital technology for enhanced the competitiveness and increased the productivity. To success with the mention above, the entrepreneurs need to adopt the intelligence of the computer in the business. As well as the manufacturing industry, the one important in the manufacturing is to schedule the job plan or the scheduling plan. Nowadays, the industry applied the computer to calculate the schedule and hold the machine balancing in the manufacturing process. The Flexible Job Shop Scheduling Problem (FJSP) is the complex problem which is found in the manufacturing processes. This problem occurs when the staff cannot maintain a balance between the jobs and the machines. In recent years, the researcher in the operation research areas attends to create the metaheuristic algorithm for solving the FJSP. The differential evolution (DE) algorithm is one of the computational algorithms which used to solve the operation research optimization problem. There are several research works which have been proposed; for instance. Mohamed et al. [1] applied the DE algorithm for solving unconstrained global optimization problems. In this algorithm, their proposed a new directed mutation rule based on the weighted difference vector between the best and the worse solution. The local search is utilized to enhance the search capability and to increase the convergence rate. Furthermore, a dynamic nonlinear increased crossover probability scheme is proposed balance between the diversity and the convergence rate or between global exploration ability and local exploitation. The result of their algorithm indicates that the improved algorithm outperforms and is superior to other existing algorithms. Salehpour et al. [2] developed the new version of the DE algorithm with the fuzzy logic inference system. This paper uses a fuzzy logic inference system to dynamically tune the mutation factor of DE and improve its exploration and exploitation. A fuzzy system used to considering the variation, namely, number of generation and population. The results obtained show the really good behavior of the proposed method and comparison. Zou et al. [3] presented a Novel Modified Differential Evolution (NMDE) algorithm to solve constrained optimization problems. This algorithm modifies the scale factor of the original DE algorithm by an adaptive strategy. In the crossover operation of this paper, they use the uniform distribution when the stagnation happens to the solution. Moreover, a common penalty function method adopted to balance objective and constraint violations. Experimental results show that the NMDE algorithm has higher efficiency than the other methods in term of finding better feasible solutions of most constrained problems. Huang and Huang [4] proposed the DE algorithm with the ant system for solving the Optimal Reactive Power Dispatch (ORPD) problem. The purpose of ORPD is to reduce active power trans","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129395675","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 : 2018-09-28DOI: 10.2991/IJNDC.2018.4.6.1
Jongyeop Kim, Abhilash Kancharla, Jongho Seol, Indy Park, N. Park
The Apache Hadoop Distributed File System (HDFS) [1] is one of the prominent engines as a big data processing framework [2] with its distributed processing capabilities over a cluster that composed of multiple nodes [3]. The core technology of this open source is called map and reduce, which is accomplished by appropriately splitting a big task into each node and merging it through inter process communication.
Apache Hadoop分布式文件系统(Hadoop Distributed File System, HDFS)[1]作为大数据处理框架的突出引擎之一[2]，其在由多个节点组成的集群上具有分布式处理能力[3]。这个开放源代码的核心技术称为map and reduce，它通过将一个大任务适当地拆分到每个节点，并通过进程间通信将其合并来实现。
{"title":"Optimized Common Parameter Set Extraction Framework by Multiple Benchmarking Applications on a Big Data Platform","authors":"Jongyeop Kim, Abhilash Kancharla, Jongho Seol, Indy Park, N. Park","doi":"10.2991/IJNDC.2018.4.6.1","DOIUrl":"https://doi.org/10.2991/IJNDC.2018.4.6.1","url":null,"abstract":"The Apache Hadoop Distributed File System (HDFS) [1] is one of the prominent engines as a big data processing framework [2] with its distributed processing capabilities over a cluster that composed of multiple nodes [3]. The core technology of this open source is called map and reduce, which is accomplished by appropriately splitting a big task into each node and merging it through inter process communication.","PeriodicalId":318936,"journal":{"name":"Int. J. Networked Distributed Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115460741","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
扫码关注我们
求助内容：
应助结果提醒方式：