• Journal of information and communication convergence engineering
• /
• 제21권1호
• /
• pp.54-61
• /
• 2023

The family tree is one of the key elements of humanities classics research and is very important for accurately understanding people or families. In this paper, we introduce a method for automatically generating a family tree using information on interpersonal relationships (IIPR) from the Korean Classics Database (KCDB) and visualize interpersonal searches within a family tree using data-driven document JavaScript (d3.js). To date, researchers of humanities classics have wasted considerable time manually drawing family trees to understand people's influence relationships. An automatic family tree builder analyzes a database that visually expresses the desired family tree. Because a family tree contains a large amount of data, we analyze the performance and bottlenecks according to the amount of data for visualization and propose an optimal way to construct a family tree. To this end, we create an n-ary tree with fake data, visualize it, and analyze its performance using simulation results.

• 디지털융복합연구
• /
• 제12권2호
• /
• pp.495-501
• /
• 2014

본 연구는 앞서 가족이야기(familyStory)를 중심으로 인터렉티브 스토리텔링을 지원하는 데이터의 서술구조연구를 바탕으로 가족콘텐츠 스토리족보 저작시스템 설계 및 구현에 대한 연구이다. 한 인간이 태어나서 가지게 되는 이름, 생년월일, 가계도와 같이 정체성 있는 1차적 정보와 본인과 가족구성원이 경험하는 업적, 에피소드, 경험 등의 2차적 정보를 '가족콘텐츠'라고 정의한다. 본 저작 시스템에서 제시하는 '스토리가 있는 가계도(족보)'를 한 줄로 정의하면 가계도에 스토리텔링을 적용하여 가족스토리를 만드는 것으로, 현존하는 1세대가 생존기간 동안 한 가족의 광범위한 역사를 이후 세대들에게 남기는 것으로서 매우 가치 있고 중요한 일이다. 가족콘텐츠 스토리족보 저작도구는 1,2세대의 경험적 지식의 이야기를 텍스트, 이미지, 영상 등 디지털 매체를 사용하여 쉽게 저작할 수 있으며, 저작된 다양한 장르의 가족이야기를 가지고 3세대와의 소통을 위한 도구로 활용하거나, 이야기를 재구성하여 창작이야기를 작성하는데 활용 가능하다.

• 전기학회논문지
• /
• 제59권12호
• /
• pp.2329-2336
• /
• 2010

Hierarchical tree routing is a inefficient routing method of transmitting data in a wireless sensor network. Zigbee routing which is made to improve inefficiency of the hierarchical tree routing only fulfills the tree routing when a destination node don't exists in neighbor nodes of a router. We suggest a TFSR algorithm that is improved more than the zigbee routing. The TFSR algorithm generates a family set included a parent node and child nodes and over of a destination node, and uses this information. According to simulation results, the TFSR algorithm reduce routing costs over 30 percent in comparison with the hierarchical tree routing and the zigbee routing.

• 한국자원식물학회지
• /
• 제19권6호
• /
• pp.677-679
• /
• 2006

The objectives of this study were to examine the genetic variation of 20-year-old tree height and to estimate heritabilities and genetic gains of Korean white pine. Analysis of variance showed that families and family x block interaction had the significant (p=0.01) effects on tree height. However, family variation appears to be much greater than the variation due to family x block interaction. Individual tree heritability was higher ($h_I^2=0.73$) than family heritability, ($h_F^2=0.83$) therefore, combined selection showed the largest genetic gain (17.76%) in a given equal intensity of selection.

• 한방재활의학과학회지
• /
• 제18권3호
• /
• pp.187-199
• /
• 2008

Objectives : The purpose of this study is to report the concept of familial scoliosis through eight cases. Methods : The family tree was constructed with eight cases which was diagnosed idiopathic scoliosis by physical examination and radiological study. Results : According to the family tree of this sibs, idiopathic scoliosis apparently behaves as an autosomal dominant inheritance. As to parents and grandparents, although they are not confirmed the appearance of idiopathic scoliosis, we know that they transmit trait to their descendants as a genotype. Conclusions : This study is shown that idiopathic scoliosis has a familial condition and provided useful information that can be used early diagnosis and treatment with screen tests based on the family tree.

• 한국생활과학회지
• /
• 제17권6호
• /
• pp.1065-1077
• /
• 2008

The purpose of this study was to verify whether BND test was an appropriate tool for diagnosis of attachment security and to investigate difference of responsive Characteristics to the Bird's Nest Drawings according to parents attachment degree. The subjects in the study were 525 students, selected from senior high schools in D-city. The instruments used were parents attachment scale and Bird's Nest Drawings, and Discriminant analyses and crosstab analyses were used. The results were as follows. First, attachment indicators in the Bird's Nest Drawings discriminated according to group of parents attachment. Second, for male student, there was a significant difference placement nest, eggs, entire birds family, quality of line and tree picture according to attachment to father. For female student, there was a significant difference eggs, entire birds family, quality of line and tree picture according to attachment to father. For male student, there was a significant difference nest contents, placement nest, eggs, entire birds family, quality of line and tree picture according to attachment to mother. For female student, placement nest, space, nest size, eggs, entire birds family and quality of line according to attachment to mother.

• 대한산업공학회지
• /
• 제37권3호
• /
• pp.191-197
• /
• 2011

The group Steiner tree problem is a generalization of the Steiner tree problem that is defined as follows. Given a weighted graph with a family of subsets of nodes, called groups, the problem is to find a minimum weighted tree that contains at least one node in each group. We present some existing and some new formulations for the problem and compare the relaxations of such formulations.

• 가정과삶의질연구
• /
• 제22권4호
• /
• pp.43-61
• /
• 2004

The purpose of this study was to verify the usefulness of kinetic House- Tree- Person drawing as a diagnostic measure for the degree of self-differentiation, which is an essential part of college students' development. Participants for the study were four hundred thirty five(272 male and 163 female) university freshmen enrolled in 4-year colleges located in Pusan. The Participants completed a scale of self-differentiation and a Kinetic House- Tree-Person drawings test. The evaluation system for kinetic House-Tree-Person drawings was established based on the indexes of Buck(1948) and Bums(1972) and used exiting literatures as reference. The data were analyzed using means, standard deviations, t-test, one-way ANOVA, and Scheffe's test. The results obtained from the study are as follows: First, the mean level of college students' self-differentiation was 2.81, which is about average. Some significant gender differences were found in the areas of self-intergration, family projection, and emotional separation. Male students scored higher on self-intergration, whereas female students score higher on family projection and emotional separation. Second. self-differentiation was higher when the student drew a house with smoke coming out of the chimney, a single-story house with flat roof, or with detailed description of curtains, roof and roof tiles. Third, self-differentiation seemed to be higher when branches and fruits were included, when there was no expression of roots, when large crowns and branch openings were presented, and when no slant lines or base lines appeared. Forth, self-differentiation showed ㅁ higher level when the portrait shows eyes, mouth and neck without omission, when it included the whole body instead of face only, and when there was no person with just a profile, a back, or with a stiff posture, and when there was no weak and thin lines. Individuality also marked higher if a person was in motion and than one person was added. Finally, self-differentiation showed significant difference according to the overall harmony of the drawing, ordering of contents, hand pressure, the kind and shape of tree, and presence of other persons. The more harmonious the picture was, and the more family members are added, the higher the level of self-differentiation was.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2008년도 추계학술대회 및 정기총회
• /
• pp.430-434
• /
• 2008

The group Steiner tree problem is a generalization of the Steiner tree problem that is defined as follows. Given a weighted graph with a family of subsets of nodes, called groups, the problem is to find a minimum weighted tree that contains at least one node in each group. We present some existing and some new formulations for the problem and compare the relaxations of such formulations.

• 한국안전학회지
• /
• 제11권1호
• /
• pp.16-26
• /
• 1996

A.Satyanarayana와 다른이들은 [1.2.5]에서 domination이론을 사용하여 네트워크의 정확한 신뢰도 계산을 위한 새로운 topologic formel을 발견하였다. 이들은 이식을 통하여 그래프 G로 표현되는 어떤 시스템이나 네트워크의 신뢰도 계산을 위하여 path 또는 k-tree를 사용한 Inclusion-Exclusion식에 나타나는 항들(=2$^{m}$ -1, m은 path나 k-tree의 수)중 서로 소거되지 않는 항들은 그래프 G의 acyclic k-부분그래프(subgraph)와 1대 1로 상응되며, cyclic-과 k-부분그래프들에 상응되는 항들은 소거되어지거나 Inclusion-Exclusion식에 나타나지 않는 -결국 신뢰도계산에 필요없는- 항들임을 밝혔다. 이들은 이성질을 이용하여 그래프 G의 정확한 신뢰도계산을 위한 빠른 알고리즘을 제시하였다. 이 알고리즘은 결국 그래프 G의 path나 k-tree를 기초로 하는 Inclusion-Exclusion식에서 나타나는 항들중 소거되지 않는 항들에 1:1로 대응하는 acyclic k-subgraph만을 찾아 신뢰도계산을 할수있게 하여 준다. 이때 acyclic k-subgraph들은 각각의 domination을 갖으며, 이들은 Inclusion-Exclusion식에서 대응되는 항의 부호들의 합과 같다. 본 논문에서는 첫째로 신뢰도계산을 위하여 주어진 어떤 그래프 G에서 G를 구성하는 선(edge)을 기초로 하는 어떤 임의로 주어진 family M(G) (예: cutset이나 path, 또는 k-tree 등의 family)에 의한 (부분)그래프의 domination에 대한 성질을 관찰하고 몇가지 식을 유도한후, k-tree의 family K(G)를 기초로 한 어떤 그래프의 domination과 Inclusion-Exclusion식과의 관계를 고찰하고, 이식의 강력함과 응용의 가능성을 A. Satyanarayana의 topologic formel의 재증명을 통하여 보인다.