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

2009 Fourth International on Conference on Bio-Inspired Computing最新文献

筛选
英文 中文
Solving multidimensional 0–1 knapsack problem by tissue P systems with cell division 带细胞分裂的组织P系统求解多维0-1背包问题
2009 Fourth International on Conference on Bio-Inspired Computing Pub Date : 2009-11-17 DOI: 10.1109/BICTA.2009.5338106
Juanjuan He, Z. Miao, Zheng Zhang, Xiaolong Shi
{"title":"Solving multidimensional 0–1 knapsack problem by tissue P systems with cell division","authors":"Juanjuan He, Z. Miao, Zheng Zhang, Xiaolong Shi","doi":"10.1109/BICTA.2009.5338106","DOIUrl":"https://doi.org/10.1109/BICTA.2009.5338106","url":null,"abstract":"Tissue P systems with cell division are biologically inspired theoretical models of distributed and parallel computing, which provide the possibility to solve computationally hard problems in polynomial time. In this paper, we present a semi-uniform solution to the multidimensional 0–1 knapsack problem by such kind of devices, which is linear in terms of the number of variables, the number of constraint inequalities, and all coefficients related with variables.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125552620","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
Generic object recognition with biologically-inspired features 具有生物启发特征的通用对象识别
2009 Fourth International on Conference on Bio-Inspired Computing Pub Date : 2009-11-17 DOI: 10.1109/BICTA.2009.5338160
Changxin Gao, N. Sang, Jun Gao, Lamei Zou, Q. Tang
{"title":"Generic object recognition with biologically-inspired features","authors":"Changxin Gao, N. Sang, Jun Gao, Lamei Zou, Q. Tang","doi":"10.1109/BICTA.2009.5338160","DOIUrl":"https://doi.org/10.1109/BICTA.2009.5338160","url":null,"abstract":"In this paper, a set of biologically-inspired features are presented for robust object recognition. The proposed pyramidal feature set is obtained by extracting the geometric relationship of keypoints using a set of biologically inspired templates in different scales. Lifetime is proposed to describe the keypoints. This paper brings together new algorithms, representations, and insights which are quite generic and may well have broader applications in computer vision. The proposed approach has following properties. First, lifetime is applied to describe the stability of the keypoints. Second, the templates, which are used to extract the geometric relationships between the keypoints, are biologically inspired structure information extractors or texture information extractors. Third, the proposed approach successfully achieves an effective trade-off between generalization ability and discrimination ability for object recognition tasks. Promising experimental results on object recognition demonstrate the effectiveness of the proposed method.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128568185","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
Measurement and evaluation of the material metabolism capability in typical Chinese cities 中国典型城市物质代谢能力的测量与评价
2009 Fourth International on Conference on Bio-Inspired Computing Pub Date : 2009-11-17 DOI: 10.1109/BICTA.2009.5338155
Yating Li, Yan Zhang, Shengsheng Li
{"title":"Measurement and evaluation of the material metabolism capability in typical Chinese cities","authors":"Yating Li, Yan Zhang, Shengsheng Li","doi":"10.1109/BICTA.2009.5338155","DOIUrl":"https://doi.org/10.1109/BICTA.2009.5338155","url":null,"abstract":"Based on neoclassical economic theories, such as the production possibility curve (production possibility frontier) and the social welfare indifferent curve, a model to measure urban material metabolism was proposed and an urban development mode was determined in this paper. Taking twelve typical Chinese cities as study subjects, the metabolic flux and eco-efflciency of water, energy and waste were calculated with a measurement model and their metabolic capabilities were evaluated extensively on their eco-efflciency and eco-equity ability. On the basis of material metabolism capability evaluated with the index of eco-efflciency and eco-equity, policymakers can determine the root cause of urban eco-environmental problems and take measures to optimize the process of urban material metabolism to achieve healthy urban ecosystem.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129880328","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
Quantum swarm evolutionary algorithm with time-varying acceleration coefficients for partner selection in virtual enterprise 基于时变加速系数的量子群进化算法的虚拟企业合作伙伴选择
2009 Fourth International on Conference on Bio-Inspired Computing Pub Date : 2009-11-17 DOI: 10.1109/BICTA.2009.5338071
Jian-hua Xiao, Bing-lian Liu
{"title":"Quantum swarm evolutionary algorithm with time-varying acceleration coefficients for partner selection in virtual enterprise","authors":"Jian-hua Xiao, Bing-lian Liu","doi":"10.1109/BICTA.2009.5338071","DOIUrl":"https://doi.org/10.1109/BICTA.2009.5338071","url":null,"abstract":"Partner selection is one of the most critical issue in virtual enterprise, which has been extensively researched in recent years. It is difficult to be solved by the traditional optimization methods for partner selection is a combinatorial optimization problem. In this paper, an improved quantum swarm evolutionary algorithm based on time-varying acceleration coefficients (IQSEA_TVAC) is proposed for partner selection optimization problem. The results of simulation experiments show that the improved algorithm is valid and outperforms the conventional quantum evolutionary algorithm.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130817074","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
A novel cooperative bacterial foraging algorithm 一种新的细菌合作觅食算法
2009 Fourth International on Conference on Bio-Inspired Computing Pub Date : 2009-11-17 DOI: 10.1109/BICTA.2009.5338157
Y. Shao, Hanning Chen
{"title":"A novel cooperative bacterial foraging algorithm","authors":"Y. Shao, Hanning Chen","doi":"10.1109/BICTA.2009.5338157","DOIUrl":"https://doi.org/10.1109/BICTA.2009.5338157","url":null,"abstract":"A variant on the original bacterial foraging optimization (BFO) algorithm, called the cooperative bacterial foraging optimization (CBFO), is proposed in this paper. The results of various experimental studies using a suit of 4 widely used test functions have demonstrated the superiority of the proposed CBFO approach over the other three search techniques.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132267914","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
Model service discovery algorithm based on semantics 建立基于语义的服务发现算法模型
2009 Fourth International on Conference on Bio-Inspired Computing Pub Date : 2009-11-17 DOI: 10.1109/BICTA.2009.5338078
Zhiwu Wang, Yanhui Zhang, Liu Hong, Xueguang Chen
{"title":"Model service discovery algorithm based on semantics","authors":"Zhiwu Wang, Yanhui Zhang, Liu Hong, Xueguang Chen","doi":"10.1109/BICTA.2009.5338078","DOIUrl":"https://doi.org/10.1109/BICTA.2009.5338078","url":null,"abstract":"Model service discovery, according to the requirements and restrictions on function and non-function for target service of the user, finds model service satisfying requirement and restriction of user from service registry through service discovery algorithm. Based on analyzing the traditional service discovery algorithm, this paper brings forward the model service discovery algorithm based on domain ontology and WordNet, which makes up the disadvantage of service discovery algorithm based on domain ontology or lexical ontology so as to efficiently improve the recall ratio and precision ratio of model service discovery.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114148675","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
Spectral clustering for detecting protein complexes in PPI networks 光谱聚类检测蛋白复合物在PPI网络中的应用
2009 Fourth International on Conference on Bio-Inspired Computing Pub Date : 2009-11-17 DOI: 10.1109/BICTA.2009.5338129
Guimin Qin, Lin Gao
{"title":"Spectral clustering for detecting protein complexes in PPI networks","authors":"Guimin Qin, Lin Gao","doi":"10.1109/BICTA.2009.5338129","DOIUrl":"https://doi.org/10.1109/BICTA.2009.5338129","url":null,"abstract":"PPI(Protein-protein interaction) networks decomposition is of great importance for understanding and detecting functional complexes in PPI networks. In this paper, we study spectral clustering for detecting protein complexes, focusing on two open issues in spectral clustering: (i) constructing similarity graphs; (ii) determining the number of clusters. Firstly, we study four similarity graphs to construct graph Laplacian matrices. Then we propose a method to determine the number of clusters based on the properties of PPI networks. A large number of experimental results on DIP and MIPS PPI networks indicate that every similarity graph shows its strengths and disadvantages, and our finding of the number of clusters improves the cluster quality. Finally, compared with several typical algorithms, spectral clustering for detecting protein complexes obtains comparable performance.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"227 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116502204","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 3-coloring problem by tissue P systems with cell separation 用细胞分离的组织P系统解决3-着色问题
2009 Fourth International on Conference on Bio-Inspired Computing Pub Date : 2009-11-17 DOI: 10.1109/BICTA.2009.5338122
Shuo Wang, Z. Miao, Xiaolong Shi, Zheng Zhang
{"title":"Solving 3-coloring problem by tissue P systems with cell separation","authors":"Shuo Wang, Z. Miao, Xiaolong Shi, Zheng Zhang","doi":"10.1109/BICTA.2009.5338122","DOIUrl":"https://doi.org/10.1109/BICTA.2009.5338122","url":null,"abstract":"Tissue P systems are a class of distributed and parallel computing models inspired by intercellular communication and cooperation between neurons. An interesting variant of tissue P systems is known as tissue P systems with cell separation, which is endowed with the ability of generating an exponential workspace in a linear time and in this way getting the possibility to solve computationally hard problems in polynomial time. In this paper, a uniform solution to 3-coloring problem by tissue P systems with cell separation is presented, which is linear in terms of the number of vertices and the number of edges.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124946041","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
Power network planning with ant colony algorithm 基于蚁群算法的电网规划
2009 Fourth International on Conference on Bio-Inspired Computing Pub Date : 2009-11-17 DOI: 10.1109/BICTA.2009.5338087
Xun C. Huang, Z. Liu, X. Huo, Jian Tang, Zhi-An Yan, Huan Qi
{"title":"Power network planning with ant colony algorithm","authors":"Xun C. Huang, Z. Liu, X. Huo, Jian Tang, Zhi-An Yan, Huan Qi","doi":"10.1109/BICTA.2009.5338087","DOIUrl":"https://doi.org/10.1109/BICTA.2009.5338087","url":null,"abstract":"At present, mathematic model for power grid program has more requirement, traditional method can't fulfil it. Ant colony algorithm has been successfully used to solve NP problem in many fields. In this paper, a new ant colony algorithm of improving key parameters to solve power network planning is presented. For a given power network model, this algorithm will find out the best routing path only if it exits. Some examples show that this algorithm is more intelligent and efficient than other ones.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116631006","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 improvement of DNA algorithm to the Directed Shortest Hamilton Path Problem DNA算法对有向最短汉密尔顿路径问题的改进
2009 Fourth International on Conference on Bio-Inspired Computing Pub Date : 2009-11-17 DOI: 10.1109/BICTA.2009.5338114
Zhenye Wang, Qian Zhang, Dong Yafei
{"title":"The improvement of DNA algorithm to the Directed Shortest Hamilton Path Problem","authors":"Zhenye Wang, Qian Zhang, Dong Yafei","doi":"10.1109/BICTA.2009.5338114","DOIUrl":"https://doi.org/10.1109/BICTA.2009.5338114","url":null,"abstract":"DNA computing has a relatively strong computing power. The principle of complementary bases and double-stranded structure of DNA provide a guarantee for varieties of encoding and computing. In this paper, based on the DNA algorithm to the Directed Shortest Hamilton Path Problem by Gao Lin, plasmid screening technology will be applied to solving the SHPP, and a special separation device will be used to separate the solutions to the greatest degree, eliminate unfeasible ones to avoid them further enlarging. According to the experimental methods of molecular biology, we illustrate that the proposed algorithm are very effective and feasible.","PeriodicalId":161787,"journal":{"name":"2009 Fourth International on Conference on Bio-Inspired Computing","volume":"os-23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127689199","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信