• Architectural research
• /
• 제12권1호
• /
• pp.9-14
• /
• 2010

The present study explored the applicability of Visibility Graph Analysis (VGA) techniques to workplace design research. Six types of VGA measures in Depthmap encompassing visual connectivity, three types of visual integration, mean depth, and visual entropy were employed for the analysis of individual privacy for task concentration and group relationship behavior in the open-plan office environment. Data comprised 136 workers in 6 open-plan offices filled with low-paneled (1.2-1.5m) cubicle workspaces. For the statistical analysis, Spearman's rho correlations and t-tests were applied for the spatial and behavioral measures. The results showed that workspace VGA measures have a potential to be useful information to account for workers' concentration privacy and, limitedly, also informal relationships with team members. Visual entropy values especially offer reliable information to predict various aspects of office workers' privacy behavior while visual integration can be used to account for the workers' sense of trust in group relations. The study also discussed the limitation of VGA applications to the workplace context.

• 한국생물정보학회:학술대회논문집
• /
• 한국생물정보시스템생물학회 2005년도 BIOINFO 2005
• /
• pp.47-50
• /
• 2005

SGS (Splicing Graph Server) is as web application based on the MVC architecture with a Java platform. The specifications of the implemented design pattern are closely associated with the specific requirements of splicing graphs for analyzing alternative splice variants from a single gene. The paper presents the use of MVC architecture using JavaBeans as a model, with a JSP viewer and the servlet as the controller for this bioinformatics web application, with the open source apache/tomcat application server and a MySql database management system.

• International Journal of Internet, Broadcasting and Communication
• /
• 제5권1호
• /
• pp.14-17
• /
• 2013

RDF data is widely used for exchanging data nowadays to enable semantic web era. This leads to the need for storing and retrieving these data efficiently and effectively. Recently, the structure index in graph-based perspective is considered as a promising approach to deal with issues of complex query graphs. However, even though there are many researches based on structure indexing, there can be a better architectural approach instead of addressing the issue as a part. In this research, we propose architecture for storing, query processing and retrieving RDF data in efficient manner using structure indexing. Our research utilizes research results from iStore and 2 relation-based approaches and we focus on improving query processing to reduce the time of loading data and I/O cost.

• Journal of Advanced Marine Engineering and Technology
• /
• 제39권2호
• /
• pp.159-165
• /
• 2015

Motion control schemes are generally classified into three categories (point stabilization, trajectory tracking, and path following). This paper deals with the problem which is associated with the initial deployment of a group of Unmanned Surface Vehicle (USVs) and corresponding point stabilization. To keep the formation of a group of USVs, it is necessary to set the relationship between each vehicle. A forcing functions such as potential fields are designed to keep the formation and a graph Laplacian is used to represent the connectivity between vehicle. In case of fixed topology of the graph representing the communication between the vehicles, the graph Laplacian is assumed constant. However the graph topologies are allowed to change as the vehicles move, and the system dynamics become discontinuous in nature because the graph Laplacian changes as time passes. To check the stability in the stage of deployment, the system is modeled with Kronecker algebra notation. Filippov's calculus of differential equations with discontinuous right hand sides is then used to formally characterize the behavior of USVs. The stability of the system is analyzed with Lyapunov's stability theory and LaSalle's invariance principle, and the validity is shown by checking the variation of state norm.

• 정보처리학회논문지D
• /
• 제15D권5호
• /
• pp.691-698
• /
• 2008

웹사이트의 구조를 표현하고 설계하는 일반적인 방법으로 스토리보드나 사이트 맵 또는 플로우 차트 등을 사용하거나 또는 이들을 조합하여 사용하는 방법이 있다. 그러나 이들은 웹사이트의 전체 구조를 표현하기 어렵고 웹페이지 간의 세부적인 흐름 관계를 표현하기에 부적절한 면이 있다. 이러한 문제점을 다소 해결하기 위하여 EMFG(Extended Mark Flow Graph)를 이용하여 웹사이트를 표현하고 설계하려는 연구가 진행되었다. 그런데 이러한 기존의 연구는 웹사이트의 정적인 부분들을 대부분 표현하였기 때문에 동적인 웹사이트의 인터페이스를 표현하고 설계하기에는 부족한 점이 있다. 그리고 현재 인터넷의 생활화가 가속화되어 감에 따라 웹사이트의 구조가 더욱 다양하고 복잡하게 되었을 뿐 아니라 인터페이스도 많은 부분에서 동적인 부분을 포함하게 되었다. 따라서 본 연구에서는 EMFG를 사용하여 복잡하고 다양한 웹사이트의 구조뿐만 아니라 동적인 인터페이스 - 예를 들어, 시간에 따라 변하는 페이지 구조 또는 마우스 동작에 따라 변하는 페이지 상태나 구조 등 - 를 표현하는 방법을 제시한다. 본 연구가 웹사이트를 설계하는데 많은 도움이 되고, 웹사이트의 유지보수에도 도움이 될 수 있을 것으로 기대한다.

• 한국실내디자인학회논문집
• /
• 제19권4호
• /
• pp.74-81
• /
• 2010

This study analyzed characteristics of visual circulation in the modern museum architecture while carrying out space syntax and visibility graph analysis side by side in order to solve problems of visitors' movement having been suggested as the point at issue at modern museum architecture that has become big scaled and layering so as to satisfy various social demands. Also, the result of this analysis is same as followings. First, visitors become to watch the exhibition with clear position that can make themselves in right allocation, and thus visual and perceptual confusions were shown as relatively low in case physical position and visual one were matched at major space of atrium type or mediation space. Second, it was appeared a lot at the museum having exhibition space of room type in case the physical position and visual one were not matched. Visual circulation in the exhibition space of room type has a merit of forming the circulation where free selection is possible. However, it have raised concerns that visual passageway of visitors could be in a stalemate or crash at the opening part, not at the exhibition hall. Third, though analysis of space syntax had a merit of analyzing total modern museum architectures having became compounded and big scaled, but it was dropped in reliability from the visual circulation's analysis that was decided by flows of space and time. In contrary, visibility graph analysis was shown as having a merit to analyzing the flows rather than that of total structure, and also appeared as being able to supplement the disadvantage of space syntax in methodology. Upon the above analysis, a lot of architectural elements such as allocation of exhibition hall, location of door and window etc. were appeared as affecting influences to forming visual circulation of visitors, not to mention of allocations of major space, mediation space, and exhibition one. Through this study, various possibilities of quantitative analysis on the visual circulation in the museum architectures can be confirmed. However, this study expects that in-depth subsequent researches objecting to various museums could be realized afterwards because there are still limitations in its analysis.

• 한국산업융합학회 논문집
• /
• 제24권1호
• /
• pp.69-77
• /
• 2021

The widely used low-cost design methodology for IoT devices is very popular. In such a networked device, memory is composed of flash memory, SRAM, DRAM, etc., and because it processes a large amount of data, memory design is an important factor for system performance. Therefore, each device selects optimized design factors such as function, performance and cost according to market demand. The design of a memory architecture available for low-cost IoT devices is very limited with the configuration of SRAM, flash memory, and DRAM. In order to process as much data as possible in the same space, an architecture that supports parallel processing units is usually provided. Such parallel architecture is a design method that provides high performance at low cost. However, it needs precise software techniques for instruction and data mapping on the parallel architecture. This paper proposes an instruction/data mapping method to support optimized parallel processing performance. The proposed method optimizes system performance by actively using hardware and software parallelism.

• 한국언어정보학회:학술대회논문집
• /
• 한국언어정보학회 2007년도 정기학술대회
• /
• pp.321-329
• /
• 2007

This paper reports on the application of network analysis approaches to investigate the characteristics of graph representations of Japanese word associations. Two semantic networks are constructed from two separate Japanese word association databases. The basic statistical features of the networks indicate that they have scale-free and small-world properties and that they exhibit hierarchical organization. A graph clustering method is also applied to the networks with the objective of generating hierarchical structures within the semantic networks. The method is shown to be an efficient tool for analyzing large-scale structures within corpora. As a utilization of the network clustering results, we briefly introduce two web-based applications: the first is a search system that highlights various possible relations between words according to association type, while the second is to present the hierarchical architecture of a semantic network. The systems realize dynamic representations of network structures based on the relationships between words and concepts.

• 대한전자공학회논문지SP
• /
• 제38권6호
• /
• pp.608-616
• /
• 2001

본 논문은 K-L 변환을 기반으로 한 Fisherface 알고리즘과 fixed graph matching (FGM) 방법을 이용하여 보다 효율적인 얼굴 인식 방법을 제안하고자 한다. 동적 링크 구조 방법 중에 하나인 elastic graph matching (EGM)은 얼굴의 모양 정보뿐만 아니라, 영상 픽셀의 그레이 정보를 동시에 이용하는 하며, 클래스를 구분하는 방법인 Fisherface 알고리즘은 빛의 방향 및 얼굴 표정과 같은 영상의 변화에 대해 강인하다고 알려져 있다. 위의 두 방법으로부터 제안한 알고리즘에서는 영상 그래프의 각 노드에 대해 Fisherface방법을 적용함으로써 레이블된 그래프 벡터의 차원을 줄일 뿐만 아니라 효율적으로 클래스를 구분하기 위한 특징 벡터를 제공한다. 그럼으로써 기존의 EGM 방법에 비해 인식 속도 면에서 상당한 향상 결과를 얻을 수 있었다. 특히, Olivetti Research Laboratory (ORL) 데이터베이스와 Yale 대학 데이터베이스에 대해 실험한 결과 제안한 얼굴 인식 알고리즘은 hold-out 방법에 의한 실험 결과, 평균 90.1%로 기존의 한 방법만을 사용한 것보다 높은 인식률을 보였다.

• 대한조선학회논문집
• /
• 제59권6호
• /
• pp.393-399
• /
• 2022

During the ship hull design process, resistance performance estimation is generally calculated by simulation using computational fluid dynamics. Since such hull resistance performance simulation requires a lot of time and computation resources, the time taken for simulation is reduced by CPU clusters having more than tens of cores in order to complete the hull design within the required deadline of the ship owner. In this paper, we propose a method for estimating resistance performance of ship hull by simulation using a graph neural network. This method converts the 3D geometric information of the hull mesh and the physical quantity of the surface into a mathematical graph, and is implemented as a deep learning model that predicts the future simulation state from the input state. The method proposed in the resistance performance experiment of simple hull showed an average error of about 3.5 % throughout the simulation.