• Structural Engineering and Mechanics
• /
• v.42 no.2
• /
• pp.175-189
• /
• 2012

This paper presents an algorithm for structural reliability with the response surface method. For this aim, an approach with three stages is proposed named as improved response surface method. In the algorithm, firstly, a quadratic approximate function is formed and design point is determined with First Order Reliability Method. Secondly, a point close to the exact limit state function is searched using the design point. Lastly, vector projected method is used to generate the sample points and Second Order Reliability Method is performed to obtain reliability index and probability of failure. Five numerical examples are selected to illustrate the proposed algorithm. The limit state functions of three examples (cantilever beam, highly nonlinear limit state function and dynamic response of an oscillator) are defined explicitly and the others (frame and truss structures) are defined implicitly. ANSYS finite element program is utilized to obtain the response of the structures which are needed in the reliability analysis of implicit limit state functions. The results (reliability index, probability of failure and limit state function evaluations) obtained from the improved response surface are compared with those of Monte Carlo Simulation, First Order Reliability Method, Second Order Reliability Method and Classical Response Surface Method. According to the results, proposed algorithm gives better results for both reliability index and limit state function evaluations.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.631-634
• /
• 2004

In this paper, the Bayesian recurrent neural network (BRNN) is proposed to predict time series data. Among the various traditional prediction methodologies, a neural network method is considered to be more effective in case of non-linear and non-stationary time series data. A neural network predictor requests proper learning strategy to adjust the network weights, and one need to prepare for non-linear and non-stationary evolution of network weights. The Bayesian neural network in this paper estimates not the single set of weights but the probability distributions of weights. In other words, we sets the weight vector as a state vector of state space method, and estimates its probability distributions in accordance with the Bayesian inference. This approach makes it possible to obtain more exact estimation of the weights. Moreover, in the aspect of network architecture, it is known that the recurrent feedback structure is superior to the feedforward structure for the problem of time series prediction. Therefore, the recurrent network with Bayesian inference, what we call BRNN, is expected to show higher performance than the normal neural network. To verify the performance of the proposed method, the time series data are numerically generated and a neural network predictor is applied on it. As a result, BRNN is proved to show better prediction result than common feedforward Bayesian neural network.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.59-69
• /
• 2006

Bluetooth is reputed as a wireless networking technology supplying ad-hoc networks between digital devices. In particular, Bluetooth scatternet is an essential part of dynamic ad-hoc networks. Yet, there have not been sufficient researches performed on scatternet environment. This paper proposes a scatternet reformation algorithm for ad-hoc networks for instances where some nodes enter or leave the scatternet. The proposed algorithm is a general algorithm that can be applied to many types of Bluetooth scatternet regardless of the topology. The proposed algorithm is made for two reformation cases, i.e., nodes leaving and nodes entering. For the reformation when nodes leave a scatternet, the recovery node vector (RNV) algorithm is proposed. It has short reformation setup delay because the process involves a single page process (not including inquiry process). For the reformation when nodes enter a scatternet, the entry node algorithm is proposed. This is a simple and easily implementable algorithm. In this paper, real hardware experiments are carried out to evaluate the algorithm's performance where the reformation setup delay, the reformation setup probability and the data transfer rate are measured. The proposed algorithm has shown improvement in the reformation setup delay and probability.

• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.348-356
• /
• 2005

In this paper, we propose a fast bitrate reduction transcoding method to convert a bitstream coded by H.264 into a lower bitrate H.264 bitstream. Block mode informations and motion vectors generated by H.264 decoder are used for probability-based block mode determination in the proposed transcoding method. And the motion vector reuse and motion vector refinement process are applied in the proposed transcoding. In the experiment results, the proposed methods achieves approximately 40 times improvement in computation complexity compared with the cascaded pixel domain transcoding, while the PSNR(Peak Signal to Noise Ratio) is degraded with only $0.1\~0.3$ dB.

• Journal of Information Processing Systems
• /
• v.11 no.3
• /
• pp.421-437
• /
• 2015

This paper aims to present a supervised classification algorithm based on data fusion for the segmentation of the textured images. The feature extraction method we used is based on discrete wavelet transform (DWT). In the segmentation stage, the estimated feature vector of each pixel is sent to the support vector machine (SVM) classifier for initial labeling. To obtain a more accurate segmentation result, two strategies based on information fusion were used. We first integrated decision-level fusion strategies by combining decisions made by the SVM classifier within a sliding window. In the second strategy, the fuzzy set theory and rules based on probability theory were used to combine the scores obtained by SVM over a sliding window. Finally, the performance of the proposed segmentation algorithm was demonstrated on a variety of synthetic and real images and showed that the proposed data fusion method improved the classification accuracy compared to applying a SVM classifier. The results revealed that the overall accuracies of SVM classification of textured images is 88%, while our fusion methodology obtained an accuracy of up to 96%, depending on the size of the data base.

• Nuclear Engineering and Technology
• /
• v.39 no.1
• /
• pp.63-74
• /
• 2007

In this paper, a reconfigurable controller consisting of a normal controller and a standby controller is designed to control the thermoelectric (TE) power in the SP-100 space reactor. The normal controller uses a model predictive control (MPC) method where the future TE power is predicted by using support vector regression. A genetic algorithm that can effectively accomplish multiple objectives is used to optimize the normal controller. The performance of the normal controller depends on the capability of predicting the future TE power. Therefore, if the prediction performance is degraded, the proportional-integral (PI) controller of the standby controller begins to work instead of the normal controller. Performance deterioration is detected by a sequential probability ratio test (SPRT). A lumped parameter simulation model of the SP-100 nuclear space reactor is used to verify the proposed reconfigurable controller. The results of numerical simulations to assess the performance of the proposed controller show that the TE generator power level controlled by the proposed reconfigurable controller could track the target power level effectively, satisfying all control constraints. Furthermore, the normal controller is automatically switched to the standby controller when the performance of the normal controller degrades.

• Journal of Korean Institute of Industrial Engineers
• /
• v.42 no.1
• /
• pp.38-49
• /
• 2016

This paper proposes a mathematical model-based solution for sourcing decisions with an objective of minimizing the manufacturer's total cost in the two-echelon supply chain with supply capacity risk. The risk impact is represented by uniform, beta, and triangular distributions. For the mathematical model, the probability vector of normal, risk, and recovery statuses are developed by using the status transition probability matrix and the equations for estimating the supply capacity under risk and recovery statuses are derived for each of the three probability distributions. Those formulas derived are validated using the sampling method. The results of the simulation study on the test problem show that the sourcing decisions using the proposed solution reduce the total cost by 1.6~3.7%, compared with the ones without a consideration of supply capacity risk. The total cost reduction increases approximately in a linear fashion as the probability of risk occurrence or reduction rate of supply capacity due to risk events is increased.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.4
• /
• pp.1263-1274
• /
• 2021

In online competitive social networks, each user can be influenced by different competing influencers and consequently chooses different products. But their interest may change over time and may have swings between different products. The existing influence spreading models seldom take into account the time-related shifts. This paper proposes a minimum cost influence maximization algorithm based on the competitive transition probability. In the model, we set a one-dimensional vector for each node to record the probability that the node chooses each different competing influencer. In the process of propagation, the influence maximization on Competitive Linear Threshold (IMCLT) spreading model is proposed. This model does not determine by which competing influencer the node is activated, but sets different weights for all competing influencers. In the process of spreading, we select the seed nodes according to the cost function of each node, and evaluate the final influence based on the competitive transition probability. Experiments on different datasets show that the proposed minimum cost competitive influence maximization algorithm based on IMCLT spreading model has excellent performance compared with other methods, and the computational performance of the method is also reasonable.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.4
• /
• pp.40-49
• /
• 1994

In this paper, we propose methods for improving the performance of word recognition system. The ray stratey of the first method is to apply the inertia to the feature vector sequences of speech signal to stabilize the transitions between VQ cdoes. The second method is generating the new observation probabilities using the transition matrix of VQ codes as weights at the observation probability of the output symbol, so as to take into account the time relation between neighboring frames in DHMM. By applying the inertia to the feature vector sequences, we can reduce the overlapping of probability distribution of the response paths for each word and stabilize state transitions in the HMM. By using the transition matrix of VQ codes as weights in conventional DHMM. we can divide the probability distribution of feature vectors more and more, and restrict the feature distribution to a suitable region so that the performance of recognition system can improve. To evaluate the performance of the proposed methods, we carried out experiments for 50 DDD area names. As a result, the proposed methods improved the recognition rate by $4.2\%$ in the speaker-dependent test and $12.45\%$ in the speaker-independent test, respectively, compared with the conventional DHMM.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.4
• /
• pp.537-544
• /
• 2020

Advances in detection techniques, such as mutation and obfuscation, are being advanced with the development of malware technology. In the malware detection technology, unknown malware detection technology is important, and a method for Malware Authorship Attribution that detects an unknown malicious code by identifying the author through distributed malware is being studied. In this paper, we try to extract the compiler information affecting the binary-based author identification method and to investigate the sensitivity of feature selection, probability and non-probability models, and optimization to classification efficiency between studies. In the experiment, the feature selection method through information gain and the support vector machine, which is a non-probability model, showed high efficiency. Among the optimization studies, high classification accuracy was obtained through feature selection and model optimization through the proposed framework, and resulted in 48% feature reduction and 53 faster execution speed. Through this study, we can confirm the sensitivity of feature selection, model, and optimization methods to classification efficiency.