• Korean Institute of Interior Design Journal
• /
• v.21 no.2
• /
• pp.35-45
• /
• 2012

The development of digital media made the change of architectural paradigm from tectonic to the surface and pattern. This means the transition to the new kind of materiality and the resurrection of ornament. This study started as an aim to apply biological pattern to architectural design from the new perception of pattern. Architectural patterns in the early era appeared as ladders, steps, chains, trees, vortices. But since 21st century, we can find patterns in nature like atoms and molecular structures, fluid forms of dynamics and new geometrical pattern like fractal and first of all biological patterns like viruses and micro-organisms, Voronoi cells, DNA structure, rhizomes and various hybrids and permutations of these. Pattern became one of the most important elements and themes of contemporary architecture through the change of materiality and resurrection of ornament with the new perception of surface in architecture. One of the patterns that give new creative availability to the architectural design is biological pattern which is self-organized as an optimum form through interaction with environment. Biological patterns emerge mostly as self-replicating patterns through morphogenesis, certain geometrical patterns(in particular triangles, pentagons, hexagons and spirals). The architectural application methods of biological patterns are direct figural pattern of organism, circle pattern, polygon pattern, energy-material control pattern, differentiation pattern, parametric pattern, growth principle pattern, evolutionary ecologic pattern. These patterns can be utilized as practical architectural patterns through the use of computer programs as morphogenetic programs like L-system, MoSS program and genetic algorithm programs like Grasshoper, Generative Components with the help of computing technology like mapping and scripting.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.620-626
• /
• 2004

For general nonlinear processes, it is difficult to control with a linear model-based control method and nonlinear controls are considered. Among the numerous approaches suggested, the most rigorous approach is to use dynamic optimization. Many general engineering problems like control, scheduling, planning etc. are expressed by functional optimization problem and most of them can be changed into dynamic programming (DP) problems. However the DP problems are used in just few cases because as the size of the problem grows, the dynamic programming approach is suffered from the burden of calculation which is called as 'curse of dimensionality'. In order to avoid this problem, the Neuro-Dynamic Programming (NDP) approach is proposed by Bertsekas and Tsitsiklis (1996). To get the solution of seriously nonlinear process control, the interest in NDP approach is enlarged and NDP algorithm is applied to diverse areas such as retailing, finance, inventory management, communication networks, etc. and it has been extended to chemical engineering parts. In the NDP approach, we select the optimal control input policy to minimize the value of cost which is calculated by the sum of current stage cost and future stages cost starting from the next state. The cost value is related with a weight square sum of error and input movement. During the calculation of optimal input policy, if the approximate cost function by using simulation data is utilized with Bellman iteration, the burden of calculation can be relieved and the curse of dimensionality problem of DP can be overcome. It is very important issue how to construct the cost-to-go function which has a good approximate performance. The neural network is one of the eager learning methods and it works as a global approximator to cost-to-go function. In this algorithm, the training of neural network is important and difficult part, and it gives significant effect on the performance of control. To avoid the difficulty in neural network training, the lazy learning method like k-nearest neighbor method can be exploited. The training is unnecessary for this method but requires more computation time and greater data storage. The pH neutralization process has long been taken as a representative benchmark problem of nonlin ar chemical process control due to its nonlinearity and time-varying nature. In this study, the NDP algorithm was applied to pH neutralization process. At first, the pH neutralization process control to use NDP algorithm was performed through simulations with various approximators. The global and local approximators are used for NDP calculation. After that, the verification of NDP in real system was made by pH neutralization experiment. The control results by NDP algorithm was compared with those by the PI controller which is traditionally used, in both simulations and experiments. From the comparison of results, the control by NDP algorithm showed faster and better control performance than PI controller. In addition to that, the control by NDP algorithm showed the good results when it applied to the cases with disturbances and multiple set point changes.

• Korean Journal of Biological Psychiatry
• /
• v.11 no.2
• /
• pp.77-87
• /
• 2004

Due to the high population prevalence of major depression and the strong emphasis on pharmacotherapy for this disorder, antidepressants are among the most frequently prescribed pharmacological agents. But the clinicians are still unable to predict accurately the response of their depressed patients to medication. This article reviews the biological predictors of treatment response including monoamine, neuroendocrine, pharmacogenetic, and psychophysiologic markers. The biological predictors of response, despite some interesting leads that may in the long term be of considerable importance, are not yet sufficiently established to be of routine clinical usefulness. Many of the predictive factors explored in this article are examples of mediators and moderators that affect outcomes. Each one alone may not provide definitive answers for predicting response to treatment, but each must be taken into account at the outset of treatment. It is clear that treatments must be individualized for each patient. It would be necessary to develop the algorithm in order to predict the responsiveness of antidepressant treatment with integration of the results from the previous studies.

• Proceedings of the KOSOMBE Conference
• /
• v.1998 no.11
• /
• pp.201-202
• /
• 1998

In this paper we suggested an automated method for detecting and counting rapid eye movement(REM) using EOG during sleep. This method is formulated by two step fuzzy logic. At first step, the velocity and the distance of single channel eye movement are used for the fuzzy input to get the possibility of being REM at each EOG. At second step, the two possibility values of both EOG from the first step and the correlation coefficient of both eye movements are used for the fuzzy logic input, and the output is the final possibility of being Rapid Eye Movement. We applied this algorithm to the normal and narcoleptic sleep data and compared the difference. We found the possibility that the count of REM can be a parameter that has significant physiological meanings.

• Journal of Biosystems Engineering
• /
• v.34 no.5
• /
• pp.331-341
• /
• 2009

A double-end rod hydraulic cylinder is widely used with a steering valve for the steering control system in large tractors. For the development of automatic steering controller, the feasibility of using a proportional control valve replacing the conventional manual steering valve to control the position of hydraulic steering cylinder was investigated in terms of the max. overshoot, the steady-state error and the rise time. A simulation model for the electrohydraulic steering system with load using AMESim package was developed to be valid so that the proper control algorithm could be chosen through the computer simulation. It could be concluded that the P-control algorithm was sufficient to control the electrohydraulic steering system, where the control frequency should be no greater than 20 Hz at the P-gain of 5. In particular, the performance of the developed steering controller was satisfactory even at the conditions of varying flow rates and loads.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2003.10a
• /
• pp.164-169
• /
• 2003

In this paper, we propose the integrated Bayesian network framework to reconstruct genetic regulatory networks from genome expression data. The proposed model overcomes the dimensionality problem of multivariate analysis by building coherent sub-networks from confined gene clusters and combining these networks via intermediary points. Gene Shaving algorithm is used to cluster genes that share a common function or co-regulation. Retrieved clusters incorporate prior biological knowledge such as Gene Ontology, pathway, and protein protein interaction information for extracting other related genes. With these extended gene list, system builds genetic sub-networks using Bayesian network with MDL score and Sparse Candidate algorithm. Identifying functional modules of genes is done by not only microarray data itself but also well-proved biological knowledge. This integrated approach can improve there liability of a network in that false relations due to the lack of data can be reduced. Another advantage is the decreased computational complexity by constrained gene sets. To evaluate the proposed system, S. Cerevisiae cell cycle data [1] is applied. The result analysis presents new hypotheses about novel genetic interactions as well as typical relationships known by previous researches [2].

• Proceedings of the KOSOMBE Conference
• /
• v.1991 no.05
• /
• pp.51-55
• /
• 1991

This paper describes an algorithm of pattern analysis of ECG signals by significant points extraction method. The significant points can be extracted by modified zerocrossing method, which method determines the real significant point among the significant point candidates by zerocrossing method and slope rate of left side and right side. This modified zerocrossing method improves the accuracy of detection of real significant point position. This paper also describes the pattern matching algorithm by a hierarchical AND/OR graph of ECG signals. The decomposition of ECG signals by a hierarchical AND/OR graph can make the pattern matching process easy and fast. Furthermore the pattern matching to the significant points reduces the processing time of ECG analysis.

• Proceedings of the KOSOMBE Conference
• /
• v.1991 no.05
• /
• pp.5-7
• /
• 1991

We have developed an efficient and robust image reconstruction algorithm for static impedance imaging. This improved Newton-Raphson method produced more accurate images by reducing the undesirable effects of the ill-conditioned Hessian matrix. We found that our electrical impedance tomography (EIT) system could produce two-dimensional static images from a physical phantom with 7% spatial resolution at the center and 5% at the periphery. Static EIT image reconstruction requires a large amount of computation. In order to overcome the limitations on reducing the computation time by algorithmic approaches, we implemented the improved Newton-Raphson algorithm on a parallel computer system and showed that the parallel computation could reduce the computation time from hours to minutes.

• Journal of Biomedical Engineering Research
• /
• v.37 no.1
• /
• pp.31-38
• /
• 2016

For the patients with bladder dysfunction, measurement of urine volume inside the bladder is very critical to avoid bladder failure. In measuring urine volume inside a bladder, low-resolution 3D ultrasound images are widely used. However, urine volume estimation from 3D ultrasound images is prone to big errors and inconsistency because of low spatial resolution and low signal-to-noise ratio of ultrasound images. We developed a new robust volume estimation algorithm which is not computationally expensive. We tested the algorithm on a lab-built ultrasound bladder phantom and volunteers. The average error rate of the human bladder volume estimation was 5.9% which was better than the commercial machine.

• Journal of Biomedical Engineering Research
• /
• v.16 no.3
• /
• pp.271-278
• /
• 1995

An ECG data compression algorithM using max-min slope update is proposed and a real time 3 channel ECG transmission system is implemented using the proposed algorithm. In order to effectively compress ECG data, we compare a threshold value with the max-min slope difference (MMSD) which is updated at each sample values. If this MMSD value is smaller than the threshold value, then the data is compressed. Conversely, when the MMSD value is larger than threshold value, the data is transmitted after storing the value and the length between the data which is beyond previous threshold level. As a result, it can accurately compress both the region of QRS, P, and T wave that has fast-changing and the region of the base line that slope is changing slow. Therefore, it Is possible to enhance the compression rate and the percent roms difference. In addition, because of the simplicity, this algorithm is more suitable for real-time implementation.