• East Asian mathematical journal
• /
• 제26권4호
• /
• pp.553-579
• /
• 2010

Geometric education emphasize reasoning ability and spatial sense through development of logical thinking and intuitions in space. Researches about space understanding go along with investigations of space perception ability which is composed of space relationship, space visualization, space direction etc. Especially space visualization is one of the factors which try conclusion with geometric problem solving. But studies about space visualization are limited to middle school geometric education, studies in elementary level haven't been done until now. Namely, discussions about elementary students' space visualization process and ability in plane or space figures is deficient in relation to geometric problem solving. This paper examines these aspects, especially in relation to plane and space problem solving in elementary levels. Firstly we propose the analysis frame to investigate a visualization process for plane problem solving and a visualization ability for space problem solving. Nextly we select 13 elementary students, and observe closely how a visualization process is progress and how a visualization ability is played role in geometric problem solving. Together with these analyses, we propose concrete examples of visualization ability which make a road to geometric problem solving. Through these analysis, this paper aims at deriving various discussions about visualization in geometric problem solving of the elementary mathematics.

• Journal of Astronomy and Space Sciences
• /
• 제13권1호
• /
• pp.48-54
• /
• 1996

The generalized linear impulsive correction problem is applied to make a linear programming problem for optimizing trajectory of an orbiting spacecraft. Numerical application for the stationkeeping maneuver problem of geostationary satellite shows that this problem can efficiently find the optimal solution of the stationkeeping parameters, such as velocity changes, and the points of impulse by using the revised simplex method.

• 한국지능시스템학회논문지
• /
• 제22권4호
• /
• pp.414-424
• /
• 2012

문제 인스턴스 탐색 혹은 자동 생성은 알고리즘 분석 및 테스트에 적용될 수 있으며, 하드웨어, 소프트웨어 프로그램, 계산 이론 등 다양한 수준에서 연구되어온 주제이다. 본 연구에서는 해(解) 공간에 사용된 목적값-거리 상관관계 분석을 문제 인스턴스 공간에 적용하였다. 문제 인스턴스의 목적값은 문제에 따라 알고리즘의 수행 시간과 최적해를 잘 구하는 정도로 정의하였다. 이러한 정의는 문제 인스턴스의 난이도로 해석할 수 있다. 상관관계는 3가지 측면에서 분석하였다: 첫째, 알고리즘과 거리 함수에 따른 상관관계 차이, 둘째, 알고리즘의 개선 전/후의 상관관계 변화, 셋째, 문제 인스턴스 공간과 해당 문제의 해 공간 사이의 연관성. 본 논문은 문제 인스턴스 공간에 상관계수 분석이 어떻게 적용될 수 있는지 보여주며, 문제 인스턴스 공간 분석을 본격적으로 다루는 첫번째 시도이다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.86-89
• /
• 2003

To model a numerical problem space under the limitation of available data, we need to extract sparse but key points from the space and to efficiently approximate the space with them. This study proposes a sampling method based on the search process of genetic algorithm and a space modeling method based on least-squares approximation using the summation of Gaussian functions. We conducted simulations to evaluate them for several kinds of problem spaces: DeJong's, Schaffer's, and our original one. We then compared the performance between our sampling method and sampling at regular intervals and that between our modeling method and modeling using a polynomial. The results showed that the error between a problem space and its model was the smallest for the combination of our sampling and modeling methods for many problem spaces when the number of samples was considerably small.

• 한국건축시공학회:학술대회논문집
• /
• 한국건축시공학회 2014년도 추계 학술논문 발표대회
• /
• pp.117-118
• /
• 2014

The unfloored space and floor is one of characteristic of traditional house in Korea. This space is used to connecting passage between room or entrance of house. Currently, according to decline of heat insulation property thereby becoming decrepit house, native is repairing it for block external environment such as rain, wind and so on. But, variety problem is happening from wrong repair. This object of this study is current status and analysis on problem of unfloored space and floor repair. As a result, current status of repair is classified repair type, installation position and using form. And position of problem is confirmed connection between original house and extend space.

• 한국학교수학회논문집
• /
• 제13권4호
• /
• pp.655-678
• /
• 2010

초등수학에서 기하교육은 공간에 대한 직관의 계발을 통해 도형에 대한 이해와 공간 감각을 이끌어내는데 초점을 맞추어야 한다. 이와 함께 시각화는 기하에서의 문제해결 을 결정짓는 중요한 요소 가운데 하나이다. 지금까지 시각화에 대한 분석은 주로 중등 기하교육에서 다루어진 반면, 초등수학에서 평면도형과 공간도형에서의 문제해결과 관련해서 학생들의 시각화에 대한 논의는 부족했다. 본 연구는 초등수학에서 시각화가 기하문제해결에 미치는 영향을 분석한 것으로, 기하문제해결에서 나타나는 시각화 방법과 시각화에 영향을 미치는 요소, 그리고 이 과정에서 나타나는 어려움을 살펴본 것이다. 먼저 평면도형과 입체도형의 문제해결에서 시각화 방법을 구분하여 살펴보고, 이러한 방법에 따라 도형에 대한 이해와 시각화 과정이 어떻게 진행되는지를 도식화하여 살펴본다. 또한 시각화에 영향을 미치는 요소를 구분하고, 시각화 과정의 어려움으로 인해 어떤 오류가 나타나는가를 살펴보고, 이를 통해 초등기하문제해결에서 시각화에 대한 논의를 이끌어낸다.

• Journal of applied mathematics & informatics
• /
• 제5권1호
• /
• pp.223-233
• /
• 1998

This paper is concerned with the problem of existence of solutions to the initial value problem u'(t) = A(t, u(t)), u(a) = z in a probabilistic normed space where $A : [a,b)\;{\times}\;D->E$ is continuous, D is a closed subset of a probabilistic normed space E, and $z\;{\in}\;D$. With a dissipative type condition on A, we estabilish sufficient conditions for this initial value problem to have a solution.

• Korean Journal of Mathematics
• /
• 제19권1호
• /
• pp.101-109
• /
• 2011

We get a theorem which shows that there exist at least two or three nontrivial weak solutions for the nonlinear parabolic boundary value problem with the variable coefficient jumping nonlinearity. We prove this theorem by restricting ourselves to the real Hilbert space. We obtain this result by approaching the topological method. We use the Leray-Schauder degree theory on the real Hilbert space.

• 산업경영시스템학회지
• /
• 제38권4호
• /
• pp.109-116
• /
• 2015

This paper is concerned with the single vendor single buyer integrated production inventory problem. To make this problem more practical, space restriction and lead time proportional to lot size are considered. Since the space for the inventory is limited in most practical inventory system, the space restriction for the inventory of a vendor and a buyer is considered. As product's quantity to be manufactured by the vendor is increased, the lead time for the order is usually increased. Therefore, lead time for the product is proportional to the order quantity by the buyer. Demand is assumed to be stochastic and the continuous review inventory policy is used by the buyer. If the buyer places an order, then the vendor will start to manufacture products and the products will be transferred to the buyer with equal shipments many times. The mathematical formulation with space restriction for the inventory of a vendor and a buyer is suggested in this paper. This problem is constrained nonlinear integer programming problem. Order quantity, reorder points for the buyer, and the number of shipments are required to be determined. A Lagrangian relaxation approach, a popular solution method for constrained problem, is developed to find lower bound of this problem. Since a Lagrangian relaxation approach cannot guarantee the feasible solution, the solution method based on the Lagrangian relaxation approach is proposed to provide with a good feasible solution. Total costs by the proposed method are pretty close to those by the Lagrangian relaxation approach. Sensitivity analysis for space restriction for the vendor and the buyer is done to figure out the relationships between parameters.

• 산업공학
• /
• 제12권4호
• /
• pp.617-624
• /
• 1999

In order to maximize an availability of machine and utilization of space, the parallel machines scheduling problem with space limit is frequently discussed in the industrial field. In this paper, we consider a scheduling problem for assembly machine in ship engine assembly shop. This paper considers the parallel machine scheduling problem in which n jobs having different release times, due dates and space limits are to be scheduled on m parallel machines. The objective function is to minimize the sum of earliness and tardiness. To solve this problem, a heuristic is developed. The proposed heuristic is divided into three modules hierarchically: job selection, machine selection and job sequencing, solution improvement. To illustrate its effectiveness, a proposed heuristic is evaluated with a large number of randomly generated test problems based on the field situation. Through the computational experiment, we determine the job selection rule that is suitable to the problem situation considered in this paper and show the effectiveness of our heuristic.