This work considers the multi-objective optimization problem constrained by a system of bipolar fuzzy relational equations with max-product composition. An integer optimization based technique for order of preference by similarity to the ideal solution is proposed for solving such a problem. Some critical features associated with the feasible domain and optimal solutions of the bipolar max-Tp equation constrained optimization problem are studied. An illustrative example verifying the idea of this paper is included. This is the first attempt to study the bipolar max-T equation constrained multi-objective optimization problems from an integer programming viewpoint.
{"title":"Solving Bipolar Max-Tp Equation Constrained Multi-Objective Optimization Problems","authors":"Cheng-Kai Hu, Fung-Bao Liu, Cheng-Feng Hu","doi":"10.5121/IJSC.2016.7402","DOIUrl":"https://doi.org/10.5121/IJSC.2016.7402","url":null,"abstract":"This work considers the multi-objective optimization problem constrained by a system of bipolar fuzzy relational equations with max-product composition. An integer optimization based technique for order of preference by similarity to the ideal solution is proposed for solving such a problem. Some critical features associated with the feasible domain and optimal solutions of the bipolar max-Tp equation constrained optimization problem are studied. An illustrative example verifying the idea of this paper is included. This is the first attempt to study the bipolar max-T equation constrained multi-objective optimization problems from an integer programming viewpoint.","PeriodicalId":38638,"journal":{"name":"International Journal of Advances in Soft Computing and its Applications","volume":"49 1","pages":"11-23"},"PeriodicalIF":0.0,"publicationDate":"2016-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80744505","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}
A. Rasedee, M. Suleiman, A. Ahmadian, Z. Ibrahim, K. I. Othman, A. Rakhimov
In this article a variable order variable step size technique in backwards difference form is used to solve nonlinear Riccati differential equations directly. The method proposed requires calculating the integration coefficients only once at the beginning, in contrast to current divided difference methods which calculate integration coefficients at every step change. Numerical results will show that the variable order variable step size technique reduces computational cost in terms of total steps without effecting accuracy.
{"title":"The solution of Riccati type differential equation by means of variable order variable stepsize backward difference method","authors":"A. Rasedee, M. Suleiman, A. Ahmadian, Z. Ibrahim, K. I. Othman, A. Rakhimov","doi":"10.5899/2016/JSCA-00066","DOIUrl":"https://doi.org/10.5899/2016/JSCA-00066","url":null,"abstract":"In this article a variable order variable step size technique in backwards difference form is used to solve nonlinear Riccati differential equations directly. The method proposed requires calculating the integration coefficients only once at the beginning, in contrast to current divided difference methods which calculate integration coefficients at every step change. Numerical results will show that the variable order variable step size technique reduces computational cost in terms of total steps without effecting accuracy.","PeriodicalId":38638,"journal":{"name":"International Journal of Advances in Soft Computing and its Applications","volume":"18 1","pages":"35-42"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82151594","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 : 2016-01-01DOI: 10.3923/IJSCOMP.2016.52.63
Ganeshsree Selvachandran, A. R. Salleh
{"title":"Fuzzy parameterized intuitionistic fuzzy soft expert set theory and its application in decision making","authors":"Ganeshsree Selvachandran, A. R. Salleh","doi":"10.3923/IJSCOMP.2016.52.63","DOIUrl":"https://doi.org/10.3923/IJSCOMP.2016.52.63","url":null,"abstract":"","PeriodicalId":38638,"journal":{"name":"International Journal of Advances in Soft Computing and its Applications","volume":"2013 1","pages":"52-63"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87917600","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 : 2016-01-01DOI: 10.3923/IJSCOMP.2016.334.342
Naeimeh Elkhani, R. C. Muniyandi
{"title":"Review of the effect of feature selection for microarray data on the classification accuracy for cancer data sets","authors":"Naeimeh Elkhani, R. C. Muniyandi","doi":"10.3923/IJSCOMP.2016.334.342","DOIUrl":"https://doi.org/10.3923/IJSCOMP.2016.334.342","url":null,"abstract":"","PeriodicalId":38638,"journal":{"name":"International Journal of Advances in Soft Computing and its Applications","volume":"93 1","pages":"334-342"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80311284","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}
The human face is a dynamic object which a high degree of variability exists in its appearance. This makes the face detection to be considered as the first and most essential step in face recognition systems. The aim of the face detection is the segmentation of the face. There are several problems in face detection, including state switching, changing light intensity, face covering, etc. To solve these problems, the present study utilizes an advanced algorithm based on the LBP method and a structured Adaboost algorithm using the FERET database. The output will be attained by entering the normalized data into a three-layer LBP Adaboost fed with the data from data bases. It was found that the method has the acceptable detection accuracy of 75%, detection feature of 72% and sensitivity of 77% , and the final detection result of the human face is up to 98% possible.
{"title":"Face Detection Using Fusion of LBP and AdaBoost","authors":"Arezou Chehrehgosha, M. Emadi","doi":"10.5899/2016/JSCA-00064","DOIUrl":"https://doi.org/10.5899/2016/JSCA-00064","url":null,"abstract":"The human face is a dynamic object which a high degree of variability exists in its appearance. This makes the face detection to be considered as the first and most essential step in face recognition systems. The aim of the face detection is the segmentation of the face. There are several problems in face detection, including state switching, changing light intensity, face covering, etc. To solve these problems, the present study utilizes an advanced algorithm based on the LBP method and a structured Adaboost algorithm using the FERET database. The output will be attained by entering the normalized data into a three-layer LBP Adaboost fed with the data from data bases. It was found that the method has the acceptable detection accuracy of 75%, detection feature of 72% and sensitivity of 77% , and the final detection result of the human face is up to 98% possible.","PeriodicalId":38638,"journal":{"name":"International Journal of Advances in Soft Computing and its Applications","volume":"20 1","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85449878","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, hybrid block method is obtained by combining the Block Backward Differentiation Formulas (BBDF) with block Simpson method for the numerical solution of first order Fuzzy Differential Equations (FDEs). The fuzzy version of the methods is discussed in detail under Seikkala differentiability concept. Numerical results obtained by the hybrid block method are presented and compare with the solution obtained by BBDF, Backward Differential Formula (BDF) and Euler method. Several numerical problems are presented to illustrate the efficiency of the proposed hybrid method.
{"title":"Two Points Hybrid Block Method for Solving First Order Fuzzy Differential Equations","authors":"Tiaw Kah Fook, Z. Ibrahim","doi":"10.5899/2016/JSCA-00083","DOIUrl":"https://doi.org/10.5899/2016/JSCA-00083","url":null,"abstract":"In this paper, hybrid block method is obtained by combining the Block Backward Differentiation Formulas (BBDF) with block Simpson method for the numerical solution of first order Fuzzy Differential Equations (FDEs). The fuzzy version of the methods is discussed in detail under Seikkala differentiability concept. Numerical results obtained by the hybrid block method are presented and compare with the solution obtained by BBDF, Backward Differential Formula (BDF) and Euler method. Several numerical problems are presented to illustrate the efficiency of the proposed hybrid method.","PeriodicalId":38638,"journal":{"name":"International Journal of Advances in Soft Computing and its Applications","volume":"24 1","pages":"43-53"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74074327","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}
Continual data checking is considered as one of the most common search tools for frequent itemsets which requires storage on memory. On the other hand, according to properties of data stream which are unlimited productions with a high-speed, it is not possible saving these data on memory and we need for techniques which enables online processing and finding repetitive standards. One of the most popular techniques in this case is using sliding windows. The benefits of these windows can be reducing memory usage and also search acceleration. In this article, a new vertical display and an algorithm is provided based on the pins in order to find frequent itemsets in data streams. Since this new display has a compressed format itself so, the proposed algorithm in terms of memory consumption and processing is more efficient than any other similar algorithms.
{"title":"Method presented for finding Frequent Itemsets in web data streams","authors":"Farzaneh Kaviani, M. Khayyambashi","doi":"10.5899/2016/JSCA-00065","DOIUrl":"https://doi.org/10.5899/2016/JSCA-00065","url":null,"abstract":"Continual data checking is considered as one of the most common search tools for frequent itemsets which requires storage on memory. On the other hand, according to properties of data stream which are unlimited productions with a high-speed, it is not possible saving these data on memory and we need for techniques which enables online processing and finding repetitive standards. One of the most popular techniques in this case is using sliding windows. The benefits of these windows can be reducing memory usage and also search acceleration. In this article, a new vertical display and an algorithm is provided based on the pins in order to find frequent itemsets in data streams. Since this new display has a compressed format itself so, the proposed algorithm in terms of memory consumption and processing is more efficient than any other similar algorithms.","PeriodicalId":38638,"journal":{"name":"International Journal of Advances in Soft Computing and its Applications","volume":"46 1","pages":"28-34"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89953832","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 execute the solution procedure for second order linear fuzzy difference equation by Lagrange's multiplier method. In crisp sense the difference equation are easy to solve, but when we take in fuzzy sense it forms a system of difference equation which is not so easy to solve. By the help of Lagrange's multiplier we can solved it easily. The results are illustrated by two different numerical examples and followed by two applications.
{"title":"Solution of second order linear fuzzy difference equation by Lagrange's multiplier method","authors":"S. Mondal, D. K. Vishwakarma, A. K. Saha","doi":"10.5899/2016/JSCA-00063","DOIUrl":"https://doi.org/10.5899/2016/JSCA-00063","url":null,"abstract":"In this paper we execute the solution procedure for second order linear fuzzy difference equation by Lagrange's multiplier method. In crisp sense the difference equation are easy to solve, but when we take in fuzzy sense it forms a system of difference equation which is not so easy to solve. By the help of Lagrange's multiplier we can solved it easily. The results are illustrated by two different numerical examples and followed by two applications.","PeriodicalId":38638,"journal":{"name":"International Journal of Advances in Soft Computing and its Applications","volume":"19 1","pages":"11-27"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81515769","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 : 2016-01-01DOI: 10.3923/IJSCOMP.2016.282.288
Jabril Ramdan, K. Omar, Mohamed Fyzul
{"title":"Segmentation of Arabic words using area Voronoi diagrams and neighbours graph","authors":"Jabril Ramdan, K. Omar, Mohamed Fyzul","doi":"10.3923/IJSCOMP.2016.282.288","DOIUrl":"https://doi.org/10.3923/IJSCOMP.2016.282.288","url":null,"abstract":"","PeriodicalId":38638,"journal":{"name":"International Journal of Advances in Soft Computing and its Applications","volume":"33 1","pages":"282-288"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84272111","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 : 2016-01-01DOI: 10.3923/IJSCOMP.2016.70.75
Q. Mosa, M. F. Nasrudin
{"title":"An enhanced image restoration of broken characters based on thresholding techniques","authors":"Q. Mosa, M. F. Nasrudin","doi":"10.3923/IJSCOMP.2016.70.75","DOIUrl":"https://doi.org/10.3923/IJSCOMP.2016.70.75","url":null,"abstract":"","PeriodicalId":38638,"journal":{"name":"International Journal of Advances in Soft Computing and its Applications","volume":"266 1","pages":"70-75"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76735382","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
扫码关注我们
求助内容：
应助结果提醒方式：