• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 하계학술대회 논문집 D
• /
• pp.2121-2123
• /
• 2003

Distributed Control Systems(DCS) arc used in a wide range of process applications such as power plants. This paper presents calculated network capacity of a DCS that developed for nuclear power plant. The network hierarchies are 3 layed of information network, control network and field network. The assumed total node number of maximum DCS network is 64. Worst case network utilization of the DCS is simulated and analyzed.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.338-341
• /
• 2005

In this paper, a real-time communication method using a PICNET-NP(Plant Instrumentation and Control Network for Nuclear Power Plant) is proposed with an analysis of the control network requirements of DCS (Distributed Control System) in nuclear power plants. The method satisfies deadline in case of worst data traffics by considering aperiodic and periodic real-time data and others. In addition, the method was used to analyze the data characteristics of the DCS in existing nuclear power plant. The result shows that use of this method meets the response time requirement(100ms).

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 B
• /
• pp.1013-1016
• /
• 1999

In this paper, a real-time communication method using a PICNET-NP(Plant Instrumentation and Control Network for Nuclear Power plant) is proposed with an analysis of the control network requirements of DCS (Distributed Control System) in nuclear power plants. The method satisfies deadline in case of worst data traffics by considering aperiodic and periodic real-time data and others. In addition, the method was used to analyze the data characteristics of the DCS in existing nuclear power plant. The result shows that use of this method meets the response time requirement(100ms)

• 제어로봇시스템학회논문지
• /
• 제5권6호
• /
• pp.734-743
• /
• 1999

In this paper, a real-time communication method using a PICNET-NP(Plant instrumentation and Control Network for Nuclear Power plant) is proposed with an analysis of the control network requirements of DCS(Distributed Control System) in nuclear power plants. The method satisfies deadline in case of worst data traffics by considering aperiodic and periodic real-time data and others. In addition, the method was used to analyze the data characteristics of the DCS in existing nuclear power plant. The result shows that use of this method meets the response time requirement(100ms).

• Journal of Mechanical Science and Technology
• /
• 제20권3호
• /
• pp.345-357
• /
• 2006

By employing the concept of equivalent linkage, this paper presents an analytical method for analyzing the mechanical errors of disk cam mechanisms with a flat-faced follower. The resulting error equations do not really involve the location of the curvature center of the cam profile, and locating the curvature center of the cam profile is not essential. The resulting errors are significantly affected by the pressure angle, and the smaller pressure angle will result in the smaller mechanical error. In the worst case, owing to the joined effects of various design parameters, the accuracy of the follower motion may degrade considerably. For the oscillating follower case, all acceleration error functions have a sudden change at every beginning and at every end of the motion even though the theoretical follower displacement is cycloidal motion.

• 한국경영과학회지
• /
• 제16권2호
• /
• pp.14-35
• /
• 1991

The purpose of this study is to develop an efficient exact algorithm for the problem of scheduling n in dependent jobs on m unequal parallel processors to minimize makespan. Efficient solutions are already known for the preemptive case. But for the non-preemptive case, this problem belongs to a set of strong NP-complete problems. Hence, it is unlikely that the polynomial time algorithm can be found. This is the reason why most investigations have bben directed toward the fast approximate algorithms and the worst-case analysis of algorithms. Recently, great advances have been made in mathematical theories regarding Lagrangean relaxation and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining these mathematical tools with branch-and-bound procedures, these have been some successes in constructing pseudo-polynomial time algorithms for solving previously unsolved NP-complete problems. This study applied similar methodologies to the unequal parallel processor problem to find the efficient exact algorithm.

• 한국경영과학회지
• /
• 제16권2호
• /
• pp.13-35
• /
• 1991

The purpose of this study is to develop an efficient exact algorithm for the problem of scheduling n in dependent jobs on m unequal parallel processors to minimize makespan. Efficient solutions are already known for the preemptive case. But for the non-preemptive case, this problem belongs to a set of strong NP-complete problems. Hence, it is unlikely that the polynomial time algorithm can be found. This is the reason why most investigations have bben directed toward the fast approximate algorithms and the worst-case analysis of algorithms. Recently, great advances have been made in mathematical theories regarding Lagrangean relaxation and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining and the subgradient optimization procedure which updates the Lagrangean multipliers. By combining these mathematical tools with branch-and-bound procedures, these have been some successes in constructing pseudo-polynomial time algorithms for solving previously unsolved NP-complete problems. This study applied similar methodologies to the unequal parallel processor problem to find the efficient exact algorithm.

• 전자공학회논문지A
• /
• 제30A권4호
• /
• pp.11-19
• /
• 1993

The complex permittivity and the linewidth of microwave ferrites are measured using the well known cavity perturbation method. The cavity perturbation method has been widely used for the measurement of complex permittivity and conductivity of low loss magnetic and dielectric materials at microwave frequencies. TT1-2000, TT73-2200, and G-113 samples ordered from Trans-Tech Inc, are tested. TE$_{103}$ and TE$_{106}$ rectangular waveguide cavities are fabricated and the ferrite sample of cylidrical rod and sphere shapes are prepared. The error between the measurement values and the supplier's data is less than 1 percent in case of $\varepsilon$’ and about 10 percent in case of linewidth ($\Delta$H). Worst case error analysis shows that our measured results are well within the error bound calculated from the accuracy specification of the measuring instruments.

• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2003년도 추계학술대회 논문집(III)
• /
• pp.36-41
• /
• 2003

Among welded structure bogies in use for high speed freight car, a part of bogies manufactured in 1999 and 2000 have found problems that failure occurs in its end beam. In case of a freight car a difference of weight between empty and loading conditions are worse than in case of a passenger car. Moreover its brake system is tread brake without second suspension system. A failure of end beam is supposed to be due to loading by brake rather than vertical loading by freight. This failure can make brake system useless and may be a cause of derailment in the worst case. In this study, we have proposed a simple torsion-free brake shoe holder hanger to remove torsion of hanger bracket which is supposed to be one of causes of failure and performed finite element analyses for making trial manufactures and its application.

• 융합신호처리학회논문지
• /
• 제4권1호
• /
• pp.36-40
• /
• 2003

EZW(Embedded Zerotree Wavelet) 알고리즘이 소개된 이래 일련의 내장형 웨이브렛 코딩 방법들이 제안되어 져왔다. 이들의 하나의 공통된 특징은 EZW 알고리즘의 기본 아이디어를 근간으로 한다는 점이다. 특히 SPIHT(Set Partitioning in Hierarchy Trees) 알고리즘은 이들 중의 하나로서 산술 코더를 사용하지 않더라도 EZW와 같거나 혹은 더 나은 성능을 제공할 수 있기 때문에 널리 알려져 왔다. 이러한 SPIHT 알고리즘은 계산적으로 단순하면서도 뛰어난 수치적, 시각적 결과를 제공한다. 그러나 SPIHT 알고리즘의 처리 시간복잡도(time complexity)에 대한 평가는 상대적인 비교를 통해 효과적임을 실험적으로 확인한 것에 불과하고 지금까지 엄밀한 시간복잡도 해석이 행하여지지 않았다. 본 연구에서는 SPIHT 알고리즘의 처리 시간복잡도를 해석하고 한 비트평면 처리에 대한 최악의 경우(worst case) 시간복잡도가 O(nlog$_2$n)임을 증명한다.