Forthcoming articles

International Journal of Computational Systems Engineering

International Journal of Computational Systems Engineering (IJCSysE)

These articles have been peer-reviewed and accepted for publication but are pending final changes, are not yet published and may not appear here in their final order of publication until they are assigned to issues. Therefore, the content conforms to our standards but the presentation (e.g. typesetting and proof-reading) is not necessarily up to the Inderscience standard. Additionally, titles, authors, abstracts and keywords may change before publication. Articles will not be published until the final proofs are validated by their authors.

Forthcoming articles must be purchased for the purposes of research, teaching and private study only. These articles can be cited using the expression "in press". For example: Smith, J. (in press). Article Title. Journal Title.

Articles marked with this shopping trolley icon are available for purchase - click on the icon to send an email request to purchase.

Register for our alerting service, which notifies you by email when new issues are published online.

Open AccessArticles marked with this Open Access icon are freely available and openly accessible to all without any restriction except the ones stated in their respective CC licenses.
We also offer which provide timely updates of tables of contents, newly published articles and calls for papers.

International Journal of Computational Systems Engineering (19 papers in press)

Regular Issues

  • Optimal Path Planning of UAV using Grey Wolf Optimizer   Order a copy of this article
    by Soundarya M S, Anusha Danashaker, Rohith P, Kavitha Panneerselvam, Seshadari Srinivasan 
    Abstract: This paper aims at proposing a novel approach for path planning of Unmanned Aerial Vehicle (UAV) along with obstacle avoidance. The path planning is achieved through swarm intelligence algorithm inspired by the behaviour of grey wolves known as Grey Wolf Optimizer (GWO). The optimal path planning of UAV using GWO is obtained by proper choice of objective function for targets and obstacle avoidance condition. The algorithm has three search agents namely alpha, beta and gamma which help in proper convergence of solution to the target while avoiding obstacle. The proposed approach is tested with different test cases of target and obstacles conditions and the simulated results have been reported. Simulation is carried out in MATLAB environment.
    Keywords: GWO; Path Planning; UAV.

  • A review on gamma interconnection network   Order a copy of this article
    by Shilpa Gupta, G.L. Pahuja 
    Abstract: In past decades considerable development has been made in big data communication and computation in super computer systems. Multistage interconnection networks are widely used in these super computer systems for reliable communication, because of their cost effectiveness, fault tolerance property and low transmission delay. Multistage interconnection networks (MIN) are classified according to their switch element size, number of stages, connection pattern between stages etc. Lot of researchers have compared various MIN on basis of different aspects of reliability and fault tolerance but selection of different MIN for comparison was not precise to one or more class of interconnection networks (IN) but was random. In this paper an attempt has been made to discuss all Gamma networks proposed till date to the best of our knowledge, and compared on various reliability issues so as to achieve a comprehensive statement about all Gamma MIN which has been broadly used in high speed packet switching super computers. It has been observed that other researchers have taken same reliability value for different types of switches, wherein here in this paper different reliability values have been applied to different type of switches to compute all reliability parameters of all Gamma Networks. also terminal reliability (TR)of all Gamma Networks have been computed and compared for all possible Tag Values for Network size of 8
    Keywords: Fault-Tolerance; Gamma Interconnection Network (GIN); Multistage Interconnection Network (MIN); Reliability; Switch Element (SE).

  • Elicitation of Software Testing Requirements from the Selected Set of Softwares Requirements in GOREP   Order a copy of this article
    by Mohd Sadiq, Sanjida Nazneen 
    Abstract: Requirements engineering (RE) is employed to elicit, model, and analyse the requirements of software. Software requirements elicitation is the first sub-process of RE; and it is used to identify the requirements of software according to the need of the stakeholders. In literature, we identify that goal oriented requirements elicitation process (GOREP) do not support the identification of testing requirements from the functional requirements (FR) of software in early phase of RE. Therefore, to tackle this research issue, we proposed a method for the identification of the testing requirements from the FR in GOREP. In real life applications, only those requirements are implemented and tested, which are selected by the stakeholders. So in the proposed method we used fuzzy based technique for FR selection on the basis of non-functional requirements (NFR). The canonical representation of multiplication operation (CRMO) associated with L-1 R-1 inverse arithmetic principle and graded mean integration representation (GMIR) based on triangular fuzzy numbers (TFNs) have been applied for the selection of the FR. In our work, an Institute Examination System (IES) is used as a case study to explain the steps of the proposed method.
    Keywords: Functional Requirements; Non-Functional Requirements; Testing Requirements; Test Cases; Fuzzy Based Approach; and Triangular Fuzzy Numbers.

  • Grenade-Cauchy Operator Integrated Artificial Bee Colony Optimization for Reliable QoS based Web Service Composition   Order a copy of this article
    by Udhaya Shree S., Amuthan A. 
    Abstract: Web service composition is considered as the potential method of integrating diversified number of applications independent of the characteristic features of service providers. Majority of the dynamic web service composition techniques in the literature addresses the problem of web service composition through the perspectives of Quality of Service (QoS) or transactional characteristics. GCO-ABC algorithm is proposed as an attempt of developing a dynamic service composition methodology that depends on the integration of transactional and QoS-based properties of web service. The transactional characteristics of web services are analyzed and the problem of dynamic web service composition is modeled using a directed acyclic graph with constraints. GCO-ABC algorithm is applied on the work flow sequence of web service composition developed as a constrained directed acyclic graph for determining the near optimal solution with efficacy and it is also predominant in comparison to the traditional Ant Colony Optimization Algorithm (ACOM) and its variant Improved Ant Colony Optimization Algorithm (IACOM). The performance of GCO-ABC is investigated through empirical and simulation means and the determined results infer that the proposed scheme is not only efficient than IACOM, ACOM and Brute force scheme but also capable of approximating the searching solutions into a much more optimal candidate solution.
    Keywords: Grenade Explosion; Cauchy operator; Reliable QoS; Web Service Composition; Ant Colony Optimization; Artificial Bee Colony Algorithm.

  • Performance Comparison of Multiagent Cooperative Reinforcement Learning Algorithms for Dynamic Decision Making in Retail Shop Application   Order a copy of this article
    by Deepak A. Vidhate 
    Abstract: A novel approach by Expertise based on Multiagent Cooperative Reinforcement Learning Algorithms (EMCRLA) for dynamic decision making in the retail application is proposed in this paper. Performance comparison between Cooperative Reinforcement Learning Algorithms and Expertise based Multiagent Cooperative Reinforcement Learning Algorithms (EMCRLA) is demonstrated. Different cooperation schemes for multi-agent cooperative reinforcement learning i.e. EGroup scheme, EDynamic scheme is proposed here. Implementation outcome includes demonstration of recommended cooperation schemes that are competent enough to speed up the collection of agents that achieves excellent action policies. This approach is developed for a three retailer stores in the retail marketplace. Retailers will be able to help each other and obtain profit from cooperation knowledge through learning their own strategies that exactly stand for their aims and benefit. The vendors are the knowledgeable agents in the hypothesis to employ cooperative learning to train helpfully in the circumstances. Assuming significant hypothesis on the vendors stock policy, restock period, arrival process of the consumers, the approach is modelled as Markov decision process model that make it possible to design learning algorithms. Dynamic consumer performance is noticeably learned using the proposed algorithms. The paper illustrates results of Cooperative Reinforcement Learning Algorithms of three shop agents for the period of one year sale duration and then demonstrated the results using proposed approach for three shop agents for one year sale duration. The results obtained by the proposed expertise based cooperation approach show that such methods will be able to put a quick convergence of agents in the dynamic environment.
    Keywords: Cooperation schemes; Multiagent learning; Reinforcement learning.

  • Towards Recent Developments in the Methods, Metrics and Datasets of Software Fault Prediction   Order a copy of this article
    by Deepak Sharma, Pravin Chandra 
    Abstract: The world of software systems is amplified with the changing environment magnifying the demand for quality software. Software fault prediction is a requisite activity ensuring the development of economic, efficient and quality software. It is the procedure for the development of models which help to identify faults in modules during early phases of software development lifecycle. Software fault prediction is one of the most prevalent research disciplines. The existing study in this domain includes numerous modeling techniques and software metrics for the early predictions of software faults. This paper aims to explore some of the prominent studies for software fault prediction in the existing literature. In this paper, software fault prediction papers since 1990 to 2017 are investigated. The paper includes the analysis of the studies having empirical validation and a good source of publication. The paper reflects the methods, metrics, and datasets available in the literature for software fault prediction. In addition, the modeling techniques based on traditional and computational intelligence based methods are also reviewed. This paper is an endeavor to assemble the existing techniques and metrics of software fault prediction with a motive to assist researchers for easy evaluation of suitable metrics for their own research scenarios.
    Keywords: Software Fault Prediction; Fault Tolerance; Computational Intelligence; Software Metrics; Evaluation Metrics.

  • Performance analysis of WOA optimized PID controllers for LFC of interconnected thermal power systems   Order a copy of this article
    by Rajesh Bhatt, Girish Parmar, Rajeev Gupta 
    Abstract: Nature inspired Whale optimization algorithm (WOA) has been implemented for load frequency control (LFC) of two areas interconnected non reheat thermal power systems in order to maintain the system frequency at a prescheduled value in the presence of disturbances. Two similar PID controllers have been used in each area and control optimization problem for proper tuning of controllers parameters is defined by considering the integral of time multiplied absolute error (ITAE) as an objective function. The superiority of WOA optimized PID controllers has been established by comparing the results with other existing approaches such as; BFOA/PI, DE/PI, NSGA-II/PI, GSA/PI and GWO/PI for the same system in the presence of load changes of different magnitude and location. For performance analysis, the percentage reduction in ITAE, settling times of frequency & tie line power deviations and minimum damping ratio (MDR), etc. have also been calculated. The simulation results show that the WOA/PID approach gives far better results in terms of system dynamic responses, ITAE, MDR, settling times and overshoots of 〖∆f〗_1,〖∆f〗_2,and 〖∆P〗_Tie for the same system under study when compared with some existing approaches.
    Keywords: Load frequency control (LFC); two area interconnected non reheat thermal power system; PID controller; Whale optimization algorithm (WOA).

  • A Computerized Framework for Characterization of Breast Tissue Using Mammographic Images   Order a copy of this article
    by Indrajeet Kumar, Jitendra Virmani, Harvendra Singh Bhadauria 
    Abstract: In this study various experiments have been conducted for four-class and two-class breast tissue pattern characterization using various texture feature models in transform domain. These experiments have been conducted on 480 mammographic images taken from the DDSM dataset. However, for two-class breast tissue pattern characterization problem, images belonging to {BIRADS-I, BIRADS-II} class has been considered in fatty class and images belonging to {BIRADS-III, BIRADS-IV} class has been considered in dense class. From each image, ROI of predefined size 128
    Keywords: Mammography; Breast tissue characterization; BIRADS classification; Texture feature models; Support vector machine classifier.

  • Stochastic maximum principle for mean-field type singular optimal control problem with discounted cost   Order a copy of this article
    by Muthukumar Palanisamy, Deepa Ravi 
    Abstract: In this article, mean-field type stochastic singular optimal control problem with discounted cost is studied over an infinite time interval. The discounted cost makes the cost functional is bounded, which guarantees the existence of optimal control. The control variable has two components as classical and singular control. Moreover the singular control satisfies bounded variation, non-decreasing continuous on the left with right limits. The proposed system is investigated in two different cases, such as without and with delay. In addition, infinite horizon version of stochastic maximum principle is established by using the convex control domain in each case. The obtained theoretical results are applied to optimal harvesting problem and optimal consumption problem.
    Keywords: Infinite horizon; Mean-field; Optimal control; Singular control; Stochastic maximum principle.

  • Discrete MDP Problem in Service Facility Systems with Inventory Management   Order a copy of this article
    by Selvakumar Chinnakkalai, Maheswari Pandiyaraj, Elango Chellappan 
    Abstract: In this article, we consider a discrete time(equally spaced) service facility system in which arrival of customers to the system is controlled by taking decision at the beginning of each period. Customers arrive for service are placed in a specified queue called Potential queue. Controller observe the number of customers in the system (eligible queue + server), the number of items in inventory and decides the quantity of customers to be admitted, others are rejected. Demands arrive throughout the period but they are satisfied only at the end of the period. Inventory is maintained in the server to satisfy the customers at the service completion time. Inventory is replenished instantaneously when the level become zero. The system is formulated as a Markov Decision Process. A stationary cost structure is imposed at each decision epoch and optimal policy is obtained by using policy iteration algorithm. A numerical example is provided to illustrate the problem.
    Keywords: Discrete-time MDP; Admission control; Service facility with inventory; Markov Decision Process.

  • Edge Fixed Edge Steiner Number of a Graph   Order a copy of this article
    Abstract: For a non-empty set W of vertices in a connected graph G, {itshape the Steiner distance d(W)} of W is the minimum size of a connected subgraph of G containing W. S(W) denotes the set of vertices that lies in Steiner W-trees. Let G be a connected graph with at least 2 vertices. A set W $subseteq$ V(G) is called a {itshape Steiner set} of G if S(W) = V(G). The {itshape Steiner number} s(G) is the minimum cardinality of a Steiner set. An edge Steiner set of G is a set W $subseteq$ V(G) such that every edge of G is contained in a Steiner W- tree. The edge Steiner number $s_1 (G)$ is the minimum cardinality of its edge Steiner sets and any edge Steiner set of cardinality $s_1 (G)$ is a minimum edge Steiner set of G. Let G be a connected graph with at least 3 vertices. For an edge e = xy in G, a set W $subseteq$ V(G) $-$ {x, y} is called an {itshape edge fixed edge Steiner set} of G if linebreak W' = W $cup$ {x, y} is an edge Steiner set of G. The minimum cardinality of an edge fixed edge Steiner set is called the {itshape edge fixed edge Steiner number of G} and is denoted by $s_{e1}(G)$. Also the Steiner W-tree necessarily contains the edge e and is called {itshape edge fixed edge Steiner W-tree}. In this paper, we study some of the characteristics of edge fixed edge Steiner number and provide the bounds for edge fixed edge Steiner number. For any two positive integers a and b with 2 $leq$ a $leq$ b, there exists a connected graph G with $s(G)$ = a and $s_{e1}(G)$ = b for some edge e = $xy$ in G.
    Keywords: Steiner set; edge fixed Steiner set; Steiner number; edge fixed Steiner number; edge fixed edge Steiner set; edge fixed edge Steiner number.

  • Contest of Strength Game Based Algorithm for Decline of Active Power Loss   Order a copy of this article
    Abstract: In this paper, Contest of Strength (COS) algorithm is proposed to solve the reactive power problem. It inspired by the game of Contest of Strength & the algorithm imitates the features of the game. Each candidate solution is alike a team participating in a series of rope pulling competitions & based on exert pulling forces on each other the superiority of the solutions they exemplify. According to Newtonian laws of mechanics the challenging teams move to their new-fangled positions. Contest of Strength (COS) algorithm maintains equal level of exploration & exploitation in search of near to global optimal solution in reactive power problem. Proposed Contest of Strength (COS) algorithm has been tested in standard IEEE 30, 57,118 & practical 191 bus test systems and simulation results show clearly the better-quality performance of the projected algorithm in tumbling the real power loss.
    Keywords: Optimal Reactive Power; Transmission loss; Contest of Strength.

  • On the Generalized Degree Distance of Graphs   Order a copy of this article
    by Manzoor Ahmad Bhat, K. Pattabiraman 
    Abstract: The generalized degree distance of a connected graph G, denoted by Hλ(G), is defined as Hλ(G) = 1/2 ∑u,v∈V(G)(dG (u) + dG (v))dGλ(u,v), where λ is any real number.In this paper, we investigate the mathematical properties of the generalized degree distance of a connected graphs. In addition, we present the relation between the generalized degree distance and other graph invariants.
    Keywords: Wiener index; generalized degree distance; graph invarients.

  • A Hybrid Approach to Metamorphic Cryptography using KIMLA and DNA Concept   Order a copy of this article
    Abstract: Increasing dependency on digital data in todays word required security in term of digital language. Some researcher advocate the use of cryptography to cope the required demand. On the other hand side some researcher advocate the use of steganography. Beauty of cryptography lies in the fact that o/p i.e. encrypted message is difficult to decode if key is unknown. On the other hand beauty of steganography lies in the fact that, secret message is hidden in such a way that it does not attract the attention of unauthorized user. In the proposed work, an effort has been made to fertilize the strength of both concept i.e. steganography and cryptography. DNA concept is used for encrypting the secured text. For hiding the message KIMLA algorithm is used. Implementation results shows that proposed algorithm is efficient in terms of providing security (robustness, payload capacity etc.).
    Keywords: KIMLA; DNA; Secret Text; LSB; Cover Image.

Special Issue on: SCDA 2018 Advances and Challenges of Soft Computing in Data Mining

  • Inverse kinematic Solution of 6 -DOF Industrial Robot using Nero-Fuzzy Technology   Order a copy of this article
    by Kshitish Dash, Bibhuti Choudhury 
    Abstract: The robot inverse kinematic controller does not give the shut frame arrangement. Henceforth Mechanical controller can accomplish end effectors position in more than one arrangement. To accomplish correct arrangement of the joint angle has been the fundamental worry in the research work. In this paper the analytical solution has been done using D-H method. The method gives the 6 DOF industrial robot with D-H Parameter value which will be the best uses for any inverse kinematics algorithm. Levenberg-Marquardt algorithm is used to solve inverse kinematic of 6-DOF industrial robot arm and the result has been simulated with different soft computing method like ANN and Fuzzy logic . A comparison is taken between both the result obtain from different sources.
    Keywords: Inverse Kinematics; ANN ; Fuzzy logic; Industrial Robot; forward kinematics,D-H parameters.

  • A Framework for Ensemble Classification and Sensitivity Analysis in Privacy Preserving Data Mining   Order a copy of this article
    by Chandrakanth Patrapati 
    Abstract: The perturbation mechanism for data streams is a challenging task. In the emerging world, data is erupting from various sources. The core applications need care on the data streams for further analysis and experimentation. As the micro data available with the core applications shall not be revealed to the public without taking any chance of breach, the perturbation challenges the analysis to get through the like results as of on the original data sets. In this paper we have applied a concept of Perlin noise to distract the original data from the eyes of the analysts, however allowing them to perform their activities well. The data evolving in the trendy applications of the today world needs security, almost of the applications in the world are related directly or indirectly to the personally identifiable information (micro data) of the people. The security that assures the privacy on these data is hitherto static in the applications. Applying security dynamically on such data is a challenging task. The perturbation mechanism canonically applies the noise on the datasets, where some of them do not require. This paper deals about the concepts of generation of smooth noise and syntactic perturbation mechanism on the selective tuples as selective perturbation.
    Keywords: privacy preserving data mining;data streams;ensemble classifier;sensitivity; smooth noise.
    DOI: 10.1504/IJCSYSE.2020.10016937
  • Feed Forwarded CT Image Registration for Tumor and Cyst Detection using rigid transformation with HSV color segmentation   Order a copy of this article
    Abstract: This paper automates the Medical diagnosis process by Image Registration feed forwarded to object detection with prediction of tumour and cyst by using K-means clustering over HSV colour features. Diagnosis of life killer disease is a complex process which requires Bio-medical image such as MRI, CT, and Endoscopy etc. Many Biomedical Images is used for the same case to predict the disease. Because of different view point of different Photographic sensors at different time obtained medical images are not aligned. So the manual diagnosis makes harder because of the images are not registered or not aligned properly. The inherent cause is the distortion of the imaging signal where object may be miss-transformed due to different camera focus and projection. Image registration is an essence to bypass the non-alignment issue. Here we have proposed and analysed a combined solution towards the miss transformed object or region of interest by performing reverse geometric transformation with different angle to produce the better perspective image for diagnosis which is feed forwarded to HSV colour model based segmentation to predict the cyst, tumour presence.
    Keywords: Image Registration; Color Segmentation; HSV (Hue Saturation Value); MRI (Machine Resonance Imaging); CT (Computer Tomography); Rigid Transformations; K-means Clustering.

    by SANJAY KUMAR MISHRA, Loknath Tripathy 
    Abstract: This paper focuses a novel relaying approach of combined Discrete Wavelet Transform (DWT) and Artificial Neural Network (ANN) based relaying scheme in Unified Power Flow Controller (UPFC) integrated Wind fed transmission line. This novelty of the scheme illustrates the fault detection of transmission line and minimises the fault detection time through the combined algorithm of DWT and ANN. However the combined scheme (DWT and ANN) works better as compared to DWT alone and fault time reduces to quarter cycle time (5msec). The process starts with DWT processor to find Spectral energy (SE). The differential spectral energy (DSE) is computed using the difference of spectral energy obtained from both sending and receiving end of the transmission line. The computed DSE value of each phase from DWT is fed to the ANN fault detector to register the fault pattern. It is trained and tested with different parameter variation of the line to obtain fault detection output and fault time. The advantages of using the scheme is that its performance accuracy is higher and detects the fault within 5msec time and compared with the existing scheme. The proposed approach is very effective, accurate, reliable and simple to understand for fault detection, classification of transmission line in comparison to existing methodology.
    Keywords: ANN; DSE; UPFC; WIND; DWT;.

  • Empirical Validation of Object-Oriented Metrics on Cross-Projects with Different Severity Levels   Order a copy of this article
    by Aarti Aarti, Geeta Sikka, Renu Dhir 
    Abstract: An object-oriented (OO) metrics has become crucial desideratum for software effort and fault predictions. To strengthen the adequacy of object-oriented metrics, it becomes important to know relationship between OO metrics and fault proneness at different levels of severity. It is inconceivable to build model of accurate estimate due to the inherent uncertainty in development projects. Empirical validations of software metrics are essential issue to determine applicability of prediction model. In this study, empirical validation is done on OO metrics given by Chidamber and Kemerer (CK suite) for predicting faults at different severity levels. This paper also instanced on defect prediction using cross-projects (CP) because of the unpredictability in selection of software attributes by analogy based approach that deliver imprecise and ambiguous solution. This paper depicts detection of fault-proneness by extracting the relevant OO metrics and such models helps to focus on fault prone modules of new projects by allocating more resources to them with use of regression and other machine learning methods. Combination of CP data with regression techniques improves effectiveness of prediction by extracting similar features impacted by all datasets. The performance is evaluated using the receiver and operator (ROC) parameters. The results concluded that proposed methodology has great potential for conducting prediction of faults and shows that analysis of result using machine learning techniques outperforms as compared to logistic regression.
    Keywords: Fault; Object-oriented (OO) metrics; Classification; ROC; Level of severity; Empirical Validation.