• Title/Summary/Keyword: starting point

Search Result 1,389, Processing Time 0.026 seconds

Diffusion-accompanied Phase Transformation of $TiSi_2$ Film Confined in Sub-micron Area

  • Kim, Yeong-Cheol
    • The Korean Journal of Ceramics
    • /
    • v.7 no.2
    • /
    • pp.70-73
    • /
    • 2001
  • Phase transformation of TiSi$_2$ confined in sub-micron area of which the size is around or smaller than the grain size of C49 TiSi$_2$ phase is studied. It has been known that the C49 to C54 phase change is massive transformation that occurs abruptly starting from C54 nuclei located at triple point grain boundaries of C49 phase. When the C49 phase is confined in sub-micron area, however, the massive phase transformation is observed to be hindered due to the lack of the triple point grain boundaries of C49 phase. Heat treatment at higher temperatures starts to decompose the C49 phase, and the resulting decomposed Ti atoms diffuse to, and react with, the underneath Si material to form C54 phase that exhibits spherical interface with silicon. The newly formed C54 grains can also trigger the massive phase transformation to convert the remaining undecomposed C49 grains to C54 grains by serving as nuclei like conventional C54 nuclei located at triple point grain boundaries.

  • PDF

An Algorithm for the Automatic Movement Control of the Platform on a Ladder Lift (고가사다리차 플랫폼 자동이송 제어 알고리즘)

  • 정성태;이상설;심현진;이환우;최갑수;이지근
    • Proceedings of the IEEK Conference
    • /
    • 2002.06e
    • /
    • pp.181-184
    • /
    • 2002
  • In this paper, an algorithm is proposed for the automatic movement of the platform on a ladder lift which operates by using hydraulic force. Experimental data of the manual movement operated by experts are acquired and analyzed. The length of movement of the platform is estimated by the number of pulses from an encoder while the platform is moving. The operating characteristics have been extracted from the data. The number of pulses varies whenever the weight of load varies. We propose a model to compensate the difference of the number of pulses. An automatic movement algorithm based on the model is proposed. The platform can start and stop smoothly at the starting point and the destination point. Experimental results show that the error distance at the destination point is less than 5 cm when the length of the ladder is 23 m.

  • PDF

A study of control system on Permanent Magnet Linear Synchronous Motor with Z-axis operation structure (Z축 운전구조를 갖는 선형 영구자석형 동기 전동기 운전제어에 관한 연구)

  • Lee C.H.;Choi C.;Park H.W.;Kim C.U.
    • Proceedings of the KIPE Conference
    • /
    • 2003.07b
    • /
    • pp.654-658
    • /
    • 2003
  • In this study a control system with variable gain schedule using real speed and moving direction is proposed to control a Permanent Magnet Linear Synchronous Motor (PMLSM) with Z-axis operation structure. The implementation of the controller is designed on the DSP TMS320C32 board. PMLSM is operated by using 4-point absolute positions profile with each velocity, acceleration and deceleration. The direction of the initial angle action for starting is set from the lower limit point to the upper limit point on PMLSM operation stroke. The effectiveness of a control system with variable gain schedule is demonstrated by some experimental results.

  • PDF

Development of a Real-time Voice Recognition Dialing System; (실시간 음성인식 다이얼링 시스템 개발)

  • 이세웅;최승호;이미숙;김흥국;오광철;김기철;이황수
    • Information and Communications Magazine
    • /
    • v.10 no.10
    • /
    • pp.22-29
    • /
    • 1993
  • This paper describes development of a real-time voice recognition dialing system which can recognize around one hundred word vocabularies in speaker independent mode. The voice recognition algorithm is implemented on a DSP board with a telephone interface plugged in an IBM PC AT/486. In the DSP board, procedures for feature extraction, vector quantization(VQ), and end-point detection are performed simultaneously in every 10msec frame interval to satisfy real-time constraints after the word starting point detection. In addition, we optimize the VQ codebook size and the end-point detection procedure to reduce recognition time and memory requirement. The demonstration system is being displayed in MOBILAB of Korea Mobile Telecom at the Taejon EXPO '93.

  • PDF

Cumulative Sequential Control Charts with Sample Size Bound (표본크기에 제약이 있는 누적 축차관리도)

  • Chang, Young-Soon;Bai, Do-Sun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.25 no.4
    • /
    • pp.448-458
    • /
    • 1999
  • This paper proposes sequential control charts with an upper bound on sample size. Existing sequential control charts have no restriction on the number of observations at a sampling point. For situations where sampling and testing an item is time-consuming or expensive, sequential control charts may not be directly applied. When the number of observations in a sampling point reaches the upper bound and there is no out-of-control signal, the proposed cumulative sequential control chart defers the decision to the next sampling point of which starting value is the value of the current statistic. Two Markov chains, inner and outer chains, are used to derive the formulas for evaluating the performance of the proposed chart. It is compared with $\bar{X}$ and cumulative sum control charts with fixed and variable sample sizes. The fast initial response (FIR) feature is studied. Guidelines for the design of the proposed charts are also given.

  • PDF

COMPLEXITY ANALYSIS OF IPM FOR $P_*(\kappa)$ LCPS BASED ON ELIGIBLE KERNEL FUNCTIONS

  • Kim, Min-Kyung;Cho, Gyeong-Mi
    • East Asian mathematical journal
    • /
    • v.25 no.1
    • /
    • pp.55-68
    • /
    • 2009
  • In this paper we propose new large-update primal-dual inte-rior point algorithms for $P_*(\kappa)$ linear complementarity problems(LCPs). New search directions and proximity measures are proposed based on the kernel function$\psi(t)=\frac{t^{p+1}-1}{p+1}+\frac{e^{\frac{1}{t}}-e}{e}$,$p{\in}$[0,1]. We showed that if a strictly feasible starting point is available, then the algorithm has $O((1+2\kappa)(logn)^{2}n^{\frac{1}{p+1}}log\frac{n}{\varepsilon}$ complexity bound.

The Starting Characteristics of the Steady Ejector-Diffuser System

  • Gopalapillai, Rajesh;Kim, Heuy-Dong;Matsuo, Shigeru;Setoguchi, Toshiaki
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2008.03a
    • /
    • pp.680-685
    • /
    • 2008
  • The ejector is a simple device which can transport a low-pressure secondary flow by using a high-pressure primary flow. In general, it consists of a primary driving nozzle, a mixing section, and a diffuser. The ejector system entrains the secondary flow through a shear action generated by the primary jet. Until now, a large number of researches have been made to design and evaluate the ejector systems, where it is assumed that the ejector system has an infinite secondary chamber which can supply mass infinitely. However, in almost all of the practical applications, the ejector system has a finite secondary chamber implying steady flow can be possible only after the flow inside ejector has reached an equilibrium state after the starting process. To the authors' best knowledge, there are no reports on the starting characteristics of the ejector systems and none of the works to date discloses the detailed flow process until the secondary chamber flow reaches an equilibrium state. The objective of the present study is to investigate the starting process of an ejector-diffuser system. The present study is also planned to identify the operating range of ejector-diffuser systems where the steady flow assumption can be applied without uncertainty. The results obtained show that the one and only condition in which an infinite mass entrainment is possible is the generation of a recirculation zone near the primary nozzle exit. The flow in the secondary chamber attains a state of dynamic equilibrium at this point.

  • PDF

NEW COMPLEXITY ANALYSIS OF IPM FOR $P_*({\kappa})$ LCP BASED ON KERNEL FUNCTIONS

  • Cho, Gyeong-Mi;Kim, Min-Kyung;Lee, Yong-Hoon
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.12 no.4
    • /
    • pp.227-238
    • /
    • 2008
  • In this paper we extend primal-dual interior point algorithm for linear optimization (LO) problems to $P_*({\kappa})$ linear complementarity problems(LCPs) ([1]). We define proximity functions and search directions based on kernel functions, ${\psi}(t)=\frac{t^{p+1}-1}{p+1}-{\log}\;t$, $p{\in}$[0, 1], which is a generalized form of the one in [16]. It is the first to use this class of kernel functions in the complexity analysis of interior point method(IPM) for $P_*({\kappa})$ LCPs. We show that if a strictly feasible starting point is available, then new large-update primal-dual interior point algorithms for $P_*({\kappa})$ LCPs have $O((1+2{\kappa})nlog{\frac{n}{\varepsilon}})$ complexity which is similar to the one in [16]. For small-update methods, we have $O((1+2{\kappa})\sqrt{n}{\log}{\frac{n}{\varepsilon}})$ which is the best known complexity so far.

  • PDF

A Block Matching using the Motion Information of Previous Frame and the Predictor Candidate Point on each Search Region (이전 프레임의 움직임 정보와 탐색 구간별 예측 후보점을 이용하는 블록 정합)

  • 곽성근;위영철;김하진
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.3
    • /
    • pp.273-281
    • /
    • 2004
  • There is the temporal correlation of the video sequence between the motion vector of current block and the motion vector of previous block. In this paper, we propose the prediction search algorithm for block matching using the temporal correlation of the video sequence and the center-biased property of motion vectors. The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(sum of absolute difference) value by the predicted motion vector from the same block of the previous frame and the predictor candidate point on each search region. Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved up to the 1.06㏈ as depend on the video sequences and improved about 0.19∼0.46㏈ on an average except the full search(FS) algorithm.

A Study on Humanity Convergence Map using space metaphor and POI (point of interest) of Big Data (빅데이터 중 POI와 공간 메타포를 활용한 인문 융합 지도 연구)

  • Lee, Won-Tae;Kang, Jang-Mook
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.3
    • /
    • pp.43-50
    • /
    • 2015
  • Google, Yahoo, Daum and Naver has the POI(point of interest) service. And POI on the map is expending to social commerce, SNS, social game and social shopping. At the same time the uses's position on the map is the starting point of the Humanities Story. That means our current position is the place for stories of tales, children's song, fictional characters, the film background, lyrics and the birth of great people. This study points out that service has the limited to cafe, restaurant and hospital, and suggests the Humanities fusion Map Service which is combined with the POI information.