• 제목/요약/키워드: Final State

검색결과 869건 처리시간 0.025초

Delphi기법에 의한 기계공학기술의 수준평가 및 국제 기술협력기반에 관한 연구 (A Study on the State of Art and International Cooperation in the Field of Mechanical Engineering by Delphi Method)

  • 권영주
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 1996년도 춘계학술대회 논문집
    • /
    • pp.169-175
    • /
    • 1996
  • We provide a fudamental set of information on technologies in the area of mechanical engineering to draw action plans for intermationalization of the National R&D activites. First, we design and use a modified Delphi method to evaluate levels of our technological capabilities and developed countries' as well. We investigate technology acquistion methodolgies, technology characteristcs and various aspects of international cooperation in terms of technology. Secondly, we analyze final responses of participants (i.e,. the third round results of Delphi method) tosee the correlation between various factors in developing mechanical engineering technologies through international cooperation. The technology classification used in this research is developed by STEPI (Science and Technology Policy Institute).

  • PDF

트래픽 엔지니어링 프로세스 모델 (Traffic Engineering Process Model)

  • 임석구
    • 디지털콘텐츠학회 논문지
    • /
    • 제5권2호
    • /
    • pp.151-156
    • /
    • 2004
  • 본 논문에서는 인터넷에서의 트래픽 엔지니어링을 수행하기 위한 프로세스 모델을 제시한다. 프로세스 모델은 4 단계로 이루어지는데, 첫번째 단계는 네트워크의 운용을 지배하는 적절한 제어정책을 정의하고 두 번째 단계는 운용 네트워크로부터의 측정 데이터를 얻는 과정이다. 세 번째 단계에서는 네트워크 상태를 분석하고 트래픽 부하를 산출하며, 마지막 단계에서는 네트워크의 성능을 최적화하는데 이와 같은 프로세스 모델의 4 단계는 연속적으로 반복되는 프로세스 모델이다.

  • PDF

AN APPROACH FOR SOLVING OF A MOVING BOUNDARY PROBLEM

  • Basirzadeh, H.;Kamyad, A.V.
    • Journal of applied mathematics & informatics
    • /
    • 제14권1_2호
    • /
    • pp.97-113
    • /
    • 2004
  • In this paper we shall study moving boundary problems, and we introduce an approach for solving a wide range of them by using calculus of variations and optimization. First, we transform the problem equivalently into an optimal control problem by defining an objective function and artificial control functions. By using measure theory, the new problem is modified into one consisting of the minimization of a linear functional over a set of Radon measures; then we obtain an optimal measure which is then approximated by a finite combination of atomic measures and the problem converted to an infinite-dimensional linear programming. We approximate the infinite linear programming to a finite-dimensional linear programming. Then by using the solution of the latter problem we obtain an approximate solution for moving boundary function on specific time. Furthermore, we show the path of moving boundary from initial state to final state.

Synthesis and Experimental Implementation of DSP Based Backstepping Control of Positioning Systems

  • Chang, Jie;Tan, Yaolong
    • Journal of Power Electronics
    • /
    • 제7권1호
    • /
    • pp.1-12
    • /
    • 2007
  • Novel nonlinear backstepping control with integrated adaptive control function is developed for high-performance positioning control systems. The proposed schemes are synthesized by a systematic approach and implemented based on a modern low-cost DSP controller, TMS320C32. A baseline backstepping control scheme is derived first, and is then extended to include a nonlinear adaptive control against the system parameter changes and load variations. The backstepping control utilizes Lyapunov function to guarantee the convergence of the position tracking error. The final control algorithm is a convenient in the implementation of a practical 32-bit DSP controller. The new control system can achieve superior performance over the conventional nested PI controllers, with improved position tracking, control bandwidth, and robustness against external disturbances, which is demonstrated by experimental results.

Transition and Parsing State and Incrementality in Dynamic Syntax

  • Kobayashi, Masahiro;Yoshimoto, Kei
    • 한국언어정보학회:학술대회논문집
    • /
    • 한국언어정보학회 2007년도 정기학술대회
    • /
    • pp.249-258
    • /
    • 2007
  • This paper presents an implementation of a gramar of Dynamic Syntax for Japanese. Dynamic Syntax is a grammar formalism which enables a parser to process a sentence in an incremental fashion, establishing the semantic representation. Currently the application of lexical rules and transition rules in Dynamic Syntax is carried out arbitrarily and this leads to inefficient parsing. This paper provides an algorithm of rule application and partitioned parsing state for efficient parsing with special reference to processing Japanese, which is one of head-final languages. At the present stage the parser is still small but can parse scrambled sentences, relative clause constructions, and embedded clauses. The parser is written in Prolog and this paper shows that the parser can process null arguments in a complex sentence in Japanese.

  • PDF

50kW 태양광 설비의 아크 검출 알고리즘 개발 (Development of Arc Detection Algorithm for 50 kW Photovoltaic System)

  • 김상규;이창성;지평식
    • 전기학회논문지P
    • /
    • 제67권1호
    • /
    • pp.27-32
    • /
    • 2018
  • In this paper, we developed an algorithm to detect arc of PV power plant through frequency analysis. For arc detection based on frequency analysis, the filter should be designed to emphasize the difference between the arc state and the normal state. Therefore, in this paper, we analyzed the arc detection performance according to various filter structures. The arc detection algorithm developed in this paper extracts the filtering signal on current by using various filters and then calculates the frequency components and total energy using the FFT. In the final step, the arc is detected using the calculated energy magnitude. In order to verify the performance of the proposed arc detection algorithm, experiments were conducted on 51 kW solar inverters connected to power line. Through various experiments, it was confirmed that the proposed method effectively detects the arc.

진화하는 셀룰라 오토마타를 이용한 자율이동로봇군의 행동제어 (Behavior Control of Autonomous Mobile Robots using ECANS1)

  • 이동욱;정영준;심귀보
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1998년도 하계학술대회 논문집 G
    • /
    • pp.2183-2185
    • /
    • 1998
  • In this paper, we propose a method of designing neural networks using biological inspired developmental and evolutionary concept. The living things are best information processing system in themselves. One individual is developed from a generative cell. And a species of this individual have adapted itself to the environment by evolution. Ontogeny of organism is embodied in cellular automata and phylogeny of species is realized by evolutionary algorithms. The connection among cells is determined by a rule of cellular automata. In order to obtain the best neural networks in the environment, we evolve the arrangement of initial cells. The cell, that is neuron of neural networks, is modeled on chaotic neuron with firing or rest state like biological neuron. A final output of network is measured by frequency of firing state. The effectiveness of the proposed scheme is verified by applying it to navigation problem of robot.

  • PDF

Production, Isolation, and Purification of L-Asparaginase from Pseudomonas Aeruginosa 50071 Using Solid-state Fermentation

  • El-Bessoumy, Ashraf A.;Sarhan, Mohamed;Mansour, Jehan
    • BMB Reports
    • /
    • 제37권4호
    • /
    • pp.387-393
    • /
    • 2004
  • The L-asparaginase (E. C. 3. 5. 1. 1) enzyme was purified to homogeneity from Pseudomonas aeruginosa 50071 cells that were grown on solid-state fermentation. Different purification steps (including ammonium sulfate fractionation followed by separation on Sephadex G-100 gel filtration and CM-Sephadex C50) were applied to the crude culture filtrate to obtain a pure enzyme preparation. The enzyme was purified 106-fold and showed a final specific activity of 1900 IU/mg with a 43% yield. Sodium dodecyl sulfate-polyacrylamide gel electrophoresis (SDS-PAGE) of the purified enzyme revealed it was one peptide chain with $M_r$ of 160 kDa. A Lineweaver-Burk analysis showed a $K_m$ value of 0.147 mM and $V_{max}$ of 35.7 IU. The enzyme showed maximum activity at pH 9 when incubated at $37^{\circ}C$ for 30 min. The amino acid composition of the purified enzyme was also determined.

플런지 연삭공정을 위한 거칠기 모델 (Roughness Model for the Plunge Grinding Process)

  • 최정주
    • 한국생산제조학회지
    • /
    • 제18권5호
    • /
    • pp.443-448
    • /
    • 2009
  • The roughness models have developed to describe the grinding behaviour and predict the final quality of workpiece. The model forms of the plunge grinding process are generally established with initial and steady state model form in accordance with the accumulated metal removal. The steady state roughness model form are based on the grinding condition and specific parameters are used to show the influence of it according to the grinding process such as the equivalent chip thickness and accumulated metal removal. However, the models have been developed in past are not considered the effect of changing the grinding conditions in the same batch. In this paper, the roughness model form to consider the effect of changing grinding condition is proposed and the performance of proposed model is evaluated based on the experimental results.

  • PDF

선택적 SOFM 학습법을 사용한 비선형 형상왜곡 영상의 복원 (Nonlinear shape resotration based on selective learning SOFM approach)

  • 한동훈;성효경;최흥문
    • 전자공학회논문지C
    • /
    • 제34C권1호
    • /
    • pp.59-64
    • /
    • 1997
  • By using a selective learnable self-organizing feature map(SOFM) a more practical and generalized mehtod is proposed in which the effective nonlinear shape restoration is possible regardless of the existence of the distortion modelss. Nonlinear mapping relation is extracted from the distorted imate by using the proposed selective learning SOFGM which has the special property of effectively creating spatially organized internal representations and nonlinear relations of various input signals. For the exact extraction of the mapping relations between the distorted image and the original one, we define a disparity index as a proximal nmeasure of the present state to the final idealy trained state of the SOFM, and we used this index to adjust the training of the mapping relations form the weights of the SOFM. Simulations are conducted on various kinds of distorted images with or without distortion models, and the results show that the proposed method is very efficeint very efficient and practical in nonlinear shape restorations.

  • PDF