• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권10호
• /
• pp.5013-5034
• /
• 2019

In the Peer-to-Peer (P2P) streaming systems, peers randomly form a network overlay to share video resources with a data scheduling scheme. A data scheduling scheme can have a great impact on system performance, which should achieve two optimal objectives at the same time ideally. The two optimization objectives are to improve the perceived video quality and maximize the network throughput, respectively. Maximizing network throughput means improving the utilization of peer's upload bandwidth. However, maximizing network throughput will result in a reduction in the perceived video quality, and vice versa. Therefore, to achieve the above two objects simultaneously, we proposed a new data scheduling scheme based on multi-objective particle swarm optimization data scheduling scheme, called MOPSO-DS scheme. To design the MOPSO-DS scheme, we first formulated the data scheduling optimization problem as a multi-objective optimization problem. Then, a multi-objective particle swarm optimization algorithm is proposed by encoding the neighbors of peers as the position vector of the particles. Through extensive simulations, we demonstrated the MOPSO-DS scheme could improve the system performance effectively.

• 대한수학회지
• /
• 제49권1호
• /
• pp.99-112
• /
• 2012

This paper attempts to present a numerical method for solving optimal control problems. The method is based upon constructing the n-th degree Jacobi polynomials to approximate the control vector and use differentiation matrix to approximate derivative term in the state system. The system dynamics are then converted into system of algebraic equations and hence the optimal control problem is reduced to constrained optimization problem. Numerical examples illustrate the robustness, accuracy and efficiency of the proposed method.

• Journal of the Korean Data and Information Science Society
• /
• 제20권4호
• /
• pp.749-755
• /
• 2009

Support vector classification (SVC) provides more complete description of the lin-ear and nonlinear relationships between input vectors and classifiers. In this paper. we propose the sparse kernel classifier to solve the optimization problem of classification with a modified hinge loss function and absolute loss function, which provides the efficient computation and the sparsity. We also introduce the generalized cross validation function to select the hyper-parameters which affects the classification performance of the proposed method. Experimental results are then presented which illustrate the performance of the proposed procedure for classification.

• Communications for Statistical Applications and Methods
• /
• 제13권3호
• /
• pp.765-776
• /
• 2006

In this paper we propose an estimation method on the regression model with randomly censored observations of the training data set. The weighted least squares support vector machine regression is applied for the regression function estimation by incorporating the weights assessed upon each observation in the optimization problem. Numerical examples are given to show the performance of the proposed estimation method.

• Journal of the Korean Data and Information Science Society
• /
• 제17권3호
• /
• pp.905-912
• /
• 2006

Support vector classification(SVC) provides more complete description of the linear and nonlinear relationships between input vectors and classifiers. In this paper we propose to solve the optimization problem of SVC with a modified hinge loss function, which enables to use an iterative reweighted least squares(IRWLS) procedure. We also introduce the approximate cross validation function to select the hyperparameters which affect the performance of SVC. Experimental results are then presented which illustrate the performance of the proposed procedure for classification.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2008년도 정기 학술대회
• /
• pp.216-221
• /
• 2008

Shape design optimization for linear elasticity problem is performed using isogeometric analysis method. In many design optimization problems for real engineering models, initial raw data usually comes from CAD modeler. Then designer should convert this CAD data into finite element mesh data because conventional design optimization tools are generally based on finite element analysis. During this conversion there is some numerical error due to a geometry approximation, which causes accuracy problems in not only response analysis but also design sensitivity analysis. As a remedy of this phenomenon, the isogeometric analysis method is one of the promising approaches of shape design optimization. The main idea of isogeometric analysis is that the basis functions used in analysis is exactly same as ones which represent the geometry, and this geometrically exact model can be used shape sensitivity analysis and design optimization as well. In shape design sensitivity point of view, precise shape sensitivity is very essential for gradient-based optimization. In conventional finite element based optimization, higher order information such as normal vector and curvature term is inaccurate or even missing due to the use of linear interpolation functions. On the other hands, B-spline basis functions have sufficient continuity and their derivatives are smooth enough. Therefore normal vector and curvature terms can be exactly evaluated, which eventually yields precise optimal shapes. In this article, isogeometric analysis method is utilized for the shape design optimization. By virtue of B-spline basis function, an exact geometry can be handled without finite element meshes. Moreover, initial CAD data are used throughout the optimization process, including response analysis, shape sensitivity analysis, design parameterization and shape optimization, without subsequent communication with CAD description.

• 한국지능시스템학회논문지
• /
• 제22권6호
• /
• pp.774-779
• /
• 2012

본 논문은 brain-computer interface (BCI)를 통해 움직임 상상 시 측정된 뇌-활동전위신호(EEG)에 내포된 행동의도의 패턴을 보다 정확하게 분류하기 위한 최적 EEG 채널 선택 기법을 제안한다. 기존의 EEG 측정실험에서는 실험 설계자에 의해 대뇌 기능적 피질 분류를 이용하여 인위적으로 선별된 채널을 활용하거나 측정기기가 수용 가능한 전체 채널을 사용해왔으며, 일정 수준의 패턴분류 정확도를 얻을 수 있었지만 다수의 채널로 인해 Common Spatial Pattern (CSP) 등의 패턴특징 추출 시 overfit 및 계산 복잡도 증가의 문제가 발생되었다. 이를 극복하기 위하여 방안으로 본 논문에서는 binary particle swarm optimization (BPSO)을 기반으로 다수의 채널 중 최적 채널을 자동으로 선택하고, 각각의 채널에 대한 impact factor를 부여함으로써 중요 채널 부근의 채널들에 가중치를 부여하는 선택방법을 제안하였으며, Support Vector Machine (SVM)을 이용하여 다수의 채널을 사용 하였을 때의 정확도와 channel impact factor를 고려한 BPSO를 적용시켰을 때의 정확도를 비교, 분석하였다.

• International Journal of Control, Automation, and Systems
• /
• 제4권5호
• /
• pp.653-659
• /
• 2006

The design of $H_2$-optimal control with regional pole assignment via state feedback in linear time-invariant systems is investigated. The aim is to find a state feedback controller such that the closed-loop system has the desired eigenvalues lying in some desired stable regions and attenuates the disturbance between the output vector and the disturbance vector. Based on a proposed result of parametric eigenstructure assignment via state feedback in linear systems, the considered $H_2$-optimal control problem is changed into a minimization problem with certain constraints, and a simple and effective algorithm is proposed for this considered problem. A numerical example and its simulation results show the simplicity and effectiveness of this proposed algorithm.

• Earthquakes and Structures
• /
• 제17권1호
• /
• pp.63-73
• /
• 2019

This paper studies damage detection as an optimization problem. A new objective function based on changes in natural frequencies, and Natural Frequency Vector Assurance Criterion (NFVAC) was developed. Due to their easy and fast acquisition, natural frequencies were utilized to detect structural damages. Moreover, they are sensitive to stiffness reduction. The method presented here consists of two stages. Firstly, Finite Element Model (FEM) is updated. Secondly, damage severities and locations are determined. To minimize the proposed objective function, a new bio-inspired optimization algorithm called salp swarm was employed. Efficiency of the method presented here is validated by three experimental examples. The first example relates to three-story shear frame with two single damage cases in the first story. The second relates to a five-story shear frame with single and multiple damage cases in the first and third stories. The last one relates to a large-scale eight-story shear frame with minor damage case in the first and third stories. Moreover, the performance of Salp Swarm Algorithm (SSA) was compared with Particle Swarm Optimization (PSO). The results show that better accuracy is obtained using SSA than using PSO. The obtained results clearly indicate that the proposed method can be used to determine accurately and efficiently both damage location and severity in multi-story shear frames.

• Management Science and Financial Engineering
• /
• 제18권2호
• /
• pp.19-22
• /
• 2012

In the bin-packing problem, we deal with how to pack the items by using a minimum number of bins. In the inverse bin-packing number problem, IBPN for short, we are given a list of items and a fixed number of bins. The objective is to perturb at the minimum cost the item-size vector so that all items can be packed into the prescribed number of bins. We show that IBPN is NP-hard and provide an approximation algorithm. We also consider a variant of IBPN where the prescribed solution value should be returned by a pre-selected specific approximation algorithm.