• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.05a
• /
• pp.158-160
• /
• 2022

Many office workers spend a lot of time performing repetitive office tasks in inefficient ways. We developed a user-friendly chatbot system based on Kakaotalk to automate repetitive tasks and used the chatbot in the real workplace. In the process of operating the chatbot, if several people use the chatbot at the same time, the server was down or could not respond. To address these issues, we performed code migration of programs used by chatbot back-end servers and tried several ways to improve server performance such as database redesign and load balancing. To determine how much each method affects performance improvement, we measured total request per second and average latency. After that, we proposed ways to improve the problems of using the chatbot in the work environment.

• Research in Community and Public Health Nursing
• /
• v.33 no.4
• /
• pp.396-407
• /
• 2022

Purpose: The purpose of this study was to assess insomnia and the quality of sleep, investigate the concordance between objective and self-report sleep patterns, and identify physiological, psychological, and situational factors influencing insomnia and sleep quality among firefighters. Methods: A descriptive, cross-sectional study was conducted with 103 firefighters in Korea. The collected data were analyzed using SPSS 23.0. Descriptive statistics, the independent t-test, and hierarchical logistic regression analysis were performed. Results: Insomnia was found in 66 (64.1 %) of the total subjects, and the average quality of sleep (PSQI) was 5.65 (SD=2.57). Total sleep time (401.00 minutes) and sleep latency (21.60 minutes) measured using self-reported scales were longer than the ones measured using objective measurements by approximately 48.70 and 17.10 minutes, respectively. Factors related to insomnia included the role as a paramedic (OR=4.28, 95% CI: 1.02~17.92), anxiety (OR=1.12, 95% CI: 1.01~1.24), and sedentary lifestyle (OR=0.85, 95% CI: 0.78~0.94), and factors related to sleep quality were physical illness status (OR=5.17, 95% CI: 1.53~17.51) and social support (OR=0.86, 95% CI: 0.78~0.95). Conclusion: The results show a high prevalence of insomnia, poor quality of sleep and the discrepancy between objective and subjective sleep patterns among firefighters. To promote sleep quality and health, early screening and treatment of anxiety and physical illness are required. It is necessary to conduct further studies examining the relationship between physical activity level and sleep.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.188-198
• /
• 2005

The Goldschmidt iterative algorithm for finding a floating point square root calculated it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's square root algorithm is proposed, that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the square root of a floating point number F, the algorithm repeats the following operations: $R_i=\frac{3-e_r-X_i}{2},\;X_{i+1}=X_i{\times}R^2_i,\;Y_{i+1}=Y_i{\times}R_i,\;i{\in}\{{0,1,2,{\ldots},n-1} }}'$with the initial value is $'\;X_0=Y_0=T^2{\times}F,\;T=\frac{1}{\sqrt {F}}+e_t\;'$. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than $'e_r=2^{-p}'$. The value of p is 28 for the single precision floating point, and 58 for the doubel precision floating point. Let $'X_i=1{\pm}e_i'$, there is $'\;X_{i+1}=1-e_{i+1},\;where\;'\;e_{i+1}<\frac{3e^2_i}{4}{\mp}\frac{e^3_i}{4}+4e_{r}'$. If '|X_i-1|<2^{\frac{-p+2}{2}}\;'$ is true, $'\;e_{i+1}<8e_r\;'$ is less than the smallest number which is representable by floating point number. So, $\sqrt{F}$ is approximate to $'\;\frac{Y_{i+1}}{T}\;'$. 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 square root tables ($T=\frac{1}{\sqrt{F}}+e_i$) 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 square root unit. Also, it can be used to construct optimized approximate reciprocal square root 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 Institute of Information and Communication Engineering
• /
• v.9 no.2
• /
• pp.380-389
• /
• 2005

The Goldschmidt iterative algorithm for a floating point divide calculates it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's divide algorithm is proposed, that performs multiplications a variable number of times until the error becomes smaller than a given value. To calculate a floating point divide '$\frac{N}{F}$', multifly '$T=\frac{1}{F}+e_t$' to the denominator and the nominator, then it becomes ’$\frac{TN}{TF}=\frac{N_0}{F_0}$'. And the algorithm repeats the following operations: ’$R_i=(2-e_r-F_i),\;N_{i+1}=N_i{\ast}R_i,\;F_{i+1}=F_i{\ast}R_i$, i$\in${0,1,...n-1}'. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than ‘$e_r=2^{-p}$'. The value of p is 29 for the single precision floating point, and 59 for the double precision floating point. Let ’$F_i=1+e_i$', there is $F_{i+1}=1-e_{i+1},\;e_{i+1}',\;where\;e_{i+1}, If '$[F_i-1]<2^{\frac{-p+3}{2}}$ is true, ’$e_{i+1}<16e_r$' is less than the smallest number which is representable by floating point number. So, ‘$N_{i+1}$ is approximate to ‘$\frac{N}{F}$'. 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 tables ($T=\frac{1}{F}+e_t$) with varying sizes. 1'he 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 divider. Also, it can be used to construct optimized approximate reciprocal 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

• The Journal of the Korean bone and joint tumor society
• /
• v.3 no.2
• /
• pp.80-88
• /
• 1997

Malignant tumors of extremeties involving major neurovascular structures have been treated by amputation. However recent development of diagnostic tools(CT, MRI etc.), surgical techniques, anticancer chemotherapeutic agents, and radiation techniques allow surgeons to treat malignant tumors in the limb without amputation. It has been reported that a local application of low-heat to the tissue with tumor can kill tumor cells. It is, however, not known if the attendant neural and vascular injuries may be recovered. The present study was, therefore, undertakn to address this question in rabbit sciatic nerves. A low-heat injury to the sciatic nerve was induced by perfusing the nerve with $60^{\circ}C$ saline for 30 minutes and the courses of functional and morphological recovery of the nerve were evaluated for 16 weeks. The results are summerized as follows : 1. In the electromyographic nerve conduction test the average amplitude was markedly attenuated at 4 and 8 weeks after the low-heat treatment, but it progressively increased to the level 89.5% of the control at 16 week post-treatment. The average latency in the control group was 0.62 msec. The latency in the experimental group was much longer than this at 4 and 8 week post-treatment, but it progressively reverted to the control level, showing 0.622 msec at 16 weeks. 2. In the needle EMG, many fibrillation potentials and positive sharp waves were appeared until 8 weeks post-treatment. After 16 weeks, however, no fibrillation potential was observed. 3. In the early phase of post-treatment period, the myelinated nerve fibers contained many vacuoles and the number of myelinated nerve fibers appeared to be considerably reduced. However, as time goes myelinated nerve fibers were regenerated, such that after 16 weeks the histologic appearance of the nerve was similar to that of the control group.

• Sleep Medicine and Psychophysiology
• /
• v.19 no.2
• /
• pp.77-83
• /
• 2012

Objectives: Recent studies have reported a correlation between obstructive sleep apnea syndrome (OSA) and depression. In attempt to verify the suggestion that eveningness is related to depression, we examined the effect of morningness-eveningness on their depressive mood in patinets with OSA. Methods: The examination was based on the medical records and polysomnography reports of 211 OSA patients. Information was gathered from the patients who filled out the H$\ddot{o}$rne and Ostberg questionnaire (HOQ), profile of mood states-Korean version (K-POMS), and Epworth sleepiness scale (ESS). We compared mean values of K-POMS total, subscales of K-POMS, ESS, and OSA severity variables among the 3 morningness-eveningness groups (morningness, eveningness, and neither groups). Partial correlation analysis was performed between variables and ANCOVA was performed among the 3 groups after adjustment with age and weight. Results: There were significant negative correlations between HOQ and the followings : K-POMS total, POMS-T (tension-anxiety), POMS-D (depression-dejection), POMS-A (anger-hostility), POMS-F (fatigue-inertia), POMS-C (confusion-bewilderment), spontaneous arousal index, average O2 saturation. There were significant positive correlations between HOQ and the followings : POMS-V (vigor-activity), apnea-hypopnea index, respiratory arousal index, snore time. There were significant negative correlations between POMS-D and the followings : HOQ, POMS-V, stage 1 sleep (%), AHI, TAI (total arousal index), oxygen desaturation index, respiratory arousal index, neck circumference, average O2 desaturation, snore time (%). There were significant positive correlations between POMS-D and K-POMS total, POMS-T, POMS-A, POMS-F, POMS-C, sleep latency, stage 2 sleep (%), heart rate, spontaneous arousal index. There were significant differences in K-POMS total, POMS-T, POMS-D, POMS-F, POMS-C, spontaneous arousal index among the three HOQ groups in ANCOVA. Conclusion: The depressive correlates of OSA patients might be affected, not by excessive daytime sleepiness or OSA severity indexes, but by eveningness circadian characteristics. It would be important to take into account the morningness-eveningness tendency when we manage the depressive mood of OSA patients.

• The KIPS Transactions:PartA
• /
• v.12A no.2 s.92
• /
• pp.95-102
• /
• 2005

The Newton-Raphson iterative algorithm for finding a floating point reciprocal which is widely used for a floating point division, calculates the reciprocal by performing a fixed number of multiplications. In this paper, a variable latency Newton-Raphson's reciprocal algorithm is proposed that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the reciprocal of a floating point number F, the algorithm repeats the following operations: '$'X_{i+1}=X=X_i*(2-e_r-F*X_i),\;i\in\{0,\;1,\;2,...n-1\}'$ with the initial value $'X_0=\frac{1}{F}{\pm}e_0'$. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than $'e_r=2^{-p}'$. The value of p is 27 for the single precision floating point, and 57 for the double precision floating point. Let $'X_i=\frac{1}{F}+e_i{'}$, these is $'X_{i+1}=\frac{1}{F}-e_{i+1},\;where\;{'}e_{i+1}, is less than the smallest number which is representable by floating point number. So, $X_{i+1}$ is approximate to $'\frac{1}{F}{'}$. 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 tables $(X_0=\frac{1}{F}{\pm}e_0)$ 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 unit. Also, it can be used to construct optimized approximate reciprocal 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 Digital Convergence
• /
• v.13 no.11
• /
• pp.149-156
• /
• 2015

Due to a change of food culture, many patients suffering from various diseases such as hypertension, heart disease, stroke, cancer. However, it takes a long time in the hospital for many patients due to the administration before the patient care process. In this paper, we propose a m-Healthcare service model that patients can receive medical services without the inconvenience offers by reducing the administrative hospital treatment that can automatically recognize through the hospital installed RFID readers when the patient patients with various diseases are foreign to the hospital. In particular, the proposed model improves the operational efficiency of the existing healthcare system by shortening the treatment time for medical personnel to help patients in emergency situations can determine automatically the patient's status does not give the disease type and condition of the patient to health care personnel. Test results, service latency, efficiency, etc. patient satisfaction, and evaluate the existing health care system model results, the proposed method was improved service delay existing techniques average 16.5% efficiency was higher 27% of patients service satisfaction was improved by 22.4% on average.

• The KIPS Transactions:PartB
• /
• v.9B no.6
• /
• pp.835-844
• /
• 2002

The number of channels available to a video server is limited since the number of channels a video server can support is determined by its communication bandwidth. Several approaches such as batching, piggybacking and patching have been proposed to reduce I/O demand on the video server by sharing multicast data. Patching has been shown to be efficient in the matter of the cost for VOD systems. Unlike conventional multicast techniques, patching is a dynamic multicast scheme which enables a new request to join an ongoing multicast. In addition, true VOD can be achieved since a new request can be served immediately without having to wait for the next multicast. In this paper. we propose two types of channel reservation patching algorithm : a fixed channel reservation patching and a variable channel reservation patching. To immediately schedule the requests for popular videos, these algorithms reserve the channels of video server for the fixed number of popular videos or for the variable number of popular videos which is determined dynamically according to the load of video server. The performance of the proposed algorithms is evaluated through simulations, and compared with that of simple patching. Our performance measures are average defection rate, average latency, service fairness and the amount of buffered data according to video server loads. Simulation results show that the proposed channel reservation patching algorithms provide better performance compared to simple patching algorithm.

• KIISE Transactions on Computing Practices
• /
• v.23 no.9
• /
• pp.517-534
• /
• 2017

This paper proposes an Internet of Things (IoT) middleware called Middleware for Cooperative Interaction of Things (MinT). MinT supports a fully distributed IoT environment in which IoT devices directly connect to peripheral devices, easily constructing a local or global network and sharing their data in an energy efficient manner. MinT provides a sensor abstract layer, a system layer and an interaction layer. These layers enable integrated sensing device operations, efficient resource management, and interconnection between peripheral IoT devices. In addition, MinT provides a high-level API, allowing easy development of IoT devices by developers. We aim to enhance the energy efficiency and performance of IoT devices through the performance improvements offered by MinT resource management and request processing. The experimental results show that the average request rate increased by 25% compared to existing middlewares, average response times decreased by 90% when resource management was used, and power consumption decreased by up to 68%. Finally, the proposed platform can reduce the latency and power consumption of IoT devices.