2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)最新文献_第2页

A Novel Method for Detecting Breast Cancer Location Based on Growing GA-FCM Approach 一种基于生长GA-FCM的乳腺癌定位检测新方法

2019 9th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2019-10-01 DOI: 10.1109/ICCKE48569.2019.8964904

Milad Abaspoor, S. Meshgini, T. Y. Rezaii, A. Farzamnia

{"title":"A Novel Method for Detecting Breast Cancer Location Based on Growing GA-FCM Approach","authors":"Milad Abaspoor, S. Meshgini, T. Y. Rezaii, A. Farzamnia","doi":"10.1109/ICCKE48569.2019.8964904","DOIUrl":"https://doi.org/10.1109/ICCKE48569.2019.8964904","url":null,"abstract":"The main idea of this article is to provide a numerical diagnostic method for breast cancer diagnosis of the MRI images. To achieve this goal, we used the region’s growth method to identify the target area. In the area’s growth method, based on the similarity or homogeneity of the adjacent pixels, the image is subdivided into distinct areas according to the criteria used for homogeneity analysis to determine their belonging to the corresponding region. In this paper, we used manual methods and use of FCM as the function of genetic algorithm fitness. The presented algorithm is performed for 212 healthy and 110 patients. Results show that GA-FCM method have better performance than hand method to select initial points. The sensitivity of presented method is 0.67. The results of the comparison of the fuzzy fitness function in the genetic algorithm with other technique show that the proposed model is better suited to the Jaccard index with the highest Jaccard values and the lowest Jaccard distance. Among the techniques, the presented works well because of the similarity of techniques and the lowest Jaccard distance. Values close to 0.9 are close to 0.8.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"30 1","pages":"238-242"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81313424","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}

引用次数: 0

Scheduling Mixed-criticality Systems on Reconfigurable Platforms 可重构平台上的混合临界系统调度

2019 9th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2019-10-01 DOI: 10.1109/ICCKE48569.2019.8964800

Sadegh Sehhatbakhsh, Yasser Sedaghat

引用次数: 1

An LSTM Auto-Encoder for Single-Channel Speaker Attention System 用于单通道说话人注意系统的LSTM自编码器

2019 9th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2019-10-01 DOI: 10.1109/ICCKE48569.2019.8965084

Mahnaz Rahmani, F. Razzazi

引用次数: 1

Efficiency Improvement of Differential Evolution Algorithm Using a Novel Mutation Method 利用一种新的变异方法提高差分进化算法的效率

2019 9th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2019-10-01 DOI: 10.1109/ICCKE48569.2019.8964840

Milad Ghahramani, Abolfazl Laakdashti

{"title":"Efficiency Improvement of Differential Evolution Algorithm Using a Novel Mutation Method","authors":"Milad Ghahramani, Abolfazl Laakdashti","doi":"10.1109/ICCKE48569.2019.8964840","DOIUrl":"https://doi.org/10.1109/ICCKE48569.2019.8964840","url":null,"abstract":"The differential evolution algorithm is one of the fast, efficient, and strong population-based algorithms, which has extended applications in solving various problems. Although the velocity, power, and efficiency of this algorithm have been demonstrated in solving many optimization problems, this algorithm, like other metaheuristic algorithms, is not guaranteed to achieve the global optimal points of the optimization problems and may be ceased at optimal local points. One of the reasons for stopping the algorithm at the local optimum points is the imbalance between the exploration and exploitation abilities of the algorithm. One of the operators of the differential evolution algorithm, which plays an essential role in establishing the proper balance between the exploitation and exploitation of the algorithm, is the mutation operator. In this paper, a new mutation method is proposed to improve the efficiency of the differential evolution algorithm to make an appropriate balance between the exploitation and exploitation abilities of the algorithm. Comparing the results of the proposed mutation method with other mutation methods indicates that the proposed method has better speed and accuracy convergence rather than other methods, and it can be employed to solve large-scale optimization problems.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"97 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83596751","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}

引用次数: 1

Boost PFC Converter Control using Fractional Order Fuzzy PI Controller Optimized via ICA 基于ICA优化的分数阶模糊PI控制器的升压PFC变换器控制

2019 9th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2019-10-01 DOI: 10.1109/ICCKE48569.2019.8964893

Mohammad Ali Labbaf Khaniki, Amir Hossein Asnavandi, M. Manthouri

引用次数: 6

Persian Sentiment Lexicon Expansion Using Unsupervised Learning Methods 使用无监督学习方法扩展波斯语情感词典

2019 9th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2019-10-01 DOI: 10.1109/ICCKE48569.2019.8964692

Reza Akhoundzade, Kourosh Hashemi Devin

引用次数: 7

An Eligibility Traces based Cooperative and Integrated Control Strategy for Traffic Flow Control in Freeways 基于资格轨迹的高速公路交通流控制协同集成控制策略

2019 9th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2019-10-01 DOI: 10.1109/ICCKE48569.2019.8965184

Seyed Soroosh Tabadkani Aval, Negar Shojaee Ghandeshtani, Parisa Akbari, N. Eghbal, Amin Noori

引用次数: 1

FTHR: Fault Tolerant Hypercube-based Routing for NoCs FTHR: noc基于超立方体的容错路由

2019 9th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2019-10-01 DOI: 10.1109/ICCKE48569.2019.8965117

R. Kourdy, Amir Rajabzadeh

{"title":"FTHR: Fault Tolerant Hypercube-based Routing for NoCs","authors":"R. Kourdy, Amir Rajabzadeh","doi":"10.1109/ICCKE48569.2019.8965117","DOIUrl":"https://doi.org/10.1109/ICCKE48569.2019.8965117","url":null,"abstract":"Network-on-chips are a novel communications infrastructure for decoupling the communication elements from processing cores, with the goal of eliminating the challenges of many cores systems. One of the most important NoCs challenges is fault tolerance. This article tries to resolve the challenge into separate ways i.e., topology and routing. The proposed topology is called fault tolerant Hypercube-base NoC (HNoC) and the proposed routing algorithm is called Fault Tolerant Hypercube-based Routing (FTHR). The FTHR was simulated in a HNoC topology in NS-2 standard simulator. The FTHR was evaluated using 3D to 10D NoCs with 8 to 2014 cores in normal and faulty conditions. The results of the experiments show that the HNoC packet loss by FTHR routing varies between 75.0% and 98.16% depending on the different NoC dimensions. This high degree of fault tolerance is because of router degree and the diversity of paths in HNoC and also applied innovations in the FTHR routing. The results also show that the FTHR routing has reasonable outcome and is capable of tolerance about 100% of router and link faults in permanent and transient timing.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"283 1","pages":"331-338"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76841033","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}

引用次数: 0

Eliminating the Repetitive Motions as a Preprocessing step for Fast Human Action Retrieval 消除重复动作作为快速人体动作检索的预处理步骤

2019 9th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2019-10-01 DOI: 10.1109/ICCKE48569.2019.8965087

Mohsen Ramezani, F. Yaghmaee

{"title":"Eliminating the Repetitive Motions as a Preprocessing step for Fast Human Action Retrieval","authors":"Mohsen Ramezani, F. Yaghmaee","doi":"10.1109/ICCKE48569.2019.8965087","DOIUrl":"https://doi.org/10.1109/ICCKE48569.2019.8965087","url":null,"abstract":"Today, video searching methods dropped behind the growth of using capturing devices. Action retrieval is a new research field which seeks to use the captured human action for searching the videos. As most human actions consist of similar motions which are repeated over time, we seek to propose a method for eliminating the repetitive motions before retrieving the videos. This method, as a preprocessing step, can decrease the volume of the retrieval computations for each video. Here, a function is used to calculate a value per each pixel as its movement energy. Then, CWT (Continuous Wavelet Transform) is used for mapping the response function of the points into the frequency space to find similar motion patterns more easier. The DTW (Dynamic Time Wrapping) is then applied on the new space to find similar frequency patterns (episodes) over time. Finally, one of the similar episodes, i.e. some sequential frames, remains for the retrieval computations and others are eliminated. The proposed method is evaluated on KTH, UCFYT, and HMDB datasets and results indicate the proper performance of the proposed method. Eliminating the repetitive motions results into significant reduction in retrieval computations and time.","PeriodicalId":6685,"journal":{"name":"2019 9th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"104 1","pages":"26-31"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80550242","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}

引用次数: 0

[Copyright notice] (版权)

2019 9th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2019-10-01 DOI: 10.1109/iccke48569.2019.8964673

引用次数: 0