• Molecules and Cells
• /
• v.42 no.7
• /
• pp.512-522
• /
• 2019

Chromosomes located in the nucleus form discrete units of genetic material composed of DNA and protein complexes. The genetic information is encoded in linear DNA sequences, but its interpretation requires an understanding of three-dimensional (3D) structure of the chromosome, in which distant DNA sequences can be juxtaposed by highly condensed chromatin packing in the space of nucleus to precisely control gene expression. Recent technological innovations in exploring higher-order chromatin structure have uncovered organizational principles of the 3D genome and its various biological implications. Very recently, it has been reported that large-scale genomic variations may disrupt higher-order chromatin organization and as a consequence, greatly contribute to disease-specific gene regulation for a range of human diseases. Here, we review recent developments in studying the effect of structural variation in gene regulation, and the detection and the interpretation of structural variations in the context of 3D chromatin structure.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.467-470
• /
• 1994

In this paper, we develop two sufficient conditions for Schur stability of convex combinations of discrete time polynomials. We give conditions under which Schur stability of the extremes implies Schur stability of the entire convex combination. These results are based on Bhattacharyya's result(1991), the AHMC theory in Barmish and Kang's paper (1993) and the bilinear transformation. Important applications of the results involves robust Schur stability of a feedback system having degenerate interval plants in an extreme point context.

• Journal of KIISE:Information Networking
• /
• v.30 no.1
• /
• pp.17-23
• /
• 2003

In this Paper. we Propose a digital watermarking scheme for digital images based on a perceptual model, the frequency masking, texture making, and luminance masking Properties of the human visual system(HVS), which have been developed in the context of image compression. We embed two types of watermark, one is pseudo random(PN) sequences, the other is a logo image. To embed the watermarks, original images are decomposed into $8\times8$ blocks, and the discrete cosine transform(DCT) is carried out for each block. Watermarks are casted in the low frequency components of DCT coefficients. The perceptual model adjusts adaptively scaling factors embedding watermarks according to the local image properties. Experimental results show that the proposed scheme presents better results than that of non-perceptual watermarking methods for image qualify without loss of robustness.

• Journal of IKEEE
• /
• v.22 no.4
• /
• pp.999-1005
• /
• 2018

This paper proposed a search-based high resolution frequency estimation method in power systme. The proposed frequency estimation method adopts a slope-based adaptive search as a base of adaptive estimation structure. The architectural and operational parameters in this adaptive algorithm are changed using the information from context layer analysis of the signals including a localized full-search of spectral peak. The convergence rate of the proposed algorithm becomes much faster than those of other conventional slope-based adaptive algorithms by effectively reducing search range with the application of the localized full-search of spectrum peak. The improvements in accuracy and convergence rate of the proposed algorithm are confirmed through the performance comparison with other representative frequency estimation methods, such as, DFT(discrete Fourier transform) method, ECKF(extended complex Kalman filter), and MV(minimum variable) method.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.3
• /
• pp.11-25
• /
• 2012

We present the method to infer Context-Free Grammars by applying genetic algorithm to the Binary Third-order Recurrent Neural Networks(BTRNN). BTRNN is a multiple-layered architecture of recurrent neural networks, each of which is corresponding to an input symbol, and is combined with external stack. All parameters of BTRNN are represented as binary numbers and each state transition is performed with any stack operation simultaneously. We apply Genetic Algorithm to BTRNN chromosomes and obtain the optimal BTRNN inferring context-free grammar of positive and negative input patterns. This proposed method infers BTRNN, which includes the number of its states equal to or less than those of existing methods of Discrete Recurrent Neural Networks, with less examples and less learning trials. Also BTRNN is superior to the recent method of chromosomes representing grammars at recognition time complexity because of performing deterministic state transitions and stack operations at parsing process. If the number of non-terminals is p, the number of terminals q, the length of an input string k, and the max number of BTRNN states m, the parallel processing time is O(k) and the sequential processing time is O(km).

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.6
• /
• pp.1541-1549
• /
• 1997

Many classification algorithms require that training examples contain only discrete values. In order to use these algorithms when some attributes have continuous numeric values, the numeric attributes must be converted into discrete ones. This paper describes a new way of discretizing numeric values using information theory. Our method is context-sensitive in the sense that it takes into account the value of the target attribute. The amount of information each interval gives to the target attribute is measured using Hellinger divergence, and the interval boundaries are decided so that each interval contains as equal amount of information as possible. In order to compare our discretization method with some current discretization methods, several popular classification data sets are selected for experiment. We use back propagation algorithm and ID3 as classification tools to compare the accuracy of our discretization method with that of other methods.

• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• pp.1-1
• /
• 2003

In this talk, a reduced-order modeling methodology based on centroidal Voronoi tessellations (CVT's)is introduced. CVT's are special Voronoi tessellations for which the generators of the Voronoi diagram are also the centers of mass (means) of the corresponding Voronoi cells. The discrete data sets, CVT's are closely related to the h-means clustering techniques. Even with the use of good mesh generators, discretization schemes, and solution algorithms, the computational simulation of complex, turbulent, or chaotic systems still remains a formidable endeavor. For example, typical finite element codes may require many thousands of degrees of freedom for the accurate simulation of fluid flows. The situation is even worse for optimization problems for which multiple solutions of the complex state system are usually required or in feedback control problems for which real-time solutions of the complex state system are needed. There hava been many studies devoted to the development, testing, and use of reduced-order models for complex systems such as unsteady fluid flows. The types of reduced-ordered models that we study are those attempt to determine accurate approximate solutions of a complex system using very few degrees of freedom. To do so, such models have to use basis functions that are in some way intimately connected to the problem being approximated. Once a very low-dimensional reduced basis has been determined, one can employ it to solve the complex system by applying, e.g., a Galerkin method. In general, reduced bases are globally supported so that the discrete systems are dense; however, if the reduced basis is of very low dimension, one does not care about the lack of sparsity in the discrete system. A discussion of reduced-ordering modeling for complex systems such as fluid flows is given to provide a context for the application of reduced-order bases. Then, detailed descriptions of CVT-based reduced-order bases and how they can be constructed of complex systems are given. Subsequently, some concrete incompressible flow examples are used to illustrate the construction and use of CVT-based reduced-order bases. The CVT-based reduced-order modeling methodology is shown to be effective for these examples and is also shown to be inexpensive to apply compared to other reduced-order methods.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2016.05a
• /
• pp.326-326
• /
• 2016

The fault can be defined, in a geological context, as a rupture plane showing a significant displacement generated in the case that the local tectonic stress exceeds a threshold of rupture along a particular plane in a rock mass. The hydrogeological properties of this fault can be varied with the spatial distribution and the connectivity of void spaces in a fault. When the formation of fault includes the process of the creation and the destruction of void spaces, a complex relation between the displacement along the fault and the variation of void spaces. In this study, the variation of flow with the geometrical characteristics of the fault is simulated and analyzed by using the three-dimensional discrete fracture network model. Three different geometrical characteristics of the faults are considered in this study: 1) simple hydraulic conductive plane, 2) damaged zone, and 3) relay structure of faults.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.552-555
• /
• 2007

지상파 DMB등에서 많이 사용하고 있는 기술은 H.264이다. 이 H.264는 적은 비트율에 비하여 고해상도의 영상을 만들어 낸다. 이런 손실압축을 하기 위해서 인트라와 인터등과 같은 전처리 과정과 DCT(Discrete Cosine Transform), 양자화 등등이 존재하지만 H.264에서 실제로 압축이 되는 부분은 엔트로피코딩이다. H.264에서는 Exp-Golomb과 CAVLC(Context-Adaptive Variable Length Coding), CABAC(Context-Adaptive Binary Arithmetic Coding) 세 가지를 지원하고 있다. 이중 CAVLC는 테이블을 기반으로한 압축기법을 사용한다. 테이블을 이용할 때는 코드워드의 길이와 값을 비교하는 방식을 사용하게 된다. 이는 수 많은 메모리 접속으로 인한 전력소모와 연산지연을 가져온다. 본 논문에서는 전송된 비트스트림에서 데이터를 찾을 때 코드워드의 길이와 값을 테이블에 비교해서 찾지 않고 테이블에 존재하는 규칙을 수식화 하여 찾을 수 있도록 하였다. 이는 최초 '1'이 나올때까지의 '0'의 개수와 그 이후 존재하는 코드의 값을 이용하여서 각 단계에 필요한 데이터를 추출해 낸다. 위와 같은 알고리즘을 이용하여 VHDL언어로 설계하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.425-428
• /
• 2005

This paper is made up Advanced Image Coding(AIC) that combines algorithms from next generation image coding standard, H.264/MPEG-4 Part 10 advanced video coding(AVC) and still image compression standard, JPEG(Joint Photographic Experts Group). AIC combines intra frame block prediction from H.264 with a JPEG style discrete cosine transform and quantization, followed by Context-based Adaptive Binary Arithmetic Coding(CABAC) as used in H.264. In this paper, we analyzes the efficiency of the AIC algorithm and JPEG and JPEG-2000, and it presents of result.