发布求助
文献互助 智能选刊 最新文献

2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)最新文献

筛选
英文 中文
Application of cellular automata to simulate the penetration processes of sulfate ion in concrete 应用元胞自动机模拟硫酸盐离子在混凝土中的渗透过程
2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI: 10.1109/BICTA.2010.5645244
Jian Cao, Yuanfeng Wang, Dianjie Zhang
{"title":"Application of cellular automata to simulate the penetration processes of sulfate ion in concrete","authors":"Jian Cao, Yuanfeng Wang, Dianjie Zhang","doi":"10.1109/BICTA.2010.5645244","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645244","url":null,"abstract":"Based on the characteristics of concrete sulfate attack, a two-dimension cellular automata model is developed based on the fundamental theory of cellular automata to simulate the penetration process of sulfate ion in concrete under sulfate attack. The evolution rules of the cellular automata model are validated by comparison with the calculation results from the Fick's second law. Meanwhile, it discusses the essential distinction between the cellular automata model and the Fick's second law in calculation method and characteristics of the sulfate ion corrosion in concrete. By further analysis of the characteristics of sulfate ion's diffusion in different corrosion time in concrete, the calculated results derived from the cellular automata model, in which the changes of sulfate ion's jump probabilities are taken into account, show better correlation with the experimental data than that from the Fick's second law, thereby a new approach is provided for analysis of concrete durability.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116782143","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
The duplicated of partial content detection based on PSO 基于粒子群算法的部分内容检测的复制
2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI: 10.1109/BICTA.2010.5645302
Qingwei Ye, Dongxing Wu, Yu Zhou, Xiaodong Wang
{"title":"The duplicated of partial content detection based on PSO","authors":"Qingwei Ye, Dongxing Wu, Yu Zhou, Xiaodong Wang","doi":"10.1109/BICTA.2010.5645302","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645302","url":null,"abstract":"It is discussed how to detect the duplicated of partial contents between two documents in this paper. There are some algorithms which can detect similarity among documents. But these algorithms cannot detect the duplicated of partial contents in documents. A new effective algorithm of the duplicated of partial contents detection in documents is put forward in this paper. The new algorithm is using PSO algorithm to search the optimized partial contents which is the most similar in two documents. For PSO algorithm, it provides the encoding of the particles. A new related coefficient of strings is defined for strings similarity. And the new evaluation function of PSO is designed based on the related coefficient function. The hybrid mutation PSO algorithm is used for searching the most similar partial contents quickly and accurately. The simulation experiments indicate that the algorithm can search the most similar partial contents in two documents effectively.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"214 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122412076","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
A sweep-heuristic algorithm combined with partition of time and district for large-scale vehicle routing and scheduling problem of pickup and delivery of customers to airport 一种结合时间和区域划分的扫描启发式算法用于大规模车辆路线和客户到机场的接送调度问题
2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI: 10.1109/BICTA.2010.5645314
Bingxing Liu, Jiafu Tang, Yang Yu
{"title":"A sweep-heuristic algorithm combined with partition of time and district for large-scale vehicle routing and scheduling problem of pickup and delivery of customers to airport","authors":"Bingxing Liu, Jiafu Tang, Yang Yu","doi":"10.1109/BICTA.2010.5645314","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645314","url":null,"abstract":"This paper proposes a sweep-heuristic algorithm combined with partition of time and district to solve large-scale single-trip vehicle routing and scheduling problem (VRSP) of pickup and delivery of customers to airport. Firstly, customers with the same pickup time and pickup location are aggregated into customer orders, which are the basic units for consideration in this paper. The customer orders are further classified into sets according to their pickup time range; these sets are sequenced in ascending order of their pickup time. Secondly, with the depot being the center of all customer orders, the whole service area are divided into circulars according to the driving distance. Every circular indicates different time when car keeps an even speed, and it cuts the service areas into several zones, from the center to the border. Thirdly, every time, we choose customer orders located in the inside circulars from earlier sets and the ones in the outside circulars from later sets to form a new set to be optimized. Finally, generate a radial from the center, and scan the circle with the sweep method to gain the optimized results for this set. Repeat the aforementioned processes, until all customer orders have been serviced. Furthermore, by comparing the results under the criteria of minimum cost and maximum customer satisfaction degree, one can verify that the customer satisfaction degree obtained from the former objective is close to the one from the later objective. However, the cost of the former is apparently lower than the later.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122453223","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
P systems with shuffle operation 具有洗牌操作的P系统
2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI: 10.1109/BICTA.2010.5645276
Yunyun Niu, Jinbang Xu, K. Subramanian
{"title":"P systems with shuffle operation","authors":"Yunyun Niu, Jinbang Xu, K. Subramanian","doi":"10.1109/BICTA.2010.5645276","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645276","url":null,"abstract":"Shuffle operation on trajectories is useful in modeling parallel composition of words and languages. In this work, a new class of P systems with shuffle operation is presented. Such a system has language-objects and shuffle-operation rules in its regions. It can be used as a language generator; specifically it is used to generate languages from sets of languages. Some comparison results are obtained, which show that the power of shuffle operation is enlarged in the framework of P systems.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131471173","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
Identification of DNA motifs by two different models 用两种不同的模型鉴定DNA基序
2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI: 10.1109/BICTA.2010.5645090
Caisheng He, X. Dai
{"title":"Identification of DNA motifs by two different models","authors":"Caisheng He, X. Dai","doi":"10.1109/BICTA.2010.5645090","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645090","url":null,"abstract":"The identification of DNA regulatory motifs (transcription factor binding sites) in co-regulated genes is essential for understanding the regulatory mechanisms. Many approaches have been developed for motifs discovery in the past. However, identification of regulatory motifs remains a significant challenge. In our opinion, the best motifs-finding methods may be those which rely on exhaustive enumeration because of their high reliability, whereas exhaustive enumeration becomes problematic for long and subtle motifs. In this paper, we present a new method to improve exhaustive enumeration using two different models. We tested its performance on both synthetic and realistic biological data. It proved to be successful in identifying very subtle motifs. Experiments also showed our method outperformed some popular methods in terms of our experimental data.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128116832","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
Watson-Crick online tessellation automaton and timed Watson-Crick ω-automaton 沃森-克里克在线镶嵌自动机和定时沃森-克里克ω自动机
2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI: 10.1109/BICTA.2010.5645070
M. Samuel, V. Dare
{"title":"Watson-Crick online tessellation automaton and timed Watson-Crick ω-automaton","authors":"M. Samuel, V. Dare","doi":"10.1109/BICTA.2010.5645070","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645070","url":null,"abstract":"Watson-Crick finite automata are language recognizing devices similar to finite automata introduced in DNA computing area. We define Watson-Crick online tessellation automata which works on double-stranded arrays where the two strands relate to each other through a complementary relation inspired by the DNA complementarity. Some computational power of this automaton is dealt with. Also we define timed Watson-Crick ω-automaton and some equivalence results have been established.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134271758","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
Application of Toeplitz matrix in image restoration Toeplitz矩阵在图像恢复中的应用
2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI: 10.1109/BICTA.2010.5645155
Hua Yu, WenQuan Wu, Zhong Liu
{"title":"Application of Toeplitz matrix in image restoration","authors":"Hua Yu, WenQuan Wu, Zhong Liu","doi":"10.1109/BICTA.2010.5645155","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645155","url":null,"abstract":"An image degradation process is considered as equivalent to a linear transformation of original image matrix processed by transfer function and noise, while the image restoration process is equivalent to trying to get the original image using the least squares method. When the transfer function is separable, the problem is transformed into finding the inverse matrix of a Toeplitz matrix. The simulation results verify the validity of the method and analyze its numerical stability.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130322456","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
The combining prediction of the RMB exchange rate series based on diverse architectural artificial neural network ensemble methodology 基于多元建筑人工神经网络集成方法的人民币汇率序列组合预测
2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI: 10.1109/BICTA.2010.5645218
Bo Sun, Chi Xie, Gangjin Wang, Juan Zhang
{"title":"The combining prediction of the RMB exchange rate series based on diverse architectural artificial neural network ensemble methodology","authors":"Bo Sun, Chi Xie, Gangjin Wang, Juan Zhang","doi":"10.1109/BICTA.2010.5645218","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645218","url":null,"abstract":"Motivated by the neural network ensemble approach, this paper puts forward a diverse architectural artificial neural network (ANN) ensemble method to optimize the combining prediction of the RMB exchange rates. On the one hand, four types of architectures are adopted here including multilayer perceptron (MLP), recurrent neural networks (RNNs) to diversify the learning mechanism. On the other hand, the nonparametric kernel smoothing technique is applied to make combining forecasts, which can overcome the drawbacks of traditional methods. The empirical results show that the proposed method has significantly improved the forecasting performance of the optimal single ANNs and random walk model, especially in RMB exchange rate series forecasting.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130327506","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
Online estimating voltage source inverter nonlinearity for PMSM by Adaline neural network 用Adaline神经网络在线估计PMSM电压源逆变器非线性
2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI: 10.1109/BICTA.2010.5645215
Haitao Qin, Kan Liu, Qiao Zhang, A. Shen, Jing Zhang
{"title":"Online estimating voltage source inverter nonlinearity for PMSM by Adaline neural network","authors":"Haitao Qin, Kan Liu, Qiao Zhang, A. Shen, Jing Zhang","doi":"10.1109/BICTA.2010.5645215","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645215","url":null,"abstract":"This paper investigates how to online estimate the voltage source inverter (VSI) nonlinearity by Adaline neural network (ANN) in a permanent magnet synchronous machine (PMSM) drive system. The proposed estimation includes the estimation of PMSM stator winding resistance, inductance and rotor flux linkage and can follow the VSI nonlinearity variation due to the variation of PMSM working condition. Compared with existing literatures, the proposed method is fit for id=0 control and does not need the nominal value of any PMSM parameter and will not suffer from the mismatching between actual parameter value and nominal parameter value. The estimated distorted voltage value due to VSI nonlinearity is used for compensating the drive system and the experimental result shows that it can improve the control performance more significantly compared with existing VSI nonlinearity compensation method.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114260995","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}
引用次数: 3
Enhancing MOEA with component-emphasizing mechanism for multi-objective optimization 用多目标优化的构件强调机制增强MOEA
2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI: 10.1109/BICTA.2010.5645288
Song Yang, Ji Junzhong, Liu Chunnian
{"title":"Enhancing MOEA with component-emphasizing mechanism for multi-objective optimization","authors":"Song Yang, Ji Junzhong, Liu Chunnian","doi":"10.1109/BICTA.2010.5645288","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645288","url":null,"abstract":"Multi-objective optimization is an important and challenging topic in the field of industrial design and scientific research because real-world problems usually involve several conflicting objectives. Since a multi-objective evolutionary algorithms (MOEA) is able to obtain an approximation to the Pareto optimal set and provide substantial information of the tradeoff between objectives, it is becoming one of the most successful methods for multi-objective optimization. Usually, an MOEA generates new trial solutions (offspring) with some candidate decision vectors (parents) to search for the promising areas and make the population evolve towards the Pareto optimal set. Moreover, in the reproduction procedure, most of MOEAs view the decision vector as a whole, and do not recognize the effects of a single component on the new trial solutions. In this paper, we propose the component-emphasizing mechanism for enhancing the search ability of MOEAs. In this mechanism, each component of a decision vector is viewed as an independent factor affecting the quality of the solution. Based on the mechanism, a new MOEA is presented. Finally, the performance of this new algorithm is compared with two other promising MOEAs, namely, NSGA-II and GDE3, on a set of test instances. The experimental results have shown that the proposed algorithm outperforms the others in solution quality and time cost.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114356928","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
首页 上一页 下一页 尾页
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学术官方微信