• 제목/요약/키워드: recursive

검색결과 1,608건 처리시간 0.034초

기업 자재관리시스템에서 효율적인 검색을 위한 순환적 방법의 적용 (An Application of Recursive Method for Efficient Retrieval in Business Material Management)

  • 김영준
    • 한국산학기술학회논문지
    • /
    • 제11권9호
    • /
    • pp.3289-3295
    • /
    • 2010
  • 기업의 자재관리 영역에서 자재소요계획은 효과적인 의사결정을 위한 중요한 활동 중 하나이다. 수요가 점차 늘어남에 따라 실용성 있는 데이터 모델이 필수적으로 요구되고 있다. 본 연구는 다양한 형태로 표현되는 데이터를 적절한 구조로 모델링하여 기업 자재관리 응용 분야에서 효율적으로 사용할 수 있도록 연역 모델 릴레이션을 설계한다. 이를 이용하여 순환적 데이터 검색을 가능하게 하는 새로운 질의 방법을 제시하며, 그 효율성을 비교한다.

칸반 시스템의 분석과 설계

  • 김성철
    • 경영과학
    • /
    • 제9권1호
    • /
    • pp.3-15
    • /
    • 1992
  • In this paper, we study a manufacturing system of serial stages with general service times, in which the production of each stage and the coordination of stages are controlled by Kanban discipline. This Kanban discipline is modeled as a Discrete Event Dynamic System and a system of recursive equations is applied to study the dynamics of the system. The recursive relationship enables us to compare this Kanban discipline with the other blocking disciplines such as transfer blocking, service blocking, block-and-hold b, and block-and-hold K, and the Kanban is shown to be superior to the other disciplines in terms of makespan and throughput. As a special case, two stages Kanban system is modeled as $C_2/C_2/1/N$ queueing system, and a recursive algorithm is developed to calculate the system performance. In optimizing the system performance, the stochastic optimization approach of Robbins-Monro is employed via perturbation analysis, the way to estimate the stochastic partial derivative based on only one sample trajectory of the system, and the required commuting condition is verified. Then the stochastic convexity result is established to provide second-order optimality condition for this parametric optimization problem.

  • PDF

UDU 행렬분해법을 이용한 재귀적 TLS 알고리즘 (A UDU decomposition based recursive total least square method)

  • 임준석;최낙진;성굉모
    • 한국음향학회:학술대회논문집
    • /
    • 한국음향학회 2004년도 추계학술발표대회논문집 제23권 2호
    • /
    • pp.547-550
    • /
    • 2004
  • 본 논문은 시스템 인식에서 RLS의 성능을 높이기 위한 한 방법으로 UDU 행렬 분해법을 바탕으로 한 recursive total least squares (RTLS) algorithm을 제안한다. 기존의 RTLS는 Power Method에 의거해서 recursive하게 만든 형태이어서 RLS와 거의 같은 구조이다. 그러나 본 논문에서는 일반적인 Power Method가 rank-1 update를 이용하기 때문에 ill-condition에 빠질 가능성이 높은 점을 감안하여, UDU 행렬 분해법을 사용한 RTLS방법을 제안하고, 그를 시스템 인식에 적용한다.

  • PDF

몬테카를로 기반 재귀최소자승법에 의한 시스템 인식 실험 연구 (Experimental Study on a Monte Carlo-based Recursive Least Square Method for System Identification)

  • 이상덕;정슬
    • 전기학회논문지
    • /
    • 제67권2호
    • /
    • pp.248-254
    • /
    • 2018
  • In this paper, a Monte Carlo-based Recursive Least Square(MC-RLS) method is presented to directly identify the inverse model of the dynamical system. Although a RLS method has been used for the identification based on the deterministic data in the closed loop controlled form, it would be better for RLS to identify the model with random data. In addition, the inverse model obtained by inverting the identified forward model may not work properly. Therefore, MC-RLS can be used for the inverse model identification without proceeding a numerical inversion of an identified forward model. The performance of the proposed method is verified through experimental studies on a control moment gyroscope.

Practical Patching for Efficient Bandwidth Sharing in VOD Systems

  • Ha Soak-Jeong
    • 한국멀티미디어학회논문지
    • /
    • 제8권12호
    • /
    • pp.1597-1604
    • /
    • 2005
  • Recursive Patching is an efficient multicast technique for large-scale video on demand systems and recursively shares existing video streams with asynchronous clients. When Recursive Patching initiates a transition stream, it always makes a transition stream have additional data for the worst future request. In order to share a VOD server's limited network bandwidth efficiently, this paper proposes Practical Patching that removes the unnecessary data included in the transition stream. The proposed Practical Patching dynamically expands ongoing transition streams when a new request actually arrives at the server. As a result, the transition streams never have unnecessary data. Simulation result confirmed that the proposed technique is better than Recursive Patching in terms of service latency and defection rate.

  • PDF

배전계통 고장점 표정 알고리즘 적용 연구 (A Using Study for Fault Locator Algorithm of Distribution System)

  • 이성우;하복남
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2009년도 제40회 하계학술대회
    • /
    • pp.74_76
    • /
    • 2009
  • This paper presents a discrete wavelet analysis based algorithm to address the fault impedance calculation under transient state in radial power distribution networks. The fault impedances have been derived under different fault conditions. Furthermore, a recursive fault distance estimation method is proposed utilizing the measured fault impedance and power line parameters. The proposed scheme can resolve the errors caused by the non-homogeneous power lines, the presence of lateral loads since, the fault impedance will always be updated with the recursive form. For the verification of the proposed scheme, a filed test has been peformed with varying fault resistances in the 22.9(kV) radial system. Power meters and fault locators were installed at the substation. It was figured out that the performance of the discrete wavelet and the recursive scheme are very good even for high fault resistance condition.

  • PDF

A Coupled Recursive Total Least Squares-Based Online Parameter Estimation for PMSM

  • Wang, Yangding;Xu, Shen;Huang, Hai;Guo, Yiping;Jin, Hai
    • Journal of Electrical Engineering and Technology
    • /
    • 제13권6호
    • /
    • pp.2344-2353
    • /
    • 2018
  • A coupled recursive total least squares (CRTLS) algorithm is proposed for parameter estimation of permanent magnet synchronous machines (PMSMs). TLS considers the errors of both input variables and output ones, and thus achieves more accurate estimates than standard least squares method does. The proposed algorithm consists of two recursive total least squares (RTLS) algorithms for the d-axis subsystem and q-axis subsystem respectively. The incremental singular value decomposition (SVD) for the RTLS obtained by an approximate calculation with less computation. The performance of the CRTLS is demonstrated by simulation and experimental results.

순환적으로 결합되는 정온기들을 갖는 $N{\sigma}T$ 분자동역학 전산모사에 적용한 외연적 적분기법 (Explicit integration algorithm for fully flexible unit cell simulation with recursive thermostat chains)

  • 정광섭;조맹효
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2007년도 춘계학술대회A
    • /
    • 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.

  • PDF

MATHEMATICAL UNDERSTANDING OF CONSCIOUSNESS AND UNCONCIOUSNESS

  • LEE, NAMI;KIM, EUN YOUNG;SHIN, CHANGSOO
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제21권2호
    • /
    • pp.75-79
    • /
    • 2017
  • This paper approaches the subject of consciousness and unconsciousness from a mathematical point of view. It sets up a hypothesis that when unconscious state becomes conscious state, high density energy is released. We argue that the process of transformation of unconsciousness into consciousness can be expressed using the infinite recursive Heaviside step function. We claim that differentiation of the potential of unconsciousness with respect to time is the process of being conscious in a world where only time exists, since the thinking process never have any concrete space. We try to attribute our unconsciousness to a special solution of the multi-dimensional advection partial differential equation which can be represented by the finite recursive Heaviside step function. Mathematical language explains how the infinitive neural process is perceived and understood by consciousness in a definitive time.

잡음을 고려한 회귀방법에 의한 초음파 진단기의 화상개선 (A Recursive Restoration Scheme of B-Scan Ultrasonographic Images in Noisy Case)

  • Kim, Sun-I.;Min, Byoung-G.;Ko, Myoung-S.
    • 대한의용생체공학회:의공학회지
    • /
    • 제3권1호
    • /
    • pp.35-42
    • /
    • 1982
  • The objective of this phantom study is to develop a digital method for improving the lateral resolution of B-scan ultrasonographic images irs medical application of ultrasound. By utilizing a discrete state-space modeling approach and Kalman-Buch method for analysis of the transducer's beam profile and the measurement and sampling noise, a stable recursive restoration of the object image was obtained for improved lateral resolution. The point spread function (PSF) was measured for the reflective signals after scanning the small pins located along the depth of interest. One major advantage of the present recursive scheme over the transform method is in its applicability for the space-variant imaging, such as in the case of the rotational movement of transducer.

  • PDF