Pub Date : 2017-07-31DOI: 10.14257/IJSIA.2017.11.7.02
V. Padmavathi, B. Vardhan, A. V. Krishna
With the expansion in electronic communication, the significance of cryptography is apparently increasing every year. Encryption is a cryptography technique to send unintelligible information and decryption to restore the information. These techniques usually undergo difficulty with eavesdropping of plaintext and ciphertext. The conventional cryptography is vulnerable to attacks using high computational resources. Necessarily, an elegant concept of Quantum cryptography based on laws of quantum mechanics is introduced to offer secure and private communication. This paper gives a method for encryption and decryption using Toffoli quantum gate named as VBA Quantum Encryption and Decryption Algorithms. The incorporation of gate renders security which acts as a cumbersome to eavesdropping attack. Besides, a way to detect known plaintext, ciphertext only and chosen plaintext attack through public discussion is explained.
{"title":"Introducing Quantum Cryptography Based Secured Encryption and Decryption Algorithms","authors":"V. Padmavathi, B. Vardhan, A. V. Krishna","doi":"10.14257/IJSIA.2017.11.7.02","DOIUrl":"https://doi.org/10.14257/IJSIA.2017.11.7.02","url":null,"abstract":"With the expansion in electronic communication, the significance of cryptography is apparently increasing every year. Encryption is a cryptography technique to send unintelligible information and decryption to restore the information. These techniques usually undergo difficulty with eavesdropping of plaintext and ciphertext. The conventional cryptography is vulnerable to attacks using high computational resources. Necessarily, an elegant concept of Quantum cryptography based on laws of quantum mechanics is introduced to offer secure and private communication. This paper gives a method for encryption and decryption using Toffoli quantum gate named as VBA Quantum Encryption and Decryption Algorithms. The incorporation of gate renders security which acts as a cumbersome to eavesdropping attack. Besides, a way to detect known plaintext, ciphertext only and chosen plaintext attack through public discussion is explained.","PeriodicalId":46187,"journal":{"name":"International Journal of Security and Its Applications","volume":"11 1","pages":"17-24"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46454612","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-31DOI: 10.14257/IJSIA.2017.11.7.05
N. Nagar, U. Suman
Cloud computing provides a service based environment for data storage and resource sharing that are available to user through internet with on-demand basis. Thus, users can access their data across any geographical location at any time. Cloud environment also provides better scalability, flexibility, high performance, availability and less storage cost as compared to other physical storage of data. Maintaining data integrity and security in cloud environment is difficult especially, when the stored data is not completely reliable and trustworthy. However, the security of stored data is the major concerned for organizations and individual user to adopt cloud based environment. In this paper, we have proposed and enhanced the functionalities of third party auditor server to protect the availability and integrity of outsourced data in a cloud environment. The proposed approach uses the functionality such as, public verifiability, metadata generation, data dynamics, storage access point, encryption and decryption of data through RSA algorithm and IP range in case of private cloud. The proposed work also focuses on a solution to reliability, availability and integrity of data that are the major issues in the cloud adoption.
{"title":"Reliable and Enhanced Third Party Auditing in Cloud Server Data Storage","authors":"N. Nagar, U. Suman","doi":"10.14257/IJSIA.2017.11.7.05","DOIUrl":"https://doi.org/10.14257/IJSIA.2017.11.7.05","url":null,"abstract":"Cloud computing provides a service based environment for data storage and resource sharing that are available to user through internet with on-demand basis. Thus, users can access their data across any geographical location at any time. Cloud environment also provides better scalability, flexibility, high performance, availability and less storage cost as compared to other physical storage of data. Maintaining data integrity and security in cloud environment is difficult especially, when the stored data is not completely reliable and trustworthy. However, the security of stored data is the major concerned for organizations and individual user to adopt cloud based environment. In this paper, we have proposed and enhanced the functionalities of third party auditor server to protect the availability and integrity of outsourced data in a cloud environment. The proposed approach uses the functionality such as, public verifiability, metadata generation, data dynamics, storage access point, encryption and decryption of data through RSA algorithm and IP range in case of private cloud. The proposed work also focuses on a solution to reliability, availability and integrity of data that are the major issues in the cloud adoption.","PeriodicalId":46187,"journal":{"name":"International Journal of Security and Its Applications","volume":"11 1","pages":"59-72"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43017764","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-31DOI: 10.14257/IJSIA.2017.11.7.04
Qingqing Gan, Xiaoming Wang
To support encrypted keyword queries on encrypted data and to access data in a multi-user setting for cloud storage, a searchable encryption scheme is proposed by combining Chinese Remainder Theorem with Public Encryption with Keyword Search. The proposed scheme enables data owners to outsource their encrypted data to the storage of cloud servers for a number of users, who are given the ability to generate valid queries and to access data without leaking any information. More importantly, the proposed scheme does not rely on shared keys to realize multi-user searchable encryption and user dynamics. Each authorized user in the proposed scheme has a unique key and can perform encrypted keyword queries on encrypted data as well as access data without knowledge of the keys of other users, such that when some users are added or removed, other users are unaffected. We prove that the proposed scheme is secure under Bilinear Diffie-Hellman and Hash Diffie-Hellman assumptions. The performance analysis shows that the proposed scheme has lower communication and storage overheads for both cloud servers and users than other existing schemes. In addition, the proposed scheme possesses features similar to that of most existing schemes in a single-user setting and does not downgrade because of supporting multiple users.
{"title":"A Searchable Encryption Scheme in a Multi-user Setting for Cloud Storage","authors":"Qingqing Gan, Xiaoming Wang","doi":"10.14257/IJSIA.2017.11.7.04","DOIUrl":"https://doi.org/10.14257/IJSIA.2017.11.7.04","url":null,"abstract":"To support encrypted keyword queries on encrypted data and to access data in a multi-user setting for cloud storage, a searchable encryption scheme is proposed by combining Chinese Remainder Theorem with Public Encryption with Keyword Search. The proposed scheme enables data owners to outsource their encrypted data to the storage of cloud servers for a number of users, who are given the ability to generate valid queries and to access data without leaking any information. More importantly, the proposed scheme does not rely on shared keys to realize multi-user searchable encryption and user dynamics. Each authorized user in the proposed scheme has a unique key and can perform encrypted keyword queries on encrypted data as well as access data without knowledge of the keys of other users, such that when some users are added or removed, other users are unaffected. We prove that the proposed scheme is secure under Bilinear Diffie-Hellman and Hash Diffie-Hellman assumptions. The performance analysis shows that the proposed scheme has lower communication and storage overheads for both cloud servers and users than other existing schemes. In addition, the proposed scheme possesses features similar to that of most existing schemes in a single-user setting and does not downgrade because of supporting multiple users.","PeriodicalId":46187,"journal":{"name":"International Journal of Security and Its Applications","volume":"11 1","pages":"43-58"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45750289","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-31DOI: 10.14257/IJSIA.2017.11.7.03
Qian Liping, Wang Lidong
It is very common for Internet users to query a search engine when retrieving web information. Sensitive data about search engine user’s intentions or behavior can be inferred from his query phrases and the webpages he visits subsequently. In order to protect contents of communications from being eavesdropped, a search engine can adopt HTTPS-by-default to provide bidirectional encryption to protect its users’ privacy. Since the majority of webpages indexed in search engine’s results pages are still on HTTP-enabled websites and the contents of these webpages can be observed by attackers once the user click on the indexed web-links. We propose a novel approach for attacking secure search through correlating analysis of encrypted search with unencrypted webpages the user visits subsequently. We show that a simple weighted TF-DF mechanism is sufficient for selecting guessing phrase candidates. Imitating search engine users, by querying these candidates and enumerating webpages indexed in results pages, we can hit the definite query phrases and meanwhile reconstruct user’s web-surfing trails through DNS-based URLs comparison and flow feature statistics-based network traffic analysis. In the experiment including 180 Chinese and English search phrases, we achieved 67.78% hit rate at first guess and 96.11% hit rate within three guesses. Our empirical research shows that HTTPS traffic can be correlated and de-anonymized through HTTP traffic and secure search of search engine is not always secure unless HTTPS-by-default enabled everywhere.
{"title":"Attacking HTTPS Secure Search Service through Correlation Analysis of HTTP Webpages Accessed","authors":"Qian Liping, Wang Lidong","doi":"10.14257/IJSIA.2017.11.7.03","DOIUrl":"https://doi.org/10.14257/IJSIA.2017.11.7.03","url":null,"abstract":"It is very common for Internet users to query a search engine when retrieving web information. Sensitive data about search engine user’s intentions or behavior can be inferred from his query phrases and the webpages he visits subsequently. In order to protect contents of communications from being eavesdropped, a search engine can adopt HTTPS-by-default to provide bidirectional encryption to protect its users’ privacy. Since the majority of webpages indexed in search engine’s results pages are still on HTTP-enabled websites and the contents of these webpages can be observed by attackers once the user click on the indexed web-links. We propose a novel approach for attacking secure search through correlating analysis of encrypted search with unencrypted webpages the user visits subsequently. We show that a simple weighted TF-DF mechanism is sufficient for selecting guessing phrase candidates. Imitating search engine users, by querying these candidates and enumerating webpages indexed in results pages, we can hit the definite query phrases and meanwhile reconstruct user’s web-surfing trails through DNS-based URLs comparison and flow feature statistics-based network traffic analysis. In the experiment including 180 Chinese and English search phrases, we achieved 67.78% hit rate at first guess and 96.11% hit rate within three guesses. Our empirical research shows that HTTPS traffic can be correlated and de-anonymized through HTTP traffic and secure search of search engine is not always secure unless HTTPS-by-default enabled everywhere.","PeriodicalId":46187,"journal":{"name":"International Journal of Security and Its Applications","volume":"11 1","pages":"25-42"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45198639","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-31DOI: 10.14257/IJSIA.2017.11.7.06
F. Zhao, H. Liang, X. L. Wu, D. Ding
This paper presents a novel region-based active contour model for image segmentation in a variational level set formulation. We define a local discriminant criterion on the basis of the global and local region-based active contour model. The objective function in this model is thereafter minimized via level set method. By introducing the local discriminant criterion to separate background and foreground in local regions, our model not only achieves accurate segmentation results, but also is robust to initialization. Extensive experiments are reported to demonstrate that our method holds higher segmentation accuracy and more initialization robustness, compared with the global region-based and local region-based methods. Experimental results for synthetic images and real medical images show desirable performances of our method.
{"title":"Region-based Active Contour Segmentation Model with Local Discriminant Criterion","authors":"F. Zhao, H. Liang, X. L. Wu, D. Ding","doi":"10.14257/IJSIA.2017.11.7.06","DOIUrl":"https://doi.org/10.14257/IJSIA.2017.11.7.06","url":null,"abstract":"This paper presents a novel region-based active contour model for image segmentation in a variational level set formulation. We define a local discriminant criterion on the basis of the global and local region-based active contour model. The objective function in this model is thereafter minimized via level set method. By introducing the local discriminant criterion to separate background and foreground in local regions, our model not only achieves accurate segmentation results, but also is robust to initialization. Extensive experiments are reported to demonstrate that our method holds higher segmentation accuracy and more initialization robustness, compared with the global region-based and local region-based methods. Experimental results for synthetic images and real medical images show desirable performances of our method.","PeriodicalId":46187,"journal":{"name":"International Journal of Security and Its Applications","volume":"11 1","pages":"73-86"},"PeriodicalIF":0.0,"publicationDate":"2017-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47911503","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-06-30DOI: 10.14257/IJSIA.2017.11.6.01
Ting Cai, J. Wang
How to achieve both cross-domain authorization and access control in a multi-domain environment and ensuring local autonomy and security are hot research field of network security. Due to the centralized management, traditional access control has been unable to meet the security needs of cross-domain interoperability under a distributed environment. In this article, we introduce three types of inter-domain role relations, such as transitive mapping, non-transitive mapping and restricted access, extend the standard single-domain RBAC model to a multi-domain interoperable environment, and establish a role-based access control model based on multi-domain interoperability (MIRBAC). Compared with the prior studies, MIRBAC model supports separation of duties constraint under multi-domain environments, the security and management flexibility of interdomain authorization is greatly improved. Moreover, based on MIRBAC model, we further research detection method of security violation during interoperability, propose a complete security conflict detection algorithm according to various conflict types caused by implementing interoperability activities, and conduct computational complexity analysis and case analysis of our proposed algorithm. Finally, we develop a prototype system based on the definitions of our proposed model to conduct experimental studies to demonstrate the feasibility and performance of our approach.
{"title":"MIRBAC: A Role-Based Access Control Model for Multi-Domain Interoperability","authors":"Ting Cai, J. Wang","doi":"10.14257/IJSIA.2017.11.6.01","DOIUrl":"https://doi.org/10.14257/IJSIA.2017.11.6.01","url":null,"abstract":"How to achieve both cross-domain authorization and access control in a multi-domain environment and ensuring local autonomy and security are hot research field of network security. Due to the centralized management, traditional access control has been unable to meet the security needs of cross-domain interoperability under a distributed environment. In this article, we introduce three types of inter-domain role relations, such as transitive mapping, non-transitive mapping and restricted access, extend the standard single-domain RBAC model to a multi-domain interoperable environment, and establish a role-based access control model based on multi-domain interoperability (MIRBAC). Compared with the prior studies, MIRBAC model supports separation of duties constraint under multi-domain environments, the security and management flexibility of interdomain authorization is greatly improved. Moreover, based on MIRBAC model, we further research detection method of security violation during interoperability, propose a complete security conflict detection algorithm according to various conflict types caused by implementing interoperability activities, and conduct computational complexity analysis and case analysis of our proposed algorithm. Finally, we develop a prototype system based on the definitions of our proposed model to conduct experimental studies to demonstrate the feasibility and performance of our approach.","PeriodicalId":46187,"journal":{"name":"International Journal of Security and Its Applications","volume":"11 1","pages":"1-18"},"PeriodicalIF":0.0,"publicationDate":"2017-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45342525","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-06-30DOI: 10.14257/IJSIA.2017.11.6.04
Chi Guo-tai, Zhao Zhichong, Mohammad Zoynul Abedin
The main criteria to establish the credit risk evaluation index system is the indicators default identification ability. There is mutual influence between indices, a single index which has the default identification ability, but if put this indicator into the index system, and it will no longer have the default identification ability because of the impact of other indicators. This study therefore deletes the indicators of repeated information using colinearity diagnostics, and determines the order of indicators into the index evaluation system by calculating the score statistic of every indicator. We established credit risk evaluation index system of small businesses, including 14 indicators, such as cash ratio, the corporate credit situation nearly 3 years, by extracting the related data of 28 regional commercial bank branches of China, and the judgment accuracy of default and non default samples is 99.0%.
{"title":"Credit Risk Rating System of Small Enterprises Based on the Index Importance","authors":"Chi Guo-tai, Zhao Zhichong, Mohammad Zoynul Abedin","doi":"10.14257/IJSIA.2017.11.6.04","DOIUrl":"https://doi.org/10.14257/IJSIA.2017.11.6.04","url":null,"abstract":"The main criteria to establish the credit risk evaluation index system is the indicators default identification ability. There is mutual influence between indices, a single index which has the default identification ability, but if put this indicator into the index system, and it will no longer have the default identification ability because of the impact of other indicators. This study therefore deletes the indicators of repeated information using colinearity diagnostics, and determines the order of indicators into the index evaluation system by calculating the score statistic of every indicator. We established credit risk evaluation index system of small businesses, including 14 indicators, such as cash ratio, the corporate credit situation nearly 3 years, by extracting the related data of 28 regional commercial bank branches of China, and the judgment accuracy of default and non default samples is 99.0%.","PeriodicalId":46187,"journal":{"name":"International Journal of Security and Its Applications","volume":"52 1","pages":"35-52"},"PeriodicalIF":0.0,"publicationDate":"2017-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67048481","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-06-30DOI: 10.14257/IJSIA.2017.11.6.05
Mayada J. AlMeghari
In this globalized world, the Internet services and uses are growing exponentially. Hence, the data stores contain a huge amount of business data used for decision-making and for financial analysis at sensitive organizations called Data Warehouses (DWs). DW is necessary for financial and business information making them an attractive purpose for hackers. The achievement of security issues in DW is very important for a proper and secure continuation of DW system work. This paper presents a new framework for implementing security issues in DWs named Data Warehouse Signature (DWS), which is distributed in two models: DWSend model and DWReceive model. The DWS framework solves one of the common security problems such as unavailability in network by using parallel computing through a middleware named View Manager Layer (VML). This framework ensures the security issues, such as Confidentiality, Integrity, and Availability (CIA) and it also reaches high performance in Average Execution Time (AET) evaluated in experimental studies. The execution of a large query result as blocks of a number of records in parallel computing saves more time than serial computing. The high performance has a limited increase in executor's numbers because there are time complexity factors, such as transmission time, separation and collection time. This paper presents a mathematical model used when the organization applies the DWS framework in DW systems to get the adequate number of executors joined in VML middleware to reach the high performance.
{"title":"Data Warehouse Signature: High Performance Evaluation for Implementing Security Issues in Data Warehouses through a New Framework","authors":"Mayada J. AlMeghari","doi":"10.14257/IJSIA.2017.11.6.05","DOIUrl":"https://doi.org/10.14257/IJSIA.2017.11.6.05","url":null,"abstract":"In this globalized world, the Internet services and uses are growing exponentially. Hence, the data stores contain a huge amount of business data used for decision-making and for financial analysis at sensitive organizations called Data Warehouses (DWs). DW is necessary for financial and business information making them an attractive purpose for hackers. The achievement of security issues in DW is very important for a proper and secure continuation of DW system work. This paper presents a new framework for implementing security issues in DWs named Data Warehouse Signature (DWS), which is distributed in two models: DWSend model and DWReceive model. The DWS framework solves one of the common security problems such as unavailability in network by using parallel computing through a middleware named View Manager Layer (VML). This framework ensures the security issues, such as Confidentiality, Integrity, and Availability (CIA) and it also reaches high performance in Average Execution Time (AET) evaluated in experimental studies. The execution of a large query result as blocks of a number of records in parallel computing saves more time than serial computing. The high performance has a limited increase in executor's numbers because there are time complexity factors, such as transmission time, separation and collection time. This paper presents a mathematical model used when the organization applies the DWS framework in DW systems to get the adequate number of executors joined in VML middleware to reach the high performance.","PeriodicalId":46187,"journal":{"name":"International Journal of Security and Its Applications","volume":"11 1","pages":"53-68"},"PeriodicalIF":0.0,"publicationDate":"2017-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45270983","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-06-30DOI: 10.14257/IJSIA.2017.11.6.02
Cheng Miao, Liyan Sun, Li Yang
The frequent occurrence of coal mine emergent events caused great impact on the social order and economic stability. In order to effectively prevent the occurrence of coal mine emergent events, it is necessary to focus on upgrading the level of emergency capability. This paper proposes the evaluation model of emergency capability of coal mine emergent events by the multistage fuzzy quality synthetic evaluation method. The evaluation weights are determined by AHP, the multistage fuzzy comprehensive appraisal on emergency capability is made by the fuzzy mathematics method, the rank status of emergency capability of coal mine emergent events is determined according to the empirical analysis results. Finally, an empirical analysis is made, the results of first grade fuzzy comprehensive evaluation show that emergency rescue capability is good and others are general, the results of second grade show that coal enterprises emergency capability is general, the average score is 74.445 less than 80 which indicates that the overall situation of emergency capability of coal mine emergent events is general.
{"title":"Evaluation Research on Emergency Capability of Emergent Events in Chinses Coal Mine","authors":"Cheng Miao, Liyan Sun, Li Yang","doi":"10.14257/IJSIA.2017.11.6.02","DOIUrl":"https://doi.org/10.14257/IJSIA.2017.11.6.02","url":null,"abstract":"The frequent occurrence of coal mine emergent events caused great impact on the social order and economic stability. In order to effectively prevent the occurrence of coal mine emergent events, it is necessary to focus on upgrading the level of emergency capability. This paper proposes the evaluation model of emergency capability of coal mine emergent events by the multistage fuzzy quality synthetic evaluation method. The evaluation weights are determined by AHP, the multistage fuzzy comprehensive appraisal on emergency capability is made by the fuzzy mathematics method, the rank status of emergency capability of coal mine emergent events is determined according to the empirical analysis results. Finally, an empirical analysis is made, the results of first grade fuzzy comprehensive evaluation show that emergency rescue capability is good and others are general, the results of second grade show that coal enterprises emergency capability is general, the average score is 74.445 less than 80 which indicates that the overall situation of emergency capability of coal mine emergent events is general.","PeriodicalId":46187,"journal":{"name":"International Journal of Security and Its Applications","volume":"11 1","pages":"19-26"},"PeriodicalIF":0.0,"publicationDate":"2017-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42621860","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-06-30DOI: 10.14257/IJSIA.2017.11.6.06
Rolando Ramos-Frías, Miguel Vargas-Lombardo
String matching algorithms are an important element used in several computer science bb fields. These algorithms process strings of characters to find coincidences. The amount of processing required for modern applications that use string matching algorithms has increased over the years and new algorithms and solutions have been developed. In this paper we present a state of the art for the various types of string matching algorithms; and also review recent implementations done in GPU.
{"title":"A Review of String Matching Algorithms and Recent Implementations using GPU","authors":"Rolando Ramos-Frías, Miguel Vargas-Lombardo","doi":"10.14257/IJSIA.2017.11.6.06","DOIUrl":"https://doi.org/10.14257/IJSIA.2017.11.6.06","url":null,"abstract":"String matching algorithms are an important element used in several computer science\u0000bb fields. These algorithms process strings of characters to find coincidences. The amount\u0000of processing required for modern applications that use string matching algorithms has\u0000increased over the years and new algorithms and solutions have been developed. In this\u0000paper we present a state of the art for the various types of string matching algorithms;\u0000and also review recent implementations done in GPU.","PeriodicalId":46187,"journal":{"name":"International Journal of Security and Its Applications","volume":"11 1","pages":"69-76"},"PeriodicalIF":0.0,"publicationDate":"2017-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48695436","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
扫码关注我们
求助内容：
应助结果提醒方式：