• Journal of applied mathematics & informatics
• /
• 제41권5호
• /
• pp.947-961
• /
• 2023

This paper summarizes some research findings that show how the differential transform method (DTM) is used to resolve the Holling-Tanner model. To confirm the application, effectiveness, and correctness of the approach, a comparison between the differential transform method (DTM) and the Adomian decomposition method (ADM) is carried out, and an accurate solution representation in truncated series is discovered. The approximate solution obtain using both techniques and comparison demonstrates same outcome which remains a preferred numerical method for resolving a system of nonlinear differential equations.

• 한국국방경영분석학회지
• /
• 제36권3호
• /
• pp.29-42
• /
• 2010

운용과학의 군사 응용 분야 중 하나인 무장-표적 할당문제는 NP-complete 문제로 알려져 있어 주어진 시간내에 최적해를 구할 수 없으므로 휴리스틱 방법에 의해 빠른 시간 내에 우수한 해를 구하는 것이 더 의미가 있다. 본 연구에서는 보다 효율적으로 해를 도출할 수 있는 방법을 개발하기 위해 전형적인 문제를 재구성하여 단순화 시켰다. 이러한 문제 하에서 두가지 유전자 알고리즘인 표적번호 표현 방법과 순열 표현방법을 비교하였고, 구성적 휴리스틱, 향상적 휴리스틱들을 개발하여 비교하였다. 무장의 파괴확률 간에 이행성 규칙이 존재하는 경우를 대상으로 실험을 수행한 결과 구성적 휴리스틱의 해를 초기해로 하여 교환에 기초한 향상적 계산 시간이나 해의 질 측면에서 가장 우수한 해를 생성하였다. 그러나, 구성적 휴리스틱의 효율성은 무장 성능 간 이행성 규칙에 민감한 결과를 나타내었다.

• 한국인터넷방송통신학회논문지
• /
• 제9권1호
• /
• pp.53-59
• /
• 2009

다시점 비디오는 데이터 양이 매우 많아서 이를 효과적으로 저장하고 전송하기 위해서는 새로운 압축 부호화의 기술 개발이 필수적이다. 계층적 깊이 영상은 다시점 비디오를 효과적으로 부호화할 수 있는 방법으로 여러 시점의 컬러와 깊이 영상을 합성하여 하나의 데이터 구조로 만든 것이다. 본 논문에서는 실제 거리비교, 오버랩 문제해결, 보간법을 이용한 효율적인 계층적 깊이 영상 표현을 통해서 다시점 영상에 대한 압축 효율을 향상시키는 방법을 제안 하였다. 실험 결과를 통해서 압축 성능 향상을 얻을 수 있었다.

• 한국지능시스템학회논문지
• /
• 제25권4호
• /
• pp.412-417
• /
• 2015

Kinect sensor has two output data which are produced from red green blue (RGB) sensor and depth sensor, it is called color image and depth map, respectively. Although this device's prices are cheapest than the other devices for three-dimensional (3D) reconstruction, we need extra work for reconstruct a smooth 3D data and also have semantic meaning. It happened because the depth map, which has been produced from depth sensor usually have a coarse and empty value. Consequently, it can be make artifact and holes on the surface, when we reconstruct it to 3D directly. In this paper, we present a method for solving this problem by using implicit surface representation. The key idea for represent implicit surface is by using radial basis function (RBF) and to avoid the trivial solution that the implicit function is zero everywhere, we need to defined on-surface point and off-surface point. Based on our simulation results using captured face as an input, we can produce smooth 3D face and fill the holes on the 3D face surface, since RBF is good for interpolation and holes filling. Modified anisotropic diffusion is used to produced smoothed surface.

• 한국전산응용수학회:학술대회논문집
• /
• 한국전산응용수학회 2003년도 KSCAM 학술발표회 프로그램 및 초록집
• /
• pp.9-9
• /
• 2003

Let $\Omega$ be a bounded, open, and polygonal domain in $R^2$ with re-entrant corners. We consider the following Partial Differential Equations: $$(I-\nabla\nabla\cdot+\nabla^{\bot}\nabla\times)u\;=\;f\;in\;\Omega$$, $$n\cdotu\;0\;0\;on\;{\Gamma}_{N}$$, $${\nabla}{\times}u\;=\;0\;on\;{\Gamma}_{N}$$, $$\tau{\cdot}u\;=\;0\;on\;{\Gamma}_{D}$$, $$\nabla{\cdot}u\;=\;0\;on\;{\Gamma}_{D}$$ where the symbol $\nabla\cdot$ and $\nabla$ stand for the divergence and gradient operators, respectively; $f{\in}L^2(\Omega)^2$ is a given vector function, $\partial\Omega=\Gamma_{D}\cup\Gamma_{N}$ is the partition of the boundary of $\Omega$; nis the outward unit vector normal to the boundary and $\tau$represents the unit vector tangent to the boundary oriented counterclockwise. For simplicity, assume that both $\Gamma_{D}$ and $\Gamma_{N}$ are nonempty. Denote the curl operator in $R^2$ by $$\nabla\times\;=\;(-{\partial}_2,{\partial}_1$$ and its formal adjoint by $${\nabla}^{\bot}\;=\;({-{\partial}_1}^{{\partial}_2}$$ Consider a weak formulation(WF): Find $u\;\in\;V$ such that $$a(u,v):=(u,v)+(\nabla{\cdot}u,\nabla{\cdot}v)+(\nabla{\times}u,\nabla{\times}V)=(f,v),\;A\;v{\in}V$$. (2) We assume there is only one singular corner. There are many methods to deal with the domain singularities. We introduce them shortly and we suggest a new Finite Element Methods by using Singular representation for the solution.

• 대한산업공학회지
• /
• 제31권1호
• /
• pp.79-86
• /
• 2005

The transportation problem (TP) is one of the traditional optimization problems. Unlike the TP, the fixed charge transportation problem (FCTP) cannot be solved using polynomial time algorithms. So, finding solutions for the FCTP is a well-known NP-complete problem involving an importance in a transportation network design. So, it seems to be natural to use evolutionary algorithms for solving FCTP. And many evolutionary algorithms have tackled this problem and shown good performance. This paper introduces an efficient evolutionary algorithm for the FCTP. The proposed algorithm can always generate feasible solutions without any repair process using the random key representation. Especially, it can guide the search toward the basic solution. Finally, we performed comparisons with the previous results known on the benchmark instances and could confirm the superiority of the proposed algorithm.

• 한국초등과학교육학회지:초등과학교육
• /
• 제17권1호
• /
• pp.75-87
• /
• 1998

The problem solving processes of elementary school children who are talented in science have been seldom studied. Researchers often resort to thinking aloud method to collect data of problem solving processes. The major purpose of the study is investigating high ability elementary school students' problem solving processes through the analysis of written responses to science problems in everyday context. 67 elementary students were participated Chungcheongbuk-do Elementary Science Contest held on October, 1997. The written responses of the contest participants to science problems in everyday context were analyzed in terms of problem solving processes. The findings of the research are as follows. (1) High ability elementary students use various concepts about air and water in the process of problem solving. (2) High ability elementary students use content specific problem solving strategies. (3) The problem solving processes of the high ability elementary students consist of problem representation, problem solution, and answer stages. Problem representation stage is further divided into translation and integration phases. Problem solving stage is composed of deciding relevant knowledge, strategy, and info..ins phases. (4) High ability elementary students' problem solving processes could be categorized into 11 qualitatively different groups. (5) Students failures in problem solving are explained by many phases of problem solving processes. Deciding relevant knowledge and inferring phases play major roles in problem solving. (6) The analysis of students' written responses, although has some limitations, could provide plenty of information about high ability elementary students' problem solving precesses.

• 대한산업공학회지
• /
• 제35권2호
• /
• pp.150-159
• /
• 2009

The heterogeneous fleet vehicle routing problem(HVRP) is a variant of the classical vehicle routing problem in which customers are served by a heterogeneous fleet of vehicles with various capacities, fixed costs and variable costs. We propose a new conceptual HVRPCR(HVRP with customer restriction) model including additional customer restrictions in HVRP. In this paper, we develop hybrid particle swarm optimization(HPSO) algorithm with 2-opt and node exchange technique for HVRP. The solution representation is a n-dimensional particle for HVRP with N customers. The decoding method for this representation starts with the transformation of particle into a priority list of customer to enter route and limit of vehicle to serve each customer. The vehicle routes are then constructed based on the customer priority list and limit of vehicle to serve. The proposed algorithm is tested using 8 benchmark problems and it consistently produces high-quality solutions, including new best solutions. The numerical results show that the proposed algorithm is robust and efficient.

• 정보처리학회논문지D
• /
• 제13D권2호
• /
• pp.235-240
• /
• 2006

소프트웨어 아키텍처는 텍스트 기반 아키텍처 기술 언어(ADL)를 사용하면서 기술하게 된다. ADL의 중요한 목적은 다른 이해관계자 사이에서 대체 디자인을 통신하고, 재사용할 수 있는 구조를 찾아내고, 그리고 디자인 결정을 기록하는 것이다. 본 논문은 구조적인 관점의 3차원 표현을 위한 도구를 만듦으로써 표현 문제에 대한 해법을 제공한다. 도구는 첫째 소프트웨어 아키텍처와 아키텍처에서 관점을 기술하는 아키텍처 기술 언어(VTADL)로 구성되었고, 각 관점을 분리된 가상현실 세계로 번역하는 VTADL-to-VRML 변환기로 구성되었다. 본 논문에서는 ADL을 요구된 관점에 의거하여 효과적인 VRML 표현으로 변환하기 위한 알고리즘을 고안했다. VRML 표현은 그 전체적인 디자인에 이해를 강화하고 다양한 이해관계자 사이에 통신을 개선할 것이다.

• 한국통신학회논문지
• /
• 제34권2C호
• /
• pp.186-193
• /
• 2009

다시점 비디오는 데이터 양이 매우 많아서 이를 효과적으로 저장하고 전송하기 위해서는 새로운 압축 부호화의 기술 개발이 필수적이다. 계층적 깊이 영상은 다시점 비디오를 효과적으로 부호화할 수 있는 방법으로 여러 시점의 컬러와 깊이 영상을 합성하여 하나의 데이터 구조로 만든 것이다. 본 논문에서는 실제 거리비교, 오버랩 문제해결, YCrCb 컬러변환을 이용한 효율적인 계층적 깊이 영상 표현을 통해서 다시점 영상에 대한 압축 효율을 향상시키는 방법을 제안하였다. 실험 결과를 통해서 압축성능 향상과 우수한 복원 성능을 얻을 수 있었다.