• 전자공학회논문지S
• /
• 제34S권10호
• /
• pp.89-97
• /
• 1997

To extract time-varying evoked potential (EP), segement latency corrected average method is presented. This method is composed of three steps. First, adaptive filtering for reducing the effect of artifacts and removing background noise is performed. Next, validated intervals of individual segments are aligned, and latency components are detected by cross-correlation between the previously obtained and measured EPs within the intervals. Finally, after the detected latency component, responses of segments are groupe and averaged, the shole corrected EP signal is obtained. In the experiments, the resutls of the conventional methods including simple averaging, Woody's method, and peak component latency corrected averaging are obtained, the results compared with the present method for evaluating performance. Therefore, the presented method confirms that it reflects the latency variations of fundamental peaks and gets the improved EP.

• 수면정신생리
• /
• 제3권1호
• /
• pp.79-84
• /
• 1996

Kleine-Levin syndrome is a disorder characterized by recurrent episodes of hypersomnia, hyperphagia and hypersexuality that typically occur weeks or months apart. A 17-years-old male showed these episodes and took nocturnal polysomnography(NPSG) and multiple sleep latency test(MSLT). As results of NPSG, sleep latency was 82.5min, sleep efficiency was 82.5min, sleep efficiency was 82.5%, latency and percentage of REM sleep were 106.5min and 14.6% and percentage of slow wave sleep was 12.7%. In 4 times MLST, average of sleep latency and REM latency were 8min 7sec and 5min 20sec with 3 times sleep onset REM period(SOREMP). These findings are consistent with these of Keine-Levin syndrome. And the possible causes and classification of this syndrome were discussed.

• 전자공학회논문지S
• /
• 제34S권12호
• /
• pp.60-69
• /
• 1997

We present an average method based on the multirate signal processing and dynamic allocation average for the purpose of monitoring event-related potentials(ERP) and continuously and dynamically. In the proposed method, first, latency shifts are detected through the cross correlation between a current response and the reference response. Then, the multirate signal processing which is composed of up-sampler, lowpass filter, and down sampler is performed to compensate the latency shifts of the reference response, therefore we obtain the reference response with a peak latencies compenated by those of a current response. Finally, the single response is obtained by averaging the compensated reference response and a current response. In the simulation, the results of quantitative evaluation by simulation and the results using linical data are presented. From the result, the proposed method reflects dynamic time-varying ERP more exactly than previous methods and is also effective in consecutive monitoring of ERP.

• Journal of Communications and Networks
• /
• 제6권2호
• /
• pp.147-155
• /
• 2004

In this paper, we propose an efficient sequencing technique, namely minimum Row time scheduling (MFTS), to manage variable-Iength message transmissions for single-hop passive starcoupled WDM optical networks. By considering not only the message length but also the state of the receivers and the tuning latency, the proposed protocol can reduce the average delay of the network greatly. This paper also introduces a new channel assignment technique latency minimizing scheduling (LMS), which aims to reduce the scheduling latency. We evaluate the proposed algorithm, using extensive discrete-event simulations, by comparing its performance with shortest job first (SJF) algorithm. We find that significant improvement in average delay could be achieved by MFTS algorithm. By combining the proposed message sequencing technique with the channel selection technique, the performance of the optical network could be further improved.

• 한국컴퓨터정보학회논문지
• /
• 제24권9호
• /
• pp.1-8
• /
• 2019

In this paper, we propose a performance isolation of shared space for virtualized SSD based storage systems, to solve the weakness in a VSSD framework. The proposed scheme adopts a CFQ scheduler and a shared space-based FTL for the fairness and the performance isolation for multiple users on virtualized SSD based storage systems. Using the CFQ scheduler, we ensure SLOs for the storage systems such as a service time, a allocated space, and a IO latency for users on the virtualized storage systems. In addition, to improve a throughput and reduce a computational latency for garbage collection, a shared space-based FTL is adopted to maintain the information of SLOs for users and it manages shared spaces among the users. In our experiments, the proposal improved the throughput of garbage collection by 7.11%, on average, and reduced the computational latency for garbage collection by 9.63% on average, compared to the previous work.

• 한국컴퓨터정보학회논문지
• /
• 제24권4호
• /
• pp.1-9
• /
• 2019

LRR(Loose Round Robin) warp scheduling policy for GPU architecture results in high warp-level parallelism and balanced loads across multiple warps. However, traditional LRR policy makes multiple warps execute long latency operations at the same time. In cases that no more warps to be issued under long latency, the throughput of GPUs may be degraded significantly. In this paper, we propose a new warp scheduling policy which utilizes latency hiding, leading to more utilized memory resources in high performance GPUs. The proposed warp scheduler prioritizes memory instruction based on GTO(Greedy Then Oldest) policy in order to provide reduced memory stalls. When no warps can execute memory instruction any more, the warp scheduler selects a warp for computation instruction by round robin manner. Furthermore, our proposed technique achieves high performance by using additional information about recently committed warps. According to our experimental results, our proposed technique improves GPU performance by 12.7% and 5.6% over LRR and GTO on average, respectively.

• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제9권3호
• /
• pp.45-58
• /
• 2020

클라우드 서비스와 모바일 기기의 대중화로 네트워크 트래픽이 계속 증가하고 있는 현재 추세에 LAN 대역폭에 비해 WAN 대역폭이 아주 낮다. WAN 환경에서는 전송 프로토콜, 패킷 손실, 네트워크 대역폭 한계 때문에 생기는 성능 문제를 극복하는 WAN 최적화기가 필요하다. 본 논문에서는 오픈소스 WAN 최적화기인 WANProxy의 데이터 중복제거 알고리즘을 분석하고 성능을 네트워크 대기시간 및 WAN 대역폭 관점에서 평가한다. 또한, WANProxy에 추가로 zstd를 적용하는 2단계 압축을 적용할 경우의 성능을 평가한다. 또한, WANProxy의 데이터 중복 제거 방법을 개선한 새로운 방법을 제안하고 성능 개선 효과를 평가한다. 데이터 세그먼트 크기를 2048바이트로 하고 Silesia의 12개 데이터 파일을 이용한 성능 실험을 수행한다. 실험 결과에 의하면, WANProxy에 의한 평균 압축률이 150.6이고 네트워크 대기시간 평균 감소율은 10 Mbps WAN 환경에서는 95.2%, 100 Mbps WAN 환경에서는 60.7%가 된다. WANProxy에 추가로 zstd를 적용하는 방법은 WANProxy를 적용하는 경우와 비교할 때 압축률이 평균 33% 증가하지만 네트워크 대기시간이 10 Mbps WAN 환경에서는 평균 2.1%, 100 Mbps WAN 환경에서는 평균 5.2% 각각 증가한다. 본 논문에서 제안한 개선 방법을 WANProxy에 적용한 경우는 기존의 WANProxy와 비교할 때 압축률이 평균 34.8% 증가하고 네트워크 대기시간이 10 Mbps WAN 환경에서는 평균 13.8%, 100 Mbps WAN 환경에서는 평균 12.9% 각각 감소한다. 성능 분석 결과에 의하면, WAN 대역폭이 10 Mbps 이하인 환경에서 WANProxy를 적용할 경우 네트워크 대기시간과 WAN 대역폭 관점에서 성능 개선 효과가 아주 우수하고 WAN 대역폭이 100 Mbps 환경에서도 우수하다.

• 정보처리학회논문지C
• /
• 제10C권2호
• /
• pp.179-184
• /
• 2003

PIM-DM을 이용하여 멀티캐스트를 하였을 때 그룹에 가입하기 위해서 대기하는 시간이 특정한 시간 영역에서 크게 증가하는 문제점이 있음을 확인하였다. 이는 그룹에서 탈퇴하기 위한 리브 프룬 메시지와 플러딩에 대한 응답으로 발생하는 플러딩 프룬 메시지를 라우터가 구분하지 못하는 것에서 기인한다. 본 논문에서는 이러한 문제점의 원인을 분석하고, 이에 대한 해결방법을 제시하였다. 또한, 이를 이용하여 그룹 가입 지연 시간이 평균 37.4% 감소됨을 네트워크 시뮬레이션을 통해서 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권4호
• /
• pp.1296-1309
• /
• 2023

In this paper, based on the soft cancellation (SCAN) bit-flipping (SCAN-BF) algorithm, a generalized SCAN bit-flipping (GSCAN-BF-Ω) decoding algorithm is carried out, where Ω represents the number of bits flipped or corrected at the same time. GSCAN-BF-Ω algorithm corrects the prior information of the code bits and flips the prior information of the unreliable information bits simultaneously to improve the block error rate (BLER) performance. Then, a joint threshold scheme for the GSCAN-BF-2 decoding algorithm is proposed to reduce the average decoding complexity by considering both the bit channel quality and the reliability of the coded bits. Simulation results show that the GSCAN-BF-Ω decoding algorithm reduces the average decoding latency while getting performance gains compared to the common multiple SCAN bit-flipping decoding algorithm. And the GSCAN-BF-2 decoding algorithm with the joint threshold reduces the average decoding latency further by approximately 50% with only a slight performance loss compared to the GSCAN-BF-2 decoding algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권8호
• /
• pp.3025-3047
• /
• 2021

This paper presents the latest Ethernet standardization of in-vehicle network and the future trends of automotive Ethernet technology. The proposed system provides design and optimization algorithms for automotive networking technology related to AVB (Audio Video Bridge) technology. We present a design of in-vehicle network system as well as the optimization of AVB for automotive. A proposal of Reduced Latency of Machine to Machine (RLMM) plays an outstanding role in reducing the latency among devices. RLMM's approach to real-world experimental cases indicates a reduction in latency of around 41.2%. The setup optimized for the automotive network environment is expected to significantly reduce the time in the development and design process. The results obtained in the study of image transmission latency are trustworthy because average values were collected over a long period of time. It is necessary to analyze a latency between multimedia devices within limited time which will be of considerable benefit to the industry. Furthermore, the proposed reliable camera and video streaming through optimized AVB device settings would provide a high level of support in the real-time comprehension and analysis of images with AI (Artificial Intelligence) algorithms in autonomous driving.