• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• pp.408-410
• /
• 2003

In this paper, an improved gradient direction assisted linking algorithm is proposed. This algorithm begins with initial seeds satisfying some local criteria. Then it will search along the direction provided by the initial point. A window will be generated in the gradient direction of the current point. Instead of the conventional method which only considers the value of the local salient structure, an improved mathematical model is proposed to describe the desired linear features. This model not only considers the value of the salient structure but also the direction of it. Furthermore, the linking problem under this model can be efficiently solved by dynamic programming method. This algorithm is tested for linear features detection in IKONOS images. The result demonstrates this algorithm is quite promising.

• 경영과학
• /
• 제17권2호
• /
• pp.115-124
• /
• 2000

Activity-Based Costing(ABC) is an accounting cost system which allocates the overhead cost to each cost object more accurately. ABC system achieves improved accuracy in estimating the cost of cost object by using multiple cost drivers to trace the cost of activities to the cost objects associated with the resources consumed by those activities. The selection and the aggregation of these cost driver candidates can pose difficult problems. This paper deals with these problems in mathematical programming approach. The first model is formulated as an integer programming model in cost driver selection and the second model is formulated as multi-objective goal programming model in reduction of cost drivers already selected.

• 제어로봇시스템학회논문지
• /
• 제4권5호
• /
• pp.680-688
• /
• 1998

A modular programming approach for simulation/control of turbocharged diesel engines is investigated. The MATLAB/SIMULINK, which provides easy construction of various control modules and handy retrieval of objects, is adopted as a programming environment. The mathematical models for diesel engines are utilized from the literature. The object-oriented modules, which represent mechanical parts or theoretical algorithms for engines, are easily transferable to other application programs in the same environment. The simulation model is applied to a 4 strokes diesel engine. Details of the block diagrams of example modules are demonstrated. Finally, a PI controller and a sliding mode controller are applied to the simulator constructed for a typical turbocharged diesel engine.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권11호
• /
• pp.4453-4468
• /
• 2015

This paper investigates optimization-based base station (BS) placement. An optimization model is defined and the BS placement problem is transformed to a lexicographical stratified programming (LSP) model for a given trajectory, according to different accuracy requirements. The feasible region for BS deployment is obtained from the positioning system requirement, which is also solved with signal coverage problem in BS placement. The LSP mathematical model is formulated with the average geometric dilution of precision (GDOP) as the criterion. To achieve an optimization solution, a tolerant factor based complete stratified series approach and grid searching method are utilized to obtain the possible optimal BS placement. Because of the LSP model utilization, the proposed algorithm has wider application scenarios with different accuracy requirements over different trajectory segments. Simulation results demonstrate that the proposed algorithm has better BS placement result than existing approaches for a given trajectory.

• 한국경영과학회지
• /
• 제32권4호
• /
• pp.51-60
• /
• 2007

In this study, we consider the minimum ADM problem which is the fundamental problem for the cost-effective design of SONET ADM embedded in WDM ring networks. To minimize the number of SONET ADMs, efficient algorithms for the routing and wavelength assignment are needed. We propose a mathematical model based on the graph theory for the problem and propose a branch-and-price approach to solve the suggested model effectively within reasonable time. By exploiting the mathematical structure of ring networks, we developed polynomial time algorithms for column generation subroutine at branch-and-bound tree. In a computer simulation study, the suggested approach can find the optimal solution for sufficient size networks and shows better performance than the greedy heuristic method.

• 대한수학회논문집
• /
• 제25권1호
• /
• pp.139-147
• /
• 2010

A generalized nondifferentiable fractional optimization problem (GFP), which consists of a maximum objective function defined by finite fractional functions with differentiable functions and support functions, and a constraint set defined by differentiable functions, is considered. Recently, Kim et al. [Journal of Optimization Theory and Applications 129 (2006), no. 1, 131-146] proved optimality theorems and duality theorems for a nondifferentiable multiobjective fractional programming problem (MFP), which consists of a vector-valued function whose components are fractional functions with differentiable functions and support functions, and a constraint set defined by differentiable functions. In fact if $\overline{x}$ is a solution of (GFP), then $\overline{x}$ is a weakly efficient solution of (MFP), but the converse may not be true. So, it seems to be not trivial that we apply the approach of Kim et al. to (GFP). However, modifying their approach, we obtain optimality conditions and duality results for (GFP).

• 산업경영시스템학회지
• /
• 제32권4호
• /
• pp.93-100
• /
• 2009

This paper addresses the facility layout problem in multi-bay environments, where the bays are connected at one or both ends by an inter-bay material handling system. In most previous studies, the main concern is to allocate facilities or departments to the bays whose widths are fixed. In this research, we suggest the efficient models that provide the optimal layout solution under flexible bay width environments. We also suggest a mathematical model that provides the optimal solution using two-way facility allocation approach instead of one-way allocation technique. This paper also shows the approach of TABU search to the assignment and layout design of the departments. The results generated from TABU search are compared to the result from the mathematical model. Models are developed using mixed integer programming for various test problems and solved by CPLEX.

• 한국컴퓨터정보학회논문지
• /
• 제26권12호
• /
• pp.255-264
• /
• 2021

본 연구에서는 부유식 해상풍력발전의 운영 및 유지보수에 필요한 체계적인 정비계획 수립을 위해 최적화기법을 활용한 수리 모형을 제안하고자 한다. 주간 단위로 선박과 기술자를 운용하는 계획정비와 고장정비 작업의 배정에 혼합정수계획법(Mixed Integer Linear Programming, MILP)을 도입하였다. 본 연구의 최적화 모델을 활용한 사례연구에서는 선박과 기술자의 투입 규모가 유지정비 비용에 미치는 영향을 확인하였으며 1년간 정비계획 수립에서 더 나아가 정비작업별 상세 스케줄링까지 연계되는 단계적 최적화 방법론을 함께 제시하였다. 세부적으로는 기상 데이터와 정비 데이터를 활용한 발전량 손실을 비가동 비용으로 반영하여 정비 우선순위를 선정하였으며, 이를 통해 국내 실정에 맞는 해상풍력단지의 유지보수 전략을 제시할 수 있을 것으로 기대한다.

• International Journal of Computer Science & Network Security
• /
• 제22권1호
• /
• pp.105-112
• /
• 2022

The development and spread of IT-technologies has raised interest in teaching programming pupils. The article deals with problems related to programming and ways to overcome them. The importance of programming skills is emphasized, as this process promotes the formation of algorithmic thinking of pupils. The authors determined the level of pupils' interest to programing learning depending on the age. The analysis has showed that the natural interest of younger pupils in programming is decreasing over the years and in the most productive period of its study is minimized. It is revealed that senior school pupils are characterized by low level of interest in the study of programming; lack of motivation; the presence of psychological blocks on their own abilities in the context of programming; law level of computer science understanding. To overcome these problems, we conducted the second stage of the experiment, which was based on a change in the approach to programing learning, which involved pupils of non-specialized classes of senior school (experimental group). During the study of programming, special attention was paid to the motivational and psychological component, as well as the use of game technologies and teamwork of pupils. The results of the pedagogical experiment on studying the effectiveness of teaching programming for pupils of nonspecialized classes are presented. Improvement of the results provided the use of social and cognitive motives; application of verbal and non-verbal, external and internal means; communicative attacks; stimulation and psychological setting; game techniques, independent work and reflection, teamwork. The positive effect of the implemented methods is shown by the results verified by the methods of mathematical statistics in the experimental and control groups of pupils.

• 한국수학교육학회지시리즈D:수학교육연구
• /
• 제2권1호
• /
• pp.5-12
• /
• 1998

The COM curriculum provides first a core of mathematics for all students, and then offers opportunities for students to enter different streams of mathematics studies. The flexible curriculum (COM) is certainly welcome as it focuses on a transition from concrete to conceptual mathematics and on sequentially learning the power of mathematical language and symbols from simple to complex. This approach emphasizes the use of computers in mathematics education in the upper secondary grades. In Mathematics A, one unit is developed to computer operation, flow charts and programming, and computation using the computer. In mathematics B, a chapter addresses algorithms and the computer where students learn the functions of computers, as well as programs of various algorithms. Mathematics C allots a chapter for numerical computation in which approximating solutions for equations, numerical integration, mensuration by parts, and approximation of integrals. But, unfortunately, they do not have any plan for the cooperation study.