• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.10a
• /
• pp.697-700
• /
• 2019

무장데이터링크 시뮬레이션은 네트워크 기반 유도무기 모델링을 위하여 M&S 기술을 바탕으로 무장데이터링크의 운용성 및 정밀타격 성능을 검증하기 위한 시뮬레이션 소프트웨어다. 네트워크 기반 유도무기 모델은 원격임무통제를 위한 무장데이터링크망과 가상전장을 위한 시뮬레이션망이 연동하는 분산네트워크 환경에서 동작한다. 이때 유도탄모델 인터페이스는 다수의 프로토콜과 종속관계를 갖게 된다. 따라서 프로토콜이 수정될 때마다 유도탄모델 뿐만 아니라, 해당 인터페이스를 사용하는 다른 프로토콜도 수정되어야 한다. 또한 시뮬레이션 특성상 다양한 운용개념이 유도탄모델에 적용될 수 있다. 기존 고정표적 유도탄모델에 임무통제기능을 적용할 경우, 기존 모델이 훼손될 뿐만 아니라 기능 추가 및 삭제가 쉽지 않다는 문제가 있다. 본 논문은 서로 다른 프로토콜을 유도탄모델에 쉽게 적용하고 변경할 수 있는 프로토콜 변경용이성과 기 개발된 고정표적 유도탄모델을 변경하지 않고 무장데이터링크 운용 개념을 적용할 수 있는 유도탄모델 확장성을 위한 구조를 제안한다.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.17 no.2
• /
• pp.171-181
• /
• 2004

This paper developed the theoretical method to predict structural performances and weight reduction rates of a carbody when its materials should be substituted. For the material substitution design of the carbody, the bending, axial and twisting deformations are evaluated under the constant stiffness and strength conditions. For the design of the primary structures such as the center beams, the cross beams and the cantrails, the bending and axial deformations are investigated under the condition of the constant bending stiffness, the constant bending or buckling strength by considering both the material properties and the cross sectional shapes. The developed indices to measure the weight reduction by the material substitution give good informations on the weak and strong points of a carbody design.

• The Journal of the Korea Contents Association
• /
• v.7 no.7
• /
• pp.11-23
• /
• 2007

Applications involving moving objects require index structures to handle frequent updates of objects' locations efficiently. Several methods to index the current, the past and the future positions of moving objects have been proposed for the applications. Most of them are based on R-tree like index structures. Some researches have made efforts to improve update performance of R-trees that are actually focused on query performance. Even though the update performance is improved by researchers' efforts, the overhead and immaturity of concurrency control algorithms of R-trees makes us hesitate to choose them for moving objects. In this paper, we propose an update efficient indexing method that can be applicable for indexing the past, the current and the future locations. The proposed index is based on B+-Trees and Hilbert curve. We present an advanced Hilbert curve that adjusts automatically the order of Hilbert curve in subregions according to the data distribution and the number of data objects. Through empirical studies, we show that our strategy achieves higher response time and throughput.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.8
• /
• pp.293-298
• /
• 2014

Detecting and understanding the changes between RDF data is crucial in the evolutionary process, synchronization system, and versioning system on the web of data. However, current researches on detecting changes still remain unsatisfactory in that they did neither consider the large scale of RDF data nor accurately produce the RDF deltas. In this paper, we propose a scalable and effective change detection using a MapReduce framework which has been used in many fields to process and analyze large volumes of data. In particular, we focus on the structure-based change detection that adopts a strategy for the comparison of blank nodes in RDF data. To achieve this, we employ a method which is composed of two MapReduce jobs. First job partitions the triples with blank nodes by grouping each triple with the same blank node ID and then computes the incoming path to the blank node. Second job partitions the triples with the same path and matchs blank nodes with the Hungarian method. In experiments, we show that our approach is more accurate and effective than the previous approach.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.36 no.1
• /
• pp.39-48
• /
• 2023

Because a railway bridge is designed over a long period of time and covers a large site, it involves various environmental factors and uncertainties. For this reason, design changes often occur, even if the design was thoroughly reviewed in the initial design stage. In particular, design changes of large-scale facilities, such as railway bridges, consume significant time and cost, and it is extremely inefficient to repeat all the procedures each time. In this study, a technique that can improve the efficiency of learning after design change was developed by utilizing the learning result before design change through transfer learning among deep-learning algorithms. For analysis, scenarios were created, and a database was built using a previously developed railway bridge deep-learning-based prediction system. The proposed method results in similar accuracy when learning only 1000 data points in the new domain compared with the 8000 data points used for learning in the old domain before the design change. Moreover, it was confirmed that it has a faster convergence speed.

• The Journal of Society for e-Business Studies
• /
• v.12 no.3
• /
• pp.33-47
• /
• 2007

The requirements have been changed during development progresses, since it is impossible to define all of software requirements. These requirements change leads to mistakes because the developers cannot completely understand the software's structure and behavior, or they cannot discover all parts affected by a change. Requirement changes have to be managed and assessed to ensure that they are feasible, make economic sense and contribute to the business needs of the customer organization. We propose a feature-oriented requirements change management method to manage requirements change with value analysis and feature-oriented traceability links including intermediate catalysis using features. Our approach offers two contributions to the study of requirements change: (1) We define requirements change tree to make user requirements change request generalize by feature level. (2) We provide overall process such as change request normalization, change impact analysis, solution dealing with change request, change request implementation, change request evaluation. In addition, we especially present the results of a case study which is carried out in asset management portal system in details.

• Journal of KIISE:Databases
• /
• v.37 no.4
• /
• pp.197-202
• /
• 2010

Recent studies on change detection for RDF data are focused on not only the structural difference but also the semantic-aware difference by computing the closure of RDF models. However, since these techniques which take into account the semantics of RDF model require both RDF models to be memory resident, or they use a forward-chaining strategy which computes the entire closure in advance, it is not efficient to apply them directly to detect changes in large RDF data. In this paper, we propose a scalable change detection technique for RDF data, which uses a backward-chaining inference based on relational database. Proposed method uses a new approach for RDF reasoning that computes only the relevant part of the closure for change detection in a relational database. We show that our method clearly outperforms the previous works through experiment using the real RDF from the bioinformatics domain.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.424-426
• /
• 2004

웹 기술이 발달할수록 사회 전반의 패러다임 변화속도는 빨라지고, 사용자의 요구 사항과 웹 프로그램 내부의 복잡성은 증가한다. 또한 콘텐츠의 생명 주기는 짧아지고, 웹 프로그램의 구조 변경과 유지보수가 많아지게 된다. 따라서 동적인 변화에 빠르게 대처할 수 있는 웹 프로그램 기술이 더욱 요구되고 있다. XML은 계층적 구조를 갖고 있으면서도 구조적 변경이 가능하고, 다른 형태로의 변환이 용이하다. 본 논문에서는 이런 장점을 이용하여 개발 기간을 단축시킬 수 있는 방법의 하나로, XML을 기반으로 하는 웹 프로그램 개발 지원 서버를 이용해 쉽고 간편하게 웹 서버 프로그램을 개발하고, 유지보수 할 수 있도록 하는데 중점을 두고 웹 기반의 XML 트리를 설계하고 구현하였다. XML 트리는 파싱뿐만 아니라 계층적 구조를 이루고 있어 접근성이 우수하고, XML 스키마와 XML 스타일시트 작성에도 않은 도움을 줄 수 있을 것으로 기대된다.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.18 no.2
• /
• pp.208-214
• /
• 2008

This paper presents a structural modification for the performance improvement of a grain sorting machine. The grain sorting machine is used to sort abnormal grains from normal grains such as rice or wheat. Vibration is one of main causes to deteriorate the sorting performance of the machine. Based on the finite element analysis and the experimental modal testing, the vibration characteristics were investigated for the sorting machine. Furthermore, in order to improve the sorting performance of the machine, the frame, chute and base plate of the sorting machine were modified by using the results of the vibration analysis.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.178-180
• /
• 2002

최근 종이 문서의 전자화가 이루어지면서 기존의 전통적인 펜기반 교정 시스템 또한 온라인 상의 전자 문서 환경에 맞게 구축되고 있다. 이러한 펜기반 입력 기법을 사용하는 교정 시스템에서는 교정 부호와 텍스트 간의 정확한 영역 인식이 중요하며 이를 위해 교정 부호의 특성과 텍스트 영역의 분석이 필요하다. 본 연구에서는 온라인 교정 시스템 모델링을 통하여 온라인 환경에 적합한 교정 부호를 정의하고, 교정 대상 텍스트 영역을 편집 가능한 단위로 구분하여 효율적인 편집 연산이 이루어 질 수 있도록 하였다. 또한 웹 기반의 구조문서(HTML/XML) 편집 환경을 고려하여 편집으로 인한 문서의 구조 정보 변경을 지원하기 위하여 텍스트를 비구조 및 구조정보 텍스트로 분류하여 정의하였다. 본 연구에서는 이러한 모델에 기반하여 교정 부호의 특성에 따른 가변적인 편집 텍스트 영역 인식 규칙 모델을 정의하여 교정부호와 편집 텍스트 영역간의 모호성을 최소화 하고, 편집으로 인한 문서의 구조 정보 변경을 지원하는 시스템을 구현하였다. 결과적으로 온라인 웹 문서 환경에서 펜기반의 모호한 교정 부호의 입력을 인지적인 관점에서 해석하여 보다 정확한 교정 작업 수행을 지원하도록 하였다.