• 대한기계학회논문집A
• /
• 제31권8호
• /
• pp.826-832
• /
• 2007

Fully flexible cell preserves Hamiltonian in structure so that the symplectic time integrator is applicable to the equations of motion. In the direct formulation of fully flexible cell N-Sigma-T ensemble, a generalized leapfrog time integration (GLF) is applicable for fully flexible cell simulation, but the equations of motion by GLF has structure of implicit algorithm. In this paper, the time integration formula is derived for the fully flexible cell molecular dynamics simulation by using the splitting time integration. It separates flexible cell Hamiltonian into terms corresponding to each of Hamiltonian term. Thus the simple and completely explicit recursion formula was obtained. We compare the performance and the result of present splitting time integration with those of the implicit generalized leapfrog time integration.

• 대한수학회지
• /
• 제36권4호
• /
• pp.707-723
• /
• 1999

Since the modular curve $X(4)=\Gamma(4)/{\mathfrak{}}^*$ has genus 0, we have a field isomorphism K(X(4)){\approx}\mathcal{C}(j_{4})$ where $j_{4}(z)={\theta}_{3}(\frac{z}{2})/{\theta}_{4}(\frac{z}{2})$ is a quotient of Jacobi theta series ([9]). We derive recursion formulas for the Fourier coefficients of $j_4$ and $N(j_{4})$ (=the normalized generator), respectively. And we apply these modular functions to Thompson series and the construction of class fields.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2007년도 추계종합학술대회
• /
• pp.543-546
• /
• 2007

이 논문에서는 정보 영재의 사고력 신장을 위한 교육 프로그램으로 트리 기반의 모델을 제시하고 분석한다. 제시된 모델은 문제를 표현하는 트리(tree)의 유형에 따라 AND 트리, OR 트리, AND/OR 트리로 구분하여 문제를 해결하는 모텔들로 세분화 된다. 구성되는 트리의 유형에 따라 문제를 해결하는 방법론으로는 서로 상이한 알고리즘을 적용해야함을 보이고 있다. 구성되는 트리의 모형에 따라 적용되는 알고리즘에는 recursion과 heuristic 탐색 방법 등이 도입되어 적용된다. 이 모델은 저 수준의 사고력을 요구하는 간단한 모형에서 출발하여 고 수준의 사고력을 요구하는 복잡한 모형으로 발전시키는 교육 방법을 제시함으로써 사고력 신장의 정도에 따라 초등학교 학생들로부터 중학교, 고등학교 학생들에 이르기 까지 대상을 확대하여 점진적으로 적용할 수 있는 교육 방법이 될 수 있을 것으로 사료된다.

• Korean Journal of Mathematics
• /
• 제16권4호
• /
• pp.481-494
• /
• 2008

Iteration functions $K_m(z)$ and $U_m(z)$, $m{\geq}2$are defined recursively using the determinant of a matrix. We show that the fixed-iterations of $K_m(z)$ and $U_m(z)$ converge to a simple zero with order of convergence m and give closed form expansions of $K_m(z)$ and $U_m(z)$: To show the convergence, we derive a recursion formula for $L_m$ and then apply the idea of Ford or Pomentale. We also find a Toeplitz matrix whose determinant is $L_m(z)/(f^{\prime})^m$, and then we adapt the well-known results of Gerlach and Kalantari et.al. to give closed form expansions.

• 한국통신학회논문지
• /
• 제31권4C호
• /
• pp.303-309
• /
• 2006

By combining the space-time diversity technique and iterative turbo codes, space-time turbo codes(STTCS) are able to provide powerful error correction capability. However, the multi-path transmission and iterative decoding structure of STTCS make the decoder very complex. In this paper, we propose a low complexity decoder, which can be used to decode STTCS as well as general iterative codes such as turbo codes. The efficient implementation of the backward recursion and the log-likelihood ratio(LLR) update in the proposed algorithm improves the computational efficiency. In addition, if we approximate the calculation of the joint LLR by using the approximate ratio(AR) algorithm, the computational complexity can be reduced even further. A complexity analysis and computer simulations over the Rayleigh fading channel show that the proposed algorithm necessitates less than 40% of the additions required by the conventional Max-Log-MAP algorithm, while providing the same overall performance.

• 한국통신학회논문지
• /
• 제25권10B호
• /
• pp.1785-1792
• /
• 2000

In this paper multi-rate non-recursive architecture for CIC(Cascaded Integrator-Comb) decimation filters with an arbitrary factor is proposed. The CIC filters are widely used in high speed wireless communication systems since they have multiplier-less and multi-rate low-power structure. Even conventional non-recursive CIC structure is multi-rate this architecture can be structured only in case of M-th power-of-two decimation factor. This paper proposes that muli-rate non-recursive CIC architecture can be structured with an any decimation factor of product form. Power consumption of the proposed architecture is compared with that of the conventional non-recursion architecture.

• Journal of Magnetics
• /
• 제15권1호
• /
• pp.1-6
• /
• 2010

The magnetic properties of amorphous Fe were investigated by examining the electronic structures of structurally disordered Fe systems generated from crystalline bcc and fcc Fe using a Monte-Carlo simulation. As a rst principles band method, the real space spin-polarized tight-binding linearized-mun-tin-orbital recursion method was used in the local spin density approximation. Compared to the crystalline system, the electronic structures of the disordered systems were characterized by a broadened band width, smoothened local density of states, and reduced local magnetic moment. The magnetic structures depend on the short range configurations. The antiferromagnetic structure is the most stable for a bcc-based disordered system, whereas the noncollinear spin spiral structure is more stable for a fcc-based system.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제14권3호
• /
• pp.209-215
• /
• 2014

Sequence tagging is the task of predicting frame-wise labels for a given input sequence and has important applications to diverse domains. Conventional methods such as maximum likelihood (ML) learning matches global features in empirical and model distributions, rather than local features, which directly translates into frame-wise prediction errors. Recent probabilistic sequence models such as conditional random fields (CRFs) have achieved great success in a variety of situations. In this paper, we introduce a novel discriminative CRF learning algorithm to minimize local feature mismatches. Unlike overall data fitting originating from global feature matching in ML learning, our approach reduces the total error over all frames in a sequence. We also provide an efficient gradient-based learning method via gradient forward-backward recursion, which requires the same computational complexity as ML learning. For several real-world sequence tagging problems, we empirically demonstrate that the proposed learning algorithm achieves significantly more accurate prediction performance than standard estimators.

• 대한전자공학회논문지
• /
• 제21권2호
• /
• pp.8-12
• /
• 1984

비선형 공정제어 문제에서 자주 요구되는 비선형 대수방정식들을 푸는 알고리즘을 제시하고자 한다. 먼저 방정식 변수들을 매개 변수화한 후 순환 식별 기법(recursive identification technique)을 적용하여 새로운 알고리즘을 구성한다. 결과적인 알고리즘의 형태와 그 특성은 Broyden의 Quasi-Newton법과 유사하지만, 그 유도과정과 순환식은 차이가 있으며, Broaden의 방법이 갖고 있는 거의 모든 장점을 갖고 있으면서 몇몇 풀기 어려운 함수에 대하여 더욱 빠르고 믿을 수 있음을 수치 비교로 알 수 있었다.

• 한국언어정보학회지:언어와정보
• /
• 제2권1호
• /
• pp.1-41
• /
• 1998

Evaluation of multilingual translation fundamentally involves measurement of meaning equivalences between the formally mapped discourses/texts of SL(source language) and TL(target language) both represented by a metalanguage called IL(interlingua). Unlike a usaal uni-directional MT(machine translation) model(e.g.:SL $\rightarrow$ analysis $\rightarrow$ transfer $\rightarrow$ generation $\rightarrow$ TL), a bi-directional(by 'negotiation') model(i.e.: SL $\rightarrow$ IL/S $\leftrightarrow$ IL $\leftrightarrow$ IL/T \leftarrow TL) is proposed here for the purpose of evaluating multilingual, not merely bilingual, translation. The IL, as conceived of in this study, is an English-based predicate logic represented in the framework of MRS(minimal recursion semantics), an MT-oriented off-shoot of HPSG(Head-driven Phrase Structure Grammar). In addition, a list of semantic and pragmatic checkpoints are set up, some being optional depending on the kind and use of the translation, so sa to have the evaluation of translation fine-grained by computing matching or mismatching of such checkpoints.