{"title":"Thematic and Self-Learning Method for Persian, English and Penglish Spams Identification","authors":"S. Hashemi, K. Monfaredi","doi":"10.5121/IJCSA.2014.4401","DOIUrl":"https://doi.org/10.5121/IJCSA.2014.4401","url":null,"abstract":"","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"1 1","pages":"1-14"},"PeriodicalIF":0.0,"publicationDate":"2014-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83544669","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}
In this paper we present low -cost, concurrent checking methods for multiple error detection in S -boxes of symmetric block ciphers. These are redundancy-based fault detection schemes. We describe some studies of parity based concurrent error detection in S -boxes. Probability of multiple error detection is analyzed for random data. In this work 48-input, 32-output substitution blocks are taken into consideration.
{"title":"State of the Art Realistic Cryptographic Approaches for RC4 Symmetric Stream Cipher","authors":"Disha Handa, B. Kapoor","doi":"10.5121/IJCSA.2014.4403","DOIUrl":"https://doi.org/10.5121/IJCSA.2014.4403","url":null,"abstract":"In this paper we present low -cost, concurrent checking methods for multiple error detection in S -boxes of symmetric block ciphers. These are redundancy-based fault detection schemes. We describe some studies of parity based concurrent error detection in S -boxes. Probability of multiple error detection is analyzed for random data. In this work 48-input, 32-output substitution blocks are taken into consideration.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"10 1","pages":"27-32"},"PeriodicalIF":0.0,"publicationDate":"2014-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87292164","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}
Pyramid Histogram of Multi-scale Block Local Binary Pattern (PH-MBLBP) descriptor for recognizing scene categories, is presented in this paper. We show that scene categorization, especially for indoor and outdoor environments, requires its visual descriptor to process properties that are different from other vision domains (e.g., SIFT descriptor used for object categorization). Our proposed PH-MBLBP satisfies these properties and suits the scene categorization task. Since the proposed PH-MBLBP mainly encodes micro- and macro-structures of image patterns, thus, it provides relatively more complete image descriptor than the basic LBP operator. Moreover, our PH-MBLBP descriptor is more powerful texture descriptor than the conventional operator and it can also be calculated extremely fast. Our experiments demonstrate that PH-MBLBP outperforms the other descriptor such as SIFT.
{"title":"Scene Classification Using Pyramid Histogram of Multi-Scale Block Local Binary Pattern","authors":"Dipankar Das","doi":"10.5121/IJCSA.2014.4402","DOIUrl":"https://doi.org/10.5121/IJCSA.2014.4402","url":null,"abstract":"Pyramid Histogram of Multi-scale Block Local Binary Pattern (PH-MBLBP) descriptor for recognizing scene categories, is presented in this paper. We show that scene categorization, especially for indoor and outdoor environments, requires its visual descriptor to process properties that are different from other vision domains (e.g., SIFT descriptor used for object categorization). Our proposed PH-MBLBP satisfies these properties and suits the scene categorization task. Since the proposed PH-MBLBP mainly encodes micro- and macro-structures of image patterns, thus, it provides relatively more complete image descriptor than the basic LBP operator. Moreover, our PH-MBLBP descriptor is more powerful texture descriptor than the conventional operator and it can also be calculated extremely fast. Our experiments demonstrate that PH-MBLBP outperforms the other descriptor such as SIFT.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"41 1","pages":"15-25"},"PeriodicalIF":0.0,"publicationDate":"2014-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89504152","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}
Logic coverage criteria are central aspect of programs and specifications in the testing of software. A Boolean expression with n variables in expression 2 n distinct test cases is required for exhaustive testing .This is expensive even when n is modestly large. The possible solution is to select a small subset of all possible test cases which can effectively detect most of the common faults. Test case prioritization is one of the key techniques for making testing cost effective. In present study performance index of test suite is calculated for two Boolean specification testing techniques MUMCUT and Minimal-MUMCUT. Performance index helps to measure the efficiency and determine when testing can be stopped in case of limited resources. This paper evaluates the testability of generated single faults according to the number of test cases used to detect them. Test cases are generated from logic expressions in irredundant normal form (IDNF) derived from specifications or source code. The efficiency of prioritization techniques has been validated by an empirical study done on bench mark expressions using Performance Index (PI) metric.
{"title":"PERFORMANCE ANALYSIS OF LOGIC COVERAGE CRITERIA USING MUMCUT AND MINIMAL MUMCUT","authors":"Usha Badhera, A. Maheshwari","doi":"10.5121/IJCSA.2014.4404","DOIUrl":"https://doi.org/10.5121/IJCSA.2014.4404","url":null,"abstract":"Logic coverage criteria are central aspect of programs and specifications in the testing of software. A Boolean expression with n variables in expression 2 n distinct test cases is required for exhaustive testing .This is expensive even when n is modestly large. The possible solution is to select a small subset of all possible test cases which can effectively detect most of the common faults. Test case prioritization is one of the key techniques for making testing cost effective. In present study performance index of test suite is calculated for two Boolean specification testing techniques MUMCUT and Minimal-MUMCUT. Performance index helps to measure the efficiency and determine when testing can be stopped in case of limited resources. This paper evaluates the testability of generated single faults according to the number of test cases used to detect them. Test cases are generated from logic expressions in irredundant normal form (IDNF) derived from specifications or source code. The efficiency of prioritization techniques has been validated by an empirical study done on bench mark expressions using Performance Index (PI) metric.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"41 1","pages":"39-48"},"PeriodicalIF":0.0,"publicationDate":"2014-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90345599","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}
Sequential pattern mining finds the frequent subsequences or patterns from the given sequences. TPrefixSpan algorithm finds the relevant frequent patterns from the given sequential patterns formed using interval based events. In our proposed work, we add multiple constraints like item, length and aggregate to the interval based TPrefixSpan algorithm. By adding these constraints the efficiency and effectiveness of the algorithm improves. The proposed constraint based algorithm CTPrefixSpan has been applied to synthetic medical dataset. The algorithm can be applied for stock market analysis, DNA sequences analysis etc.
{"title":"Mining Sequential Patterns for interval based events by applying multiple constraints","authors":"Kalaivany M, U. V.","doi":"10.5121/IJCSA.2014.4406","DOIUrl":"https://doi.org/10.5121/IJCSA.2014.4406","url":null,"abstract":"Sequential pattern mining finds the frequent subsequences or patterns from the given sequences. TPrefixSpan algorithm finds the relevant frequent patterns from the given sequential patterns formed using interval based events. In our proposed work, we add multiple constraints like item, length and aggregate to the interval based TPrefixSpan algorithm. By adding these constraints the efficiency and effectiveness of the algorithm improves. The proposed constraint based algorithm CTPrefixSpan has been applied to synthetic medical dataset. The algorithm can be applied for stock market analysis, DNA sequences analysis etc.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"22 1","pages":"59-66"},"PeriodicalIF":0.0,"publicationDate":"2014-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85370070","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 : 2014-08-01DOI: 10.14355/ijcsa.2014.0303.03
Y. Chiew, Yachao Shi
Complex networks cannot only describe the complicated, asynchronous system, but also can be used to model and analyze network topological properties. Sophisticated methods for network construction and analysis exist in other fields. But until recently, researchers have few focused on the risk spread of a supply chain network. In this paper, a supply chain risk network based on single_node risk spread is modeled and the static network statistics are analyzed, including degree distribution, risk distribution, average path length and clustering coefficient. The simulation results indicate that supply chain complex network is a small-world network with short average path length and high degree of clustering, and its degree distribution and risk distribution follow a double power law. In addition, the average risk tends to decrease with the total number of risk node increase in supply chain risk spread network.
{"title":"The Research of Single_Node Risk Spread in Supply Chain Complex Network Based on Fixed Risk Values","authors":"Y. Chiew, Yachao Shi","doi":"10.14355/ijcsa.2014.0303.03","DOIUrl":"https://doi.org/10.14355/ijcsa.2014.0303.03","url":null,"abstract":"Complex networks cannot only describe the complicated, asynchronous system, but also can be used to model and analyze network topological properties. Sophisticated methods for network construction and analysis exist in other fields. But until recently, researchers have few focused on the risk spread of a supply chain network. In this paper, a supply chain risk network based on single_node risk spread is modeled and the static network statistics are analyzed, including degree distribution, risk distribution, average path length and clustering coefficient. The simulation results indicate that supply chain complex network is a small-world network with short average path length and high degree of clustering, and its degree distribution and risk distribution follow a double power law. In addition, the average risk tends to decrease with the total number of risk node increase in supply chain risk spread network.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"52 1","pages":"118"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90621051","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 : 2014-08-01DOI: 10.14355/IJCSA.2014.0303.02
D. I. Sensuse, Mesnan Silalahi, I. Budi
The development of the semantic web technology has enabled the integration of existing systems and resources. The implementation can be seen such as in the Linked Open Data initiatives, semantic search and semantic web portal. Ontology has been playing the crucial role for the implementation of the semantic web technology, but the development of ontology itself has lagged behind. Methodologies have been developed for ontology engineering, but most of them focused on the technical rather than the socio-technical aspect. Only a few has approached socio-technically but only partially. This article will describe aspects towards a socio-technical approach in ontology engineering methodology more comprehensively. This approach is important because of the complexity and the social nature of the ontology building process. A comparative study will expose the plus and minus points of methods used within the existing methodologies from the socio-technical point of view. Then a workbench will be proposed that take socio-technical aspect within the ontology engineering methodology into account.
{"title":"Towards a Socio-technical Ontology Engineering Methodology","authors":"D. I. Sensuse, Mesnan Silalahi, I. Budi","doi":"10.14355/IJCSA.2014.0303.02","DOIUrl":"https://doi.org/10.14355/IJCSA.2014.0303.02","url":null,"abstract":"The development of the semantic web technology has enabled the integration of existing systems and resources. The implementation can be seen such as in the Linked Open Data initiatives, semantic search and semantic web portal. Ontology has been playing the crucial role for the implementation of the semantic web technology, but the development of ontology itself has lagged behind. Methodologies have been developed for ontology engineering, but most of them focused on the technical rather than the socio-technical aspect. Only a few has approached socio-technically but only partially. This article will describe aspects towards a socio-technical approach in ontology engineering methodology more comprehensively. This approach is important because of the complexity and the social nature of the ontology building process. A comparative study will expose the plus and minus points of methods used within the existing methodologies from the socio-technical point of view. Then a workbench will be proposed that take socio-technical aspect within the ontology engineering methodology into account.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"44 1","pages":"111"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90829842","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 : 2014-08-01DOI: 10.14355/IJCSA.2014.0303.01
Delano Brandes Marques, A. G. O. Filho, A. Romariz, I. Viegas, Djavania A. Luz, A. K. D. B. Filho, S. Labidi, A. Ferraudo
The performance of both the traditional linear regression and Artificial Neural Network (ANN) techniques has been compared to check the validity to predict the properties of biodiesel and mixtures of diesel and biodiesel. We present on this paper a review on statistical and ANN applications to the Biodiesel quality. A case study is also presented showing the prediction of oxidative stability of Biodiesel using, for the first time, other official quality parameters instead of the chemical composition as input data. In this sense, our hope is that this paper would complement a series of recent review papers and catalyze future research in this rapidly evolving area.
{"title":"Recent Developments on Statistical and Neural Network Tools Focusing on Biodiesel Quality","authors":"Delano Brandes Marques, A. G. O. Filho, A. Romariz, I. Viegas, Djavania A. Luz, A. K. D. B. Filho, S. Labidi, A. Ferraudo","doi":"10.14355/IJCSA.2014.0303.01","DOIUrl":"https://doi.org/10.14355/IJCSA.2014.0303.01","url":null,"abstract":"The performance of both the traditional linear regression and Artificial Neural Network (ANN) techniques has been compared to check the validity to predict the properties of biodiesel and mixtures of diesel and biodiesel. We present on this paper a review on statistical and ANN applications to the Biodiesel quality. A case study is also presented showing the prediction of oxidative stability of Biodiesel using, for the first time, other official quality parameters instead of the chemical composition as input data. In this sense, our hope is that this paper would complement a series of recent review papers and catalyze future research in this rapidly evolving area.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"6 1","pages":"97"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85763269","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 : 2014-08-01DOI: 10.14355/IJCSA.2014.0303.04
H. ParveenBegam, A. MalukMohamedM
The prominent feature of mobile grid computing is the collaboration of multiple entities to perform collaborative tasks using mobile devices. Currently, most of the security solutions for mobile grid environment use static set of algorithms and protocols. Despite the increased usage of mobile computing, exploiting its full potential is difficult due to its inherent problems such as resource scarcity, frequent disconnections, and mobility. Our focus is to provide security and efficient power management. In this paper, a framework of dynamic secure routing protocol called Select Successive Hop Routing (SSHR) algorithm using Abstract Monitoring Objects (AMOs), Secure Service Certificates (SSC) and layer based encryption for each data transfers to improve the security level, anonymity and dynamicity of the data are proposed. This includes (i) Authentication of the mobile node (ii) Security flow between mobile nodes (iii) Saving battery power (iv) Hand-over of authentication information. The proposed framework solves the issues like asymmetry in network connectivity, computing power and mobility. The outcome is compared with certain existing security protocols and demonstrates how the proposed protocol is able to adapt itself over different conditions of the mobile device, and how it can provide a performance gain in the execution.
{"title":"ASAMO: Authentication and Secure Communication using Abstract Monitoring Objects for Mobile Grid Computing","authors":"H. ParveenBegam, A. MalukMohamedM","doi":"10.14355/IJCSA.2014.0303.04","DOIUrl":"https://doi.org/10.14355/IJCSA.2014.0303.04","url":null,"abstract":"The prominent feature of mobile grid computing is the collaboration of multiple entities to perform collaborative tasks using mobile devices. Currently, most of the security solutions for mobile grid environment use static set of algorithms and protocols. Despite the increased usage of mobile computing, exploiting its full potential is difficult due to its inherent problems such as resource scarcity, frequent disconnections, and mobility. Our focus is to provide security and efficient power management. In this paper, a framework of dynamic secure routing protocol called Select Successive Hop Routing (SSHR) algorithm using Abstract Monitoring Objects (AMOs), Secure Service Certificates (SSC) and layer based encryption for each data transfers to improve the security level, anonymity and dynamicity of the data are proposed. This includes (i) Authentication of the mobile node (ii) Security flow between mobile nodes (iii) Saving battery power (iv) Hand-over of authentication information. The proposed framework solves the issues like asymmetry in network connectivity, computing power and mobility. The outcome is compared with certain existing security protocols and demonstrates how the proposed protocol is able to adapt itself over different conditions of the mobile device, and how it can provide a performance gain in the execution.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"69 1","pages":"127"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86401594","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 : 2014-05-01DOI: 10.14355/IJCSA.2014.0302.02
M. Suguna, S. Palaniammal
Clustering high dimensional data is an emerging research area. The similarity criterion used by the traditional clustering algorithms is inadequate in high dimensional space. Also some of the dimensions are likely to be irrelevant thus hiding a possible clustering. Subspace clustering is an extension of traditional clustering that attempts to find clusters in different subspaces within a dataset. This paper proposes an idea by giving weight to every node of a cluster in a subspace. The cluster with greatest weight value will have more number of nodes when compared to all other clusters. This method of assigning weight can be done in two ways such as top down and bottom up. A threshold value is fixed and clusters with value greater than threshold only will be taken into consideration. The discovery of clusters in selected subspaces will be made easily with the process of assigning weight to nodes. This method will surely result in reduction of search space.
{"title":"A New Approach for Subspace Clustering of High Dimensional Data","authors":"M. Suguna, S. Palaniammal","doi":"10.14355/IJCSA.2014.0302.02","DOIUrl":"https://doi.org/10.14355/IJCSA.2014.0302.02","url":null,"abstract":"Clustering high dimensional data is an emerging research area. The similarity criterion used by the traditional clustering algorithms is inadequate in high dimensional space. Also some of the dimensions are likely to be irrelevant thus hiding a possible clustering. Subspace clustering is an extension of traditional clustering that attempts to find clusters in different subspaces within a dataset. This paper proposes an idea by giving weight to every node of a cluster in a subspace. The cluster with greatest weight value will have more number of nodes when compared to all other clusters. This method of assigning weight can be done in two ways such as top down and bottom up. A threshold value is fixed and clusters with value greater than threshold only will be taken into consideration. The discovery of clusters in selected subspaces will be made easily with the process of assigning weight to nodes. This method will surely result in reduction of search space.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"90 1","pages":"74-90"},"PeriodicalIF":0.0,"publicationDate":"2014-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77208532","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
扫码关注我们
求助内容：
应助结果提醒方式：