Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Purchase individual online access for 1 year to this journal.
Price: EUR 315.00Impact Factor 2024: 1.7
The purpose of the Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology is to foster advancements of knowledge and help disseminate results concerning recent applications and case studies in the areas of fuzzy logic, intelligent systems, and web-based applications among working professionals and professionals in education and research, covering a broad cross-section of technical disciplines.
The journal will publish original articles on current and potential applications, case studies, and education in intelligent systems, fuzzy systems, and web-based systems for engineering and other technical fields in science and technology. The journal focuses on the disciplines of computer science, electrical engineering, manufacturing engineering, industrial engineering, chemical engineering, mechanical engineering, civil engineering, engineering management, bioengineering, and biomedical engineering. The scope of the journal also includes developing technologies in mathematics, operations research, technology management, the hard and soft sciences, and technical, social and environmental issues.
Authors: Jiang, Bin | Yang, Chao | Wang, Lei | Li, Renfa
Article Type: Research Article
Abstract: Information exchange among people via social network service has produced a mass of communication data, which have been widely used in research on user interaction and information propagation on virtual social networks. The focus of this paper is to investigate the multiplex power-law distributions and retweeting patterns on Twitter platform. To achieve this goal, we analyze the multiplex power-law distributions from relationship network based on unidirectional and bidirectional follow connections and interaction network based on user and tweet entities. Further, we explain the observed features on each network. Additionally, we also explore the emergent pattern of tweet retweeting path and …analyze their generative mechanisms. The observed results show that mining Twitter data from various angles could obtain more interesting discoveries in social networks. Show more
Keywords: Information propagation, social network, power-law distribution
DOI: 10.3233/JIFS-169030
Citation: Journal of Intelligent & Fuzzy Systems, vol. 31, no. 2, pp. 1009-1016, 2016
Authors: Lv, Qi | Niu, Xin | Dou, Yong | Xu, Jiaqing | Xia, Fei
Article Type: Research Article
Abstract: This paper proposes a classification approach for hyperspectral image using the local receptive fields based random weights networks (RWN). Considering the local correlations of spectral features, it is promising to improve the performance of hyperspectral image (HSI) classification by introducing the local receptive fields (LRF). It is the first time to apply such LRF-based RWN structure to HSI classification. The proposed classification framework consists of four layers, i.e., input layer, convolution layer, pooling layer, and output layer. The convolution and pooling layer are used for feature extracting and the last layer is used as the classifier. Experimental results on two …real hyperspectral image datasets have confirmed the effectiveness of the proposed HSI classification method. Show more
Keywords: Hyperspectral image classification, random weights networks, local receptive field
DOI: 10.3233/JIFS-169031
Citation: Journal of Intelligent & Fuzzy Systems, vol. 31, no. 2, pp. 1017-1028, 2016
Authors: Zhan, Yu | Pan, Haiwei | Xie, Xiaoqin | Zhang, Zhiqiang | Li, Wenbo
Article Type: Research Article
Abstract: The high incidence of brain tumor has increased significantly in recent years. It is becoming more and more concernful to discover knowledge through mining medical brain image to aid doctors’ diagnosis. Clustering medical images for Intelligent Decision Support is an important part in the field of medical image mining because there are several technical aspects which make this problem challenging. In this paper, we propose a medical brain image clustering method to find similar pathology images that can assist doctors to analyze the specific disease, discover its potential cause and make more accurate treatment. Firstly, this method represents medical brain …image dataset as a weighted, undirected and complete graph. Secondly, this graph is sparsified so as to describe the similarity of medical images very well. Last but not the least, a graph entropy based clustering method for this sparsified graph is proposed to cluster these medical images. The experimental results show that this method can cluster medical images efficiently and run well in time complexity. The clustering results can better describe the similarity of medical images. Show more
Keywords: Medical image, graph entropy, sparsification, clustering
DOI: 10.3233/JIFS-169032
Citation: Journal of Intelligent & Fuzzy Systems, vol. 31, no. 2, pp. 1029-1039, 2016
Authors: Ouyang, Aijia | Peng, Xuyu | Wang, Qian | Wang, Ya | Truong, Tung Khac
Article Type: Research Article
Abstract: Considering the problems of slow convergence and easily getting into local optimum of invasive weed optimization (IWO) algorithm in finding the optimal solution to large scale global optimization (LSGO) problems, we have proposed an improved IWO (IIWO) algorithm on the basis of the basic IWO algorithm. Concrete adjustments include setting the newborn weed seeds per plant to a fixed number of parameters, changing the initial step and final step to adaptive step, and re-initializing the solution which exceeds the limit value. Meanwhile, through applying the IIWO algorithm to the GPU platform, a parallel IIWO (PIIWO) based on GPU is obtained. …The algorithm not only improves the convergence rate, but also strikes a balance between the global and local search capabilities. The simulation results of solving on the LSGO problems (CEC’ 2010 high-dimensional functions), have shown that, compared with other algorithms, our designed IIWO can yield better performance, faster convergence speed and higher accuracy; whilst the PIIWO has fewer iterations, higher computing accuracy and significant speedup than the serial algorithm IIWO. Show more
Keywords: Adaptive step, fixed population, invasive weed optimization, GPU, large scale global optimization, speedup
DOI: 10.3233/JIFS-169033
Citation: Journal of Intelligent & Fuzzy Systems, vol. 31, no. 2, pp. 1041-1051, 2016
Authors: Zhao, Tong | Jing, Mei
Article Type: Research Article
Abstract: Task scheduling is an important component of parallel and distributed computing. Therefore, it is of theoretical significance and practical value to develop an effective task scheduling algorithm and implement it. For the task scheduling in cloud computing environment, it means that a group of tasks consisting a working load are distributed to a number of computational nodes as per certain implementing time sequence based on scheduling discipline and strategy to short the time needed by the whole task scheduling and to achieve good implementation performance. Divisible task scheduling is one of the important roles in the parallel computation and distributed …computation. In this paper, we studies on a classical algorithm: Uniform Multi-Round (UMR), based on which an improved multi-path divisible task scheduling algorithm: MSUMR (Master Service Uniform Multi-Round) Algorithm is proposed. Such an algorithm could not only ensure the scheduling efficiency when the bandwidth is sufficient but also maximizes the computing efficiency of working node when the available bandwidth is limited. According to the experimental result, this algorithm, compared with such scheduling algorithms as UMR, Multi-Installment (MI) and eXtended Multi-Installment (XMI), is improved in the two aspects of dividing algorithm and task allocation principles, thus short down the number of unused computing nodes during task implementation and making full use of computing resources, indicating batter practical application value. Show more
Keywords: Scheduling algorithm, cloud computing, bandwidth-aware, divisible task
DOI: 10.3233/JIFS-169034
Citation: Journal of Intelligent & Fuzzy Systems, vol. 31, no. 2, pp. 1053-1063, 2016
Authors: Deng, Zuojie | Zhou, Jingli
Article Type: Research Article
Abstract: Nowadays, cloud storage has become an attractive storage scheme for a user to store his files. When a user stores his files on a remote cloud storage system, he cannot make sure whether his files are intact, so he must use some protocol to check the integrity of his files in the cloud storage. To guarantee high availability, some cloud storage servers provide a kind of highly-available service, which stores multiple copies of user files in the cloud storage, and the file owner cannot make sure whether all these copies are intact as well. Some cloud storage servers allow his …users to operate their files online. As the file owner cannot always be online, he must entrust a trusted public data auditor to check his files in the cloud storage. In this work, we investigate the above issues about provable data possession with multi-copy and data dynamics supporting public verification in a cloud storage. We design a kind of authenticated 2-3 tree with ordered leaves and use this kind of tree to organize file block tags. We design a privacy preserving provable data possession scheme with multi-copy and data dynamics which supports public verification, and use a kind of RSA tag to construct this scheme. We apply our scheme to a cloud file backup system. Our theoretical proofs and experiments show that our scheme is feasible and reasonable. Show more
Keywords: Cloud storage, data dynamics, multi-copy, provable data possession, privacy preserving
DOI: 10.3233/JIFS-169035
Citation: Journal of Intelligent & Fuzzy Systems, vol. 31, no. 2, pp. 1065-1078, 2016
Authors: Tang, Xiaoyong | Yang, Xiaopan | Liao, Guiping | Zhu, Xinghui
Article Type: Research Article
Abstract: In the past few years, multi-core processors incorporating four, six, eight, or more cores on a single die have become ubiquitous. Those cores, having their own private caches, often share a higher level cache memory, which leads to compete among different tasks. This can seriously affect the average performance of multi-core systems as the probability of cache hit could be lowered. In realizing this, we study the problem of scheduling bag-of-tasks (BoT) applications with shared cache constraint on multi-core systems. We first use cache space isolation techniques to divide shared caches into partitions. Then, we give a motivational example and …outline the shared cache aware scheduling problem of multi-core systems. Finally, to provide an optimum solution for this problem, we propose a heuristic shared cache contention aware scheduling (SCAS) algorithm on multi-core systems. Our extensive simulation performance evaluation study clearly demonstrate that our proposed SCAS algorithm outperforms the existing traditional scheduling algorithm Min-min and the modified algorithm MSCAS in terms of schedule length and average response time. Show more
Keywords: Cache, Multi-core, task scheduling, schedule length, average response time
DOI: 10.3233/JIFS-169036
Citation: Journal of Intelligent & Fuzzy Systems, vol. 31, no. 2, pp. 1079-1088, 2016
Authors: Pham, Tuan D.
Article Type: Research Article
Abstract: The quantitative categorization of textures according to their visual appearances is an important area of research in computer vision and image understanding, because texture analysis and its applications are found useful in many areas of health, medicine, sciences, and engineering. For the first time, the theory of chaos and fuzzy sets are applied in this paper to measure the spatial dynamics of the texture spectrum. Experiments carried out on the well-known Brodatz texture database suggest the promising application of the method proposed for texture quantification.
Keywords: Texture categorization, spatial dynamics, metric entropy, fuzzy sets
DOI: 10.3233/JIFS-169038
Citation: Journal of Intelligent & Fuzzy Systems, vol. 31, no. 2, pp. 1089-1097, 2016
Authors: Fei, Xiongwei | Li, Kenli | Yang, Wangdong
Article Type: Research Article
Abstract: In the open environment of cloud computing, a large amount of user data needs to be encrypted/decrypted fast to maintain confidentiality and provide high quality of service. Advanced Encryption Standard (AES), the standard encryption algorithm, has better security and efficiency compared to its competitive algorithms, so it is widely used in cloud computing and other fields. However, the implementation of AES based on software still has the problem of low efficiency; whereas the implementation of AES based on hardware needs to purchase special purpose devices. Adopting the method of special instruction sets can resolve the above two drawbacks. Therefore, we …propose a fast parallel cryptographic algorithm, NIPAES, which is based on the AES-NI (New Instructions) instruction set and CPU multiple cores. NIPAES makes use of the block property of AES and the parallel property of Counter (CTR) model, adopts OpenMP to evenly distribute workloads to each thread, which performs AES-NI instructions to complete encryption/decryption. Compared to CPU serial AES based on lookup tables, CPU parallel AES, and serial AES based on AES-NI, NIPAES has significant improvement on performance. The experimental results show that NIPAES achieves the average speedups of 3197.78x, 196.12x, and 7.71x, compared to the other aforementioned algorithms, respectively. Show more
Keywords: Advanced Encryption Standard New Instruction, counter mode, encryption speed, encryption speedup, encryption time, OpenMP, parallel encryption, performance
DOI: 10.3233/JIFS-169039
Citation: Journal of Intelligent & Fuzzy Systems, vol. 31, no. 2, pp. 1099-1107, 2016
Authors: Xiao, Guoqing | Wu, Fan | Zhou, Xu | Li, Keqin
Article Type: Research Article
Abstract: Query processing over uncertain data is very important in many applications due to the existence of uncertainty in real-world data. In this paper, we propose a novel and important query for uncertain data, namely probabilistic top-(k , l ) range (PTR) query, which retrieves l uncertain tuples that are expected to meet score range constraint [s 1 , s 2 ] and have the maximum top-k probabilities but no less than a given probability threshold q . In order to accelerate the PTR query, we present some effective pruning techniques to reduce the search space of PTR query, …which are integrated seamlessly into an efficient PTR query procedure. Extensive experiments over both real-world and synthetic datasets verify the efficiency and effectiveness of our proposed approaches. Show more
Keywords: Data management, probabilistic top-k query, query processing, range query, uncertain data
DOI: 10.3233/JIFS-169040
Citation: Journal of Intelligent & Fuzzy Systems, vol. 31, no. 2, pp. 1109-1120, 2016
Authors: Wang, Nini | Xia, Jun | Yin, Jianchuan | Liu, Xiaodong
Article Type: Research Article
Abstract: Detecting temporal and spatial trends of annual and seasonal land surface temperature (LST) can contribute to study the effect of climate change and climate variability on temperature behaviors both in time and space. The temporal and spatial gridded dataset of monthly mean LST series produced by Berkeley Earth were chosen for the analysis of LST trends. The dynamic programming (DP) based segmentation algorithm is a fast and efficient time series segmentation algorithm which can identify multiple change points in a given time series. Multiple change points of annual and seasonal LST average anomaly time series during the period 1880–2013 (reference …to the 20th century average) were identified by the DP based time series segmentation algorithm. Schwarz’s Bayesian information criterion (BIC) was applied to automatically determine the optimal segmentation order. BIC selected one change point for annual and seasonal average LST except for the autumn season’s. Regardless of the number of change points, at the first segment, trends are always increasing and at the last, they are sharply increasing except for the winter season. Moreover, all the change points locate around El Nin ˜ o years, La Nin ˜ a years, and phase transition years of the Pacific decadal oscillation (PDO). Based on optimal time series segmentation results selected by BIC, the spatial distributions of linear trends (slope estimates) of annual and seasonal LST anomalies corresponding to different homogeneous periods are showed. Comparing to adjacent segment, the recent warming trends not only appear in Greenland and the surrounding area, but also dominate most parts of land surface, and significant warming trends appear in high latitude regions of the Northern Hemisphere. Show more
Keywords: Time series segmentation, temporal-spatial variability, trend analysis, climate change
DOI: 10.3233/JIFS-169041
Citation: Journal of Intelligent & Fuzzy Systems, vol. 31, no. 2, pp. 1121-1131, 2016
Authors: Yu, Jianhang | Zhang, Xiaoyan | Zhao, Zhenhua | Xu, Weihua
Article Type: Research Article
Abstract: The graded rough set and multi-granulation rough set are two significant generalized rough set models which be constructed on the indiscernibility relation. They solve the issues that the degree of overlap between the equivalence class and basic set in different view points of quantitative information. The purpose of this study is that research the good points of graded rough set in the multi-granulation environment which in different granules have different grades based on dominance relation. Three new types of multi-granulation with different grades rough set models are proposed, which include the optimistic, pessimistic and mean multi-granulation with different grades rough …set. Then, their principal structure, basic properties and serval kinds of uncertainty measure methods are investigated as well. Furthermore, an experimental evaluation about urban investment is utilized to verify the proposed properties, which is valuable for applying these theories to deal with practical issues. Show more
Keywords: Different grades, dominance relation, graded rough set, multi-granulation rough set, uncertainty measures
DOI: 10.3233/JIFS-169042
Citation: Journal of Intelligent & Fuzzy Systems, vol. 31, no. 2, pp. 1133-1144, 2016
Authors: Li, Chao | Chu, Xiaogeng | Chen, Yingwu | Xing, Lining
Article Type: Research Article
Abstract: Genetic Algorithms are efficient for the travelling salesman problem, but they have a premature convergence problem resulting in suboptimal solutions. As the initialization step has a profound impact on the algorithm’s performance, this study proposes a knowledge-based initialization technique to learn the patterns of evolved populations, and integrates four heuristic strategies to generate the initial population. Advanced initial solutions and high quality gene blocks can be quickly created with this method. Instances in the TSPLIB library are used to set the parameters and test different initialization methods. The results show that this proposed technique can improve the initial population and …optimization performance of genetic algorithms. Show more
Keywords: Genetic algorithm, travelling salesman problem, initial population, heuristic technique
DOI: 10.3233/JIFS-169043
Citation: Journal of Intelligent & Fuzzy Systems, vol. 31, no. 2, pp. 1145-1152, 2016
Article Type: Research Article
DOI: 10.3233/JIFS-169044
Citation: Journal of Intelligent & Fuzzy Systems, vol. 31, no. 2, pp. 1153-1153, 2016
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl