2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)最新文献_第9页

A scheduling algorithm in the randomly heterogeneous multi-core processor 随机异构多核处理器中的调度算法

2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) Pub Date : 2016-08-01 DOI: 10.1109/FSKD.2016.7603512

Yan Liu, Yongwei Li, Yihong Zhao, Xiao-Mou. Chen

{"title":"A scheduling algorithm in the randomly heterogeneous multi-core processor","authors":"Yan Liu, Yongwei Li, Yihong Zhao, Xiao-Mou. Chen","doi":"10.1109/FSKD.2016.7603512","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603512","url":null,"abstract":"The increasing scale of multi-core processors are likely to be randomly heterogeneous by design or because of diversity and flaws. The latter type of heterogeneity introduced by some unforeseen variable factors such as the manufacturing process variation is especially challenging because of its unpredictability. In this environment, thread scheduler and global power manager must handle such randomly heterogeneous. Furthermore, these algorithms must supply high efficiency, scalability and low overhead because future multi-core processors may have a number of cores on a single die. This paper presents a variation-aware scheduling algorithm for application scheduling and power management. Thread switching and sampling among different cores in the multi-core processor introduce obvious overhead than previous many-core scheduling algorithms. Proposed scheme records the information of swapped thread of preferential core and uses tabu search-based randomly heterogeneous scheduling algorithm(TSR) to avoid the occurrence of repeated sampling and reduce the migration frequency and sampling frequency of a thread. The experimental results show that TSR algorithm has decreased 45.7% of thread migration and 42.2% of the sampling time as compared with local search algorithm. This paper regards the transcendental Hungarian offline scheduling algorithm as the baseline. ED2 of TSR only decrease by 8.58% as compared with that of Hungarian offline scheduling algorithm, but compared with the random search scheduling algorithm, ED2 of TSR decreased by 39.4%.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122685963","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}

引用次数: 2

A hybrid projection decomposition algorithm for dual-energy computed tomography 双能计算机断层扫描的混合投影分解算法

2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) Pub Date : 2016-08-01 DOI: 10.1109/FSKD.2016.7603375

Lei Li, Linyuan Wang, Xiaoqi Xi, Bin Yan, Yanmin Sun

{"title":"A hybrid projection decomposition algorithm for dual-energy computed tomography","authors":"Lei Li, Linyuan Wang, Xiaoqi Xi, Bin Yan, Yanmin Sun","doi":"10.1109/FSKD.2016.7603375","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603375","url":null,"abstract":"Dual Energy Computed Tomography (DECT) has recently gained significantly research interest because of its ability of object separation, contrast enhancement, artifact reduction and material composition assessment. Aiming for the nonlinear projection decomposition problem in DECT image reconstruction, a hybrid projection decomposition algorithm is proposed with combination of iterative method and isotransmission fitting method. Firstly, the nonlinear projection aquation for a given polychromatic projection value is transformed to linear equation plus a nonlinear pertubative item for single variable to speed up the iteration speed and avoid non-convergence. Secondly, a linear approximation fitting model of iso-transmission line is built for high and low energy projection with iso-transmission point pairs solved above. Then the high and low energy projection joint nonlinear solving problem is transformed into solving high and low energy projection iso-transmission line intersection problem, so as to realize the fast decomposition of dual energy projection. Finally, local searching near the intersection of projection matching is used to compensate the error of linear approximation fitting to get more accurate decomposition result. The accuracy and efficiency of the proposed method are demonstrated by numerical simulation.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122746603","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

Solving the shortest-path problem in logistics distribution for vehicle-routing optimization 求解物流配送中最短路径问题的车辆路径优化

2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) Pub Date : 2016-08-01 DOI: 10.1109/FSKD.2016.7603219

Baoxian Jia, Yong Wang, Jinhai Yuan, Jun-qing Li

引用次数: 0

An optimal bandwidth resource utilization scheme in IEEE 802.16m communication networks IEEE 802.16m通信网络中带宽资源的最优利用方案

2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) Pub Date : 2016-08-01 DOI: 10.1109/FSKD.2016.7603486

Hanwu Wang, Liang An, Beibei Yang, Tao Yu

引用次数: 0

The separation of high resolution remote sensing images based on dictionary learning 基于字典学习的高分辨率遥感图像分离

2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) Pub Date : 2016-08-01 DOI: 10.1109/FSKD.2016.7603479

H. Wang

引用次数: 0

Gaussian kernel particle swarm optimization clustering algorithm 高斯核粒子群优化聚类算法

2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) Pub Date : 2016-08-01 DOI: 10.1109/FSKD.2016.7603174

Shengyu Pei, Lang Tong

引用次数: 3

Competitive recommendation algorithm for E-commerce 电子商务竞争推荐算法

2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) Pub Date : 2016-08-01 DOI: 10.1109/FSKD.2016.7603404

Umutoni Nadine, Huiying Cao, Jiangzhou Deng

引用次数: 6

A ripple-spreading algorithm to calculate the k shortest paths in a network with time-windows 带时间窗网络中k条最短路径的纹波扩散算法

2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) Pub Date : 2016-08-01 DOI: 10.1109/FSKD.2016.7603203

Xiao-Bing Hu, Ming-Kong Zhang, Jian-Qin Liao, Hailin Zhang

{"title":"A ripple-spreading algorithm to calculate the k shortest paths in a network with time-windows","authors":"Xiao-Bing Hu, Ming-Kong Zhang, Jian-Qin Liao, Hailin Zhang","doi":"10.1109/FSKD.2016.7603203","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603203","url":null,"abstract":"This paper is concerned with finding the k shortest routes or paths in a network where each node has some specific time windows only within which is the node accessible. Because of such time windows at nodes, classical methods for the k shortest paths problem (k-SPP) is not applicable to the k shortest paths problem in a time-window network (k-SPPTW). Taking inspiration from the natural ripple-spreading phenomenon, we propose a novel ripple-spreading algorithm (RSA) for the k-SPPTW. By conducting a purpose-designed ripple relay race in a time-window network, the reported RSA can resolve not only one-to-one k-SPPTW, but also one-to-all k-SPPTW, where all the k shortest paths from a given source node to every other node in the network need to be found. The computational complexity of RSA is just 0(k×NATU×NL), where NL is the number of links in the network, and NATU is the average simulated time units for a ripple to travel through a link. Experimental results demonstrate the effectiveness and efficiency of the proposed RSA for the k-SPPTW.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125901411","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}

引用次数: 4

Evaluations of network coding-based scheduling approach for wireless data disseminations with time constraints 时间约束下基于网络编码的无线数据传播调度方法的评估

2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) Pub Date : 2016-08-01 DOI: 10.1109/FSKD.2016.7603487

Chunting Yan, Shujuan Wang

引用次数: 0

Real time facial expression recognition app development on mobile phones 手机实时面部表情识别应用开发

2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) Pub Date : 2016-08-01 DOI: 10.1109/FSKD.2016.7603442

Humaid Alshamsi, H. Meng, Maozhen Li

{"title":"Real time facial expression recognition app development on mobile phones","authors":"Humaid Alshamsi, H. Meng, Maozhen Li","doi":"10.1109/FSKD.2016.7603442","DOIUrl":"https://doi.org/10.1109/FSKD.2016.7603442","url":null,"abstract":"Facial expression has made significant progress in recent years with many commercial systems are available for real-world applications. It gains strong interest to implement a facial expression system on a portable device such as tablet and smart phone device using the camera already integrated in the devices. It is very common to see face recognition phone unlocking app in new smart phones which are proven to be hassle free way to unlock a phone. Implementation a facial expression system in a smart phone would provide fun applications that can be used to measure the mood of the user in their daily life or as a tool for their daily monitoring of the motion in phycology studies. However, traditional facial expression algorithms are normally computing extensive and can only be implemented offline at a computer. In this paper, a novel automatic system has been proposed to recognize emotions from face images on a smart phone in real-time. In our system, the camera of the smart phone is used to capture the face image, BRIEF features are extracted and k-nearest neighbor algorithm is implemented for the classification. The experimental results demonstrate that the proposed facial expression recognition on mobile phone is successful and it gives up to 89.5% recognition accuracy.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129723652","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}

引用次数: 25