• Title/Summary/Keyword: biological algorithm

Search Result 849, Processing Time 0.035 seconds

Optimum Design of Surface Aerator Using Response Surface Method (반응표면 기법을 이용한 생물반응조 표면포기기 최적설계)

  • Yoon, Jong-Hwan
    • Journal of the Korean Society of Visualization
    • /
    • v.7 no.2
    • /
    • pp.47-55
    • /
    • 2010
  • In this study, we optimized the shape of the surface aerator that will be installed in a biological reactor using the response surface method. Response surfaces of mass flow rate, impeller torque, mass flow rate per impeller torque are generated and used to track the optimum shape of the aerator. MOGA(Multi-Objective Genetic Algorithm)method is adopted to find the optimum results. By increasing the mass flow rate per impeller torque, increase of oxygen supply efficiency to a reactor is anticipated. To verify the usability of the surface aerator, PIV measurements on flow fields inside a scale-downed biological reactor model are carried out.

A New Ocular Torsion Measurement Method Using Iterative Optical Flow

  • Lee InBum;Choi ByungHun;Kim SangSik;Park Kwang Suk
    • Journal of Biomedical Engineering Research
    • /
    • v.26 no.3
    • /
    • pp.133-138
    • /
    • 2005
  • This paper presents a new method for measuring ocular torsion using the optical flow. Images of the iris were cropped and transformed into rectangular images that were orientation invariant. Feature points of the iris region were selected from a reference and a target image, and the shift of each feature was calculated using the iterative Lucas-Kanade method. The feature points were selected according to the strength of the corners on the iris image. The accuracy of the algorithm was tested using printed eye images. In these images, torsion was measured with $0.15^{\circ}$ precision. The proposed method shows robustness even with the gaze directional changes and pupillary reflex environment of real-time processing.

A Study on the Bit-slice Signal Processor for the Biological Signal Processing (생체 신호처리용 Bit-slice Signal Processor에 관한 연구)

  • Kim, Yeong-Ho;Kim, Dong-Rok;Min, Byeong-Gu
    • Journal of Biomedical Engineering Research
    • /
    • v.6 no.2
    • /
    • pp.15-22
    • /
    • 1985
  • We have developed a microprogramir!able signal processor for real-time ultrasonic signal processing. Processing speed was increased by the parallelism in horizontal microprogram using 104bits microcode and the Pipelined architecture. Control unit of the signal processor was designed by microprogrammed architec- ture and writable control store (WCS) which was interfaced with host computer, APPLE- ll . This enables the processor to develop and simulate various digital signal processing algorithms. The performance of the processor was evaluated by the Fast Fourier Transform (FFT) program. The execution time to perform 16 bit 1024 points complex FF7, radix-2 DIT algorithm, was about 175 msec with IMHz master Clock. We can use this processor to Bevelop more efficient signal processing algorithms on the biological signal processing.

  • PDF

High Utility Itemset Mining over Uncertain Datasets Based on a Quantum Genetic Algorithm

  • Wang, Ju;Liu, Fuxian;Jin, Chunjie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.8
    • /
    • pp.3606-3629
    • /
    • 2018
  • The discovered high potential utility itemsets (HPUIs) have significant influence on a variety of areas, such as retail marketing, web click analysis, and biological gene analysis. Thus, in this paper, we propose an algorithm called HPUIM-QGA (Mining high potential utility itemsets based on a quantum genetic algorithm) to mine HPUIs over uncertain datasets based on a quantum genetic algorithm (QGA). The proposed algorithm not only can handle the problem of the non-downward closure property by developing an upper bound of the potential utility (UBPU) (which prunes the unpromising itemsets in the early stage) but can also handle the problem of combinatorial explosion by introducing a QGA, which finds optimal solutions quickly and needs to set only very few parameters. Furthermore, a pruning strategy has been designed to avoid the meaningless and redundant itemsets that are generated in the evolution process of the QGA. As proof of the HPUIM-QGA, a substantial number of experiments are performed on the runtime, memory usage, analysis of the discovered itemsets and the convergence on real-life and synthetic datasets. The results show that our proposed algorithm is reasonable and acceptable for mining meaningful HPUIs from uncertain datasets.

Active Distribution System Planning Considering Battery Swapping Station for Low-carbon Objective using Immune Binary Firefly Algorithm

  • Shi, Ji-Ying;Li, Ya-Jing;Xue, Fei;Ling, Le-Tao;Liu, Wen-An;Yuan, Da-Ling;Yang, Ting
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.2
    • /
    • pp.580-590
    • /
    • 2018
  • Active distribution system (ADS) considering distributed generation (DG) and electric vehicle (EV) is an effective way to cut carbon emission and improve system benefits. ADS is an evolving, complex and uncertain system, thus comprehensive model and effective optimization algorithms are needed. Battery swapping station (BSS) for EV service is an essential type of flexible load (FL). This paper establishes ADS planning model considering BSS firstly for the minimization of total cost including feeder investment, operation and maintenance, net loss and carbon tax. Meanwhile, immune binary firefly algorithm (IBFA) is proposed to optimize ADS planning. Firefly algorithm (FA) is a novel intelligent algorithm with simple structure and good convergence. By involving biological immune system into FA, IBFA adjusts antibody population scale to increase diversity and global search capability. To validate proposed algorithm, IBFA is compared with particle swarm optimization (PSO) algorithm on IEEE 39-bus system. The results prove that IBFA performs better than PSO in global search and convergence in ADS planning.

Control of pH Neutralization Process using Simulation Based Dynamic Programming (ICCAS 2003)

  • Kim, Dong-Kyu;Yang, Dae-Ryook
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.2617-2622
    • /
    • 2003
  • The pH neutralization process has long been taken as a representative benchmark problem of nonlinear chemical process control due to its nonlinearity and time-varying nature. For general nonlinear processes, it is difficult to control with a linear model-based control method so nonlinear controls must be considered. Among the numerous approaches suggested, the most rigorous approach is the dynamic optimization. However, as the size of the problem grows, the dynamic programming approach is suffered from the curse of dimensionality. In order to avoid this problem, the Neuro-Dynamic Programming (NDP) approach was proposed by Bertsekas and Tsitsiklis (1996). The NDP approach is to utilize all the data collected to generate an approximation of optimal cost-to-go function which was used to find the optimal input movement in real time control. The approximation could be any type of function such as polynomials, neural networks and etc. In this study, an algorithm using NDP approach was applied to a pH neutralization process to investigate the feasibility of the NDP algorithm and to deepen the understanding of the basic characteristics of this algorithm. As the global approximator, the neural network which requires training and k-nearest neighbor method which requires querying instead of training are investigated. The global approximator requires optimal control strategy. If the optimal control strategy is not available, suboptimal control strategy can be used even though the laborious Bellman iterations are necessary. For pH neutralization process it is rather easy to devise an optimal control strategy. Thus, we used an optimal control strategy and did not perform the Bellman iteration. Also, the effects of constraints on control moves are studied. From the simulations, the NDP method outperforms the conventional PID control.

  • PDF

An Efficient Suffix Tree Reconstructing Algorithm for Biological Sequence Analysis (DNA 분석에 효율적인 서픽스 트리 재구성 알고리즘)

  • Choi, Hae-Won;Jung, Young-Seok;Kim, Sang-Jin
    • Journal of Digital Convergence
    • /
    • v.12 no.12
    • /
    • pp.265-275
    • /
    • 2014
  • This paper introduces a new algorithms for reconstructing the suffix tree of character string, when a substring id deleted from the string or a string is inserted into the string as a substring. The algorithem has two main functions, delete-structure and insert-structure. The main objective of this algorithm is to save the time for constructing the suffix tree of an edited string, when the suffix tree of the original string is available. We tested the performance of this algorithm with some DNA sequences. This test shows that delete-reconstructing can save time when the length of the subsequence deleted is less than 30% of the original sequence, and the insert-reconstructing takes less time with regard to the length of inserted sequence.

Development of Real-time QRS-complex Detection Algorithm for Portable ECG Measurement Device (휴대용 심전도 측정장치를 위한 실시간 QRS-complex 검출 알고리즘 개발)

  • An, Hwi;Shim, Hyoung-Jin;Park, Jae-Soon;Lhm, Jong-Tae;Joung, Yeun-Ho
    • Journal of Biomedical Engineering Research
    • /
    • v.43 no.4
    • /
    • pp.280-289
    • /
    • 2022
  • In this paper, we present a QRS-complex detection algorithm to calculate an accurate heartbeat and clearly recognize irregular rhythm from ECG signals. The conventional Pan-Tompkins algorithm brings false QRS detection in the derivative when QRS and noise signals have similar instant variation. The proposed algorithm uses amplitude differences in 7 adjacent samples to detect QRS-complex which has the highest amplitude variation. The calculated amplitude is cubed to dominate QRS-complex and the moving average method is applied to diminish the noise signal's amplitude. Finally, a decision rule with a threshold value is applied to detect accurate QRS-complex. The calculated signals with Pan-Tompkins and proposed algorithms were compared by signal-to-noise ratio to evaluate the noise reduction degree. QRS-complex detection performance was confirmed by sensitivity and the positive predictive value(PPV). Normal ECG, muscle noise ECG, PVC, and atrial fibrillation signals were achieved which were measured from an ECG simulator. The signal-to-noise ratio difference between Pan-Tompkins and the proposed algorithm were 8.1, 8.5, 9.6, and 4.7, respectively. All ratio of the proposed algorithm is higher than the Pan-Tompkins values. It indicates that the proposed algorithm is more robust to noise than the Pan-Tompkins algorithm. The Pan-Tompkins algorithm and the proposed algorithm showed similar sensitivity and PPV at most waveforms. However, with a noisy atrial fibrillation signal, the PPV for QRS-complex has different values, 42% for the Pan-Tompkins algorithm and 100% for the proposed algorithm. It means that the proposed algorithm has superiority for QRS-complex detection in a noisy environment.

On Designing a Robust Control System Using Immune Algorithm (면역 알고리즘을 이용한 강건한 제어 시스템 설계)

  • Seo, Jae-Yong;Won, Kyoung-Jae;Kim, Seong-Hyun;Cho, Hyun-Chan;Jeon, Hong-Tae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.8 no.6
    • /
    • pp.12-20
    • /
    • 1998
  • As an approach to develope a control system with high robustness in changing control environment conditions, this paper will propose a robust control system, using multilayer neural network and biological immune system. The proposed control system adjusts weights of the multilayer neural network(MNN) with the immune algorithm. This algorithm is made up of two major divisions, the innate immune algorithm as a first line of defence and the adaptive immune algorithm as a barrier of self-adjustment. Using the proposed control system based on immune algorithm, we will work out a design for the controller of a robot manipulator. And we will demonstrate the effectiveness of the control system of robot manipulator with computer simulations.

  • PDF

Development of Adaptive Feedback Cancellation Algorithm for Multi-channel Digital Hearing Aids (다채널 디지털 보청기를 위한 적응 궤환 제거 알고리즘 개발)

  • 이상민;김상완;권세윤;박영철;김인영;김선일
    • Journal of Biomedical Engineering Research
    • /
    • v.25 no.4
    • /
    • pp.315-321
    • /
    • 2004
  • In this study, we proposed an adaptive feedback cancellation algorithm for multi-band digital healing aids. The adaptive feedback canceller (AFC) is composed of an adaptive notch filter (ANF) for feedback detection and an NLMS (normalized least mean square) adaptive filter for feedback cancellation. The proposed feedback cancellation algorithm is combined with a multi-band hearing aid algorithm which employs the MDCT (modified discrete cosine transform) filter bank for the frequency-dependent compensation of hearing losses. The proposed algorithm together with the MDCT-based multi-channel hearing aid algorithm has been evaluated via computer simulations and it has also been implemented on a commercialized DSP board for real-time verifications.