• Journal of the Korea Convergence Society
• /
• v.10 no.12
• /
• pp.23-28
• /
• 2019

Cloud services are services developed to serve a wider variety of users in different fields. However, although cloud services are designed to reflect the needs of different users, a variety of security damages resulting from them are increasing and technologies are needed to address them. This paper proposes a user signature management model that prevents third parties from exploiting the user's signature in a heterogeneous cloud The proposed model strengthens the functionality of the intermediate devices that make up the hierarchical cloud while also managing the signature information of the partitioned user. As a result of the performance assessment, the proposed model not only distributed user signature management, but also improved efficiency by 8.5% on average because intermediate devices distributed user signature processing, and reduced the user's signature latency by 13.3% on average when performing user authentication processing. On average, the overhead generated by intermediate devices processing a user's signature was 10.1 percent lower than that of conventional techniques.

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

• Maxillofacial Plastic and Reconstructive Surgery
• /
• v.28 no.4
• /
• pp.329-338
• /
• 2006

Objectives: Distraction osteogenesis has recently evolved a challenging technique to overcome the limitations of conventional augmentation procedures. The aim of this report was to evaluate the clinical result of alveolar distraction osteogenesis for implant installation. Methods: Twenty five patients with alveolar ridge deficiencies were treated with vertical alveolar distraction osteogenesis by intraoral device (total 27 devices: 25 extraosseous and 2 intraosseous devices). After the latency periods of 5-7 days, activation of the device was started. The distraction rhythm and rate was 0.75-1.0 mm a day with 2 or 3 times a day. After 3-4 months, dental implants were placed with removing the distractor simultaneously. Results: On average, a vertical gain of $9.8{\pm}3.4\;mm$ was obtained by distraction osteogenesis. Total 84 implants were installed. Average follow up period was $13.5{\pm}7.5$ months. No implant was removed during the follow up period. Three patients showed infection during the distraction osteogenesis. Three devices were broken and 2 devices among them were replaced with new one. Conclusion: Relatively larger amount of alveolar bone augmentation could be obtained with distraction osteogenesis. For the ideal anatomically and functionally ideal regeneration of alveolar bone to install dental implant, the complication of distraction should be controlled.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.6
• /
• pp.451-462
• /
• 2009

Recently, there are many active studies to enhance low I/O performance of hard disk device. The studies on the hardware make good progress whereas those of the system software to enhance I/O performance may not support the hardware performance due to its poor progress. In this paper, we propose a new method of prefetching n-blocks into the flash memory. The proposed method consists of three steps: (1)analyzing the pattern of read requests in block units; (2)determining the number of blocks prefetched to flash memory; (3)replacing blocks according to block replacement policy. The proposed method can reduce the latency time of hard disk and optimize the power consumption of the computer system. Experimental results show that the proposed dynamic n-block method provides better average response time than that of the existing AMP(Adaptive multi stream prefetching) method by 9.05% and reduces the average power consumption than that of the existing AMP method by 11.11%.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.6
• /
• pp.571-576
• /
• 2013

Despite the development of the Internet, both in terms of technology and coverage, there are still remote areas and scenarios where connectivity is very difficult to achieve. Pocket Switched Network is a network paradigm that takes the advantage of human mobility to disseminate data. Factors such as mobility of nodes, link failures, discharged batteries, are among the challenges that may compromise connectivity in these networks. This paper presents a performance analysis of existing routing schemes for PSN in terms of delivery probability, overhead ratio, average latency and average residual energy when the number of nodes is increased. We seek to identify a scheme that maximizes data delivery while minimizing communication overhead and thus extending the network lifetime.

• Physical Therapy Korea
• /
• v.9 no.2
• /
• pp.1-17
• /
• 2002

The purpose of this study was to identify the differences of the static and the dynamic balance reactions in the flexion syndrome (FS) and the extension syndrome (ES) group of the patients with chronic lowback pain (LBP) and healthy subjects. Twenty subjects were included in each group. By using EquiTest 5.02, the static balance was measured by the equilibrium score and the strategy score of sensory organization test (SOT), while the dynamic balance was measured by the latency of motor control test (MCT) and the sway energy of adaptation test (ADT). Oswestry Disability Index (OSI) was used to measure level of the disability in patients with chronic LBP. The equilibrium scores, the strategies of SOT, and thelatencies of MCT of three groups were compared with one way ANOVA, while the sway energy of ADT was compared with repeated measures one way ANOVA. The results of this study showed that the equilibrium scores and the strategy scores of SOT were significantly lower in patients with chronic LBP than in healthy subjects. The equilibrium scores and the strategy scores of SOT were significantly differences between the FS and ES groups in condition 5 (support surface was sway-referenced and visual information waseliminated by eye closure), and 6 (support surface was sway-referenced and visual information was altered by sway-referencing). The FS group showed delayed average reaction time at large posterior translation, however, the ES group showed delayed average reaction time at large anterior translation, Even though the sway energy of the patients with chronic LBP were greater than that of healthy subjects during the toe down (plantar flexion rotation), the values between the FS and ES groups didn't show any significant difference. The disability level showed highly correlation with the equilibrium score of the condition 5. As the results, the FS and ES groups divided by the their symptoms and signs in patients with chronic LBP showed different balance reaction. Therefore, more accurate evaluation and balance treatments are needed to focus on their symptoms and signs in patients with chronic LBP.

• Journal of Korea Multimedia Society
• /
• v.10 no.9
• /
• pp.1165-1174
• /
• 2007

Mobile ad hoc networks suffer from the re-construction of the routing path as a node on the path moves away and/or fails. In this paper we propose a multipath routing scheme, designed for the network based on the directional antennas, in which a new path is quickly recovered by do-touring to an alternative neighbor called braid. Simulations are conducted in random networks with 50 nodes uniformly deployed in a $1,000m{\times}1,000M$ area where, all nodes have a transmission range of 250m and the average node moving speed varies from 0 to 10m/s. The proposed approach under the ideal antenna with K(>1) directional sectors achieves better results compared with the case of K=1, the omnidirectional antenna model, in terms of the metrics: packet delivery ratio and average number of hops for the routing paths. As further study, a scheme to alleviate the heavy amount of latency accompanied by the rout setup is urgently required.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.8
• /
• pp.1-10
• /
• 2023

Recently, NAND flash memories have replaced magnetic disks due to non-volatility, high capacity and high resistance, in various computer systems but it has disadvantages which are the limited lifespan and imbalanced operation latency. Therefore, many page replacement policies have been studied to overcome the disadvantages of NAND flash memories. Although it is clear that these policies reflect execution characteristics of various environments and applications, researches on the foundation-policy decision for disk buffer management are insufficient. Thus, in this paper, we propose a foundation-policy recommendation model, called FRM for effectively utilizing NAND flash memories. FRM proposes a suitable page replacement policy by classifying and analyzing characteristics of workloads through machine learning. As an implementation case, we introduce FRM with a disk buffer management policy and in experiment results, prediction accuracy and weighted average of FRM shows 92.85% and 88.97%, by training dataset and validation dataset for foundation disk buffer management policy, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11B
• /
• pp.945-952
• /
• 2006

In hierarchical mobile IPv6 networks, when an inter-domain handover occurs, mobile nodes suffer from excessive signaling traffic and long handover latency, resulting in possible disruption of ongoing connections. Further, the selection of MAP and its load status critically affect the overall system performance. Therefore, we propose a dynamic MAP selection scheme that seeks to distribute load among MAPs as well as reduces inter-domain handovers. Performance is evaluated from not only an analytic model of average signaling cost but also simulation. The analytical and simulation results show that our proposed scheme improves load distributedness and reduces inter-domain handovers and signaling cost compared to another existing IETF based approach.

• ETRI Journal
• /
• v.29 no.3
• /
• pp.270-280
• /
• 2007

In Linux, real-time tasks are supported by separating real-time task priorities from non-real-time task priorities. However, this separation of priority ranges may not be effective when real-time tasks make the system calls that are taken care of by the kernel threads. Thus, Linux is considered a soft real-time system. Moreover, kernel threads are configured to have static priorities for throughputs. The static assignment of priorities to kernel threads causes trouble for real-time tasks when real-time tasks require kernel threads to be invoked to handle the system calls because kernel threads do not discriminate between real-time and non-real-time tasks. We present a dynamic kernel thread scheduling mechanism with weighted average priority inheritance protocol (PIP), a variation of the PIP. The scheduling algorithm assigns proper priorities to kernel threads at runtime by monitoring the activities of user-level real-time tasks. Experimental results show that the algorithms can greatly improve the unexpected execution latency of real-time tasks.