• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.2
• /
• pp.177-185
• /
• 2010

Ray-object intersection is an important element in ray tracing that takes up a substantial amount of computing time. In general, such spatial data structure as kd-tree has been frequently used for static scenes to accelerate the intersection computation. Recently, a few variants of kd-tree traversal have been proposed suitable for the GPU that has a relatively restricted computing architecture compared to the CPU. In this article, we propose yet another two implementation techniques that can improve those previous ones. First, we present a cached stack method that is aimed to reduce the costly global memory access time needed when the stack is allocated to global memory. Secondly, we present a rope-with-short-stack method that eases the substantial memory requirement, often necessary for the previous rope method. In order to show the effectiveness of our techniques, we compare their performances with those of the previous GPU traversal methods. The experimental results will provide prospective GPU ray tracer developers with valuable information, helping them choose a proper kd-tree traversal method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.143-146
• /
• 2008

For tracing tag locations, a trajectories should be modeled and indexed in radio frequency identification (RFID) systems. The trajectory of a tag can be represented as a line that connects two spatiotemporal locations captured when the tag enters and leaves the vicinity of a reader. If a tag enters but does not leave a reader, its trajectory is represented only as a point captured at entry and we should extend the region of a query to find the tag that remains in a reader. In this paper, we propose an interval data model of tag's trajectory in order to solve the problem. For the interval data model. we propose a new index scheme called the IR-tree(Interval R-tree) and algorithms of insert and split for processing query efficiently. We also evaluate the performance of the proposed index scheme and compare it with the previous indexes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1B
• /
• pp.17-26
• /
• 2005

RFID(Radio Frequency IDentification) is a technology that automatically identifies objects attached with electronic tags by using radio wave. For the implementation of an RFID system, an anti-collision algorithm is required to identify several tags within the RFID reader's range. Few researches report the performance trade-off among anti-collision algorithms in terms of the communications traffic between the reader and tags, the identification speed, and so on. In this paper, we analyze both tree based memoryless algorithms and slot aloha based algorithms that comprise of almost every class of existing anti-collision algorithms. To compare the performance, we evaluated each class of anti-collision algorithms with respect to low-cost RFID system with 96-bit EPC(Electronic Product Code). The results show that the collision tracking tree algorithm outperforms current tree based and aloha based algorithms by at least 2 times to 50 times.

• Journal of KIISE:Software and Applications
• /
• v.26 no.12
• /
• pp.1418-1427
• /
• 1999

시간지원 데이타베이스 시스템은 자료의 과거 및 현재, 그리고 미래의 상태까지 관리함으로써, 사용자에게 시간에 따라 변화하는 자료에 대한 저장 및 질의 수단을 제공한다. 시간지원 데이타베이스는 경향 분석, 버전 관리, 의료 기록 관리 및 비디오 데이타 관리 등과 같이 자료의 시간적 특성이 중요시 되는 모든 분야에 폭 넓게 응용될 수 있다. 시간지원 데이타베이스에서의 집계는 시간 애트리뷰트를 고려하지 않은 기존의 집계와는 큰 차이가 있으며, 기존의 집계 처리 기법을 이용하여 효과적으로 처리될 수 없다. 본 논문에서는 시간지원 집계를 효율적으로 처리하기 위한 새로운 자료 구조인 PA-트리를 제안하고, 이를 이용한 시간지원 집계 처리 기법을 제안한다. 또한 본 논문에서는 제안된 PA-트리를 이용한 기법과 기존의 집계 트리를 이용한 기법의 성능을 최악 경우 분석과 실험을 통해 비교한다.Abstract Temporal databases manage time-evolving data. They provide built-in supports for efficient recording and querying of temporal data. Many application area such as trend analysis, version management, and medical record management have temporal aspects, and temporal databases can handle these temporal aspects efficiently. The aggregate in temporal databases, that is, temporal aggregate is an extension of conventional aggregate on the domain and range of aggregation to include time concept. The basic techniques behind computing aggregates in conventional databases are not efficient when applied to temporal databases. In this paper, we propose a new tree structure for temporal aggregation, called PA-tree, and aggregate processing method based on the PA-tree. We compare the PA-tree with the existing aggregation tree which has been proposed for temporal aggregate.

• The Journal of Information Systems
• /
• v.29 no.2
• /
• pp.287-306
• /
• 2020

Purpose Youth unemployment is a social problem that continues to emerge in Korea. In this study, we create a model that predicts the employment of college graduates using decision tree, random forest and artificial neural network among machine learning techniques and compare the performance between each model through prediction results. Design/methodology/approach In this study, the data processing was performed, including the acquisition of the college graduates' vocational path survey data first, then the selection of independent variables and setting up dependent variables. We use R to create decision tree, random forest, and artificial neural network models and predicted whether college graduates were employed through each model. And at the end, the performance of each model was compared and evaluated. Findings The results showed that the random forest model had the highest performance, and the artificial neural network model had a narrow difference in performance than the decision tree model. In the decision-making tree model, key nodes were selected as to whether they receive economic support from their families, major affiliates, the route of obtaining information for jobs at universities, the importance of working income when choosing jobs and the location of graduation universities. Identifying the importance of variables in the random forest model, whether they receive economic support from their families as important variables, majors, the route to obtaining job information, the degree of irritating feelings for a month, and the location of the graduating university were selected.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.14 no.1
• /
• pp.1-13
• /
• 1986

The purpose of this study is to investigate the effect of temperature control by a shade tree and the lawn area. In this investigation, we find out that artificial-lawn, concerte, and exposed soil are more higher temperature than covered with plant materials. The results of the measurement may to summerized as follows; 1) Low-temperature effects of zoysia japonica is more controlled by condition of growth than leaf length of grass. Surface temperature make 0.7$^{\circ}C$ difference between long grass (15cm), and short grass (5cm), but make 5$^{\circ}C$ difference between good growth grass (230/10$\textrm{cm}^2$) and bad growth grass (80/10$\textrm{cm}^2$). 2) The surface temperature of the lawn area is 40.5$^{\circ}C$ lower on a maxinum than that of the artificial lawn (July 28, 1985). During the day of summer, shade area under the shade tree is 0.9$^{\circ}C$ lower then lawn area surface temperature, 6.9$^{\circ}C$ lower than bad growth lawn, 10.3$^{\circ}C$ lower than exposed soil, and 18$^{\circ}C$ lower than concrete surface temperature. 3) Natural irrigation effect on the surface temperature fluctuation. But this effect is changed by compositions of ground materials and time-lapse. 4) Sunny day is more effective than cloud day. 5) In summer season, surface temperature make a difference compare to temperature of 0.5-1.5m height from ground : Surface temperature is 3.4$^{\circ}C$ lower at the lawn area (11 a.m.), 4.2$^{\circ}C$ lower at the shade area the shade tree, 12.7$^{\circ}C$ higher at the concrete area (3p.m.), 38.8$^{\circ}C$ higher at the artificial lawn (2p.m.) 6) According to compositions of ground materials and season have specific vertical temperature distribution curve. 7) In summer season, temperature distribution of 0.5-1.5m hight at the shade tree is 4.8-5.7$^{\circ}C$ lower than concrete area (noon-3p.m.)

• Journal of Korean Academy of Nursing
• /
• v.51 no.1
• /
• pp.40-53
• /
• 2021

Purpose: The purpose of this study was to develop and compare the prediction model for suicide attempts by Korean adolescents using logistic regression and decision tree analysis. Methods: This study utilized secondary data drawn from the 2019 Youth Health Risk Behavior web-based survey. A total of 20 items were selected as the explanatory variables (5 of sociodemographic characteristics, 10 of health-related behaviors, and 5 of psychosocial characteristics). For data analysis, descriptive statistics and logistic regression with complex samples and decision tree analysis were performed using IBM SPSS ver. 25.0 and Stata ver. 16.0. Results: A total of 1,731 participants (3.0%) out of 57,303 responded that they had attempted suicide. The most significant predictors of suicide attempts as determined using the logistic regression model were experience of sadness and hopelessness, substance abuse, and violent victimization. Girls who have experience of sadness and hopelessness, and experience of substance abuse have been identified as the most vulnerable group in suicide attempts in the decision tree model. Conclusion: Experiences of sadness and hopelessness, experiences of substance abuse, and experiences of violent victimization are the common major predictors of suicide attempts in both logistic regression and decision tree models, and the predict rates of both models were similar. We suggest to provide programs considering combination of high-risk predictors for adolescents to prevent suicide attempt.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.3
• /
• pp.17-28
• /
• 2008

The Steiner arborescence problem is known to be NP-hard. The objective of this problem is to find a minimal Steiner tree which starts from a designated node and spans all given terminal nodes. This paper proposes a method based on a two-step procedure to solve this problem efficiently. In the first step, graph reduction rules eliminate useless nodes and arcs which do not contribute to make an optimal solution. In the second step. ant colony algorithm with use of Prim's algorithm is used to solve the Steiner arborescence problem in the reduced graph. The proposed method based on a two-step procedure is tested in the five test problems. The results show that this method finds the optimal solutions to the tested problems within 50 seconds. The algorithm can be applied to undirected Steiner tree problems with minor changes. 18 problems taken from Beasley are used to compare the performances of the proposed algorithm and Singh et al.'s algorithm. The results show that the proposed algorithm generates better solutions than the algorithm compared.

• Journal of the Ergonomics Society of Korea
• /
• v.25 no.2
• /
• pp.161-172
• /
• 2006

This study aims to compare and contrast the Kansei modeling methods for building a luxuriousness model that people feel about appearance of mobile phones. For the evaluation based on Kansei engineering approaches, 15 participants were employed to evaluate 18 mobile phones using a questionnaire. The results of evaluation were analyzed to build luxuriousness models through quantification I method, neural network, and decision tree method, respectively. The performance of Kansei modeling methods was compared and contrasted in terms of accuracy and predictability. The result of comparison of modeling methods indicated that model accuracy and predictability was closely related to the number of variables and data size. It was also revealed that quantification I method was the best in terms of model accuracy while decision tree method was the best modeling method with small variance in terms of predictability. However, it was empirically found that quantification I method showed extremely unstable predictability with small number of data. Consequently, it is expected that the research findings of this study might be utilized as a guideline for selecting proper Kansei modeling method.

• Proceedings of the KIEE Conference
• /
• 1991.11a
• /
• pp.435-438
• /
• 1991

This work is aimed to clarify the effect of only crosslinking of polyethylene on the water tree propagation and thus the crosslinking of LDPE was made by use of $Co^{60}$ $\gamma$-ray irradiation at room temperature. For this purpose, before water tree testing under same test conditions, injection molded samples were made of LDPE using CNRS laboratory model and also some of them were irradiated under different dose rate for crosslinking. Afterwards, the aged specimens were put into microscopic investigation as a mean to compare their different morphological aspects by use of SEM for the fractured surface. The SEM observation points out that the untreed region in the irradiated PE shows the densed structure whereas that in the LDPE is not closely packed. Also in the water treed region of LDPE, the density and the dimension of voids are higher than those in irradiated PE. Based on our results, it seems that the difference in the PE structure could sufficiently contribute to cause the different water tree propagation of these materials.