• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.11a
• /
• pp.589-591
• /
• 2023

현재 수치예보 시스템은 항공기, 위성 등 다양한 센서에서 얻은 다종 관측 데이터를 동화하여 대기 상태를 추정하고 있지만, 관측변수 또는 물리량이 서로 다른 관측들을 처리하기 위한 계산 복잡도가 매우 높다. 본 연구에서 기존 시스템의 계산 효율성을 개선하여 관측을 평가하거나 전처리하는 데에 효율적으로 활용하기 위해, 각 관측의 특성을 고려한 자기 지도학습 방법을 통해 멀티모달 기상관측으로부터 실제 대기 상태를 추정하는 방법론을 제안하고자 한다. 비균질적으로 수집되는 멀티모달 기상관측 데이터를 융합하기 위해, (i) 기상관측의 heterogeneous network를 구축하여 개별 관측의 위상정보를 표현하고, (ii) pretext task 기반의 self-supervised learning을 바탕으로 개별 관측의 특성을 표현한다. (iii) Graph neural network 기반의 예측 모델을 통해 실제에 가까운 대기 상태를 추정한다. 제안하는 모델은 대규모 수치 시뮬레이션 시스템으로 수행되는 기존 기술의 한계점을 개선함으로써, 이상 관측 탐지, 관측의 편차 보정, 관측영향 평가 등 관측 전처리 기술로 활용할 수 있다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.1
• /
• pp.89-94
• /
• 2009

This paper proposes the algorithms that design the highly digital logic circuit and assign the code to each node of DCG(Directed Cyclic Graph) of length ${\zeta}$. The conventional algorithm have some problems, so this paper introduce the matrix equation from DCG of length ${\zeta}$ and proposes highly digital logic circuit design algorithms according to the DCG of length ${\zeta}$. Using the proposed circuit design algorithms in this paper, it become realized that was able to design from former algorithm. Also, making a comparison between the circuit using former algorithm and this paper's, we testify that proposed paper's algorithm is able to realize more optimized circuit design. According to proposed circuit design algorithm in this paper, it is possible to design current that DCG have natural number, so it have the following advantages, reduction of the circuit input/output digits, simplification of circuit composition, reduction of computation time and cost. And we show comparability and verification about this paper's algorithm.

• Journal of the Society of Naval Architects of Korea
• /
• v.38 no.2
• /
• pp.79-86
• /
• 2001

This study shows an attempt to generate an assembly sequence and its model for a ship block assembly using the graph theory and graph algorithms. To generate the ship block assembly, we propose four levels of the ship block assembly model such as "geometry mode1", "relational model", "sequential mode1", and "hierarchical model". To obtain the relational model, we used surface and surface intersection algorithm. The sequential model that represents a possible assembly sequence is made by using several graph algorithms from the relational model. The hierarchical model will be constructed from the sequential model in order to represent the block assembly tree and so forth. The purpose of the hierarchical model is to define an assembly tree and to generate the Bill Of Material(BOM). Lastly, the validity of the method proposed in this study is examined with application to ship block assembly models of a single type and double type according to four models mentioned above.

• Journal of KIISE:Databases
• /
• v.35 no.2
• /
• pp.112-124
• /
• 2008

RDF and OWL are the primary base technologies for implementing Semantic Web. Recently, many researches related with them, or applying them into the other application domains, have been introduced. However, relatively little work has been done for securing the RDF and OWL data. In this article, we briefly introduce an RDF triple based model for specifying RDF access authorization related with RDF security. Next, to efficiently find the authorization conflict by RDF inference, we introduce a method using prime number graph labeling in detail. The problem of authorization conflict by RDF inference is that although the lower concept is permitted to be accessed, it can be inaccessible due to the disapproval for the upper concept. Because by the RDF inference, the lower concept can be interpreted into the upper concept. Some experimental results show that the proposed method using the prime number graph labeling has better performance than the existing simple method for the detection of the authorization conflict.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.95-107
• /
• 2003

The broadcast environment has asymmetric communication aspect that is typically much greater communication bandwidth available from server to clients than in the opposite direction. In addition, most of mobile computing systems allow mostly read-only transactions from mobile clients for retrieving different types of information such as stock data, traffic information and mews updates. Since previous concurrency control protocols, however, do not consider such a particular characteristics, the performance degradation occurs when previous schemes are applied to the broadcast environment. In this paper, we propose the efficient concurrency control for query transaction in broadcast environment. The following requirements are satisfied by adapting weak consistency that is the appropriate correctness criterion of read-only transactions: (1) the mutual consistency of data maintained by the server and read by clients (2) the currency of data read by clients. We also use the serialization graph scheme to check the weak consistency efficiently. As a result, we improved a performance by reducing unnecessary aborts and restarts of read-only transactions caused when global serializability was adopted.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.261-277
• /
• 2005

We propose the PAD (Power Aware Data-centric Routing Protocol), which finds minimum energy routes and prolongs network life-time, for the data-centric sensor networks. Firstly, the PAD discovers the minimum energy Property graph by removing redundant communication links. The proposed a1gorithm to find the minimum energy property graph is faster, simpler and easier to implement than existing aIgorithms. Secondly, the PAD runs the DDBF (Distributed Data-centric Bellman-Ford Algorithm) to determine routing paths between a base node and all sensor nodes. The DDBF selves the drawbacks of the distributed bellman-ford algorithm, i.e. slow convergence and a possible cyclic routing path. Since the PAD is a fully distributed algorithm with low overhead, it can be used in various kinds of resource limited sensor network applications.

• Journal of Digital Convergence
• /
• v.12 no.11
• /
• pp.309-316
• /
• 2014

In this paper, we propose an efficient detph map creation method using Graph Cut and Discrete Wavelet Transform. First, we have segmented the original image by using Graph Cut to process with its each areas. After that, the information which describes segmented areas of original image have been created by proposed labeling method for segmented areas. And then, we have created four subbands which contain the original image's frequency information. Finally, the depth map have been created by frequency map which made with HH, HL subbands and depth information calculation along the each segmented areas. The proposed method can perform efficient depth map creation process because of dynamic allocation using depth information. We also have tested the proposed method using PSNR(Peak Signal to Noise Ratio) method to evaluate ours.

• Journal of the Korea Society for Simulation
• /
• v.16 no.1
• /
• pp.31-37
• /
• 2007

The importance of NPC's role in computer games is increasing. An NPC must perform its tasks by perceiving obstacles and other characters and by moving through them. It has been proposed to plan a natural-looking path against fixed obstacles by using a generalized visibility graph. In this paper we develop the execution module for an NPC to move efficiently along the path planned on the generalized visibility graph. The planned path consists of line segments and arc segments, so we define steering behaviors such as linear behaviors, circular behaviors, and an arriving behavior for NPC's movements to be realistic and utilize them during execution. The execution module also includes the collision detection capability to be able to detect dynamic obstacles and uses a decision tree to react differently according to the detected obstacles. The execution module is tested through the simulation based on the example scenario in which an NPC interferes the other moving NPC.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.2061-2074
• /
• 1998

In pattern recognition and image analysis upplications, a graph is a useful tool for complex obect representation and recognition. However it takes much time to pair proper nodes between the prototype graph and an input data graph. Futhermore it is difficult to decide whether the two graphs in a class are the same hecause real images are degradd in general by noise and other distortions. In this paper we propose a matching algorithm using a matrix. The matrix is suiable for simple and easily understood representation and enables the ordering and matching process to be convenient due to its predefined matrix manipulation. The nodes which constitute a gaph are ordered in the matrix by their geometrical positions and this makes it possible to save much comparison time for finding proper node pairs. for the classification, we defined a distance measure thatreflects the symbo's structural aspect that is the sum of the mode distance and the relation distance; the fornet is from the parameters describing the node shapes, the latter from the relations with othes node in the matrix. We also introduced a subdivision operation to compensate node merging which is mainly due t the prepreocessing error. The proposed method is applied to the recognition of musteal symbols and the result is given. The result shows that almost all, except heavily degraded symbols are recognized, and the recognition rate is approximately 95 percent.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1919-1928
• /
• 1999

There are no standard language for the specification of speed-independent circuits because existing specification methods are designed appropriately to each synthesis methodology. This paper suggests a method of using VHDL, a standard hardware description language, for the specification and synthesis of speed-independent circuits. Because VHDL is a multi-purpose language, we define a subset of VHDL which can be used for the synthesis. We transform the VHDL description into a signal transition graph and then synthesize speed-independent circuits by using a previous synthesis algorithm which uses a signal transition graph as the specification method. We suggest a systematic transformation method which transforms each VHDL statement into a partial signal transition graph and then merges them into a signal transition graph. This work is a step towards to the development of an integrated framework in which we can utilizes the existing CAD tools based on VHDL. Also, this work will enable a easier migration of the current circuit designers into asynchronous circuit design.