• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.842-846
• /
• 2015

In this study, we propose an algorithm of the method of recovering quickly find the location of the error encountered during separate operations in the functional structure of complex digital circuits by mimicking the self-healing function of the cell. By the digital circuit was divided by 9 function block unit of function, proposes a method that It can quickly detect and recover the error position. It was the detection and recovery algorithms for the error location in the digital circuit of a complicated structure and could extended the number of function block for the $3{\times}3$ matrix structure on the digital circuit.

• Journal of information and communication convergence engineering
• /
• v.9 no.5
• /
• pp.615-618
• /
• 2011

Living cells generate the cell cycle or apoptosis, depending on the course will be repeated. If an error occurs during this period of life in order to maintain the cells in the peripheral cells find the error portion. These cellular functions were applied to the system to simulate the circuit. Circuit implementation of the present study was constructed the redundant structure in order to found the error quickly. Self-repairing of digital systems as an advanced form of fault-tolerance has been increasingly receiving attention according as digital systems have been more and more complex and speed-up especially for urgent systems or those working on extreme environments such as deep sea and outer space. Simulating the process of cell differentiation algorithm was confirmed by the FPGA on the counter circuit. If an error occurs on the circuit where the error was quickly locate and repair. In this paper, we propose a novel self-repair architecture for fast and robust fault-recovery that can easily apply to real, complex digital systems. These Self-Repairing Algorithms make it possible for the application digital systems to be alive even though in very noisy and extreme environments.

• Smart Structures and Systems
• /
• v.17 no.3
• /
• pp.523-539
• /
• 2016

The ambient vibration measurement is an output-data-only dynamic testing where natural excitations are represented, for instance, by winds and typhoons. The modal identification involving output-only measurements requires the use of specific modal identification techniques. This paper presents the application of a reliable method (the Stochastic Subspace Identification - SSI) implemented in a general purpose software. As a criterion toward the robustness of identified modes, a bio-inspired optimization algorithm, with a highly nonlinear objective function, is introduced in order to find the optimal deployment of a reduced number of sensors across a large civil engineering structure for the validation of its modal identification. The Ting Kau Bridge (TKB), one of the longest cable-stayed bridges situated in Hong Kong, is chosen as a case study. The results show that the proposed method catches eigenvalues and eigenvectors even for a reduced number of sensors, without any significant loss of accuracy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.11
• /
• pp.2557-2562
• /
• 2012

In order to maintain order in the genetic information at cells, it need ongoing monitoring and recovery system. DNA is accomplished by a combination of base pairs, Wrong base pairs is formed with a much more lower frequency than the normal DNA. if it does not modify and was accumulate, the Cells were died. In this study, mistakes of DNA replication and repair of the damaged part was introduced engineering concepts by mimicking DNA repair functions. It was presented recover the complementary part of the previously announced and presented an efficient algorithm at find and recover the complementary part.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.293-297
• /
• 2012

In order to maintain order in the genetic information at cells, it need ongoing monitoring and recovery system. DNA is accomplished by a combination of base pairs, Wrong base pairs is formed with a much more lower frequency than the normal DNA. if it does not modify and was accumulate, the Cells were died. In this study, mistakes of DNA replication and repair of the damaged part was introduced engineering concepts by mimicking DNA repair functions. It was presented recover the complementary part of the previously announced and presented an efficient algorithm at find and recover the complementary part.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1042-1062
• /
• 2010

Cooperative spectrum sensing (CSS) is an effective technology for alleviating the unreliability of local spectrum sensing due to fading/shadowing effects. Unlike most existing solutions, this paper considers the use of CSS technology in decentralized networks where a fusion center is not available. In such a decentralized network, some attackers may sneak into the ranks of cooperative users. On the basis of recent advances in bio-inspired consensus algorithms, an attack-proof, decentralized CSS scheme is proposed in which all secondary users can maintain cooperative sensing by exchanging information locally instead of requiring centralized control or data fusion. Users no longer need any prior knowledge of the network. To counter three potential categories of spectrum sensing data falsification (SSDF) attacks, some anti-attack strategies are applied to the iterative process of information exchange. This enables most authentic users to exclude potentially malicious users from their neighborhood. As represented by simulation results, the proposed scheme can generally ensure that most authentic users reach a consensus within the given number of iterations, and it also demonstrates much better robustness against different SSDF attacks than several existing schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.1
• /
• pp.371-384
• /
• 2019

Motion perception has been tremendously improved in neuroscience and computer vision. The baseline motion perception model is mediated by the dorsal visual pathway involving the cortex areas the primary visual cortex (V1) and the middle temporal (V5 or MT) visual area. However, few works have been done on the extension of neural models to improve the efficacy and robustness of motion perception of real sequences. To overcome shortcomings in situations, such as varying illumination and large displacement, an adaptive V1-MT motion perception (Ad-V1MTMP) algorithm enriched to deal with real sequences is proposed and analyzed. First, the total variation semi-norm model based on Gabor functions (TV-Gabor) for structure-texture decomposition is performed to manage the illumination and color changes. And then, we study the impact of image local context, which is processed in extra-striate visual areas II (V2), on spatial motion integration by MT neurons, and propose a V1-V2 method to extract the image contrast information at a given location. Furthermore, we take feedback inputs from V2 into account during the polling stage. To use the algorithm on natural scenes, finally, multi-scale approach has been used to handle the frequency range, and adaptive pyramidal decomposition and decomposed spatio-temporal filters have been used to diminish computational cost. Theoretical analysis and experimental results suggest the new Ad-V1MTMP algorithm which mimics human primary motion pathway has universal, effective and robust performance.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.6
• /
• pp.385-391
• /
• 2022

This paper presents to develop a path planning algorithm combining gradient descent-based path planning (GBPP) and particle swarm optimization (PSO) for considering prohibited flight areas, terrain information, and characteristics of fixed-wing unmmaned aerial vehicle (UAV) in 3D space. Path can be generated fast using GBPP, but it is often happened that an unsafe path can be generated by converging to a local minimum depending on the initial path. Bio-inspired swarm intelligence algorithms, such as Genetic algorithm (GA) and PSO, can avoid the local minima problem by sampling several paths. However, if the number of optimal variable increases due to an increase in the number of UAVs and waypoints, it requires heavy computation time and efforts due to increasing the number of particles accordingly. To solve the disadvantages of the two algorithms, hierarchical path planning algorithm associated with hierarchical particle swarm optimization (HPSO) is developed by defining the initial path, which is the input of GBPP, as two variables including particles variables. Feasibility of the proposed algorithm is verified by software-in-the-loop simulation (SILS) of flight control computer (FCC) for UAVs.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.3
• /
• pp.67-75
• /
• 2010

This paper proposes a bacteria cooperative optimization (BCO) method applying individuals's speed for the performance improvements. All individuals in existing BCO methods move the same length at the same time because their speeds are constant. These methods had the problem that the individuals couldn't find the global optimum effectively because good individuals and bad individuals had same speeds. In order to overcome this problem, we applied the speed concept to the BCO algorithm that individuals moved different lengths according to their speeds assigned by the ranks of individuals according to the fitness of individuals. That is to say, we provide high speeds to bad individuals with low fitness in order to fast move to the areas with high fitness and provide low speeds to good individuals with high fitness because they may be near global optimum. It was found from experimental results of four function optimization problems that the proposed method outperformed the existing methods. Our method showed better performances even than the rank replacement method. This means that applying speed concepts to the individuals for BCO is very effective and efficient.