• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.121-126
• /
• 2009

Video poxy server which is located near clients can store the frequently requested video data in storage space in order to minimize initial latency and network traffic significantly. However, due to the limited storage space in video proxy server, an appropriate deletion algorithm is needed to remove the old video data which is not serviced for a long time. Thus, we propose an efficient video data deletion algorithm for video proxy server. The proposed deletion algorithm removes the video which has the lowest request possibility based on the user access patterns. In our algorithm, we arrange the videos which are stored in video proxy server according to the requested time sequence and then, select the video which has the oldest requested time. The selected video is partially removed in order to free up storage space in video poky server. The simulation results show that the proposed algorithm performs better than other algorithms in terms of the block hit rate and the number of block deletion.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.4
• /
• pp.82-88
• /
• 2009

Video proxy server which is located near clients can store the frequently requested video data in storage space in order to minimize initial latency and network traffic significantly. However, due to the limited storage space in video proxy server, an appropriate video selection method is needed to store the videos which are frequently requested by users. Thus, we present a virtual caching technique to efficiently store the video in video proxy server. For this purpose, we employ a virtual memory in video poky server. If the video is requested by user, it is loaded in virtual memory first and then, delivered to the user. A video which is loaded in virtual memory is deleted or moved into the storage space of video poxy sewer depending on the request condition. In addition, virtual memory is divided into each segment area in order to store the segments efficiently and to avoid the fragmentation. The simulation results show that the proposed method performs better than other methods in terms of the block hit rate and the number of block deletion.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.10
• /
• pp.49-54
• /
• 2007

As digital contents based on 3D graphics are increased, the requirement for low power 3D graphic hardware for mobile devices is increased. We design a transformation engine for mobile 3D graphic processor. We propose a simplified transformation engine for mobile 3D graphic processor. The area of the transformation engine is reduced by merging a mapping transformation unit into a projective transformation unit and by replacing a clipping unit with a selection unit. It consists of a viewing transformation unit a projective transformation unit a divide by w nit, and a selection unit. It can process 32 bit floating point format of the IEEE-754 standard or a reduced 24 bit floating point format. It has a pipelined architecture so that a vertex is processed every 4 cycles except for the initial latency. The RTL code is verified using an FPGA.

• The KIPS Transactions:PartB
• /
• v.12B no.7 s.103
• /
• pp.775-782
• /
• 2005

In this paper, we propose multicast technique in order to reduce the required network bandwidth by n times, by merging the adjacent multicasts depending on the number of HENs (Head-End-Nodes) n that request the same video. Allowing new clients to immediately join an existing multicast through patching improves the efficiency of the multicast and offers services without any initial latency. A client might have to download data through two channels simultaneously, one for multicast and the other for patching. The more the frequency of requesting the video is, the higher the probability of caching it among HENs increases. Therefore, the requests for the cached video data can be served by HENs. Multicast from server is generated when the playback time exceeds the amount of cached video data. Since the interval of multicast can be dynamically expanded according to the popularity of videos, it can be reduced the server's workload and the network bandwidth. We perform simulations to compare its performance with that of conventional multicast. From simulation results, we confirm that the Proposed multicast technique offers substantially better performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.5
• /
• pp.703-717
• /
• 2002

This paper illustrates the implementation of a scalable shared buffer asynchronous transfer mode (ATM) switch. The designed shared buffer ATM switch has a shared buffet of a pipelined memory which has the access time of 4 ns. The high-speed buffer access time supports a possibility of the implementation of a shared buffer ATM switch which has a large switching capacity. The designed switch architecture provides flexible switching performance and port size scalability with the independence of queue address control from buffer memory control. The switch size and the buffer size of the designed ATM switch can be reconfigured without serious circuit redesign. The designed prototype chip has a shared buffer of 128-cell and 4 ${\times}$ 4 switch size. It is integrated in 0.6um, double-metal, and single-poly CMOS technology. It has 80MHz operating frequency and supports 640Mbps per port.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.3
• /
• pp.1-7
• /
• 2021

In this paper, optimized media data retrieval and transmission based on the Hybrid CDN/P2P architecture and selective storage through user's prediction of requestability enable seamless data transfer to users and reduction of unnecessary traffic. We also propose a new media management method to minimize the possibility of transmission delay and packet loss so that media can be utilized in real time. To this end, we construct each media into logical segments, continuously compute weights for each segment, and determine whether to store segment data based on the calculated weights. We also designate scattered computing nodes on the network as local groups by distance and ensure that storage space is efficiently shared and utilized within those groups. Experiments conducted to verify the efficiency of the proposed technique have shown that the proposed method yields a relatively good performance evaluation compared to the existing methods, which can enable both initial latency reduction and seamless transmission.

• Archives of Plastic Surgery
• /
• v.49 no.5
• /
• pp.633-641
• /
• 2022

Introduction In chronic facial palsy, synkinetic muscle overactivity and shortening causes muscle stiffness resulting in reduced movement and functional activity. This article studies the role of multimodal therapy in improving outcomes. Methods Seventy-five facial palsy patients completed facial rehabilitation before being successfully discharged by the facial therapy team. The cohort was divided into four subgroups depending on the time of initial attendance post-onset. The requirement for facial therapy, chemodenervation, or surgery was assessed with East Grinstead Grade of Stiffness (EGGS). Outcomes were measured using the Facial Grading Scale (FGS), Facial Disability Index, House-Brackmann scores, and the Facial Clinimetric Evaluation scale. Results FGS composite scores significantly improved posttherapy (mean-standard deviation, 60.13 ± 23.24 vs. 79.9 ± 13.01; confidence interval, -24.51 to -14.66, p < 0.0001). Analysis of FGS subsets showed that synkinesis also reduced significantly (p < 0.0001). Increasingly, late clinical presentations were associated with patients requiring longer durations of chemodenervation treatment (p < 0.01), more chemodenervation episodes (p < 0.01), increased doses of botulinum toxin (p < 0.001), and having higher EGGS score (p < 0.001). Conclusions This study shows that multimodal facial rehabilitation in the management of facial palsy is effective, even in patients with chronically neglected synkinesis. In terms of the latency periods between facial palsy onset and treatment initiation, patients presenting later than 2 years were still responsive to multimodal treatment albeit to a lesser extent, which we postulate is due to increasing muscle contracture within their facial muscles.

• Korean Journal of Psychosomatic Medicine
• /
• v.27 no.1
• /
• pp.50-59
• /
• 2019

Objectives : Many of the patients with type 2 diabetes are associated with sleep problems, and the rate of insomnia is known to be higher in the general population. The aims of this study were to know the frequency and clnical characteristics of insomnia, and related variables to insomnia in patients diagnosed with type 2 diabetes. Methods : For 99 patients from 18 to 80 years of age (65 males and 34 females) with type 2 diabetes, interviews were performed. Total sleep time and sleep latency was evaluated. Insomnia was evaluated using the Korean Version of the Insomnia Severity Index (ISI-K). Severity of depressive symptoms were evaluted using the Korean version of the Hamilton Depression Scale (K-HDRM). According to the cutoff score of 15.5 on the ISI-K, subjects were divided into the group of type 2 diabetics with insomnia (N=34) and those without insomnia (N=65) at first, and then statistically analyzed. Results : TInsomnia could be found in 34.34% of type 2 diabetics. Type 2 diabetics with insomnia had significantly more single or divorced (respectively 11.8%, p<0.05), higher total scores of the K-HDRS ($11.76{\pm}5.52$, p<0.001), shorter total sleep time ($5.35{\pm}2.00hours$, p<0.001), and longer sleep latency ($50.29{\pm}33.80minutes$, p<0.001). The all item scores of the ISI-K in type 2 diabetics with insomnia were significantly higher than those in type 2 diabetics without insomnia, that is, total ($18.38{\pm}2.69$), A1 (Initial insomnia) ($2.97{\pm}0.76$), A2 (Middle insomnia) ($3.06{\pm}0.69$), A3 (Terminal insomnia) ($2.76{\pm}0.61$), B (Satisfaction) ($3.18{\pm}0.72$), C (Interference) ($2.09{\pm}0.97$), D (Noticeability) ($2.12{\pm}1.09$) and E (Distress) ($2.21{\pm}0.81$) (respectively p<0.001). Variables associated with insomnia in type 2 diabetics were as following. Age had significant negative correlation with A3 items of the ISI-K (${\beta}=-0.241$, p<0.05). Total scores of the K-HDRS had significant positive correlation, while total sleep time had significant negative correlation with all items of the ISI-K (respectively p<0.05). Sleep latency had significant positive correlation with total,, A1, B and E item scores of the ISI-K (respectively p<0.05). Conclusions : Insomnia was found in about 1/3 of type 2 diabetics. According to the presence of insomnia, clinical characteristics including sleep quality as well as quantity seemed to be different. Because depression seemed to be correlated with insomnia, clinicians should pay attention to early detection and intervention of depression among type 2 diabetics.

• 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.

• The korean journal of orthodontics
• /
• v.34 no.2 s.103
• /
• pp.131-142
• /
• 2004

The movement of tooth-bone segments by osteotomy can simultaneously shift tooth and surrounding alveolar bone in a relatively short period. The purpose of this study was to evaluate the tissue changes in pulp, periodontal ligament, and alveolar bone in rapid tooth-bone movement with osteotomy. The mandibular 3rd premolar of a dog was extracted and cortical bones of the buccal and lingual area were eliminated, and then cortical bones around the mesial and distal area of root, and below the root apex of the mandibular 4th premolar were osteotomized. After a one-week latency period, a tooth-borne distraction device was activated for 6 days. And pulp, periodontal ligament and alveolar bone were evaluated clinically, radiologically, histologically and immunohistochemically at 0, 1, 2, 4, 6, 8 weeks of the consolidation Period and conclusions were roached as follows. 1. Latency period didn't affect total amount or tooth movement and healing process of tissue during consolidation period. 2. Bone formation continued through 8 weeks of consolidation in distracted side, with a high peak at 1-2 weeks, and the lowest at 6-8 weeks or consolidation. 3. At 1 week of consolidation, alveolar bone resorption, osteoclast appearance and inflammatory cell infiltration were the most active, and dentinoclasts characteristically appeared on the pulp and pressure side of the periodontal ligament. 4. The expression of $TGF-\beta$ was area-specific, as it was strong-positive at bone matrix, osteoblast osteoclast of alveolar bone, and dentinoclast inside pulp, but weak in pulp, cementoblast and acellular cementum. 5. The expression of $TGF-\beta$ was generally observed at the initial 1-2 weeks of consolidation at vessels, periodontal ligament cells, and osteoblast near alveolar bone on the distraction side of the periodontal ligament, and was significantly decreased after 6 weeks of consolidation.