• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.4
• /
• pp.381-384
• /
• 2008

In this paper, we consider the problem of designing decentralized sliding mode static output feedback control laws for a class of large scale systems with mismatched uncertainties. We derive a sufficient condition for the existence of a linear switching surface in terms of constrained linear matrix inequalities(LMIs), and we parameterize the linear switching surfaces in terms of the solution matrices to the given constrained LMI existence conditions. We also give an LMI-based algorithm for designing decentralized switching feedback control laws. Finally, we give a design example in order to show the effectiveness of our method.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.30 no.5 s.248
• /
• pp.595-601
• /
• 2006

Design space optimization using design space adjustment and refinement is used to optimize a knuckle in the suspension system of an automobile. This approach is a new efficient method for large-scale topology optimization by virtue of two reasons. First, design space adjustment including design space expansion and reduction is suitable for large-scale problems. Second, the design space refinement can be done globally or locally where and when necessary and thus is very effective in obtaining a target resolution with much less number of elements. Compliance minimization for a knuckle is considered with a realistic working condition to show the effectiveness and superiority of the new approach.

• 한국전산유체공학회:학술대회논문집
• /
• 2007.04a
• /
• pp.41-44
• /
• 2007

A large eddy simulation method with unstructured mesh is presented. Two explicit filtering procedures are adopted for reducing the aliasing error of the nonlinear convective term and measuring the level of subgrid scale velocity fluctuation, respectively. The developed subgrid scale model is basically an eddy viscosity model which depends on both local velocity fluctuation level and local grid scale. As a validation problem, the flows around a sphere of several Reynolds numbers are simulated and some characteristic quantities are compared to experimental data and numerical results in the literature.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.5197-5218
• /
• 2019

Large-scale retrieval algorithm is problem for visual analyses applications, along its research track. In this paper, we propose a high-efficiency region division-based image retrieve approaches, which fuse low-level local color histogram feature and texture feature. A novel image region division is proposed to roughly mimic the location distribution of image color and deal with the color histogram failing to describe spatial information. Furthermore, for optimizing our region division retrieval method, an image descriptor combining local color histogram and Gabor texture features with reduced feature dimensions are developed. Moreover, we propose an extended Canberra distance method for images similarity measure to increase the fault-tolerant ability of the whole large-scale image retrieval. Extensive experimental results on several benchmark image retrieval databases validate the superiority of the proposed approaches over many recently proposed color-histogram-based and texture-feature-based algorithms.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.1
• /
• pp.26-32
• /
• 2000

In this paper, we consider to robust controller design problem for the linear large scale systems with the uncertainties and the time-delays. The considered time-delays are that exist in the state and the input of the subsystems and the interconnected subsystems. And the considered uncertainties are two general types that exist in the system, input and interconnected matrices. Based on the linear matrix inequality(LMI) and Lyapunov theorem, we present sufficient conditions for the existence of a controller that guarantees the asymptotic stability of systems regardless of the uncertainties and the time-delays. Also, the controller can be easily obtained by checking the feasibility of the LMI's. Finally, we show the usefulness of our results by an example.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.8
• /
• pp.651-655
• /
• 2005

In this paper, we consider the problem of designing decentralized sliding mode control laws far a class of large scale systems with mismatched uncertainties. We derive a sufficient condition far the existence of a linear switching surface in terms of a linear matrix inequalities(LMIs), and we parameterize the linear switching surfaces in terms of the solution matrices to the given LMI existence conditions. We also give an algorithm for designing decentralized switching feedback control laws. Finally, we give a design example in order to show the effectiveness of our method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.8
• /
• pp.1011-1017
• /
• 2019

This paper proposes reinforcement learning to solve the node-disjoint path problem which establishes multipath for reliable data transmission in wireless ad-hoc networks. The node-disjoint path problem is a problem of determining a plurality of paths so that the intermediate nodes do not overlap between the source and the destination. In this paper, we propose an optimization method considering transmission distance in a large-scale wireless ad-hoc network using Q-learning in reinforcement learning, one of machine learning. Especially, in order to solve the node-disjoint path problem in a large-scale wireless ad-hoc network, a large amount of computation is required, but the proposed reinforcement learning efficiently obtains appropriate results by learning the path. The performance of the proposed reinforcement learning is evaluated from the viewpoint of transmission distance to establish two node-disjoint paths. From the evaluation results, it showed better performance in the transmission distance compared with the conventional simulated annealing.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.39 no.4
• /
• pp.75-84
• /
• 2014

In this paper, we dealt with feature selection problem of large-scale and high-dimensional biological data such as omics data. For this problem, most of the previous approaches used simple score function to reduce the number of original variables and selected features from the small number of remained variables. In the case of methods that do not rely on filtering techniques, they do not consider the interactions between the variables, or generate approximate solutions to the simplified problem. Unlike them, by combining set covering and clustering techniques, we developed a new method that could deal with total number of variables and consider the combinatorial effects of variables for selecting good features. To demonstrate the efficacy and effectiveness of the method, we downloaded gene expression datasets from TCGA (The Cancer Genome Atlas) and compared our method with other algorithms including WEKA embeded feature selection algorithms. In the experimental results, we showed that our method could select high quality features for constructing more accurate classifiers than other feature selection algorithms.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.4
• /
• pp.500-509
• /
• 1999

In this paper, we consider an optimal routing problem when point-to-point and point-to-multipoint connection traffics are offered in an ATM network. We propose a mathematical model for cost-minimizing configuration of a logical network for a given ATM-based BISDN. Our model is essentially identical to the previous one proposed by Kim(Kim, 1996) which finds a virtual-path configuration where the relevant gains obtainable from the ATM technology such as the statistical multiplexing gain and the switching/control cost-saving gain are optimally traded-off. Unlike the Kim's model, however, ours explicitly considers the VP's QoS(Quality of Service) for more efficient utilization of bandwidth. The problem is a large-scale, nonlinear, and mixed-integer problem. The proposed algorithm is based on the local linearization of equivalent-capacity functions and the relaxation of link capacity constraints. As a result, the problem can be decomposed into moderate-sized shortest path problems, Steiner arborescence problems, and LPs. This fact renders our algorithm a lot faster than the previous nonlinear programming algorithm while the solution quality is maintained, hence application to large-scale network problems.

• Journal of the Korean GEO-environmental Society
• /
• v.13 no.2
• /
• pp.49-57
• /
• 2012

Large-scale collapse happened under excavation construction in the past. But, recently the trend that it is completed safely to minimize damages is growing because of increasing levels of design review and detecting signs of problems before the outbreak of large-scale collapse with proactive planning of measurement. In this paper, through studying case collapses over the past, it put the cause of the collapse in order. And then, after reviewing general information on management and utilization of measurement methods which importantly emerging recently, the type and cause of the problem during the excavation was reviewed. And the causes of problem were analyzed by targeting the site which unusual symptoms happened on measuring results under construction. In this study, the awareness that measurement management and subsurface investigation is highly important will increase for preventing large-scale collapse in advance.