• 한국실내디자인학회논문집
• /
• 제15권6호
• /
• pp.43-51
• /
• 2006

The purpose of this study is to present possibility about applying space design of urban theory focused on collective memory. Urban which is the final data of human's collective life has been recognized creative circumstances human collective is living. It can not think without collective from its motivation to problem of form as well as building as element which compose these cities. It is to recognize essential attribute of construction in the collective that think architecture with urban, and It means that recognize actuality of architecture that can talk as the most collective product that represent human. There was discussion for collective and urban. But, this problem was proceeded to clear human knowledge of architecture mainly in other discipline, and even if speak as field of architecture, it could just pass confined meaning by refering at process that clear several main aspects of architecture as doing not pass over more than it. Problem of form that is ultimate aspect of architecture remained by different thing still doing not combine with collective architecture, and occasionally happened the case that make collective of architecture and relation of form overly incommodiously reducing form by a tool for diagram, shape, figuration in the aspect of collective. This research study concept for memory collective in the urban and collective of architecture, and choose urban planning methodology and their work by specific example between Aldo Rosi and Rem Koolhaas dealing with architecture and urban, and present possibility about space design of urban.

• 한국항공우주학회지
• /
• 제38권5호
• /
• pp.427-436
• /
• 2010

본 논문은 다수의 목표물과 다수의 임무가 존재하는 상황에서의 다수 무인항공기의 임무할당 문제를 다룬다. 다수 무인항공기의 임무할당 문제는 순회 세일즈맨 문제, 차량 라우팅 문제와 같은 조합최적화 문제의 일종으로 NP-hard의 계산 복잡도를 가지고 있다. 이런 성격의 문제는 문제의 크기가 커질수록 계산시간이 급격히 증가하는 특징을 지니기 때문에 문제를 효율적으로 풀기 위해서 근사화 방법 또는 발견적인 방법을 사용한다. 본 연구에서는 임무할당 문제를 혼합정수 선형계획 문제로 정식화하고, 혼합정수 선형계획법과 유전 알고리듬으로 해를 구하였다. 다수의 목표물, 다수의 임무, 장애물이 존재하는 환경에 대한 수치 시뮬레이션을 수행하여 각 방법의 최적성과 효율성에 대해 검토하였다.

• 한국경영과학회지
• /
• 제13권2호
• /
• pp.205-205
• /
• 1988

This paper develops a simple interactive procedure which can be efficiently used to solve a bicriteria linear programming problem. The procedure exploits the relatively simple structure of the bicriterion linear programming problem. Its application to a transportation problem is also presented. The results demonstrate that the method developed in this paper could be easily applicable to any bicriteria linear program in general.

• 산업공학
• /
• 제5권2호
• /
• pp.75-85
• /
• 1992

A common problem for manufacturing industries, especially consumer goods industries, is how to establish standardized procedures for loading finished goods onto pallets or containers for subsequent storage and distribution. Utilizing previous research results on the palletizing problem, this paper develops micro-computer based programs which generate an optimum loading pattern leading to the minimum amount of unused pallet or container space. Development of pallet layout chart is also included in the computer programs. The results are displayed by computer-graphic. For the users who are unfamiliar with pallet loading problem and computer system, pull-down menu and user-computer interactive data input procedures are adopted.

• 한국경영과학회지
• /
• 제18권3호
• /
• pp.101-111
• /
• 1993

The purpose of this paper is to show the graphic representation of a linear programming problem by a projection method. First, we develop a projection method which conserves the optimality in the projected space, and next we introduce an algorithm to visualize the feasible solution set and the solution process by the projection method. Finally, we give an example to represent a 4-dimensional linear programming problem graphically.

• Communications for Statistical Applications and Methods
• /
• 제4권1호
• /
• pp.129-138
• /
• 1997

In this paper, the problem for choosing design points in the two dimensional case is condidered. In the one dimensional case, given the design density function, we can choose design points using the quantile function. However, in the two dimensional case, there is no clear definition of the percentile. Therefore, the idea of choosing design points in the univariate case can not be applied directly to the two dimensional case. We convert this problem into an optimization problem using the Voronoi diagram.

• 대한수학회보
• /
• 제31권2호
• /
• pp.309-318
• /
• 1994

The approach presented in this paper is based on the transformation of the Stefan problem in one space dimension to an initial-boundary value problem for the heat equation in a fixed domain. Of course, the problem is non-linear. The finite element approximation adopted here is the standared continuous Galerkin method in time. In this paper, only the regular case is discussed. This means the error analysis is based on the assumption that the solution is sufficiently smooth. The aim of this paper is the existence of the solution in a finite Galerkin system of ordinary equations.

• 대한산업공학회지
• /
• 제26권3호
• /
• pp.289-295
• /
• 2000

The triangulation problem is to make triangles using the given points on the space. The Minimum Weight Triangulation(MWT) is the problem of finding a set of triangles with the minimum weight among possible set of the triangles. In this paper, a modified genetic algorithm(GA) based on an existing genetic algorithm and multispace smoothing technique is proposed. Through the computational results, we can find the tendency that the proposed GA finds good solutions though it needs longer time than the existing GA does as the problem size increases.

• Journal of applied mathematics & informatics
• /
• 제28권5_6호
• /
• pp.1263-1275
• /
• 2010

In this paper, we introduce a new iterative scheme for finding a common element of the set of common fixed points of infinite family of nonexpansive mappings and the set of solutions to a generalized equilibrium problem and the set of solutions to a variational inequality problem in a real Hilbert space. Then strong convergence of the scheme to a common element of the three sets is proved. As applications, three new strong convergence theorems are obtained. Our theorems extend important recent results.

• Nonlinear Functional Analysis and Applications
• /
• 제27권4호
• /
• pp.813-837
• /
• 2022

In this paper we consider inverse problem for a general class of nonlinear stochastic differential equations on Hilbert spaces whose generating operators (drift, diffusion and jump kernels) are unknown. We introduce a class of function spaces and put a suitable topology on such spaces and prove existence of optimal generating operators from these spaces. We present also necessary conditions of optimality including an algorithm and its convergence whereby one can construct the optimal generators (drift, diffusion and jump kernel).