• The Journal of Korean Obstetrics and Gynecology
• /
• v.21 no.1
• /
• pp.179-198
• /
• 2008

Purpose: Obesity is already a major clinical problem in Korea, so obesity prevention and treatment practices are gradually interested in Korean Medicine doctors. Moreover subjective body shape image entered as a important medical topic recently. To make a graph system for clinical tool which based on the Korean national standard physical scale. Methods: Physical data of the girth of upper arm, abdomen, hip, buttock, flank, calf, and body weight were statistically analyzed, which collected through the fifth national standard physical scale research. And then reviewed those statistical validation. Results: Relationship of the each body scale data and those graphs were fit and right statistically. Conclusion: These new achieved graph system of Korean standard body scales could be adopt as a useful clinical tool for body image related patients such as obesity, PCOD and postpartum patient.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.6
• /
• pp.2021-2026
• /
• 2013

Let G = (V,E) be a graph. A function $f:V{\rightarrow}\{-1,+1\}$ defined on the vertices of G is a signed total dominating function if the sum of its function values over any open neighborhood is at least one. The signed total domination number of G, ${\gamma}^s_t(G)$, is the minimum weight of a signed total dominating function of G. In this paper, we study the signed total domination number of generalized Petersen graphs P(n, 2) and prove that for any integer $n{\geq}6$, ${\gamma}^s_t(P(n,2))=2[\frac{n}{3}]+2t$, where $t{\equiv}n(mod\;3)$ and $0 {\leq}t{\leq}2$.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.777-780
• /
• 2004

본 논문은 여러 개체의 생물체 궤적을 효과적으로 추적하기 위해 Hungarian Algorithm을 이용한다. 생물체 궤적 정보와 생물체의 좌표 정보로 Weighted bipartite graph를 구성한다. weight는 궤적 정보와 좌표 정보의 거리, 속도, 각도를 비교하여 계산한다. 구성된 graph를 Hungarian Algorithm로 계산하여 가장 효율적인 matching이 이루어지도록 한다. 실제 생물체를 관찰하고 얻어진 데이터를 이용하여 실험을 하고, 제안한 방법의 효율성을 검증한다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.2
• /
• pp.338-346
• /
• 1987

This paper describes a method for verifying whether a given geometrical layout correcdtly reflects the original logic level description. The logic description extracted from layout data was directly compadred with the original logic diagram generated at logic level design stage where the logic diagram is represented as a weighted multi-place graph. The comparison is based on graph isomorphism and error messages(error categories and locations)are invoked if any difference is found between the two logic descriptions. An efficient partitioning algorithm which consists of two steps, candidate selection and equal weight partitioning procedure, enables the entire verification process to occur in O(n log n) time.

• Journal of the Economic Geographical Society of Korea
• /
• v.15 no.3
• /
• pp.343-357
• /
• 2012

The Seoul metropolitan subway system can be represented by a graph which consists of nodes and edges. In this paper, we study classification of subway stations and trip behaviour of subway passengers through partitioning the graph of the subway system into roughly equal groups. A weight of each edge of the graph is set to the number of passengers who pass the edge, where the number of passengers is extracted from the transportation card transaction database. Since the graph partitioning problem is NP-complete, we propose a heuristic algorithm to partition the subway graph. The heuristic algorithm uses one of two alternative objective functions, one of which is to minimize the sum of weights of edges connecting nodes in different groups and the other is to maximize the ratio of passengers who get on the subway train at one subway station and get off at another subway station in the same group to the total subway passengers. In the experimental results, we illustrate the subway stations and edges in each group by color on a map and analyze the trip behaviour of subway passengers by the group origin-destination matrix.

• The Journal of Korean Physical Therapy
• /
• v.21 no.2
• /
• pp.23-29
• /
• 2009

Purpose: This study examined the effects of the symmetrical scapular alignment on the weight bearing of hemiplegic patients in the standing position. Methods: PALM (PALpation Meter) test and Gaitview AFA-50 were used to measure the skeletal alignment of the scapula and the weight bearing loaded on the affected and unaffected sides before and after training. The data was analyzed using a paired t-test on the SPSS 12.0 program for descriptive statistics. A p value <0.05 was considered significant. Results: The mean difference in the scapular alignments on sup. & mid. & inf. area in the hemiplegic side before and after training was $0.93\pm0.50cm$ and $0.58\pm0.43cm$, respectively. There was a significant decrease after training rather than that before (p<0.05). The mean weight bearing on the foot area in the hemiplegic patients before and after training was $9.12\pm5.51N/cm^2$ and $4.36\pm4.11N/cm^2$, respectively,. There was a significant decrease after training rather than that before (p<0.05). The scapuar alignments and weight bearing data on the standing position were grouped around the average (to central point) in the distribution graph. Conclusion: These findings suggest that the symmetrical scapular alignment can serve as an effective means of improving the weight bearing ability of hemiplegic patients.

• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.974-983
• /
• 2005

In genetic algorithms with lotus-based encoding, static gene reordering is to locate the highly related genes closely together. It helps the genetic algorithms to create and preserve the schema of high-quality effectively. In this paper, we propose a static reordering framework for linear locus-based encoding. It differs from existing reorderings in that it is independent of problem-specific knowledge. It makes a complete graph where weights represent the interelationship between each pair of genes. And, it transforms the graph into a unweighted sparse graph by choosing the edges having relatively high weight. It finds a gene reordering by graph search method. Through the wide experiments about several problems, the method proposed in this paper shows significant performance improvement as compared with the genetic algorithm that does not rearrange genes.

• Korean Journal of Community Nutrition
• /
• v.8 no.2
• /
• pp.220-230
• /
• 2003

The purpose of this study was to investigate consumer preferred formats of nutrition labels: the type of nutritional information provided on the labels. A survey was conducted on 222 housewives between the age of 20 and 65 in Daejeon city in 1998, using an interview questionnaire showing illustrated nutritional label formats. Among twelve nutrients and caloric values listed on the nutrition labels, the housewives ranked their interest in the items in the following order of calorie (58.56%), calcium (56.76%), cholesterol (54.05%), protein (39.19%) and vitamin C (36.04%). The majority of the subjects (69.37%) checked labels when they bought milk or dairy products, whereas only 8.11% looked at labels when they bought Ramyon or noodles. Most of the subjects (90.99%) preferred products with labels with nutritional information as compared with products without labels. this was especially so true of the younger individuals and of pc-ople who checked food labels more frequently. The subjects preferred labeling which described the nutrient content per Package (55.41%), sewing size (32.88%) and food weight of 1009 (11.71%) as a standard nit. Generally, they prefer-red a simplified list to a detailed list of the number of nutrients, a figure graph to bar graph in nutrition claim, vertical bar graph to horizontal bar graph showing the nutritional content of foods and a web-type graphic format to a radiation-format when describing the item's percentage of the Korean RDA's nutrient content. The subjects who checked labels frequently especially preferred detailed list, while housewives with job or with unhealthy family members preferred a simplified list and graphic, rather than a numerical display. From this result, it is suggested that providing consumers with more nutrients information in a more easily understood graphic format would encourage the consumers to check nutritional labels. Therefore this should be considered when developing the regulations far nutrition labeling or when educating the Public about nutrition. (Korean J Community Nutrition 8(2) : 220∼230, 2003)

• Proceedings of the Korea Water Resources Association Conference
• /
• 2017.05a
• /
• pp.334-334
• /
• 2017

Representative particle sizes(RPS) are commonly used for particle size distribution of heterogeneous sediment such as bed material. RPS can provide not only information of mean characteristics of sediment, but also other properties like sorting, skewness, kurtosis. For sediment including sand and clay material, RPS is estimated through two steps. The first is experimental step for calculating weight of each size class, the next is interpolation step to get RPS by using the graph plot. At the second step, graph method known as direct reading of value along the interpolation line in the graph plot is commonly used. This method is often time-consuming job. In this study we developed a new program to get RPS by using MS Excel. Simple linear and semi-log interpolation are used. When compared with conventional graph method(direct reading), simple linear shows 5.31%, while semi-log 1.29% of relative difference. We developed MS Excel program for estimation of RPS automatically.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.3
• /
• pp.107-113
• /
• 2015

This paper presents a polynomial time algorithm to the minimum cardinality feedback edge set and minimum weight feedback edge set problems. The algorithm makes use of the property wherein the sum of the minimum spanning tree edge set and the minimum feedback edge set equals a given graph's edge set. In other words, the minimum feedback edge set is inherently a complementary set of the former. The proposed algorithm, in pursuit of the optimal solution, modifies the minimum spanning tree finding Kruskal's algorithm so as to arrange the weight of edges in a descending order and to assign cycle-deficient edges to the maximum spanning tree edge set MXST and cycle-containing edges to the feedback edge set FES. This algorithm runs with linear time complexity, whose execution time corresponds to the number of edges of the graph. When extensively tested on various undirected graphs both with and without the weighed edge, the proposed algorithm has obtained the optimal solutions with 100% success and accuracy.