• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.11-20
• /
• 1995

A new graph problem is formulated to limit the maximum path length of a general directed graph when a minimal set of vertices together with their incident edges are removed from the graph. An optimal algorithm and a heuristic algorithm are proposed and the proposed heuristic algorithm is shown to be effective through experiments using a collection of graphs obtained from large sequential circuits. The heuristic algorithm is based on a feedback vertex set algorithm based on graph reduction.

• Honam Mathematical Journal
• /
• v.29 no.4
• /
• pp.667-679
• /
• 2007

We study the prime ideal structure of the direct sum of directed system of rings indexed by a commutative semigroup which is nilpotent extension of a group.

• Kyungpook Mathematical Journal
• /
• v.50 no.1
• /
• pp.89-100
• /
• 2010

Let g = (V, E, ${\mu}$) be a weighted directed tree, where V is a vertex set, E is an edge set, and ${\mu}$ is ${\sigma}$-finite measure on V. The tree g induces a composition operator C on the Hilbert space $l^2$(V). Hand-type directed trees are defined and characterized the weak hyponormalities of such C in this note. Also some additional related properties are discussed. In addition, some examples related to directed hand-type trees are provided to separate classes of weak-hyponormal operators.

• Physical Therapy Korea
• /
• v.23 no.1
• /
• pp.55-64
• /
• 2016

Background: The International Classification of Functioning, Disability, and Health-core set (ICF-core set) for children and youth (CY) with cerebral palsy (CP) provides a useful conceptual framework and a guide for health care planning and measuring the changes brought by interventions across a multitude of dimensions from body functions to personal activities, social participation, and environmental factors for them. Objects: This single case study was reported to illustrate the use of a goal directed approach in applying the ICF-core set for CY with CP from a physical therapist perspective. Methods: An eleven year old boy with spastic CP, Gross Motor Function Classification System (GMFCS) level V, and his mother participated in an evaluation of his functioning state. The intervention goal was set through an interview using the ICF-core set, Canadian Occupational Performance Measure (COPM) and Goal Attainment Scale (GAS). Physical therapy was carried out on an outpatient basis using a goal directed approach for 30 min, 1 time/week during 12 weeks and the boy's gross motor function was assessed using the Gross Motor Function Measure (GMFM)-66 version (item set 2) before and after the intervention. Results: As measured by the boy's mother, the COPM score showed a meaningful clinical change (performance=mean 3.5, satisfaction=mean 2.5) and the T-score of GAS changed 34.4 after the goal directed approach. The GMFM-66 (item set 2) score changed from 31.8 to 38.7 and evaluation using the ICF-core set displayed improvement in 6 items of activity level between before and after the intervention. Conclusion: The ICF-core set for CY with CP is useful for understanding the overall functioning of CY with this condition and provides an opportunity to share and integrate information and opinions from different disciplines. We consider it as a useful tool in the universal language for the therapy and education of CY with CP.

• Communications of the Korean Mathematical Society
• /
• v.19 no.2
• /
• pp.355-373
• /
• 2004

An extended directed triple system of order v, denoted by EDTS(v), is a pair (V, (equation omitted)) where V is a v-set and (equation omitted) is a set of transitive triples of elements of V such that every ordered pair of elements of V is contained in exactly one member of (equation omitted). We obtain a necessary and sufficient condition for the existence of cyclic EDTS(v)s, and when k=1 or 2, we also obtain a necessary and sufficient condition for the existence of k-rotational EDTS(v)s.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.1
• /
• pp.131-146
• /
• 1996

In this paper, we describe the facial structure of the steiner problem in a directed graph by formulating it as set covering problem. We first characterize trivial facets and derive a necessary condition for nontrival facets. We also introduce a class of valid inequalities with 0-1 coefficients and show when such inequalities define facets.

• Honam Mathematical Journal
• /
• v.22 no.1
• /
• pp.77-82
• /
• 2000

After considering an equivalence relation on a directed preordered set, we construct an isomorphism between derived limits of inverse systems indexed by the directed (pre)ordered sets.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.60-66
• /
• 2006

This paper presents a new algorithm for the K shortest path problem in a directed network. After a shortest path is produced with Dijkstra algorithm, detouring paths through inward arcs to every vertex of the shortest path are generated. A length of a detouring path is the sum of both the length of the inward arc and the difference between the shortest distance from the origin to the head vertex and that to the tail vertex. K-1 shorter paths are selected among the detouring paths and put into the set of K paths. Then detouring paths through inward arcs to every vertex of the second shortest path are generated. If there is a shorter path than the current Kth path in the set, this path is placed in the set and the Kth path is removed from the set, and the paths in the set is rearranged in the ascending order of lengths. This procedure of generating the detouring paths and rearranging the set is repeated for the K-1 st path of the set. This algorithm can be applied to a problem of generating the detouring paths in the navigation system for ITS and also for vehicle routing problems.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.5
• /
• pp.941-947
• /
• 2011

This paper deals with the consensus problem for multi-agent linear dynamic systems with directed communication topology. All the agents are identical high-order linear systems and their state information is exchanged through a communication network with directed graph. It is shown that a consensus is achieved if there exists a feasible solution to a set of linear matrix inequalities obtained for a simultaneous stabilization problem for multiple systems. Examples are presented to show the effectiveness of the proposed method.

• Educational Technology International
• /
• v.18 no.2
• /
• pp.249-263
• /
• 2017

The purpose of this study was to examine whether respondents showed gender differences in life- learning competency, self-directed learning ability, problem-solving ability, and academic achievement and to identify relationships among variables of university students in the context of higher education. To address those goal, the data set was analyzed that nationally collected from Korea Youth Competency Measurement and International Comparative Research III by National Youth Policy Institute in South Korea. 680 samples were used in the study that were 343 males and 337 females of university students. As results, statistically significant difference was showed in the participants' gender. Male university students were higher score than female university students in All variables. Also, learning agility in life-learning competency was strongly related to self-directed learning ability and problem-solving. Thinking skills in life-learning competency was strongly related to academic achievement in university students in higher education. In terms of learning strategy in the context of higher education, some suggestions have been made for university students.