• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.42-55
• /
• 2006

We propose a single Index approach for subsequence matching that supports moving average transform of arbitrary order in time-series databases. Using the single index approach, we can reduce both storage space overhead and index maintenance overhead. Moving average transform is known to reduce the effect of noise and has been used in many areas such as econometrics since it is useful in finding overall trends. However, the previous research results have a problem of occurring index overhead both in storage space and in update maintenance since tile methods build several indexes to support arbitrary orders. In this paper, we first propose the concept of poly-order moving average transform, which uses a set of order values rather than one order value, by extending the original definition of moving average transform. That is, the poly-order transform makes a set of transformed windows from each original window since it transforms each window not for just one order value but for a set of order values. We then present theorems to formally prove the correctness of the poly-order transform based subsequence matching methods. Moreover, we propose two different subsequence matching methods supporting moving average transform of arbitrary order by applying the poly-order transform to the previous subsequence matching methods. Experimental results show that, for all the cases, the proposed methods improve performance significantly over the sequential scan. For real stock data, the proposed methods improve average performance by 22.4${\~}$33.8 times over the sequential scan. And, when comparing with the cases of building each index for all moving average orders, the proposed methods reduce the storage space required for indexes significantly by sacrificing only a little performance degradation(when we use 7 orders, the methods reduce the space by up to 1/7.0 while the performance degradation is only $9\%{\~}42\%$ on the average). In addition to the superiority in performance, index space, and index maintenance, the proposed methods have an advantage of being generalized to many sorts of other transforms including moving average transform. Therefore, we believe that our work can be widely and practically used in many sort of transform based subsequence matching methods.

• Bulletin of the Society of Naval Architects of Korea
• /
• v.27 no.3
• /
• pp.131-136
• /
• 1990

여러해 전부터 선박의 생산실적이나 생산성 관련 자료를 기록하고 보완하는 작업을 꾸준히 개선토록 노력해온 결과중 중요한 것 하나는, 선박의 여러 가지 설계 검토과정에서 충분히 활용할 수 있는 함축성 있고 믿을만한 형태의 생산정보를 제공해줄 수 있게 되었다는 것이라고 말 할 수 있겠다. 이러한 자료들은 생산계획상 각 단계(stage)에서의 작업량, 예상재료비와 인건비의 산출등이 포함될 수 있으며, 선박이나 해상구조물의 전반적인 설계방법론(design methodology)을 개선코자 한다면 ''생산지향적 설계(Design for Production)''의 근간이 되는 선박건조전략(build strategy), 구매정책(purchasing policy)과 생산기술(production technology)에 대한 폭넓은 지식이 한데 어우러져야 한다. 최근에는 CIMS의 일부분에서 보는 바와 같은 경영관리, 설계 및 생산지원 시스템의 도입으로 이와 같은 설계 프로세스의 추진을 가능케하고 있다. 이와 병행하여 설계를 지원하기 위한 전산기술, 특히 대화형 화상처리기술(interactive graphics)의 발달은 설계자가 선박의 형상이나 구조 배치를 여러 가지로 변화시켜 가면서 눈으로 즉시 확인할 수 있도록 설계자의 능력을 배가시키는데 크게 기여하고 있다. 여러 가지의 설계안(alternative design arrangement)을 신속히 만들어내고 이를 즉시 검토 평가할 수 있는 능력을 초기설계 단계에서 가질 수 있다면 이는 분명히 큰 장점일 것이며, 더구나 설계초기 단계에 생산관련인자를 설계에서 고려할 수 있다면 이는 더욱 두드러진 발전일 것이다. 생산공법과 관련생산 비용을 정확히 반영한 각 가지의 설계안을 짧은 시간내에 검토하고 생산소요 비용을 산출하여 비교함으로써, 수주계약단계에서 실제적인 생산공법과 신뢰성있는 생산실적자료를 기준으로 하여 총 건조비(total production cost)를 최소로 하는 최적의 설계를 선택할 수 있도록 해 줄 것이다. 이제 이와 같은 새로운 설계도구(design tool)를 제공해 주므로써 초기설계에 각종 생산관련 정보나 지식 및 실적자료가 반영가능토록 발전되었다. 본 논문은 영국의 뉴카슬대학교(Univ. of Newcastle upon Type)에서 위에 언급한 특징들을 반영하여 새로운 선박구조 설계 방법을 개발한 연구결과를 보여주고 있다. 본 선계연구는 5단계로 구분되는데; (1) 컴퓨터 그라픽스를 이용하고 생산정보 데이타베이스와 연결시켜 구조형상(geometry)을 정의하고 구조부재 칫수(scantling) 계산/결정 (2) 블럭 분할(block division) 및 강재 배치(panel arrangement)의 확정을 위해 생산기술 및 건조방식에 대한 정보 제공 (3) 상기 (1) 및 (2)를 활용하여 아래 각 생산 단계에서의 생산작업 분석(work content assessment) a) 생산 준비 단계(Preparation) b) 가공 조립 단계(Fabrication/Assembly) c) 탑재 단계(Erection) (4) 각각의 설계(안)에 대하여 재료비(material cost), 인건비(labour cost) 및 오버헤드 비용(overhead cost)을 산출키 위한 조선소의 생산시설 및 각종 품셈 정보 (5) 총 건조 비용(total production cost)을 산출하여 각각의 설계안을 비교 검토. 본 설계 방식을 산적화물선(Bulk Carrier) 설계에 적용하여 구조배치(structural geometry), 표준화의 정도(levels of standardisation), 구조생산공법(structural topology) 등의 변화에 따른 설계 결과의 민감도를 분석(sensitivity studies)하였다. 전산장비는 설계자의 대화형 접근을 용이하도록 하기 위해 VAX의 화상 처리장치를 이용하여 각 설계안에 대한 구조형상과 작업분석, 건조비 현황 등을 제시할 수 있도록 하였다. 결론적으로 본 연구는 설계초기 단계에서 상세한 건조비 모델(detailed production cost model)을 대화형 화상 처리방법에 접합시켜 이를 이용하여 여러가지 설계안의 도출과 비교검토를 신속히 처리할 수 있도록 함은 물론, 각종 생산 실적정보를 초기설계에 반영하는 최초의 시도라고 믿으며, 생산지향적(Design for Production) 최적설계분야의 발전에 많은 도움이 되기를 기대해 마지 않는다. 참고로 본 시스템의 설계 적용결과를 부록에 요약 소개하며, 상세한 내용은 참고문헌 [4] 또는 [7]을 참조 요망한다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.8
• /
• pp.15-22
• /
• 2019

Awireless sensor network utilizes small sensors with a low cost and low power being deployed over a wide area. They monitor the surrounding environment and gather the associated information to transmit it to a base station via multi-hop transmission. Most of the research has mainly focused on static sensors that are located in a fixed position. Unlike a wireless sensor network based on static sensors, we can exploit drone-based technologies for more efficient wireless networks in terms of coverage and energy. In this paper, we introduce a transmission power model and a video encoding power model to design the network environment. We also explain a priority mapping scheme, and deploy drones oriented for network coverage and energy consumption. Through our simulations, this research shows coverage and energy improvements in adrone-based wireless sensor network with fewer sensors, compared to astatic sensor-based wireless sensor network. Concretely, coverage increases by 30% for thedrone-based wireless sensor network with the same number of sensors. Moreover, we save an average of 25% with respect to the total energy consumption of the network while maintaining the coverage required.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.1 s.11
• /
• pp.73-85
• /
• 2004

Recently, as the growth of the wireless Internet, PDA and HPC, the focus of research and development related with GIS(Geographic Information System) has been changed to the Real-Time Mobile GIS to service LBS. To offer LBS efficiently, there must be the Real-Time GIS platform that can deal with dynamic status of moving objects and a location index which can deal with the characteristics of location data. Location data can use the same data type(e.g., point) of GIS, but the management of location data is very different. Therefore, in this paper, we studied the Real-Time Mobile GIS using the HBR-tree to manage mass of location data efficiently. The Real-Time Mobile GIS which is developed in this paper consists of the HBR-tree and the Real-Time GIS Platform HBR-tree. we proposed in this paper, is a combined index type of the R-tree and the spatial hash Although location data are updated frequently, update operations are done within the same hash table in the HBR-tree, so it costs less than other tree-based indexes Since the HBR-tree uses the same search mechanism of the R-tree, it is possible to search location data quickly. The Real-Time GIS platform consists of a Real-Time GIS engine that is extended from a main memory database system. a middleware which can transfer spatial, aspatial data to clients and receive location data from clients, and a mobile client which operates on the mobile devices. Especially, this paper described the performance evaluation conducted with practical tests if the HBR-tree and the Real-Time GIS engine respectively.

• Journal of Intelligence and Information Systems
• /
• v.27 no.4
• /
• pp.49-71
• /
• 2021

Users who intend to utilize knowledge to actively solve given problems proceed their jobs with cross- and sequential exploration of associated knowledge related each other in terms of certain criteria, such as content relevance. A knowledge map is the diagram or taxonomy overviewing status of currently managed knowledge in a knowledge-base, and supports users' knowledge exploration based on certain relationships between knowledge. A knowledge map, therefore, must be expressed in a networked form by linking related knowledge based on certain types of relationships, and should be implemented by deploying proper technologies or tools specialized in defining and inferring them. To meet this end, this study suggests a methodology for developing the knowledge graph-based knowledge map using the Graph DB known to exhibit proper functionality in expressing and inferring relationships between entities and their relationships stored in a knowledge-base. Procedures of the proposed methodology are modeling graph data, creating nodes, properties, relationships, and composing knowledge networks by combining identified links between knowledge. Among various Graph DBs, the Neo4j is used in this study for its high credibility and applicability through wide and various application cases. To examine the validity of the proposed methodology, a knowledge graph-based knowledge map is implemented deploying the Graph DB, and a performance comparison test is performed, by applying previous research's data to check whether this study's knowledge map can yield the same level of performance as the previous one did. Previous research's case is concerned with building a process-based knowledge map using the ontology technology, which identifies links between related knowledge based on the sequences of tasks producing or being activated by knowledge. In other words, since a task not only is activated by knowledge as an input but also produces knowledge as an output, input and output knowledge are linked as a flow by the task. Also since a business process is composed of affiliated tasks to fulfill the purpose of the process, the knowledge networks within a business process can be concluded by the sequences of the tasks composing the process. Therefore, using the Neo4j, considered process, task, and knowledge as well as the relationships among them are defined as nodes and relationships so that knowledge links can be identified based on the sequences of tasks. The resultant knowledge network by aggregating identified knowledge links is the knowledge map equipping functionality as a knowledge graph, and therefore its performance needs to be tested whether it meets the level of previous research's validation results. The performance test examines two aspects, the correctness of knowledge links and the possibility of inferring new types of knowledge: the former is examined using 7 questions, and the latter is checked by extracting two new-typed knowledge. As a result, the knowledge map constructed through the proposed methodology has showed the same level of performance as the previous one, and processed knowledge definition as well as knowledge relationship inference in a more efficient manner. Furthermore, comparing to the previous research's ontology-based approach, this study's Graph DB-based approach has also showed more beneficial functionality in intensively managing only the knowledge of interest, dynamically defining knowledge and relationships by reflecting various meanings from situations to purposes, agilely inferring knowledge and relationships through Cypher-based query, and easily creating a new relationship by aggregating existing ones, etc. This study's artifacts can be applied to implement the user-friendly function of knowledge exploration reflecting user's cognitive process toward associated knowledge, and can further underpin the development of an intelligent knowledge-base expanding autonomously through the discovery of new knowledge and their relationships by inference. This study, moreover than these, has an instant effect on implementing the networked knowledge map essential to satisfying contemporary users eagerly excavating the way to find proper knowledge to use.