• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.3
• /
• pp.470-475
• /
• 2012

In Q-algorithm of EPCglobal Class-1 Gen-2 RFID system, the initial value of $Q_{fp}$, which is the slot-count parameter, is not defined in the standard. And the values of weight C, which is the parameter for incrementing or decrementing the slot-count size, are not determined. Therefore, if the number of tags is small and we let the initial $Q_{fp}$ be large, the number of empty slot will be large. On the other hand, if we let the initial $Q_{fp}$ be small in spite of many tags, almost all the slots will be collided. Also, if the reader selects an inappropriate weight, there are a lot of empty or collided slots. As a result, the performance will be declined because the frame size does not converge to the optimal point quickly during the query round. In this paper, we propose a scheme to allocate the optimal initial $Q_{fp}$ through the tag number estimation and select the weight based on the slot-count size of current query round.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.9
• /
• pp.1165-1171
• /
• 2018

CNN requires a large amount of computation and memory in the process of extracting the feature of the object. Also, It is trained from the network that the user has configured, and because the structure of the network is fixed, it can not be modified during training and it is also difficult to use it in a mobile device with low computing power. To solve these problems, we apply a pruning method to the pre-trained weight file to reduce computation and memory requirements. This method consists of three steps. First, all the weights of the pre-trained network file are retrieved for each layer. Second, take an absolute value for the weight of each layer and obtain the average. After setting the average to a threshold, remove the weight below the threshold. Finally, the network file applied the pruning method is re-trained. We experimented with LeNet-5 and AlexNet, achieved 31x on LeNet-5 and 12x on AlexNet.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3C
• /
• pp.157-162
• /
• 2011

For blind equalization of communication channels, concurrent equalization is useful to improve convergence characteristics. However, the concurrent equalization will result in limited performance enhancement by continuing concurrent adaptation with two algorithms after the equalizer converges to steady-state. In this paper, to improve the convergence characteristics and steady-state performance of the concurrent equalization, proposed is a new concurrent equalization technique with variable step-size parameter and weight-based tap coefficients update. The proposed concurrent vsCMA+DD equalization calculates weight factors using error signals of the variable step-size CMA (vsCMA) and DD (decision-directed) algorithm, and then updates the two equalizers based on the weights respectively. The proposed method, first, improves the error performance of the CMA by the vsCMA, and enhances the steady-state performance as well as the convergence speed further by the weight-based tap coefficients update. The performance improvement by the proposed scheme is verified through simulations.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.43 no.3
• /
• pp.213-223
• /
• 2015

The helicopter initial design model was established by using the latest weight estimation equations based on the Tishchenko's methodology through the study existing initial design tools. The sequential decomposition method is used to reduce analysis time in the sizing. Empirical parameters of the weight estimation equation were also extracted from numerical and regression analysis for a helicopter database. Design input and output values were compared with the RISPECT design tool. Finally, comparison of the re-design resulting for several existing helicopters was presented and showed the good agreement within less than 5% in the weight estimation and main rotor sizing. Established initial design model was proved to be effectively used as initial design tool.

• Journal of Veterinary Clinics
• /
• v.24 no.1
• /
• pp.5-9
• /
• 2007

The purpose of this study was to examine the allometric analysis of roxithromycin using pharmacokinetic data. The pharmacokinetic parameters used were $half-life(t_{1/2})$, mean residence time (MRT), clearance (Cl) and volume of distribution at steady state $(V_{ss})$. Relationships between body weight and the pharmacokinetic parameter were based on the empirical formula $Y=aW^b$, where 'Y' is $t_{1/2}$, MRT, Cl, or $V_{ss}$, W the body weight and 'a' is an allometric coefficient (intercept) that is constant for a given drug. The exponential term, 'b', is a proportionality constant that describes the relationship between the pharmacokinetic parameter of interest and body weight. As results of the allometric analyses, the logarithms of $t_{1/2}$, MRT, Cl, and $V_{ss}$ were linearly related to the logarithms of body weight. Results of the current analyses could provide information on appropriate doses of roxithromycin for all species.

• Journal of The Korean Society of Grassland and Forage Science
• /
• v.11 no.2
• /
• pp.90-96
• /
• 1991

This experiment was carried out in order to estimate the recovery days of root and stubble to the days after cutting, and contribution of specific stubble weight on the regrowth was examined using the relationships between the dry weight of shoot and yield components, and regrowth parameters by the days after cutting. The varieties examined were Maprima, Manhattan, Tove, Peramo, Caliente, Tempo and P-2 grown under individual plant basis. The results are may be summarized as follows: 1. Dry weight of root and stubble were recovered up to 13.5 and 11 days after cutting, respectively. 2. Dry weight of shoot(regrowth parts+stubble) was affected significantly by the varieties, stages of regrowth and variety x stage of regrowth. 3. The variety with tiller weight type showed higher average productivity of shoot than those of the variety with tiller number type. 4. Absolute growth rate(AGR) of shoot was correlated significantly with regrowth parts, stubble, root and weight of a tiller at the early stage of regrowth(up to 12 days after cutting), and correlated with regrowth parts, stubble, weight of tiller and stubble area at the late stage of regrowth(up to 20 days after cutting). 5. Contribution of specific stubble weight to absolute growth rate of shoot was different between the stages of regrowth. Thus, regrowth parts per specific stubble weight(RP1SSbW) and weight of tiller per specific stubble weight(WT1SSbW) contributed to absolute growth rate of shoot at the early stage of regrowth, and efficiency of specific stubble weight(ESSbW), regrowth parts per specific stubble weight (RPISSbW) and weight of a tiller per specific stubble weight(WT1SSbW) contributed to absolute growth rate of shoot at the late stage of regrowth. 6. Regrowth utilization rate(RUR) was one of the useful regrowth parameter to indicate the regrowth potential of grasses.

• East Asian mathematical journal
• /
• v.38 no.1
• /
• pp.33-41
• /
• 2022

In this paper, we study singular Dirichlet boundary value problems involving ϕ-Laplacian. Using fixed point index theory, the existence of positive solutions is established under the assumption that the nonlinearity f = f(u) has a positive falling zero and is either superlinear or sublinear at u = 0.

• East Asian mathematical journal
• /
• v.38 no.5
• /
• pp.593-601
• /
• 2022

In this paper, we consider singular 𝜑-Laplacian problems with nonlocal boundary conditions. Using a fixed point index theorem on a suitable cone, the existence results for one or two positive solutions are established under the assumption that the nonlinearity may not satisfy the L¹-Carathéodory condition.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.3097-3107
• /
• 1999

Recently many studies have been done on the Random Early Detection(RED) algorithm as an active queue management and congestion avoidance scheme in the Internet. In this paper we first overview the characteristics of RED and the modified RED algorithms in order to understand the current status of these studies. Then we analyze the RED dynamics by investigating how RED parameters affect router queue behavior. We show the cases when RED fails since it cannot react to queue state changes aggressively due to the deterministic use of its parameters. Based on the RED parameter analysis, we propose a self-adaptive algorithm to cope with this RED weakness. In this algorithm we make two parameters be adjusted themselves depending on the queue states. One parameter is the maximum probability to drop or mark the packet at the congestion state. This parameter can be adjusted to react the long burst of traffic, consequently reducing the congestion disaster. The other parameter is the queue weight which is also adjusted aggressively in order for the average queue size to catch up with the current queue size when the queue moves from the congestion state to the stable state.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2019.11a
• /
• pp.41-43
• /
• 2019

Image-to-image 변환에서 인상적인 성능을 보이는 StarGAN 은 모델의 성능에 중요한 영향을 끼치는 adversarial weight, classification weight, reconstruction weight 라는 세가지 하이퍼파라미터의 결정을 전제로 하고 있다. 본 연구에서는 이 중 conditional GAN loss 인 adversarial loss 와 classification loss 를 대치할 수 있는 attribute loss를 제안함으로써, adversarial weight와 classification weight 를 최적화하는 데 걸리는 시간을 attribute weight 의 최적화에 걸리는 시간으로 대체하여 하이퍼파라미터 탐색에 걸리는 시간을 획기적으로 줄일 수 있게 하였다. 제안하는 attribute loss 는 각 특징당 GAN 을 만들 때 각 GAN 의 loss 의 합으로, 이 GAN 들은 hidden layer 를 공유하기 때문에 연산량의 증가를 거의 가져오지 않는다. 또한 reconstruction loss 를 단순화시켜 연산량을 줄인 simplified content loss 를 제안한다. StarGAN 의 reconstruction loss 는 generator 를 2 번 통과하지만 simplified content loss 는 1 번만 통과하기 때문에 연산량이 줄어든다. 또한 이미지 Framing 을 통해 배경의 왜곡을 방지하고, 양방향 성장을 통해 학습 속도를 향상시킨 아키텍쳐를 제안한다.