• 한국생물공학회:학술대회논문집
• /
• 2003.10a
• /
• pp.746-749
• /
• 2003

Alignment of 2D-gel images of biological samples can visualize the difference of expression profiles and also inform us candidates of protein spots to be further analyzed. However, comparison of two proteome images between case and control does not always successfully identify differentially expressed proteins due to sample-to-sample variation. Because of poor reproducibility of 2D-gel electrophoresis, sample-by-sample variations and inconsistent electrophoresis conditions, multiple number of 2D-gel image must be processed to align each other to visualize the difference of expression profiles and to deduce the protein spots differentially expressed with reliability. Alignment of multiple 2D-Gel images and their clustering were carried out by applying various algorithms and statistical methods. In order to align multiple images, multiresolution-multilevel algorithm was found out to be suitable for fast alignment and for distorted images. Clustering of 12 different images implementing a k-means algorithm gives a phylogenetic tree of distance map of the proteomes. Microsoft Visual C++ was used to implement the algorithms in this work.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.27-30
• /
• 2005

3개 이상의 DNA 혹은 단백질의 염기서열을 정렬하는 다중 서열 정렬(multiple sequence alignment, MSA)은 서열들 사이의 진화관계, 단백질의 구조와 기능에 관한 연구에 필수적인 도구이다. 최적화된 다중서열 정렬을 얻기 위해 사용되는 가장 유용한 방법은 동적 프로그래밍이다. 그러나 동적프로그래밍은 정렬하고자 하는 서열의 수가 증가함에 따라 시간도 지수함수($O(n^k)$)로 증가하기 때문에 다중 서열 정렬에는 효율적이지 못하다. 따라서, 본 논문에서는 최적의 MSA 문제를 해결하기 위해 클러스터링 기반의 새로운 다중 서열 정렬 (Clustering-based Multiple Sequence Alignment, CMSA) 알고리즘을 제안한다. 결과적으로 제안한 CMSA 알고리즘의 기여도는 다중 서열 정렬의 질적 향상과 처리 시간 단축($O(n^3L^2)$)이 기대된다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5324-5337
• /
• 2017

In this paper, we investigate the feasibility of interference alignment(IA) in signal space in the scenario of multiple cell and multiple user cellular networks, as the feasibility issue is closely related to the solvability of a multivariate polynomial system, we give the mathematical analysis to support the constraint condition obtained from the polynomial equations with the tools of algebraic geometry, and a new distribute IA algorithm is also provided to verify the accessibility of the constraint condition for symmetric system in this paper. Simulation results illustrate that the accessibility of the constraint condition is hold if and only if the degree of freedom(DoF) of each user can be divided by both the transmit and receive antenna numbers.

• Asia pacific journal of information systems
• /
• v.32 no.2
• /
• pp.395-434
• /
• 2022

The importance of Business-IT alignment has been well emphasized, and the topic has been a top management concern for the past four decades. The current business environment demands in response to digitalization have made Business-IT alignment even more challenging. We take on the challenge in this research by presenting a comprehensive review of the domain of Business-IT alignment, based on a conceptual model which we propose, to facilitate future theoretical work. The review brought out multiple representations of the concept of Business-IT alignment and the characterization of its antecedents, nature, and outcomes. Based on the treatment of the domain in the extant literature, we chart out possible areas of future explorations. By doing so, this research lays a foundation for continuing inquiry on Business-IT alignment and facilitating future theoretical work.

• Journal of KIISE
• /
• v.43 no.3
• /
• pp.289-295
• /
• 2016

Malware authors spread malware variants in order to evade detection. It's hard to detect malware variants using static analysis. Therefore dynamic analysis based on API call information is necessary. In this paper, we proposed a malware family recommendation method to assist malware analysts in classifying malware variants. Our proposed method extract API call information of malware families by dynamic analysis. Then the multiple sequence alignment technique was applied to the extracted API call information. A signature of each family was extracted from the alignment results. By the similarity of the extracted signatures, our proposed method recommends three family candidates for unknown malware. We also measured the accuracy of our proposed method in an experiment using real malware samples.

• Bulletin of the Korean Space Science Society
• /
• 2008.10a
• /
• pp.34.4-35
• /
• 2008

The significant I&T process gain represented by reduction in overall budget expenditure can be obtained from the use of efficient alignment technique for large space optical systems. Such process gain tends to increase rapidly with an increase in aperture and/or in number of optical elements within the system. However, in practice, the alignment of multiple optical components tends to be rather difficult task because of the multiple coupling effects among the elements within the target system. In order to understand and hence identify the complex interplay of the wavefront coupling effects from the alignment process, the original differential wavefront sampling(DWS) method was presented elsewhere in recent years. DWS uses partial differential of the wavefront of optical component and perturbation value of the optical component against a particular alignment factor. The straightforward application of DWS for an off-axis optical system revealed that it tends to give incorrect estimation of the given misalignment state. In this study, we added off-axis correction terms to the original DWS algorithm and investigated its alignment performance. The performance simulation result for a Korsch type space optical system shows that the modified DWS is capable of bringing the misaligned system into the target alignment tolerance only after 3 iterations. It also shows that this new improved algorithm can be used to estimate the source misalignment as well. We are planning to apply this method for the alignment of a 800mm Korsch type telescope in the near future. We discuss the computational technique, simulation results and implications in details.

• Journal of Communications and Networks
• /
• v.16 no.1
• /
• pp.18-25
• /
• 2014

In this paper, we propose a codebook-based interference alignment (IA) scheme in the constant multiple-input multiple-output (MIMO) interference channel especially for the uplink scenario. In our proposed scheme, we assume cooperation among base stations (BSs) through reliable backhaul links so that global channel knowledge is available for all BSs, which enables BS to compute he transmit precoder and inform its quantized index to the associated user via limited rate feedback link. We present an upper bound on the rate loss of the proposed scheme and derive the scaling law of the feedback load to maintain a constant rate loss relative to IA with perfect channel knowledge. Considering the impact of overhead due to training, cooperation, and feedback, we address the effective degrees of freedom (DOF) of the proposed scheme and derive the maximization of the effective DOF. From simulation results, we verify our analysis on the scaling law to preserve the multiplexing gain and confirm that the proposed scheme is more effective than the conventional IA scheme in terms of the effective DOF.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.635-656
• /
• 2019

In this paper, we investigate the degrees of freedom (DoF) of a multi-cell multi-user multiple-input multiple-output (MIMO) interference broadcast channel (IBC) with non-cooperation distributed base stations (BS), where each BS serves users of its corresponding cell. When all BSs simultaneously transmit their own signals over the same frequency band in the MIMO IBC, the edge users in each cell will suffer the inter-cell interference (ICI) and inter-user interference (IUI) signals. In order to eliminate the ICI and IUI signals, a distributed space time interference alignment (DSTIA) approach is proposed where each BS has only limited access to distributed moderately-delay channel state information at the transmitter (CSIT). It is shown that the DSTIA scheme can obtain the appreciate DoF gains. In addition, the DoF upper bound is asymptotically achievable as the number of antenna at each BS increases. It is shown that the DSTIA method can get DoF gains over other interference alignment schemes with delayed CSIT in literature. Moreover, the DSTIA method can attain higher DoFs than the IA schemes with global CSIT for certain antenna configurations.

• The Korean Journal of Applied Statistics
• /
• v.19 no.3
• /
• pp.555-564
• /
• 2006

Friedman rank-sum multiple comparison procedure is often applied to nonparametric multiple comparison method under randomized block design. Since this method does not use between-block information, we propose, in this paper, nonparametric multiple comparison procedures employing aligned method suggested by Hedges and Lehmann(1962) under randomized block design. The proposed procedure and Friedman procedure are compared by Monte Carlo simulation study.

• The Journal of the Korea Contents Association
• /
• v.11 no.3
• /
• pp.18-25
• /
• 2011

In a manufacturing process of metal coins, surface defects of coins are manually detected. This paper describes an new method for detecting surface defects of metal coins on a moving conveyor belt using image processing. This method consists of multiple procedures: segmentation of a coin from the background, alignment of the coin to the model, projection of the aligned coin to the best eigen image space, and detection of defects by comparison of the projection error with an adaptive threshold. In these procedures, the alignement and the projection are newly developed in this paper for the detection of coin surface defects. For alignment, we use the histogram of the segmented coin, which converts two-dimensional image alignment to one-dimensional alignment. The projection reduces the intensity variation of the coin image caused by illumination and coin rotation change. For projection, we build multiple eigen image spaces and choose the best eigen space using estimated coin direction. Since each eigen space consists of a small number of eigen image vectors, we can implement the projection in real- time.