• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.3
• /
• pp.561-566
• /
• 2011

In EPCglobal Class-1 Gen-2 RFID system, a slot-count selection algorithm has been proposed to determine the slot-count size depending on the status of reply slot. In the slot-count selection algorithm of Gen-2, the slot-count value is increased or decreased by the weight C, which is identical and independent of the slot status. It has an advantage that the algorithm is simple, but it is difficult to maintain an optimal slot-count size. Therefore, in this paper, we propose an adaptive slot-count selection algorithm, which applies the parameter C differently based on the result of tag replies. Through simulations, it is demonstrated that the collision rate for the proposed scheme is about 42% and 65% lower than the schemes proposed by Wang and Gen-2. Therefore, the adaptive slot-count selection algorithm achieves faster tag identification time compared with the existing algorithms due to the low collision rate.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.49 no.2
• /
• pp.47-55
• /
• 2012

A discrete-time(DT) filter with high-order temporal moving average(TMA) using actively-weighted charge sampling is proposed in this paper. To obtain different weight of sampled charge, the variable transconductance OTA is used prior to charge sampler, and the ratio of charge can be effectively weighted by switching the control transistors in the OTA. As a result, high-order TMA operation can be possible by actively-weighted charge sampling. In addition, the transconductance generated by the OTA is relatively accurate and stable by using the size ratio of the control transistors. The high-order TMA filter has small size, increased voltage gain, and low parasitic effects due to the small amount of switches and sampling capacitors. It is implemented in the TSMC $0.18-{\mu}m$ CMOS process by TMA-$2^2$. The simulated voltage gain is about 16.7 dB, and P1dB and IIP3 are -32.5 dBm and -23.7 dBm, respectively. DC current consumption is about 9.7 mA.

• Journal of KIISE:Software and Applications
• /
• v.32 no.7
• /
• pp.612-624
• /
• 2005

In this paper, we propose a surface-based registration using a gaussian weighted distance map for PET-CT brain image fusion. Our method is composed of three main steps: the extraction of feature points, the generation of gaussian weighted distance map, and the measure of similarities based on weight. First, we segment head using the inverse region growing and remove noise segmented with head using region growing-based labeling in PET and CT images, respectively. And then, we extract the feature points of the head using sharpening filter. Second, a gaussian weighted distance map is generated from the feature points in CT images. Thus it leads feature points to robustly converge on the optimal location in a large geometrical displacement. Third, weight-based cross-correlation searches for the optimal location using a gaussian weighted distance map of CT images corresponding to the feature points extracted from PET images. In our experiment, we generate software phantom dataset for evaluating accuracy and robustness of our method, and use clinical dataset for computation time and visual inspection. The accuracy test is performed by evaluating root-mean-square-error using arbitrary transformed software phantom dataset. The robustness test is evaluated whether weight-based cross-correlation achieves maximum at optimal location in software phantom dataset with a large geometrical displacement and noise. Experimental results showed that our method gives more accuracy and robust convergence than the conventional surface-based registration.

• Journal of the Korea Computer Graphics Society
• /
• v.29 no.3
• /
• pp.85-92
• /
• 2023

Recently, interest in artificial intelligence has increased due to the development of artificial intelligence fields such as ChatGPT and self-driving cars. However, there are still many unknown elements in training process of artificial intelligence, so that optimizing the model requires more time and effort than it needs. Therefore, there is a need for a tool or methodology that can analyze the weight changes during the training process of artificial intelligence and help out understatnding those changes. In this research, I propose a visualization system which helps people to understand the accumulated weight changes. The system calculates the weights for each training period to accumulates weight changes and stores accumulated weight changes to plot them in 3D space. This research will allow us to explore different aspect of artificial intelligence learning process, such as understanding how the model get trained and providing us an indicator on which hyperparameters should be changed for better performance. These attempts are expected to explore better in artificial intelligence learning process that is still considered as unknown and contribute to the development and application of artificial intelligence models.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10C
• /
• pp.1370-1377
• /
• 2004

Optimal control gain for time-delay systems is made by an optimal control gain for delay-free systems multiplied by a state transition function for the delay time. The optimal control gain for delay-free systems is obtained by pushing two zeros of the PID controller closely to a larger pole of the second order plant. Thus the optimal tuning of PID controller for time-delay second order system is able to be obtained by calculation for the state transition function.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.385-395
• /
• 1999

Video-On-demand system provides electronic video rental services from remote video servers on a broadband communication networks. When we assume some situation that serve the same video stream by batching, each time single video stream became available at server-end side, we face the problem that what video stream to be scheduled at what time instant. Hence, in order to manage the resource bandwidth which is different at each stream, the policy of channel allocation became important factor. In this work, we proposed three type of scheduling policies with queueing, as are cumulative Waiting Time(CWT), Mean Waiting Time(MWT) and Predictable Popular Factor(PPF). While CWT policy is good for popular video, MWT policy was good for non-popular video. Also, we know that PPT policy has some fairness for average wait time and reneging rate of user requests.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.4
• /
• pp.434-439
• /
• 2019

This paper proposed a control algorithm to compensate the delay time to improve the signal to noise, and the proposed control algorithm estimate the target information to apply the continuous wave radar equation. The proposed control algorithm improves the output signal of each array element bv multiplying the weight of the receive signal to the signal to noise ratio. Radar radiate a signal in spatial and the target information is estimated by the echoed signal from the target. But the signal in the wireless communication environment occurs the delay time due to the multipath which appear human and natural structures. It is difficult to accurately estimate the desired information because of the degradation for the system performance due to the interference signal and the signal distortion. The target information can be improved by compensating the delay signal to apply the weight to the received signal by using the uniform linear array antenna. As a simulation result, we show that the performance of the proposed control algorithm and the non-compensated delay time are compared. The proposed control algorithm proved that the target distance estimation information is improved.

• Proceedings of the Acoustical Society of Korea Conference
• /
• autumn
• /
• pp.139-142
• /
• 1999

본 연구는 폐쇄된 임의의 공간상에서 2개의 마이크로폰 어레이를 이용 수신된 2개 신호의 도착 시간차를 계산하여 응원의 방향 각을 추정하는 새로운 알고리듬을 제안한다. 제안된 MSCPSP 알고리듬은 기존의 CPSP 알고리듬을 개선한것으로, 마이크로폰에 수신된 2개의 입력신호에 대해 서브밴드 필터 뱅크를 이용하여 대역 분할하고 각 서브밴드 대역에서 구해지는 신호 대 잡음비(SNH)를 대역별 CPSP 결과에 가중치로 제공한다. 이러한 대역 분할 가중방식은 잡음의 영향을 각 대역으로 한정 분산시켜 보다 정확한 지연 시간 추정을 가능하게 한다. 제안된 알고리듬의 성능을 입증하기 위해 기존의 CPSP와 MSCPSP 알고리듬의 컴퓨터 모의 실험을 수행하였으며, 실험 결과 제안된 MSCPSP의 우수함을 볼 수 있었다.

• Journal of Korea Water Resources Association
• /
• v.41 no.9
• /
• pp.959-967
• /
• 2008

Disaggregation techniques are widely used to transform observed daily rainfall values into hourly ones, which serve as important inputs for flood forecasting purposes. However, an important limitation with most of the existing disaggregation techniques is that they treat the rainfall process as a realization of a stochastic process, thus raising questions on the lack of connection between the structure of the models on one hand and the underlying physics of the rainfall process on the other. The present study introduces a nonlinear deterministic (and specifically chaotic) framework to study the dynamic characteristics of rainfall distributions across different temporal scales (i.e. weights between scales), and thus the possibility of rainfall disaggregation. Rainfall data from the Seoul station (recorded by the Korea Meteorological Administration) are considered for the present investigation, and weights between only successively doubled resolutions (i.e., 24-hr to 12-hr, 12-hr to 6-hr, 6-hr to 3-hr) are analyzed. The correlation dimension method is employed to investigate the presence of chaotic behavior in the time series of weights, and a local approximation technique is employed for rainfall disaggregation. The results indicate the presence of chaotic behavior in the dynamics of weights between the successively doubled scales studied. The modeled (disaggregated) rainfall values are found to be in good agreement with the observed ones in their overall matching (e.g. correlation coefficient and low mean square error). While the general trend (rainfall amount and time of occurrence) is clearly captured, an underestimation of the maximum values are found.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2012.04a
• /
• pp.548-549
• /
• 2012