• Composites Research
• /
• v.29 no.4
• /
• pp.173-178
• /
• 2016

Graphene oxide (GO) was concurrently reduced and functionalized using long alkyl chain dodecyl amine (DA). The DA functionalized GO (DA-G) was assumed to disperse homogenously in linear low density polyethylene (LLDPE). Subsequently, DA-G was used to fabricate DA-G/LLDPE composites by melt mixing technique. Fourier transform infrared spectra analysis was performed to ascertain the simultaneous reduction and functionlization of GO. Field emission scanning electron microscopy analysis was performed to ensure the homogenous distribution and dispersion of DA-G in LLDPE matrix. The enhanced storage modulus value of the composites validates the homogenous dispersion of DA-G and its good interfacial interaction with LLDPE matrix. An increased in tensile strength value by ~ 64% also confirms the generation of good interface between the two constituents, through which efficient load transfer is possible. However, no significant improvement in glass transition temperature was observed. This simple technique of fabricating LLDPE composites following industrially viable melt mixing procedure could be realizable to developed mechanically strong graphene based LLDPE composites for future applications.

• Journal of the Korea Convergence Society
• /
• v.9 no.6
• /
• pp.45-52
• /
• 2018

In this paper, we propose a linear interpolation method based on patch information generated from a low - resolution image for generating a super resolution image in a single image. Using the regression model of the global space, which is a conventional super resolution generation method, results in poor quality in general because of lack of information to be referred to a specific region. In order to compensate for these results, we propose a method to extract meaningful information by dividing the region into patches in the process of super resolution image generation, analyze the constituents of the image matrix region extended for super resolution image generation, We propose a method of linear interpolation based on optimal patch information that is searched by correlating patch information based on the information gathered before the interpolation process. For the experiment, the original image was compared with the reconstructed image with PSNR and SSIM.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1511-1523
• /
• 2011

In this paper, we consider the smoothing Newton method for the nonlinear complementarity problems with $P_0$-function. The proposed algorithm is based on a new smoothing function and it needs only to solve one linear system of equations and perform one line search per iteration. Under the condition that the solution set is nonempty and bounded, the proposed algorithm is proved to be convergent globally. Furthermore, the local superlinearly(quadratic) convergence is established under suitable conditions. Preliminary numerical results show that the proposed algorithm is very promising.

• Journal of the Korea Convergence Society
• /
• v.7 no.5
• /
• pp.213-219
• /
• 2016

This paper presents a branch-and-bound algorithm for solving the concave minimization problem with upper bounded variables whose single constraint is linear. The algorithm uses simplex as partition element. Because the convex envelope which most tightly underestimates the concave function on the simplex is uniquely determined by solving the related linear equations. Every branching process generates two subsimplices one lower dimensional than the candidate simplex by adding 0 and upper bound constraints. Subsequently the feasible points are partitioned into two sets. During the bounding process, the linear programming problems defined over subsimplices are minimized to calculate the lower bound and to update the incumbent. Consequently the simplices which do certainly not contain the global minimum are excluded from consideration. The major advantage of the algorithm is that the subproblems are defined on the one less dimensinal space. It means that the amount of work required for the subproblem decreases whenever the branching occurs. Our approach can be applied to solving the concave minimization problems under knapsack type constraints.

• Journal of the Korean Society for Precision Engineering
• /
• v.31 no.11
• /
• pp.987-992
• /
• 2014

Register control of roll-to-roll printing system for printed electronics requires accurate measurement of register errors. The register marks used for the recognition of patterns position between layers have inherently defects due to low printability of register marks themselves, which brings out inaccurate register accuracy and consequently low performance of printed electronics devices. In this study, the compensation methods for the unrecognized or missing register data are proposed to improve the recognition and consequently the control performance of register accuracy in roll-to-roll printing equipment. The compensation methods using the prior data and the linear interpolation are proposed and compared with the case without compensation for the simulation as well as experiment. Only the linear interpolation method could successfully compensate the missing data and consequently improve the register control performance. We should apply the compensation process of the register errors to improve the register control accuracy in the roll-to-roll printing equipment.

• Structural Engineering and Mechanics
• /
• v.4 no.2
• /
• pp.139-148
• /
• 1996

Vector algorithms and the relative importance of the four basic modules (computation of element stiffness matrices, assembly of the global stiffness matrix, solution of the system of linear simultaneous equations, and calculation of stresses and strains) of a finite element computer program for inelastic analysis of reinforced concrete shells are presented. Performance of the vector program is compared with a scalar program. For a cooling tower problem, the speedup factor from the scalar to the vector program is 34 for the element stiffness matrices calculation, 25.3 for the assembly of global stiffness matrix, 27.5 for the equation solver, and 37.8 for stresses, strains and nodal forces computations on a Gray Y-MP. The overall speedup factor is 30.9. When the equation solver alone is vectorized, which is computationally the most intensive part of a finite element program, a speedup factor of only 1.9 is achieved. When the rest of the program is also vectorized, a large additional speedup factor of 15.9 is attained. Therefore, it is very important that all the modules in a nonlinear program are vectorized to gain the full potential of the supercomputers. The vector finite element computer program for inelastic analysis of RC shells with layered elements developed in the present study enabled us to perform mesh convergence studies. The vector program can be used for studying the ultimate behavior of RC shells and used as a design tool.

• The Journal of the Convergence on Culture Technology
• /
• v.10 no.1
• /
• pp.159-164
• /
• 2024

The domestic petroleum market is highly sensitive to changes in international oil prices. So, it is important to identify and respond to those changes. In particular, it is necessary to clearly understand the factors causing the price fluctuations of gasoline, which exhibits high consumption. International gasoline prices are influenced by global factors such as gasoline supplies, geopolitical events, and fluctuations in the U.S. dollar. However, previous studies have only focused on gasoline supplies. In this study, we explore the causal relationship between economic indicators and international gasoline prices using various machine learning-based regression models. First, we collect data on various global economic indicators. Second, we perform data preprocessing. Third, we model using Multiple linear regression, Ridge regression, and Lasso(Least Absolute Shrinkage and Selection Operator) regression. The multiple linear regression model showed the highest accuracy at 96.73% in test sets. As a result, Our Multiple linear regression model showed the highest accuracy at 96.73% in test sets. We will expect that our proposed model will be helpful for domestic economic stability and energy policy decisions.

• Steel and Composite Structures
• /
• v.25 no.6
• /
• pp.663-670
• /
• 2017

The problem of layup optimization of the composite laminates involves a very complex multidimensional solution space which is usually non-exhaustively explored using different heuristic computational methods such as genetic algorithms (GA). To ensure the convergence to the global optimum of the applied heuristic during the optimization process it is necessary to evaluate a lot of layup configurations. As a consequence the analysis of an individual layup configuration should be fast enough to maintain the convergence time range to an acceptable level. On the other hand the mechanical behavior analysis of composite laminates for any geometry and boundary condition is very convoluted and is performed by computational expensive numerical tools such as finite element analysis (FEA). In this respect some studies propose very fast FEA models used in layup optimization. However, the lower bound of the execution time of FEA models is determined by the global linear system solving which in some complex applications can be unacceptable. Moreover, in some situation it may be highly preferred to decrease the optimization time with the cost of a small reduction in the analysis accuracy. In this paper we explore some machine learning techniques in order to estimate the failure of a layup configuration. The estimated response can be qualitative (the configuration fails or not) or quantitative (the value of the failure factor). The procedure consists of generating a population of random observations (configurations) spread across solution space and evaluating using a FEA model. The machine learning method is then trained using this population and the trained model is then used to estimate failure in the optimization process. The results obtained are very promising as illustrated with an example where the misclassification rate of the qualitative response is smaller than 2%.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.3
• /
• pp.289-300
• /
• 2003

In this paper, we introduce an identification method in Fuzzy Relation-based Fuzzy Neural Networks (FRFNN) through a hybrid identification algorithm. The proposed FRFNN modeling implement system structure and parameter identification in the efficient form of "If...., then... " statements, and exploit the theory of system optimization and fuzzy rules. The FRFNN modeling and identification environment realizes parameter identification through a synergistic usage of genetic optimization and complex search method. The hybrid identification algorithm is carried out by combining both genetic optimization and the improved complex method in order to guarantee both global optimization and local convergence. An aggregate objective function with a weighting factor is introduced to achieve a sound balance between approximation and generalization of the model. The proposed model is experimented with using two nonlinear data. The obtained experimental results reveal that the proposed networks exhibit high accuracy and generalization capabilities in comparison to other models.er models.

• Transactions on Control, Automation and Systems Engineering
• /
• v.4 no.3
• /
• pp.189-194
• /
• 2002

This paper presents a state observer design for a class of MTMO nonlinear systems that has a block triangular structure. For this, the extension of the existing design for SISO triangular systems to MIMO cases is provided. Since the gain of the proposed observer. depends on a nonlinear part as well as a linear one of a system, it improves the transient performance of the high gain ob-server. Also, by using a generalized similarity transformation for the error dynamics, it is shown that order some boundedness condi-tion, the proposed observer guarantees the global exponential convergence of the estimation error. Finally, we will give a simulation example to show the validity of our design methodology.