• Journal of Korea Ship Safrty Technology Authority
• /
• s.33
• /
• pp.32-52
• /
• 2012

선박의 경사시험에 사용되는 수동식 계측기기는 측정 자체가 사람의 관능에 의존하기 때문에 현장계측자 개인의 경험에 따라 측정 데이타의 신뢰도에 편차가 발생할 개연성이 높다. 그러나 경험치에 의존하지 않고 경사시험의 신뢰성을 담보할 측정방법의 개선이나 개발은 현재까지 없었다. 경사시험 시 정밀한 계측센서를 이용하여 경사각을 계측한다면, 선박의 복원성판정에 정확성을 기할 수 있을 것이다. 따라서 본 연구에서는 전자식 자이로 센서가 내장된 스마트폰(태블릿 PC)을 이용하여 선박의 경사각을 계측하고, 아울러 그에 따른 선박의 경하 상태의 배수량 및 중량중심을 자동으로 계산할 수 있는 앱을 개발하여 선박 복원성판정의 유효성을 검증하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1217-1220
• /
• 2004

현재까지 IDS는 관리자의 개입 없이는 효과적인 운용이 불가능하고, IDS를 사용하더라도 여전히 침입 발생 가능성이 있고, 다양한 우회 가능성이 존재한다. 본 논문에서는 기존에 제안된 침입탐지 시스템을 분석하고, C-Box에 규정된 정책을 이용한 데이타소스 기반의 침입탐지 시스템을 설계하여 이를 실험하였다. 본 연구는 데이터 소스 기반에서 침입 탐지 방법 기준의 비정상적인 형태에 의한 탐지와 오류에 의한 탐지기법을 적용하였으며, IDS에 침입 탐지 정책을 설계하였고, 규정에 의한 정책중심의 침입탐지 기법을 정상적인 동작과 비정상적인 동작을 구분하는 경계를 정의한다. 또한, 침입탐지 정책을 이용한 호스트기반 IDS를 설계하고 구현함으로서 정보시스템의 취약성을 보완할 수 있었다. 침입탐지 실험을 위한 시스템 호출 기술은 커널에 프로세스들의 특성을 자세하게 정의하고, 이를 실행할 수 있도록 기반을 구축함으로서 가능하게 하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.280-283
• /
• 2010

Web2.0 시대를 맞아, 개인화(Personalize)와 사용자 중심(User Centric Method)의 참여형 서비스 시나리오에 기반하여 융합단말이 사용되어지고 있다. 대표적인 사용예가 UCC인데, 효과적인 지식공유와 적절한 정보를 추천하기 위해 효율적인 UCC 기반 콘텐츠의 사용의 참조(참조)가 가능하여야 한다. 본 논문에서는 UCC Learning의 효율적인 콘텐츠 양방향 서비스를 위하여, 참조 요소 관리를 할 수 있도록 데이터베이스를 설계 운영할 수 있는 방안에 관하여 연구하였다. 향후, 저작도구를 사용하여, UCC를 저작하는 한계를 극복하여, 다양한 콘텐츠방식 저작에 활용되어질 수 있도록 할 계획이다.

• Journal of Astronomy and Space Sciences
• /
• v.3 no.2
• /
• pp.71-79
• /
• 1986

According to recent satellite observations, strong ion transverse acceleration to the magnetic field(ion conics) has been known. The ion conics may be a result of electrostatic waves frequently observed on the auroral zone. Both linear and nonlinear theory of electrostatic instability driven by an electron current based on 1-dimensional particle simulation experiment have been considered. From the results of simulation strong ion transverse acceleration has been shown.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1749-1758
• /
• 1997

This paper suggests the development of dynamic forecasting model for short-term power demand based on Radial Basis Function Network and Pal's GLVQ algorithm. Radial Basis Function methods are often compared with the backpropagation training, feed-forward network, which is the most widely used neural network paradigm. The Radial Basis Function Network is a single hidden layer feed-forward neural network. Each node of the hidden layer has a parameter vector called center. This center is determined by clustering algorithm. Theatments of classical approached to clustering methods include theories by Hartigan(K-means algorithm), Kohonen(Self Organized Feature Maps %3A SOFM and Learning Vector Quantization %3A LVQ model), Carpenter and Grossberg(ART-2 model). In this model, the first approach organizes the load pattern into two clusters by Pal's GLVQ clustering algorithm. The reason of using GLVQ algorithm in this model is that GLVQ algorithm can classify the patterns better than other algorithms. And the second approach forecasts hourly load patterns by radial basis function network which has been constructed two hidden nodes. These nodes are determined from the cluster centers of the GLVQ in first step. This model was applied to forecast the hourly loads on Mar. $4^{th},\;Jun.\;4^{th},\;Jul.\;4^{th},\;Sep.\;4^{th},\;Nov.\;4^{th},$ 1995, after having trained the data for the days from Mar. $1^{th}\;to\;3^{th},\;from\;Jun.\;1^{th}\;to\;3^{th},\;from\;Jul.\;1^{th}\;to\;3^{th},\;from\;Sep.\;1^{th}\;to\;3^{th},\;and\;from\;Nov.\;1^{th}\;to\;3^{th},$ 1995, respectively. In the experiments, the average absolute errors of one-hour ahead forecasts on utility actual data are shown to be 1.3795%.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.641-649
• /
• 2004

The relationship between chemical structures and biological activities is researched briskly in the area of 'Medicinal Chemistry' At the base of these structure-based drug design tries, medicinal chemists search the existing drugs of similar chemical structure to target drug for the development of a new drug. Therefore, it is such necessary that an automatic system selects drug files that have a set of chemical moieties matching a user-defined query moiety. Substructure searching is the process of identifying a set of chemical moieties that match a specific query moiety. Testing for substructure searching was developed in the late 1950s. In graph theoretical terms, this problem corresponds to determining which graphs in a set are subgraph isomorphic to a specified query moiety. Testing for subgraph isomorphism has been proved, in the general case, to be an NP- complete problem. For the purpose of overcoming this difficulty, there were computational approaches. On the 1990s, a US patent has been granted on an atom-centered indexing scheme, used by the RS3 system; this has the virtue that the indexes generated can be searched by direct text comparison. This system is commercially used(http://www.acelrys.com/rs3). We define the RS3 system's drawback and present a new indexing scheme. The RS3 system treats substructure searching with substring matching by means of expressing chemical structure aspredefined strings. However, it has insufficient 'rerall' and 'precision‘ because it is impossible to index structures uniquely for same atom and same bond. To resolve this problem, we make the minimum-cost- spanning tree for one centered atom and describe a structure with paths per levels. Expressing 2D chemical structure into 1D a string has limit. Therefore, we break 2D chemical structure into 1D structure fragments. We present in this paper a new index technique to improve recall and precision surprisingly.

• The Korean Journal of Archival Studies
• /
• no.19
• /
• pp.57-102
• /
• 2009

Recently, distribution of record via web and coefficient of utilization are increase. so, Archival information service using website becomes essential part of record center. The main point of archival information service by website is making record information retrieval easy. It has need of matching user's request and representation of record resources correctly to making archival information retrieval easy. Archivist and record manager have used various information representation tools from taxonomy to recent thesaurus, still, the accuracy of information retrieval has not solved. This study constructed record retrieval system based on Topic Map by modeling record resources which focusing on description metadata of the records to improve this problem. The target user of the system is general web users and its range is limited to the president related sources in the National Archives Portal Service. The procedure is as follows; 1) Design an ontology model for archival information service based on topic map which focusing on description metadata of the records. 2) Buildpractical record retrieval system with topic map that received information source list, which extracted from the National Archives Portal Service, by editor. 3) Check and assess features of record retrieval system based on topic map through user interface. Through the practice, relevance navigation to other record sources by semantic inference of description metadata is confirmed. And also, records could be built up as knowledge with result of scattered archival sources.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.257-266
• /
• 2007

In On-Chip bus, the arbitration scheme is one of the critical factors that decide the overall system performance. The arbitration scheme used in traditional shared bus is the master-side arbitration based on the request and grant signals between multiple masters and single arbiter. In the case of the master-side arbitration, only one master and one slave can transfer the data at a time. Therefore the throughput of total bus system and the utilization of resources are decreased in the master-side arbitration. However in the slave-side arbitration, there is an arbiter at each slave port and the master just starts a transaction and waits for the slave response to proceed to the next transfer. Thus, the unit of arbitration can be a transaction or a transfer. Besides the throughput of total bus system and the utilization of resources are increased since the multiple masters can simultaneously perform transfers with independent slaves. In this paper, we implement and analyze the arbitration schemes for the Multi-Layer AHB BusMatrix based on the slave-side arbitration. We implement the slave-side arbitration schemes based on fixed priority, round robin and dynamic priority and accomplish the performance simulation to compare and analyze the performance of each arbitration scheme according to the characteristics of the master and slave. With the performance simulation, we observed that when there are few masters on critical path in a bus system, the arbitration scheme based on dynamic priority shows the maximum performance and in other cases, the arbitration scheme based on round robin shows the highest performance. In addition, the arbitration scheme with transaction based multiplexing shows higher performance than the same arbitration scheme with single transfer based switching in an application with frequent accesses to the long latency devices or memories such as SDRAM. The improvements of the arbitration scheme with transaction based multiplexing are 26%, 42% and 51%, respectively when the latency times of SDRAM are 1, 2 and 3 clock cycles.

• Journal of KIISE:Databases
• /
• v.37 no.6
• /
• pp.315-323
• /
• 2010

In Wireless Sensor Networks (WSNs), various Data-Centric Storages (DCS) schemes have been proposed to store the collected data and to efficiently process a query. A DCS scheme assigns distributed data regions to sensor nodes and stores the collected data to the sensor which is responsible for the data region to process the query efficiently. However, since the whole data stored in a node will be lost when a fault of the node occurs, the accuracy of the query processing becomes low, In this paper, we propose an in-network aggregation query processing method that assures the high accuracy of query result in the case of data loss due to the faults of the nodes in the DCS scheme. When a data loss occurs, the proposed method creates a compensation model for an area of data loss using the linear regression technique and returns the result of the query including the virtual data. It guarantees the query result with high accuracy in spite of the faults of the nodes, To show the superiority of our proposed method, we compare E-KDDCS (KDDCS with the proposed method) with existing DCS schemes without the data-loss correction method. In the result, our proposed method increases accuracy and reduces query processing costs over the existing schemes.

• Water for future
• /
• v.26 no.4
• /
• pp.97-105
• /
• 1993

This paper presents the results of a study conducted to improve the understanding of the characteristics of cylindrical capsule flow in a pipeline by taking into account of the effect of capsule density uniformity. The effect of capsule density variation in the axial direction was studied both experimentally and anaytically. The experiments were conducted in a 190mm diameter straight pipe 17m long. The velocity, gap and tilt of capsules were measured under various conditions, In order to interpret the data on various capsule density conditions, the stability index given in the dimensionless number was introduced. The motion of capsules in pipelines is strongly affected by the stability of the capsules characterized by the stability index. The experiments conducted prover that the stability index is a valid criterion for explaining and correlating data on the capsule motion and the capsule density uniformity.