• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제23권4호
• /
• pp.301-327
• /
• 2019

The proper orthogonal decomposition (POD) method for time-dependent problems significantly reduces the computational time as it reduces the original problem to the lower dimensional space. Even a higher degree of reduction can be reached if the solution is smooth in space and time. However, if the solution is discontinuous and the discontinuity is parameterized e.g. with time, the POD approximations are not accurate in the reduced space due to the lack of ability to represent the discontinuous solution as a finite linear combination of smooth bases. In this paper, we propose to post-process the sample solutions and re-initialize the POD approximations to deal with discontinuous solutions and provide accurate approximations while the computational time is reduced. For the post-processing, we use the Gegenbauer reconstruction method. Then we regularize the Gegenbauer reconstruction for the construction of POD bases. With the constructed POD bases, we solve the given PDE in the reduced space. For the POD approximation, we re-initialize the POD solution so that the post-processed sample solution is used as the initial condition at each sampling time. As a proof-of-concept, we solve both one-dimensional linear and nonlinear hyperbolic problems. The numerical results show that the proposed method is efficient and accurate.

• 대한산업공학회지
• /
• 제19권4호
• /
• pp.125-135
• /
• 1993

An Unrelated Parallel Processing with Weighted jobs and Setup times scheduling prolem is studied. We consider a parallel processing in which a group of processors(machines) perform a single operation on jobs of a number of different job types. The processing time of each job depends on both the job and the machine, and each job has a weight. In addition each machine requires significant setup time between processing jobs of different job types. The performance measure is to minimize total weighted flow time in order to meet the job importance and to minimize in-process inventory. We present a 0-1 Mixed Integer Programming model as an optimizing algorithm. We also present a simple heuristic algorithm. Computational results for the optimal and the heuristic algorithm are reported and the results show that the simple heuristic is quite effective and efficient.

• Industrial Engineering and Management Systems
• /
• 제15권1호
• /
• pp.32-40
• /
• 2016

This paper considers a special case of a three machine flow shop scheduling problem in which operation processing time of each job is ordered such that machine 1 has the longest processing time, whereas machine 3, the shortest processing time. The objective of the problem is the minimization of the total completion time. Although the problem is simple, its complexity is yet to be established to our best knowledge. This paper first introduces the problem and presents some optimal properties of the problem. Then, it establishes several special cases in which a polynomial-time optimal solution procedure can be found. In addition, the paper proves that the recognition version of the problem is at least binary NP-complete. The complexity of the problem has been open despite its simple structure and this paper finally establishes its complexity. Finally, a simple and intuitive heuristic is developed and the tight worst case bound on relative error of 6/5 is established.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• pp.97-102
• /
• 2004

The very complicated proplem in spatial processing is effects of phading (Multipath and Delay Spread) and co-channel interference (CCI). The phading is one of principal causes, that form inter-symbol interference (ISI). Spatial-Temproral Adaptive Filter (STAF) has been taken as a solution of this problem, because it can suppress both these types of interference. But the performance of STAF exposes some elemental limitations, in which are the slow convergence of adaptive process and computational complexity. The cause of this is that, STAF must treat a large quantity of information in both space and time. The way that master these limitation is a use of Subband Spatial-Temproral Adaptive Filter (SSTAF). SSTAF reduce computational complexity by pruning off samples of signal and thus it lost some information in time. This draw on attennation of output SINR of SSTAF. The article analyse a optimal solution of this problem by introducing SSTAF with nonuniform weighted distribution.

• Journal of Information Processing Systems
• /
• 제15권3호
• /
• pp.492-499
• /
• 2019

HEVC is the high efficiency video coding standard, which provides better coding efficiency contrasted with the other video coding standard. But at the same time the computational complexity increases drastically. Thirty-five kinds of intra-prediction modes are defined in HEVC, while 9 kinds of intra prediction modes are defined in H.264/AVC. This paper proposes a fast rough mode decision (RMD) algorithm which adopts the smoothness of the up-reference pixels and the left-reference pixels to decrease the computational complexity. The three step search method is implemented in RMD process. The experimental results compared with HM13.0 indicate that the proposed algorithm can save 39.7% of the encoding time, while Bjontegaard delta bitrate (BDBR) is increased slightly by 1.35% and Bjontegaard delta peak signal-to-noise ratio (BDPSNR) loss is negligible.

• 한국소음진동공학회논문집
• /
• 제16권4호
• /
• pp.355-365
• /
• 2006

The coupled time-integration method with a staggered algorithm based on computational structural dynamics (CSD), finite element method (FEM) and computational fluid dynamics (CFD) has been developed in order to demonstrate physical vibration phenomena due to dynamic aeroelastic excitations. Virtual flutter tests for the spanwise curved ing model have been effectively conducted using the present advanced computational method with high speed parallel processing technique. In addition, the present system can simultaneously give a recorded data file to generate virtual animation for the flutter safety test. The results for virtual flutter test are compared with the experimental data of wind tunnel test. It is shown from the results that the effect of spanwise curvature have a tendency to decrease the flutter dynamic pressure for the same flight condition.

• 융합신호처리학회논문지
• /
• 제25권1호
• /
• pp.1-6
• /
• 2024

방수배열소나의 주 기능은 적 수상함 및 잠수함, 어뢰 등에서 방사하는 펄스를 탐지하는 것이다. 펄스를 탐지한 경우에는 자함 입장에서 위험도가 높은 상황이므로 자함의 기동 및 생존을 위해 표적의 위치를 찾는 건 매우 중요하다. 표적의 위치는 각 센서에서 수신된 펄스의 시작점을 찾고 센서 간 시간지연 값을 계산하여 산출하게 된다. 펄스 시작점을 구하기 위해서는 신호의 포락선을 산출하고 미분 필터링 과정을 거치게 되는데 방수배열소나는 신호의 샘플링 주파수가 높아 처리하는 샘플 개수가 많으므로 이 과정은 연산량이 큰 문제가 있다. 이에 본 논문은 연산량을 줄일 수 있는 간축 적용 펄스 시작점 산출 방법을 제안하였다. 간축 계수를 변경하면서 시뮬레이션을 수행하였고 연산량이 감소함을 확인하였다. 제안한 방법은 실시간 처리 시스템에 효과적이며 자원 활용도에 장점을 가질 것으로 기대한다.

• 대한산업공학회지
• /
• 제25권3호
• /
• pp.360-368
• /
• 1999

We consider the problem of scheduling n jobs with sequence-dependent processing times on a set of parallel-identical machines. The processing time of each job consists of a pure processing time and a sequence-dependent setup time. The objective is to maximize the total remaining machine available time which can be used for other tasks. For the problem, a hybrid genetic algorithm is proposed. The algorithm combines a genetic algorithm for global search and a heuristic for local optimization to improve the speed of evolution convergence. The genetic operators are developed such that parallel machines can be handled in an efficient and effective way. For local optimization, the adjacent pairwise interchange method is used. The proposed hybrid genetic algorithm is compared with two heuristics, the nearest setup time method and the maximum penalty method. Computational results for a series of randomly generated problems demonstrate that the proposed algorithm outperforms the two heuristics.

• Industrial Engineering and Management Systems
• /
• 제10권4호
• /
• pp.247-254
• /
• 2011

In this paper, we study a single-machine scheduling problem with deteriorating processing time of jobs and multiple rate-modifying activities which reset deteriorated processing time to the original processing time. In this situation, the objective function is to minimize total completion time. First, we formulate an integer programming model. Since the model is difficult to solve as the size of real problem being very large, we design an improved genetic algorithm called adaptive genetic algorithm (AGA) with spontaneously adjusting crossover and mutation rate depending upon the status of current population. Finally, we conduct some computational experiments to evaluate the performance of AGA with the conventional GAs with various combinations of crossover and mutation rates.

• 한국통신학회논문지
• /
• 제34권5C호
• /
• pp.521-526
• /
• 2009

In this paper, a complex-valued recursive least squares escalator filter algorithm with reduced computational complexity for complex-valued signal processing applications is presented. The local tap weight of RLS-ESC algorithm is updated by incrementing its old value by an amount equal to the local estimation error times the local gain scalar, and for the gain scalar, the local input autocorrelation is calculated at the previous time. By deriving a new gain scalar that can be calculated by using the current local input autocorrelation, reduced computational complexity is accomplished. Compared with the computational complexity of the complex-valued version of RLS-ESC algorithm, the computational complexity of the proposed method can be reduced by 50% without performance degradation. The reduced computational complexity of the proposed algorithm is even less than that of the LMS-ESC. Simulation results for complex channel equalization in 64QAM modulation schemes demonstrate that the proposed algorithm has superior convergence and constellation performance.