Haiyang Hu, Zhansi Jiang, Yanxue Wang, Shuilong He
{"title":"A multi-criteria adaptive sequential sampling method for radial basis function","authors":"Haiyang Hu, Zhansi Jiang, Yanxue Wang, Shuilong He","doi":"10.1504/ijcsm.2020.10029254","DOIUrl":"https://doi.org/10.1504/ijcsm.2020.10029254","url":null,"abstract":"A multi-criteria adaptive sequential sampling method is proposed for radial basis function metamodel and a new global approximation method is developed in this paper. In this new sampling method, objective, curvature and distance are considered as sampling criteria. With the three criteria, it guarantees that the entire domain will be covered by samples, and more sampling points will be gathered in the peak and valley regions, which is useful for enhance accuracy and efficiency of approximation model. Intensive testing shows that the efficiency of method and accuracy of metamodel are satisfactory by this new global approximation method.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123148263","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}
{"title":"Effective test data generation using probabilistic networks","authors":"Saeed Parsa, Farid Feyzi","doi":"10.1504/ijcsm.2020.10029250","DOIUrl":"https://doi.org/10.1504/ijcsm.2020.10029250","url":null,"abstract":"This paper presents a novel test data generation method called Bayes-TDG. It is based on principles of Bayesian networks (BNs) and provides the possibility of making inference from probabilistic data in the model to increase the prime path coverage ratio (PPCR) for a given program under test (PUT). In this regard, a new program structure-based probabilistic network, TDG-NET, is proposed that is capable of modelling the conditional dependencies among the program basic blocks (BBs) in one hand and conditional dependencies of the transitions between its BBs and input parameters on the other hand. To achieve failure-detection effectiveness, we propose a path selection strategy that works based on the predicted outcome of generated test cases. So, we mitigate the need for a human oracle, and the generated test suite could be directly used in fault localisation. Several experiments are conducted to evaluate the performance of Bayes-TDG. The results reveal that the method is promising and the generated test suite could be quite effective.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127639698","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}
{"title":"An efficient fifth-order iterative scheme for solving a system of nonlinear equations and PDE","authors":"Anuradha Singh","doi":"10.1504/ijcsm.2020.10029253","DOIUrl":"https://doi.org/10.1504/ijcsm.2020.10029253","url":null,"abstract":"This article, introduces an efficient fifth-order iterative technique for solving systems of nonlinear equations. The order of convergence of the proposed method has been verified by the computational order of convergence. Some numerical examples are employed to show the superiority of the proposed iterative method. The computational efficiency index has also been illustrated and analysed. The application of proposed scheme for solving nonlinear PDE has also been discussed here.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134325956","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}
{"title":"Hybrid adaptive random testing","authors":"Saeed Parsa, E. Nikravan","doi":"10.1504/ijcsm.2020.10028215","DOIUrl":"https://doi.org/10.1504/ijcsm.2020.10028215","url":null,"abstract":"Adaptive random testing (ART) subsumes a family of random testing techniques with an effective improvement. It is based on the observation that failure causing inputs tend to be clustered together. Hence the ART methods spread test cases more evenly within the input domain to improve the fault-detection capability of random testing. There have been several implementations of ART based on different intuitions and principles with their own advantages and disadvantages. In the different variants of ART methods, the majority of them use a variety of distance calculations, with corresponding computational overhead. The newly methods try to decrease computational overhead while maintaining the performance through partitioning the input domain. We outline a new partitioning-based ART algorithm with a hybrid search method and demonstrate experimentally that it can further improve the performance, with considerably lower overhead than other ART algorithms.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125449878","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}
Mohammed M. Ali, Mohammed M. Abu Shquier, Afag Slah Eldeen, Mohamed E. Zidan, Ra'ed M. Al-Khatib
{"title":"Novel approach in multilingual and mixed English-Arabic test collection","authors":"Mohammed M. Ali, Mohammed M. Abu Shquier, Afag Slah Eldeen, Mohamed E. Zidan, Ra'ed M. Al-Khatib","doi":"10.1504/ijcsm.2020.10028219","DOIUrl":"https://doi.org/10.1504/ijcsm.2020.10028219","url":null,"abstract":"Mixing languages together in text and in talking is a major feature in non-English languages in developing countries. This mixed grammar is also emerging in SMS, Facebook communication, searching the web and any future attempts also may increase the footprint of such a mixed language knowledge base. Traditional information retrieval (IR) and cross-language information retrieval (CLIR) systems do not exploit this natural human tendency as the underlying assumption is that user query is always monolingual. Accordingly, the majority of the text collections are either monolingual or multilingual. This paper explores the trends of mixed-language querying and writing. It also shows how the corpus is validated statistically and how an Arabic lexicon can be extracted using co-occurrence statistics. Results showed that the distribution of frequencies of words in the corpus is very skewed the vocabulary growth is a good fit. The results of how to handle mixed queries are also summarised.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123702386","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}
{"title":"A genetic-fuzzy control method for regenerative braking in electric vehicle","authors":"Zhiqiang Liu, Shan Lu, Rong-hua Du","doi":"10.1504/ijcsm.2020.10028218","DOIUrl":"https://doi.org/10.1504/ijcsm.2020.10028218","url":null,"abstract":"In order to improve the recovery ratio of the regenerative braking energy in electric vehicles, the influence factors on braking energy feedback in electric vehicles were analysed. Then, a parallel braking force distribution model was established, and a fuzzy controller on braking force distribution was designed, in which the inputs were vehicle speed, braking strength, battery SOC, and output was regenerative braking ratio. On the other hand, the implementation of genetic algorithm in optimisation process was studied. Furthermore, the genetic algorithm was used to optimise the fuzzy control rules, and new fuzzy distribution rules of electro-hydraulic braking force were obtained. The experimental results showed that the recoverable energy ratio was increased by 2.7% with the comparison of the optimised distribution rules and the original rules. So, the genetic-fuzzy control method is effective for regenerative braking in electric vehicles.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"8 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121615524","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}
{"title":"Proportional-integral-derivative controller parameter optimisation based on improved glowworm swarm optimisation algorithm","authors":"Xing Guo, Shi-Chao Yin, Yi Zhang, Wei Li","doi":"10.1504/ijcsm.2020.10028217","DOIUrl":"https://doi.org/10.1504/ijcsm.2020.10028217","url":null,"abstract":"The proportional-integral-derivative (PID) controller parameters tuning, is seeking the optimal value in the space of three parameters to achieve the optimal control performance of the system. It is the core of contemporary feedback control system design. However, its easily falling into local optimum weakened its global search ability. To tackle this problem, this paper proposes an improved glowworm swarm optimisation algorithm, (D-AGSO) with the introduction of directed moving and adaptive step strategy. The simulation experimental results show that D-AGSO continuously adapts the tuning parameters, achieving lower fluctuations features, time settling and smaller steady state error, specially applied to the time delay in the case of inertia controlled system of industrial production.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122704357","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}
{"title":"Approximate of solution of a fourth order ordinary differential equations via tenth step block method","authors":"G. S. Gebremedhin, S. Jena","doi":"10.1504/ijcsm.2020.10028216","DOIUrl":"https://doi.org/10.1504/ijcsm.2020.10028216","url":null,"abstract":"This paper carries a different approach of collection and interpolation to develop a tenth block method for the numerical solution of linear or nonlinear ordinary differential equations of fourth order with initial conditions. The method has been implemented at the selected mesh points to generate a direct tenth block method through Taylor series. Some critical properties of this method such as zero stability, order of the method, and convergence have been analysed. Two numerical tests have taken to make a comparison of the approximate results with exact as well as results of other authors.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121687273","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}
{"title":"Computation of multi-choice multi-objective fuzzy probabilistic two stage programming problem","authors":"Prabhat Kumar Rout, S. Nanda, S. Acharya","doi":"10.1504/ijcsm.2020.10028094","DOIUrl":"https://doi.org/10.1504/ijcsm.2020.10028094","url":null,"abstract":"The aim of the paper is to present a multi-choice multi-objective fuzzy probabilistic two stage programming problem and its solution methodology. The mathematical programming problem suggested here is difficult to solve directly. Therefore, three major steps are suggested to solve the proposed mathematical programming problem. In first step, fuzzy chance constraint is transformed to its equivalent chance constraint programming problem using α – cut technique. Chance constraint technique is used to obtain a crisp model of multi-choice multi-objective two-stage programming problem. In the second step, two stage programming problem is converted to its equivalent deterministic model. In next step, importance is given to handle multi-choice parameter using least square approximation technique. At the end of third step, a multi-objective mathematical programming is obtained. Finally ∈-constraint approach is used to solve the transformed multi-objective mathematical programming. Using existing methodology and software the final solution of the proposed model is obtained. The proposed method is implemented with a numerical example.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127687236","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}
{"title":"Smart grid short-term load estimation model based on BP neural network","authors":"Jianqiang Shi, Shi Chengchao, Han Lei, Xu Mengxi","doi":"10.1504/ijcsm.2020.10028091","DOIUrl":"https://doi.org/10.1504/ijcsm.2020.10028091","url":null,"abstract":"As reasonable short-term load estimation system can provide reliable support for the operating, planning and designing of the smart grid, in this paper, we propose an effective smart grid short-term load estimation method. Different types of data are input to the BP neural network and then the output of BP neural network is represented as the load estimation results. Although BP neural network can approximate any nonlinear continuous function with the condition of a specific structure and suitable weights, it is very difficult to obtain the global minimum result. In order to obtain the global optimum solution in short-term load estimation, we exploit the genetic algorithm to optimise the weights and thresholds of the BP neural network, which is the main advantage of the proposed model. Finally, experimental results demonstrate that the proposed method can estimate short-term load of smart grid with higher accuracy and it can also clearly show the load requirement distribution in different time period.","PeriodicalId":399731,"journal":{"name":"Int. J. Comput. Sci. Math.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128653663","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}