• The Journal of the Korea Contents Association
• /
• v.10 no.5
• /
• pp.325-332
• /
• 2010

The purpose of this study was to investigate the relationship between three quantitative measures of the pendulum test for spasticity in strokes: The relaxation index, the number of oscillations, and the duration of oscillations. Twenty-six stroke subjects participated in the study. Correlations among these measures of spasticity used Pearson's correlation coefficient. There was a statistically significant positive correlation between the relaxation index and number of oscillations in strokes (r=.881, p<.01). In addition there was significant positive correlation between the relaxation index and duration of oscillations (r=.896, p<.01), and between the number of oscillations and duration of oscillations (r=.938, p<.01). Thus, it is possible to use the number of oscillations and duration of oscillations as quantitative measures of spasticity, rather than the relaxation index, which is more complicated to obtain. According to the result of this study, the use of the simple and objective measurements of the number of oscillations and the duration of oscillations are required clinically in the quantitative measures of spasticity in the future.

• The Journal of the Korea Contents Association
• /
• v.8 no.8
• /
• pp.253-260
• /
• 2008

The research for a 3-axial accelerometer sensor has increased dramatically in the fields of cellular phone, PDA, etc. In this paper, we develop a human walking detection algorithm using 3-axial accelerometer sensor and a user interface system to show the activity expenditure in real-time. To measure a walking number more correctly in a variety of walking activities including walking, walking in place, running, slow walking, we propose a new walking number detection algorithm using adaptive threshold value. In addition, we calculate the activity expenditure base on counted walking number and display calculated activity expenditure on UI in real-time. From the experimental results, we could obtain that the detection rate of proposal algorithm is higher than that of existing algorithm using a fixed threshold value about $5{\sim}10%$. Especially, it could be found out high detection rate in walking in place.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.2
• /
• pp.37-43
• /
• 2008

The performance and hardware complexity of LDPC decoders depend on the design parameters of quantization, the clipping threshold $c_{th}$ and the number of quantization bits q, and also on the maximum number of decoding iterations. In this paper, the BER performances of LDPC codes are evaluated according to the clipping threshold $c_{th}$ and the number of quantization bits q through the simulation studies. By comparing the quantized Min-Sum algorithm with the ideal Min-Sum algorithm, it is shown that the quantized case with $c_{th}=2.5$ and q=6 has the best performance, which approaches the idea case. The decoding complexities are calculated and the word error rates(WER) are estimated by using the pdf which is obtained through the statistical analyses on the iteration numbers. These results can be utilized to tradeoff between the decoding performance and the complexity in LDPC decoder design.

• Journal of Digital Contents Society
• /
• v.14 no.1
• /
• pp.59-64
• /
• 2013

In this paper, we proposed low power algorithm for a task. The task means the inside of a necessary processor and external resources to work accomplishment of a system. Each task analyzes a life time and a number of called for implement a low power circuit. First of all, reduce power consumption of a task have maximum power consumption for low power circuit implementation. Therefore, first selecting a task had maximum power consumption. The task had a maximum power consumption ranking consider a life time and a number of called for each task. While a life time of task is long, top priority ranking to decrease power consumption to the task that the number of call generates the power consumption how a disguise is large in case of a lot of task becomes. Frequency decision to have minimum power consumption, and decrease power consumption all the circuit by a change of frequency of the task which the minimum task that a wasting past record is the maximum becomes. Also, keep continuously minimum power consumption, with every effort task until last life time in opening life time, and decrease gets total power consumption. Experiments results show reduction in the power consumption by 5.43% comparing with that [7] algorithm.

• Journal of the Microelectronics and Packaging Society
• /
• v.16 no.1
• /
• pp.7-11
• /
• 2009

In this study, solder joints were made with Sn-3.5Ag (wt%) solder ball. Electroless nickel / immersion gold (ENIG) printed circuit board (PCB) substrates were employed in this work. The mechanical and electrical properties were measured as a function of the number of reflow. Die shear strength was measured with increasing reflow number. Until the forth or fifth reflow, shear force increased and after the fifth reflow the shear force of die decreased. The electrical resistivity of solder joint linearly increased with increasing reflow number.

• Journal of the Korean Society for information Management
• /
• v.27 no.4
• /
• pp.239-258
• /
• 2010

The purpose of this study is to develop a prediction model of patent citation counts based on major factors which affect patent citation. To this end, we performed multiple regression analysis between the patent citation counts and five explanatory variables such as the number of pages, the number of claims, the reference-average-citation rate, the strength of bibliographic coupling, and the document similarity proved as having 5% or more standardized variances($r^2$) with patent citation counts, with a test dataset of U.S. patents in five subject fields. As a result, our prediction models showed 58.3% to 89.6% predictability depending on subject fields and revealed the document similarity has the highest impact on citation counts among the five predictive variables in all the subject fields. The result of comparison between the predicted citation counts and the actual ones confirmed the usefulness of the citation prediction models built for each subject field.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.9
• /
• pp.617-625
• /
• 2009

NAND flash memory is widely used in embedded systems because of many attractive features, such as small size, light weight, low power consumption and fast access speed. However, it requires garbage collection, which includes erase operations. Erase operation is very slow. Besides, the number of the erase operations allowed to be carried out for each block is limited. The proposed garbage collection method focuses on minimizing the total number of erase operations, the deviation value of each block and the garbage collection time. NAND flash memory consists of pages of three types, such as valid pages, invalid pages and free pages. In order to achieve above goals, we use a page rate to decide when to do garbage collection and to select the target victim block. Additionally, We implement allocating method and group management method. Simulation results show that the proposed policy performs better than Greedy or CAT with the maximum rate at 82% of reduction in the deviation value of erase operation and 75% reduction in garbage collection time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.1
• /
• pp.46-55
• /
• 2007

The Newton-Raphson's algorithm for finding a floating point reciprocal and inverse square root calculates the result by performing a fixed number of multiplications. In this paper, an improved Newton-Raphson's algorithm is proposed, that performs multiplications a variable number. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal and inverse square tables with varying sizes. The superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a reciprocal and inverse square root unit. Also, it can be used to construct optimized approximate tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc.

• Journal of the Korea Convergence Society
• /
• v.10 no.8
• /
• pp.67-73
• /
• 2019

The purpose of this study was to investigate the correlation between obesity and periodontitis by the number of pregnancy using the Korean National Health and Nutrition Examination Survey(2010-2015). Periodontitis measures the community periodontal index, and body mass index was used for the obesity. Socioeconomic variables and health-related behaviors were investigated. Periodontitis and obesity were higher in women with a high pregnancy frequency after controlling for confounding variables. In conclusion, periodontitis is closely related to obesity, and the association is somewhat higher as the number of pregnancies increases. Comprehensive management of obesity and periodontitis is effective in developing health promotion program for women in future, and this data will be used as basic data for development of women's health promotion program.

• Journal of Internet of Things and Convergence
• /
• v.7 no.2
• /
• pp.47-53
• /
• 2021

In order to transmit video data stored in servers with limited bandwidth in IoT environments to many clients, a transmission plan must be established by considering factors such as the number of transmission rate changes, peak transmission rate, and transmission rate changes. This transmission plan is called smoothing, and includes CBA that minimizes the number of transmission rate increases, MCBA that minimizes the number of transmission rate changes, and MVBA to minimize the transmission rate changes. In this work, to evaluate the performance of the proposed algorithm[16], we compare the proposed algorithm with the existing smoothing algorithms with the peak rate, the number of transmission rate changes, the rate increase, the peak rate utilization, and the average transmission rate with various video data and buffer sizes. The evaluation results show that the proposed algorithm helps to efficiently use the server's finite network resources by establishing a transport plan with the lowest average transfer rate.