• Journal of Electrical Engineering and Technology
• /
• v.9 no.6
• /
• pp.2042-2048
• /
• 2014

In medium voltage electrical distribution networks, reforming the loss reduction is important, and in line with this, the issue of system engineering and use of proper equipment Expansion of distribution systems results in higher system losses and poor voltage regulation. Therefore, an efficient and effective distribution system has become more important. So, proper selection of conductors in the distribution system is crucial as it determines the current density and the resistance of the line. Evaluation of aging conductors for losses and costs imposed in addition to the careful planning of technical and economic networks can be identified in the network design. In this paper the use of imperialist competitive algorithm; genetic algorithm; is proposed to optimal branch conductor selection and reconstruction in radial distribution systems planning. The objective is to minimize the overall cost of annual energy losses and depreciation on the cost of conductors to improve productivity given the maximum current carrying capacity and acceptable voltage levels. Simulations are carried out on 69-bus radial distribution network using genetic algorithm approaches to show the accuracy as well as the efficiency of the proposed solution technique.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.5
• /
• pp.1967-1983
• /
• 2020

The goal of this paper is to analyze and build an algorithm to recognize hand gestures applying to smart home applications. The proposed algorithm uses image processing techniques combing with artificial neural network (ANN) approaches to help users interact with computers by common gestures. We use five types of gestures, namely those for Stop, Forward, Backward, Turn Left, and Turn Right. Users will control devices through a camera connected to computers. The algorithm will analyze gestures and take actions to perform appropriate action according to users requests via their gestures. The results show that the average accuracy of proposal algorithm is 92.6 percent for images and more than 91 percent for video, which both satisfy performance requirements for real-world application, specifically for smart home services. The processing time is approximately 0.098 second with 10 frames/sec datasets. However, accuracy rate still depends on the number of training images (video) and their resolution.

• Smart Structures and Systems
• /
• v.17 no.6
• /
• pp.1017-1030
• /
• 2016

This study focuses on the system identification of reinforced concrete bridges using vector autoregressive model (VAR). First, the time series output response from a bridge establishes the autoregressive (AR) models. AR models are one of the most accurate methods for stationary time series. Burg's algorithm estimates the autoregressive coefficients (ARCs) at p-lag by reducing the sum of the forward and the backward errors. The computed ARCs are assembled in the state system matrix and the eigen-system realization algorithm (ERA) computes: the eigenvector matrix that contains the vectors of the mode shapes, and the eigenvalue matrix that contains the associated natural frequencies. By taking advantage of the characteristic of the AR model with ERA (ARMERA), civil engineering can address problems related to damage detection. Operational modal analysis using ARMERA is applied to three experiments. One experiment is coupled with an artificial neural network algorithm and it can detect damage locations and extension. The neural network uses a specific number of ARCs as input and multiple submatrix scaling factors of the structural stiffness matrix as output to represent the damage.

• Journal of KIISE
• /
• v.42 no.5
• /
• pp.601-608
• /
• 2015

In order to answer questions successfully on behalf of the human contestant in DeepQA environments such as 'Jeopardy!', the American quiz show, the computer needs to have the capability of fast temporal and spatial reasoning on a large-scale commonsense knowledge base. In this paper, we present a hybrid spatial reasoning algorithm, among various efficient spatial reasoning methods, for handling directional and topological relations. Our algorithm not only improves the query processing time while reducing unnecessary reasoning calculation, but also effectively deals with the change of spatial knowledge base, as it takes a hybrid method that combines forward and backward reasoning. Through experiments performed on the sample spatial knowledge base with the hybrid spatial reasoner of our algorithm, we demonstrated the high performance of our hybrid spatial reasoning algorithm.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.39 no.4
• /
• pp.55-62
• /
• 2002

FRLGC(Fiber Ring laser Gain Clamped) EDFA Is demonstrated for an automatic gain control in hi-directional ADM(Add Drop Multiplexer) node configuration. Specifically, we investigate hi-directional characteristics of noise figure. Assuming a hi-directional small signal input, noise figures for forward or backward signal input are calculated using average inversion algorithm, according to the propagating directions and lasing wavelengths of a compensating signal. The operating condition of FRLGC-EDFA may be optimized with a backward lasing and short lasing wavelength in the aspect of hi-directional noise figure characteristics.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.654-662
• /
• 2016

As the number of gates and basic events in fault trees increases, it becomes difficult to calculate the exact probability of the top event. In order to overcome this difficulty the BDD methodology can be used to calculate the exact top event probability for small and medium size fault trees in short time. Fault trees are converted to BDD by using CUDD library functions and a failure path search algorithm is proposed to calculate the exact top event probability. The backward search algorithm is more efficient than the forward one in finding failure paths and in the calculation of the top event probability. This backward search algorithm can reduce searching time in the identification of disjoint failure paths from BDD and can be considered as an effective tool to find the cut sets and the minimal cut sets for the given fault trees.

• Journal of Advanced Navigation Technology
• /
• v.22 no.1
• /
• pp.20-26
• /
• 2018

In this paper, we propose a moving object detection and tracking algorithm based on multi-frame feature point tracking information to reduce false positives. However, there are problems of detection error and tracking speed in existing studies. In order to compensate for this, we first calculate the corner feature points and the optical flow of multiple frames for camera movement compensation and object tracking. Next, the tracking error of the optical flow is reduced by the multi-frame forward-backward tracking, and the traced feature points are divided into the background and the moving object candidate based on homography and RANSAC algorithm for camera movement compensation. Among the transformed corner feature points, the outlier points removed by the RANSAC are clustered and the outlier cluster of a certain size is classified as the moving object candidate. Objects classified as moving object candidates are tracked according to label tracking based data association analysis. In this paper, we prove that the proposed algorithm improves both precision and recall compared with existing algorithms by using quadrotor image - based detection and tracking performance experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2614-2632
• /
• 2015

A multiple symbol detection (MSD) algorithm is proposed relying on soft information for ultra-wideband systems, where differential space-time block code is employed. The proposed algorithm aims to calculate a posteriori probabilities (APP) of information symbols, where a forward and backward message passing mechanism is implemented based on the BCJR algorithm. Specifically, an MSD metric is analyzed and performed for serving the APP model. Furthermore, an autocorrelation sampling is employed to exploit signals dependencies among different symbols, where the observation window slides one symbol each time. With the aid of the bidirectional message passing mechanism and the proposed sampling approach, the proposed MSD algorithm achieves a better detection performance as compared with the existing MSD. In addition, when the proposed MSD is exploited in conjunction with channel decoding, an iterative soft-input soft-output MSD approach is obtained. Finally, simulations demonstrate that the proposed approaches improve detection performance significantly.

• Communications for Statistical Applications and Methods
• /
• v.24 no.4
• /
• pp.383-396
• /
• 2017

The model in our approach assumes that computer responses are a realization of a Gaussian processes superimposed on a regression model called a Gaussian process regression model (GPRM). Selecting a subset of variables or building a good reduced model in classical regression is an important process to identify variables influential to responses and for further analysis such as prediction or classification. One reason to select some variables in the prediction aspect is to prevent the over-fitting or under-fitting to data. The same reasoning and approach can be applicable to GPRM. However, only a few works on the variable selection in GPRM were done. In this paper, we propose a new algorithm to build a good prediction model among some GPRMs. It is a post-work of the algorithm that includes the Welch method suggested by previous researchers. The proposed algorithms select some non-zero regression coefficients (${\beta}^{\prime}s$) using forward and backward methods along with the Lasso guided approach. During this process, the fixed were covariance parameters (${\theta}^{\prime}s$) that were pre-selected by the Welch algorithm. We illustrated the superiority of our proposed models over the Welch method and non-selection models using four test functions and one real data example. Future extensions are also discussed.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.95-98
• /
• 1996

Universal Learning Network(U.L.N.), which can model and control the large scale complicated systems naturally, consists of nonlinearly operated nodes and multi-branches that may have arbitrary time delays including zero or minus ones. Therefore, U.L.N. can be applied to many kinds of systems which are difficult to be expressed by ordinary first order difference equations with one sampling time delay. It has been already reported that learning algorithm of parameter variables in U.L.N. by forward and backward propagation is useful for modeling, managing and controlling of the large scale complicated systems such as industrial plants, economic, social and life phenomena. But, in the previous learning algorithm of U.L.N., time delays between the nodes were fixed, in other words, criterion function of U.L.N. was improved by adjusting only parameter variables. In this paper, a new learning algorithm is proposed, where not only parameter variables but also time delays between the nodes can be adjusted. Because time delays are integral numbers, adjustment of time delays can be carried out by a kind of random search procedure which executes intensified and diversified search in a single framework.