• Journal of Advanced Navigation Technology
• /
• v.19 no.6
• /
• pp.564-573
• /
• 2015

GPS is the representative positioning technology for providing the location information. This technique has the disadvantage that does not operate in the shadow areas, such as urban or dense forest and the interior. This paper proposes a hybrid indoor positioning algorithm, which estimates a more accurate location of the terminal using strength of the Wi-Fi signal from the indoor AP. To determine the location of the user, we establish the most appropriate path loss model for the measurement environment. by using the RSSI value measured in a variety of environment such as building structure, person, distance, etc. The path loss exponent obtained by the path loss model is changed according to the environment. REKF, PF estimate the position of the terminal by using measured value from the AP with path loss exponent. For more accurate position estimation, we select positioning system by the value of threshold measured by experiments rather than a single positioning system. Experimental results using the proposed hybrid algorithm show that the performance is improved by about 17% than the conventional single positioning method.

• Journal of KIISE
• /
• v.44 no.4
• /
• pp.374-382
• /
• 2017

As the walking exercise is emphasized in personalized healthcare, numerous services demand walking information. Along with the propagation of smartphones nowadays, many step-counter applications have been released. But these applications are error-prone to abnormal movements such as simple shaking or vibrations; also, different step counts are shown when the phone is positioned in different locations of the body. In this paper, the proposed method accurately counts the steps regardless of the smartphone position by using an accelerometer and a proximity sensor. A threshold is set on each of the six positions to minimize the error of undetection and over-detection, and the cut-off section is set to eliminate any noise. The test results show that the six position type were successfully identified, and through a comparison experiment with the existing application, the proposed technique was verified as superior in terms of accuracy.

• KIISE Transactions on Computing Practices
• /
• v.23 no.4
• /
• pp.250-255
• /
• 2017

Given the explosion of genomic data and expansion of applications such as precision medicine, the importance of efficient genome-database management continues to grow. Traditional compression techniques may be effective in reducing the size of a database, but a new challenge follows in terms of performing operations such as comparison and searches on the compressed database. Based on that many genome databases typically have numerous duplicated or similar sequences, and that the runtime of genome analyses is normally proportional to the number of sequences in a database, we propose a technique that can compress a genome database by eliminating similar entries from the database. Through our experiments, we show that we can remove approximately 84% of sequences with 1% similarity threshold, accelerating the downstream classification tasks by approximately 10 times. We also confirm that our compression method does not significantly affect the accuracy of taxonomy diversity assessments or classification.

• Journal of information and communication convergence engineering
• /
• v.9 no.5
• /
• pp.577-582
• /
• 2011

EMR(Electronic Medical Record) is an emerging technology that is highly-blended between non-IT and IT area. One of methodology to link non-IT and IT area is to construct databases. Nowadays, it supports before and after-treatment for patients and should satisfy all stakeholders such as practitioners, nurses, researchers, administrators and financial department and so on. In accordance with the database maintenance, DAS (Data as Service) model is one solution for outsourcing. However, there are some scalability and strategy issues when we need to plan to use DAS model properly. We constructed three kinds of databases such as plain-text, MS built-in encryption which is in-house model and custom AES (Advanced Encryption Standard) - DAS model scaling from 5K to 2560K records. To perform custom AES-DAS better, we also devised Bucket Index using Bloom Filter. The simulation showed the response times arithmetically increased in the beginning but after a certain threshold, exponentially increased in the end. In conclusion, if the database model is close to in-house model, then vendor technology is a good way to perform and get query response times in a consistent manner. If the model is DAS model, it is easy to outsource the database, however, some technique like Bucket Index enhances its utilization. To get faster query response times, designing database such as consideration of the field type is also important. This study suggests cloud computing would be a next DAS model to satisfy the scalability and the security issues.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.9
• /
• pp.4152-4158
• /
• 2012

The Stereo X-ray inspection system is designed for effectively providing the additional information of objects than the conventional inspection system that offers only 2D cross-section of objects. We studied the geometric improvement of the stereo X-ray inspection system, the stereo matching algorithm of the single object using the edge and the volume reconstruction method for the inspected object. In this paper, we conduct a matching algorithm to find the correspondences between the images and reconstruct 3-D shapes of real objects using the stereo X-ray images. Also, we apply a new 3D reconstruction algorithm for the discrimination of two objects. For the separation of the overlapping objects, we calculate the vector of the object and divide inner and outer voxel of objects. And for the elimination of the overlapping area, we study the reconstruct 3D shapes using the threshold based Z-axis. The experimental results show that the proposed technique can enhance the accuracy of stereo matching and give more efficient visualization for overlap objects in the restricted environment.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.4
• /
• pp.194-201
• /
• 2004

Optical fibers are indispensable fer optical communication systems that transmit large volumes of data at high speed. But the aligning technology under the sub-micron accuracy is required for the precise axis adjustment and connection. For the purpose of precise alignment of the optical arrays, in this research, we have developed the 12-axis(with 8 automated axis and 4 manual axis) automatic optical fiber alignment system including the image processing-based searching system, the automatic loading system using the robot and the suction toot and the automatic UV bonding system. In order to obtain the sub-micron alignment accuracy, two 4-axis PC-based motion controllers and the two 50nm resolution 6-aixs micro-stage actuated by micro stepping motors are adopted. The fiber aligning procedure consists of two steps. Firstly, the optical wave guide and an input optical array are aligned by the 6-axis input micro-stage with the IR camera. The image processing technique is introduced to reduce primary manual aligning time and result in achieving the 50% decrease of aligning time. Secondly, the IR camera is replaced by the output micro-stage and a wave guide and two optical arrays are aligned simultaneously before the laser power intensity delivered to the optical powermeter reached the threshold value. When the aligning procedure is finished, the wave guide and arrays are W bonded. The automatic loading/unloading system is also introduced and the entire wave guide handing time is reduced significantly compared to the former commercial aligning system.

• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.694-699
• /
• 2014

In mobile ad-hoc networks (MANET), the network topology and neighboring nodes change frequently, since MANET is composed of nodes that have mobility without a fixed network infrastructure. The AODV routing protocol is advantageous for MANET, but AODV has a delay in the transmission of data packets because AODV can not transmit data during route recovery. This paper proposes solving the above problem of AODV by using a bypass generation mechanism for data transmission during route recovery. For further improvement, additional mechanisms that coordinate the reception threshold of a hello packet are proposed in order to improve the accuracy of the information obtained from the neighboring nodes when the bypass is generated due to a link failure and the immediacy of the route recovery. Simulation results show that the proposed technique improves the performance in terms of the delay in transmission compared to traditional AODV.

• The Korean Journal of Physiology and Pharmacology
• /
• v.22 no.6
• /
• pp.649-660
• /
• 2018

Migraine is a neurological disorder characterized by recurrent and disabling severe headaches. Although several anticonvulsant drugs that block voltagedependent $Na^+$ channels are widely used for migraine, far less is known about the therapeutic actions of carbamazepine on migraine. In the present study, therefore, we characterized the effects of carbamazepine on tetrodotoxin-resistant (TTX-R) $Na^+$ channels in acutely isolated rat dural afferent neurons, which were identified by the fluorescent dye DiI. The TTX-R $Na^+$ currents were measured in medium-sized DiIpositive neurons using the whole-cell patch clamp technique in the voltage-clamp mode. While carbamazepine had little effect on the peak amplitude of transient $Na^+$ currents, it strongly inhibited steady-state currents of transient as well as persistent $Na^+$ currents in a concentration-dependent manner. Carbamazepine had only minor effects on the voltage-activation relationship, the voltage-inactivation relationship, and the use-dependent inhibition of TTX-R $Na^+$ channels. However, carbamazepine changed the inactivation kinetics of TTX-R $Na^+$ channels, significantly accelerating the development of inactivation and delaying the recovery from inactivation. In the current-clamp mode, carbamazepine decreased the number of action potentials without changing the action potential threshold. Given that the sensitization of dural afferent neurons by inflammatory mediators triggers acute migraine headaches and that inflammatory mediators potentiate TTX-R $Na^+$ currents, the present results suggest that carbamazepine may be useful for the treatment of migraine headaches.

• The Korean Journal of Malacology
• /
• v.27 no.4
• /
• pp.387-393
• /
• 2011

The objective of this study was to develop a real-time PCR method for the rapid detection and quantification of the protozoan pathogen Perkinsus olseni using a TaqMan probe. For the standard, genomic DNA was extracted from $10^5$ in vitro-cultured P. olseni trophozoites, and then 10-fold serial dilutions to the level of a single cell were prepared. To test the reliability of the technique, triplicates of genomic DNA were extracted from $5{\times}10^4$ cells and 10-fold serial dilutions to the level of 5 cells were prepared. The standards and samples were analyzed in duplicate using an $Exicycler^{TM}$ 96 real-time quantitative thermal block. For quantification, the threshold cycle ($C_T$) values of samples were compared with those obtained from standard dilutions. There was a strong linear relationship between the $C_T$ value and the log concentration of cells in the standard ($r^2$ = 0.996). Detection of DNA at a concentration as low as the equivalent of a single cell showed that the assay was sensitive enough to detect a single cell of P. olseni. The estimated number of P. olseni cells was similar to the original cell concentrations, indicating the reliability of P. olseni quantification by real-time PCR. Accordingly, the designed primers and probe may be used for the rapid detection and quantification of P. olseni from clam tissue, environmental water, and sediment samples.

• Journal of KIISE:Information Networking
• /
• v.28 no.2
• /
• pp.229-235
• /
• 2001

With the explosive popularity of the World Wide Web, the low penonnance of network often leads web clients to wait a long time for web server's response. To resolve this problem, web caching (proxy) has been considered as the most efficient technique for web server to handle this problem. The placement of web proxy is critical to the overall penonnance, and Li et al. showed the optimal placement of proxies for a web server in the internet with the linear and tree topology when the number of proxies, ]M, is given [4, 5]. They focused on minimizing the over all access time. However, it is also considerable for target web server to minimize the total number of proxies while each proxy server guarantees not to exceed certain res(Xlnse time for each request from its clients. In this paper, we consider the problem of finding the optimal number and placement of web proxies with the lin~ar and tree topology under the given threshold cost for delay time.