• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.6
• /
• pp.39-46
• /
• 2003

Biometric technologies using biometric information like fingerprints features are in wide use for the secure user authentication in many services including log-in of computer systems, entrance ID and E-commercial security. Nowadays, biometric technologies are ported into small embedded systems like security tokens or smart cards due to the merit of being secure and automatic in comparison with the previous method in user authentication such as using a PIN. In this paper, the security token developed as an embedded system and tile user authentication system implemented and tested using fingerprints information are described. Communications between the security token and tile host are tested and verified with USB. And, execution time and runtime memory on tile security token board was measured and performance improvement was described. In addition, requisites for the transit from the security token to the match-on-card was mentioned.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.41 no.1
• /
• pp.25-32
• /
• 2004

Nowadays image processing is very useful for some field of traffic applications. The one reason is we can construct the system in a low price, the other is the improvement of hardware processing power, it can be more fast to processing the data. In traffic field, the development of image using system is interesting issue. Because it has the advantage of price of installation and it does not obstruct traffic during the installation. In this study, 1 propose the traffic monitoring system that implement on the embedded system environment. The whole system consists of two main part, one is host controller board, the other is image processing board. The part of host controller board take charge of control the total system interface of external environment, and OSD(On screen display). The part of image processing board takes charge of image input and output using video encoder and decoder, Image classification and memory control of using FPGA, control of mouse signal. And finally, for stable operation of host controller board, uC/OS-II operating system is ported on the board.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.1
• /
• pp.53-57
• /
• 2010

This study proposes the algorithm which drives the powerless without battery. The exiting wire or RF type dosimeter, which is the computation of the real time with battery on the dose radiation exposure, In the Wired dosimeter, it is trouble to need the maintenance and management by periods. Besides, the case of the RF typed dosimeter with battery, it is requested to size bigger and to replace battery frequently and so on. Especially RF typed dosimeter has trouble to need for the embody with large power consumption on the contactless typed dosimeter. As the method for the low power, the study designed to be down the operating clock of the MPC, to improve the efficiency of the rectifier, to eliminate the external memory and the DC-DC converter for the simplification of the circuit We convince our research contributes not only to understand the simplified circuit and miniaturization, but also to help the design and application technology of the powerless dosimeter.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.6
• /
• pp.1113-1120
• /
• 2017

As the size of the data is getting larger and larger due to improvement of the telecommunication techniques, it would be main issues to develop and process the database. The bloom filter used to lookup a particular element under the given set is very useful structure because of the space efficiency. In this paper, we analyse the main factor of the false positive and propose the new parallel type bloom filter in order to minimize the false positive which is caused by other hash functions. The proposed method uses the memory as large as the conventional bloom filter use, but it can improve the processing speed using parallel processing. In addition, if we use the perfect hash function, the insertion and deletion function in the proposed bloom filter would be possible.

• Research in Community and Public Health Nursing
• /
• v.9 no.2
• /
• pp.336-349
• /
• 1998

The purpose of this study was to test the effects of music therapy on cognitive function and depression in demented old adults. This study was made with one -group in a pre- and post-test design. The subjects were seven demented old adults over, sixty-five years and with mild to moderate cognitive impairment, residing at a nursing home. Music therapy was given by one researcher and one research assistant for thirty to forty minutes twice a week for 4 months. Music therapy was conducted with the subjects both listening and singing with a cassette player and a double-handed drum. In order to evaluate the effects of music, we measured the level of cognitive function and depression at the beginning and at the end of the music therapy session by means of an MMSE- K developed by Kwon and Park and the Depression Inventory developed by Chon. The Data were analyzed using descriptive statistics and a paired t - test analysis using a SPSS PC package. The results are as follows: 1) The subjects of the music therapy showed improvement in cognitive function. The MMSE-K score was significantly increased after music therapy. Especially, memory recall was very significantly. 2) The subjects of the music therapy showed a slight decrease in depression. However, there was no significant difference in the degree of depression between mean scores measured before and after music therapy. The results suggest that music therapy is effective in improving and maintaining cognitive function in demented old adults. And we suggest that long-term music therapy will be required to improve depression in demented old adults. These findings are encouraging the idea that music therapy may improve cognitive impairment.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.3
• /
• pp.11-19
• /
• 2015

Due to recent development in mobile devices, the mobile device utilization and many related applications have been increasing. Most of initial applications on mobile devices just showed simple information, but now they processes huge data. However, smart devices have certain limitations in processing massive data. Especially, if the size of data increases, the speed of data processing adversely decreases, so the performance of programs also decreases. If hardware specification of the mobile devices is not enough to handle it, response time will be drastically delayed. To overcome these drawbacks, most of application running on mobile devices communicate with their servers to manage data. XML is a proper language for data communication to send and receive data between servers and mobile devices, because it defines rules of document's format and it is a textual data format and small-sized language. However, mobile devices have limitation such as memory, CPU and wireless network to process huge data and XML also takes a lot of time to communicate with servers and devices and handle data, so it could be overhead in service time. Binary XML is an alternative of performance improvement in data processing, which has XML's benefits and minimizes the XML size by binary coding. However, most of binaryXML which are used on applications don't fit on mobile applications. In this paper, we surveyed many kinds of binaryXML, compared merits and demerits to find a binaryXML for mobile applications. We propose how to use binary XML and implemented an electronic attendance system using binary XML to overcome the limitation of XML and to reduce the load of data communications between servers and devices.

• Journal of Sensor Science and Technology
• /
• v.20 no.5
• /
• pp.336-342
• /
• 2011

Recently, the LCD manufacturing industries try to maximize the productivity of LCD panels due to sharp increase in the market need of LCD display. Usually, the increase in manufacturing speed induces additional vibration of glasses and manufacturing machineries. This kind of vibration can induce bad effects on the manufacturing accuracy, and even can damage the glasses. The vibration signal of glass itself is very useful to predict the allowable maximum level of manufacturing speed. Therefore, it is necessary to measure the vibration of the glass itself and a very thin vibration measurement system attachable on the glass is needed. Since in some processes the glasses need to go through very thin gaps such as 2.5mm, We develop a glass vibration measurement system with the thickness of 1.3mm. The system measures the glass vibration using MEMS type accelerometers and store vibration data in a Nand-Flash memory. The performance of the develop system has been verified on a real LCD manufacturing line and the accuracy of vibration measurement is comparable with that of an accurate commercial vibration measurement system.

• The KIPS Transactions:PartA
• /
• v.11A no.3
• /
• pp.199-206
• /
• 2004

Under the multiprogrammed situation, the performance of multiprocessor system is affected by the process allocation policy of the operating systems. The lowest communication cost can be achieved when the related processes positioned to the adjacent processors. While the effective allocation is quite difficult to the real situation, and the processing of the allocation policy consumes some computation time. The dual-ring CC-NUMA systems exhibit a quite performance difference according to the process a1location policy due to a lot of unbalanced memory transactions on the interconnection networks. In this paper, I propose a load balanced dual-link CC-NUMA system that does not requires the processes allocation policy. By the program-driven simulation results. the proposed system shows no remarkable difference according to the allocation policy while the dual-ring systems shows 10％ performance improvement by the process allocation. In addition, the proposed system outperforms the dual~ring systems about 1.5 times.

• The KIPS Transactions:PartA
• /
• v.11A no.7 s.91
• /
• pp.489-498
• /
• 2004

VLIW processor is considered to be an appropriate processor for the embedded system, provided with high performance and low power con-sumption due to its simple hardware structure. Unfortunately, the VLIW processor often suffers from high memory access latency due to the variable length of I-packets, which consist of independent instructions to be issued in parallel. It is because of the variable I-packet length that some I-packets must be placed over two cache blocks, which are called straddle I-packets, so that two cache accesses are required to fetch such I-packets. In this paper, an expansion buffer cache is proposed to improve not only the instruction fetch bandwidth, but also the power consumption of the I-cache with moderate hardware cost. The expansion buffer cache has a small expansion buffer containing a fraction of a straddle packet along with the main cache to reduce the additional cache accesses due to the straddle I-packets. With a great reduction in the cache accesses due to the straddle packets, the expansion buffer cache can achieve $5{\~}9{\%}$improvement over the conventional I-caches in the $Delay{\cdot}Power{\cdot}Area$ metric.

• Journal of KIISE:Information Networking
• /
• v.35 no.6
• /
• pp.482-496
• /
• 2008

Packet classification in the Internet routers requires multi-dimensional search for multiple header fields for every incoming packet in wire-speed, hence packet classification is one of the most important challenges in router design. Hierarchical packet classification is one of the most effective solutions since search space is remarkably reduced every time a field search is completed. However, hierarchical structures have two intrinsic issues; back-tracking and empty internal nodes. In this paper, we propose a new hierarchical packet classification algorithm which solves both problems. The back-tracking is avoided by using the set-pruning and the empty internal nodes are avoided by applying the binary search tree. Simulation result shows that the proposed algorithm provides significant improvement in search speed without increasing the amount of memory requirement. We also propose an optimization technique applying controlled rule copy in set-pruning.