• Journal of Korean Library and Information Science Society
• /
• v.30 no.2
• /
• pp.179-198
• /
• 1999

The scope and the magnitude of change that are occurring in libraries today are exciting and the new developments in information technology challenging. A change in vision as well as activities and operations is required. Librarians need to make full use of information and multimedia technology to support this greatly expanded teaching venture. During the period of the 1st to 5th conference of Korean Society for Information Management produces 199 articles. The articles composed of 25 sub subjects of the knowledge of the library and information science. Some of the interesting sub-subjects were as follows: Information retrieval, Indexing, Classification, Library management, Information service, Cataloging and Digital library. The professional librarians pointed out the essential curricula of the library and informations science education. These are Introduction to Library Science, Organization of Information Resources, Information Retrieval, Multimedia technology, Information System, Library Management, Networks, Data Base, Indexing & thesaurus, Collection development, User Studies, New Media, Online Search.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.2
• /
• pp.27-34
• /
• 2013

We propose a simple power allocation scheme for an amplify-and-forward multiple relay system with multiple-input multiple-output antennas. Unlike the existing relay precoding matrix with full elements, proposed precoder is a diagonal matrix whose diagonal element is the relay gain for each stream. Furthermore, a weight vector is applied to streams, such that the mutual information of the system approaches that of the exhaustive search scheme, regardless of the number of antennas. Numerical results show that proposed scheme outperforms the conventional schemes with respect to mutual information.

• Journal of the Korea Society of Computer and Information
• /
• v.4 no.2
• /
• pp.141-146
• /
• 1999

In this paper, picture set filter is proposed for preserving compression ratio and video qualify. This filter controls the compression ratio of each frame depending on the correlation to the reference frame by selectively eliminating less important high-resolution areas. Consequently, video quality can be preserved and bit rate can be controlled adaptively. In the simulation, to test the performance of the proposed coding method, comparisons with the full search block matching algorithm and the differential image coding algorithm are made. In the former case, video quality, compression ratio and encoding time is improved. In the latter case, video quality is degraded, but compression ratio and encoding time is improved. Consequently. the proposed method shows a reasonably good performance over existing ones.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.4
• /
• pp.685-690
• /
• 1994

A problem associated with vector quantization(VQ) is the computational complexity incurred in searching for a codevector with the closet to a given input vector, where the complexity increases exponentionally with proportion to codebook size and then limits practical application. In this paper, a simple and fast, but efficient, VQ encoding algorithm is presented using a reference codevector as start codevector of premature exit condition, which eliminates distance claculation of unlikely codevectors. The algorithm is to find reference codevector having the possibility to be the nearest vector to input vector first and then to incorporate premature exit condition. The proposed algorithm needs only 10~15% of mathematical operations compared with the conventional full search VQ. Algorithm the number of additions and comparsions of the proposed algorithm is not reduced greatly, the number of multiplication is reduced up to 70~80% compared with other fast VQ encoding methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4B
• /
• pp.455-463
• /
• 2004

In this paper, we deal with a ring-mesh network design problem arising from the deployment of WDM for the optical internet. The ring-mesh network consists of ring topology and full mesh topology for satisfying traffic demand while minimizing the cost of OAOMs and OXCs. The problem seeks to find an optimal clustering of traffic demands in the network such that the total number of node assignments is minimized, while satisfying ring capacity and node cardinality constraints. We formulate the problem as a mixed-integer programming model and prescribe a tabu search heuristic procedure Promising computational results within 3% optimality gap are obtained using the proposed method.

• Proceedings of the KIEE Conference
• /
• 2001.07c
• /
• pp.1466-1468
• /
• 2001

For the full color organic electro-luminescent device, essentially, red, green, and blue emissions are required. But red emission is not to reach minimum level of practical use 31[lm/W]. In order to optimize color purity and power consumption requirements, it is important for the materials development efforts to search for improvements in red emission effisiency. In this study, the bis(8-oxyquinolino)zinc II ($Znq_2$) were synthesized successfully from zinc chloride($ZnCl_2$) as a initial material. Then, we fabricated red organic electroluminescent device with a dye(DCJTB)-doped and inserted $Znq_2$ between emission layer and cathode layer for increasing EL efficiency. The hole transfer layer is a N,N'-diphenyl-N,N'-bis-(3-methyl phenyl) -1,1'-diphenyl-4.4'-diamine(TPD), and the host material of emission layer is $Znq_2$. For the inserting of $Znq_2$, efficiency increased.

• ETRI Journal
• /
• v.39 no.1
• /
• pp.97-107
• /
• 2017

A fast and accurate building-level visual place recognition method built on an image-retrieval scheme using street-view images is proposed. Reference images generated from street-view images usually depict multiple buildings and confusing regions, such as roads, sky, and vehicles, which degrades retrieval accuracy and causes matching ambiguity. The proposed practical database refinement method uses informative reference image and keypoint selection. For database refinement, the method uses a spatial layout of the buildings in the reference image, specifically a building-identification mask image, which is obtained from a prebuilt three-dimensional model of the site. A global-positioning-system-aware retrieval structure is incorporated in it. To evaluate the method, we constructed a dataset over an area of $0.26km^2$. It was comprised of 38,700 reference images and corresponding building-identification mask images. The proposed method removed 25% of the database images using informative reference image selection. It achieved 85.6% recall of the top five candidates in 1.25 s of full processing. The method thus achieved high accuracy at a low computational complexity.

• Journal of the Korean Society of Costume
• /
• v.58 no.7
• /
• pp.119-132
• /
• 2008

This study intended to develop and produce a modern form of fashion design for the Korean creative dance performance, 'Crazy Skirt Collage', which expressed conflict between internal ego and a persona in a woman. The qualitative method was used to analyze literature review, internet search and visual data of historically important cases related to the theme. Based on the analysis, the fashion design of the dance performanre by Hwang Hee-Yeon that was actually staged on Towol Theater, one of the Seoul Arts Center, was produced. The results wire as follows; First, the study confirmed a change of persona that revealed a female's animus strongly as it moved into the modern time. Second, the female's persona was expressed through long skirts, slips, dress shoes, handbags, military shoes, dresses with long zippers, trousers, wedding dresses and Korean full skirts during the performance, while the female's animus through male coats, panties, big bags and clock. In conclusion, it is necessary to study new expressive methods, that is, dance clothes using advanced equipment such as lights, videos or other variety of materials. It is also important to understand aesthetics of modern women's ordinary lives and to adapt ordinary clothes to dance clothes in various methods in order to express their modern lives appropriately through Korean creative dance.

• Structural Engineering and Mechanics
• /
• v.54 no.2
• /
• pp.305-317
• /
• 2015

Optimal sensor placement (OSP) is an integral component in the design of an effective structural health monitoring (SHM) system. This paper describes the implementation of a novel collaborative-climb monkey algorithm (CMA), which combines the artificial fish swarm algorithm (AFSA) with the monkey algorithm (MA), as a strategy for the optimal placement of a predefined number of sensors. Different from the original MA, the dual-structure coding method is adopted for the representation of design variables. The collaborative-climb process that can make the full use of the monkeys' experiences to guide the movement is proposed and incorporated in the CMA to speed up the search efficiency of the algorithm. The effectiveness of the proposed algorithm is demonstrated by a numerical example with a high-rise structure. The results show that the proposed CMA algorithm can provide a robust design for sensor networks, which exhibits superior convergence characteristics when compared to the original MA using the dual-structure coding method.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.3
• /
• pp.77-88
• /
• 1995

It is assumed in the block matching algorithm(BMA) that all the pels in a block have a same motion vector. Then, the motion vector of a block in the BMA is matched to only one or none of the objects in the worst case if objects in a block have different motion vectors. This is apparent in the motion estimation using the fast BMA which has the effect of reducing the computation time and hardware complexity, compared to the full search BMA. Although the motion vector in the motion estimation using small block size is accurate, the increased number of bits is required to represent motion vectors. In this paper, new motion vector segmentation with less additional information and hardware complexity than the conventional method is proposed. In the proposed method, a motion vector is derived from the block for motion vector segmentation and another motion vector is extracted from four neighboring blocks to consiture a motion vector pair. For the accurate motion vector of each subblock, the motion vector is assigned to each subblock by mean squared error measure. And the overlapped motion compensation using window is also applied to reduce displaced frame difference.