• Journal of Gifted/Talented Education
• /
• v.12 no.2
• /
• pp.31-56
• /
• 2002

Providing gifted education should be based on the principle of differentiation, that is, paying close attention to the individual characteristics of the gifted. The gifted are known to be the fast learners with autonomous studying ability and high levels of thinking and creativity, which certainly differentiate them from the ordinary others. Thus, the program for the gifted should fundamentally differ from other general programs. The need for gifted education is growing as our society has turned into the knowledge-based society. Fortunately, on December 28th, 1999, a law in favor of gifted education was passed. According to the law, gifted education will be actively provided under the government's support from the year 2002. In this context, this study is intended to search for the model of developing instructional materials for the gifted. The output materials of this study are to be used in gifted schools which will be built in the near future. The curriculum for the gifted consists of three parts: basic curriculum, in-depth curriculum, and optional curriculum. The learning and instructional materials developed in this study are to be used for the in-depth curriculum. In order to develop the materials, various theoretical models related to gifted education were reviewed. Finally, a theoretical model was developed. On the basis of the model, several instructional materials are developed and the possibility of application are considered.

• Journal of The Korean Association of Information Education
• /
• v.9 no.3
• /
• pp.453-462
• /
• 2005

Recently, due to technical improvements of storage devices and networks, the amount of data increase rapidly. In addition, it is required to find the knowledge embedded in a data stream as fast as possible. Huge data in a data stream are created continuously and changed fast. Various algorithms for finding frequent itemsets in a data stream are actively proposed. Current researches do not offer appropriate method to find frequent itemsets in which flow of time is reflected but provide only frequent items using total aggregation values. In this paper we proposes a novel algorithm for finding the relative frequent itemsets according to the time in a data stream. We also propose the method to save frequent items and sub-frequent items in order to take limited memory into account and the method to update time variant frequent items. The performance of the proposed method is analyzed through a series of experiments. The proposed method can search both frequent itemsets and relative frequent itemsets only using the action patterns of the students at each time slot. Thus, our method can enhance the effectiveness of learning and make the best plan for individual learning.

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

Recently much research for developing forwarding table that support fast router without employing both special hardware and new protocols. This article introduces a new forwarding data structure based on the software to enable forwarding lookup to be penormed at giga-bit speed. The forwarding table is known as a bottleneck of the routers penormance due to its high complexity proportional to the forwarding table size. The recent research that based on the software uses a Patricia trie and its variants. and also uses a hash function with prefix length key and others. The proposed forwarding table structure construct a forwarding table by the bit stream array in which it constructs trie from routing table prefix entries and it represents each pointer pointing the child node and the associated forwarding table entry with one bit The trie structure and routing prefix pointer need a large memory when representing those by linked-list or array. but in the proposed data structure, the needed memory size is small enough since it represents information with one bit. Additionally, by use a lookup method that start searching at desired middle level we can shorten the search path. The introduced data structure. called bit-map trie shows that we can implement a fast forwarding engine on the conventional Pentium processor by reducing the backbone routing table fits into Level 2 cache of Pentium II processor and shortens the searching path. Our experiments to evaluate the performance of proposed method show that this bit-map trie accomplishes 5.7 million lookups per second.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.4
• /
• pp.107-115
• /
• 2011

In this paper, we proposed fast and efficient algorithm for detecting near-duplication based on content based retrieval in large scale video database. For handling large amounts of video easily, we split the video into small segment using scene change detection. In case of video services and copyright related business models, it is need to technology that detect near-duplicates, that longer matched video than to search video containing short part or a frame of original. To detect near-duplicate video, we proposed motion distribution and frame descriptor in a video segment. The motion distribution descriptor is constructed by obtaining motion vector from macro blocks during the video decoding process. When matching between descriptors, we use the motion distribution descriptor as filtering to improving matching speed. However, motion distribution has low discriminability. To improve discrimination, we decide to identification using frame descriptor extracted from selected representative frames within a scene segmentation. The proposed algorithm shows high success rate and low false alarm rate. In addition, the matching speed of this descriptor is very fast, we confirm this algorithm can be useful to practical application.

• Journal of Broadcast Engineering
• /
• v.13 no.3
• /
• pp.310-318
• /
• 2008

The H.264/AVC standard achieves higher coding efficiency than previous video coding standards with the rate-distortion optimization (RDO) technique which selects the best coding mode and reference frame for each macroblock. As a result, the complexity of the encoder have been significantly increased. In this paper, a fast intra-mode decision algorithm is proposed to reduce the computational load of intra-mode search, which is based on the inverse tree-structure edge prediction algorithm. First, we obtained the dominant edge for each $4{\times}4$ block from local edge information, then the RDO process is only performed by the mode which corresponds to dominant edge direction. Then, for the $8{\times}8$ (or $16{\times}16$) block stage, the dominant edge is calculated from its four $4{\times}4$ (or $16{\times}16$) blocks' dominant edges without additional calculation and the RDO process is also performed by the mode which is related to dominant edge direction. Experimental results show that proposed scheme can significantly improve the speed of the intra prediction with a negligible loss in the peak signal to noise ratio (PSNR) and a little increase of bits.

• Journal of Internet Computing and Services
• /
• v.15 no.4
• /
• pp.125-133
• /
• 2014

The column-oriented database storage is a very advanced model for large-volume data analysis systems because of its superior I/O performance. Traditional data storages exploit row-oriented storage where the attributes of a record are placed contiguously in hard disk for fast write operations. However, for search-mostly datawarehouse systems, column-oriented storage has become a more proper model because of its superior read performance. Recently, solid state drive using MLC flash memory is largely recognized as the preferred storage media for high-speed data analysis systems. The features of non-volatility, low power consumption, and fast access time for read operations are sufficient grounds to support flash memory as major storage components of modern database servers. However, we need to improve traditional transaction management scheme due to the relatively slow characteristics of column compression and flash operation as compared to RAM memory. In this research, we propose a new scheme called Column-aware Multi-Version Locking (CaMVL) scheme for efficient transaction processing. CaMVL improves transaction performance by using compression lock and multi version reads for efficiently handling slow flash write/erase operation in lock management process. We also propose a simulation model to show the performance of CaMVL. Based on the results of the performance evaluation, we conclude that CaMVL scheme outperforms the traditional scheme.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.2
• /
• pp.113-121
• /
• 2012

In this paper, we proposed fast and efficient algorithm for detecting near-duplication based on content based retrieval in large scale video database. For handling large amounts of video easily, we split the video into small segment using scene change detection. In case of video services and copyright related business models, it is need to technology that detect near-duplicates, that longer matched video than to search video containing short part or a frame of original. To detect near-duplicate video, we proposed motion distribution and frame descriptor in a video segment. The motion distribution descriptor is constructed by obtaining motion vector from macro blocks during the video decoding process. When matching between descriptors, we use the motion distribution descriptor as filtering to improving matching speed. However, motion distribution has low discriminability. To improve discrimination, we decide to identification using frame descriptor extracted from selected representative frames within a scene segmentation. The proposed algorithm shows high success rate and low false alarm rate. In addition, the matching speed of this descriptor is very fast, we confirm this algorithm can be useful to practical application.

• Publications of The Korean Astronomical Society
• /
• v.30 no.2
• /
• pp.559-563
• /
• 2015

Monitor of All-sky X-ray Image (MAXI) is a Japanese X-ray all-sky surveyer mounted on the International Space Station (ISS). It has been scanning the whole sky since 2009 during every 92-minute ISS rotation. X-ray transients are quickly found by the real-time nova-search program. As a result, MAXI has issued 133 Astronomer's Telegrams and 44 Gamma-ray burst Coordinated Networks so far. MAXI has discovered six new black holes (BH) in 4.5 years. Long-term behaviors of the MAXI BHs can be classified into two types by their outbursts; a fast-rise exponential-decay type and a fast-rise flat-top one. The slit camera is suitable for accumulating data over a long time. MAXI issued a 37-month catalog containing 500 sources above a ~0.6 mCrab detection limit at 4-10 keV in the region ${\mid}{b}{\mid}$ > $10^{\circ}$. The SSC instrument utilizing an X-ray CCD has detected diffuse soft X-rays extending over a large solid angle, such as the Cygnus super bubble. MAXI/SSC has also detcted a Ne emission line from the rapid soft X-ray nova MAXI J0158-744. The overall shapes of outbursts in Be X-ray binaries (BeXRB) are precisely observed with MAXI/GSC. BeXRB have two kinds of outbursts, a normal outburst and a giant one. The peak dates of the subsequent giant outbursts of A0535+26 repeated with a different period than the orbital one. The Be stellar disk is considered to either have a precession motion or a distorted shape. The long-term behaviors of low-mass X-ray binaries (LMXB) containing weakly magnetized neutron stars are investigated. Transient LMXBs (Aql X-1 and 4U 1608-52) repeated outbursts every 200-1000 days, which is understood by the limit-cycle of hydrogen ionization states in the outer accretion disk. A third state (very dim state) in Aql X-1 and 4U 1608-52 was interpreted as the propeller effect in the unified picture of LMXB. Cir X-1 is a peculiar source in the sense that its long-term behavior is not like typical LMXBs. The luminosity sometimes decreases suddenly at periastron. It might be explained by the stripping of the outer accretion disk by a clumpy stellar wind. MAXI observed 64 large flares from 22 active stars (RS CVns, dMe stars, Argol types, young stellar objects) over 4 years. The total energies are $10^{34}-10^{36}$ erg $s^{-1}$. Since MAXI can measure the spectrum (temperature and emission measure), we can estimate the size of the plasma and the magnetic fields. The size sometimes exceeds the size of the star. The magnetic field is in the range of 10-100 gauss, which is a typical value for solar flares.

• The Journal of the Korea Contents Association
• /
• v.8 no.12
• /
• pp.386-395
• /
• 2008

The purpose of this study is to understand the cognitive power from user who have used hotel management information system and to search contribution level for hotel management. The survey results are : There are different cognitions, between PKG and developed user system, short term employee and long term employee, reservation part and front office part. Specially IT service management parts(mostly outsourcing) have low degree cognition, because of lated supporting and being short of IT service management system. Hotel information system construction gives us to be easy management operating and to be fast management but Hotel information system has to lead value creation, to support decision making, to present advavced management for hotel.

• Journal of Digital Contents Society
• /
• v.15 no.2
• /
• pp.251-261
• /
• 2014

In the typical P2P VOD system, it is very important to develop the fast and efficient peer searching scheme since the peers frequently join and leave to/from P2P system. This paper proposes a new peer searching scheme for P2P VOD system based on DHT network environment. The proposed scheme constructs DHT network by managing the peers having close playback starting times and close network locations into a peer all together. The peer information is mapped onto DHT nodes by hashing the key values each of which consists of the starting time and network location of the peer. From the simulation results, the number of messages required to search the partner peers are decreased, and the number of buffer maps exchanging among the peers are also decreased. The proposed scheme can reduce the average network distances among the partner peers. As a result, the proposed scheme makes routing more efficient and it saves the network resources by decreasing communication traffic overhead.