• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.143-152
• /
• 2013

Given weighted graph G=(V,E), n=|V|, m=|E|, the minimum cut problem is classified with source s and sink t or without s and t. Given undirected weighted graph without s and t, Stoer-Wagner algorithm is most popular. This algorithm fixes arbitrary vertex, and arranges maximum adjacency (MA)-ordering. In the last, the sum of weights of the incident edges for last ordered vertex is computed by cut value, and the last 2 vertices are merged. Therefore, this algorithm runs $\frac{n(n-1)}{2}$ times. Given graph with s and t, Ford-Fulkerson algorithm determines the bottleneck edges in the arbitrary augmenting path from s to t. If the augmenting path is no more exist, we determine the minimum cut value by combine the all of the bottleneck edges. This paper suggests minimum cut algorithm for undirected weighted graph with s and t. This algorithm suggests MA-merging and computes cut value simultaneously. This algorithm runs n-1 times and successfully divides V into disjoint S and V sets on the basis of minimum cut, but the Stoer-Wagner is fails sometimes. The proposed algorithm runs more than Ford-Fulkerson algorithm, but finds the minimum cut value within n-1 processing times.

• Korean Journal of Optics and Photonics
• /
• v.10 no.5
• /
• pp.405-412
• /
• 1999

We propose an effective algorithm, which can predict the detailed behavior of the intensity-modulated high speed optical signal after propagating through an optical fiber. The alogrithm is based on the SSF (Split Step Fourier) Method, however, the step size is automatically calibrated in each calculation step to reduce the number of calculations within given round-off error bound. Applying the algorithm to the 2.5 Gbps 100 km transmission and 10 Gbps 40 km transmission simulations, we achieved the calculation time reduction by maximum 1/120 and 1/56 of the calculation time by using the SSF fixed step algorithm previously known. The root-mean-square of the round-off error was kept within -30 dB compared to the signal level throughout the calculation.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.4
• /
• pp.462-469
• /
• 2002

While the conventional K-means algorithms use a fixed weight to design a vector codebook for all learning iterations, the proposed method employs a variable weight for learning iterations. The weight value of two or more beyond a convergent region is applied to obtain new codevectors at the initial learning iteration. The number of learning iteration applying a variable weight must be decreased for higher weight value at the initial learning iteration to design a better codebook. To enhance the splitting method that is used to generate an initial codebook, we propose a new method, which reduces the error between a representative vector and the member of training vectors. The method is that the representative vector with maximum squared error is rejected, but the vector with minimum error is splitting, and then we can obtain the better initial codevectors.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.2
• /
• pp.1-8
• /
• 1999

We analyze the transmission performance of WDM system based on cascaded optical add/drop multiplexers. The considered factors degrading the performance in this paper include the intra-channel corosstalk caused from space switches and demultiplexers/multiplexers, the amplified spontaneous emission noise, and the extinction ratio. To ensure the power penalty within 1dB, the extinction ration more than 13dB, the switch corosstalk less than 39dB, and the demultiplexer/multiplexer crosstalk less than 20dB are required. Under the assumption of switch corosstalk less than 30dB, performance degradation due to the ASE noise is dominant compared to the crosstalk. With the fixed decision threshold in an optical receiver, the maximum number of cascaded nodes reduces to a half compared to the case of the optimum decision threshold.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.1
• /
• pp.42-50
• /
• 2008

Unlike a cellular network, a mobile ad hoc network(MANET) is constructed only by mobile nodes without access point. Mobile nodes in MANET operate with scarce resources and restricted battery. If battery of intermediate node is exhausted, overall network might be diverged. Therefore, power-aware is really important. An on-demand multipath routing protocol which is proposed to compensate for shortcoming of on-demand single path routing protocol can reduce mute discovery overhead because route discovery starts only when all routes are disconnected. AOMDV(Ad hoc On-demand Multipath Distance Vector) which is on-demand multipath routing protocol based on AODV, reduces 40% of route discovery frequency. However, AOMDV have none of power-aware. So AOMDV have problem that route discovery for power exhaustion is not reduced at all. This paper proposes new power-aware path selection algorithm for AOMDV and scheme that broadcast REER packets when mobile node's battery can be gone. Performance comparison of proposed algorithm with AOMDV using ns-2 simulator shows that route discovery of proposed algorithm is reduced maximally 36.57% than AOMDV's.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.8A
• /
• pp.918-927
• /
• 2004

WCDMA system is 3rd generation wireless mobile system specified by 3GPP. In WCDMA downlink, two power control schemes are operated. One is inner loop power control operated in every slot. Another is outer loop power control based on one frame time. Base station (BS) can estimate proper transmission power by these two power control schemes. However, because each MS's transmission power makes a severe effect on BS's performance, BS cannot give excessive transmission power to the specific user. 3GPP defined Power Control Dynamic Range (PCDR) to guarantee proper BS's performance. In this paper, we propose Adaptive PCDR algorithm. By APCDR algorithm, Radio Network Controller (RNC) can estimate each MS's current state using received signal to interference ratio (SIR). APCDR algorithm changes MS's maximum code channel power based on frame. By proposed scheme, each MS can reduce wireless channel effect and endure outages in cell edge. Therefore, each MS can obtain better QoS. Simulation result indicate that APCDR algorithm show more attractive output than fixed PCDR algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9A
• /
• pp.1048-1057
• /
• 2004

WCDMA system is 3rd generation wireless mobile system specified by 3GPP. In WCDMA downlink, two power control schemes are operated. One is inner loop power control operated m every slot Another is outer loop power control based on one frame time. Base staion (BS) can estimate proper transmission power by these two power control schemes. However, because each MS's transmission power makes a severe effect on BS's performance, BS cannot give excessive transmission power to the speclfic user 3GPP defined Power Control Dynamic Range (PCDR) to guarantee proper BS's performance. In this paper, we propose Adaptive PCDR algorithm. By APCDR algorithm, Radio Network Controller (RNC) can estimate each MS's current state using received signal to interference ratio (SIR) APCDR algorithm changes MS's maximum code channel power based on frame. By proposed scheme, each MS can reduce wireless channel effect and endure outages in cell edge. Therefore, each MS can obtain better QoS. Simulation result indicate that APCDR algorithm show more attractive output than fixed PCDR algorithm.

• Progress in Medical Physics
• /
• v.26 no.4
• /
• pp.286-293
• /
• 2015

The purpose of this study was to evaluate the set up accuracy using stereotactic body frame and frameless immobilizer for lung stereotactic body radiation therapy (SBRT). For total 40 lung cancer patients treated by SBRT, 20 patients using stereotactic body frame and other 20 patients using frameless immobilizer were separately enrolled in each group. The setup errors of each group depending on the immobilization methods were compared and analyzed. All patients received the dose of 48~60 Gy for 4 or 5 fractions. Before each treatment, a patient was first localized to the treatment isocenter using room lasers, and further aligned with a series of image guidance procedures; orthogonal kV radiographs, cone-beam CT, orthogonal fluoroscopy. The couch shifts during these procedures were recorded and analyzed for systematic and random errors of each group. Student t-test was performed to evaluate significant difference depending on the immobilization methods. The setup reproducibility was further analyzed using F-test with the random errors excluding the systematic setup errors. In addition, the ITV-PTV margin for each group was calculated. The setup errors for SBF were $0.05{\pm}0.25cm$ in vertical direction, $0.20{\pm}0.38cm$ in longitudinal direction, and $0.02{\pm}0.30cm$ in lateral direction, respectively. However the setup errors for frameless immobilizer showed a significant increase of $-0.24{\pm}0.25cm$ in vertical direction while similar results of $0.06{\pm}0.34cm$, $-0.02{\pm}0.25cm$ in longitudinal and lateral directions. ITV-PTV margins for SBF were 0.67 cm (vertical), 0.99 cm (longitudinal), and 0.83 cm (lateral), respectively. On the other hand, ITV-PTV margins for Frameless immobilizer were 0.75 cm (vertical), 0.96 cm (longitudinal), and 0.72 cm (lateral), indicating less than 1 mm difference for all directions. In conclusion, stereotactic body frame improves reproducibility of patient setup, resulted in 0.1~0.2 cm in both vertical and longitudinal directions. However the improvements are not substantial in clinic considering the effort and time consumption required for SBF setup.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.1
• /
• pp.23-34
• /
• 2010

As the number of user increases according to the improvement of the network, the multi-thread schemes are used to process the service requests of several users who are connected simultaneously. The static thread pool scheme has the problem of occupying a static amount of system resources. On the other hand, the dynamic thread pool scheme can control the number of threads according to the users' requests. However, it has disadvantage that this scheme cannot react to the requests which are larger than the maximum value assigned. In this paper, a web server using a learning-based dynamic thread pool scheme is suggested, which will be running on a server programming of a multi-thread environment. The suggested scheme adds the creation of the threads through the prediction of the next number of periodic requests using Auto Regressive scheme with the web server apache worker MPM (Multi-processing Module). Unlike previous schemes, in order to set the exact number of the necessary threads during the unchanged number of work requests in a certain period, K-Nearest Neighbor algorithm is used to learn the number of threads in advance according to the number of requests. The required number of threads is set by comparing with the previously learned objects. Then, the similar objects are selected to decide the number of the threads according to the request, and they create the threads. In this paper, the response time has decreased by modifying the number of threads dynamically, and the system resources can be used more efficiently by managing the number of threads according to the requests.

• Exercise Science
• /
• v.23 no.1
• /
• pp.1-11
• /
• 2014

The purpose of this study was to develop and validate regression models to estimate maximal oxygen uptake (VO₂max) from the 20 m Progressive Shuttle Run Test (20 m PSRT) in Korean middle-school girls aged 13-15 years. The 20 m PSRT and VO₂max were assessed in a sample of 194 participants. The sample was randomly split into validation (n=127) and test-retest reliability (n=99, 32 out of 127 participants also performed validity test) groups. 127 participants performed a graded exercise test (GXT, stationary gas analyser) and the 20 m PSRT (portable gas analyser) once to develop a VO₂max prediction model and to analyze the validity of the modified 20 m PSRT protocol (starting at 7.5 km/h and increasing by 0.5 km/h every 1 min). 99 participants performed the 20 m PSRT twice for test-retest reliability purpose. Mean measured VO₂max (39.2±5.1 ml/kg/min) from the potable gas analyzer was significantly increased from that measured during the GXT from stationary gas analyzer (37.7±5.7 ml/kg/min, p=.001) using the modified 20 m PSRT protocol. But it was a narrow range (1.5 ml/kg/min). The measured VO₂max from the potable and stationary gas analyzers correlated at r=.88(p<.001). Test-retest of the 20 m PSRT yielded comparable results (Laps r=.88 & final speed r=.85). New regression equations were developed from present data to predict VO₂max for middle-school girls: y=.231×Laps-.311×weight(in kg)+46.201 (r=.74, SEE=4.29 ml/kg/min). It is concluded that (a) the modified 20 m PSRT protocol is a valid and reliable test and (b) this equation developed in this study provides valid estimates of VO₂max of Korean middle-school girl aged 13-15 years.