• Proceedings of the Korea Water Resources Association Conference
• /
• 2020.06a
• /
• pp.23-23
• /
• 2020

하구 관측은 조사 방법 및 주기에 따라 크게 두 가지로 구분되는데, 첫째는 현장에서 직접 주기적으로 자료를 수집하는 정기 현장관측과 다른 하나는 고정된 지점에 관측소를 설치하여 실시간으로 연속된 자료를 수집하는 실시간 관측으로 분류된다. 본 연구는 하구 관측망 체계를 확립하기 위한 기초 연구로서 금강하구역을 대상으로 모의된 수치 모델 자료를 이용하여 관측망을 설계하기 위한 대표 모니터링 지표를 선정하고, 이를 기반으로 관측 지점을 설계하기 위한 전략을 제시하였다. 대표 모니터링 지표는 실제 현장에서 일반적으로 취득할 수 있는 6가지 항목(수온, 염분, 용존산소, 클로로필a, 총질소, 총인)을 대상으로 EOF 분석을 실시하여 해역의 시공간 분포를 대표할 수 있다고 판단되는 2개의 항목을 선정하였다. 대표 모니터링 지점은 2개의 대표 모니터링 지표에 대한 고유 벡터 사이의 각도를 벡터의 내적으로 계산하고 이를 설계변수로 활용하여 도식최적화 기법을 통해 각 모니터링 항목들에 대한 공간 분포를 가장 잘 재현해 낼 수 있는 지점의 개수와 위치를 선정하였다. 선정된 모니터링 지점들을 이용하여 재구성된 공간 분포를 참값(수치모델)과 비교하여 통계적 적정성 여부를 평가하였으며, 이를 통해 금강하구의 대표 모니터링 지점들을 도출 해 내었다. 금강하구의 정기 현장 관측에 대한 대표 모니터링 지점은 7개로 선정되었으며, 이들은 6가지 관측 항목들에 대해서 매우 높은 공간분포 재현율을 확보할 수 있음을 확인하였다. 또한, 담수가 비정기적으로 방류되는 금강하구 시스템의 지역적 특성에 대한 시계열 정보를 연속적으로 가장 잘 취득할 수 있는 실시간 관측소 설치 영역을 결정하기 위하여, 7개의 대표 모니터링 지점에서의 시계열 정보를 금강하구둑 전면과 외해의 시계열 정보와 비교분석하여 설치가능 지점을 영역으로 제언하였다.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2008.06a
• /
• pp.809-810
• /
• 2008

• Proceedings of the Korea Water Resources Association Conference
• /
• 2007.05a
• /
• pp.1803-1807
• /
• 2007

본 연구에서는 개념적인 강우-유출모형인 Tank 모형에 대하여 유역의 다양한 유출특성을 잘 반영할 수 있는 매개변수를 산정하는 데에 그 목적을 두었다. 이를 위한 최적화 알고리즘은 다목적 유전자 알고리즘인 NSGA-II를 선정하여 Tank 모형과 결합하였으며, 4가지의 목적함수를 대상으로 다양한 함수값을 나타내는 비지배관계의 최적군을 생산하였다. 수 백개로 나타나는 최적군의 다양한 해들 중, 특정 목적함수에 대하여서만 정도가 높거나 낮은 편협한 해들을 배제하고 두루 정도가 높은 값을 나타내는 소수의 비지배해들을 추출하기 위하여 선호적 순서화 기법이 적용되었다. 그 결과 많은 해들 중 단 4개의 해가 최우선해의 위치를 갖는 것으로 나타났으며, 이러한 방법론으로 최적화된 해의 적합성을 살펴보고자 국부최적화 기법인 Powell 방법과 기존에 널리 쓰여온 유전자 알고리즘인 SGA(Simple Generic Algoritm)의 결과와 비교 검정을 수행하였다. 비교한 결과 NSGA-II를 적용하여 산정된 매개변수가 4가지 목적함수 및 관측유량과의 통계치에서 두루 양호한 결과를 나타내었다. 또한 관측유량과 함께 도식하여 살펴본 결과, NSGA-II의 최우선해가 타 자동보정 기법에 비하여 상대적으로 관측치에 보다 잘 부합되는 모의유량을 계산하는 것으로 나타났다.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.251-267
• /
• 2008

In this paper, we present a distributed topology control algorithm for constructing an optimized topology having a minimal search-time in unstructured peer-to-peer network. According to the proposed algorithm, each node selects the best nodes having higher hit-ratio than other nodes as many as the number being exponentially proportional to the hit-ratio of the node itself, and then it connects to them. The ensemble behavior of the proposed algorithm is very similar to the recrystrallizing phenomenon that is observed in nature. There is a partial order relationship among the hit-ratios of most nodes of constructed topology. Therefore once query message visits a node, it has a higher hit-ratio than the node that was visited last by the message. The query message even sent from freeloader can escape to the node having high hit-ratio by one hop forwarding, and it never revisits any freeloader again. Thus the search can be completed within a limited search time. We also propose the Chain-reactive search scheme using the constructed topology. Such a controlled multicasting reduces the query messages by 43 percent compared to that of the naive Gnutella using broadcasting, while it saves the search time by 94 percent. The search success rate of the proposed scheme is 99 percent.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.6
• /
• pp.4216-4227
• /
• 2015

In this study, a model is developed based on Life Cycle Energy Analysis (LCEA) method with Genetic Algorithm (GA) to determine optimal diameter of Water Distribution System (WDS). For hydraulic analysis the EPANET2.0 program is linked with developed model, pipe-aging equation and pipe-breakage equation are built in to developed model to simulate pipe change through life cycle. The model is then applied to two sample WDSs for optimal energy design. After determining optimal diameter for each WDS, the total cost is calculated based on determined diameter and compared with well-known optimal diameter set of each WDS. Results show that optimal energy design of WDSs through the developed model can be an alternative option for optimal design of WDSs for reducing energy with lower in cost.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.1507-1510
• /
• 2012

본 논문은 EPS(전자식 파워 스티어링)에 사용되는 Torque and Angle sensor 의 절대각 신뢰성 보증 방식에 관한 것으로, Inductive 방식의 센서에서 절대각 신호 신뢰성 보증에 대한 효과적인 방법을 제시한다. 전동식 파워 스티어링 시스템의 ECU(전자제어유닛)는 조타각도를 출력하는 2 개의 소자에서 버니어 알고리즘을 통해 360 도 이상의 멀티 조타각을 인식하게 된다. 토크&조향각 센서는 절대 조향각을 계산하는 1 개의 Hall IC 소자 신호와, 상대 조향각을 계산하는 ASIC 소자 신호를 사용하여 멀티 조타각을 인식한다. 인식된 조타각이 추가적인 검증 절차 없이 제어에 사용된다면, 센서의 이상 발생 시에 운전자의 조타감을 불편해질 수 있고, 나아가서는 차량사고의 위험을 발생시킬 수 있다.따라서 차량 거동 시 절대 조향각의 신뢰성 검증은 제어와 동시에 항상 요구되어야 한다. 특히, 유럽/미국 업계의 ISO 26262 표준 도입에 따라 절대 조향각의 높은 신뢰성이 요구된다. 본 논문에서는 이러한 요구사항을 만족하기 위해 측정된 절대각 신호를 기준으로 상대각 신호 2 개를 측정에 사용하고, Driving 시에도 절대각 기준의 신뢰도 향상을 위해 절대각 신호 1 개를 비교기로 사용한다. 최적화된 에러 기준을 근거로 절대 조향각 신호의 신뢰성을 보장하는 방법을 제안한다. 이러한 방법을 적용한다면, 정확하고 안정적으로 조타각을 결정함으로써 EPS 안전성 확보에 도움을 줄 수 있다.

• Korean Chemical Engineering Research
• /
• v.51 no.2
• /
• pp.226-232
• /
• 2013

To produce biobutanol, fermentation processes using clostridia that mainly produce acetone, butanol and ethanol are used. In this work, a dynamic model describing the metabolic reactions in an acetone-butanol-ethanol (ABE)-producing clostridium, Clostridium acetobutylicum ATCC824, was proposed. To estimate the 58 kinetic parameters of the metabolic network model with experimental data obtained from a batch fermentor, we used an efficient optimization method combining a genetic algorithm and the Levenberg-Marquardt method because of the complexity of the metabolism of the clostridium. For the verification of the determined parameters, the developed metabolic model was evaluated by experiments where genetically modified clostridium was used and the initial concentration of glucose was changed. Consequently, we found that the developed kinetic model for the metabolic network was considered to describe the dynamic metabolic state of the clostridium sufficiently. Thus, this dynamic model for the metabolic reactions will contribute to designing the clostridium as well as the fermentor for higher productivity.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.28 no.5
• /
• pp.441-449
• /
• 2015

In this paper we perform a linearized buckling analysis using the Kirchhoff plate theory and the von Karman nonlinear strain-displacement relation. Design sensitivity analysis(DSA) expressions for plane elasticity and buckling problems are derived with respect to Young's modulus and thickness. Using the design sensitivity, we can formulate the topology optimization method for minimizing the compliance and maximizing eigenvalues. We develop a topology optimization method applicable to plate buckling problems using the prestress for buckling analysis. Since the prestress is needed to assemble the stress matrix for buckling problem using the von Karman nonlinear strain, we introduced out-of-plane motion. The design variables are parameterized into normalized bulk material densities. The objective functions are the minimum compliance and the maximum eigenvalues and the constraint is the allowable volume. Through several numerical examples, the developed DSA method is verified to yield very accurate sensitivity results compared with the finite difference ones and the topology optimization yields physically meaningful results.

• 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.