• Communications for Statistical Applications and Methods
• /
• 제25권4호
• /
• pp.373-383
• /
• 2018

The spatial scan statistic is a widely used method to detect spatial clusters. The method imposes a large number of scanning windows with pre-defined shapes and varying sizes on the entire study region. The likelihood ratio test statistic comparing inside versus outside each window is then calculated and the window with the maximum value of test statistic becomes the most likely cluster. The results of cluster detection respond sensitively to the shape and the maximum size of scanning windows. The shape of scanning window has been extensively studied; however, there has been relatively little attention on the maximum scanning window size (MSWS) or maximum reported cluster size (MRCS). The Gini coefficient has recently been proposed by Han et al. (International Journal of Health Geographics, 15, 27, 2016) as a powerful tool to determine the optimal value of MRCS for the Poisson-based spatial scan statistic. In this paper, we apply the Gini coefficient to normal-based spatial scan statistics. Through a simulation study, we evaluate the performance of the proposed method. We illustrate the method using a real data example of female colorectal cancer incidence rates in South Korea for the year 2009.

• Journal of Information Processing Systems
• /
• 제2권1호
• /
• pp.34-38
• /
• 2006

In the wireless network, TCP performs poorly because it was originally designed for wired networks and does not take into consideration wireless characteristics such as mobility, high-loss probability, and hidden-terminal problems. In particular, in the wireless multi-hop networks, a large congestion window increases the probability of contention and packet losses, and TCP performance is degraded severely as a result. So, it is necessary to limit the TCP congestion window size in order keep the probability of contention loss in the system to a minimum. In this paper, we propose a new scheme for determining the maximum congestion window size based on the measured bandwidth and Round-Trip-Time (RTT). Using ns-2 simulation, we show that the proposed scheme reduces the probability of packet contention and improves TCP performance.

• Management Science and Financial Engineering
• /
• 제4권2호
• /
• pp.43-58
• /
• 1998

Packet switch is a key component in high speed digital networks. This paper investigates congestion phenomena in the packet switching with input buffers. For large value of switch size N, mathematical models have been developed to analyze asymptotic maximum switch throughput under nonuniform traffic. Simulation study has also been done for small values of finite N. The rapid convergence of the switch performance with finite switch size to asymptotic solutions implies that asymptotic analytical solutions approximate very closely to maximum throughputs for reasonably large but finite N. Numerical examples show that non-uniformity in traffic pattern could result in serious degradation in packet switch performance, while the maximum switch throughput is 0.586 when the traffic load is uniform over the output trunks. Window scheduling policy seems to work only when the traffic is relatively uniformly distributed. As traffic non-uniformity increases, the effect of window size on throughput is getting mediocre.

• 한국통신학회논문지
• /
• 제22권11호
• /
• pp.2401-2408
• /
• 1997

The measured pulse shapes provided in the given data package demonstrated pulse distortions due to laser speckle. the distorted pulse shapes were carefully analyzed, modeled, and then applied to the DTTL(Digital-data Transition Tracking Loop)[1] bit synchronizer simulator to measure the mean time delay and its delay variation performance. The result showed that the maximum mean time delay variation with the modeled data was 12.5% when window size equals 1. All the data given were located within this modeled boundary and the maximum eman time delay variation was 7% in this case. The mean time delay variation was known to be smaller by reducing the window size [2][5][6]. The mitigated delay variation was 2.5% in the modeled case and 1.4% in the data set given when the windown size equals 0.1. With the digital DTTL insteal of analog DTTL, similar results was obtained.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권5호
• /
• pp.896-909
• /
• 2010

IEEE 802.11 medium access control (MAC) employs the distributed coordination function (DCF) as the fundamental medium access function. DCF operates with binary exponential backoff (BEB) in order to avoid frame collisions. However it may waste wireless resources because collisions occur when multiple stations are contending for frame transmissions. In order to solve this problem, a binary negative-exponential backoff (BNEB) algorithm has been proposed that uses the maximum contention window size whenever a collision occurs. However, when the number of contending stations is small, the performance of BNEB is degraded due to the unnecessarily long backoff time. In this paper, we propose the adaptive BNEB (A-BNEB) algorithm to maximize the throughput regardless of the number of contending stations. A-BNEB estimates the number of contending stations and uses this value to adjust the maximum contention window size. Simulation results show that A-BNEB significantly improves the performance of IEEE 802.11 DCF and can maintain a high throughput irrespective of the number of contending stations.

• 한국정밀공학회지
• /
• 제20권7호
• /
• pp.138-146
• /
• 2003

A critical issue in area-based stereo matching lies in selecting a fixed rectangular window size. Previous stereo methods doesn't deal effectively with occluding boundary due to inevitable window-based problems, and so give inaccurate and noisy matching results in areas with steep disparity variations. In this paper, a variable window approach is presented to estimate accurate, detailed and smooth disparities for three-dimensional structure reconstruction. It makes the smoothing of depth discontinuity reduced by evaluating corresponding correlation values and intensity gradient-based similarity in the three-dimensional disparity space. In addition, it investigates maximum connected match candidate points and then devise the novel arbitrarily shaped variable window representative of a same disparity to treat with disparity variations of various structure shapes. We demonstrate the performance of the proposed variable window method with synthetic images, and show how our results improve on those of closely related techniques for accuracy, robustness, matching density and computing speed.

• Spatial Information Research
• /
• 제18권5호
• /
• pp.13-26
• /
• 2010

본 논문에서는 항공 라이다 데이터를 이용하여 지형의 유형을 분류하는 과정에서 지형의 특성에 따라 지형 분류의 판정 단위를 가변적으로 변화시키는 동적 가변 윈도우 기반 지형 분류 기법을 제안한다. 제안된 동적 가변 윈도우 기반 지형 분류 기법에서는 지형의 특성과 반복 패턴에 따라 지형 분류의 판정 단위를 가변적으로 결정하여 지형 분류에 소요되는 시간을 감소시키고자 하였다. 또한, 본 논문에서는 실험을 통하여 동적 가변 윈도우 기반 지형 분류 기법의 시간효율과 정확도를 분석하고 최적의 최대 판정 윈도우 크기를 제시하였다. 실험 결과에 따르면 제안된 동적 가변 윈도우 기반 지형 분류 기법은 고정 윈도우 크기를 이용하는 기법과 유사한 정도의 정확성을 유지하면서도 빠른 지형 분류가 가능한 것으로 판명되었다.

• 대한방사선기술학회지:방사선기술과학
• /
• 제46권6호
• /
• pp.475-484
• /
• 2023

This study aimed to compare filters for reducing speckle noise in ultrasound images using clinical liver images. We acquired the clinical liver ultrasound images, and noisy images were obtained by adding 0.01, 0.05, 0.10, and 0.50 intensity levels of speckle noise to the liver images. The Wiener filter, median modified Wiener filter, gamma filter, and Lee filter were designed for the noisy images by setting window sizes at 3×3, 5×5, and 7×7. The coefficient of variation (COV) and contrast to noise ratio (CNR) were calculated to evaluate noise reduction and various filters. Moreover, the filter with the highest image quality was selected and quantitatively compared to a noisy image. As a result, COV and CNR showed the noise improved result when the Lee filter was applied. Furthermore, the Lee filter image with a window size of 7×7 was noted to possess approximately a minimum of 1.28 to a maximum of 3.38 times better COV and a minimum of 2.18 to a maximum of 5.50 times better CNR than the noisy image. In conclusion, we confirmed that the Lee filter was effective in reducing speckle noise and proved that an appropriate window size needs to be set considering blurring.

• 한국통신학회논문지
• /
• 제32권5A호
• /
• pp.426-432
• /
• 2007

터보 복호를 위한 MAP(Maximum A Posteriori) 알고리즘을 슬라이딩 윈도우 방식으로 설계하고 구현하였다. 먼저, 구현하는데 필요한 논쟁점들 즉, 슬라이딩 윈도우의 길이 및 상태 메트릭의 정규화 방식 등이 논의되고 그들의 최적 값을 모의실험을 통하여 얻었다. 또, 가지 메트릭 계산기를 포함한 복호기의 모든 구성요소의 회로가 제출되었다. 제안된 MAP구조는 버퍼 제어를 간단히 하여 슬라이딩 윈도우 크기 즉, 부-프레임 길이의 변경에 따라 쉽게 재설계 될 수 있다.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제14권2호
• /
• pp.191-195
• /
• 2008

본 논문은 IEEE 802.11e EDCA의 성능 향상을 위해서 클래스 트래픽에 기반하여 각 클래스의 경쟁 윈도우의 크기를 동적으로 조절하는 방안을 제안한다. IEEE 802.11e EDCA는 IEEE 802.11 DCF와는 달리 서비스 차별화를 위해 네 개의 클래스 AC마다 고정된 최소 경쟁 윈도우 크기인 CWmin 값과 최대 경쟁 윈도우 크기인 CWmax 값을 적용한다. 트래픽의 특성별로 나뉜 AC의 고정된 파라미터 값은 각 AC간의 차별화를 보장하지만 네트워크 환경이 혼잡할 경우 충돌 발생 확률을 높인다. 이를 해결하기 위해 채널과 네트워크 상태를 고려하여 일정한 주기마다 계산된 충돌 확률로 CWmin 값을 조절하는 CWminAS(CWmin Adaptation Scheme)가 제안되었다. 그러나 이 방식은 AC별 다른 파라미터 값으로 인해 발생되는 각 AC의 충돌 확률을 고려하지 않았다. 이러한 문제를 해결하기 위해 본 논문에서는 AC별 다른 파라미터 값으로 인해 발생되는 각 AC의 충돌 확률을 계산하고, CWmin 값을 조절하는 ACATICT(Adaptive Contention-window Adjustment Technique based on Individual Class Traffic) scheme을 제안한다. 실험 결과 ACATICT가 CWminAS보다 효율이 최대 약 10% 향상되었다.