• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2006년도 Proceedings of ISRS 2006 PORSEC Volume I
• /
• pp.500-503
• /
• 2006

To adjust the discrepancy between Light Detection and Ranging (LIDAR) strips, previous researches generally have been conducted using conjugate features, which are called feature-based approaches. However, irrespective of the type of features used, the adjustment process relies upon the existence of suitable conjugate features within the overlapping area and the ability of employed methods to detect and extract the features. These limitations make the process complex and sometimes limit the applicability of developed methodologies because of a lack of suitable features in overlapping areas. To address these drawbacks, this paper presents a methodology using area-based algorithms. This approach is based on the scheme that discrepancies make complex the local height variations of LIDAR data whithin overlapping area. This scheme can be helpful to determine an appropriate transformation for adjustment in the way that minimizes the geographical complexity. During the process, the contour tree (CT) was used to represent the geological characteristics of LIDAR points in overlapping area and the Iterative Closest Points (ICP) algorithm was applied to automatically determine parameters of transformation. After transformation, discrepancies were measured again and the results were evaluated statistically. This research provides a robust methodology without restrictions involved in methods that employ conjugate features. Our method also makes the overall adjustment process generally applicable and automated.

• Journal of Information Science Theory and Practice
• /
• 제11권1호
• /
• pp.61-78
• /
• 2023

Ontological knowledge modelling of epic texts, though being an established research arena backed by concrete multilingual and multicultural works, still suffers from two key shortcomings. Firstly, all epic ontological models developed till date have been designed following ad-hoc methodologies, most often combining existing general purpose ontology development methodologies. Secondly, none of the ad-hoc methodologies consider the potential reuse of existing epic ontological models for enrichment, if available. This paper presents, as a unified solution to the above shortcomings, the design and development of GOMME - the first dedicated methodology for iterative ontological modelling of epics, potentially extensible to works in different research arenas of digital humanities in general. GOMME is grounded in transdisciplinary foundations of canonical norms for epics, knowledge modelling best practices, application satisfiability norms, and cognitive generative questions. It is also the first methodology (in epic modelling but also in general) to be flexible enough to integrate, in practice, the options of knowledge modelling via reuse or from scratch. The feasibility of GOMME is validated via a first brief implementation of ontological modelling of the Indian epic Mahabharata by reusing an existing ontology. The preliminary results are promising, with the GOMME-produced model being both ontologically thorough and competent performance-wise.

• 한국기계가공학회지
• /
• 제7권1호
• /
• pp.53-61
• /
• 2008

In this research, the layout and geometry of U-type ribs in the part, including significant process conditions, are automatically optimized to reduce part warpage with robustness in consideration. The optimization procedure are based on an iterative redesign methodology integrated with computer aided injection molding simulation, Taguchi's Design of Experiment(DOE), and a direct search-based optimization method. The robustness of a design alternative is efficiently measured by introducing composite noise factor and Taguchi's signal-to-noise ratio. As a solution search methodology, the modified design space reduction method based on orthogonal arrays is employed to exploit an optimal robust design alternative. To illustrate the proposed methodology, a case study is performed on simulation results, where an optimal robust design alternative is obtained with a moderate number of iterations.

• Journal of Advanced Marine Engineering and Technology
• /
• 제38권10호
• /
• pp.1303-1309
• /
• 2014

In this paper, we present an iterative learning control (ILC) framework for tracking problems with predefined data points that are desired points at certain time instants. To design ILC systems for such problems, a new ILC scheme is proposed to produce output curves that pass close to the desired points. Unlike traditional ILC approaches, an algorithm will be developed in which the control signals are generated by solving an optimal ILC problem with respect to the desired sampling points. In another word, it is a direct approach for the multiple points tracking ILC control problem where we do not need to divide the tracking problem into two steps separately as trajectory planning and ILC controller.The strength of the proposed formulation is the methodology to obtain a control signal through learning law only considering the given data points and dynamic system, instead of following the direction of tracking a prior identified trajectory. The key advantage of the proposed approach is to significantly reduce the computational cost. Finally, simulation results will be introduced to confirm the effectiveness of proposed scheme.

• International Journal of Fluid Machinery and Systems
• /
• 제8권3호
• /
• pp.209-219
• /
• 2015

A robust multi-fidelity optimization methodology has been developed, focusing on efficiently handling industrial runner design of hydraulic Francis turbines. The computational task is split between low- and high-fidelity phases in order to properly balance the CFD cost and required accuracy in different design stages. In the low-fidelity phase, a physics-based surrogate optimization loop manages a large number of iterative optimization evaluations. Two derivative-free optimization methods use an inviscid flow solver as a physics-based surrogate to obtain the main characteristics of a good design in a relatively fast iterative process. The case study of a runner design for a low-head Francis turbine indicates advantages of integrating two derivative-free optimization algorithms with different local- and global search capabilities.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 추계종합학술대회 논문집(2)
• /
• pp.144-147
• /
• 2000

Data security is an important issue in today's computer networks. In order to construct a safe infra in the open communication network, a cryptography is necessarily applied to several communication application fields like a high-speed networking system supporting real-time operation. A cryptography which has already realized by a software is designed by using a hardware to improve a throughput. In this paper, we design hardware architecture of IDEA by using a single iterative round method to improve a encryption throughput. In addition, we intend to develop a hardware design methodology that a specific cryptography operate with high-speed. The hardware model is described in VHDL and synthesized by the Samsung KG 80 Library in the Synopsys development software tool. With a system clock frequency 20MHz, this hardware permits a data conversion rate of more than 116 Mbit/s.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2001년도 춘계학술대회 논문집(한국공작기계학회)
• /
• pp.376-381
• /
• 2001

This paper presents a methodology of machining error compensation by using Artificial Neural Network(ANN) model based on the inspection database of On-Machine-Measurement(OMM) system. First, the geometric errors of the machining center and the probing errors are significantly reduced through compensation processes. Then, we acquire machining error distributions from a specimen workpiece. In order to efficiently analyze the machining errors, we define two characteristic machining error parameters. These can be modeled by using an ANN model, which allows us to determine the machining errors in the domain of considered cutting conditions. Based on this ANN model, we try to correct the tool path in order to effectively reduce the errors by using an iterative algorithm. The iterative algorithm allows us to integrate changes of the cutting conditions according to the corrected tool path. Experimentation is carried out in order to validate the approaches proposed in this paper.

• Earthquakes and Structures
• /
• 제8권3호
• /
• pp.639-663
• /
• 2015

Time history dynamic structural analysis is a time consuming procedure when used for large-scale structures or iterative analysis in structural optimization. This article proposes a new methodology for approximate prediction of extremum point of the response history via wavelets. The method changes original record into a reduced record, decreasing the computational time of the analysis. This reduced record can be utilized in iterative structural dynamic analysis of optimization and hence significantly reduces the overall computational effort. Design examples are included to demonstrate the capability and efficiency of the Reduced Record Method (RRM) when utilized in optimal design of frame structures using meta-heuristic algorithms.

• 대한수학회지
• /
• 제34권4호
• /
• pp.841-857
• /
• 1997

We present analysis and some computational methods for boundary optimal and feedback control problems for Navier-Stokes equations. We use one example to illustrate our methodology and ideas which are applicable to general control problems for Navier-Stokes equations. First, we discuss the existence of optimal solutions and derive an optimality system of equations from which an optimal solution may be computed. Then we present a gradient type iterative method. Finally, we present some numerical results.

• 대한수학회지
• /
• 제59권2호
• /
• pp.279-298
• /
• 2022

In this paper, the existence and uniqueness for the global solution of neutral stochastic functional differential equation is investigated under the locally Lipschitz condition and the contractive condition. The implicit iterative methodology and the Lyapunov-Razumikhin theorem are used. The stability analysis for such equations is also applied. One numerical example is provided to illustrate the effectiveness of the theoretical results obtained.