• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3C
• /
• pp.112-118
• /
• 2005

In this paper, we propose a new nonlinear matching measure for automatic analysis of the on-off type DNA microarray images in which the hybridized spots are detected by the template matching method. The proposed measure is obtained by binary-thresholding over the whole template region and taking the number of white pixels inside the spotted area. This measure is compared with the normalized covariance in terms of the classification ability of the successfulness of the locating markers. The proposed measure is evaluated for the scanned images of HPV DNA microarrays where the marker locating is a critical issue because of the small number of spots. The targeting spots of HPV DNA chips are designed for genotyping 22 types of the human papilloma virus(HPV). The proposed measure is proven to give more discriminative response reducing the miss cases of the successful marker locating.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.4
• /
• pp.396-401
• /
• 2006

It is well-known that a neural network with cyclic connections generates plural limit cycles, thus, being used as a memory system for storing large number of dynamic information. In this paper, a continuous-time cyclic connection neural network was built so that each neuron is connected only to its nearest neurons with binary synaptic weights of ${\pm}1$. The type and the number of limit cycles generated by such network has also been demonstrated through simulation. In particular, the effect of chaos signal for transition between limit cycles has been tested. Furthermore, it is evaluated whether the chaotic noise is more effective than random noise in the process of the dynamical neural networks.

• Convergence Security Journal
• /
• v.6 no.2
• /
• pp.53-60
• /
• 2006

In the applications such as CAD or image processing, a variety of geometric objects are manipulated. A polygon in which all the edges are parallel to x- or y-axis is decomposed into simple rectangles for efficient handling. But, depending on the partitioning algorithms, the same region can be decomposed into a completely different set of rectangles in the number, size and shape of rectangles. So, it is necessary an algorithm that compares two sets of rectangles extracted from two scenes such as CAD or image to see if they represent the same region. This paper proposes an efficient algorithm that compares two sets of rectangles. The proposed algorithm is not only simpler than the algorithm based on sweeping method, but also reduces the number $O(n^2)$ of overlapped rectangles from the algorithm based on a balanced binary tree to O(nlogn).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.5
• /
• pp.871-876
• /
• 2006

In this thesis, to accurately measure 3D face information using the spatial encoding patterns, the new algorithm to segment the pattern images from initial face pattern image is proposed. If the obtained images is non-homogeneous texture and ambiguous boundary pattern, the pattern segmentation is very difficult. Furthermore. the non-encoded areas by accumulated error are occurred. In this thesis, the FCM(fuzzy c-means) clustering method is proposed to enhance the robust encoding and segmentation rate under non-homogeneous texture and ambiguous boundary pattern. The initial parameters for experiment such as clustering class number, maximum repetition number, and error tolerance are set with 2, 100, 0.0001 respectively. The proposed pattern segmentation method increased 8-20% segmentation rate with conventional binary segmentation methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.3
• /
• pp.627-633
• /
• 2013

An important problem in the transmission performance and efficiency is to find the values and the number of the cross-correlation function between two different maximal sequences. In this paper, we present the new maximal sequences which are obtained by the new decimations $d=\frac{2^{m-st-1}}{2^s-1}(2^n+2^{st+s+1}-2^{m+st+1}-1)$ from some maximal sequences. We will also find the values and the number of occurrences of each value of the cross-correlation function from the proposed decimations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8B
• /
• pp.802-808
• /
• 2002

In this paper, a new signal constellation design method is proposed for Multi-Phase(MP)/CDMA and its performance is compared with that of conventional method. In general MPSK modulation, the neighbor phases are allocated to the symbols that have only one different bit. However, the neighbor phases are allocated to the signal levels that have small differences in amplitude after clipping process since the transmitting signals in MP/CDMA are not binary symbols but the signal levels. The analysis shows that the performance of proposed scheme is much better than that of conventional method and it is better to increase the number of clipping levels than decrease the number of clipping levels and increase the region of guard phase.

• The Korean Journal of Health Service Management
• /
• v.14 no.1
• /
• pp.137-146
• /
• 2020

Objectives: The aim of this study was to investigate cognitive function decline by socio-demographic and health-related characteristics (health behaviors and health status) using 5th Korean Longitudinal Study of Aging panel data. Methods: The subjects were 4,440 community-dwelling people aged over 57 years. The data were analyzed with descriptive statistics, frequency analysis, χ²-test, and binary logistic regression analysis using SPSS ver. 25.0. Results: The findings revealed that socio-demographic characteristics (gender, age, area of residence, educational level, marital status, number of children, number of grand-children) and health-related characteristics (smoking, drinking, regular exercise, weight category by body mass index, hypertension and diabetes mellitus) were factors that influenced cognitive function decline (p<.05). Conclusions: Cognitive function decline was closely related to health behaviors and disease types. Future studies must examine related constructs to accurately determine these relationships among various populations. The present study could be used as a tool for the development and implementation of health promotion and prevention strategies.

• Korean Chemical Engineering Research
• /
• v.50 no.1
• /
• pp.61-65
• /
• 2012

The onset of convection in a mushy layer is analyzed by using linear stability theory in time-dependent solidification of a binary melt. A simplified model of a near-eutectic mush, in which the mush is assumed to be a porous block, is used and the propagation theory is applied to determine the critical conditions for the onset of convection. The present critical Rayleigh number is higher than the existing experimental result and also theoretical results obtained by considering the mushy layer with an overlying liquid layer. The constant pressure (permeable) condition applied on the mush-liquid interface produces a lower critical Rayleigh number, which is closer to the experimental results of aqueous ammonium chloride solution, compared with the impermeable condition.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.13 no.21
• /
• pp.91-100
• /
• 1990

This paper is concerned with the development of optimal algorithms for multi-stage flowshop scheduling problems with sequence dependent setup times. In the previous researches the setup time of a job is considered to be able to begin at the earliest opportunity given a particular sequence at the start of operations. In this paper the setup time of a job is considered to be able to begin only at the completion of that job on the previous machine to reflect the effects of the setup time to the performance measure of sequence dependent setup time flowshop scheduling. The results of the study consist of two areas; first, a general integer programming(IP) model is formulated and a nixed integer linear programming(MILP) model is also formulated by introducing a new binary variable. Second a depth-first branch and bound algorithm is developed. To reduce the computational burdens we use the best heuristic schedule developed by Choi(1989) as the first trial. The experiments for developed algorithm are designed for a 4$\times$3$\times$3 factorial design with 360 observations. The experimental factors are PS(ratio of processing time to setup time), M(number of machines), N(number of jobs).

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.781-791
• /
• 1999

DD(Decision Diagrams) is an efficient operational data structure for an optimal expression of boolean functions. In a graph-based synthesis using DD, the goal of optimization decreases representation space for boolean functions. This paper represents boolean functions using OPKFDD(Ordered Pseudo-Kronecker Functional Decision Diagrams) for a graph-based synthesis and is based on the number of nodes as the criterion of DD size. For a property of OPKFDD that is able to select one of different decomposition types for each node, OPKFDD is variable in its size by the decomposition types selection of each node and input variable order. This paper proposes a method for generating OPKFDD efficiently from the current BDD(Binary Decision Diagram) Data structure and an algorithm for minimizing one. In the multiple output functions, the relations of each function affect the number of nodes of OPKFDD. Therefore this paper proposes a method to decide the input variable order considering the above cases. Experimental results of comparing with the current representation methods and the reordering methods for deciding input variable order are shown.