• Title/Summary/Keyword: graph structure

Search Result 508, Processing Time 0.025 seconds

A Study on the Network Generation Methods for Examining the Intellectual Structure of Knowledge Domains (지적 구조의 규명을 위한 네트워크 형성 방식에 관한 연구)

  • Lee Jae-Yun
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.40 no.2
    • /
    • pp.333-355
    • /
    • 2006
  • Network generation methods to visualize bibliometric data for examining the intellectual structure of knowledge domains are investigated in some detail. Among the four methods investigated in this study, pathfinder network algorithm is the most effective method in representing local details as well as global intellectual structure. The nearest neighbor graph, although never used in bibliometic analysis, also has some advantages such as its simplicity and clustering ability. The effect of input data preparation process on resulting intellectual structures are examined, and concluded that unlike MDS map with clusters, the network structure could be changed significantly by the differences in data matrix preparation process. The network generation methods investigated in this paper could be alternatives to conventional multivariate analysis methods and could facilitate our research on examining intellectual structure of knowledge domains.

A Study on the Deduction of 3-Dimmensional Visual Structure and measurement of Quantitative Openness in Accordance with Spatial Probe Routes (공간탐색경로에 따른 3차원 시각구조 도출과 정량적 개방도 측정에 관한 연구)

  • Kim, Suk-Tae
    • Korean Institute of Interior Design Journal
    • /
    • v.19 no.6
    • /
    • pp.112-120
    • /
    • 2010
  • Human can recognize the environment by detecting spatial perception, and most of environmental perception depends on visual perception. In view that the acquisition of spatial information is accomplished through visual recognition, analysis of visual structure contained in the space is thought to be very important sector in studying the characteristic of the space. The history of studies on visual structure of space, however, wasn't too long, and furthermore most of the theories up to now focused on static and planar principles. Under this circumstance, this study is intended to suggest new theory by combining Isovist theory and VGA theory that have been actively discussed as the theory on visual perception-based spatial structure and supplementing them between each other to expand into 3-dimensional model. The suggested theory is a complex principle in dimensional and dynamic form in consideration of visual direction, which forms 3-dimentional virtual model that enables visualization of the property of spatial structure as the routine discriminating whether visual connection is made between viewing point and target point, and the target point is included in the visual field quadrangular pyramid or not. Such model was built up by an analysis application where four probe paths were applied to simulate the visual structure that occurs in virtual space, and then the characteristics were analyzed through quantification. In result, in spite of the path with equal space and equal length, significant difference in the acquired quantity of spatial information could be found depending on the probe sequence. On the contrary, it was found that probe direction may not affect the acquired quantity of information and visual property of the space.

A Study on the Spatial Structure Change of Elderly Care Facility according to Introduction of Long-Term Care Insurance (장기요양보험제도의 도입에 따른 노인요양시설의 공간구조 변화에 관한 연구)

  • Yoon, Sohee;Kim, Suktae
    • Journal of The Korea Institute of Healthcare Architecture
    • /
    • v.20 no.4
    • /
    • pp.67-80
    • /
    • 2014
  • Purpose : Long-term Care Insurance sets up facility standard and installation standard of aged care facilities and decides the presence of minimum number of rooms and its size in care facilities by using systematic instruments. Therefore, most aged care facilities had renovation in expansion and reconstruction following the revised regulations and even facility space structure and space composition are continuously improving. The study is to determine the purpose and trend by comparing before and after space composition of facilities which followed the implementation of Long-term Care Insurance and also to suggest hierarchical space composition suitable for aged care facilities through derived problems and to provide basic materials to plan the most appropriate facility for the aged. Methods : J-graph based on Space Syntax Theory will be schematized through in-site facility survey and before and after facility floor plan. Space composition trend will be analyzed by comparing indexes through S3 program. Results : As a result of 5 cases analysis, the following results were found; the average of whole space depth is increasing due to the Extension, the number of volunteers is decreasing and rooms for geriatric care helpers are being created due to the geriatric care helper introduction duty. Also, there are solariums being created to improve the health of the aged and dispensaries are being placed on every floor with the increase of documentary work for geriatric care helpers. With the policy implementation, care facility space composition and structure are changing with facility standard and it was analyzed that facilities were mostly put under the control of limited number of people in care room and total ground area per person. It was also found that there is increase in care space integration through before and after comparison of whole integration value. This is considered as the important result not only in facility standard satisfaction, but also in care support of geriatric care helpers and the aged, its main users. Implication : In order for elderly care facilities to have quality improvement and to develop as suitable facilities for characteristics of the aged, independent environmental facility standard preparation of elderly care facilities is needed through mutual cooperation of construction fields with regulation and policy related researches.

Analysis of a Large-scale Protein Structural Interactome: Ageing Protein structures and the most important protein domain

  • Bolser, Dan;Dafas, Panos;Harrington, Richard;Schroeder, Michael;Park, Jong
    • Proceedings of the Korean Society for Bioinformatics Conference
    • /
    • 2003.10a
    • /
    • pp.26-51
    • /
    • 2003
  • Large scale protein interaction maps provide a new, global perspective with which to analyse protein function. PSIMAP, the Protein Structural Interactome Map, is a database of all the structurally observed interactions between superfamilies of protein domains with known three-dimensional structure in thePDB. PSIMAP incorporates both functional and evolutionary information into a single network. It makes it possible to age protein domains in terms of taxonomic diversity, interaction and function. One consequence of it is to predict the most important protein domain structure in evolution. We present a global analysis of PSIMAP using several distinct network measures relating to centrality, interactivity, fault-tolerance, and taxonomic diversity. We found the following results: ${\bullet}$ Centrality: we show that the center and barycenter of PSIMAP do not coincide, and that the superfamilies forming the barycenter relate to very general functions, while those constituting the center relate to enzymatic activity. ${\bullet}$ Interactivity: we identify the P-loop and immunoglobulin superfamilies as the most highly interactive. We successfully use connectivity and cluster index, which characterise the connectivity of a superfamily's neighbourhood, to discover superfamilies of complex I and II. This is particularly significant as the structure of complex I is not yet solved. ${\bullet}$ Taxonomic diversity: we found that highly interactive superfamilies are in general taxonomically very diverse and are thus amongst the oldest. This led to the prediction of the oldest and most important protein domain in evolution of lift. ${\bullet}$ Fault-tolerance: we found that the network is very robust as for the majority of superfamilies removal from the network will not break up the network. Overall, we can single out the P-loop containing nucleotide triphosphate hydrolases superfamily as it is the most highly connected and has the highest taxonomic diversity. In addition, this superfamily has the highest interaction rank, is the barycenter of the network (it has the shortest average path to every other superfamily in the network), and is an articulation vertex, whose removal will disconnect the network. More generally, we conclude that the graph-theoretic and taxonomic analysis of PSIMAP is an important step towards the understanding of protein function and could be an important tool for tracing the evolution of life at the molecular level.

  • PDF

An Algorithm for Spot Addressing in Microarray using Regular Grid Structure Searching (균일 격자 구조 탐색을 이용한 마이크로어레이 반점 주소 결정 알고리즘)

  • 진희정;조환규
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.9
    • /
    • pp.514-526
    • /
    • 2004
  • Microarray is a new technique for gene expression experiment, which has gained biologist's attention for recent years. This technology enables us to obtain hundreds and thousands of expression of gene or genotype at once using microarray Since it requires manual work to analyze patterns of gene expression, we want to develop an effective and automated tools to analyze microarray image. However it is difficult to analyze DNA chip images automatically due to several problems such as the variation of spot position, the irregularity of spot shape and size, and sample contamination. Especially, one of the most difficult problems in microarray analysis is the block and spot addressing, which is performed by manual or semi automated work in all the commercial tools. In this paper we propose a new algorithm to address the position of spot and block using a new concept of regular structure grid searching. In our algorithm, first we construct maximal I-regular sequences from the set of input points. Secondly we calculate the rotational angle and unit distance. Finally, we construct I-regularity graph by allowing pseudo points and then we compute the spot/block address using this graph. Experiment results showed that our algorithm is highly robust and reliable. Supplement information is available on http://jade.cs.pusan.ac.kr/~autogrid.

A Case Study on the Web Publishing of Relational DB Via XML (XML을 이용한 관계DB의 웹출판에 관한 사례)

  • 우원택
    • Proceedings of the Korea Association of Information Systems Conference
    • /
    • 2001.12a
    • /
    • pp.64-82
    • /
    • 2001
  • HTML revolutionized the way we specify the appearance of data on the Internet. Today, XML (the eXtensible Markup Language) is changing the way we specify the meaning of data. XML, lets document authors define their own markup tags and attribute names to assign meaning to the data elements in the document. Further, XML elements can be nested and include references to indicate data relationships, as Listing One. Unlike HTML, XML markup tags do not describe how to render the data. Rather, they provide descriptions of data, allowing software to understand the meaning of the data automatically For publishing, instead, XSL, the eXtensible Stylesheet Language as a separate language , is in charge of specifying the presentation of XML documents. The purpose of this study is to discover how to transform your organizations relational data into potential e-commerce, business-to-business, and web application with XML and XSL documents. For this purpose, the literature survey, first of all, was undertaken to understand the basic structures of XML documents. Second, one case implementation was performed to understand how to transform Access 2002 XML Files into HTML with XSLTand VB script. The results come out to be successful, more or less. But the limitations of it still exist. One immediate limitation is that XML documents are essentially tree structure, as dictated by the nesting of elements. However, relational database tables are two dimensional matrix structure. In addition, real-world data often is graph structured-a single data element may be referenced in multiple ways. However, this study is useful for understanding how to convert relational database into XML documents and to publish them using XSL or VB script.

  • PDF

Program Slicing in the Presence of Complicated Data Structure (복잡한 자료 구조를 지니는 프로그램 슬라이싱)

  • Ryu, Ho-Yeon;Park, Joong-Yang;Park, Jae-Heung
    • The KIPS Transactions:PartD
    • /
    • v.10D no.6
    • /
    • pp.999-1010
    • /
    • 2003
  • Program slicing is s method to extract the statements from the program which have an influence on the value of a variable at a paricular point of the program. Program slicing is applied for many applications, such as program degugging, program testing, program integration, parallel program execution, software metrics, reverse engineering, and software maintenance, etc. This paper is the study to create the exact slice in the presence of Object Reference State Graph to generate more exactly static analysis information of objects in the program of the presence of complicated data structure.

Assemblability Analysis of Kinematic Configurations of Front-Wheel Drive Automatic Transmissions (전륜구동 차량용 자동변속기의 기구학적 구성에 대한 조립 가능성 분석에 관한 연구)

  • Kwon, Hyun Sik
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.18 no.11
    • /
    • pp.24-34
    • /
    • 2019
  • An automotive automatic transmission is a popular power-transmitting device in passenger vehicles, as it provides various speed ratios for diverse driving conditions with easy manipulation and smooth gear shifting. The transmission is mainly composed of input and output shafts, planetary gear sets, brakes/clutches, and housing, and it yields multiple forward gears and one reverse gear by actuating the shifting devices of the brakes and clutches. In developing a new transmission, kinematic configurations of a transmission, which presents a brief structure and actuation schemes for speed ratios, need to be checked to determine if the structure can be assembled in a layout. It is impossible for a transmission concept having any interference in connecting main components to be developed further in the design process, since connection interference leads to failure of a layout design in the 2-D plane. In this research, an analysis of the assemblability of a front-wheel drive automatic transmission is carried out on an example concept design by applying the vertex addition algorithm based on graph theory.

An Analysis of the Casual Relations on Construction Project Manager's level Competency (건설 현장 관리자 역량의 인과관계 구조 분석)

  • Kim, Do-Yeob;Kim, Hwa-Rang;Jang, Hyoun-Seung
    • Journal of the Architectural Institute of Korea Structure & Construction
    • /
    • v.34 no.3
    • /
    • pp.77-86
    • /
    • 2018
  • Recently, Korean construction industry is moving from quantitative growth to qualitative growth. Among the changes in the construction industry, the competency of the project manager who represents the construction project as well as the construction company has been referred to as a factor that effects qualitative growth. This research utilized previous research analysis and expert interview in order to extract essential competency factors of a construction project manager. DEMATEL method was utilized to analyze the quantitative and objective causal relationship between the competency factors. The causal relationship of the competency factors were visualized through Digraph (directed graph) and competency areas of the project manager that requires strengthening were also suggested. Analysis result showed that the important competency categories of a project manager were Internal & External Communication, Project Management Body of Knowledge, and Inspirational Leadership. The analysis results of this research can be utilized in developing competency enhancement method for future project managers and as a basic data in developing an education program.

Join Query Performance Optimization Based on Convergence Indexing Method (융합 인덱싱 방법에 의한 조인 쿼리 성능 최적화)

  • Zhao, Tianyi;Lee, Yong-Ju
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.16 no.1
    • /
    • pp.109-116
    • /
    • 2021
  • Since RDF (Resource Description Framework) triples are modeled as graph, we cannot directly adopt existing solutions in relational databases and XML technology. In order to store, index, and query Linked Data more efficiently, we propose a convergence indexing method combined R*-tree and K-dimensional trees. This method uses a hybrid storage system based on HDD (Hard Disk Drive) and SSD (Solid State Drive) devices, and a separated filter and refinement index structure to filter unnecessary data and further refine the immediate result. We perform performance comparisons based on three standard join retrieval algorithms. The experimental results demonstrate that our method has achieved remarkable performance compared to other existing methods such as Quad and Darq.