{"title":"Implementing in vivo cellular automata using toggle switch and inter-bacteria communication mechanism","authors":"Y. Sakakibara, H. Nakagawa, Y. Nakashima, K. Yugi","doi":"10.1109/BIMNICS.2007.4610137","DOIUrl":"https://doi.org/10.1109/BIMNICS.2007.4610137","url":null,"abstract":"Artificial genetic circuits have been recently proposed to realize unprecedented biological systems which do not exist in nature by combining several genes. For example, recombinant Escherichia coli provides novel artificial functions such as blinking periodically or invading cancer cells. In protein engineering, new functional proteins have been created by site-directed mutagenesis methods. The main purpose of our research is to implement the Cellular Automata (CA) in vivo employing these methods. Computational capacity of CA is equivalent to the universal Turing Machine. CA are multi-cellular systems in which uniform cells are allocated on lattice grid. Each cell has a finite number of states. The state transition is determined by the current state and the states of neighbor cells. Three mechanisms are required to implement CA in bacteria: (1) Sending and receiving signals between cells, (2) Sustaining the state, (3) Sensing input signals and changing the state following the state transition rules. To encode signals for the mechanism (1), we use small molecules inducing transcription. For the mechanism (2), the toggle switch circuit was employed to represent a finite number of states using gene expression. If one gene does express and the other does not, the state is 1, and vice versa, 0. For the mechanism (3), the state transition functions were implemented as logic gates using transcriptional regulatory proteins which bind to specific signal molecules (chemicals). In this paper, we applied this method to in vivo implementation of one-dimensional CA and corroborated whether it behaves correctly. In principle, this method can be applied to any dimensional CA by employing more signal molecules Permission to make digital or hard copies of all or part of this work for to construct more complex logic gate. Furthermore, we succeeded to execute one step calculation of one-dimensional CA in vivo in a laboratory experiment.","PeriodicalId":439018,"journal":{"name":"2007 2nd Bio-Inspired Models of Network, Information and Computing Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133296913","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}
{"title":"Detecting DoS attacks using packet size distribution","authors":"P. Du, S. Abe","doi":"10.1109/BIMNICS.2007.4610090","DOIUrl":"https://doi.org/10.1109/BIMNICS.2007.4610090","url":null,"abstract":"Enabling early detection of Denial of service (DoS) attacks in network traffic is an important and challenging task because DoS attacks have become one of the most serious threats to the Internet. In this paper, we develop an IP packet size entropy (IPSE)-based DoS detection scheme in which the entropy is markedly changed when traffic is affected by an attack. Through our analysis, we find that the IPSE-based scheme is capable of detecting not only long-term attacks but also short-term attacks that are beyond the volume-based schemespsila ability to detect.","PeriodicalId":439018,"journal":{"name":"2007 2nd Bio-Inspired Models of Network, Information and Computing Systems","volume":"180 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124493453","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}
{"title":"Antares: an ant-inspired P2P information system for a self-structured grid","authors":"Agostino Forestiero, C. Mastroianni, G. Spezzano","doi":"10.1109/BIMNICS.2007.4610103","DOIUrl":"https://doi.org/10.1109/BIMNICS.2007.4610103","url":null,"abstract":"This paper introduces Antares, a bio-inspired algorithm that exploits ant-like agents to build a P2P information system in grids. The work of agents is tailored to the controlled replication and relocation of metadata documents that describe grid resources. These descriptors are indexed through binary strings that can either represent topics of interest, specifically in the case that resources are text documents, or be the result of the application of a locality preserving hash function, that maps similar resources into similar keys. Agents travel the grid through P2P interconnections and, by the application of ad hoc probability functions, they copy and move descriptors so as to locate descriptors represented by identical or similar keys into neighbor grid hosts. The effectiveness of the Antares algorithm has been verified by event-driven simulation which proves that ant operations allow to achieve replication and spatial sorting of descriptors. The resulting information system is here referred to as self-structured, because it exploits the self-organizing characteristics of ant-inspired agents, and also because the association of descriptors to hosts is not pre-determined but easily adapts to the varying conditions of the grid. This self-structured organization combines the benefits of both unstructured and structured P2P information systems. Indeed, being basically unstructured, Antares is easy to maintain in a dynamic grid, in which joins and departs of hosts can be frequent events. On the other hand, the aggregation and spatial ordering of descriptors can improve the rapidity and effectiveness of discovery operations, and also enables range queries, which are beneficial features typical of structured systems.","PeriodicalId":439018,"journal":{"name":"2007 2nd Bio-Inspired Models of Network, Information and Computing Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133286241","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}
{"title":"Mapping external functionalities into autonomic services","authors":"B. K. Benko, Róbert Schulcz","doi":"10.1109/BIMNICS.2007.4610125","DOIUrl":"https://doi.org/10.1109/BIMNICS.2007.4610125","url":null,"abstract":"In this paper, we present the functionality mapping model that is used in the CASCADAS ACE model: external code libraries are transformed into services of an autonomic element. CASACDAS is an EU 6th Framework IST-FET project in the field of situated, autonomic communication; various research topics are organized around a common abstraction called Autonomic Communication Element (ACE). When designing this common abstraction, a big challenge is to define a natural, non-complex but flexible and expressive way for transforming existing code (libraries) into autonomic services of an ACE. In this paper, we introduce, explain, and discuss the developed model, and compare them with existing functionality mapping technologies.","PeriodicalId":439018,"journal":{"name":"2007 2nd Bio-Inspired Models of Network, Information and Computing Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127834199","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}
{"title":"Epidemic spreading on weighted contact networks","authors":"P. Schumm, C. Scoglio, D. Gruenbacher, T. Easton","doi":"10.1109/BIMNICS.2007.4610111","DOIUrl":"https://doi.org/10.1109/BIMNICS.2007.4610111","url":null,"abstract":"The study of epidemics is a crucial issue to several areas. An epidemic can have devastating economic and social consequences. A single crop disease in Kansas could destroy the yearly income of many farmers. Previous work using graph theory has determined a universal epidemic threshold found in the graph topology for a binary contact network in the compartmental susceptible-infected (SI) analysis. We expand this threshold to a more realistic measure. A binary uniform level of contact within a society is too idealistic and an improved threshold is found in allowing a spectrum of contact within a contact network. The expanded contact network also allows for asymmetric contact such as a mother caring for her child. Further study in this area should lead to improved simulators, disease modeling, policies and control of infectious diseases and viruses.","PeriodicalId":439018,"journal":{"name":"2007 2nd Bio-Inspired Models of Network, Information and Computing Systems","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115841961","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}
{"title":"Immunity based virus detection with process call arguments and user feedback","authors":"Zhou Li, Yiwen Liang, Zejun Wu, Chengyu Tan","doi":"10.1109/BIMNICS.2007.4610081","DOIUrl":"https://doi.org/10.1109/BIMNICS.2007.4610081","url":null,"abstract":"Detecting unknown virus is a challenging task. Most of the current virus detection approaches, such as anti-virus tools, require precognition of virus signatures for detection, but they are hard to detect unknown virus. In this paper, we present a new immunity based virus detection approach. This approach collects arguments of process calls instead of the sequence of process, which obtain more information of process, and then utilizes them to train detectors with real-valued negative selection (RVNS) algorithm. In the stage of testing, user feedback is analyzed to adjust the threshold between normal files and viruses. We took two experiments to evaluate the performance of the approach, and the detection rate achieved is 0.7, which proved this approach could cope with unknown virus.","PeriodicalId":439018,"journal":{"name":"2007 2nd Bio-Inspired Models of Network, Information and Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129910510","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}
{"title":"Global information processing in gene networks: Fault tolerance","authors":"F. Emmert-Streib, M. Dehmer","doi":"10.1109/BIMNICS.2007.4610138","DOIUrl":"https://doi.org/10.1109/BIMNICS.2007.4610138","url":null,"abstract":"In this paper we study the fault tolerance of gene networks. We assume single gene knockouts and investigate the effect this kind of perturbation has on the communication between genes globally. For our study we use directed scale-free networks resembling gene networks, e.g., signaling or protein-protein interaction networks, and define a Markov process based on the network topology to model communication. This allows us to evaluate the spread of information in the network and, hence, detect differences due to single gene knockouts in the gene-gene communication asymptotically.","PeriodicalId":439018,"journal":{"name":"2007 2nd Bio-Inspired Models of Network, Information and Computing Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124311461","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}
{"title":"A model-based approach to the non-unique oligonucleotide probe selection problem","authors":"Lili Wang, A. Ngom","doi":"10.1109/BIMNICS.2007.4610112","DOIUrl":"https://doi.org/10.1109/BIMNICS.2007.4610112","url":null,"abstract":"In order to accurately measure the gene expression levels in oligonucleotide microarray experiments, it is crucial to design ldquouniquerdquo, highly specific and sensitive probes for the identification of biological agents such as genes in a sample. It is difficult to design unique probes for very closely related genes, such as the known strains of HIV genes. The ldquonon-uniquerdquo probe selection problem consists of determining a set of probes, not necessarily unique, that can uniquely identify targets while containing a minimal number of probes. In this paper, we describe a simple model-based method to obtain a near minimal non-unique probe set. Preliminary experimental results are encouraging and at least comparable, if not better, to those obtained by two recently published methods.","PeriodicalId":439018,"journal":{"name":"2007 2nd Bio-Inspired Models of Network, Information and Computing Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126198372","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}
{"title":"Self-organizing mobile surveillance security networks","authors":"D. Ferro, A. Salden","doi":"10.1109/BIMNICS.2007.4610114","DOIUrl":"https://doi.org/10.1109/BIMNICS.2007.4610114","url":null,"abstract":"We develop and evaluate ASK-ASSIST, a decision support system that enables automatically setting up communication networks and sharing knowledge amongst security personnel, in particular when they are confronted with a series of unexpected incidents while on patrol. Currently, team leaders of mobile security guards are still forced to assess the consequences of a series of incidents and to take decisions in a heuristic way. On the basis of incomplete and uncertain information they have to determine the security situation, who to bring in contact with whom, and which personnel or which information systems should be lined up in order to resolve the incidents as a whole. ASK-ASSIST, however, automates robust dynamic formation and coordination of the right coalitions of security personnel, such that they support human improvisation in determining the nature of incidents and taking decisions by the coalitions. These coalitions comprise security personnel, communication security infrastructures and knowledge management security infrastructures. ASK-ASSIST is based on a framework for self-organization that generates ranked lists of incident-specific critical (re)configurations of coalitions in which joint tasks are assigned to agents associated with roles, like guards or team leaders. Our main contributions are the grounding and evaluation of the framework underlying ASK-ASSIST. We instantiate, validate and test the system on the basis of real data. These data concern organizational structures reflected in the coalitions and implicit or explicit feedback provided by personnel from a private security company. The provided feedback relates to the daily operational mobile security surveillance processes including those that involve functionalities of ASK-ASSIST.","PeriodicalId":439018,"journal":{"name":"2007 2nd Bio-Inspired Models of Network, Information and Computing Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115034091","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}
{"title":"Improved covariance model parameter estimation using RNA thermodynamic properties","authors":"Scott F. Smith, K. Wiese","doi":"10.1109/BIMNICS.2007.4610108","DOIUrl":"https://doi.org/10.1109/BIMNICS.2007.4610108","url":null,"abstract":"Covariance models are a powerful description of non-coding RNA (ncRNA) families that can be used to search nucleotide databases for new members of these ncRNA families. Currently, estimation of the parameters of a covariance model (state transition and emission scores) is based only on the observed frequencies of mutations, insertions, and deletions in known ncRNA sequences. For families with very few known members, this can result in rather uninformative models where the consensus sequence has a good score and most deviations from consensus have a fairly uniform poor score. It is proposed here to combine the traditional observed-frequency information with known information about free energy changes in RNA helix formation and loop length changes. More thermodynamically probable deviations from the consensus sequence will then be favored in database search. The thermodynamic information may be incorporated into the models as informative priors that depend on neighboring consensus nucleotides and on loop lengths.","PeriodicalId":439018,"journal":{"name":"2007 2nd Bio-Inspired Models of Network, Information and Computing Systems","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131015762","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}