• Journal of the Korean Data and Information Science Society
• /
• v.18 no.4
• /
• pp.985-994
• /
• 2007

We note that the time of adolescents is very important time for obtaining informations about their jobs, exploring and making appropriate their career decision. In order to understand the career decision level of adolescents, we needed a study on effects of personal variables and family variables affecting the career decision level. For this, we provide direct, indirect and total effects of family variables and personal variables on the career decision level using the path analysis. Therefore, in this study, we give the real usefulness for making a different diagnosis and strategy solving some problems of career decision level.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1246-1249
• /
• 1993

In this paper, we propose an algorithm of obstacle avoidance using fuzzy inferences. After the basic idea of the path generation algorithm using piecewise polynomials is described, the obstacle avoidance problem using fuzzy inferences is considered. Main concept of the avoidance algorithm is to modify intermittent point data using fuzzy inferences and to generate the collision free path based on the modified data. Finally, simulation result demonstrate the effectiveness of the proposed algorithm.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.9
• /
• pp.663-670
• /
• 1988

Advances in VLSI technology have made it possible to have a larger number of processing elements to be included in highly parallel processor system. A system with a large number of processing elements and memory requires a complex data path. Multistage Interconnection networks(MINS) are useful in providing programmable data path between processing elements and memory modules in multiprocessor system. In this thesis, the performance of MINS for the star network has been analyzed and compared with other networks, such as generalized shuffle network, delta network, and referenced crossbar network.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.47-56
• /
• 2003

According to rapidly developed mobile terminals and network in the play environment for multimedia presentation, different end-to-end QoS situations appear. Then the generation of transcoding path algorithm was reviewed to transcode a source'data satisfying the needed QoS from a destination and play it considering given transcoders and network. This method used only workload as a parameter although two parameters, workload and throughput, were needed to process multimedia stream in a transcoder, Therefore generated transcoding path with this method had additional calculation to check playability whether it was safisfed the QoS of a destination or not. To solve the problem this paper suggests T algorithm with evaluation function using isochronous property that is needed for multimedia stream to arrive a destination. That means, most playable path is selected with heuristic search based isochronous property between many transcoding paths. Using the suggested algorithm, a transcoding path can be generated faster to play the multimedia data with different end-to-end QoS in real-time transmission.

• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.183-194
• /
• 2004

As XML is a do facto standard for a data exchange language, there have been several researches on efficient processing XML queries. The most important thing to consider when processing XML queries is how efficiently we can process path expressions in queries. Some previous works make results by performing a sequence of join operations on all records corresponding to labels in the path expression. Others works check the existence of paths in the query using an RDBMS's string comparison operator and make results by extracting the records corresponding to the paths. In this paper we suggested a new query planning algorithm based on path containment relationships and two join operators supporting the planning algorithm. The join operators use only the records related to the paths in a query as input data, scan them only once, and generate result data using a pipelining mechanism. By analysis and experiments, we confirmed that our techniques(a new query planning algorithm and two join operators) achieved significantly higher performance than other previous works.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.6
• /
• pp.40-53
• /
• 2018

In smart card data, movement of railway passengers appears in order of smart card terminal ID. The initial terminal ID holds information on the entering station's tag-in railway line, the final terminal ID the exit station tag-out railway line, and the middle terminal ID the transfer station tag subway line. During the past, when the metropolitan city rail consisted of three public corporations (Seoul Metro, Incheon Transit Corporation, and Korail), OD data was expressed in two metrics of initial and final smart card terminal ID. Recently, with the entrance of private corporations like Shinbundang Railroad Corporation, and UI Corporation, inclusion of entering transfer line terminal ID and exiting transfer line terminal ID as part of Chain OD has become standard. Exact route construction using Chain OD has thus become integral as basic data for revenue allocation amongst metropolitan railway transport corporations. Accordingly, path detection in railway networks has evolved to an optimal path detection problem using Chain OD, hence calling for a renewed solution method. This research proposes an optimal path detection method between the initial terminal ID and final terminal ID of Chain OD terminal IDs within the railway network. Here, private line transfer TagIn/Out must be reflected in optimal path detection using Chain OD. To achieve this, three types of link-based optimum path detection methods are applied in order of 1. node-link, 2. link-link, 3. link-node. The method proposed based on additional path costs is shown to satisfy the optimal conditions.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.11a
• /
• pp.101-106
• /
• 2010

As a part of preparing the sniffing attack, this routing method presented in this thesis decreases the risk rates of the leaking of information through separating valid data and transmitting by a multi-path. then data is transmitted from start node to destination node on distributed sensor network. The level of reduction in leaking of information by the sniffing attack is proved by experimental result thich compare the case described above with the case of transmitting whole data with the single path by simulation, and the algorithm for choosing the routing path is showed by proof of the theorem.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.12
• /
• pp.100-108
• /
• 2004

In reverse engineering, data acquisition methodology can generally be categorized into contacting and non-contacting types. Recently, researches on hybrid or sensor fusion of the two types have been increasing. In addition, efficient construction of a geometric model from the measurement data is required, where considerable amount of user interaction to classify and localize regions of interest is inevitable. Our research focuses on the classification of each bounded region into a pre-defined feature shape fer a hybrid measuring scheme, where the overall procedures are described as fellows. Firstly, the physical model is digitized by a non-contacting laser scanner which rapidly provides cloud-of-points data. Secondly, the overall digitized data are approximated to a z-map model. Each bounding curve of a region of interest (featured area) can be 1.aced out based on our previous research. Then each confined area is systematically classified into one of the pre-defined feature types such as floor, wall, strip or volume, followed by a more accurate measuring step via a contacting probe. Assigned to each feature is a specific digitizing path topology which may reflect its own geometric character. The research can play an important role in minimizing user interaction at the stage of digitizing path planning.

• IE interfaces
• /
• v.24 no.4
• /
• pp.447-456
• /
• 2011

Identifying the major moving patterns of shoppers' movements in the selling floor has been a longstanding issue in the retailing industry. With the advent of RFID technology, it has been easier to collect the moving data for a individual shopper's movement. Most of the previous studies used the traditional clustering technique to identify the major moving pattern of customers. However, in using clustering technique, due to the spatial constraint (aisle layout or other physical obstructions in the store), standard clustering methods are not feasible for moving data like shopping path should be adjusted for the analysis in advance, which is time-consuming and causes data distortion. To alleviate this problems, we propose a new approach to spatial pattern clustering based on longest common subsequence (LCSS). Experimental results using the real data obtained from a grocery in Seoul show that the proposed method performs well in finding the hot spot and dead spot as well as in finding the major path patterns of customer movements.

• Journal of Korean Academy of Nursing
• /
• v.34 no.2
• /
• pp.333-343
• /
• 2004

Purpose: This study was designed to construct a structural model for symptom management of life of the patients with chronic fatigue. The hypothetical model was developed based on the literature review and Self-regulating Model. Method: Data were collected by questionnaires from 252 patients with chronic fatigue in the 8 community from December 2002 to April 2003 in Seoul. Data analysis was done with SAS for descriptive statistics and PC-LISREL Program for Covariance structural analysis. Result: The fit of the hypothetical model to the data was moderate, thus it was modified by excluding 4 path and including free parameters and 3 path to it The modified model with path showed a good fitness to the empirical data($x^2$=318.11, p=0.0, GFI=.98, AGFI=.98, NNFI=.95, RMSR=.03, RMSEA=.05). The symptoms of stress, self-efficacy, and present fatigue level were found to have significant direct effect on symptom management of the patients with chronic fatigue. The ways of coping, perceived stress, and fatigue symptom were found to have indirect effects on symptom management of the patients with chronic fatigue. Conclusion: The derived model is considered appropriate in explaining and predicting symptom management of the patients with chronic fatigue. Therefore, it can effectively be used as a reference model for further studies and suggested direction in nursing practice.