• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.15 no.5
• /
• pp.3093-3099
• /
• 2014

Modern graphic processors, multimedia processors and audio processors mostly use floating-point number. Meanwhile, high-level language such as C and Java uses both single-precision and double precision floating-point number. In this paper, an algorithm which computes the reciprocal of double precision floating-point number using a 32 bit multiplier is proposed. It divides the mantissa of double precision floating-point number to upper part and lower part, and calculates the reciprocal of the upper part with Goldschmidt's algorithm, and computes the reciprocal of double precision floating-point number with calculated upper part reciprocal as the initial value is proposed. Since the number of multiplications performed by the proposed algorithm is dependent on the mantissa of floating-point number, the average number of multiplications per an operation is derived from some reciprocal tables with varying sizes.

• Journal of Audiology & Otology
• /
• v.25 no.1
• /
• pp.43-48
• /
• 2021

Background and Objectives: Conflicting mechanisms have been reported about spontaneous reversal of positional nystagmus during head-roll maneuver in patients with benign paroxysmal positional vertigo (BPPV). The objective of this study is to review the reports about the characteristics and possible mechanisms of reversing positional nystagmus and to present seven new cases. Subjects and Methods: Seven cases (5 males, 2 females; 4 left-sided, 3 right-sided) were recruited among 732 patients with BPPV seen outpatient clinic between 2009 and 2019. Diagnosis of lateral canal canalolithiasis was confirmed when transient geotropic nystagmus was documented during head-roll test. Reversing positional nystagmus was analyzed in each case and clinical characteristics of the patients were documented. Results: The age of patients was ranging between 30 to 64 years (46.44±10.91). Duration of symptoms was short (21.34±19.74). Six of them had a story of head trauma. Initial latency was short. First, intense geotropic nystagmus was observed following provocative head-roll position on the affected side. There was short "silent phase". Then, a longer second-phase of reversed nystagmus was noted. Total duration of nystagmus was 78.40±6.82 seconds. Maximal slow phase velocity was 24.05±6.34 deg/sec. All patients were cured with barbeque maneuver. Conclusions: Ipsilateral reversing positional nystagmus during head-roll maneuver is due to lateral canal canalolithiasis. Mechanism is likely to be due to endolymphatic double flow. Bilateral cases may be due to simultaneous co-existence of canalolithiasis and cupulolithiasis. Longer recording of nystagmus is recommended not to miss the cases with spontaneous direction-changing positional nystagmus.

• Korean Journal of Audiology
• /
• v.25 no.1
• /
• pp.43-48
• /
• 2021

Background and Objectives: Conflicting mechanisms have been reported about spontaneous reversal of positional nystagmus during head-roll maneuver in patients with benign paroxysmal positional vertigo (BPPV). The objective of this study is to review the reports about the characteristics and possible mechanisms of reversing positional nystagmus and to present seven new cases. Subjects and Methods: Seven cases (5 males, 2 females; 4 left-sided, 3 right-sided) were recruited among 732 patients with BPPV seen outpatient clinic between 2009 and 2019. Diagnosis of lateral canal canalolithiasis was confirmed when transient geotropic nystagmus was documented during head-roll test. Reversing positional nystagmus was analyzed in each case and clinical characteristics of the patients were documented. Results: The age of patients was ranging between 30 to 64 years (46.44±10.91). Duration of symptoms was short (21.34±19.74). Six of them had a story of head trauma. Initial latency was short. First, intense geotropic nystagmus was observed following provocative head-roll position on the affected side. There was short "silent phase". Then, a longer second-phase of reversed nystagmus was noted. Total duration of nystagmus was 78.40±6.82 seconds. Maximal slow phase velocity was 24.05±6.34 deg/sec. All patients were cured with barbeque maneuver. Conclusions: Ipsilateral reversing positional nystagmus during head-roll maneuver is due to lateral canal canalolithiasis. Mechanism is likely to be due to endolymphatic double flow. Bilateral cases may be due to simultaneous co-existence of canalolithiasis and cupulolithiasis. Longer recording of nystagmus is recommended not to miss the cases with spontaneous direction-changing positional nystagmus.

• Journal of Korean Neurosurgical Society
• /
• v.65 no.5
• /
• pp.633-639
• /
• 2022

Accurate diagnosis of trigeminal neuralgia (TN) is the starting point for optimal treatment. Gamma knife radiosurgery (GKRS) is currently regarded as one of the first-line treatment options for medically refractory TN. GKRS is a less invasive treatment with a low risk of complications than other surgical procedures that provides a favorable pain control Barrow Neurological Institute (BNI) I-IIIb rate of >75% at short-term follow-up. Drawbacks of GKRS include the latency period before pain relief and higher recurrence rate compared with microvascular decompression. Therefore, repeat treatment is necessary if the initial GKRS was effective but followed by recurrence. The concept of dose rate and the biologically effective dose of radiation has been actively studied in radiation oncology and is also applied in GKRS for TN to achieve high safety and efficacy by prescribing the optimal dose. Recent progress in functional imaging, such as diffusion tensor imaging, enables us to understand the pathophysiology of TN and predict the clinical outcome after GKRS. Here, we review TN, GKRS, and recent updates, especially in the concepts of radiation dose, diffusion tensor imaging studies, and repeat treatment in GKRS for TN.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.625-634
• /
• 2003

More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7B
• /
• pp.608-618
• /
• 2006

The increasing popularity of multimedia streaming services introduces new challenges in content distribution. Especially, it is important to provide the QoS guarantees as they are increasingly expected to support the multimedia applications. The service providers can improve the performance of multimedia streaming by caching the initial segment (prefix) of the popular streams at proxies near the requesting clients. The proxy can initiate transmission to the client while requesting the remainder of the stream from the server. In this paper, in order to apply the prefix caching service based on IETF's RTSP environment to the wireless networks, we propose the effective RTSP handling scheme that can adapt to the radio situation in wireless network and reduce the cutting phenomenon. Also, we propose the traffic based caching algorithm (TSLRU) to improve the performance of caching proxy. TSLRU classifies the traffic into three types, and improve the performance of caching proxy by reflecting the several elements such as traffic types, recency, frequency, object size when performing the replacement decision. In simulation, TSLRU and RTSP handling scheme performs better than the existing schemes in terms of byte hit rate, hit rate, startup latency, and throughput.

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.413-420
• /
• 2005

The Newton-Raphson iterative algorithm for finding a floating point reciprocal square mot calculates it by performing a fixed number of multiplications. In this paper, a variable latency Newton-Raphson's reciprocal 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 rediprocal square root of a floating point number F, the algorithm repeats the following operations: '$X_{i+1}=\frac{{X_i}(3-e_r-{FX_i}^2)}{2}$, $i\in{0,1,2,{\ldots}n-1}$' with the initial value is '$X_0=\frac{1}{\sqrt{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 28 for the single precision floating point, and 58 for the double precision floating point. Let '$X_i=\frac{1}{\sqrt{F}}{\pm}e_i$, there is '$X_{i+1}=\frac{1}{\sqrt{F}}-e_{i+1}$, where '$e_{i+1}{<}\frac{3{\sqrt{F}}{{e_i}^2}}{2}{\mp}\frac{{Fe_i}^3}{2}+2e_r$'. If '$|\frac{\sqrt{3-e_r-{FX_i}^2}}{2}-1|<2^{\frac{\sqrt{-p}{2}}}$' is true, '$e_{i+1}<8e_r$' is less than the smallest number which is representable by floating point number. So, $X_{i+1}$ is approximate to '$\frac{1}{\sqrt{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 square root tables ($X_0=\frac{1}{\sqrt{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 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 KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.191-198
• /
• 2007

A mobile ad-hoc network (MANET) is an autonomous, infrastructure-less system that consists of mobile nodes. In MANET, on demand routing protocols are usually used because network topology changes frequently. AODV, which is a representative on demand routing protocol, operates using the routing table of each node that includes next hop of a route for forwarding packets. It maintains the established route if there is not an expiration of route or any link break. In the paper, we propose a partially adaptive route maintenance scheme (AODV-PA) based on AODV, which provides dynamic route modification of initial route for selecting the effective route using not only next hop but also next-hop of next-hop (i.e. 2-hop next node) acquired through route discovery process. In addition, the proposed scheme additionally manages the routing table for preventing exceptional link breaks by route modification using HELLO messages. We use NS 2 for the computer simulation and validate that the proposed scheme is better than general AODV in terms of packet delivery ratio, latency, routing overhead.

• Journal of Korean Neurosurgical Society
• /
• v.55 no.6
• /
• pp.370-374
• /
• 2014

To present a case of cauda equina syndrome (CES) caused by chronic inflammatory demyelinating polyneuropathy (CIDP) which seemed clinically similar to Charcot-Marie-Tooth disease type1 (CMT1). CIDP is an immune-mediated polyneuropathy, either progressive or relapsing-remitting. It is a non-hereditary disorder characterized by symmetrical motor and sensory deficits. Rarely, spinal nerve roots can be involved, leading to CES by hypertrophic cauda equina. A 34-year-old man presented with low back pain, radicular pain, bilateral lower-extremity weakness, urinary incontinence, and constipation. He had had musculoskeletal deformities, such as hammertoes and pes cavus, since age 10. Lumbar spine magnetic resonance imaging showed diffuse thickening of the cauda equina. Electrophysiological testing showed increased distal latency, conduction blocks, temporal dispersion, and severe nerve conduction velocity slowing (3 m/s). We were not able to find genetic mutations at the PMP 22, MPZ, PRX, and EGR2 genes. The pathologic findings of the sural nerve biopsy revealed thinly myelinated nerve fibers with Schwann cells proliferation. We performed a decompressive laminectomy, intravenous IgG (IV-IgG) and oral steroid. At 1 week after surgery, most of his symptoms showed marked improvements except foot deformities. There was no relapse or aggravation of disease for 3 years. We diagnosed the case as an early-onset CIDP with cauda equine syndrome, whose initial clinical findings were similar to those of CMT1, and successfully managed with decompressive laminectomy, IV-IgG and oral steroid.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.10
• /
• pp.113-120
• /
• 2010

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 time constraint multiple access technique to efficiently store the video in video proxy server. If the video is requested by user, it is temporarily stored during the predefined interval and then, delivered to the user. A video which is stored is deleted or moved into the storage space of video proxy server depending on the request condition. In addition, we propose a video deletion method in video proxy server for newly stored video data. 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.