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

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

筛选
英文 中文
Evolutionary generation of test data for multiple paths coverage with faults detection 基于故障检测的多路径覆盖测试数据进化生成
2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI: 10.1109/BICTA.2010.5645159
Yan Zhang, D. Gong
{"title":"Evolutionary generation of test data for multiple paths coverage with faults detection","authors":"Yan Zhang, D. Gong","doi":"10.1109/BICTA.2010.5645159","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645159","url":null,"abstract":"The aim of software testing is to find faults in the program under test. Generating test data which can reveal faults is the core issue. Although existing methods of path-oriented testing can generate test data which traverse target paths, they cannot guarantee that the data find the faults in the program. In this paper, we transform the problem into a multi-objective optimization problem with constrains and propose a method of evolutionary generation of test data for multiple paths coverage with faults detection. First, we establish the mathematical model of this problem and then a strategy based on multi-objective genetic algorithms is given. Finally we apply the proposed method in some programs under test and the experimental results validate that our method can find specified faults effectively. Compared with other methods of test data generation for multiple paths coverage, our method has greater advantage in faults detection and testing efficiency.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"1 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":"127597827","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
A parallel type of DNA computing model for graph vertex coloring problem 图顶点着色问题的并行型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.5645325
Jin Xu, Xiaoli Qiang, Kai Zhang, Cheng Zhang, J. Yang, Rongkui Zhang, Hanpin Wang, Yueke Fan, Shudong Wang, Yafei Dong, Zhezhi Wang, Xingui He
{"title":"A parallel type of DNA computing model for graph vertex coloring problem","authors":"Jin Xu, Xiaoli Qiang, Kai Zhang, Cheng Zhang, J. Yang, Rongkui Zhang, Hanpin Wang, Yueke Fan, Shudong Wang, Yafei Dong, Zhezhi Wang, Xingui He","doi":"10.1109/BICTA.2010.5645325","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645325","url":null,"abstract":"A DNA computing model for solving graph vertex coloring problem is proposed in this article. To illustrate the capability of the DNA computing model, a 3-colorable graph with 61 vertices was constructed as an example. Using this model, more than 99% of false solutions were deleted when the initial solution space was established and finally all solutions of the graph were found. Because these operations can be used for any graph with 61 vertices, the searching capability of this model could be up to 0(359). This searching capability is the largest among both electronic and non-electronic computers after the DNA computing model (with searching capability of 0(220) ) proposed by Adleman's research group in 2002.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"1 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":"126439876","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}
引用次数: 5
Tabu search algorithm for solving No-idle permutation Flow Shop Scheduling Problem 无空闲置换流水车间调度问题的禁忌搜索算法
2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI: 10.1109/BICTA.2010.5645167
Wen-Juan Ren, Q. Pan, Jun-qing Li, Jing J. Liang
{"title":"Tabu search algorithm for solving No-idle permutation Flow Shop Scheduling Problem","authors":"Wen-Juan Ren, Q. Pan, Jun-qing Li, Jing J. Liang","doi":"10.1109/BICTA.2010.5645167","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645167","url":null,"abstract":"An effective tabu search algorithm is proposed for solving No-idle permutation Flow Shop Scheduling Problem in this paper. The objective is to minimize the maximum completion time (MakeSpan) of the problem. The Tabu Search Algorithm starts to search from an initial solution generated by the famous NEH heuristic. The dynamic feature of the tabu list length is applied to improve the robustness of the algorithm. In order to further improve the capability of the algorithm, a detailed local search method is introduced. Simulation results show the effectiveness and superiority of the algorithm.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"148 4 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":"130071183","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
On the use of innate and adaptive parts of artificial immune systems for online fraud detection 利用人工免疫系统的先天部分和自适应部分进行在线欺诈检测
2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI: 10.1109/BICTA.2010.5645253
Rentian Huang, H. Tawfik, A. Nagar
{"title":"On the use of innate and adaptive parts of artificial immune systems for online fraud detection","authors":"Rentian Huang, H. Tawfik, A. Nagar","doi":"10.1109/BICTA.2010.5645253","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645253","url":null,"abstract":"This paper describes a hybrid model for online fraud detection of the Video-on-Demand System as an E-commence application, which combines algorithms from the main two distinct viewpoints of the self, non-self theory and danger theory. Our artificial immune based algorithm includes the improved version of negative selection called Conserved Self Pattern Recognition Algorithm (CSPRA) and a recently established algorithm inspired by Danger Theory (DT) called Dendritic Cells Algorithm (DCA). The experimental results based on our Video-on-Demand case study demonstrate that the hybrid approach has a higher detection rate and lower false alarm when compared with the results achieved by only using CSPRA or DCA as individual algorithms.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"25 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":"134216966","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}
引用次数: 5
Small universal asynchronous spiking neural P systems 小型通用异步脉冲神经系统
2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI: 10.1109/BICTA.2010.5645197
L. Pan, Xiangxiang Zeng, Xingyi Zhang
{"title":"Small universal asynchronous spiking neural P systems","authors":"L. Pan, Xiangxiang Zeng, Xingyi Zhang","doi":"10.1109/BICTA.2010.5645197","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645197","url":null,"abstract":"Looking for small universal computing devices is a natural and well investigated topic in computer science. Recently, this topic started to be considered also in the framework of (synchronized) spiking neural P systems. In this work, it is focused on small universal spiking neural P systems working in a non-synchronized manner. Specifically, it is proved that there is an asynchronous spiking neural P system with 76 neurons that is equivalent to a universal register machine for computing functions. As generator of sets of numbers, a universal asynchronous spiking neural P system with 75 neurons is constructed.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"48 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":"127636916","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}
引用次数: 7
Development of 3d landslide dynamic modeling based on DSAF integration system 基于DSAF集成系统的滑坡三维动力学建模研究
2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI: 10.1109/BICTA.2010.5645152
Jiangtao Cheng, E. Yan, Tingting Zhang, X. Hu
{"title":"Development of 3d landslide dynamic modeling based on DSAF integration system","authors":"Jiangtao Cheng, E. Yan, Tingting Zhang, X. Hu","doi":"10.1109/BICTA.2010.5645152","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645152","url":null,"abstract":"3d landslide geological modeling is the prerequisite of geotechnical and engineering geology numerical simulation analysis, and there have not been very direct and efficient software tools to realize this modeling process currently. Taking account of this, a new 3d landslide modeling method is posed from an integrative view in this paper. First, extract the 3d modeling origin data of a specific landslide from its DXF file, and then generate terrain surface and sliding surface grid data by gird interpolation in Surfer software. Second, create solid grid modeling data files by APDL language, and then input them to ANSYS and generate element information file and node coordinate file. Third, produce mesh model transformation file by Fish language, and then input it to FLAC3D to construct 3d landslide numerical model. Through these steps, DSAF integration system dynamic modeling platform is constructed with Visual Basic programming language as control platform and based on the interface technology and secondary development technology between CAD, Surfer, ANSYS and FLAC3D these 4 kinds of software. DSAF integration system can realize seamless connection by using data file as the transmission media. Therefore, 3d dynamic modelling system is developed. This system provides a fast way in 3d landslide modeling for FLAC3D.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"1 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":"130821194","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
A modified particle swarm optimization algorithm for reliability problems 可靠性问题的改进粒子群优化算法
2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI: 10.1109/BICTA.2010.5645107
D. Zou, Jianhua Wu, Liqun Gao, Xin Wang
{"title":"A modified particle swarm optimization algorithm for reliability problems","authors":"D. Zou, Jianhua Wu, Liqun Gao, Xin Wang","doi":"10.1109/BICTA.2010.5645107","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645107","url":null,"abstract":"A modified particle swarm optimization (MPSO) algorithm is proposed to solve reliability problems in this paper. The MPSO modifies the velocity updating of particle swarm optimization (PSO) algorithm. For each particle, its personal best particle and the global best particle are separated to update its velocity, in other words, either its personal best particle or the global best particle is considered for velocity updating, and it is determined by a dynamic probability. In addition, a new inertia weight is introduced into the velocity updating, and it is used to balance the global search and local search. Based on a large number of experiments, the proposed algorithm has demonstrated stronger convergence and stability than the other two PSO algorithms on solving reliability problems. The results show that the MPSO can be an efficient alternative for solving reliability problems.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"46 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":"132674342","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 novel solution for the P2P network observer placement problem on DNA-based supercomputing 基于dna的超级计算P2P网络观测器放置问题的新解决方案
2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI: 10.1109/BICTA.2010.5645333
Guangxue Yue, Xu Zhou, Kenli Li, Renfa Li, Liping Zhao, Xiang Yu
{"title":"A novel solution for the P2P network observer placement problem on DNA-based supercomputing","authors":"Guangxue Yue, Xu Zhou, Kenli Li, Renfa Li, Liping Zhao, Xiang Yu","doi":"10.1109/BICTA.2010.5645333","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645333","url":null,"abstract":"Since the “free-riding” behavior objectively exists in a P2P network, how to precisely determine the “free-riders” in the network is now a key problem. Passive testing method has been the best way of finding the potential faults on the real network at present. The observer placement problem is one of the critical problems that have been played much attention on. The problem has been also proved to be a NP-complete problem. In this paper, a new DNA computing algorithm for the observer placement problem is produced. On the basis of the sticker-based model's solution space and the Adleman-Lipton model's biological operations, the algorithm consists of a pre-treatment algorithm, a vertex composer, a solution space generator, a parallel searcher and an observer placement searcher. Furthermore, we introduced greedy strategy into our new algorithm for reducing the solution space. In an experimental simulation, the algorithm is proved to have better storage utilization and fault tolerant ability.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"19 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":"128865859","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
Study on interaction between ampicillin antibody and detection interfering proteins by computer aided protein-protein docking for biosensor interesting 利用计算机辅助蛋白-蛋白对接技术研究氨苄西林抗体与检测干扰蛋白的相互作用
2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA) Pub Date : 2010-11-29 DOI: 10.1109/BICTA.2010.5645093
Minghua Wang, Jianping Wang
{"title":"Study on interaction between ampicillin antibody and detection interfering proteins by computer aided protein-protein docking for biosensor interesting","authors":"Minghua Wang, Jianping Wang","doi":"10.1109/BICTA.2010.5645093","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645093","url":null,"abstract":"It is important to study non-specific interaction between immobilized biomolecule and interferential proteins for biosensor development and commercialization. The advances in Bioinformatics and computer technology light up the in-depth understand of biological interaction. We use two different protein-protein docking program to simulate the non-specific interaction between ampicillin antibody and HSA (Human Serum Albumin). To evaluate the association probability of antibody active site, different amino acid chains and a well-known specific immune-complex were used to simulation. The result showed that the cluster density of non-specific interaction is smaller than specific interaction between lysozyme and antibody, and dock scores are scattered. The antibody active site is favourable to be influenced by non-specific protein interaction. The interaction strength of special manner was different in specific and non-specific bindings. It provides a probability for detection conditions adjusting improved in control non-specific adsorption of biosensor analytical process.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"8 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":"130602363","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
Symport/antiport P systems with look-ahead mode 具有前瞻性模式的正/反端口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.5645200
Y. Jiang, Shuo Wang, Jinbang Xu
{"title":"Symport/antiport P systems with look-ahead mode","authors":"Y. Jiang, Shuo Wang, Jinbang Xu","doi":"10.1109/BICTA.2010.5645200","DOIUrl":"https://doi.org/10.1109/BICTA.2010.5645200","url":null,"abstract":"The look-ahead is a forbidding condition formalized by a set of forbidden rules that are checked after all assignment of objects to rules are done. The look-ahead mode can decrease the inherent non-determinism of P systems and helps to the practical implementation of P systems on computers. In this work, the computational power of P systems with symport/antiport rules working in the look-ahead mode are investigated. Communication P systems with 3 membranes and the weight of symport and antiport rules being 2 and 1, respectively, working in the look-ahead mode, can recognize any recursively enumerable languages; a characterization of context-sensitive languages is obtained by communication P systems with 2 membranes working in the look-ahead mode.","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":"115461172","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学术官方微信