• The Journal of Information Technology
• /
• v.5 no.1
• /
• pp.99-111
• /
• 2002

Due to non-linear characteristics of color spaces, color corrections using linear conversions for real image near color reappearance causes color distortions. In order to overcome this problem, the Bezier Curve, constructed with a set of arbitrary plane in the linear theory, has been used. However, the Bezier Curve increases in proportion to the number of data points, resulting in higher computational complexities. This paper attempts to use a Triplicated Piecewise Bezier Cubic-Curve (TPBC-Curve) of which the degree is cubic on the whole interval while keeping the characteristics of Bezier Curves. By Comparing the TPBC-Curve with Bezier Curve of 20 degree, the paper not only reduces the distortion during color correction but also lessens the relative increase of workload that is caused by the color correction in a small zone.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.3
• /
• pp.175-184
• /
• 2008

To construct user profiles automatically, an extraction method for representative keywords from a set of documents is needed. In our previous works, we suggested such a method and showed its usefulness. Here, we apply it to the classification problem and observe how much it contributes to performance improvement. The method can be used as a linear document classifier with few modifications. So, we first evaluate its performance for that case. The method is also applicable to some non-linear classification methods such as GIS (Generalized Instance Set). In GIS algorithm, generalized instances are built from training documents by a generalization function and then the K-NN algorithm is applied to them, where the method can be used as a generalization function. For comparative works, two famous linear classification methods, Rocchio and Widrow-Hoff algorithms, are also used. Experimental results show that our method is better than the others for the case that only positive documents are considered, but not when negative documents are considered together.

• Structural Engineering and Mechanics
• /
• v.56 no.5
• /
• pp.787-796
• /
• 2015

When the temperature of a structure varies, there is a tendency to produce changes in the shape of the structure. The resulting actions may be of considerable importance in the analysis of the structures having non-prismatic members. The computation of design forces for the non-prismatic beams having symmetrical parabolic haunches (NBSPH) is fairly difficult because of the parabolic change of the cross section. Due to their non-prismatic geometrical configuration, their assessment, particularly the computation of fixed-end horizontal forces and fixed-end moments becomes a complex problem. In this study, the efficiency of the Artificial Neural Networks (ANN) and Adaptive Neuro Fuzzy Inference Systems (ANFIS) in predicting the design forces and the design moments of the NBSPH due to temperature changes was investigated. Previously obtained finite element analyses results in the literature were used to train and test the ANN and ANFIS models. The performances of the different models were evaluated by comparing the corresponding values of mean squared errors (MSE) and decisive coefficients ($R^2$). In addition to this, the comparison of ANN and ANFIS with traditional methods was made by setting up Linear-regression (LR) model.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.5
• /
• pp.477-482
• /
• 2015

Linear regressions and evolutionary nonlinear regression based compensation techniques for the short-range prediction of wind speed are investigated. Development of an efficient MOS(Model Output Statistics) is necessary to correct systematic errors of the model, but a linear regression based MOS is hard to manage an irregular nature of weather prediction. In order to solve the problem, a nonlinear and symbolic regression method using GP(Genetic Programming) is suggested for a development of MOS for wind speed prediction. The proposed method is compared to various linear regression methods for prediction of wind speed. Also, statistical analysis of distribution for UM elements for each method is executed. experiments are performed for KLAPS(Korea Local Analysis and Prediction System) re-analysis data from 2007 to 2013 year for Jeju Island and Busan area in South Korea.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.16 no.6
• /
• pp.1179-1194
• /
• 1992

QUICKER scheme has several attractive properties. However, under highly convective conditions, it produces overshoots and possibly some oscillations on each side of steps in the dependent variable when the flow is convected at an angle oblique to the grid line. Fortunately, it is possible to modify the QUICKER scheme using non-linear and linear functional relationship. Details of the development of polynomial upwinding scheme are given in this paper, where it is seen that this non-linear scheme has also third order accuracy. This polynomial upwinding scheme is used as the basis for the SHARPER and SMARTER schemes. Another revised scheme was developed by partial modification of QUICKER scheme using CDS and UPWIND schemes(QUICKUP). These revised schemes are tested at the well known bench mark flows, Two-Dimensional Pure Convection Flows in Oblique-Step, Lid Driven Cavity Flows and Buoyancy Driven Cavity Flows. For pure convection oblique step flow test problem, QUICKUP, SMARTER and SHARPER schemes remain absolutely monotonic without overshoot and oscillation. QUICKUP scheme is more accurate than any other scheme in their relative accuracy. In high Reynolds number Lid Driven Cavity Flow, SMARTER and SHARPER schemes retain lower computational cost than QUICKER and QUICKUP schemes, but computed velocity values in the revised schemes produced less predicted values than QUICKER scheme which is strongly effected by overshoot and undershoot values. Also, in Buoyancy Driven Cavity Flow, SMARTER, SHARPER and QUICKUP schemes give acceptable results.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.63 no.1
• /
• pp.103-116
• /
• 2021

Analysis of runoff is substantial for effective water management in the watershed. Runoff occurs by reaction of a watershed to the rainfall and has non-linearity and uncertainty due to the complex relation of weather and watershed factors. ANN (Artificial Neural Network), which learns from the data, is one of the machine learning technique known as a proper model to interpret non-linear data. The performance of ANN is affected by the ANN's structure, the number of hidden layer nodes, learning rate, and activation function. Especially, the activation function has a role to deliver the information entered and decides the way of making output. Therefore, It is important to apply appropriate activation functions according to the problem to solve. In this paper, ANN models were constructed to estimate runoff with different activation functions and each model was compared and evaluated. Sigmoid, Hyperbolic tangent, ReLU (Rectified Linear Unit), ELU (Exponential Linear Unit) functions were applied to the hidden layer, and Identity, ReLU, Softplus functions applied to the output layer. The statistical parameters including coefficient of determination, NSE (Nash and Sutcliffe Efficiency), NSEln (modified NSE), and PBIAS (Percent BIAS) were utilized to evaluate the ANN models. From the result, applications of Hyperbolic tangent function and ELU function to the hidden layer and Identity function to the output layer show competent performance rather than other functions which demonstrated the function selection in the ANN structure can affect the performance of ANN.

• Journal of Korean Society for Quality Management
• /
• v.18 no.2
• /
• pp.18-24
• /
• 1990

The location of inspection stations is a significant component of production systems. In this paper, a prototype expert system is designed for deciding the optimal location of inspection stations. The production system is defined as a single channel of n serial operation stations. The potential inspection station can be located after any of the operation stations. Nonconforming units are generated from a compound binomial distribution with known parameters at any given operation station. Traditionally Dynamic programming, Zero-one integer programming, or Non-linear programming techniques are used to solve this problem. However a problem with these techniques is that the computation time becomes prohibitively large when t be number of potential inspection stations are fifteen or more. An expert system has the potential to solve this problem using a rule-based system to determine the near optimal location of inspection stations. This prototype expert system is divided into a static database, a dynamic database and a knowledge base. Based on defined production systems, the sophisticated rules are generated by the simulator as a part of the knowledge base. A generate-and-test inference mechanism is utilized to search the solution space by applying appropriate symbolic and quantitative rules based on input data. The goal of the system is to determine the location of inspection stations while minimizing total cost.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.2
• /
• pp.241-249
• /
• 1998

In this paper, we seek to find an optimal allocation of link capacity in a data communication network. The architecture of the data communication network considered in the study is an online-service network based on public switched telephone network(PSTN) and packet switched data network(PSDN). In designing the architecture of the network, we need to deal with various measures of quality of service(QoS). Two important service measures are the call blocking probability in PSTN and the data transfer delay time in PSDN. Considering the tradeoff between the call blocking probability and the data transfer delay time in the network, we have developed the optimal link capacity allocation model that minimizes the total link cost, while guarantees the call blocking probability and the data transfer delay time within an acceptable level of QoS. This problem can be formulated as a non-linear integer programming model. We have solved the problem with tabu search and simulated annealing methods. In addition, we have analyzed the sensitivity of the model and provided the insight of the model along with computational results.

• Journal of Korean Society for Quality Management
• /
• v.16 no.1
• /
• pp.78-87
• /
• 1988

The purpose of this study is to develop the algorithm applicable to the integrated production inventory model under quantity discount. To achieve this purpose, the integrated production inventory model which unifies the inventory problem of raw materials and the finished product for a single product manufacturing system is considered. The product is manufactured in batches and the raw materials are obtained from outside suppliers but some of the raw materials are discounted according to the purchasing quantity. The intergrated production inventory problem considered in this study is formulated by the non-linear mixed integer programming model, and the optimal solution is obtained by using the algorithm developed by Goyal. Then, the algorithm developed by this study is applied to the quantity discount problem, and the optimal solution is revised by this results. The quantity discount algorithm of the integrated production inventory model developed by this study gives a systematic procedure to obtain the optimum policy to minimize the total cost in any case. The numerical example involving 20 raw materials and 5 raw materials among them are discounted according to the purchasing quantity is given to verify the mathematical model and the algorithm developed in this study.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.2
• /
• pp.169-175
• /
• 2021

The lot sizing problem(LSP) is a hard problem that classified as non-deterministic(NP)-complete because of the polynomial-time optimal solution algorithm is unknown yet. The well-known W-W algorithm can be obtain the solution within polynomial-time, but this algorithm is a very complex, therefore the heuristic approximated S-M algorithm is suggested. This paper suggests O(n) linear-time complexity algorithm that can be find not the approximated but optimal solution. This algorithm determines the lot size Xt∗ in period t to the sum of the demands of interval [t,t+k], the period t+k is determined by the holding cost will not exceed setup cost of t+k period. As a result of various experimental data, this algorithm finds the optimal solution about whole data.