• Title/Summary/Keyword: graph construction

Search Result 203, Processing Time 0.019 seconds

Somatotype Characteristics of Elementary School Girls (Part I) -Focusing somatotype changing charcteristics on each grade group- (학령기 여아의 체형 특성(제1보) -학령기별 체형 변이 특성을 중심으로-)

  • 장정아;권영숙
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.23 no.7
    • /
    • pp.941-952
    • /
    • 1999
  • The purposes of this study were to provide the fundamental data on elementary school girls' somatotype for their clothing construction by contemplating the stage of physical growth dividing into the period of school age and characterizing the variation of body type according to the school age. The results are as follows : 1. Form the results of one-way variables analysis and multiple comparson test(Duncan's test) classification of the period school age can be divided into 'early grade(1 2 grade)' ' middle grade(3 4 grade)' and 'later grade(5 6 grade)' 2. As the results of analyzing Mean Coefficient of Variation and Standard Deviation graph for direct and indirect measurments and index especially of the Coefficient Variation that explain individual difference of growth the items of height indicates individual difference related with height of lower body of early grade group the items of length individual difference related with length of upper body of later grade group and the items of circumference make little difference. The items of anagle makes pretty higher value that direct measurements and especially in lower angle of chest make a distinctive difference, This fact proves that children's somatotype change from the belly part extruded forwards of early and middle grade to the upper body part slanted slightly forward of later grade.

  • PDF

Ontology Knowledge based Information Retrieval for User Query Interpretation (사용자 질의 의미 해석을 위한 온톨로지 지식 기반 검색)

  • Kim, Nanju;Pyo, Hyejin;Jeong, Hoon;Choi, Euiin
    • Journal of Digital Convergence
    • /
    • v.12 no.6
    • /
    • pp.245-252
    • /
    • 2014
  • Semantic search promises to provide more accurate result than present-day keyword matching-based search by using the knowledge base represented logically. But, the ordinary users don't know well the complex formal query language and schema of the knowledge base. So, the system should interpret the meaning of user's keywords. In this paper, we describe a user query interpretation system for the semantic retrieval of multimedia contents. Our system is ontological knowledge base-driven in the sense that the interpretation process is integrated into a unified structure around a knowledge base, which is built on domain ontologies.

Construction of Highly Performance Switching Circuit (고효율 스위칭회로)

  • Park, Chun-Myoung
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.12
    • /
    • pp.88-93
    • /
    • 2016
  • This paper presents a method of constructing the highly performance switching circuit(HPSC) over finite fields. The proposed method is as following. First of all, we extract the input/output relationship of linear characteristics for the given digital switching functions, Next, we convert the input/output relationship to Directed Cyclic Graph using basic gates adder and coefficient multiplier that are defined by mathematical properties in finite fields. Also, we propose the new factorization method for matrix characteristics equation that represent the relationship of the input/output characteristics. The proposed method have properties of generalization and regularity. Also, the proposed method is possible to any prime number multiplication expression.

Constructing Algorithm for Optimal Edge-Disjoint Spanning Trees in Odd Interconnection Network $O_d$ (오드 연결망 $O_d$에서 에지 중복 없는 최적 스패닝 트리를 구성하는 알고리즘)

  • Kim, Jong-Seok;Lee, Hyeong-Ok;Kim, Sung-Won
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.5
    • /
    • pp.429-436
    • /
    • 2009
  • Odd network was introduced as one model of graph theory. In [1], it was introduced as a class of fault-tolerant multiprocessor networks and analyzed so many useful properties such as simple routing algorithms, maximal fault tolerance, node axsjoint path, etc. In this paper, we sauw a construction algorithm of edge-axsjoint spanning trees in Odd network $O_d$. Also, we prove that edge-disjoint spanning tree generated by our algorithm is optimal edge-disjoint spanning tree.

Knowledge Construction on Mathematics Problem Solving (수학 탐구학습에서 지식 형성에 대한 연구)

  • 이중권
    • Journal for History of Mathematics
    • /
    • v.17 no.3
    • /
    • pp.109-120
    • /
    • 2004
  • This study investigated three pre-service teachers' mathematical problem solving among hand-in-write-ups and final projects for each subject. All participants' activities and computer explorations were observed and video taped. If it was possible, an open-ended individual interview was performed before, during, and after each exploration. The method of data collection was observation, interviewing, field notes, students' written assignments, computer works, and audio and videotapes of pre- service teachers' mathematical problem solving activities. At the beginning of the mathematical problem solving activities, all participants did not have strong procedural and conceptual knowledge of the graph, making a model by using data, and general concept of a sine function, but they built strong procedural and conceptual knowledge and connected them appropriately through mathematical problem solving activities by using the computer technology.

  • PDF

An Experimental Study on the design of the thermister thermometer (전기온도계 제작에 관한 실험적 연구)

  • Yun, Dork-Ro;Kim, Ik-Su
    • Journal of Preventive Medicine and Public Health
    • /
    • v.6 no.1
    • /
    • pp.65-70
    • /
    • 1973
  • The study in the fild of medical instrument has been out of the interest by any of the life scientist in Korea. Especially, the recent developments in the medical electromics are remarkable one. Authors planned this study to ascertain the possibility of setting up the thermister thermometer with available accessories of demestic prouducts including some specific foreign assembly parts. By proper use of the thermister as one of the wheatstone bridge, we could detect tile resistance variations due to the environmental temperature variace. The intensive care for the bridge circuit and compensation scheme was required. The calibration procedure adopted here makes it possible to read the current as the temperature. The temperature range was determined by the examination and construction of the graph of the resistance-temperature variation. The determination of electric current, available ambient-temperature, the reduction of excessive current and self-heating of the thermister were made. Renovation in response-velocity was under taken too. This electronic thermometer was designed and assembled by the circuitry developed in accordance with the maximum availability of domestic products with some foreign-made parts. The result of our experiment showed very stable function and proved to be the most promissing item in the actual application as long as the thermistor thermister is concerned.

  • PDF

A Study on the Plan Characteristics and Unit Floor Type Through the Zoning Analysis of High-rise Residential Buildings (초고층 주상복합 건축물에서 조닝분석을 통한 단위세대 평면 유형 및 계획특성에 관한 연구)

  • Sung, Lee-Yong
    • Korean Institute of Interior Design Journal
    • /
    • v.21 no.6
    • /
    • pp.54-61
    • /
    • 2012
  • The aim of this study is to understand the plan characteristics used in unit floor planning mainly with examples of mixed-use residential tall buildings. The study will extract plan characteristics mainly using the graph expressive technique with essential information of the zoning function of residential space, rather than merely analyzing the various construction floor plans by type. The research method involves studying a group of 50-story buildings (over 200 meters) which were built between 2002 and 2008. Among 6 high-rise residential buildings case, we extract the most preferred type from 34 types, And then we simply classify rooms in 3 zoning, the master, living and children's zones. Finally we analyze the correlation among 3 simple zone and then extract some model type. The results of this study revealed three main findings. First, using the 3 functional zones, the shape of the main building and the unit floor plan can be analyzed simply even when they appear to be complicated. Second, we can extract common features when we analyze the unit floor plan from the viewpoint of the penetrability among 3 zoning. Third, we can extract 2 types when we analyze the unit floor plan from the viewpoint of 3 connected functional zoning concepts.

  • PDF

Buffered Routing Tree Construction under Buffer Location and Wiring Constraints (버퍼 삽입 위치 및 배선 제한을 고려한 Buffered 배선 트리 구성)

  • 정동식;김덕환;임종석
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.11
    • /
    • pp.73-82
    • /
    • 2003
  • In this paper, a simultaneous buffer insertion and routing method is proposed under the constraints of wire and buffer locations by macro or IP blocks. A new grid graph is proposed to describe the regions in which buffers(or both wires and buffers) are not available. Under this grid we describe a method of constructing a buffeted tree that minimize the maximum source to sink delay. The method is based on the dynamic programming with pruning unnecessary partial solutions. The proposed method improved the slack time of the delay by 19% on the average while using less buffers and similar wire length.

The Design of Parallel Routing Algorithm on a Recursive Circulant Network (재귀원형군에서 병렬 경로 알고리즘의 설계)

  • Bae, Yong-Keun;Park, Byung-Kwon;Chung, Il-Yong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.11
    • /
    • pp.2701-2710
    • /
    • 1997
  • Recursive circulant graph has recently developed as a new model of multiprocessors, and drawn considerable attention to supercomputing, In this paper, we investigate the routing of a message i recursive circulant, that is a key to the performance of this network. On recursive circulant network, we would like to transmit m packets from a source node to a destination node simultaneously along paths, where the ith packet will traverse along the ith path $(o{\leq}i{\leq}m-1)$. In oder for all packets to arrive at the destination node quickly and securely, the ith path must be node-disjoint from all other paths. For construction of these paths, employing the Hamiltonian Circuit Latin Square(HCLS), a special class of $(n{\times}n)$ matrices, we present $O(n^2)$ parallel routing algorithm on recursive circulant network.

  • PDF

Optimal Edge-Disjoint Spanning Trees in HyperStar Interconnection Network HS(2n,n) (하이퍼스타 연결망 HS(2n,n)의 에지 중복 없는 최적 스패닝 트리)

  • Kim, Jong-Seok;Kim, Sung-Won;Lee, Hyeong-Ok
    • The KIPS Transactions:PartA
    • /
    • v.15A no.6
    • /
    • pp.345-350
    • /
    • 2008
  • Recently, a HyperStar network HS(2n,n) has been introduced as a new interconnection network of new topology for parallel processing. HyperStar network has properties of hypercube and star graph, further improve the network cost of a hypercube with the same number of nodes. In this paper, we show a construction algorithm of edge-disjoint spanning trees in HyperStar network HS(2n,n). Also, we prove that edge-disjoint spanning tree by the algorithm is optimal.