2014 10th International Conference on Natural Computation (ICNC)最新文献

筛选
英文 中文
Identifying minimally redundant wavenumbers for vibrational microspectroscopic image analysis 识别振动显微光谱图像分析的最小冗余波数
2014 10th International Conference on Natural Computation (ICNC) Pub Date : 2014-12-08 DOI: 10.1109/ICNC.2014.6975950
Qiaoyong Zhong, D. Niedieker, Dennis Petersen, K. Gerwert, A. Mosig
{"title":"Identifying minimally redundant wavenumbers for vibrational microspectroscopic image analysis","authors":"Qiaoyong Zhong, D. Niedieker, Dennis Petersen, K. Gerwert, A. Mosig","doi":"10.1109/ICNC.2014.6975950","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975950","url":null,"abstract":"Recent approaches to multispectral microscopy such as infrared, Raman and CARS microscopy produce large amounts of high-dimensional spectra at high spatial resolution. In this context, we propose and validate a method for unsupervised feature selection. Unsupervised feature selection is of relevance in several applications of multispectral imaging techniques, most notably in reducing the measurement time of CARS microscopic experiments. Our feature selection is based on minimizing a mutual-information based measure of redundancy, and can be seen as the unsupervised version of the well established minimal-redundancy-maximal-relevance approach to supervised feature selection. We compare our approach to previously proposed unsupervised feature selection approaches and demonstrate its advantages on two types of multispectral imaging techniques as well as on synthetic data.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"1652 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115839649","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
The application of Elman recurrent neural network model for forecasting consumer price index of education, recreation and sports in Yogyakarta Elman递归神经网络模型在日惹市教育、娱乐和体育消费物价指数预测中的应用
2014 10th International Conference on Natural Computation (ICNC) Pub Date : 2014-12-08 DOI: 10.1109/ICNC.2014.6975833
D. U. Wutsqa, R. Kusumawati, R. Subekti
{"title":"The application of Elman recurrent neural network model for forecasting consumer price index of education, recreation and sports in Yogyakarta","authors":"D. U. Wutsqa, R. Kusumawati, R. Subekti","doi":"10.1109/ICNC.2014.6975833","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975833","url":null,"abstract":"Recurrent neural network is a network which provides feedback connections. This network is believed to have a more powerful approach than the typical neural network for learning given data. The current research was aimed to apply the simplest recurrent neural network model, namely the Elman recurrent neural network (ERNN) model, to the consumer price index (CPI) of education, recreation, and sports data in Yogyakarta. The pattern of CPI data can be categorized as a function of time period, which tends to move upwards when the time period is increased, and jump at some points of the time period. This pattern was identified as similar to the pattern resulted by the function of the truncated polynomial spline regression model (TPSR). Hence, this research considered ERNN model which the inputs such as in the TPSR model were established by taking into account the location of the knot or jump points. In addition, the ERNN model with a single input, a time period was also generated. The results demonstrated that the two models have high accuracy both in training and testing data. More importantly, it was found that the first model is more appropriate than the second one in testing data.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123123959","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}
引用次数: 12
An efficient coding scheme for surveillance videos based on high efficiency video coding 一种基于高效视频编码的高效监控视频编码方案
2014 10th International Conference on Natural Computation (ICNC) Pub Date : 2014-12-08 DOI: 10.1109/ICNC.2014.6975958
Jianfu Wang, Lanfang Dong
{"title":"An efficient coding scheme for surveillance videos based on high efficiency video coding","authors":"Jianfu Wang, Lanfang Dong","doi":"10.1109/ICNC.2014.6975958","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975958","url":null,"abstract":"As the latest coding standard, High Efficiency Video Coding (HEVC) has an obvious advantage in coding efficiency. Compared to H.264 Advanced Video Coding (H.264/AVC), HEVC can achieve about 50% bitrate reduction at the same subjective video quality. However, the enhancement in compression efficiency has been achieved at the cost of large increase in computational complexity. In this paper, to reduce the computational complexity, we propose a new coding scheme for surveillance videos using inter-frame difference to encode different image areas with different encoder options. The scheme is implemented through the proposed fast Coding Unit (CU) size decision algorithm. With using the luma component of difference image, the proposed algorithm can segment out moving objects from background, and then select proper CU size for different areas. Experimental results show that the encoding complexity can be reduced by an average of 45% with small increment in bitrate and negligible loss in Peak Signal to Noise Ratio (PSNR) compared to the High efficiency video coding test Model (HM) 9.2 reference software. Furthermore, the proposed scheme is not only applied to surveillance videos recorded by static cameras, but also applied to regular videos with excellent coding performance.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134189351","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
Synthesis of reversible logic circuit using a species conservation method 用种守恒法合成可逆逻辑电路
2014 10th International Conference on Natural Computation (ICNC) Pub Date : 2014-12-08 DOI: 10.1109/ICNC.2014.6975910
Xiaoxiao Wang, L. Jiao
{"title":"Synthesis of reversible logic circuit using a species conservation method","authors":"Xiaoxiao Wang, L. Jiao","doi":"10.1109/ICNC.2014.6975910","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975910","url":null,"abstract":"This paper aims to propose a modified species conservation technique for reversible logic circuits synthesis which is characterized by multimodal and large search space. The species conservation technique is tailored to adapt the uncertainty caused by the variable length representation. The different species is divided according to a new similarity definition and the similarity threshold is dynamically adjusted with the increasing of the chromosome length to ensure the search space exploring. A species elimination and restart search are conducted to avoid redundant search when a species converged. The same reproduction probability, other than that proportionate to its ranking, is given to different species. Experiments have been performed on a series of benchmark test functions. Comparison is primarily conducted to show the superior performance different to the basic evolutionary algorithm without species conservation mechanism and the original species conservation method.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132537787","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
Matching optimization of ship engine propeller and net for the trawler based on genetic algorithm 基于遗传算法的拖网渔船船舶发动机、螺旋桨与网的匹配优化
2014 10th International Conference on Natural Computation (ICNC) Pub Date : 2014-12-08 DOI: 10.1109/ICNC.2014.6975906
Li Ren, Y. Diao
{"title":"Matching optimization of ship engine propeller and net for the trawler based on genetic algorithm","authors":"Li Ren, Y. Diao","doi":"10.1109/ICNC.2014.6975906","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975906","url":null,"abstract":"Matching performance of ship engine propeller and net has a significant impact on propulsion efficiency for the trawler. In this paper, an improved genetic algorithm (GA) based on the particle swarm algorithm (PSO) is developed for matching optimization of ship engine propeller and net. Based on ship theory, the matching performance of ship engine propeller and net is analyzed. Considering the angular speed, picth ratio and disk ratio of propeller, a mathematical model is constructed in which the open-water propeller efficiency is taken as the objective function for matching optimization of ship engine propeller and net. The improved GA is presented to solve it, in which the PSO operator is introduced to the GA for the diversity of populations. The effectiveness of the approach is illustrated by a matching optimization example of ship engine propeller and net for the trawler.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133047289","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
Graph based K-nearest neighbor minutiae clustering for fingerprint recognition 基于图的k近邻聚类指纹识别
2014 10th International Conference on Natural Computation (ICNC) Pub Date : 2014-12-08 DOI: 10.1109/ICNC.2014.6975917
Vaishali S. Pawar, M. Zaveri
{"title":"Graph based K-nearest neighbor minutiae clustering for fingerprint recognition","authors":"Vaishali S. Pawar, M. Zaveri","doi":"10.1109/ICNC.2014.6975917","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975917","url":null,"abstract":"The graph is an efficient data structure to represent multi-dimensional data and their complex relations. Pattern matching and data mining are the two important fields of computer science. Pattern matching finds a particular pattern in the given input where as data mining deals with selecting specific data from the huge databases. This work contributes towards the combination of graph theory, pattern recognition and graph based databases. A variety of graph based techniques have been proposed as a powerful tool for pattern representation and classification in the past years. For a longer time graphs remained computationally expensive tool. But recently the graph based structural pattern recognition and image processing is becoming popular. The computational complexity of the graph based methods is becoming feasible due to high end new generations of the computers and the research advancements. In this work we have implemented graph based fingerprint recognition algorithm. The fingerprints are represented as attributed relational graphs. In the pattern recognition phase graph matching is applied. This study focuses on the clustering of graph databases prior to graph matching. When the structural feature set size of the data grows longer, graph matching becomes expensive. The clustering of graph databases drastically reduce the graph matching candidates.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"7 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114019869","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}
引用次数: 10
An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints 三维载荷约束下有能力车辆路径问题的局部演化搜索
2014 10th International Conference on Natural Computation (ICNC) Pub Date : 2014-12-08 DOI: 10.1109/ICNC.2014.6975835
Lijun Wei, Zhenzhen Zhang, A. Lim
{"title":"An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints","authors":"Lijun Wei, Zhenzhen Zhang, A. Lim","doi":"10.1109/ICNC.2014.6975835","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975835","url":null,"abstract":"This paper introduces and solves a new practical variant of integrated routing and loading problem called the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints (3L-FCVRP). This problem requires to design routes for a fleet of homogeneous vehicles located at the central depot to serve all customers, whose demand are formed by a set of three-dimensional, rectangular, weighted items. Different from the well-studied problem: capacitated vehicle routing problem with 3D loading constraints (3L-CVRP) in literature, the objective of 3L-FCVRP is to minimize the total fuel consumption instead of travel distance. The fuel consumption rate is assumed to be proportionate to the total weight of the vehicle. A route is feasible only if a feasible loading plan to load the demanded items into the vehicle exists and the loading plan must satisfy a set of practical constraints. To solve this problem, the evolutionary local search (ELS) framework incorporating with recombination method is employed to explore the solution space and an open space based heuristic is used to examine the feasibility of solutions. To verify the effectiveness of our approach, we first test ELS on the instances of 3L-CVRP, which can be seen as a special case of 3L-FCVRP. The results demonstrate that ELS outperforms all existing approaches on average and improves the best known solutions for most of the instances. Then, we generated data for 3L-FCVRP and reported the detailed results of ELS for future comparisons.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116392162","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}
引用次数: 61
NORA circuit design using neuron-MOS transistors 采用神经元- mos晶体管的NORA电路设计
2014 10th International Conference on Natural Computation (ICNC) Pub Date : 2014-12-08 DOI: 10.1109/ICNC.2014.6975831
G. Hang, Xuanchang Zhou, Yang Yang, Danyan Zhang
{"title":"NORA circuit design using neuron-MOS transistors","authors":"G. Hang, Xuanchang Zhou, Yang Yang, Danyan Zhang","doi":"10.1109/ICNC.2014.6975831","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975831","url":null,"abstract":"A No Race (NORA) dynamic logic using neuron-MOS transistor is presented. The circuit is designed using the n-channel neuron-MOS transistor instead of the nMOS logic block or pMOS logic block in the conventional NORA dynamic logic circuit. The proposed full-adder shows that the logic block of NORA circuit can be simplified by utilizing neuron-MOS transistor. A simple synthesis technique of the n-channel neuron-MOS logic block by employing summation signal is discussed. HSPICE simulation results using TSMC 0.35μm 2-ploy 4-metal CMOS process with 1.5V power supply, have verified the effectiveness of the proposed neuron-MOS-based NORA circuits. For comparison, the power consumption and the output delay of the proposed NORA adders are measured during the simulations.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121826460","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
Using WebSocket-based technology to build real-time meteorological wireless sensor network information publishing platform 利用基于websocket的技术构建实时气象无线传感器网络信息发布平台
2014 10th International Conference on Natural Computation (ICNC) Pub Date : 2014-12-08 DOI: 10.1109/ICNC.2014.6975834
Leiyue Yao, D. Xu, Weijian Zhang, Jie Zhou
{"title":"Using WebSocket-based technology to build real-time meteorological wireless sensor network information publishing platform","authors":"Leiyue Yao, D. Xu, Weijian Zhang, Jie Zhou","doi":"10.1109/ICNC.2014.6975834","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975834","url":null,"abstract":"According to the specific business requirements of the meteorological wireless sensor network (MWSN), we analyze and summarize the principles and problems of the existing Web real-time communication technology, and put forward the real-time meteorological information publishing platform (RT-MIPP) solution based on WebSocket. We first analyze and classify the observational data of MWSN, and design the meteorological information packet format. On this basis, the overall framework design of middleware server (MWServer) is established, the functions of each module are described in detail, and the specific design of MWServer software platform is given. At the same time, through the comparison of all kinds of real-time Web communication technology, the WebSocket significant advantages in low-latency and low network throughput is obtained, and the information Web publishing platform is designed. Actual operating results show that, using .NET and WebSocket technology, greatly improve the performance of system in realtime, versatility and flexibility, simplify the process of later modifications and maintenance, and achieve the expected effect of the authors.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123556571","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
A fast genetic algorithm for solving the maximum clique problem 求解最大团问题的快速遗传算法
2014 10th International Conference on Natural Computation (ICNC) Pub Date : 2014-12-08 DOI: 10.1109/ICNC.2014.6975933
Suqi Zhang, Jing Wang, Qing Wu, Jin Zhan
{"title":"A fast genetic algorithm for solving the maximum clique problem","authors":"Suqi Zhang, Jing Wang, Qing Wu, Jin Zhan","doi":"10.1109/ICNC.2014.6975933","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975933","url":null,"abstract":"Aiming at the defects of Genetic Algorithm (GA) for solving the Maximum Clique Problem (MCP) in more complicated, long-running and poor generality, a fast genetic algorithm (FGA) is proposed in this paper. A new chromosome repair method on the degree, elitist selection based on random repairing, uniform crossover and inversion mutation are adopted in the new algorithm. These components can speed up the search and effectively prevent the algorithm from trapping into the local optimum. The algorithm was tested on DIMACS benchmark graphs. Experimental results show that FGA has better performance and high generality.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125003475","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}
引用次数: 6
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书