• Journal of information and communication convergence engineering
• /
• 제9권4호
• /
• pp.471-474
• /
• 2011

In parallel job scheduling, each job can be executed simultaneously on multiple machines at a time. Thus in the input instance, a job $J_i$ requires the number $m_i$ of machines on which it shall be processed. The algorithm should determine not only the execution order of jobs but also the machines on which the jobs are executed. In this paper, when the jobs have deadlines, the problem is to maximize the total work of jobs which is completed by their deadlines. The problem is known to be strongly NP-hard [5] and we investigate the approximation algorithms for the problem. We consider a model in which the algorithm can have more machines than the adversary. With this advantage, the problem is how good solution the algorithm can produce against the optimal algorithm.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 B
• /
• pp.621-624
• /
• 2003

For real world applications of reinforcement learning techniques, function approximation or generalization will be required to avoid curse of dimensionality. For this, an improved function approximation-based reinforcement learning method is proposed to speed up convergence by using CA-CMAC(Credit-Assigned Cerebellar Model Articulation Controller). To show that our proposed CACRL(CA-CMAC-based Reinforcement Learning) performs better than the CRL(CMAC-based Reinforcement Learning), computer simulation results are illustrated, where a swing-up control problem of an acrobot is considered.

• 한국컴퓨터정보학회논문지
• /
• 제17권2호
• /
• pp.149-157
• /
• 2012

이 논문은 슬라이딩 윈도우를 사용하는 스트림 데이터에서 모든 조인 연산의 상태를 저장하기에 메모리가 충분하지 않을 경우에, 연속적인 슬라이딩 윈도우 조인 연산의 근사치 답을 구하는 문제에 대한 연구이다. 근사치를 구하는 두 가지 방법으로는 최대 부분집합으로 근사치를 구하는 방법과 조인 결과에서 임의의 결과를 택하는 방법이 있다. 전자는 잃어버리는 튜플의 수를 최소화 하고, 후자는 조인의 결과가 집계로 나타날 때 사용된다. 이 논문에서는 임의의 입력 데이터에 슬라이딩 윈도우가 사용되는 경우 두 가지 방법으로 얻는 근사치 모두 효율적이지 못함을 보여준다. 기존의 최대 부분집합에 의해 근사치를 구하는 모델에서는 빈도-기반 모델을 사용하였는데. 샘플링이 문제가 되었다. 오히려 스트림 도착한 이후의 연령-기반 모델이 많은 응용분야에서 더 적절하게 사용 될 수 있음을 보여주고 있다. 이 논문에서는 최대 부분 집합과 임의의 결과라는 두 가지 근사치 측정법을 분석, 그 효율성을 비교하여 보여 준다. 또한, 메모리가 제한 되어있는 환경에서 다중 조인 연산이 수행 될 경우에, 어떤 경우에도 근사치 측정을 최적화할 수 있도록, 조인 연산 전체에 필요한 메모리를 적절하게 할당하는 알고리즘의 효율성을 분석한다.

• ETRI Journal
• /
• 제15권2호
• /
• pp.35-51
• /
• 1993

This paper presents function approximation based on nonparametric estimation. As an estimation model of function approximation, a three layered network composed of input, hidden and output layers is considered. The input and output layers have linear activation units while the hidden layer has nonlinear activation units or kernel functions which have the characteristics of bounds and locality. Using this type of network, a many-to-one function is synthesized over the domain of the input space by a number of kernel functions. In this network, we have to estimate the necessary number of kernel functions as well as the parameters associated with kernel functions. For this purpose, a new method of parameter estimation in which linear learning rule is applied between hidden and output layers while nonlinear (piecewise-linear) learning rule is applied between input and hidden layers, is considered. The linear learning rule updates the output weights between hidden and output layers based on the Linear Minimization of Mean Square Error (LMMSE) sense in the space of kernel functions while the nonlinear learning rule updates the parameters of kernel functions based on the gradient of the actual output of network with respect to the parameters (especially, the shape) of kernel functions. This approach of parameter adaptation provides near optimal values of the parameters associated with kernel functions in the sense of minimizing mean square error. As a result, the suggested nonparametric estimation provides an efficient way of function approximation from the view point of the number of kernel functions as well as learning speed.

• 한국항행학회논문지
• /
• 제9권1호
• /
• pp.56-60
• /
• 2005

UWB 통신 시스템의 비트 오율을 계산하기 위해서는 다중 사용자 간섭의 정확한 표현식이 필수적이다. 지금까지, 많은 연구에서 다중 사용자 간섭은 가우시안 근사에 의하여 모델링되었다. 그러나 이 방법은 매우 큰 오차를 수반하는 것으로 알려져 있다. MAI에 대한 정확한 모델링을 위한 여러 논문이 발표되었지만, 비트 오율 계산 시 매우 많은 시간이 걸리는 문제점이 있다. 이 논문에서 BPSK를 이용하는 UWB-TH 시스템의 비트 오율을 계산하기 위한 간단한 표현식을 제시한다. 이때, 다중 사용자 간섭은 가우시안 근사에 바탕을 둔 특성함수 방법으로 설명되었다. 이 방법을 이용하면 UWB-TH 시스템의 비트 오율을 쉽고 빠르게 그리고 보다 정확히 계산할 수 있다.

• 대한기계학회논문집A
• /
• 제23권6호
• /
• pp.968-978
• /
• 1999

The effective elastic properties of materials containing spherical inclusions were calculated by the elastic wave scattering theory. In the formulation additional scattering fields by the presence of random multiple scatterers that affects the effective properties were found by the single scattering approximation. In calculating the scattering fields the ensemble average on the displacements and strains inside the scatterer was found from the static approximation at long wavelength limit. The displacements were assumed to be equal to the incident field, while the strains were calculated by Eshelby's equivalent inclusion principle on the single inclusion problem. Four different models were considered and they reflected different degrees of multiple scattering effects based on the approximation introduced in the process of embedding the inclusion in the matrix. The expressions for the effective elastic constants were given in each model, and their relations to the results obtained from other scattering theory and elasticity theory were discussed. The theoretical predictions were compared with experimental results on the epoxy matrix composites containing tungsten particles of different sizes and volume fractions

• 대한기계학회논문집A
• /
• 제24권12호
• /
• pp.3040-3052
• /
• 2000

For effective construction of second-order response surface models, an efficient quad ratic approximation method is proposed in the context of trust region model management strategy. In the proposed method, although only the linear and quadratic terms are uniquely determined using 2n+1 design points, the two-factor interaction terms are mathematically updated by normalized quasi-Newton formula. In order to show the numerical performance of the proposed approximation method, a sequential approximate optimizer is developed and solves a typical unconstrained optimization problem having 2, 6, 10, 15, 30 and 50 design variables, a gear reducer system design problem and two dynamic response optimization problems with multiple objectives, five objectives for one and two objectives for the other. Finally, their optimization results are compared with those of the CCD or the 50% over-determined D-optimal design combined with the same trust region sequential approximate optimizer. These comparisons show that the proposed method gives more efficient than others.

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

In order to meet the requirements of background change, illumination variation, moving shadow interference and high accuracy in object detection of moving camera, and strive for real-time and high efficiency, this paper presents an object detection algorithm based on sparse approximation recursion and sparse coding migration in subspace. First, low-rank sparse decomposition is used to reduce the dimension of the data. Combining with dictionary sparse representation, the computational model is established by the recursive formula of sparse approximation with the video sequences taken as subspace sets. And the moving object is calculated by the background difference method, which effectively reduces the computational complexity and running time. According to the idea of sparse coding migration, the above operations are carried out in the down-sampling space to further reduce the requirements of computational complexity and memory storage, and this will be adapt to multi-scale target objects and overcome the impact of large anomaly areas. Finally, experiments are carried out on VDAO datasets containing 59 sets of videos. The experimental results show that the algorithm can detect moving object effectively in the moving camera with uniform speed, not only in terms of low computational complexity but also in terms of low storage requirements, so that our proposed algorithm is suitable for detection systems with high real-time requirements.

• Journal of Ship and Ocean Technology
• /
• 제8권2호
• /
• pp.41-60
• /
• 2004

Ship design process requires lots of complicated analyses for determining a large number of design variables. Due to its complexity, the process is divided into several tractable designs or analysis problems. The interdependent relationship requires repetitive works. This paper employs collaborative optimization (CO), one of the multidisciplinary design optimization (MDO) techniques, for treating such complex relationship. CO guarantees disciplinary autonomy while maintaining interdisciplinary compatibility due to its bi-level optimization structure. However, the considerably increased computational time and the slow convergence have been reported as its drawbacks. This paper proposes the use of an approximation model in place of the disciplinary optimization in the system-level optimization. Neural network classification is employed as a classifier to determine whether a design point is feasible or not. Kriging is also combined with the classification to make up for the weakness that the classification cannot estimate the degree of infeasibility. For the purpose of enhancing the accuracy of a predicted optimum and reducing the required number of disciplinary optimizations, an approximation management framework is also employed in the system-level optimization.

• 응용통계연구
• /
• 제20권1호
• /
• pp.103-115
• /
• 2007

본 논문에서는 1차 자기회귀모형에서 자기회귀계수에 대한 여러 가지 추정량들의 분포함수에 대한 근사 방법에 대해 연구하였다. 자기회귀계수의 여러 추정량들을 이차형식의 관점에서 이해하고, Na와 Kim(2005)에 의한 안장점근사의 결과를 이용한 새로운 근사법을 제시하였다. 이 방법은 정규근사를 비롯한 기존의 근사법과는 달리 추정량에 대한 근사분포의 유도과정이 불필요하며, 소표본은 물론 통계적 추론의 주요 관심영역에서의 근사정도가 매우 뛰어난 장점을 가지고 있다. 모의실험을 통해 Edgeworth 근사를 비롯한 기존의 여러 근사법보다 효율이 뛰어남을 확인하였다.