• Proceedings of the Korean Society of Computer Information Conference
• /
• 2024.01a
• /
• pp.153-155
• /
• 2024

본 논문은 진접선 개통 이후 급증하는 서울 지하철 4호선의 혼잡 문제와 현재 진행 중인 장애인 차별 반대 시위를 다룬다. 네이버의 지도 API를 활용해 위도와 경도 데이터를 추출하고 지하철 노선별 장애인 승객 수와 최대 지연시간을 시각화한다. 2호선과 4호선의 혼잡도가 표시되어 문제의 심각성을 알 수 있다. 평균 출퇴근 시간 탑승 및 하차 수치를 분석하여 4호선 편의시설 개선, 2·4호선 열차 운행 횟수 늘리기, 환승역 운영 최적화 등 전략적 권장 사항을 제시한다. 제안된 대책은 서울시 지하철 시스템의 접근성 향상, 혼잡완화, 전반적인 효율성 제고를 통해 보다 폭넓은 교통시설 개선과 승객 편의 증진에 기여하는 것을 목표로 하고 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.18-20
• /
• 1999

대용량 데이터의 실시간 처리를 요구하는 멀티미디어 시대에 고성능 입출력을 제공할 수 있는 저장 시스템으로서 디스크 어레이가 보편적으로 사용되고 있다. 비용 효율적인 디스크 어레이가 설계될 수 있도록 디스크 어레이의 성능을 분석할 수 있는 성능 모델의 개발은 중요하다. 큐잉 모델링을 통해서 성능 평가를 할 수 있는 방법으로는 큐잉 이론이나 시뮬레이션을 이용할 수 있다. 디스크 어레이의 병렬 및 병행 처리 특성상 큐잉 이론의 분석적인 방법의 한계성을 인식하고, 본 논문에서는 낮은 수준에서 디스크 어레이 시스템을 추상화한 시뮬레이션 기법을 이요하여 디스크 어레이의 성능 평가를 수행한다. 시뮬레이션을 통해서 산출된 디스크 어레이 요구에 대한 평균 응답 시간, 평균 큐잉 지연, 평균 서비스 시간, 평균 길이 및 디스크 어레이 시스템의 이용률, 처리율 등은 최적화된 디스크 어레이 설계를 위한 시스템의 용량 산정에 활용될 수 있다.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.3
• /
• pp.16-24
• /
• 1994

A single channel adaptive noise canceling (ANC) technique is presented for removing effects of additive noise on the speech signal. The conventional method obtains a reference signal using the pitch estimated on a frame basis from the input speech. The proposed method, however, gets the reference signal using the delay estimated recursively on a sample by sample basis. To estimate the delay, we derive recursion formula of autocorrelation function and average magnitude difference function. The performance of the proposed method is evaluated for the speech signals distorted by the additive white Gaussian noise. Experimental results with normalized least mean square (NLMS) adaptive algorithm demonstrate that the proposed method improves the perceived speech quality quite well besides the signal-to-noise ratio.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.2
• /
• pp.137-145
• /
• 1986

The contention resolution algorithm with the limited packet delay time as well stable distribution as the packet delay time is proposed and implementes for improving the mean packet delay time in the network employing CSMA/CD as the access method. The implementation of node controller is based on IEEE 802.2 standard logical link control(LLC) and IEEE 802.3 standard medium access control(MAC). Some portion of IEEE 802.3 Standard MAC, and the Binary Exponential Back-off(BEB) algorithm is replaced by the proposed algorithm. From the view of normalized mean packet transmission delay time, the controller implemented here can be applicable to the office-automation system, and the factory-and laboratory-automation environment where the limited time criterion is very significant.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1C
• /
• pp.67-77
• /
• 2007

Virus throttling technique, one of many early worm detection techniques, detects Internet worm propagation by limiting connect requests within a certain ratio. The typical virus throttling controls the period of rate limiter autonomically by utilizing weighted average delay queue length to reduce connection delay time without hanving a large effect on worm detection time. In the existing virus throttling research, a minimum period of variable rate limiter is fired and a turning point which is a point that the period of rate limiter has been being decreased and starts to be increased is also fixed. However, these two performance factors have different effects on worm detection time and connection delay. In this paper, we analyze the effect of minimum period and turning point of variable rate limiter, and then propose an algorithm which determines values of performance factors by referencing current traffic pattern. Through deep experiments, it is verified that the proposed technique is more efficient in respect of reducing worm detection time and connection delay than the existing virus throttling which fixed the performance factors.

• Journal of KIISE:Software and Applications
• /
• v.29 no.12
• /
• pp.957-965
• /
• 2002

Garbage collection in the CLDC typically employs a stop-the-world GC algorithm which is performing a complete garbage collection when needed. This technique is unsuitable for the interactive Java embedded system because this can lead to long and unpredictable delays. In this paper, We present a garbage collection algorithm which reduces the average delay time and supports the interactive environment. Our garbage collector is composed of the allocator and the collector. The allocator determines the allocation position of free-list according to object size, and the collector uses an incremental mark-sweep algorithm. The garbage collector is called periodically by the thread scheduling policy and the allocator allocates the objects of marked state during collection cycle. Also, we introduce a color toggle mechanism that changes the meaning of the bit patterns at the end of the collection cycle. We compared the performance of our implementation with stop-the-world mark-sweep GC. The experimental results show that our algorithm reduces the average delay time and that it provides uniformly low response times.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.17-27
• /
• 2012

Broadcast-based data dissemination has become a widely accepted approach of communication in the mobile computing environment. However, with a large set of data items, the expected delay of receiving a desired data increases due to the sequential nature of the broadcast channel. This paper explores the issue of designing proper data allocation on multiple broadcast channels to reduce this wait time, and proposes a new data allocation scheme named near optimal data allocation(NODA). The proposed scheme first partitions all data items in K group based on the theoretical lower-bound of the average expected delay to determine data items which each broadcast channel has to broadcast. Then, NODA further partitions each group of data items in B groups using extended dynamic programming algorithm to broadcast data items allocated on the same broadcast channel in different frequencies. The proposed scheme is capable of minimizing the average expected delay time since it can broadcast data items allocated on the same channel reflecting their popularities.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.3
• /
• pp.28-36
• /
• 1995

In this paper, a double loop control model using leaky delay LMS algorithm are proposed for active noise control. The proposed double loop control model estimates the loudspeaker characteristic and the error path transfer function with on-line using only gain and acoustic time delay to reduce computation burden. The control of error signal through double loop control scheme makes the more robust cntrol system. The input signal of filter to estimate acoustic time delay is used difference between input signal of input microphone and adaptive filter output. And also, in nonstationary environments, the leaky delay LMS algorithm is employed to counteract parameter drift of delay LMS algorithm. For practical noise signal, the proposed double loop control model reduces noise level about 12.9 dB.

• Journal of the Korean Society of Radiology
• /
• v.10 no.1
• /
• pp.29-37
• /
• 2016

This study aims to improve the satisfaction level of the patient who undergoes CT contrast examination by developing and applying pretreatment process system, which not only can reduce the side effects caused by the test but also can help carry out the test smoothly. The subjects were 214 patients who booked CT contrast examination from January 2014 to February 2014 but could not carry out their test on schedule. We analyzed the reasons for the delay and conducted follow-up survey on them. We analyzed the usefulness of pretreatment process system by contemplating and developing pretreatment process system and applying it to the patients for whom follow-up survey was conducted from January 2015 to February 2015. The number of outpatients who came to the hospital form January to February 2014 was 2,846 and the number of patients who could not undergo the test was 214, accounting for 7.52% of the total. The specific reason for the delay includes 214 cases of unknown creatinine 98 with 120 minutes of average delay time, 40 cases of creatinine over 1.3(19%) with 30minutes of average delay time, 34 cases of past contrast media side effect 6% with 40 minutes of average delay time and 25 cases of lack of pretreatment such as fasting, etc. 11% with 120minutes of average delay time. The number of CT scan has been increasing ever since the development of CT and the frequency of using the contrast media is expected to increase. If we can employ pretreatment process system in order to effectively control the side effect of contrast media and help the CT contrast examination to be smoothly conducted on schedule, I'm sure we could improve the quality of our medical service and increase our patients' satisfaction who come to our CT scan room.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.136-138
• /
• 2002

지연 차등화 모델은 각 클래스의 지연 차별 변수에 따라 차등화된 서비스를 제공한다. 따라서 각 클래스의 패킷별 평균 대기시간이 지연 차별 변수에 비례한다. 유선 환경의 지연 차등화 모델인 WTP를 무선 환경에 적용시킨 WWTP는 큐의 처음 패킷의 블록으로 인한 큐의 전송 중단 현상을 개선하였다. 이로 인해 클래스별 서비스 불공평성이 줄어든다. 그러나 여전히 채널 오류기간에 비례하여 전송의 편중과 중단현상이 발생하는 단점이 있다.본 논문은 WWTP에서 발생하는 서비스 편중과 중단 현상을 개선하기 위한 보상 정책을 제안하는 스케쥴러를 제안한다. 제안된 모델은 에러 기간동안 에러 프리 서비스를 가상적으로시뮬레이션하여 정상 서비스와의 차이를 알아내고 이를 바탕으로 보상 정책을 수행한다. 결과적으로 지연 차등화 모델인 WWTP에서 발생하는 서비스 중단을 개선하면서 정상적인 채널상태와 유사한 서비스를 제공한다.