• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.35T no.3
• /
• pp.46-52
• /
• 1998

In this paper, after inputting the computer with the attached number plate on the vehicle, using it, the color decomposition method and back propagation neural network proposed the extractable method of the vehicle number plate at high speed. This method separated R, G, B signal form input moving vehicle image to computer through video camera, then after transform this R, G, B signal into input image data of the computer by using color depth of vehicle number plate and store up binary value in the memory frame buffer. After adapting character's recognition algorithm, also improving this, by adapting back propagation neural network makes the vehicle number plate recognition system. Also minimalizing the similar color's confusion, adapting horizontal and vertical extracting algorithm by using the vehicle's rectangular architecture shows the extract and character's recognition of the vehicle number plate at high speed.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.12
• /
• pp.37-44
• /
• 2011

This paper presents the method of improving the data rate and BER in the inductive coupling link using a BPM signaling method. A complementary switching transmitter is used to remove invalid glitches at transmitted data, and the concept of pre-distortion is introduced to optimize received data. Also, an integrating receiver is used to increase the sampling margin and equalizing transistors are added in the pre-charge path of the integrator and comparator for high frequency operation. The transceiver designed with a 0.13 um CMOS technology operates at 2.4 Gb/s and consumes 5.99 mW from 1.2 V power supply.

• Journal of Technologic Dentistry
• /
• v.23 no.1
• /
• pp.9-19
• /
• 2001

Microstructure and phase transformation of Ti-Ni-Cu alloy powders produced by using attrition milling method were studied. Mixed powders of Ti-(50-X)Ni-XCu ($X=0{\sim}20$ at%) in composition range were mechanically alloyed for maximum 20 hours by using SUS 1/4" ball in argon atmosphere. Ball to powder ratio was 50: 1 and impeller speed was 350rpm. Mechanically alloyed with attrition millimg method. powder was heat treated at the temperature up to $850^{\circ}C$ for 1 hour in the $10^{-6}$ torr vacuum. Ti-Ni-Cu alloy powders have been fabricated by attrition milling method. and then phase transformation behaviours and microstructual properties of the alloy powders were investigated to assist in improving the the high damping capacity of Ti-Ni-Cu shape memory alloy powders. The results obtained are as follows: 1. After heat treating of fully mechanically alloyed powder at $850^{\circ}C$ for 1hour. most of the B2 and B 19' phases was formed and $TiNi_3$ were coexisted. 2. The B 19' martensite were formed in Ti-Ni-Cu alloy powders whose Cu-content is less than 5a/o. where as the B19 martensite in those whose Cu-content is more than 10at%. 3. The powders of as-milled Ti-Ni-Cu alloys whose Cu-contents is less than 5at% are amorphous. whereas those of as-milled Ti-Ni-Cu alloys whose Cu-content is more than 10at% are crystalline. This means that Cu addition tends to suppress amorphization of Ti-Ni alloy powders.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5C
• /
• pp.295-301
• /
• 2011

In [1], it has been shown that the energy spreading transform (EST) based iterative equalizer (IE) could enhance its performance by improving the reliability of the decision feedback symbols without the help of the complicated channel decoder. In the matched filter (MF) based IE proposed in [1], however, its feedforward filter (FFF) has been designed in the frequency domain while its feedback filter (FBF) in the time domain. So its complexity increases proportional to the channel memory length. To solve this problem, in this paper, both FFF and FBF are designed in the frequency domain. This enables the proposed frequency domain IE (FD-IE) to achieve the lower complexity over the conventional method in the highly dispersive channel. In addition, simulation results demonstrate that the BER performance of the proposed method is the same as the conventional.

• Journal of Ginseng Research
• /
• v.42 no.3
• /
• pp.298-303
• /
• 2018

Background: Panax ginseng is one of the most commonly used medicinal herbs worldwide for a variety of therapeutic properties including neurocognitive effects. Ginsenoside Rg1 is one of the most abundant active chemical constituents of this herb with known neuroprotective, anxiolytic, and cognition improving effects. Methods: We investigated the effects of Rg1 on the medial prefrontal cortex (mPFC), a key brain region involved in cognition, information processing, working memory, and decision making. In this study, the effects of systemic administration of Rg1 (1 mg/kg, 3 mg/kg, or 10 mg/kg) on (1) spontaneous firing of the medial prefrontal cortical neurons and (2) long-term potentiation (LTP) in the hippocampal-medial prefrontal cortical (HP-mPFC) pathway were investigated in male Sprague-Dawley rats. Results: The spontaneous neuronal activity of approximately 50% the recorded pyramidal cells in the mPFC was suppressed by Rg1. In addition, Rg1 attenuated LTP in the HP-mPFC pathway. These effects were not dose-dependent. Conclusion: This report suggests that acute treatment of Rg1 impairs LTP in the HP-mPFC pathway, perhaps by suppressing the firing of a subset of mPFC neurons that may contribute to the neurocognitive effects of Rg1.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.151-161
• /
• 2009

Audio Video Standard (AVS) is the audio and video compression standard that was developed for domestic video applications in China. AVS employs low complexity tools to minimize degradation of RD performance of the state-the-art video codec, H.264/AVC. The AVS video codec consists of $8{\times}8$ block prediction and the same size transform to improve compression efficiency for VGA and higher resolution sequences. Currently, the AVS has been adopted more and more for IPTV services and mobile applications in China. So, many consumer electronics companies and multimedia-related laboratories have been developing applications and chips for the AVS. In this paper, we implemented the AVS video decoder and optimize it on TI's Davinci EVM DSP board. For improving the decoding speed and clocks, we removed unnecessary memory operations and we also used high-speed VLD algorithm, linear assembly, intrinsic functions and so forth. Test results show that decoding speed of the optimized decoder is $5{\sim}7$ times faster than that of the reference software (RM 5.2J).

• International Journal of Internet, Broadcasting and Communication
• /
• v.10 no.3
• /
• pp.26-34
• /
• 2018

In this paper, we propose a scheduling scheme that can efficiently serve I/O requests having deadlines in flash storage. The I/O requests with deadlines, namely, real-time requests, are assumed to be issued for streaming services of continuous media. Since a Web-based streaming server commonly supports downloads of HTMLs or images, we also aim to quickly process non-real-time I/O requests, together with real-time ones. For this purpose, we adopt the well-known rate-reservation EDF (RR-EDF) algorithm for determining scheduling priorities among mixed I/O requests. In fact, for the use of an EDF-style algorithm, overhead of task's switching should be low and predictable, as with its application of CPU scheduling. In other words, the EDF algorithm is inherently unsuitable for scheduling I/O requests in HDD storage because of highly varying latency times of HDD. Unlike HDD, time for reading a block in flash storage is almost uniform with respect to its physical location. This is because flash storage has no mechanical component, differently from HDD. By capitalizing on this uniform block read time, we compute bandwidth utilization rates of real-time requests from streams. Then, the RR-EDF algorithm is applied for determining how much storage bandwidth can be assigned to non-real-time requests, while meeting deadlines of real-time requests. From this, we can improve the service times of non-real-time requests, which are issued for downloads of static files. Because the proposed scheme can expand flexibly the scheduling periods of streams, it can provide a full usage of slack times, thereby improving the overall throughput of flash storage significantly.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.4
• /
• pp.306-311
• /
• 2020

This paper deals with how to improve the performance of Python language with various libraries when developing a model using big data. The Python language uses the Pandas library for processing spreadsheet-format data such as Excel. In processing data, Python operates on an in-memory basis. There is no performance issue when processing small scale of data. However, performance issues occur when processing large scale of data. Therefore, this paper introduces a method for distributed processing of execution tasks in a single cluster and multiple clusters by using a Dask library that can be used with Pandas when processing data. The experiment compares the speed of processing a simple exponential model using only Pandas on the same specification hardware and the speed of processing using a dask together. This paper presents a method to develop a model by distributing a large scale of data by CPU cores in terms of performance while maintaining that python's advantage of using various libraries is easy.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.315-323
• /
• 2001

The concept of vertical partitioning has been discussed so far in an objective of improving the performance of query execution and system throughput. It can be applied to the areas where the match between data and queries affects performance, which includes partitioning of individual files in centralized environments, data distribution in distributed databases, dividing data among different levels of memory hierarchies, and so on. In general, a vertical partitioning algorithm should support n-ary partitioning as well as a globally optimal solution for the generation of all meaningful fragments. Most previous methods, however, have some limitations to support both of them efficiently. Because the vertical partitioning problem basically includes the fuzziness property, the proper management is required for the fuzziness problem. In this paper we propose an efficient vertical $\alpha$-partitioning algorithm which is based on the fuzzy theory. The method can not only generate all meaningful fragments but also support n-ary partitioning without any complex mathematical computations.

• Journal of KIISE
• /
• v.43 no.1
• /
• pp.27-33
• /
• 2016

Virtualization has become one of the most helpful techniques in computing systems, and today it is prevalent in several computing environments including desktops, data-centers, and enterprises. However, since I/O layers are implemented to be oblivious to the I/O behaviors on virtual machines (VM), there still exists an I/O scalability issue in virtualized systems. In particular, when a multi-queue solid state drive (SSD) is used as a secondary storage, each system reveals a semantic gap that degrades the overall performance of the VM. This is due to two key problems, accelerated lock contentions and the I/O parallelism issue. In this paper, we propose a novel approach, including the design of virtual CPU (vCPU)-dedicated queues and I/O threads, which efficiently distributes the lock contentions and addresses the parallelism issue of Virtio-blk-data-plane in virtualized environments. Our approach is based on the above principle, which allocates a dedicated queue and an I/O thread for each vCPU to reduce the semantic gap. Our experimental results with various I/O traces clearly show that our design improves the I/O operations per second (IOPS) in virtualized environments by up to 155% over existing QEMU-based systems.