http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
조준원,김웅겸,김헌영,김병의 강원대학교 산업기술연구소 2005 産業技術硏究 Vol.25 No.B
Micro wires manufactured by the straightening process are used in the BT(Bio-Technology), IT(Information-technology), NT(Nano-Technology). We have developed a novel wire straightener which uses the direct heating method(DHM) for straightening the micro wire and shearing device for burr-less cutting. In this study, we confirm the tendency of micro wire after the shearing process. It is impossible to remove the burr in the shearing process. However, the embodiment of minimum burr size after the shearing process is the best in-process method. In order to minimize the burr size, we have accomplished the various experiment condition such as the U-groove, the effect of counter punch, the shear angle, clearance.
Characterization of the European type of maternal lineage evident in extant Jeju native pigs
Byeong‐Woo Kim,In‐Cheol Cho,Moon‐Sung Park,Tao Zhong,임현태,Sung‐Soo Lee,Hee‐Bok Park,Moon‐Suck Ko,Jun‐Heon Lee,Jin‐Tae Jeon 한국유전학회 2011 Genes & Genomics Vol.33 No.2
Using a partial D‐loop sequence of mtDNA, an intensive analysis was conducted of the maternal lineages of Jeju native pigs (JNPs) from Korea. In total, 100 mtDNA sequences were obtained from Asian wild boars (AWBs), European wild boars (EWBs), Asian domestic pigs (ADPs), European domestic pigs (EDPs), and JNPs and were used for phylogeny and network analyses. Two distinct JNP groups - one (JNPA) in the Asian cluster and the other (JNPE) in the European cluster - were identified in the estimated phylogenetic tree and network. The maternal lineage of JNPE was the closest to that of EWB and a clear haplogroup was identified that shared an identical haplotype (hap04) among 15 individuals of JNPE and 2 individuals of EWB. A Landrace and an EWB shared hap03with a JNPE. EWB, Landrace, Large White, and Duroc formed two clear haplogroups with JNPE in a parsimonious medianjoining network analysis, suggesting that an obvious maternal contribution of EDP has occurred in JNPE in recent years. A pair‐wise mismatch analysis also indicated that JNPE may have experienced a sudden population expansion, suggesting a more recent establishment compared with the gradual population expansion of JNPA. The JNPE group therefore should be further evaluated in order to decide whether this group should be culled or accepted into further programs for maintenance of the JNP population as a pure breed.
이헌영,김병호,정현용,김영건,조준식 충남대학교 의과대학 지역사회의학연구소 1993 충남의대잡지 Vol.20 No.2
Hepatocellular carcinoma(HCC) is the second most common cause of cancer death in Korea. Generally, HCC was unresectable due to the frequently associated cirrhosis and advanced stage of tumor. As a palliative therapy of HCC, transcatheter arterial chemoembolization(TACE) was a proven effective mean of treating inoperable HCC. We have analyzed the effectiveness of TACE in inoperable HCC. TACE was performed in 20 patients from January in 1990 to May in 1993 at Chung Nam National University Hospital with the infusion of mixture of Lipiodol and Adriamycin. We analyzed the survival rates of the TACE group and the control group who received no specific treatment. The results were follows ; 1) The survival rate was significantly higher in TACE group than control group(p<0.01). The survival rate at the end sixth months and one year were 62.8% and 40.0% in TACE group, 26.6% and 0% in control group, respectively. 2) A declining level of AFP(Alph-fetoprotein) was shown in 8 among 10 cases who underwent TACE/and was higher than 500 ng/ml in pre-TACE level(p<0.01) and also tumor size was decreased in 7 among 20 cases who underwent TACE. 3) Side effects were fever(80.0%), and upper abdominal pain(75.0%) in TACE group but improved within 7 days after TACE and impairment of liver function was developed in most patients(TACE group) but improved within 2 weeks after TACE. As a palliative therapy of HCC, TACE is an effective and useful modality in treating and prolonging the survival time of patients with unresectable hepatocellular carcinoma.
조병헌(Byeong-Heon Cho),정성훈(Sung-Hoon Jung),성영락(Yeong-Rak Seong),오하령(Ha-Ryoung Oh) 한국지능시스템학회 2004 한국지능시스템학회논문지 Vol.14 No.4
본 논문에서는 신경망을 이용하여 대전 액션 게임의 캐릭터들을 지능화하는 방법을 제안한다. 일반적인 대전 액션 게임에서 어떤 행동은 여러 개의 시간 단위에 걸쳐 이루어진다. 그러므로 캐릭터의 어떤 행동에 대한 결과는 곧바로 나타나지 않고 몇 개의 시간 단위가 지난 후에 나타난다. 이러한 캐릭터들에 적합한 신경망을 설계하기 위해서는 신경망을 학습시키는 시점을 결정하는 것과 더불어 학습시에 사용되는 입력과 출력 값을 선정하는 것이 매우 중요하다. 본 논문에서는 캐릭터의 행동의 적합도를 게임 점수의 변화로 평가한다. 그러므로 게임 점수의 변화가 생길 때마다 신경망은 학습된다. 학습을 위해서는 우선 그 변화를 야기한 이전의 결정을 파악하고, 그 당시의 입력값, 출력값, 그리고 현재의 점수의 변화를 이용하여 신경망을 학습시킨다. 제안된 알고리즘의 성능을 평가하기 위하여 여러 실험을 간단한 (하지만 실제 게임과 매우 유사한) 게임 환경에서 수행하였다. 실험 결과 학습 초기에는 무작위의 캐릭터에 대해 점수를 획득하지 못하던 지능 캐릭터가 제안된 알고리즘으로 학습하면 최대 3.6 배의 점수를 획득하는 성능을 보였다. 그러므로 제안된 지능 캐릭터가 게임의 규칙과 기술을 학습하는 능력이 있는 것으로 결론지을 수 있다. 제안된 알고리즘은 온라인 게임과 같이 캐릭터들이 서로 대결하는 게임들에 적용할 수 있다. This paper proposes a method to provide intelligence for characters in fighting action games by using a neural network. Each action takes several time units in general fighting action games. Thus the results of a character's action are not exposed immediately but some time units later. To design a suitable neural network for such characters, it is very important to decide when the neural network is taught and which values are used to teach the neural network. The fitness of a character's action is determined according to the scores. For learning, the decision causing the score is identified, and then the neural network is taught by using the score change, the previous input and output values which were applied when the decision was fixed. To evaluate the performance of the proposed algorithm, many experiments are executed on a simple action game (but very similar to the actual fighting action games) environment. The results show that the intelligent character trained by the proposed algorithm outperforms random characters by 3.6 times at most. Thus we can conclude that the intelligent character properly reacts against the action of the opponent. The proposed method can be applied to various games in which characters confront each other, e.g. massively multiple online games.
조병헌(Byeong Heon Cho),정성훈(Sung Hoon Jung),김기형(Ki Hyoung Kim),성영락(Yeong Rak Seong),오하령(Ha Ryoung Oh) 한국정보과학회 1999 한국정보과학회 학술발표논문집 Vol.26 No.1A
지금까지 상자 채우기 문제(bin packing problem)를 풀기 위하여 다양한 방법들이 제안되었다. 일반적으로 많이 사용되는 방법으로는 FF, FFD, BF, BFD와 같은 간단한 휴리스틱(heuristic) 방법이 있다. 그러나, 많은 경우 위 방법으로는 최적인 해를 생성하지 않는다. 상자 채우기 문제를 해결하는 또 다른 방법으로는 유전자 알고리즘(genetic algorithm)을 이용한 방법이 있다. 과거에 연구된 유전자 알고리즘은 상자 채우기 문제의 제한을 만족하지 않는 개체를 생성하는 경우가 많아서 효율적이지 못했다. 본 논문에서는 무효한 개체를 생성하지 않고, 효과적으로 상자 채우기 문제를 해결하는 새로운 유전자 알고리즘을 제안한다. 여러 가지 기존의 문제를 적용해 본 결과 FF, FFD, BF, BFD와 유사한 또는 그보다 좋은 결과를 생성했다. 특히 본 논문에서 제안한 유전자 알고리즘은 최적해를 찾는 경우도 있었다.