• International Journal of Control, Automation, and Systems
• /
• v.4 no.3
• /
• pp.281-292
• /
• 2006

The design and implementation of Generalized Minimum Variance control laws for nonlinear multivariable systems that can include severe nonlinearities is considered. The quadratic cost index minimised involves dynamically weighted error and nonlinear control signal costing terms. The aim here is to show the controller obtained is simple to design and implement. The features of the control law are explored. The controller obtained includes an internal model of the process and in one form is a nonlinear version of the Smith Predictor.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.7 no.2
• /
• pp.115-125
• /
• 2011

An accurate estimation of software development size is an important factor in calculating reasonable cost of project development and determining its success. In this study, we propose estimation models, using function point based on the functional correlation between software, with empirical data. Three models($FP_{est}(I)$, $FP_{est}(II)$, $FP_{est}(III)$) are developed with correlation and regression analysis. The validity of the models is evaluated by the significance test by comparing values of Mean Magnitude of Relative Error (MMRE) and predictions of each model at level n%. Model $FP_{est}(III)$ proved to be superior to other models such as IFPC(Indicative Function Point Count), EFPC(Estimated Function Point Count), EPFS(Early Prediction of Function Size), $FP_{est}(I)$, and $FP_{est}(II)$. As a result, the accuracy of the model appears to be very high to determine the usefulness of the model to finally overcome weakness of other estimation models. The model can be efficiently used to estimate project development size including software size or manpower allocation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.35 no.4
• /
• pp.33-53
• /
• 2010

When purchase prices of a raw material fluctuate over time, the total purchasing cost is mainly affected by reordering time. Existing researches focus on deciding the right time when the demand for each period is replenished at the lowest cost. However, the decision is based on expected future prices which usually turn out to include some error. This discrepancy between expected prices and actual prices deteriorates the performance of inventory models dealing with fluctuating purchase prices. In this paper, we propose a new inventory model which incorporates not only cost but also risk into making up a replenishment schedule to meet each period's demand. For each replenishment schedule, the risk is defined to be the variance of its total cost. By introducing the risk into the objective function, the variability of the total cost can be mitigated, and eventually more stable replenishment schedule will be obtained. According to experimental results from crude oil inventory management, the proposed model showed better performance over other models in respect of variability and cost.

• Transactions on Control, Automation and Systems Engineering
• /
• v.3 no.4
• /
• pp.268-271
• /
• 2001

In this paper, we propose a simplified pollution adaptive mesh generation algorithm using singular elements. The algorithm based on the element pollution error indicator concentrate on boundary nodes. The automatic mesh generation method is followed by either a node-relocation or a node-insertion method. The boundary node relocation phase is introduced to reduce pollution error estimates without increasing the boundary nodes. The node insertion phase greatly improves the error and the factor with the cost of increasing the node numbers. It is shown that the suggested r-h version algorithm combined with singular elements converges more quickly than the conventional one.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.2
• /
• pp.127-133
• /
• 2012

In this paper, the concerned CMA (Constant Modulus Algorithm) adaptive equalizer convergence rate and residual inter-symbol interference using cost function in order to improved to the ACMA (Advanced CMA). The CMA method compensates amplitude but does not compensate phase. On the other hand, The RCA (Reduced Constellation Algorithm) method compensates both the amplitude and the phase but it has the convergence rate problem. MCMA method is a way to solve the phase problem of CMA method compensates both the amplitude and the phase after respectively calculating the real and imaginary components. But it is more than poor CMA method in the complexity of hardware and the compensation performance. The cost function can advantages by improving the CMA and a MCMA (Modified CMA) equalizer so that the amplitude and phase retrieval the equalization steady-state to reduce the error by using ISI and faster convergence rate and performance is good SER (Symbol Error Ratio) was confirmed by computer simulations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12B
• /
• pp.1211-1218
• /
• 2010

OSPF is the optimized routing protocol in wired network and considered as a tactical routing protocol in wireless tactical communication network. However because it is designed basically based on wired environment, it runs inadequately in wireless tactical environment: noise and jamming signal. So, we proposed new OSPF cost function to develop active routing protocol in wireless tactical communication network. In redefined cost function, there are four parameters that are relative transmission speed, link weight, router utilization, link average BER(Bit Error Rate). These parameters reflect wireless tactical characters. Also, we remodel the option field in Hello packet. It can help user to periodically check the link state. From the simulation result, it is shown that proposed OSPF is better than OSPF in jamming situation and has accumulative delay gain with dispersion of traffic load in entire network.

• 한국어정보학회:학술대회논문집
• /
• 2017.10a
• /
• pp.56-59
• /
• 2017

CNN(Convolutional Neural Network)을 이용하여 발화 주제 다중 분류 task를 multi-labeling 방법과, cluster 방법을 이용하여 수행하고, 각 방법론에 MSE(Mean Square Error), softmax cross-entropy, sigmoid cross-entropy를 적용하여 성능을 평가하였다. Network는 음절 단위로 tokenize하고, 품사정보를 각 token의 추가한 sequence와, Naver DB를 통하여 얻은 named entity 정보를 입력으로 사용한다. 실험결과 cluster 방법으로 문제를 변형하고, sigmoid를 output layer의 activation function으로 사용하고 cross entropy cost function을 이용하여 network를 학습시켰을 때 F1 0.9873으로 가장 좋은 성능을 보였다.

• Journal of Power Electronics
• /
• v.18 no.5
• /
• pp.1398-1408
• /
• 2018

In order to further improve the steady-state control performance of model predictive torque control (MPTC), a double-vector-based model predictive torque control without a weighting factor is proposed in this paper. The extended voltage vectors synthesized by two basic voltage vectors are used to increase the number of feasible voltage vectors. Therefore, the control precision of the torque and the stator flux along with the steady-state performance can be improved. To avoid testing all of the feasible voltage vectors, the solution of deadbeat torque control is calculated to predict the reference voltage vector. Thus, the candidate voltage vectors, which need to be evaluated by a cost function, can be reduced based on the sector position of the predicted reference voltage vector. Furthermore, a cost function, which only includes a reference voltage tracking error, is designed to eliminate the weighting factor. Moreover, two voltage vectors are applied during one control period, and their durations are calculated based on the principle of reference voltage tracking error minimization. Finally, the proposed method is tested by simulations and experiments.

• Journal of the Korean Data and Information Science Society
• /
• v.26 no.6
• /
• pp.1573-1582
• /
• 2015

In lifetime data analysis, it is generally known that the lifetimes of test items may not be recorded exactly. There are also situations wherein the withdrawal of items prior to failure is prearranged in order to decrease the time or cost associated with experience. Moreover, it is generally known that more than one cause or risk factor may be present at the same time. Therefore, analysis of censored competing risks data are needed. In this article, we derive the Bayes estimators for the entropy function under the exponential distribution with an unknown scale parameter based on multiply Type II censored competing risks data. The Bayes estimators of entropy function for the exponential distribution with multiply Type II censored competing risks data under the squared error loss function (SELF), precautionary loss function (PLF) and DeGroot loss function (DLF) are provided. Lindley's approximate method is used to compute these estimators.We compare the proposed Bayes estimators in the sense of the mean squared error (MSE) for various multiply Type II censored competing risks data. Finally, a real data set has been analyzed for illustrative purposes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2339-2355
• /
• 2021

In this paper, a joint probabilistic data association algorithm based on loss function (LJPDA) is proposed so that the computation load and accuracy of the multi-target tracking algorithm can be guaranteed simultaneously. Firstly, data association is divided in to three cases based on the relationship among validation gates and the number of measurements in the overlapping area for validation gates. Also the contribution coefficient is employed for evaluating the contribution of a measurement to a target, and the loss function, which reflects the cost of the new proposed data association algorithm, is defined. Moreover, the equation set of optimal contribution coefficient is given by minimizing the loss function, and the optimal contribution coefficient can be attained by using the Newton-Raphson method. In this way, the weighted value of each target can be achieved, and the data association among measurements and tracks can be realized. Finally, we compare performances of LJPDA proposed and joint probabilistic data association (JPDA) algorithm via numerical simulations, and much attention is paid on real-time performance and estimation error. Theoretical analysis and experimental results reveal that the LJPDA algorithm proposed exhibits small estimation error and low computation complexity.