• Journal of Labour Economics
• /
• v.33 no.3
• /
• pp.89-127
• /
• 2010

This paper explores the causes and solutions of the problem that the official unemployment rate does not adequately represent the reality of the employment situation in Korea. First, compared to ILO's international standards, there are several differences in the measurement of unemployment in Korea, for example, the treatment of unpaid family workers working less than 18 hours per week, the classification of persons who are waiting for a new job or temporarily laid-off, and the criteria of job search activities. The questionnaire structure of the Labor Force Survey in Korea also misleads the judgment of economic activity state. Comparing the responses of the basic survey to those of the supplementing survey, approximately 90% of the responses show discrepancies and this indicates the possibility of misclassification. Next, this paper suggests the extended unemployment indicators as alternative, based on the current survey. The extended unemployment indicators support the presence of significant amounts of hidden unemployed and underemployed. And, it is found that the analyses using those indicators are very useful for the investigation of many aspects of employment dynamics.

• Asian Pacific Journal of Cancer Prevention
• /
• v.17 no.8
• /
• pp.3711-3719
• /
• 2016

Drawbacks of conventional cancer treatments, with lack of specificity and cytotoxicity using current approaches, underlies the necessity for development of a novel approach, gene-directed cancer therapy. This has provided novel technological opportunities in vitro and in vivo. This review focuses on a member of an apoptosis inhibitor family, survivin, as a valuable target. Not only the gene but also its promoter are applicable in this context. This article is based on a literature survey, with especial attention to RNA interference as well as tumor-specific promoter action. The search engine and databases utilized were Science direct, PubMed, MEDLINE and Google. In addition to cell-cycle modulation, apoptosis inhibition, interaction in cell-signaling pathways, cancer-selective expression, survivin also may be considered as specific target through its promoter as a novel treatment for cancer. Our purpose in writing this article was to create awareness in researchers, emphasizing relation of survivin gene expression to potential cancer treatment. The principal result and major conclusion of this manuscript are that survivin structure, biological functions and applications of RNA interference systems as well as tumor-specific promoter activity are of major interest for cancer gene therapy.

• The Journal of Korean Institute for Practical Engineering Education
• /
• v.4 no.1
• /
• pp.72-79
• /
• 2012

Recently, the growth of the computer-related industries lead to the growth of the computer-aided education. Virtual training (VT) is one of the most interesting education methods. Many 3D models for the VT contents have been produced, but little research has been performed for the unified management system to promote the reuse of 3D models. This paper proposes the unified 3D model management system. The 3D model file formats are surveyed to find a format that can be easily used by many VT content production softwares. The 3D model files will be stored in a central DB server. The structure of the DB system will be designed for 3D models. The system provides an easy way to search and download a 3D model. With the proposed system, the reuse of 3D models is expected to be promoted.

• Spatial Information Research
• /
• v.18 no.1
• /
• pp.77-87
• /
• 2010

Spatio-temporal join operators are essential to the management of spatio-temporal data such as moving objects. For example, the join operators are parts of processing to analyze movement of objects and search similar patterns of moving objects. Various studies on spatio-temporal join queries in outdoor space have been done. Recently with advance of indoor positioning techniques, location based services are required in indoor space as well as outdoor space. Nevertheless there is no one about processing of spatio-temporal join query in indoor space. In this paper, we introduce continuous spatio-temporal self-join queries in indoor space and propose a method of processing of the join queries over stream data of moving objects. The continuous spatio-temporal self-join query is to update the joined result set satisfying spatio-temporal predicates continuously. We assume that positions of moving objects are represented by symbols such as a room or corridor. This paper proposes a data structure, called Candidate Pairs Buffer, to filter and maintain massive stream data efficiently and we also investigate performance of proposed method in experimental study.

• 한국지구물리탐사학회:학술대회논문집
• /
• 2003.11a
• /
• pp.390-397
• /
• 2003

A three-dimensional (3D) inversion technique has been developed for interpretation of magnetotelluric (MT) data. The inversion method is based on the linearized least-squares (Gauss-Newton) method with smoothness regularization. In addition to the underground 3D resistivity distribution, static shifts are also treated as unknown parameters in the inversion. The forward modeling is by the staggered-grid finite difference method. A Bayesian criterion ABle is applied to search the optimum trade-off among the minimization of the data misfit, model roughness and static shifts. The method has been applied to several MT datasets obtained at geothermal fields in Japan and other Asian countries. In this paper, two examples will be discussed: one is the data at the Ogiri geothermal area, southwestern Japan, and the other is at the Pohang low-enthalpy geothermal field, southeastern Korea. The inversion of the Ogiri data has been performed stably, resulting in a good fitting between the observed and computed apparent resistivities and phases. The recovered 3D resistivity structure is generally similar to the two-dimensional (2D) inversion models, although the deeper portion of the 3D model seems to be more realistic than that of the 2D model. The 3D model is also in a good agreement with the geological model of the geothermal reservoirs. 3D interpretation of the Pohang MT data is still preliminary. Although the fitting to the observed data is very good, the preliminary 3D model is not reliable enough because the station coverage is not sufficient for a 3D inversion.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.27 no.4
• /
• pp.229-249
• /
• 2016

This study was conducted to create a digital archive for local cultural contents compiled from the records of westerners who stayed in Korea during the Enlightenment Period of Chosun. The compiled information were gathered from 22 records, and 10 main subjects, 40 sub-subjects and 239 mini-subjects were derived through the subject classification scheme. Item analysis was conducted through 38 metadata and input data types were classified and databased in Excel. Finally, a web-based digital archiving system was developed for searching and providing information through various access points. Suggestions for future research were made to expand archive contents through continuous excavation of westerners' records, to build an integrated information system of Korean digital archives incorporating individual archive systems, to develop standardization of classification schemes and a multidimensional classification system considering facet structure in cultural heritage areas, to keep consistency of contents through standardization of metadata format, and to build ontology using semantic search functions and data mining functions.

• Journal of Korea Multimedia Society
• /
• v.9 no.2
• /
• pp.244-254
• /
• 2006

This paper presents an efficient hybrid technique to compact the trie indexing the huge forward table small enough to be stored into cache for speeding up IP lookup. It combines two techniques, an encoding scheme called bit-map and a controlled-prefix expanding scheme to replace slow memory search with few fast-memory accesses and computations. For compaction, the bit-map represents each index and child pointer with one bit respectively. For example, when one node denotes n bits, the bit-map gives a high compression rate by consumes $2^{n-1}$ bits for $2^n$ index and child link pointers branched out of the node. The controlled-prefix expanding scheme determines the number of address bits represented by all root node of each trie's level. At this time, controlled-prefix scheme use a dynamic programming technique to get a smallest trie memory size with given number of trie's level. This paper proposes standard that can choose suitable trie structure depending on memory size of system and the required IP lookup speed presenting optimal memory size and the lookup speed according to trie level number.

• International Journal of Highway Engineering
• /
• v.8 no.4 s.30
• /
• pp.159-179
• /
• 2006

By using the current road design method that is based on the regulation about structure and facilities standard of the road and the route plan guide of a national road and the alignment optimization road design method which is studied in the inside and outside of country, this study operate the route plan of the sample study and compare and analysis the route character, consequently the current design method has local optimization that is formed the plan by the stage and the section. Alignment optimization road design has the system optimal route search. But cost function has limite that caused by construction parameter that is not included in cost function. So we design a road route included cost function in main fields. As a result, we obtain a realistic and economically road route. The alignment optimization road design model has to be made up some problems, like the change of vertical gradient in the tunnel section, though this defects it has a lot of merits as a geometric design tool, especially in the feasibility study and the scheme design.

• Progress in Superconductivity
• /
• v.4 no.1
• /
• pp.42-47
• /
• 2002

Measuring magnetic fields with a SQUID sensor always requires preliminary adjustments such as optimum bas current determination and flux-locking point search. A conventional magnetoencephalography (MEG) system consists of several dozens of sensors and we should condition each sensor one by one for an experiment. This timeconsuming job is not only cumbersome but also impractical for the common use in hospital. We had developed a serial port communication protocol between SQUID sensor controllers and a personal computer in order to control the sensors. However, theserial-bus-based control is too slow for adjusting all the sensors with a sufficient accuracy in a reasonable time. In this work, we introduce programmatic control sequence that saves the number of the control pulse arrays. The sequence separates into two stages. The first stage is a function for searching flux-locking points of the sensors and the other stage is for determining the optimum bias current that operates a sensor in a minimum noise level Generally, the optimum bias current for a SQUID sensor depends on the manufactured structure, so that it will not easily change about. Therefore, we can reduce the time for the optimum bias current determination by using the saved values that have been measured once by the second stage sequence. Applying the first stage sequence to a practical use, it has taken about 2-3 minutes to perform the flux-locking for our 37-channel SQUID magnetometer system.

• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.427-432
• /
• 2005

Packet arrival rates in internet routers have been dramatically increased due to the advance of link technologies, and hence wire-speed packet processing in Internet routers becomes more challenging. As IP address lookup is one of the most essential functions for packet processing, algorithm and architectures for efficient IP address lookup have been widely studied. In this paper, we Propose an efficient I address lookup architecture which shows yeW good Performance in search speed while requires a single small-size memory The proposed architecture is based on multi-way tree structure which performs comparisons of multiple prefixes by one memory access. Performance evaluation results show that the proposed architecture requires a 280kByte SRAM to store about 40000 prefix samples and an address lookup is achieved by 5.9 memory accesses in average.