• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1993년도 하계학술대회 논문집 A
• /
• pp.281-283
• /
• 1993

A new method of EEG spindle waveform detection i s presented. The method combines the signal conditioning in the time-domin and the analysis of local spectrum in the frequency-domain. Fast computation methods, utilizing some effective approximations, are also suggested for the desist and implementation of the filter as well as for the computation of the local spectrum. The presented approach is especially useful for the real-time implementation of the waveform detection system under a general purpose microcomputer environment. The overall detection system is implemented and tested on-line with the total 24 hour data of selected four subjects. The result show the average agreement of 86.7% with the visually inspected result.

• 로봇학회논문지
• /
• 제1권1호
• /
• pp.46-57
• /
• 2006

It is well known that mathematical solutions for multi-agent planning problems are very difficult to obtain due to the complexity of mutual interactions among multi-agent. Most of the past research results thus are based on the probabilistic completeness. However, the practicality and effectiveness of the solution from the probabilistic completeness is significantly reduced by heavy computational burden. In this paper, we propose a practically applicable solution technique for multi-agent planning problems, which assures a reasonable computation time and a real world application for more than 3 multi-agents for the case of general shaped paths in agent movement. First, to reduce the computation time, a collision map is utilized for detecting potential collisions and obtaining collision-free solutions for multi-agents. Second, to minimize the maximum of multi-agent task execution time, a method is developed for selecting an optimal priority order. Simulations are finally provided for more than 20 agents to emphasize the effectiveness of the proposed interactive approach to multi-agent planning problems.

• 한국멀티미디어학회논문지
• /
• 제22권5호
• /
• pp.547-557
• /
• 2019

To extract the depth map from a single image, a number of CNN-based deep learning methods have been performed in recent research. In this study, the GAN structure of Pix2Pix is maintained. this model allows to converge well, because it has the structure of the generator and the discriminator. But the convolution in this model takes a long time to compute. So we change the convolution form in the generator to a depthwise convolution to improve the speed while preserving the result. Thus, the seven down-sizing convolutional hidden layers in the generator U-Net are changed to depthwise convolution. This type of convolution decreases the number of parameters, and also speeds up computation time. The proposed model shows similar depth map prediction results as in the case of the existing structure, and the computation time in case of a inference is decreased by 64%.

• International journal of advanced smart convergence
• /
• 제12권2호
• /
• pp.117-126
• /
• 2023

To improve the overall performance and realism of your game, it is important to calculate the trajectory of a projectile accurately and quickly. One way to increase realism is to use a ballistic model that takes into account factors such as air resistance, density, and wind when calculating a projectile's trajectory. However, the more these factors are taken into account, the more computationally time-consuming and expensive it becomes, creating a trade-off between overall performance and efficiency. Therefore, we present an optimal solution to find a balance between ballistic model accuracy and computation time. We perform ballistic calculations using numerical methods such as Euler, Velocity Verlet, RK2, RK4, and Akima interpolation, and measure and compare the computation time, memory usage (RSS, Resident Set Size), and accuracy of each method. We show developers how to implement more accurate and efficient ballistic models and help them choose the right computational method for their numerical applications.

• 한국수산과학회지
• /
• 제18권1호
• /
• pp.15-22
• /
• 1985

The study on computation time, accuracy, and convergency characteristic of the implicit finite difference method is presented with the variation of the space increment and time step in a two-dimensional transient heat conduction problem with a dirichlet boundary condition. Numerical analysis were conducted by the model having the conditions of the solution domain from 0 to 3m, thermal diffusivity of 1.26 $m^2/h$, initial condition of 272 K, and boundary condition of 255.4 K. The results obtained are summarized as follows : 1) The degree of influence with respect to the accuracy of the time step and space increment in the alternating-direction implicit method and Crank-Nicholson implicit method were relatively small, but in case of the fully implicit method showed opposite tendency. 2) To prescribe near the zero for the space increment and tine step in a two dimensional transient problem were good in a accuracy aspect but unreasonable in a computational time aspect. 3) The reasonable condition of the space increment and the time step considering accuracy and computation time could be generalized with the Fourier modulus increment, F, ana dimensionless space increment, X, irrespective of the solution domain.

• Journal of Electrical Engineering and Technology
• /
• 제5권2호
• /
• pp.209-219
• /
• 2010

In this paper, a novel dynamic available transfer capability (DATC) has been computed for real time applications using three different intelligent techniques viz. i) back propagation algorithm (BPA), ii) radial basis function (RBF), and iii) adaptive neuro fuzzy inference system (ANFIS) for the first time. The conventional method of DATC is tedious and time consuming. DATC is concerned with calculating the maximum increase in point to point transfer such that the transient response remains stable and viable. The ATC information is to be continuously updated in real time and made available to market participants through an internet based Open Access Same time Information System (OASIS). The independent system operator (ISO) evaluates the transaction in real time on the basis of DATC information. The dynamic contingency screening method [1] has been utilized and critical contingencies are selected for the computation of DATC using the energy function based potential energy boundary surface (PEBS) method. The PEBS based DATC has been utilized to generate patterns for the intelligent techniques. The three different intelligent methods are tested on New England 68-bus 16 machine and 39-bus 10 machine systems and results are compared with the conventional PEBS method.

• 산업경영시스템학회지
• /
• 제47권2호
• /
• pp.48-56
• /
• 2024

We examine a single machine scheduling problem with step-improving jobs in which job processing times decrease step-wisely over time according to their starting times. The objective is to minimize total completion time which is defined as the sum of completion times of jobs. The total completion time is frequently considered as an objective because it is highly related to the total time spent by jobs in the system as well as work-in-progress. Many applications of this problem can be observed in the real world such as data gathering networks, system upgrades or technological shock, and production lines operated with part-time workers in each shift. Our goal is to develop a scheduling algorithm that can provide an optimal solution. For this, we present an efficient branch and bound algorithm with an assignment-based node design and tight lower bounds that can prune branch and bound nodes at early stages and accordingly reduce the computation time. In numerical experiments well designed to consider various scenarios, it is shown that the proposed algorithm outperforms the existing method and can solve practical problems within reasonable computation time.

• 한국산학기술학회논문지
• /
• 제8권3호
• /
• pp.563-568
• /
• 2007

본 논문에서는 EVRC 시스템에 사용되어지는 실근 방식의 계산량 감소 알고리즘을 치안한다. 실근 방법에서는 다항식에서의 근을 구하여 LSP로 변환하는 과정이 필요하다. 그러나, 근을 구하는 과정에서 주파수 대역을 순차적으로 검색하므로 계산시간이 많이 소요된다. LSP 파라미터의 중요한 특징은 대부분의 계수가 특정 주파수 대역에 주로 분포한다는 것이다. 그러므로, 본 논문에서는 실근 방식에서의 계산시간을 줄이기 위하여 1KHz 대역까지는 선형적이고 1KHz 대역 이상에서는 로그 스케일인 멜 스케일을 사용하였다. 실근 방식과 제안한 방법을 비교하기 위하여 두 가지를 측정하였다. 첫째, 제안한 방법에서의 LSP 파라미터의 값과 실근방식에서의 LSP 파라미터 값을 비교하였다. 둘째, 계산 시간 감소율을 측정하였다. 실험결과, LSP 파라미터의 값은 변화하지 않았으며 계산량은 약 48% 정도 감소하였다.

• 제어로봇시스템학회논문지
• /
• 제5권4호
• /
• pp.403-410
• /
• 1999

In this study, a parallel algorithm has been developed that can quickly solve the optiaml control problem of large-scale dynamic systems. The algorithm adopts the sequential quadratic programming methods and achieves domain decomposition-type parallelism in computing sensitivities for search direction computation. A silicon wafer thermal process problem has been solved using the algorithm, and a parallel efficiency of 45% has been achieved with 16 processors. Practical methods have also been investigated in this study as a way to further speed up the computation time.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 전기.전자공학 학술대회 논문집(II)
• /
• pp.1485-1487
• /
• 1987

To improve time delay produced in computation of trigonometric function by software method, the function generator was designed to compute the sine function with ROMs. Since the computation speed of trigonometric function can be improved by this ROM, it will be used in various parts required to scientific calculation-radar, FFT and signal processing etc.