• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권5호
• /
• pp.2003-2021
• /
• 2020

Today's computer systems are widely integrated with CPU and GPU to achieve considerable performance, but energy consumption of such system directly affects operational cost, maintainability and environmental problem, which has been aroused wide concern by researchers, computer architects, and developers. To cope with energy problem, we propose a task-scheduling framework to reduce energy under performance constraint by rationally allocating the tasks across the CPU and GPU. The framework first collects the estimated energy consumption of programs and performance information. Next, we use above information to formalize the scheduling problem as the 0-1 knapsack problem. Then, we elaborate our experiment on typical platform to verify proposed scheduling framework. The experimental results show that our proposed algorithm saves 14.97% energy compared with that of the time-oriented policy and yields 37.23% performance improvement than that of energy-oriented scheme on average.

• 한국항해항만학회지
• /
• 제30권7호
• /
• pp.561-566
• /
• 2006

In this paper, we propose a new ship scheduling set packing model considering limited risk or variance. The set packing model is used in many applications, such as vehicle routing, crew scheduling, ship scheduling, cutting stock and so on. As long as the ship scheduling is concerned, there exits many unknown external factors such as machine breakdown, climate change and transportation cost fluctuation. However, existing ship scheduling models have not considered those factors apparently. We use a quadratic set packing model to limit the variance of expected cost of ship scheduling problems under stochastic spot rates. Set problems are NP-complete, and additional quadratic constraint makes the problems much harder. We implement Kelley's cutting plane method to replace the hard quadratic constraint by many linear constrains and use branch-and-bound algorithm to get the optimal integral solution. Some meaningful computational results and comments are provided.

• 대한전자공학회논문지
• /
• 제26권6호
• /
• pp.115-123
• /
• 1989

본 논문은 사용자가 정의한 stick도형으로부터 혼합된 정수 선형프로그래밍 문제를 공식화시키는 새로운 mask compaction 방법을 제시하였는데 이 혼합된 정수 프로그램을 풀므로써 밀집화되고 디자인 rule에 맞는 layout을 얻을 수 있다. 또한 constraint graph에서 최장경로 문제를 풀 수 있는 새로운 효율적인 알고리듬도 기술하였다.

• 대한수학회논문집
• /
• 제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).

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.1137-1140
• /
• 1998

In this paper, we propose the new hardware architecture which implements the stereo matching algorithm using the dynamic programming method. The dynamic programming method is used in finding the corresponding pixels between the left image and the right image. The proposed MOEPE(Merged Odd-Even PE) architecture operates in the systolic manner and finds the disparities from the intensities of the pixels on the epipolar line. The number of PEs used in the MOEPE architecture is the number of the range constraint, which reduced the number of the necessary PEs dramatically compared to the traditional method which uses the PEs with the number of pixels on the epipolar line. For the normal method by 25 times. The proposed architecture is modeled with the VHDL code and simulated by the SYNOPSYS tool.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2000년도 춘계학술대회논문집B
• /
• pp.144-147
• /
• 2000

A numerical method for the solution of one-dimensional inverse heat conduction problem is established and its performance is demonstrated with computational results. The present work introduces the maximum entropy method in order to build a robust formulation of the inverse problem. The maximum entropy method finds the solution that maximizes the entropy functional under given temperature measurement. The philosophy of the method is to seek the most likely inverse solution. The maximum entropy method converts the inverse problem to a non-linear constrained optimization problem of which constraint is the statistical consistency between the measured temperature and the estimated temperature. The successive quadratic programming facilitates the maximum entropy estimation. The gradient required fur the optimization procedure is provided by solving the adjoint problem. The characteristic feature of the maximum entropy method is discussed with the illustrated results. The presented results show considerable resolution enhancement and bias reduction in comparison with the conventional methods.

• Journal of Mechanical Science and Technology
• /
• 제14권3호
• /
• pp.306-313
• /
• 2000

The homogenization method and the density function method are common approaches to evaluate the equivalent material properties for design cells composed of matter and void. In this research, using a new topology optimization method based on the homogenized material with a penalty factor and the chessboard prevention strategy, we obtain the optimal layout of a structure for the natural frequency of a designated mode. The volume fraction of nodes of each finite element is chosen as the design variable and a total material usage constraint is imposed. In this paper, the subspace method is used to evaluate the eigenvalue and its corresponding eigenvector of the structure for the designated mode and the recursive quadratic programming algorithm, PLBA algorithm, is used to solve the topology optimization problem.

• 한국국방경영분석학회지
• /
• 제24권2호
• /
• pp.130-145
• /
• 1998

This paper is concerned with the optimization of a system reliability. Two kinds of the reliability model for optimal allocation of parallel redundancy are considered. The algorithm for solving the optimal redundancy problem is proposed by the use of dynamic programming(DP) method. The problem is approached with a standard DP formulation and the DP algorithm is applied to the model and then the optimal solution is found by the backtracking method. The method is applicable to the models having no constraints or having a cost constraint subject to a specified minimum requirement of the system reliability. A consequence of this study is that the developed computer program package are implemental for the optimization of the system reliability.

• Journal of Electrical Engineering and Technology
• /
• 제9권1호
• /
• pp.80-89
• /
• 2014

A stochastic optimal power flow (S-OPF) model considering uncertainties of load and wind power is developed based on chance constrained programming (CCP). The difficulties in solving the model are the nonlinearity and probabilistic constraints. In this paper, a limit relaxation approach and an iterative learning control (ILC) method are implemented to solve the S-OPF model indirectly. The limit relaxation approach narrows the solution space by introducing regulatory factors, according to the relationship between the constraint equations and the optimization variables. The regulatory factors are designed by ILC method to ensure the optimality of final solution under a predefined confidence level. The optimization algorithm for S-OPF is completed based on the combination of limit relaxation and ILC and tested on the IEEE 14-bus system.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.311-311
• /
• 2000

We propose a DP-based formulation for matching line patterns by defining a robust and stable geometric representation that is based on the conceptual organizations. Usually, the endpoint proximity and collinearity of image lines, as two main conceptual organization groups, are useful cues to match the model shape in the scene. As the endpoint proximity, we detect junctions from image lines. We then search for junction groups by using geometric constraint between the junctions. A junction chain similar to the model chain is searched in the scene, based on a local comparison. A Dynamic Programming-based search algorithm reduces the time complexity for the search of the model chain in the scene. Our system can find a reasonable matching, although there exist severely distorted objects in the scene. We demonstrate the feasibility of the DP-based matching method using both synthetic and real images.