2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)最新文献_第3页

Extracting functional subgroups from an evolutionary robotic swarm by identifying the community structure 通过识别群体结构，从进化机器人群体中提取功能亚群

2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC) Pub Date : 2012-11-01 DOI: 10.1109/NaBIC.2012.6402248

K. Ohkura, T. Yasuda, Y. Matsumura

引用次数: 2

What's going on out there right now? A beehive based machine to give snapshot of the ongoing stories on the Web 现在外面发生什么事了?一个基于蜂箱的机器，可以提供网络上正在进行的故事的快照

2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC) Pub Date : 2012-11-01 DOI: 10.1109/NaBIC.2012.6402257

P. Návrat, Stefan Sabo

引用次数: 5

Data fusion in electronic tongue for qualitative analysis of beers 啤酒定性分析中电子舌的数据融合

2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC) Pub Date : 2012-11-01 DOI: 10.1109/NaBIC.2012.6402240

J. M. Gutiérrez-Salgado, Laura Moreno-Barón, Xavier Cetó, A. Mimendia, M. Valle

引用次数: 2

A system for building immunity in social networks 在社交网络中建立免疫力的系统

2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC) Pub Date : 2012-11-01 DOI: 10.1109/NaBIC.2012.6402234

Heena Rathore, A. Samant

{"title":"A system for building immunity in social networks","authors":"Heena Rathore, A. Samant","doi":"10.1109/NaBIC.2012.6402234","DOIUrl":"https://doi.org/10.1109/NaBIC.2012.6402234","url":null,"abstract":"Social networks are susceptible to rapid spread of malicious information, commonly referred to as rumors. Rumors often spread rapidly through the network and, if not contained quickly, can be harmful. This paper describes a method for identifying highly connected nodes in a social network and using these nodes to build immunity against such malicious information. To describe this method, this paper draws inspiration from two well established topics in the area of biology; spread of communicable diseases in human population and how human body builds immunity against diseases. In case of communicable diseases, it would be very simplistic if we only consider that an infected node can transmit its disease to its nearest neighbors. More realistically speaking, it is possible that an infected node can develop random links with other nodes in the system. The spread of communicable diseases is controlled by both these factors. An infected node with capability to have several random links is capable of spreading the disease through the network faster. We postulate that certain nodes in a social network exhibit similar behavior and can be defined as highly connected nodes in the network. We present analytical tools based on our network simulation, to correctly identify such nodes. Once such nodes are identified, we introduce the concept of weighting functions that can be attached to messages passing through such nodes. This paper describes how the spread of malicious information can be controlled by a community of such highly connected nodes, using the concept of weighted functions.","PeriodicalId":103091,"journal":{"name":"2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122509883","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

An EDA based on Bayesian networks constructed with Archimedean copulas 基于阿基米德copula构造贝叶斯网络的EDA

2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC) Pub Date : 2012-11-01 DOI: 10.1109/NaBIC.2012.6402260

Mario Rogelio Flores Mendez, Ricardo Landa

引用次数: 3

Multi-apprentice learning for meta-heuristics parameter tuning in a Multi Agent Scheduling System 多智能体调度系统中元启发式参数调整的多学徒学习

2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC) Pub Date : 2012-11-01 DOI: 10.1109/NaBIC.2012.6402236

I. Pereira, A. Madureira, Paulo Moura Oliveira

引用次数: 1

Practical results of artificial immune Systems for combinatorial optimization problems 人工免疫系统在组合优化问题中的应用结果

2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC) Pub Date : 2012-11-01 DOI: 10.1109/NaBIC.2012.6402261

P. Krömer, J. Platoš, V. Snás̃el

引用次数: 3

Applying genetic self-architecting for distributed systems 在分布式系统中应用遗传自架构

2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC) Pub Date : 2012-11-01 DOI: 10.1109/NaBIC.2012.6402238

Hadaytullah, S. Vathsavayi, Outi Räihä, K. Koskimies, A. Gregersen

引用次数: 3

A transgenic algorithm for the Vehicle Routing Problem with Time Windows 带时间窗车辆路径问题的转基因算法

2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC) Pub Date : 2012-11-01 DOI: 10.1109/NaBIC.2012.6402252

J. Ruiz-Vanoye, O. Díaz-Parra, F. Cocón, M. Arias, Ana Canepa Saenz

{"title":"A transgenic algorithm for the Vehicle Routing Problem with Time Windows","authors":"J. Ruiz-Vanoye, O. Díaz-Parra, F. Cocón, M. Arias, Ana Canepa Saenz","doi":"10.1109/NaBIC.2012.6402252","DOIUrl":"https://doi.org/10.1109/NaBIC.2012.6402252","url":null,"abstract":"In this paper, we present a transgenic computer algorithm based on the transformation mechanism of horizontal gene transfer to solve the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW is the problem of minimising transportation costs while satisfying some restrictions as the time, vehicle capacity and the demand of each client. Horizontal gene artificial transfer is a form of genetic engineering. The transgenic algorithm is considered as a horizontal gene transfer algorithm, a meta-heuristics algorithm, or a bio-inspired algorithm based on horizontal gene transfer and symbiogenesis. The transgenic algorithm uses a data-mining technique (clustering) to group similar characteristics of the VRPTW instance to obtain the initial population (one VRPTW individual), a genetic transfer phase inspired by the transference of genetic codes of a bacterial gene (depot) contained in mechanisms for the horizontal gene transfer, and an intelligent mutation operator inspired by symbiogenesis called symbion operator. The transgenic algorithm (lateral gene transfer algorithm, or horizontal gene transfer algorithm) involves deliberate genetic modification rather than evolutionary aspects. We demonstrate that it is possible to deploy a transgenic algorithm based on horizontal gene transfer to solve (in fewer generations and less time) the VRPTW than the results of the genetic algorithm.","PeriodicalId":103091,"journal":{"name":"2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122626763","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

Improvement to the K-Means algorithm through a heuristics based on a bee honeycomb structure 基于蜂房结构的启发式改进K-Means算法

2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC) Pub Date : 2012-11-01 DOI: 10.1109/NaBIC.2012.6402258

Joaquín Pérez Ortega, A. Mexicano, R. Salgado, M. Hidalgo, Alejandra Moreno, Rodolfo A. Pazos Rangel

{"title":"Improvement to the K-Means algorithm through a heuristics based on a bee honeycomb structure","authors":"Joaquín Pérez Ortega, A. Mexicano, R. Salgado, M. Hidalgo, Alejandra Moreno, Rodolfo A. Pazos Rangel","doi":"10.1109/NaBIC.2012.6402258","DOIUrl":"https://doi.org/10.1109/NaBIC.2012.6402258","url":null,"abstract":"The object clustering problem, according to their similarity measures, can be formulated as a combinatorial optimization problem. The K-Means algorithm has been widely used for solving such problem; however, its computational cost is very high. In this work a new heuristics is proposed for reducing the computational complexity in the classification step of the algorithm based on a honeycomb structure, which the algorithm builds when clusters are visualized in a two-dimensional space. In particular it has been observed that an object can only change membership to neighboring clusters. The heuristics consists of performing distance calculations only with respect to centroids of neighboring clusters, which reduces the number of calculations. For assessing the performance of this heuristics, a set of experiments was carried out that involved 2500, 10000 and 40000 objects uniformly distributed in a two-dimensional space, as well as real-world instances of 3100 and 245 057 objects with 2 and 3 dimensions. The results were encouraging, since the calculation time was reduced 65% on average, with respect to the standard K-Means algorithm for the synthetic instance, and up to 62% on average for the real-world instances, while the quality was reduced on average by 0.05% and 2.5%, respectively.","PeriodicalId":103091,"journal":{"name":"2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133092940","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