http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
제2기 대장암 환자에서 신뢰성 있는 림프절 병기 결정에 필요한 조사 림프절 수
이태무,최홍조,박기재,김정민,노영훈,노미숙 대한대장항문학회 2005 Annals of Coloproctolgy Vol.21 No.3
Purpose: The variety of outcomes in patients with stage II colorectal carcinomas might be due to understaging caused by an inadequate number of lymph nodes (LNs) being examined. The aim of this study was to determine if any number of examined LNs reflects a reliable node-negative staging for colorectal carcinomas (CRCs). Methods: Data on 241 patients (132 males) who underwent potentially curative resections for pT3 and pT4 CRC were reviewed. The patients ranged in age from 21 to 87 (mean: 58.2) years with a median follow-up of 43 (range: 7~96) months. The relationship between the number of LNs harvested and both the 5-year disease-free survival (DFS) and the overall survival (OS) rates were assessed for stage II CRCs. Results: A median of 15 LNs (range: 3~104) was harvested per tumor specimen, and lymph-node metastases were present in 107 cases (44.4%). The proportion of lymph-node metastases increased as a function of the number of LNs harvested (P=0.0002; 95% confidence interval, 0.3333~0.8138). The number of LNs revealed to be the best number for dividing stage II patients into subgroups with different DFS and OS rates was ten. The 5-year DFS and OS rates of the 48 patients (35.8%) with nine or fewer LNs harvested were 68.6% and 76.8%, respectively, whereas those of the 86 patients (64.2%) with ten or more LNs harvested were 87.2% and 91.9%, respectively (DFS, P=0.0082; OS, P=0.0303). Moreover, there were no statistical differences between the node-negative patients with nine or fewer LNs harvested and the 67 stage III patients with N1 in respect to the DFS (68.6% vs. 56.7%; P= 0.2031) and the OS (76.8% vs. 68.3%; P=0.2772) rates. Conclusions: This study suggests that examining a greater number of lymph nodes increases the likelihood of accurate nodal staging and that a minimum of ten LNs per surgical specimen should be harvested and examined to label a pT3 or pT4 CRC as node-negative.
패리티 디틀러스터링 RAID 시스템에서의 성능 개선 방안
장태무,Chang, Tae-Mu 한국정보처리학회 2000 정보처리논문지 Vol.7 No.2
RAID는 고 병렬성과 고 가용성을 목표로 하는 대용량 저장 매체를 구축하는 방법이다. 패리티 디클러스터링을 이용한 RAID는 특히 고장이 발생한 경우에도 성능의 저하를 최소화하여 고 결함 허용도 및 가용성을 높일 수 있는 저장 장치를 구축할 수 있는 기법으로 널리 연구되어 왔다. 본 논문에서는 이러한 패리티 디클러스터링을 사용한 RAID에 스페어 유닛을 분산시킨 새로운 구성을 제안하고, 특히 이러한 분산 스페어링이 고장이 없는 정상 상태에서도 성능 개선에 유용함을 보인다. 본 논문에서 제안된 방법의 유효성은 시뮬레이션 방식으로 입증하였으며, 전반적으로 정상상태의 성능을 5-15% 정도 높일 수 있음을 알 수 있다. RAID systems have been used as a mass storage system with high parallelism and availability. Especially RAID systems with parity declustering are widely studied as a technique to provide high fault tolerancy and availability by reducing performance degradation in case of disk fuilures. In this paper, a new organization of parity declustering with distributed spare units is proposed. And in normal mode where there are no failures, it is shown that these organization can improve the performance of RAID systems. By simulation methods, it is proved that the performance of RAID system in normal mode is improved by 5 to 15%.
장태무,진종욱 東國大學校 1998 東國論叢 Vol.37 No.-
The network traffic under classical client and server systems can be reduced by caching files or parts of a file on the side of both server and clients. But owing to consistency management message traffics, the network performance is dependent on the read/write ratio. In this paper, a two phase request resolution protocol that divides a reques into pipelined phases. (request and resolution phase) is proposed. Because client directly uses the cache of resource's owner, this protocol reduce redundant messages even if the number of write clients are large. Additionally this protocol can lessen the load of the server like communicaton agents do. The protocol of this paper is evaluated by a simulation method. The performance under various workloads is measured by running the simulator that is based on randomly generated request patterns and TCP/IP LAN environments. The result shows the proposed protocol can reduce the average request completion time by about 10 to 30% comparing to the conventional Sprite file system cache management scheme.