• 한국경영과학회지
• /
• 제22권3호
• /
• pp.81-98
• /
• 1997

Given a rooted tree T with profits and node demands, the capacitated subtree of a tree problem (GSTP) consists of finding a rooted subtree of maximum profit, subject to having total demand no larger than the given capacity H. We first define the so-called critical item for CSTP and find an upper bound on the optimal value of CSTP in O(n$^{2}$) time, where n is the number of nodes in T. We then present our branch and bound algorithm for solving CSTP and illustrate the algiruthm by using an example. Finally, we implement our branch-and-bound algorithm and compare the computational results with those for both CPLEX and a dynamic programming algorithm. The comparison shows that our branch-and-bound algorithm performs much better than both CPLEX and the dynamic programming algorithm, where n and H are the range of [50, 500] and [5000, 10000], respectively.

• 대한지구과학교육학회지
• /
• 제3권1호
• /
• pp.47-54
• /
• 2010

The purpose of this study is finding examine the Thinking Maps and how to use Thinking Maps effectively in Science Education. The result of this study were as follows: First, There are 8 type Maps, Circle Map, Tree Maps, Bubble Map, Double Bubble Map, Flow Map, Multi Flow Map, Brace Map, Bridge Map. Each Maps are useful in the following activities ; Circle Map-Express their thoughts. Tree Map-Activities as like determine the structure, classification, information organization. Bubble Maps-Construction. Double Bubble Map-Comparison of similarities and differences. Flow Map-Set goals, determine the result of changes in time or place. Multi Flow Map-Analysis cause and effect, expectation and reasoning. Brace Map-Analysis whole and part. Bridge Map-Activities need analogies. Second, each element of inquiry has 1~2 appropriate type of Thinking Maps. So student can choose the desired map. Third, the result of analysing of Science Curriculum Subjects, depending on the subject variety maps can be used. Therefore the Thinking Maps can be used for a variety on activities and subject. And student can be selected according to their learning style. So Thinking Maps are effective to improve student's Self-Directed Learning.

• 한국가구학회지
• /
• 제22권4호
• /
• pp.270-277
• /
• 2011

This study aims to find new solutions to the problem of utilization of materials and techniques represented in the development of modern lighting design. LED is an important component in modern lighting design and pine tree is one of the most popular domestic wood in furniture design in Korea. In this study, design is developed into various types of furniture such as a table, a chest, and a lighting, by researching manufacturing process and examining the use of slicing pine tree. The technique of slicing pine tree is a simple linear arrangement that was traditionally used in wooden furniture in Lee dynasty, with an emphasis on repetitive rhythm. The slicing technology is used to expand the usage of domestic pine tree. The beauty of natural wood is expressed with the transmission of light by applying this technique to the lighting design. It also brings new communication in between artificial lighting and natural wood combining this traditional technique and LED lighting in design. Finally, this study suggests particular value through the convergence of analog and digital by using the traditional wooden technique that keeps natural wood prints and new digital technology by using LED lighting. More discussions and research about this subject are expected continuously through this study.

• 한국정보과학회논문지:데이타베이스
• /
• 제30권2호
• /
• pp.168-175
• /
• 2003

지금까지 문자열 데이타에 대한 선택도 추정은 문자열들의 등장 회수에 대한 정보를 저장하고 있는 '카운트 서픽스 트리'를 생성한 뒤, 이 트리를 이용하여 부분 문자열들의 선택도를 추정하는 방법으로 이루어졌다. 그런데, 문자열 데이타가 생물학 서열처럼 매우 길어질 경우 카운트 서픽스 트리를 생성하는 일은 거의 불가능해진다는 문제점이 발생한다. 이 논문에서는 길이가 q인 부분 문자열들만을 삽입한 '카운트 큐그램 트리'를 제안한다. 카운트 큐그램 트리는 서열 내의 길이가 q 이하인 모든 부분 문자열(큐그램) 들의 정확한 등장 회수를 저장하고 있으며, 문자열의 전체 길이 N에 상관없는 크기로, O(N) 시간에 생성 가능하다. 또한, 이 논문에서는 카운트 큐그램 트리를 이용한 'k번째 최대겹침' 추정 방법을 제시한다. 이 추정 방법은 질의 문자열을 길이 q인 부분 문자열로 나눌 때 부분 문자열들의 겹치는 정도 k를 선택할 수 있도록 한 방법으로 이전 연구에서 제시한 '최대겹침' 방법을 확장하였다. q와 k를 변화시키며 진행한 실험 올 통해 대부분의 경우에 매우 정확하게 선택도를 추정할 수 있음을 확인하였다.

• 한국산림과학회지
• /
• 제96권2호
• /
• pp.160-169
• /
• 2007

The data used to develop distance-independent individual models for natural mixed forests were collected from 712 remeasured permanent sample plots (25,526 trees) of 10-year periodic from 1990 to 2000 in Baihe Forest Bureau of Changbai Mountains, northeast China. Based on analyzing relationship between diameter increment of individual trees with tree size, competitive status, and site condition, the diameter growth models for individual trees of 15 species growing in mixed-species uneven-aged forest stands, that have simple form, good predicting precision, and easily applicable, were developed using stepwise regression method. The main variables influencing on diameter increment of individual trees were tree size and competition, however, the site conditions were not significantly related with diameter increment. The tree size variables (lnDBH and $DBH^2$) were the most significant and important predictors of diameter growth existing in all 15 growth models. The diameter increment was directly proportional to tree diameter for each species. For the competitive factors in growth model, the relative diameter (RD), canopy closure (P), and the ratio of diameter of subject tree with maximum diameter (DDM) were contributed to the diameter increment at a certain extent. Other measures of stand density, such as basal area of stand (G) and stand density index (SDI), were not significantly influenced on diameter increment. Site factors, such as site index, slope and aspect were not important to diameter increment and excluded in the final models. The total variance explained by the final models of squared diameter increment ($R^2$) for all 15 species ranged from 35% to 72% and these results compared quit closely with those of Wykoff (1990) for mixed conifer stands. Using independent data set, validation measures were evaluated for predicting models of diameter increment developed in this study. The result indicated that the estimated precision was all greater than 94% and the models were suitable to describe diameter increment.

• Journal of Internet Technology
• /
• 제20권5호
• /
• pp.1535-1545
• /
• 2019

Recently, the diverse kinds of applications in multimedia computing have been developed for visual surveillance, healthcare, smart cities, and security. Video conferencing is one of core applications among multimedia applications. The Quality of Service of video conferencing is a major issue, because of limited network traffic. Video conferencing allow a large number of users to converse with each other. However, the huge amount of packets are generated in the process of transmitting and receiving the photographed images of users. Therefore, the number of packets in video conferencing needs to be reduced. Video conferencing can be conducted in virtual reality by sending only the control signals of virtual characters and showing virtual characters based on the received signals to represent the users, instead of the photographed images of the users, in real time. This paper proposes a method that determines representative photographed images by analyzing the collected photographed images of users, using KMedoids algorithm and a decision tree, and expresses the users based on the analyzed images. The decision tree used for video conferencing are generated automatically using the proposed method. Given that the behaviors in the decision tree is added or changed considering photographed images, it is possible to reproduce the decision tree by photographing the behavior of the user in real-time. In an experiment conducted, 63 consecutively photographed images were collected and a decision tree generated by using the silhouette images of the photographed images. Indices of the silhouette images were utilized to express a subject and one index was selected using a decision tree. The proposed method reduced the number of comparisons by a factor of 3.78 compared with the traditional method that uses correlation coefficient. Further, each user's image could be outputted by using only the control image table of the image and the index.

• 한국환경복원기술학회지
• /
• 제15권3호
• /
• pp.45-54
• /
• 2012

This study intended to analyze growth condition of each object by protected tree's ground for 45 places registered to Pyeongtaek protected tree list in locational characteristics, conduct exchange analysis for impediment extent rate in crown area and tree type to the result and suggest the measures to manage artificial impediment which is an effect on protected tree condition. In this study, the tree whose area of impediment for crown area is less than 21% is tree condition of grade 1~2, less than 21~50% is grade 2~3 and more than 50% is grade 3~5. The more impediment is, the more inconvenience causes on growth and development. So, it verified that the area rate must maintain less than 21% for the root system management of protected tree. For the standard of managing artificial impediment which is an effect on the tree condition of protected trees, the below matters intend to be suggested. The first, the impediment in crown area should be less than 21%. But, if there is not artificial impediment out of crown area, the rate of impediment area is considered to increase somewhat. The second, growth space of protected tree should be maintained by crown area at least and impediment should be established out of the crown area. The third, during the national project and land development, surroundings of protected tree must be applied as park, resting place, etc. and the establishment area of impediment (artificial impediment and natural impediment) in crown area must be limited. The forth, publicity for regional people (especially, land owner) is necessary for the protection of natural inheritance and the value of dependence on local government and village which are the subject of management must be announced widely through the internet media, etc, so its importance must be recognized. The fifth, the matters related to protected tree management must be able to limit artificial damage which is for surroundings of protected tree through the mutual connection among the local governments; construction, civil engineering, architecture, water and sewage, agriculture and forest and others. Also, following studies on the effects of kinds, thickness, etc. of impediment around the protected tree on trees should be continued.

• 한국실내디자인학회논문집
• /
• 제20권6호
• /
• pp.311-320
• /
• 2011

Public libraries in Korea have undergone changes from libraries for just reading or keeping books to libraries with cultural facilities that provide information through various media. It was because of the "plan for building the information-oriented library" in 2000 that made the complexation of public library in progress. The alterations of the system have changed the structure as well as the grade ranks but haven't been considered enough for administrators or visitors. Hereupon, we are to study of the features by analyzing how the application of the system changed the structure of library. There are four stages in research methods. First, concept of public library and functional elements requested in the process of complexation were studied from literature. Second, vertical, horizontal and circulate changes were studied by applying subject libraries into prior research stereotyping the libraries. Third, mutual relations between each place were studied through J-Graph by elements. Lastly, rank changes according to centrality of space and users were quantitatively studied with space syntax. 4 notable changes were found in these analyses. (1)Vertical, horizontal and circulate structure of public libraries were homogenized. Since 2001, however, they have become diversified as all-in-one or detachable. (2)The space structure of library before 2001 was shallow tree shape while in 2001, period of transition, was the tree shape mixed with ring shape. As time goes on, it has become shallow tree shape again but connected by ring shape in part of reading and common space and in digital reference room. (3)Digital reference room was center of the space around 2001 and it ranked top for integration. After 2007, however, it has become setting off-center. (4)About the purpose of using public libraries, using it as space for administrators ranked top followed by space for visitors and common space before. For now, common space ranks top and space for visitors and administrators. 5 subject public libraries were selected respectively before and after 2001.

• 한국멀티미디어학회논문지
• /
• 제7권12호
• /
• pp.1729-1736
• /
• 2004

This paper proposes an efficient collision detection method in the dynamic spatial subdivisions for the MMORPG engine which requires realtime interactions. An octree is a suitable structure for static scenes or terrain processing. An octree spatial subdivision enhances rendering speed of scenes. Current spatial subdivisions tend to be highly optimized for efficient traversal, but are difficult to update quickly for a changing geometry. When an object moves to the outside extent for the spatial subdivisions, the acceleration structure would normally have to be rebuilt. The OSP based on a tree is used to divide dynamically wide outside which is the subject of 3D MMORPG. TBV does not reconstruct all tree nodes of OSP and has reduced rebuilding times by TBV information of a target node. A collision detection is restricted to those objects contained in the visibility range of sight by using the information established in TBV. We applied the HBV and ray tracing for an efficient collision detection.

• 경영과학
• /
• 제22권2호
• /
• pp.99-107
• /
• 2005

Recently, Tang and Chanson proposed a minimum cost distribution model for replicated Web contents subject to an expiration-based consistency management. Their model is a progress in that it can consider multiple replicas via the network of servers located on the Web. The proposed greedy heuristic, however, has an undesirable feature that the solution tends to converge a local optimum at an early stage of the algorithm. in this paper, we propose an algorithm based on a simple idea of preventing the early local convergence. The new algorithm provides solutions whose cost are, on the average, 27$\%$ lower than in the previous algorithm.