• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2006.10a
• /
• pp.263-264
• /
• 2006

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.54 no.10
• /
• pp.467-474
• /
• 2005

This paper presents a systematic method to compute a reliability measure for a short term electrical load forecasting system using neuro-fuzzy models. It has been realized that the reliability computation is essential for a load forecasting system to be applied practically. The proposed method employs a local reliability measure in order to exploit the local representation characteristic of the neuro-fuzzy models. It, hence, estimates the reliability of each fuzzy rule learned. The design procedure of the proposed short term load forecasting system is as follows: (1) construct initial structures of neuro-fuzzy models, (2) store them in the initial structure bank, (3) train the neuro-fuzzy model using an appropriate initial structure, and (4) compute load prediction and its reliability. In order to demonstrate the viability of the proposed method, we develop an one hour ahead load forecasting system by using the real load data collected during 1996 and 1997 at KEPCO. Simulation results suggest that the proposed scheme extends the applicability of the load forecasting system with the reliably computed reliability measure.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.6
• /
• pp.704-711
• /
• 1999

This paper presents a design of fuzzy power system stabilizer (FPSS) using adaptive evolutionary computation (AEC). We have proposed an adaptive evolutionary algorithm which uses a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner in order to take merits of two different evolutionary computations. FPSS shows better control performances than conventional power system stabilizer (CPSS) in three-phase fault with heavy load which is used when tuning FPSS. To show the robustness of the proposed FPSS, it is appliedto damp the low frequency oscillations caused by disturbances such as three-phase fault with normal and light load, the angle deviation of generator with normal and light load and the angle deviation of generator with heavy load. Proposed FPSS shows better robustness than CPSS.

• KEPCO Journal on Electric Power and Energy
• /
• v.8 no.2
• /
• pp.159-179
• /
• 2022

Often a network becomes complex, and multiple entities would get in charge of managing part of the whole network. An example is a utility grid. While the entire grid would go under a single utility company's responsibility, the network is often split into multiple subsections. Subsequently, each subsection would be given as the responsibility area to the corresponding sub-organization in the utility company. The issue of how to make subsystems of adequate size and minimum number of interconnections between subsystems becomes more critical, especially in real-time simulations. Because the computation capability limit of a single computation unit, regardless of whether it is a high-speed conventional CPU core or an FPGA computational engine, it comes with a maximum limit that can be completed within a given amount of execution time. The issue becomes worsened in real time simulation, in which the computation needs to be in precise synchronization with the real-world clock. When the subject of the computation allows for a longer execution time, i.e., a larger time step size, a larger portion of the network can be put on a computation unit. This translates into a larger margin of the difference between the worst and the best. In other words, even though the worst (or the largest) computational burden is orders of magnitude larger than the best (or the smallest) computational burden, all the necessary computation can still be completed within the given amount of time. However, the requirement of real-time makes the margin much smaller. In other words, the difference between the worst and the best should be as small as possible in order to ensure the even distribution of the computational load. Besides, data exchange/communication is essential in parallel computation, affecting the overall performance. However, the exchange of data takes time. Therefore, the corresponding consideration needs to be with the computational load distribution among multiple calculation units. If it turns out in a satisfactory way, such distribution will raise the possibility of completing the necessary computation in a given amount of time, which might come down in the level of microsecond order. This paper presents an effective way to split a given electrical network, according to multiple criteria, for the purpose of distributing the entire computational load into a set of even (or close to even) sized computational loads. Based on the proposed system splitting method, heavy computation burdens of large-scale electrical networks can be distributed to multiple calculation units, such as an RTDS real time simulator, achieving either more efficient usage of the calculation units, a reduction of the necessary size of the simulation time step, or both.

• Transactions of Materials Processing
• /
• v.19 no.3
• /
• pp.185-190
• /
• 2010

Application of CAE analyses are wide spread in shaping processes and structural safety verification of plastic products. The importance of CAE analysis and its contributions are getting increase since the processibility and structural safety of product can be predicted. CAE analysis for complex shaped product need a lot of time for modeling and computation compare with simpler one. Therefore careful simulation modeling is required for complex shaped product. Structural analysis for plastic door handle of automobile has been performed and structural safety has been investigated for various load directions and modeling cases. Large stress occurred at the hinge in handle regardless of load direction and modeling case. Consequently hinge is considered structurally very weak among the parts in plastic door handle. It is concluded that simple modeling rather than total modeling with adequate boundary condition equivalent to real situation gives reasonable computational results with saving modeling effort and computation time.

• Journal of Industrial Technology
• /
• v.26 no.B
• /
• pp.233-242
• /
• 2006

Continuous, discrete and semi continuous HMM systems are used for the speech recognition. Discrete systems have the advantage of low run-time computation. However, vector quantization reduces accuracy and this can lead to poor performance. Continuous systems let us get good correctness but they need much calculation so that occasionally they are unable to be used for practice. Although there are semi-continuous systems which apply advantage of continuous and discrete systems, they also require much computation. In this paper, we proposed the way which reduces calculation for continuous systems. The proposed method has the same computational load as discrete systems but can give better recognition accuracy than discrete systems.

• Advances in aircraft and spacecraft science
• /
• v.2 no.2
• /
• pp.217-232
• /
• 2015

To prevent over-testing of the test-item during random vibration testing Scharton proposed and discussed the force limited random vibration testing (FLVT) in a number of publications. Besides the random vibration specification, the total mass and the turn-over frequency of the load (test item), $C^2$ is a very important parameter for FLVT. A number of computational methods to estimate $C^2$ are described in the literature, i.e., the simple and the complex two degrees of freedom system, STDFS and CTDFS, respectively. The motivation of this work is to evaluate the method for the computation of a realistic value of $C^2$ to perform a representative random vibration test based on force limitation, when the adjacent structure (source) description is more or less unknown. Marchand discussed the formal description of getting $C^2$, using the maximum PSD of the acceleration and maximum PSD of the force, both at the interface between load and source. Stevens presented the coupled systems modal approach (CSMA), where simplified asparagus patch models (parallel-oscillator representation) of load and source are connected, consisting of modal effective masses and the spring stiffness's associated with the natural frequencies. When the random acceleration vibration specification is given the CSMA method is suitable to compute the value of the parameter $C^2$. When no mathematical model of the source can be made available, estimations of the value $C^2$ can be find in literature. In this paper a probabilistic mathematical representation of the unknown source is proposed, such that the asparagus patch model of the source can be approximated. The chosen probabilistic design parameters have a uniform distribution. The computation of the value $C^2$ can be done in conjunction with the CSMA method, knowing the apparent mass of the load and the random acceleration specification at the interface between load and source, respectively. Data of two cases available from literature have been analyzed and discussed to get more knowledge about the applicability of the probabilistic method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.2
• /
• pp.710-726
• /
• 2018

This paper presents an extended particle filter to increase the accuracy and decrease the computation load of vehicle tracking. Particle filter has been the subject of extensive interest in video-based tracking which is capable of solving nonlinear and non-Gaussian problems. However, there still exist problems such as preventing unnecessary particle consumption, reducing the computational burden, and increasing the accuracy. We aim to increase the accuracy without an increase in computation load. In proposed method, we calculate the direction angle of the target vehicle. The angular difference between the direction of the target vehicle and each particle of the particle filter is observed. Particles are filtered and weighted, based on their angular difference. Particles with angular difference greater than a threshold is eliminated and the remaining are stored with greater weights in order to increase their probability for state estimation. Threshold value is very critical for performance. Thus, instead of having a constant threshold value, proposed algorithm updates it online. The first advantage of our algorithm is that it prevents the system from failures caused by insufficient amount of particles. Second advantage is to reduce the risk of using unnecessary number of particles in tracking which causes computation load. Proposed algorithm is compared against camshift, direction-based particle filter and condensation algorithms. Results show that the proposed algorithm outperforms the other methods in terms of accuracy, tracking duration and particle consumption.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.7 no.2
• /
• pp.125-134
• /
• 2003

In order to rate current bridge load carrying capacity, typically two methods are used. These are Allowable Stress Rating (ASR) and Load Factor Rating (LFR). Using the rating factors, there are many attempts to make a connection between rating factors and probability concept. The main purpose of the paper is computing the probability of overload using rating factors and probability concept. In this paper, the load rating methods are briefly explained, and the probability concept is connected to rating factors by using live load from Weigh-in-Motion (WIM). Based on the live load model and rati ng factor, the computation procedure of the probability of overload is explained.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.3
• /
• pp.236-242
• /
• 2004

In this paper, we propose an approach to parallelize a load balancing algorithm that was shown to be very effective in distributing workload for parallel computations. Load balancing algorithms are required in executing parallel program efficiently As a parallel computation model, we used dynamically growing tree structure that can be found in many application problems. The load balancing algorithm tries to balance the workload among processors while keeping the communication cost under certain limit. We show how the load balancing algorithm is effectively parallelized on mesh and hypercube interconnection networks, and analyzed the time complexity for each case to show that parallel algorithm actually reduced the various overhead.