International Journal of Adaptive and Innovative Systems
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.
International Journal of Adaptive and Innovative Systems (5 papers in press)
Multi-Domain Intelligent System for Document Image Retrieval by Donato Barbuzzi, Alessandro Massaro, Angelo Galiano, Leonardo Pellicani, Giuseppe Pirlo, Matteo Saggese Abstract: This paper presents an experimental analysis on document image retrieval using a multi-domain intelligent system. More specifically, on the same document image, the combination of three different domains: layout, logo and signature is discussed. This new method analyzes every single decision provided by multi-domain system so that, in the training phase, a new sample classified with a dissimilar confidence to the previous trained samples is used to update the system. DTW, Euclidean Distance and Cosine Similarity have been used, respectively for the analysis of layout, logo and signature. Finally, the weighted combination of individual decisions was considered. The experimental results, carried out on 30 rotated forms belonging to 13 different companies, demonstrate the superiority of the proposed approach with respect to single-domain retrieval systems, based on the ANR performance index. The ANR parameter is able to evaluate the multi-domain system. Keywords: Document Management System; Document Image Retrieval; Multi-Expert Intelligent System; Feedback-based strategy; Instance Selection. DOI: 10.1504/IJAIS.2016.10011128
Prediction of Instantaneous Heart Rate Using Adaptive Algorithms by Sarita Kansal, P.P. Bansod, Abhay Kumar Abstract: In this paper, adaptive filter based on adaptive algorithms like Least Mean Square (LMS), Normalized Least Mean Square (NLMS) and Recursive Least Square (RLS) are used for the prediction of instantaneous heart rate in ECG signal. The adaptive algorithms works on the principle of optimizing the least square error by achieving wiener solution. The weights of the filter coefficients are changing, as per the changes in the signal. There is always the issue of selecting parameters of adaptive filter for adaptation, which affects the performance of it. The parameters are like step size, filter length, minimum number of iterations etc. Therefore, the performance of adaptive filter is analyzed by Mean Square Error (MSE) with varying parameters and using different adaptive algorithms. The prediction accuracy is observed by measuring parameter Mean Absolute Error (MAE). The total ten healthy records of ECG are considered to evaluate the performance of adaptive algorithms and results are presented after averaging the results of each record. The simulation results show that the adaptive algorithms NLMS and RLS have faster convergence rate with less number of iteration than LMS but the forecasting accuracy is higher in LMS compared to NLMS and RLS algorithms. The complexity of RLS algorithm is more as it takes the average value of past error, whereas in LMS and NLMS only instantaneous error is considered. Keywords: ECG; Instantaneous Heart Rate; Adaptive Algorithm; LMS; NLMS; RLS.
Designing DNA Code: Quantity and Quality by Bin Wang, Kaiqiang Liu Abstract: With the development of modern technology, traditional computers have reached the physical limit in information storage and parallel computing. In order to meet the needs of large-scale computing, the development of a high-performance computer has become the focus of the scientific community. DNA computing was born with this as one of its objectives. DNA computing is essentially implemented based on a new computational model of DNA molecules. Because of its high parallelism, massive information storage capacity, and low energy consumption, it has attracted the attention of scholars worldwide. The design of DNA code is a critical step in the realization of DNA computing. The quantity and quality of the code can directly affect the accuracy and efficiency of DNA computing. At present, the research direction of DNA code is divided into set design and quality optimization. Set design is to improve the lower bound of the code. Quality optimization makes DNA code meet more constraints. DNA code studies have made the results of DNA computing more reliable. This paper summarizes the code problems in the DNA computing process, the combinatorial constraints that the code needs to satisfy, and the intelligent optimization algorithm used in code. Finally, the problems of DNA code and the future development direction are analyzed. Keywords: DNA computing; DNA code; Combinatorial constraints; Intelligent optimization algorithm.
A Chain Membrane Model with Application in Cluster Analysis by Yuzhen Zhao, Xiyu Liu, Wenxing Sun Abstract: Membrane computing is a kind of bio-inspired parallel distributed computing paradigm which can reduce computational complexity by the strategy of a space-time tradeoff. Traditionally, there are three kinds of membrane computing models (P systems) based on the tree and the graph topological structures. In this paper, a new P system with chain topological structure is proposed which is called the chain P systems. In the chain P systems, membranes, objects and rules are all in the form of chains which can store more information and therefore further improve the computational efficiency. The computational power and efficiency of the chain P systems are analysed. The graph clustering and the ROCK clustering algorithms based on the chain P systems are given as applications. Keywords: Membrane Computing; Membrane Model; Chain P System; Computational Power; Computational Efficiency; Graph Clustering; ROCK Clustering.
Adaptive Spam Filtering System Using Complement Na by Michael Adegoke, Olayide Abass Abstract: Na Keywords: Spam; Spam filtering; complement naïve bayes; adaptive filtering; prior; bias; adaptive; skewedness;filter.