{"title":"Heuristic and Meta-heuristic Algorithms for the Online Scheduling on Unrelated Parallel Machines with Machine Eligibility Constraints","authors":"Shuang Cai, Qifeng Xun, Ke Liu, Ao Liu","doi":"10.1109/FSKD.2018.8687264","DOIUrl":"https://doi.org/10.1109/FSKD.2018.8687264","url":null,"abstract":"This paper studies the online scheduling on unrelated parallel machines with machine eligibility constraints. The jobs arrive over time and the maximum completion time is the optimization objective. To our best knowledge, the considered problem is never been studied before. Firstly an mathematical model is established. Then, both a heuristic algorithm and a meta-heuristic algorithm are proposed to obtain approximate optimal solutions. The two online algorithms are based on greedy algorithm and machine preference. Finally, the performances of the two proposed online algorithms are compared with an online algorithm based on ERT through extensive experiments, which show that both the two algorithms have effective performances.","PeriodicalId":235481,"journal":{"name":"2018 14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125385337","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":"Particle Filtering Based Visual Attention Model for Moving Target Detection","authors":"Long Liu, Danyang Jing, Xiaojun Chang","doi":"10.1109/FSKD.2018.8686873","DOIUrl":"https://doi.org/10.1109/FSKD.2018.8686873","url":null,"abstract":"visual attention is important research in the field of compute vision, which is widely used in target detection and target tracking. In this paper, a method of moving object detection based on visual attention model and particle filter is proposed. Firstly, the particle weight calculation process is established by using Bayesian theory and visual bidirectional (top-down/bottom-up)fusion method; then, note that the model uses the target motion attention and the target color attention as inputs, and uses the importance sampling, particle weight calculation, resampling, and particle saliency map processing to calculate the saliency of the moving target; Finally, the distribution of particles determines the position of the target. Through testing in different scenes and videos, it is concluded that this method is more accurate and efficient than the traditional method for moving target detection.","PeriodicalId":235481,"journal":{"name":"2018 14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126964874","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 Attribute Reduction Algorithm Based on the Maximum Dependency and Minimum Redundancy of Attribute","authors":"Chenxi Wang, Jiancong Fan","doi":"10.1109/FSKD.2018.8687131","DOIUrl":"https://doi.org/10.1109/FSKD.2018.8687131","url":null,"abstract":"The classical attribute reduction algorithms based on attribute dependence in rough set theory only select attributes which have a larger degree of dependence on decision attribute and don't consider attribute redundancy. This paper points out that only selecting condition attributes with a large degree of dependence on decision attribute is not enough, the redundancy between condition attributes should also be taken into account. In allusion to this matter, an algorithm based on the maximum dependency and minimum redundancy of attribute is presented. The results of experiments which are carried out on the UCI data sets suggest that the presented algorithm has gained favorable results.","PeriodicalId":235481,"journal":{"name":"2018 14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126227357","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":"Design of Structural Active Control with Disturbance Attenuation","authors":"Guo-sheng Wang, Bing Liang","doi":"10.1109/FSKD.2018.8687130","DOIUrl":"https://doi.org/10.1109/FSKD.2018.8687130","url":null,"abstract":"This paper proposes a design method of the active control with disturbance attenuation in some structural systems. Its aim is to design a robust state feedback controller via eigenstructure assingment. Based on a result of parametric eigenstructure assignment, this problem is changed into an optimal problem with some constraints and the corresponding algorithm is proposed. This method utilizes directly the original matrices in the structure systems, thus it is convenient to use in applications. A three-story shearing type model under earthquake excitation is analyzed by using the proposed algorithm and the simulation results show the effectiveness of this proposed algorithm.","PeriodicalId":235481,"journal":{"name":"2018 14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126664834","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":"Fuzzy Assignment Model Of Server In Finite Source Queuing System","authors":"Yanli Meng, Y. Liu, Lidong Wang, Xiaodong Liu","doi":"10.1109/FSKD.2018.8687166","DOIUrl":"https://doi.org/10.1109/FSKD.2018.8687166","url":null,"abstract":"To address the optimal number of servers for maintenance departments, this paper establishes a multi-objective optimization model for maintenance departments, in which triangular fuzzy numbers are employed to characterize the performance measurement of queuing system. Based on the previous model proposed by Khalili, the system is studied to determine most appropriate value for the size of workforce by using the concept of fuzzy relations and inference and fuzzy multiple objective decision making. The performance measurement of queuing system is characterized by triangular fuzzy numbers, which can capture the uncertainty of quenuing system. The decision-making index is determined by the expected utilization rate of servers, the expected degree of acceptability and maintenance-related cost. An example is employed to illustrate the effectiveness and applicability, and the sensitivity analysis is also explored.","PeriodicalId":235481,"journal":{"name":"2018 14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126403056","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}
Shidong Chen, Xiangqun Chen, Junhua Hu, Jun Lu, Zesheng Hu
{"title":"Self-similarity Modeling Research on Information Gathering Service for Power Utilization of Smart Grid","authors":"Shidong Chen, Xiangqun Chen, Junhua Hu, Jun Lu, Zesheng Hu","doi":"10.1109/FSKD.2018.8687280","DOIUrl":"https://doi.org/10.1109/FSKD.2018.8687280","url":null,"abstract":"Given the self-similarity characteristic of the communication traffic-flow in the current information gathering service traffic in power utilization network, a self-similarity modeling method is proposed to quantify the feature analysis of the communication flow for the power information gathering service. Firstly, the flow's characteristic and related course of the information gathering service traffic is analyzed, and a self-similarity model is built by means of combining the multiple ON/OFF flows. Secondly, the Hurst coefficient of the service simulation traffic is estimated using Variance-Time method to quantify the flow's self-similarity with the estimation results of Hurst coefficient. Finally, it discusses the influence of Hurst coefficient is discussed according to the two factors including the acquisition accuracy and the gathering periodic. Experimental results illustrate that the proposed method is effective to model the self-similarity of the information gathering service for the power utilization in Smart Grid.","PeriodicalId":235481,"journal":{"name":"2018 14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124377076","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":"Improved Heuristic Algorithms for UAVs Path Planning in Hazardous Environment","authors":"Zhenghao Li, Peng Yang, Cen Tong, Jiaqi Shen","doi":"10.1109/FSKD.2018.8687134","DOIUrl":"https://doi.org/10.1109/FSKD.2018.8687134","url":null,"abstract":"As the route planning of UAV searching in a risky environment is a complicated combinatorial optimization problem, which is characterized by a variety of unpredictable factors. Heuristic methods can be used to speed up the process of finding a satisfactory solution. In this paper, Greedy algorithm and Q-learning algorithm are designed to efficiently produce high quality results for this problem. Regarding the total risk of the UAV crashing as the objective, a discrete routing model is established. Based on a nonlinear relationship between grid areas and risk, an evaluation optimization model for the UAV is also established, and the value of potential areas is introduced to improve it. The simulation experiments verify that the two algorithms can both reduce the operation time and find the target in less risky situations. Results indicate that the Greedy algorithm is robust, and it exponentially drives toward high-quality solutions in relatively short time. While the Q-learning algorithm prefer to get less risky solution.","PeriodicalId":235481,"journal":{"name":"2018 14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"25 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131376781","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}
Jin Zhang, T. Tian, Xiaofei Liu, Xuanyu Shu, Qiang Li
{"title":"A New Bionic Model and Its Application to Epileptic Electroencephalograph Recognition","authors":"Jin Zhang, T. Tian, Xiaofei Liu, Xuanyu Shu, Qiang Li","doi":"10.1109/FSKD.2018.8687226","DOIUrl":"https://doi.org/10.1109/FSKD.2018.8687226","url":null,"abstract":"Imitating the nervous system is not only an effective method to construct artificial neural networks with better performance, but also a research hotspots. In this paper, a new bionic model stimulating olfactory neural systems, KIII model, is introduced and its performance is researched based on epileptic electroencephalograph (EEG) recognition. In section 2, KIII model is introduced briefly. The structure of the KIII model is similar to that of olfactory neural systems. The model of neurons is based on the real action of neurons with the stimulus and optimized according to mathematical optimization. In section 3, KIII model was used as a classifier and the performance of the KIII model was evaluated to identify epileptic EEG. In the first group of experiments, the features are extracted based on EMD and the recognition rate of the KIII model is over 91 % with few training times. In the second group of experiments, extracting the feature of EEG is unnecessary and the raw EEG signals are used as the input directly. The KIII model gives the better recognition rate over 96 %. Experimental results show that KIII model has remarkable characteristics: (1) KIII model can learn the pattern with few training times, which is different from general deep learning models; (2) KIII model can recognize raw signals without special feature-extracting process, which is similar with deep learning model; (3) the structure of KIII model is very similar to that of real olfactory neural systems, which is partly similar with deep learning model.","PeriodicalId":235481,"journal":{"name":"2018 14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128249162","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}
Keyan Cao, Anchen Miao, Ning Jin, Yuanwei Qi, Ibrahim Musa
{"title":"A Density-based method for Outlier Detecting on Numerical Massive Data","authors":"Keyan Cao, Anchen Miao, Ning Jin, Yuanwei Qi, Ibrahim Musa","doi":"10.1109/FSKD.2018.8687215","DOIUrl":"https://doi.org/10.1109/FSKD.2018.8687215","url":null,"abstract":"As large amounts of data have been generated with the development of the Internet, outliers detecting and effective information obtaining on it become an important issue. For this question, this paper presents a density-based algorithm for numerical attribute anomaly points. A high-density set is selected as the candidate set of clustering centers based on density distribution in order to decrease the times of iterations of k-means algorithm and improve the efficiency, then the initial centers are chosen by the method depending on the maximum distance product. After that, the data is preprocessed by k-means clustering algorithm. The whole process of clustering is combined with MapReduce programming model. A candidate set of abnormal points is obtained from each cluster by appropriate pruning method. At last, the ultimate outliers are determined according to the density-based LOF algorithm. The experimental results show that the maximum-distance-product-based initializing method for clustering centers improves the efficiency of clustering and the algorithm we proposed has better accuracy, expansibility and speedup ratio on outlier detection for numerical attributes.","PeriodicalId":235481,"journal":{"name":"2018 14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130537810","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}
Agustín Alejandro Ortiz Díaz, F. Bayer, F. Baldo, Alberto Verdecia-Cabrera, L. M. Mariño, Isvani Inocencio Frías Blanco
{"title":"Fast Adaptive Stacking of Ensembles Adaptation for Supporting Active Learning. a Real Case Application","authors":"Agustín Alejandro Ortiz Díaz, F. Bayer, F. Baldo, Alberto Verdecia-Cabrera, L. M. Mariño, Isvani Inocencio Frías Blanco","doi":"10.1109/FSKD.2018.8686851","DOIUrl":"https://doi.org/10.1109/FSKD.2018.8686851","url":null,"abstract":"Algorithms for mining stream data have received a lot of attention in the last decade. In general, several of these algorithms require labeled instances for training because they are designed for supervised learning. However, in many real activities, labelled process involves overspending of resources. Due to this, active learning and other learning paradigms have proposed reducing the cost of labeling instances without a significant loss of model performance. In this paper we adapt Fast Adaptive Stacking of Ensembles (FASE), an ensemble method for learning from non-stationary data streams, to the active learning paradigm. This new version, called FASE-AL, was assessed by classifying the Joinville roads into paved and unpaved roads. The assessment data is emitted by a device placed in the public transport buses. FASE-AL obtained better percentage of correctly classified instances compared with other classical algorithms. The results are shown on a map which can be used by the public transport companies in the preparation of buses maintenance plan and route planning decisions, for instance.","PeriodicalId":235481,"journal":{"name":"2018 14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134230651","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}