• Bulletin of the Korean Mathematical Society
• /
• v.54 no.1
• /
• pp.1-15
• /
• 2017

Kanenobu has given infinite families of knots with the same HOMFLY polynomial invariant but distinct Alexander module structure. In this paper, we give a recursive formula for the Khovanov cohomology of all Kanenobu knots K(p, q), where p and q are integers. The result implies that the rank of the Khovanov cohomology of K(p, q) is an invariant of p + q. Our computation uses only the basic long exact sequence in knot homology and some results on homologically thin knots.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.937-940
• /
• 1995

The purpose of this paper is to present a nonlinear system identification method, where an adaptive nonlinear recursive state-spare(ANRSS) filter is employed as its filter structure, and a variable step (VS) algorithm is applied as its adaptation law. To demonstrate the validity of the proposed method, some simulation results are included.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3247-3261
• /
• 2000

In recent years, as the complexity of signal processmg systems Increases, the needs for dcslgners to mlx up hardware-part and software-part grow more and more considering both performance and cost There exist many algorilhms In C for vanous Signal processung apphcations. We have to translate the algonlhm C to hardware descnptlon language(HDL), If portion or the algonlhm needs to be unplcmenled in hardwarc pari of the syslcm. For this translation. it's dtfftcult to handle dynamic memory allocalion, function calls, pointer manipoJalion. This research shows a design method for a hardware model about recursive calls which was classified into software part of the system previously [or the translation from C to VHDL. The benefits of havlIlg recursive calls m hardware structure can be quite high since provides flexbility in hardware/software partitioming in codesign sysem.

• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.1740-1741
• /
• 2011

This paper proposes a new linear recursive target state estimator for automotive collision warning system. The target motion is modeled in Cartesian coordinate system while the radar measurements such as range, line-of-sight angle and range rate are obtained in polar coordinate system. To solve the problem by nonlinear relation between these two coordinate system, a practical linear filter design scheme employing the predicted line-of-sight Cartesian coordinate system (PLCCS) is proposed. Especially, PLCCS can effectively incorporate range rate measurements into target tracking system. It is known that the utilization of range rate measurements enables the improvement of target tracking performance. Moreover, PLCCS based target tracking system is implemented by linear recursive filter structure and hence is more suitable scheme for the development of reliable collision warning system. The performance of the proposed method is demonstrated by computer simulations.

• Proceedings of the KSME Conference
• /
• 2007.05a
• /
• pp.512-517
• /
• 2007

In the previous development of the recursive thermostat chained fully flexible cell molecular dynamics simulation, implicit time integration method such as generalized leapfrog integration is used. The implicit algorithm is very much complicated and not easy to show time reversibility because it is solved by the nonlinear iterative procedure. Thus we develop simple, explicit symplectic time integration formula for the recursive thermostat chained fully flexible unit cell simulation. Uniaxial tension test is performed to verify the present explicit algorithm. We check that the present simulation satisfies the ergodic hypothesis for various values of fictitious mass and coefficient of multiple thermostat system. The proposed method should be helpful to predict mechanical and thermal behavior of nano-scale structure.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.4E
• /
• pp.31-36
• /
• 1999

Circulant Feedback Delay Networks (CFDN's), whose feedback matrix is circulant to control the stability of system and time-frequency response easier than unitary one, were recently proposed. However, the drawback of this structure is that the flatness of the frequency response of CFDN's is not enough and it is difficult to adjust the placement of zeros to decrease this problem. Therefore, we propose Modified CFDN's (MCFDN's) consisted of a general recursive filter and CFDN's to maintain maximally the impulse response of CFDN's and improve the flatness of frequency response without adjusting the placement of zeros. The delay unit of a general recursive filter's feedback loop is replaced by CFDN's, are omitted the direct path. We represent the usefulness of MCFDN's to build artificial reverberators and the main parameter to determine characteristics of MCFDN's in this paper.

• Journal of Korea Planning Association
• /
• v.53 no.7
• /
• pp.67-86
• /
• 2018

This paper attempted to analyze impacts of transition in electricity generation system on a national economy and environmental level in Korea using a recursive computable general equilibrium(CGE) model. In particular, the paper presented a hybrid model combining the top-down CGE model with the bottom-up model which describes the structure of electricity production in detail. The impacts were analyzed by two policy scenarios base on the basic plan for electricity supply and demand proposed by the Korean government. As a result, the paper specifically showed that there exists a trade-off relationship in the policy-making between economic efficiency and environmental level. The paper also suggested that the transition in electricity generation system should be done more gradually and carefully.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2019.06a
• /
• pp.98-101
• /
• 2019

At present, deep convolutional neural networks have made a very important contribution in single-image super-resolution. Through the learning of the neural networks, the features of input images are transformed and combined to establish a nonlinear mapping of low-resolution images to high-resolution images. Some previous methods are difficult to train and take up a lot of memory. In this paper, we proposed a simple and compact deep recursive residual network learning the features for single image super resolution. Global residual learning and local residual learning are used to reduce the problems of training deep neural networks. And the recursive structure controls the number of parameters to save memory. Experimental results show that the proposed method improved image qualities that occur in previous methods.

• Journal of KIISE
• /
• v.44 no.11
• /
• pp.1231-1235
• /
• 2017

Given the network structure in online social network, it is important to determine a way to distinguish spam accounts from the network features. In online social network, the service provider attempts to detect social spamming to maintain their service quality. However the spammer group changes their strategies to avoid being detected. Even though the spammer attempts to act as legitimate users, certain distinguishable structural features are not easily changed. In this paper, we investigate a way to generate meaningful network structure features, and suggest spammer detection method using recursive structural features. From a result of real-world dataset experiment, we found that the proposed algorithm could improve the classification performance by about 8%.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.999-1007
• /
• 1999

이 논문은 재귀원형군 G(2^m , 2^k )를 그래프 이론적 관점에서 고찰하고 정점이 서로소인 사이클과 그래프 invariant에 관한 위상 특성을 제시한다. 재귀원형군은 1 에서 제안된 다중 컴퓨터의 연결망 구조이다. 재귀원형군 {{{{G(2^m , 2^k )가 길이 사이클을 가질 필요 충분 조건을 구하고, 이 조건하에서 G(2^m , 2^k )는 가능한 최대 개수의 정점이 서로소이고 길이가l`인 사이클을 가짐을 보인다. 그리고 정점 및 에지 채색, 최대 클릭, 독립 집합 및 정점 커버에 대한 그래프 invariant를 분석한다.Abstract In this paper, we investigate recursive circulant G(2^m , 2^k ) from the graph theory point of view and present topological properties of G(2^m , 2^k ) concerned with vertex-disjoint cycles and graph invariants. Recursive circulant is an interconnection structure for multicomputer networks proposed in 1 . A necessary and sufficient condition for recursive circulant {{{{G(2^m , 2^k ) to have a cycle of lengthl` is derived. Under the condition, we show that G(2^m , 2^k ) has the maximum possible number of vertex-disjoint cycles of length l`. We analyze graph invariants on vertex and edge coloring, maximum clique, independent set and vertex cover.