• Title/Summary/Keyword: Bio-inspired Algorithms

Search Result 28, Processing Time 0.039 seconds

DNA Inspired CVD Diagnostic Hardware Architecture (DNA 특성을 모방한 심혈관질환 진단용 하드웨어)

  • Kwon, Oh-Hyuk;Kim, Joo-Kyung;Ha, Jung-Woo;Park, Jea-Hyun;Chung, Duck-Jin;Lee, Chong-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.2
    • /
    • pp.320-326
    • /
    • 2008
  • In this paper, we propose a new algorithm emulating the DNA characteristics for noise-tolerant pattern matching problem on digital system. The digital pattern matching becomes core technology in various fields, such as, robot vision, remote sensing, character recognition, and medical diagnosis in particular. As the properties of natural DNA strands allow hybridization with a certain portion of incompatible base pairs, DNA-inspired data structure and computation technique can be adopted to bio-signal pattern classification problems which often contain imprecise data patterns. The key feature of noise-tolerance of DNA computing comes from control of reaction temperature. Our hardware system mimics such property to diagnose cardiovascular disease and results superior classification performance over existing supervised learning pattern matching algorithms. The hardware design employing parallel architecture is also very efficient in time and area.

Convergence Analysis of Distributed Time and Frequency Synchronization Algorithm for OFDMA-Based Wireless Mesh Networks Using Bio-Inspired Technique (생체모방 기법을 활용한 OFDMA기반 무선 메쉬 네트워크의 분산 시간 및 주파수 동기화 알고리듬의 수렴성 분석)

  • Kim, Mi-Jeong;Choi, Joo-Hyung;Cho, Young-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.8
    • /
    • pp.488-490
    • /
    • 2014
  • This paper deals with distributed time and frequency synchronization algorithms using the flocking technique for OFDMA-based wireless mesh networks. We propose a time and frequency synchronization model taking into account channel propagation delays existing in wireless mesh networks, and analyze the convergence condition of the proposed synchronization algorithm. Convergence performance of the proposed synchronization algorithm is analyzed via computer simulation in terms of synchronization parameters in the time and frequency synchronization model.

Mobile Sink Path Planning in Heterogeneous IoT Sensors: a Salp Swarm Algorithm Scheme

  • Hamidouche, Ranida;Aliouat, Zibouda;Ari, Ado Adamou Abba;Gueroui, Abdelhak
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.6
    • /
    • pp.2225-2239
    • /
    • 2021
  • To assist in data collection, the use of a mobile sink has been widely suggested in the literature. Due to the limited sensor node's storage capacity, this manner to collect data induces huge latencies and drop packets. Their buffers will be overloaded and lead to network congestion. Recently, a new bio-inspired optimization algorithm appeared. Researchers were inspired by the swarming mechanism of salps and thus creating what is called the Salp Swarm Algorithm (SSA). This paper improves the sink mobility to enhance energy dissipation, throughput, and convergence speed by imitating the salp's movement. The new approach, named the Mobile Sink based on Modified Salp Swarm Algorithm (MSSA), is approved in a heterogeneous Wireless Sensor Network (WSN) data collection. The performance of the MSSA protocol is assessed using several iterations. Results demonstrate that our proposal surpass other literature algorithms in terms of lifespan and throughput.

Analysis on Occlusion Problem of Landmark-based Homing Navigation Methods (랜드마크 기반 귀소 내비게이션 알고리즘의 가림 현상 분석 및 비교)

  • Yu, Seung-Eun;Kim, Dae-Eun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.6
    • /
    • pp.596-601
    • /
    • 2011
  • Autonomous navigating algorithms for mobile robots have been proved to be a difficult task. Based on the excellent homing performance shown by many insects, bio-inspired navigation algorithms for robotic experiments have been widely researched and applied to the design of navigational strategies for mobile robots. In this paper, among them, we analyze two simple landmark navigation methods their strengths and limits. We investigate the effect of the occlusion problem mainly, which is an important yet tough problem in many landmark navigation algorithms. In the point of view of the error of homing vector and the performance of the homing paths in the environment with artificial occlusions, we investigate the effect of occlusion problem in both methods in order to further study on solutions.

DNA Coding Method for Time Series Prediction (시계열 예측을 위한 DNA 코딩 방법)

  • 이기열;선상준;이동욱;심귀보
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.280-280
    • /
    • 2000
  • In this paper, we propose a method of constructing equation using bio-inspired emergent and evolutionary concepts. This method is algorithm that is based on the characteristics of the biological DNA and growth of plants. Here is. we propose a constructing method to make a DNA coding method for production rule of L-system. L-system is based on so-called the parallel rewriting mechanism. The DNA coding method has no limitation in expressing the production rule of L-system. Evolutionary algorithms motivated by Darwinian natural selection are population based searching methods and the high performance of which is highly dependent on the representation of solution space. In order to verify the effectiveness of our scheme, we apply it to one step ahead prediction of Mackey-Glass time series.

  • PDF

Evolutionary Neural Networks based on DNA coding and L-system (DNA Coding 및 L-system에 기반한 진화신경회로망)

  • 이기열;전호병;이동욱;심귀보
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.11a
    • /
    • pp.107-110
    • /
    • 2000
  • In this paper, we propose a method of constructing neural networks using bio-inspired emergent and evolutionary concepts. This method is algorithm that is based on the characteristics of the biological DNA and growth of plants. Here is, we propose a constructing method to make a DNA coding method for production rule of L-system. L-system is based on so-called the parallel rewriting mechanism. The DNA coding method has no limitation in expressing the production rule of L-system. Evolutionary algorithms motivated by Darwinian natural selection are population based searching methods and the high performance of which is highly dependent on the representation of solution space. In order to verify the effectiveness of our scheme, we apply it to one step ahead prediction of Mackey-Glass time series.

  • PDF

Evolutionary Neural Network based on DNA Coding Method for Time Series Prediction (시계열 예측을 위한 DNA코딩 기반의 신경망 진화)

  • 이기열;이동욱;심귀보
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.05a
    • /
    • pp.224-227
    • /
    • 2000
  • In this Paper, we prepose a method of constructing neural networks using bio-inspired emergent and evolutionary concepts. This method is algorithm that is based on the characteristics of the biological DNA and growth of plants. Here is, we propose a constructing method to make a DNA coding method for production rule of L-system. L-system is based on so-called the parallel rewriting mechanism. The DNA coding method has no limitation in expressing the production rule of L-system. Evolutionary algorithms motivated by Darwinian natural selection are population based searching methods and the high performance of which is highly dependent on the representation of solution space. In order to verify the effectiveness of our scheme, we apply it to one step ahead prediction of Mackey-Glass time series, Sun spot data and KOSPI data.

  • PDF

FPGA Implementation of an Artificial Intelligence Signal Recognition System

  • Rana, Amrita;Kim, Kyung Ki
    • Journal of Sensor Science and Technology
    • /
    • v.31 no.1
    • /
    • pp.16-23
    • /
    • 2022
  • Cardiac disease is the most common cause of death worldwide. Therefore, detection and classification of electrocardiogram (ECG) signals are crucial to extend life expectancy. In this study, we aimed to implement an artificial intelligence signal recognition system in field programmable gate array (FPGA), which can recognize patterns of bio-signals such as ECG in edge devices that require batteries. Despite the increment in classification accuracy, deep learning models require exorbitant computational resources and power, which makes the mapping of deep neural networks slow and implementation on wearable devices challenging. To overcome these limitations, spiking neural networks (SNNs) have been applied. SNNs are biologically inspired, event-driven neural networks that compute and transfer information using discrete spikes, which require fewer operations and less complex hardware resources. Thus, they are more energy-efficient compared to other artificial neural networks algorithms.

A modified error-oriented weight positioning model based on DV-Hop

  • Wang, Penghong;Cai, Xingjuan;Xie, Liping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.2
    • /
    • pp.405-423
    • /
    • 2022
  • The distance vector-hop (DV-Hop) is one of the emblematic algorithms that use node connectivity for locating, which often accompanies by a large positioning error. To reduce positioning error, the bio-inspired algorithm and weight optimization model are introduced to address positioning. Most scholars argue that the weight value decreases as the hop counts increases. However, this point of view ignores the intrinsic relationship between the error and weight. To address this issue, this paper constructs the relationship model between error and hop counts based on actual communication characteristics of sensor nodes in wireless sensor network. Additionally, we prove that the error converges to 1/6CR when the hop count increase and tendency to infinity. Finally, this paper presents a modified error-oriented weight positioning model, and implements it with genetic algorithm. The experimental results demonstrate excellent robustness and error removal.

Evolving Cellular Automata Neural Systems(ECANS 1)

  • Lee, Dong-Wook;Sim, Kwee-Bo
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.158-163
    • /
    • 1998
  • This paper is our first attempt to construct a information processing system such as the living creatures' brain based on artificial life technique. In this paper, we propose a method of constructing neural networks using bio-inspired emergent and evolutionary concept, Ontogeny of living things is realized by cellular automata model and Phylogeny that is living things adaptation ability themselves to given environment, are realized by evolutionary algorithms. Proposing evolving cellular automata neural systems are calledin a word ECANS. A basic component of ECANS is 'cell' which is modeled on chaotic neuron with complex characteristics, In our system, the states of cell are classified into eight by method of connection neighborhood cells. When a problem is given, ECANS adapt itself to the problem by evolutionary method. For fixed cells transition rule, the structure of neural network is adapted by change of initial cell' arrangement. This initial cell is to become a network b developmental process. The effectiveness and the capability of proposed scheme are verified by applying it to pattern classification and robot control problem.

  • PDF