http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
김동윤,박영순,Kim, Dong-Yun,Park, Young-Soon 대한방사선기술학회 2000 방사선기술과학 Vol.23 No.1
In the present study, to determine whether the ascorbate protect against radiation damage and the possible relationship among the radioprotective effects and antioxidant actions, the effects of ascorbate(240 mg/kg, i.p) pretreatment of mice on the survival ratio, splenic weight, major antioxidant enzymes(SOD, catalase and glutathione peroxidase) activities, glutathione contents and lipid peroxidation in the liver were examined for 2 weeks after whole-body ${\gamma}-irradiation$(6.5 Gy). The 30-day survival ratio Increased from 10% to 47% for mice treated with ascorbate. The ascorbate decreased the extent of loss in splenic weight and stimulated recovery of splenic weight in irradiated mice(p<0.01). On the day of 14 after ${\gamma-irradiation}$, the ascorbate pretreatment produced a slight increase of antioxidant enzymes activities and significantly increased reduced glutathione(GSH) contents(P<0.05) in the liver compared with non-treated group. Pretreatment with the ascorbate significantly decreased GSSG/total GSH ratio(p<0.05) without the change of GSSG in the liver and inhibited the radiation-induced increase in the hepatic malondialdehyde levels(p<0.05). In these results, we found that its radioprotective effect by protecting antioxidant enzyme activities and glutathione contents from radiation induced a decrease, and thereby suppressing lipid peroxidation which is induced by free radicals.
김동윤,김상희,고보연,Kim Dong-Yun,Kim Sang-Hui,Go Bo-Yeon 한국국방경영분석학회 1991 한국국방경영분석학회지 Vol.17 No.1
In this paper, we deal with the TSP (Traveling Salesperson Problem) which is well-known as NP-complete optimization problem. the TSP is applicable to network routing. task allocation or scheduling. and VLSI wiring. Well known numerical methods such as Newton's Metheod. Gradient Method, Simplex Method can not be applicable to find Global Solution but the just give Local Minimum. Exhaustive search over all cyclic paths requires 1/2 (n-1) ! paths, so there is no computer to solve more than 15-cities. Heuristic algorithm. Simulated Annealing, Artificial Neural Net method can be used to get reasonable near-optimum with polynomial execution time on problem size. Therefore, we are able to select the fittest one according to the environment of problem domain. Three methods are simulated about symmetric TSP with 30 and 50-city samples and are compared by means of the quality of solution and the running time.