• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.19-26
• /
• 2004

In this paper, we investigate the longest fault-free paths joining every pair of vertices in a double loop network with faulty vertices and/or edges, and show that a bipartite double loop network G(mn；1, m) is strongly hamiltonian-laceable when the number of faulty elements is two or less. G(mn；1, m) is bipartite if and only if m is odd and n is even.

• Journal of the Korean Arthroscopy Society
• /
• v.10 no.1
• /
• pp.13-16
• /
• 2006

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.742-744
• /
• 2001

이 논문은 n-차원 스타 그래프 S$_{n}$, n$\geq$4에서 정점과 에지 고장의 수가 n-3 이하일 때, 임의의 두 고장이 아닌 정점 사이에 길이가 두 정점의 색이 같으면 n!-2f$_{v}$ -2 이상이고, 색이 다르면 n!-2f$_{v}$ -1 이상인 경로가 존재함을 보인다. 여기서 f$_{v}$ 는 고장인 정점의 수이다. 이 결과를 이용하면 고장의 수가 n-3이하일 때, 임의의 고장이 아닌 에지를 지나는 길이 n!-2f$_{v}$ 이상인 사이클을 설계할 수 있다.

• Annual Conference on Human and Language Technology
• /
• 1994.11a
• /
• pp.146-154
• /
• 1994

한국어는 단어들 사이에 공백이 없는 미분절어이기 때문에, 한국어를 분석하기 위해서는 단어의 경계를 식별하는 분절이 선행되어야 한다. 분절은 쉽지 않은 과정이고 잘못된 분절은 구문분석, 의미 분석 단계에서 심각한 오류를 유발하기 때문에 형태소 분석의 중요한 작업중의 하나가 되어왔다. 기존의 한국어 분석 시스템들은 분절의 어려움으로 인하여 입력 문자열의 끝까지 읽은 후, 우에서 좌로 분석하는 two-pass 전략이나 단어들 사이에 공백을 삽입하여 처리하는 방법을 사용하였다. 또한 이 시스템들은 형태소 분석이 완결된 후, 파서에게 결과를 전달하는 순차적인 전략을 사용하였다. 본 논문은 영어의 분석과 같이 형태소 분석 동안에 파싱을 할 수 있는 one-pass 전략을 사용하여 한국어를 효율적으로 처리하는 모델을 제안한다. 이를 위해 형태소 분석 방법으로써 확장된 최장일치법을 제시하며, 위 방법에서 생성되는 문제점인 다중-범주 구를 처리하기 위하여 다중-경로 LR 파싱을 제시한다.

• Proceedings of the Korean Society of Crop Science Conference
• /
• 1995.05a
• /
• pp.66-67
• /
• 1995

• Proceedings of the KIEE Conference
• /
• 2006.07b
• /
• pp.903-904
• /
• 2006

This paper deals with analysis of linear switched reluctance motor at high speed. First, we defined turn-on position at inductance profile. Second, in turn-on section, we analyzed characteristic of linear switched reluctance motor according to speed. Also, we used finite element method at analysis process.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.9
• /
• pp.1-10
• /
• 1998

This paper is to propose an algorithm named as DYSAC to find the critical path(the longest sensitizable path) in a large digital circuit, whose purpose is to reduce the time to find critical path and to find critical paths of the circuits for which the previous methods could not find one. Also a set of path sensitization criteria named as DYPSEC is proposed, which is used to select a path from input to the output inside the DYSAC. The DYSAC consists of two sub-algorithms; the level assignment algorithm to assign a level to each node and the critical path selection algorithm to select the sensitizable path. The proposed algorithm was implemented with C-language on SUN Sparc and applied to the ISCAS'85 benchmark circuits to make sure if it works correctly and finds the correct critical path. Also, the results from the experiments were compared to the results from the previous works. The comparison items were the ability to find the critical path and the speed, in both of which the proposed algorithm in this paper shows better results than others.

• Journal of Life Science
• /
• v.8 no.4
• /
• pp.443-448
• /
• 1998

We analyzed lignin content and wxpression of OMT gene during growth season in two hybrid poplar species. OMT gene expression was observed mainy in the developing secondary xylem where major quantity of lignin occurs. Lignin content in the xylem tissue increased as plant resumed growth in the spring and reached the highest in the late August. Change in lignin content was concurrent with that of OMT gene expression, indicating OMT is a key enzyme in lignin biosynthesis.

• Journal of the Korean Arthroscopy Society
• /
• v.4 no.2
• /
• pp.148-153
• /
• 2000

Purpose : This study was conducted to analyze the results of arthroscopic ankle arthrodesis and to verify the advantages of the technique compared to open ankle arthrodesis. Materials and Methods : Between October 1992 and August 1996, the arthroscopic ankle arthrodesis had been performed in five patients(six ankle joints): two patients with seropositive rheumatoid arthritis(one patient surgically treated bilaterally), two with osteoarthritis and one with tuberculous arthritis. There were one man and 4 women. Average age was 48 years ranging from 38 to 65 years. Follow up period was average 45 months(range, $12\~80$). Results : All patients were successfully treated with ankle joint arthrodesis under arthroscopic control. The mean time to fusion was 10 weeks(range, $6\~15$). There was a $100\%$ fusion rate without any complication. Conclusion : The arthroscopic ankle arthrodesis was successful in all cases with less morbidity and short hospital stay. It was technically feasible with excellent predictability.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.11
• /
• pp.62-72
• /
• 2003

This paper deals with a crosstalk minimization method by wire spacing. The suggested method uses linear programming method and consider crosstalk of both horizontal segments and vertical segments. In this paper, we suggest a method which can predict the coupling length between vertical segments in the final routing result using longest path algorithm. By the suggested method, we can make LP problem without integer variable. Therefore, it is much faster to solve the problem. In the case of crosstalk optimization, the suggested method optimized peak crosstalk 11.2%, and 3% total crosstalk more than wire perturbation method. The execution time of the suggested method is as fast as it takes 11 seconds when Deutsch is optimized.