• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.3
• /
• pp.593-603
• /
• 1997

Connection admission decision in ATM networks requires decision made in real time using fast algorithm. It is difficult to construct a model of the multiplexed traffic and thus, approximation of the traffic load is necessary. In this paper, we propose a measurement-based dynamic CAC(Connection admission Control) in ATM(Asynchronous Transfer Mode) networks, which observes current traffic by the moving window and set the window size to the value which is computed from the measured cell loss amount. It is based on the measurements of the traffic load over an admission period that is load enough to reflect the current traffic behavior instead of analytic modeling. And, the dynamic reallocation of bandwidth for each class leads to effective bandwidth utilization. The performance of proposed method is analyzed through computer simulation. The performance of proposed method is analyzed by using SIMAN simulation package and FORTRAN language. As can be seen in the simulation result, cell loss performance and bandwidth utilization have been increased.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.10 no.4
• /
• pp.73-79
• /
• 2000

We show how to reduce the number of multiplications required for an exponentiation by using a window method and a factor method. This method requires 599 multiplications for a 512-bit integer exponent while the window method with window size 5 requires 607 multiplications. This method requires fewest multiplications among practical exponentiation algo- rithms.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.191-195
• /
• 2008

This paper proposes a technique for improving IEEE 802.11e EDCA's performance by dynamically adjusting each class's contention window size based on each class's traffic amount. For providing differentiated service differently from 802.11, 802.11e EDCA maintains four classes each of which specifies different static minimum and maximum contention window sizes. Since the initial window sites significantly affect the 802.11e performance, several window adjustment schemes have been proposed. One of the schemes known as CWminAS (CWmin Adaptation Scheme) dynamically and synchronously determines the four windows' site based on the periodically measured collision rate. This method, however, can lower the send probability of high priority classes since it can't differentiate their collisions from those of low priority classes, leading to the channel underutilization. For solving this problem, we propose ACATICT(Adaptive Contention-window Adjustment Technique based on Individual Class Traffic) algorithm which adapts each class window size based on each individual collision rate rather than one average collision rate. Our simulation experiments show that ACATICT achieves better utilization by around 10% at maximum.

• The KIPS Transactions:PartC
• /
• v.14C no.6
• /
• pp.475-480
• /
• 2007

Recently, wireless networking devices that depend on the limited Battery and power-saving of wireless hosts became important issue. Batteries can provide a finite amount of energy, therefore, to increase battery lifetime, it is important to design techniques to reduce energy consumption by wireless hosts. This paper improved power saying mechanism in Distributed Coordination Function(DCF) of IEEE 802.11. In the IEEE 802.11 power saving mechanism specified for DCF, time is divided into so-called beacon intervals. At the start of each beacon interval, each node in the power saving mode periodically wakes up during duration called the ATIM Window. The nodes are required to be synchronized to ensure that all nodes wake up at the same time. During the ATIM window, the nodes exchange control packets to determine whether they need to stay awake for the rest of the beacon interval. The size of the ATIM window has considerably affected power-saving. This paper can provide more power-saving than IEEE 802.11 power saving mode because ATIM window size is efficiently increased or decreased.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12A
• /
• pp.1229-1237
• /
• 2006

IEEE 802.11 has employed distributed coordination function (DCF) adopting carrier sense multiple access with collision avoidance (CSMA/CA). To effectively resolve collisions, DCF uses binary exponential backoff (BEB) algorithm with three parameters, i.e., backoff stage, backoff counter and contention window. If a collision occurs, stations involving in the collision increase their backoff stages by one and double their contention window sizes. However, DCF with BEB wastes wireless resource when there are many contending stations. Therefore, in this paper, to enhance the performance of wireless LAN, we propose binary negative-exponential backoff (BNEB) algorithm which maintains a maximum contention window size during collisions and reduces a contention window size to half after successful transmission of a frame without retransmissions. For IEEE 802.11, 802.11a and 802.11b standards, we also compare the performance of DCF with BEB to that with BNEB.

• Clinical Endoscopy
• /
• v.56 no.4
• /
• pp.490-498
• /
• 2023

Background/Aims: Post-endoscopic retrograde cholangiopancreatography pancreatitis (PEP) is the most common and serious complication of endoscopic retrograde cholangiopancreatography. To prevent this event, a unique precutting method, termed opening window fistulotomy, was performed in patients with a large infundibulum as the primary procedure for biliary cannulation, whereby a suprapapillary laid-down H-shaped incision was made without touching the orifice. This study aimed to assess the safety and feasibility of this novel technique. Methods: One hundred and ten patients were prospectively enrolled in this study. Patients with a papillary roof size ≥10 mm underwent opening window fistulotomy for primary biliary access. In addition, the incidence of complications and success rate of biliary cannulation were evaluated. Results: The median size of the papillary roof was 6 mm (range, 3-20 mm). Opening window fistulotomy was performed in 30 patients (27.3%), none of whom displayed PEP. Duodenal perforation was recorded in one patient (3.3%), which was resolved by conservative treatment. The cannulation rate was high (96.7%, 29/30 patients). The median duration of biliary access was 8 minutes (range, 3-15 minutes). Conclusions: Opening window fistulotomy demonstrated its feasibility for primary biliary access by achieving great safety with no PEP complications and a high success rate for biliary cannulation.

• Journal of radiological science and technology
• /
• v.6 no.1
• /
• pp.103-113
• /
• 1983

Scintillation cameras을 사용(使用)할때 양질(良質)의 화상(畵像)을 얻기 위하여 camera의 성능(性能), 방사성의약품(放射性醫藥品)의 특성(特性), 그리고 적정(適正)한 촬상조건(撮像條件)을 고려할 필요(必要)가 있다. 특(特)히 RI 상(像)에 대한 촬상조건(撮像條件)은 film의 성질(性質), 상(像)의 크기, 상(像)의 농도(濃度), window, 그리고 콜리메타 전면(前面)으로부터 거리(距離) 등(等)에 따라서 좌우(左右)된다. 이러한 요인(要因)들은 각각 화상(畵像)을 만드는 과정에 영향(影響)을 미치고 있다. 그러므로 상(像)의 표준화(標準化)와 촬상방법(撮像方法)의 기준(基準)을 확립(確立)하기가 매우 어렵다. 고로 이러한 문제(問題)들을 해결(解決)하는 것은 Scintillation camera을 사용(使用)하는 핵의학적(核醫學的) 검사(檢査)에 있어서 매우 중요(重要)하다. 저자(著者)는 이러한 점(點)을 고려하여 일정(一定)한 상(像)의 농도(濃度)을 얻을 수 있는 촬상조건(撮像條件)에 대(對)하여 실험(實驗)을 하였다. 실험(實驗)에 있어서 평행다공형(平行多孔型) 콜리메타를 camera의 head에 부착(附着)시키고 $^{99m}Tc$(3mCi)가 넣어져 있는 liver phantom을 콜리메타의 표면(表面)에 밀착(密着)시켜 다음과 같은 방법(方法)에 의하여 촬상(撮像)하였다. 즉, 일정(一定)한 상(像)의 농도(濃度)을 얻을 수 있는 촬상조건(撮像條件)을 찾아낼 목적(目的)으로 preset time, image size, 콜리메타전면(前面)- phantom간(間) 거리(距離), 그리고 window를 각각(各各) 변화(變化)시키면서 phantom을 촬상(撮像)하였으며, 특(特)히 거리(距離)와 window에 있어서는 cold defects의 검출능(檢出能)도 비교검토(比較檢討)하였다. 실험결과(實驗結果)는 다음과 같다. 1. C type film에 있어서 1.5의 농도(濃度)을 얻기위해서는 7.5의 intensity 에서 preset time은 60초(秒), image size는 1.0, 콜리메타-phantom간거리(間距離)는 0cm 그리고 window는 20%가 요구(要求)되고 있었다. 2. 편면유제(片面乳劑) film의 preset time은 양면유제(兩面乳劑) film보다 짧은 것으로 나타났다. 3. 상(像)의 분해능(分解能)은 image size가 작을수록, 콜리메타-phantom간(間) 거리(距離)가 짧을수록, 그리고 window 폭(幅)이 좁을수록 더욱 더 향상(向上)되고 있었다. 4. Cold defects의 검출능(檢出能)은 image size가 작을수록, 콜리메타-pantom간(間) 거리(距離)가 짧을수록, 그리고 window폭(幅)이 좁을수록 향상(向上)되고 있었다.

• Korean Journal of Cognitive Science
• /
• v.20 no.4
• /
• pp.573-601
• /
• 2009

The present study investigated the perceptual span during reading Korean, using the moving-window display change technique introduced by McConkie and Rayner(1975). Eight different window sizes were used in Experiment 1. They were 3, 5, 7, 9, 11, 13, 15 characters in size and the full line. Reading rate, number of fixation, saccadic distance, fixation duration were compared between each window-size condition and the full line condition. The reading rate was no higher in the full line condition than in the 15 character condition but was higher than in the other conditions. The number of fixations was no larger in the full line condition than in the 15 character condition, had a tendency to be larger than in the 13 characters condition, and was more than in the other conditions. The result pattern of the saccadic distance based on character was the same as that of the reading rate, and the saccadic distance based on the pixel was the same as that of the number of fixation. Similarly, for fixation duration, there was no differences between whole line condition and 15, 13, and 11 characters condition. The fixation duration had a tendency to be shorter in the 9 characters, and was shorter in the 7, 5, and 3 characters conditions than whole line condition. In Experiment 2, based on asymmetry of perceptual span, the 6 different window sizes(0, 1, 2, 3, 4 characters in size and the full line) were used. There was a difference only between the 0 condition and the other conditions in the reading rate, number of fixations, fixation duration. Considering the pattern of eye-movement measures above, the perceptual span of Korean readers extends about 6-7 characters to the right of fixation and 1 character to the left of fixation.

• Journal of Bio-Environment Control
• /
• v.10 no.1
• /
• pp.42-49
• /
• 2001

This study was carried out to develop a fuzzy control technique of ventilation window for controlling a temperature in a greenhouse. To reduce the fuzzy variables, the inside air temperature shop was taken as one of fuzzy variables, because the inside air temperature variation of a greenhouse by ventilation at the same window aperture is affected by difference between inside and outside air temperature, outside wind speed and the wind direction. Therefore, the antecedent variables for fuzzy algorithm were used the control error and its slop, which was same value as the inside air temperature slop during the control period, and the conclusion variable was used the window aperture opening rate. Through the basic and applicative control experiment with the control period of 3 minutes the optimum ranges of fuzzy variables were decided. The control error and its slop were taken as 3 and 1.5 times compared with target error in steady state, and the window opening rate were taken as 30% of full size of the window aperture. To evaluate the developed fuzzy algorithm in which the optimized 19 rules of fuzzy production were used, the performances of fuzzy control and PID control were compared. The temperature control errors by the fuzzy control and PID control were lower than 1.3$^{\circ}C$ and 2.2$^{\circ}C$ respectively. The accumulated operating size of the window, the number of operating and the number of inverse operating for the fuzzy control were 0.4 times, 0.5 times and 0.3 times of those compared with the PID control. Therefore, the fuzzy control can operating the window more smooth and reduce the operating energy by 1/2 times of PID control.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.6A
• /
• pp.550-557
• /
• 2007

We predict a context of various structures by using Bayesian Networks Algorithms, Three-Dimensional Structures Algorithms and Genetic Algorithms. However, these algorithms have unavoidable problems when providing a context-aware service in reality due to a lack of practicality and the delay of process time in real-time environment. As far as context-aware system for specific purpose is concerned, it is very hard to be sure about the accuracy and reliability of prediction. This paper focuses on reasoning and prediction technology which provides a stochastic mechanism for context information by incorporating various context information data. The objective of this paper is to provide optimum services to users by suggesting an intellectual reasoning and prediction based on hierarchical context information. Thus, we propose a design of user location prediction algorithm using sequential matching with n-size flexible window scheme by taking user's habit or behavior into consideration. This algorithm improves average 5.10% than traditional algorithms in the accuracy and reliability of prediction using the Flexible Window Scheme.