Pub Date : 2019-06-25DOI: 10.1504/IJGUC.2019.10022137
Xuan Guo, Fei Xu, Zhiting Xiao, Hongguo Yuan, Xiao-ling Yang
In order to study the spatiotemporal characteristics and activity patterns of terrorism attacks in China, so as to make effective counter-terrorism strategies, two kinds of different intelligence sources were analysed by means of social network analysis and mathematical statistics. Firstly, using the social network analysis tool ORA, we build a terrorists' activity meta-network for the text information, extracting the four categories of person, places, organisations and time, and analyse the characteristics of the key nodes of the network, then the meta-network is decomposed into person-organisation and person-location, organisation-location, organisation-time four binary subnets to analyse the temporal and spatial characteristics of terrorist activities. Then, using GTD data set to analyse the characteristics of China's terrorist attacks from 1989 to 2015, the geo-spatial distribution and time distribution of terrorist events are summarised. Combined with the data visualisation method, the previous results of social network analysis using open source text are verified and compared; finally we put forward some suggestions on counter-terrorism prevention strategy in China.
{"title":"Winning the war on terror: using social networking tools and GTD to analyse the regularity of terrorism activities","authors":"Xuan Guo, Fei Xu, Zhiting Xiao, Hongguo Yuan, Xiao-ling Yang","doi":"10.1504/IJGUC.2019.10022137","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.10022137","url":null,"abstract":"In order to study the spatiotemporal characteristics and activity patterns of terrorism attacks in China, so as to make effective counter-terrorism strategies, two kinds of different intelligence sources were analysed by means of social network analysis and mathematical statistics. Firstly, using the social network analysis tool ORA, we build a terrorists' activity meta-network for the text information, extracting the four categories of person, places, organisations and time, and analyse the characteristics of the key nodes of the network, then the meta-network is decomposed into person-organisation and person-location, organisation-location, organisation-time four binary subnets to analyse the temporal and spatial characteristics of terrorist activities. Then, using GTD data set to analyse the characteristics of China's terrorist attacks from 1989 to 2015, the geo-spatial distribution and time distribution of terrorist events are summarised. Combined with the data visualisation method, the previous results of social network analysis using open source text are verified and compared; finally we put forward some suggestions on counter-terrorism prevention strategy in China.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129673540","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-06-25DOI: 10.1504/IJGUC.2019.10022139
Satyapal Singh, Mohan Kubendiran, A. K. Sangaiah
Cloud computing is a technology that allows the conveyance of services, storage, network, computing power, etc., over the internet. The on-demand and ubiquitous nature of this technology allows for its ease of use and availability. However, due to this very reason, the cloud services, platform or infrastructure remain to be a target for attackers. The most common attack is the one that tries to take control of one or more virtual machine instances running on the cloud. Since cloud and networking technologies go side by side, it is inevitable to keep such malicious attempts at bay. Nevertheless, Intrusion Detection Systems (IDS) are software that can detect potential intrusions within or outside a secure cloud environment. In this paper, a study of different IDS that have been previously proposed in order to mitigate or in best case eliminate the possible threats posed by such intrusions has been done.
{"title":"A review on intrusion detection approaches in cloud security systems","authors":"Satyapal Singh, Mohan Kubendiran, A. K. Sangaiah","doi":"10.1504/IJGUC.2019.10022139","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.10022139","url":null,"abstract":"Cloud computing is a technology that allows the conveyance of services, storage, network, computing power, etc., over the internet. The on-demand and ubiquitous nature of this technology allows for its ease of use and availability. However, due to this very reason, the cloud services, platform or infrastructure remain to be a target for attackers. The most common attack is the one that tries to take control of one or more virtual machine instances running on the cloud. Since cloud and networking technologies go side by side, it is inevitable to keep such malicious attempts at bay. Nevertheless, Intrusion Detection Systems (IDS) are software that can detect potential intrusions within or outside a secure cloud environment. In this paper, a study of different IDS that have been previously proposed in order to mitigate or in best case eliminate the possible threats posed by such intrusions has been done.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133740330","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-06-25DOI: 10.1504/IJGUC.2019.10022134
Yubiao Wang, Junhao Wen, Quanwang Wu, Lei Guo, Bamei Tao
For high quality and trusted service selection problem, we propose a Dynamic Cloud Services Selection Model (DCSSM). Cloud service resources are divided into different service levels by Service-Level Agreement Management (SLAM). Each SLAM manages some cloud service registration information. In order to make the final trust evaluation values more practical, the model performs a comprehensive trust, which consists of direct trust and indirect trust. Firstly, combining weights consist of subjective weight and objective weight. Using rough sets to calculate objective weight, an Analytic Hierarchy Process (AHP) method is used to calculate subjective weight. The direct trust also considers transaction time and transaction amount, and then gets an accurate direct trust. Secondly, indirect trust considers user trust evaluation similarity, and it contains indirect trust of friends and indirect trust of strangers. Finally, when the transaction was completed, a direct trust dynamic update was proposed. The model is simulated using CloudSim. It was compared with three other methods, and the experimental results showed that the DCSSM performs better than the other three methods.
{"title":"A dynamic cloud service selection model based on trust and SLA in cloud computing","authors":"Yubiao Wang, Junhao Wen, Quanwang Wu, Lei Guo, Bamei Tao","doi":"10.1504/IJGUC.2019.10022134","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.10022134","url":null,"abstract":"For high quality and trusted service selection problem, we propose a Dynamic Cloud Services Selection Model (DCSSM). Cloud service resources are divided into different service levels by Service-Level Agreement Management (SLAM). Each SLAM manages some cloud service registration information. In order to make the final trust evaluation values more practical, the model performs a comprehensive trust, which consists of direct trust and indirect trust. Firstly, combining weights consist of subjective weight and objective weight. Using rough sets to calculate objective weight, an Analytic Hierarchy Process (AHP) method is used to calculate subjective weight. The direct trust also considers transaction time and transaction amount, and then gets an accurate direct trust. Secondly, indirect trust considers user trust evaluation similarity, and it contains indirect trust of friends and indirect trust of strangers. Finally, when the transaction was completed, a direct trust dynamic update was proposed. The model is simulated using CloudSim. It was compared with three other methods, and the experimental results showed that the DCSSM performs better than the other three methods.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132481770","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-06-25DOI: 10.1504/IJGUC.2019.10022133
Xianghu Wu, M. Qu, Yongchao Tao, Guannan Wang, Ziyu Dong
At present, embedded software has the problems of test lag, non-visual and low efficiency, depending on the test design of testers. It cannot guarantee the quality of the test cases and cannot guarantee the quality of the test. In this paper, a software program structure diagram model is established to verify the model, and the test points are planned manually. Finally, fill in the contents of the test items, and generate the corresponding set of test cases according to the algorithm, and save them into the database for management. This method can improve the reliability and efficiency of test, ensure the visual tracking and management of the use case, and have a strong auxiliary function to the planning and generation of the test case.
{"title":"A novel test case generation method based on program structure diagram","authors":"Xianghu Wu, M. Qu, Yongchao Tao, Guannan Wang, Ziyu Dong","doi":"10.1504/IJGUC.2019.10022133","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.10022133","url":null,"abstract":"At present, embedded software has the problems of test lag, non-visual and low efficiency, depending on the test design of testers. It cannot guarantee the quality of the test cases and cannot guarantee the quality of the test. In this paper, a software program structure diagram model is established to verify the model, and the test points are planned manually. Finally, fill in the contents of the test items, and generate the corresponding set of test cases according to the algorithm, and save them into the database for management. This method can improve the reliability and efficiency of test, ensure the visual tracking and management of the use case, and have a strong auxiliary function to the planning and generation of the test case.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132507335","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-05-15DOI: 10.1504/IJGUC.2019.099687
A. S. Nery, A. Sena, Leandro S. Guedes
Pathfinding algorithms are at the heart of several classes of applications, such as network appliances (routing) and autonomous vehicle navigation. Thus, this work aims at designing and evaluating an efficient pathfinding FPGA accelerator based on Dijkstra's shortest path algorithm to mitigate the increasing network traffic problem at the edge of the network. The system is designed using Xilinx High-Level Synthesis (HLS) compiler and is implemented in the programming logic of a Xilinx Zynq FPGA, embedded with an ARM microprocessor which is not only in charge of controlling the co-processor but also in charge of lightweight TCP/IP network communication. Extensive performance, circuit-area, and energy consumption results show that the co-processor can find the shortest path about 2.5 times faster than the system's ARM microprocessor, on a simulation scenario test case based on touristic locations in the city of Rio de Janeiro, acquired from the OpenStreetMap database.
{"title":"An efficient pathfinding system in FPGA for edge/fog computing","authors":"A. S. Nery, A. Sena, Leandro S. Guedes","doi":"10.1504/IJGUC.2019.099687","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.099687","url":null,"abstract":"Pathfinding algorithms are at the heart of several classes of applications, such as network appliances (routing) and autonomous vehicle navigation. Thus, this work aims at designing and evaluating an efficient pathfinding FPGA accelerator based on Dijkstra's shortest path algorithm to mitigate the increasing network traffic problem at the edge of the network. The system is designed using Xilinx High-Level Synthesis (HLS) compiler and is implemented in the programming logic of a Xilinx Zynq FPGA, embedded with an ARM microprocessor which is not only in charge of controlling the co-processor but also in charge of lightweight TCP/IP network communication. Extensive performance, circuit-area, and energy consumption results show that the co-processor can find the shortest path about 2.5 times faster than the system's ARM microprocessor, on a simulation scenario test case based on touristic locations in the city of Rio de Janeiro, acquired from the OpenStreetMap database.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127821688","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-05-15DOI: 10.1504/IJGUC.2019.099685
Caio B. G. Carvalho, V. C. Ferreira, F. França, C. Bentes, G. Mencagli, Tiago A. O. Alves, A. Sena, L. A. J. Marzulo
In the dataflow computation model, tasks are executed according to data dependencies, instead of following program order, enabling natural parallelism exploitation. Sucuri is a dataflow library for Python that allows transparent execution of applications on clusters of multicores, while taking care of scheduling issues. Recent trends in edge/fog/In-situ computing assume that storage and network devices will have processing elements with lower power consumption and performance, which would make a good case for runtime environments that deal with the data versus computation movements trade-off in a more transparent and automated way. This work presents a study on different factors that should be considered when running dataflow applications in in-situ environments, using Sucuri to conduct experiments in a small system emulating a smart storage (in-situ device) utilisation. A static scheduling solution is also presented, allowing Sucuri to choose the most suited approach regarding this in-situ trade-off.
{"title":"A dataflow runtime environment and static scheduler for edge, fog and in-situ computing","authors":"Caio B. G. Carvalho, V. C. Ferreira, F. França, C. Bentes, G. Mencagli, Tiago A. O. Alves, A. Sena, L. A. J. Marzulo","doi":"10.1504/IJGUC.2019.099685","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.099685","url":null,"abstract":"In the dataflow computation model, tasks are executed according to data dependencies, instead of following program order, enabling natural parallelism exploitation. Sucuri is a dataflow library for Python that allows transparent execution of applications on clusters of multicores, while taking care of scheduling issues. Recent trends in edge/fog/In-situ computing assume that storage and network devices will have processing elements with lower power consumption and performance, which would make a good case for runtime environments that deal with the data versus computation movements trade-off in a more transparent and automated way. This work presents a study on different factors that should be considered when running dataflow applications in in-situ environments, using Sucuri to conduct experiments in a small system emulating a smart storage (in-situ device) utilisation. A static scheduling solution is also presented, allowing Sucuri to choose the most suited approach regarding this in-situ trade-off.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114822712","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-05-15DOI: 10.1504/IJGUC.2019.099689
Marcos Paulo Rocha, F. França, A. S. Nery, Leandro S. Guedes
Stream processing applications have high-demanding performance requirements that are hard to tackle using traditional parallel models on modern many-core architectures, such as GPUs. On the other hand, recent dataflow computing models can naturally expose and facilitate the parallelism exploitation for a wide class of applications. Thus, instead of following the program order, different operations can be run in parallel as soon as their input operands become available. This work presents an extension to an existing dataflow library for Java. The library extension implements high-level constructs with multiple command queues to enable the superposition of memory operations and kernel executions on GPUs. Experimental results show that significant speedup can be achieved for a subset of well-known stream processing applications: Volume Ray-Casting, Path-Tracing and Sobel Filter. Moreover, new contributions in respect to concurrency analysis and the Stream processing parallel model in dataflow are presented.
{"title":"An optimised dataflow engine for GPGPU stream processing","authors":"Marcos Paulo Rocha, F. França, A. S. Nery, Leandro S. Guedes","doi":"10.1504/IJGUC.2019.099689","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.099689","url":null,"abstract":"Stream processing applications have high-demanding performance requirements that are hard to tackle using traditional parallel models on modern many-core architectures, such as GPUs. On the other hand, recent dataflow computing models can naturally expose and facilitate the parallelism exploitation for a wide class of applications. Thus, instead of following the program order, different operations can be run in parallel as soon as their input operands become available. This work presents an extension to an existing dataflow library for Java. The library extension implements high-level constructs with multiple command queues to enable the superposition of memory operations and kernel executions on GPUs. Experimental results show that significant speedup can be achieved for a subset of well-known stream processing applications: Volume Ray-Casting, Path-Tracing and Sobel Filter. Moreover, new contributions in respect to concurrency analysis and the Stream processing parallel model in dataflow are presented.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117042340","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-05-15DOI: 10.1504/IJGUC.2019.099665
Masaki Kohana, S. Okamoto
We develop a system to help an oral exam for a programming class. Our programming class has a problem about the waiting time for the students. We assume that the waiting time can be reduced when a teacher can check a source code and a result of the program smoothly. A student uploads C++ source codes and registers to a waiting list. The system compiles the code to an HTML and a JavaScript file using Emscripten. The compiled program can run on a web browser. A teacher can check the order of the students for the oral exam. At this time, the teacher also can see the source code and the result. Our system provides a waiting list of the oral exam to keep fairness. Also, the teacher does not overlook an invalid code. It helps a teacher to grade a student correctly.
{"title":"A web platform for oral exam of programming class","authors":"Masaki Kohana, S. Okamoto","doi":"10.1504/IJGUC.2019.099665","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.099665","url":null,"abstract":"We develop a system to help an oral exam for a programming class. Our programming class has a problem about the waiting time for the students. We assume that the waiting time can be reduced when a teacher can check a source code and a result of the program smoothly. A student uploads C++ source codes and registers to a waiting list. The system compiles the code to an HTML and a JavaScript file using Emscripten. The compiled program can run on a web browser. A teacher can check the order of the students for the oral exam. At this time, the teacher also can see the source code and the result. Our system provides a waiting list of the oral exam to keep fairness. Also, the teacher does not overlook an invalid code. It helps a teacher to grade a student correctly.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125016721","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-05-15DOI: 10.1504/IJGUC.2019.099688
B. Marques, I. M. Coelho, A. Sena, M. D. Castro
A communication protocol for fog computing should be efficient, lightweight and customisable, enabling the computing results on the edges to be passed easily through the network. In this work, we focus on a communication protocol for fog nodes in a network composed of wireless sensors, which are autonomous and spatially distributed for monitoring physical or environmental conditions. Problems with data congestion and limited physical resources are common in these networks. For the optimisation of data flow, it is important to apply techniques that reduce the transmitted data. We propose a network coding technique and study its efficiency for data transmission protocols. The experiments were performed through a wireless sensors programming framework with TinyOS operating system, NesC language and TOSSIM simulator. Experimental results demonstrate a better performance when the network coding technique is applied to the data communication protocol, for different scenarios. Further results demonstrate the network coding efficiency for fog computing, with around 80% of the total messages exchanged compared to a traditional protocol.
{"title":"A network coding protocol for wireless sensor fog computing","authors":"B. Marques, I. M. Coelho, A. Sena, M. D. Castro","doi":"10.1504/IJGUC.2019.099688","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.099688","url":null,"abstract":"A communication protocol for fog computing should be efficient, lightweight and customisable, enabling the computing results on the edges to be passed easily through the network. In this work, we focus on a communication protocol for fog nodes in a network composed of wireless sensors, which are autonomous and spatially distributed for monitoring physical or environmental conditions. Problems with data congestion and limited physical resources are common in these networks. For the optimisation of data flow, it is important to apply techniques that reduce the transmitted data. We propose a network coding technique and study its efficiency for data transmission protocols. The experiments were performed through a wireless sensors programming framework with TinyOS operating system, NesC language and TOSSIM simulator. Experimental results demonstrate a better performance when the network coding technique is applied to the data communication protocol, for different scenarios. Further results demonstrate the network coding efficiency for fog computing, with around 80% of the total messages exchanged compared to a traditional protocol.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127292181","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}
We propose a method that enriches folksonomy by using user comments on online videos. Folksonomy is a process in which users tag videos so that they can be searched for easily. On some videos, users can post tags and comments. A tag corresponds to folksonomy. One such online sharing website is Nico Nico Douga; however, users cannot post more than 12 tags on a video. Therefore, there are some important tags that could be posted but are sometimes not. We present a method for acquiring some of these missing tags by choosing new tags that score well in a scoring method developed by us. The method is based on information theory and a novel algorithm for estimating new tags by using distributed databases constructed by us.
{"title":"Enriching folksonomy for online videos","authors":"Hiroki Sakaji, Masaki Kohana, Akio Kobayashi, Hiroyuki Sakai","doi":"10.1504/IJGUC.2019.099664","DOIUrl":"https://doi.org/10.1504/IJGUC.2019.099664","url":null,"abstract":"We propose a method that enriches folksonomy by using user comments on online videos. Folksonomy is a process in which users tag videos so that they can be searched for easily. On some videos, users can post tags and comments. A tag corresponds to folksonomy. One such online sharing website is Nico Nico Douga; however, users cannot post more than 12 tags on a video. Therefore, there are some important tags that could be posted but are sometimes not. We present a method for acquiring some of these missing tags by choosing new tags that score well in a scoring method developed by us. The method is based on information theory and a novel algorithm for estimating new tags by using distributed databases constructed by us.","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2019-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114550428","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
扫码关注我们
求助内容：
应助结果提醒方式：