• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.22 no.3
• /
• pp.335-351
• /
• 2011

This study aimed to improve our understanding of users' cognitive processes based on think aloud protocols generated during the retrieval process of an online database. It analyzed think aloud protocols generated by participants while performing pre-defined tasks using an online database. The protocols were encoded using the open coding method. As the results, four broad categories including retrieval, system format, system functionality, and information were drawn, and 21 detailed categories were generated. Based on the results, suggestions for the design of online databases were provided.

• Nuclear Engineering and Technology
• /
• v.55 no.7
• /
• pp.2356-2365
• /
• 2023

Characterization, dismantling and pre-disposal management of irradiated graphite (i-graphite) have an important role in safe decommissioning of several nuclear facilities which used this material as moderator and reflector. In addition to common radiation protection issues, easily volatizing long-lived radionuclides and stored Wigner energy could be released during imprudent retrieval and processing of i-graphite. With this regard, among all cutting technologies, abrasive waterjet (AWJ) can successfully achieve all of the thermo-mechanical and radiation protection objectives. In this work, factorial experiments were designed and systematically conducted to characterize the AWJ processing parameters and the machining capability. Moreover, the limitation of dust production and secondary waste generation has been addressed since they are important aspects for radiation protection and radioactive waste management. The promising results obtained on non-irradiated nuclear graphite blocks demonstrate the applicability of AWJ as a valid technology for optimizing the retrieval, storage, and disposal of such radioactive waste. These activities would benefit from the points of view of safety, management, and costs.

• Transactions on Control, Automation and Systems Engineering
• /
• v.4 no.2
• /
• pp.164-168
• /
• 2002

In this article, we present the novel approach of avoiding temporal insufficiency of data blocks, jitter, which occurs due to the commencement of new session. We propose to make the sufficient amount of data blocks available on memory such that the ongoing session can survive the cycle extension. This technique is called ″pre-buffering″. We examine two different approaches in pre-buffering: (i) loads all required data blocks prior to starting playback and (ii) incrementally accumulates the data blocks in each cycle. We develop an elaborate model to determine the appropriate amount of data blocks necessary to survive the cycle extension and to compute startup latency involved in loading these data blocks. The simulation result shows that limiting the disk bandwidth utilization to 60% can greatly improve the startup latency as well as the buffer requirement for individual streams.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.6
• /
• pp.141-147
• /
• 1999

Optical disk technology with a laser beam for data recording and retrieval is one of the most promising route for high density information storage in multimedia era. As the storage density and data transfer rates are increased, mechanical issues, mainly noise and vibration, become critical. Rubber materials are extensively used in various machine design application, mainly for vibration/shock/noise control devices. Over the years an enormous effort has been put into developing procedures to provide properties of rubber components with complex shape and under pre-deformed state. In this paper, non-linear large deformations of a rubber mount for optical disk drive were investigated using the finite element method. A tension test of rubber material was performed, to calculate a strain energy function. According to the pre-deformed state, the variation of rubber mount stiffness were calculated and the reliability of numerical results were checked by compared with the measuring the deflection values. Also, the effects of the pre-deformed rubber mount on the system dynamic characteristics were investigated and the relation between the static stiffness variation of rubber mount and the natural frequence variation of system was discussed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12B
• /
• pp.1066-1080
• /
• 2003

In this paper a scalable QoS routing scheme for distributed multimedia applications in a hierarchical wide area network is proposed. The problem of QoS routing is formulated as a multicriteria shortest path problem, known as NP-complete. The proposed hierarchical routing scheme consists of two phases. In Phase 1, every border node periodically pre-computes the QoS distance for the paths between every pair of border nodes in any level of domain hierarchy. This phase is independet of the QoS request from an application. In Phase II, distributed graph construction algorithm is performed to model the network as a graph by retrieving pre-computed QoS distances. The graph is constructed by the on-demand algorithm and contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. By using retrieval approach rather than advertising one, no global QoS state information exchange among nodes is needed. In this Phase, distributed partition algorithm for QoS routing problem is also performed, thus eliminating virtual links on the hierarchically complete path.

• Journal of the Korean Society for information Management
• /
• v.14 no.1
• /
• pp.77-105
• /
• 1997

The study confirmed that the methods for expanding headings and combined structures among the headings, subdivisions, qualifiers and inverted terms were diverse, and that the headings used for similar purposes do not have identical structural forms. It is also found that the standard symbols representing generic relationship in theasurus, which are introduced in the list of subject headings, do not show precisely the hiearchical relationship of phrase headings. MeSH in pre-coordinated system will be available for retrieval in the computer environment because it can make a link between headings and subdivisions in searching stage. The changes in retrieval circumstances and the seeking behaviors of the users demand that a new structure of subject headings be developed. It was proposed that the modification of the structure in the Hangul subject headings be essential.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.6
• /
• pp.1403-1408
• /
• 2010

Korean information retrieval uses noun as index terms or keywords of representing the document. and noun and keyword extraction is to find all nouns presented in the document, In this paper, we proposes the method of keyword extraction using pre-built dictionary. This method reduces the execution time by reducing unnecessary operations. And noun, even large documents without affecting significantly the accuracy, can be extracted. This paper proposed noun extraction method using the appearance characteristics of the noun and keyword extraction method using unsupervised learning techniques.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.165-166
• /
• 2010

Noun extraction is to find all nouns presented in the document, Korean information retrieval uses noun as index terms or keywords of representing the document. In this paper, we proposes the method of keyword extraction using pre-built dictionary. This method reduces the execution time by reducing unnecessary operations. And noun, even large documents without affecting significantly the accuracy, can be extracted. This paper proposed noun extraction method using the appearance characteristics of the noun and keyword extraction method using unsupervised learning techniques.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.1
• /
• pp.142-148
• /
• 2014

A descriptor which is suitable for motion analysis by using the motion features of moving objects from the real time image sequence is proposed. To segment moving objects from the background, the background learning is performed. We extract motion trajectories of individual objects by using the sequence of the 1st order moment of moving objects. The center points of each object are managed by linked list. The descriptor includes the 1st order coordinates of moving object belong to neighbor of the pre-defined position in grid pattern, The start frame number which a moving object appeared in the scene and the end frame number which it disappeared. A video retrieval by the proposed descriptor combining global and local feature is more effective than conventional methods which adopt a single feature among global and local features.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.5 s.305
• /
• pp.1-10
• /
• 2005

Content-based image retrieval systems are being actively investigated owing to their ability to retrieve images based on the actual visual content rather than by manually associated textual descriptions. In this paper, we propose a novel approach for image retrieval based on edge structural features using edge correlogram and color coherence vector. After color vector angle is applied in the pre-processing stage, an image is divided into two image parts (high frequency image and low frequency image). In low frequency image, the global color distribution of smooth pixels is extracted by color coherence vector, thereby incorporating spatial information into the proposed color descriptor. Meanwhile, in high frequency image, the distribution of the gray pairs at an edge is extracted by edge correlogram. Since the proposed algorithm includes the spatial and edge information between colors, it can robustly reduce the effect of the significant change in appearance and shape in image analysis. The proposed method provides a simple and flexible description for the image with complex scene in terms of structural features of the image contents. Experimental evidence suggests that our algorithm outperforms the recently histogram refinement methods for image indexing and retrieval. To index the multidimensional feature vectors, we use R*-tree structure.