Forthcoming articles


International Journal of Artificial Intelligence and Soft Computing


These articles have been peer-reviewed and accepted for publication in IJAISC, 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.


Articles 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.


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


We also offer RSS feeds which provide timely updates of tables of contents, newly published articles and calls for papers.


International Journal of Artificial Intelligence and Soft Computing (7 papers in press)


Regular Issues


  • A Novel Method for Network Intrusion Detection based on Nonlinear SNE and SVM   Order a copy of this article
    by Yasir Hamid, Ludovic Journaux, John Aldo Lee, M. Sugumaran 
    Abstract: In the case of Network Intrusion Detection data, pre-processing techniques have been extensively used to enhance the accuracy of the model. An ideal Intrusion Detection System (IDS) is one that has appreciable detection capability overall the group of attacks. An open research problem in this area is the lower detection rate for less frequent attacks, which result from the curse of dimensionality and imbalanced class distribution of the benchmark datasets. This work attempts to minimize the effects of imbalanced class distribution by applying random under-sampling of the majority classes and SMOTE based oversampling of minority classes. In order to alleviate the issue arising from the curse of dimensionality, this model makes use of Stochastic Neighbor Embedding a Non-Linear Dimension Reduction technique to embed the higher dimensional feature vectors in low-dimensional embedding spaces. A nonlinear Support Vector Machine with a radial basis function on a series of Gamma values was used to build the model. The results demonstrate that the proposed model with the dimension reduction has higher detection coverage for all the attack groups in the data set as well as the normal data. Results are evaluated on two benchmark datasets KDD99 and UNSW-NB15.
    Keywords: Accuracy; Classification; Dimension Reduction; Intrusion Detection; KDD99; NLDR; SNE; SVM; UNSW-N15.

  • Hierarchical Classification of Web Search Results to detect user's   Order a copy of this article
    by SALMA GAOU 
    Abstract: User understanding in a web browsing session is a difficult subject, which attracts the attention of many researchers in this field. This article will facilitate a great impact on many Internet-based applications. For example, if a search engine has the ability to detect users intent; it could be better following the order of the search results to user needs. In this context, research has focused on the analysis for users with Result Pages Search Engine resulting from a Web application, but most methods ignore the intent of the user during the exploration of Web pages associated with the links of the resulting page that it decides to visit. In this article, we focus on the detection and understanding of the user's intent that motivate a user to search on the web. The calculation of the similarity is preceded by the formation of the vicinity of the target item, the first method used is that of the single k-means clustering approach for items in different groups. This method had limitations because of sparsity problem. To overcome this limitation and increase the accuracy of our model, we opted for a systemic approach outcome of Group Technology. This approach provides the BEA algorithm to improve communities search. It's a new way to identify the neighbourhood and solve the problem of scalability.
    Keywords: Intent user; Information search; ranking of search results; search retrieval; Group Technology; Co-Clustering; BEA algorithm.

Special Issue on: Recent Trends in Applicable Mathematics

  • A Novel Cryptosystem Based on Cooperating Distributed Grammar Systems   Order a copy of this article
    by Jayaseelan Samuel, P.J. Abisha 
    Abstract: In language theory based cryptography, a block cipher based on Glukov product of automata was considered and studied. On the other hand the concept of cooperating distributed grammar systems (CDGS) was introduced and studied by Csuhaj-Varj
    Keywords: Avalanche Effect; Block Cipher; Cooperating Distributed Grammar Systems; Decryption; Encryption; Permutation Right Linear Grammar; Right Linear Grammar; Symmetric Key Cryptosystems.

  • Path Management Strategy to Reduce Flooding of Grid Fisheye State Routing (GFSR) Protocol in Mobile Ad Hoc Network Using Fuzzy and Rough Set Theory   Order a copy of this article
    by Nithya Rekha Sivakumar, Abdullah Alaraj 
    Abstract: In ad hoc mobile wireless networks, energy consumption is an important issue as most mobile hosts operate on limited battery re-sources. Existing models for evaluating the energy consumption behaviour of a mobile ad hoc network have shown that the various components of energy related costs include transmission power as well as the power of reception. Most of the existing ad-hoc routing algorithms select the shortest path using various resources (Energy). However the selected path may not consider all the network parameters and this would result in link instability in the network. The problems with existing method are frequent route change with respect to change in topology, congestion as result of traffic and battery limitations since its an infrastructure less network. Approach: To overcome these problems an optimal path management approach called path vector calculation based on fuzzy and rough set theory were addressed. The ultimate intend of this study is to select the qualified path based on energy consumption of the node in the network. Simple rules were generated using fuzzy and rough set techniques for calculating path vector and to remove irrelevant attributes (resources) for evaluating the best routing. The set of rules were evaluated with proactive protocols namely Fisheye-State Routing (FSR) protocol in the NS-2 simulation environment based on metrics such as Total Energy consumed, Average Energy Consumed, Overall Residual Energy and Average Residual Energy and it also considers the importance of the objects (nodes).
    Keywords: Fuzzy cost; Fuzzy and Rough Set Theory; path vector; membership function information gain; Energy Consumption; Grid Fisheye State Routing (GFSR) Protocol.

  • Array P System with t-communicating and Permitting Mate Operation   Order a copy of this article
    by Nithya Kalyani, Helen Chandra, Saroja Theerdus Kalavathy 
    Abstract: In the field of DNA computing, splicing system was proposed by Tom Head in which the splicing operation is used. Various models have been studied with mate operation working on strings. The operations mate and drip considered in membrane computing resemble the operations cut and recombination well known from DNA computing. Recently, a new generative model called Array P system with mate operation has been introduced. In this paper, we incorporate the t - communicating and permitting features in the rules of array P system with mate operation and develop the generating picture languages consisting of picture arrays. This enables us to reduce the number of membranes used in the existing array P system models.
    Keywords: P system; Splicing; Mate operation; t-communication; Permitting Mate operation.

  • Two-Dimensional Double Jumping Finite Automata   Order a copy of this article
    by James Immanuel S, D.G. Thomas 
    Abstract: In this paper, we extend the concept of double jumping automata for string languages recently introduced in the literature to two-dimensional languages, also called as picture languages. The paper is a modification and study of jumping finite automata for two-dimensional languages already introduced in the literature, where they always perform two simultaneous row-jumps over a row of an input array according to the same rule which is defined. The direction of either of the two simultaneous row-jumps is 1) left, 2) right or 3) in either direction. Based on the directions of the two simultaneous jumps, we give the classification of the jumping finite automata for two-dimensional languages. The mutual relationship between the families of languages accepted by the two-dimensional jumping finite automata performing the jumps in the ways as mentioned above are investigated. We also give the comparison of these families with that of local and recognizable families of languages and families of Siromoney matrix languages.
    Keywords: Jumping Automata; Two-Dimensional Arrays; Picture Languages; Double Jumping.

  • Analysis of an M/G/1 retrial queue with Bernoulli vacation, two types of service and starting failure   Order a copy of this article
    by D. Arivudainambi, M. Gowsalya 
    Abstract: The proposed queueing model discusses a single server retrial queueing system subject to a Bernoulli vacation, two types of service and starting failure. The single server provides two types of service in which the customer either chooses type 1 service or type 2 service. The authors assume that while providing service to the arriving customers the server may subject to starting failure. After each service completion the server will take a Bernoulli vacation. For such queueing model the necessary and sufficient condition for steady state have been derived. The model have been solved through use of supplementary variable technique. To validate the proposed model some performance measures, special cases and numerical illustrations have been discussed
    Keywords: Retrial queues; Bernoulli vacation; Starting Failure; two types of service; Steady state; Stochastic decomposition; Performance measures.