• Title/Summary/Keyword: optimization problem

Search Result 4,342, Processing Time 0.029 seconds

On B-spline Approximation for Representing Scattered Multivariate Data (비정렬 다변수 데이터의 B-스플라인 근사화 기법)

  • Park, Sang-Kun
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.35 no.8
    • /
    • pp.921-931
    • /
    • 2011
  • This paper presents a data-fitting technique in which a B-spline hypervolume is used to approximate a given data set of scattered data samples. We describe the implementation of the data structure of a B-spline hypervolume, and we measure its memory size to show that the representation is compact. The proposed technique includes two algorithms. One is for the determination of the knot vectors of a B-spline hypervolume. The other is for the control points, which are determined by solving a linear least-squares minimization problem where the solution is independent of the data-set complexity. The proposed approach is demonstrated with various data-set configurations to reveal its performance in terms of approximation accuracy, memory use, and running time. In addition, we compare our approach with existing methods and present unconstrained optimization examples to show the potential for various applications.

Sensitivity Validation Technique for Sequential Kriging Metamodel (순차적 크리깅 메타모델의 민감도 검증법)

  • Huh, Seung-Kyun;Lee, Jin-Min;Lee, Tae-Hee
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.36 no.8
    • /
    • pp.873-879
    • /
    • 2012
  • Metamodels have been developed with a variety of design optimization techniques in the field of structural engineering over the last decade because they are efficient, show excellent prediction performance, and provide easy interconnections into design frameworks. To construct a metamodel, a sequential procedure involving steps such as the design of experiments, metamodeling techniques, and validation techniques is performed. Because validation techniques can measure the accuracy of the metamodel, the number of presampled points for an accurate kriging metamodel is decided by the validation technique in the sequential kriging metamodel. Because the interpolation model such as the kriging metamodel based on computer experiments passes through responses at presampled points, additional analyses or reconstructions of the metamodels are required to measure the accuracy of the metamodel if existing validation techniques are applied. In this study, we suggest a sensitivity validation that does not require additional analyses or reconstructions of the metamodels. Fourteen two-dimensional mathematical problems and an engineering problem are illustrated to show the feasibility of the suggested method.

Optimization of Design Parameters for Steel Grating Using Taguchi Method Considering Rigidity and Drainage Efficiency (다구찌기법 기반의 강성과 배수능력 관계를 고려한 스틸그레이팅의 설계변수 최적화)

  • Kim, Woo-Tae;Lee, Se-Jin
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.38 no.8
    • /
    • pp.905-910
    • /
    • 2014
  • The steel grating discussed in this study is a drain cover that enhances the rigidity of the steel frame using an inclined inflow tract for wastewater, facilitates smooth drainage, and prevents the escape of bad smell from the drain. Recently, the urban problem of bad smell in sewerage lines has been hindering the improvement of living standards. Moreover, the frequent failure of existing products deters bad smell prevention measures and results in administrative power and budget wastage. The pressure to reduce budgets propels the increased demand for functional steel grating. Thus, this study focused on optimizing the design parameters of a steel grating by simultaneously considering its rigidity and drainage efficiency.

Point Set Denoising Using a Variational Bayesian Method (변분 베이지안 방법을 이용한 점집합의 오차제거)

  • Yoon, Min-Cheol;Ivrissimtzis, Ioannis;Lee, Seung-Yong
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.5
    • /
    • pp.527-531
    • /
    • 2008
  • For statistical modeling, the model parameters are usually estimated by maximizing a probability measure, such as the likelihood or the posterior. In contrast, a variational Bayesian method treats the parameters of a model as probability distributions and computes optimal distributions for them rather than values. It has been shown that this approach effectively avoids the overfitting problem, which is common with other parameter optimization methods. This paper applies a variational Bayesian technique to surface fitting for height field data. Then, we propose point cloud denoising based on the basic surface fitting technique. Validation experiments and further tests with scan data verify the robustness of the proposed method.

Design of a PID-type Autopilot Concerned with Propulsive Energy of Ship (선박의 추진에너지를 고려한 PID형 자동조타기 설계)

  • Ahn, Jong-Kap;Lee, Chang-Ho;Lee, Yun-Hyung;Choi, Jae-Jun;So, Myung-Ok
    • Journal of Navigation and Port Research
    • /
    • v.33 no.6
    • /
    • pp.437-442
    • /
    • 2009
  • The PID controller type autopilot is applied to support shipmaneuvering for course-keeping and heading control. A control constants of autopilot system should be evaluated by promoting energy loss (fuel consumption) from the view point of economic efficiency of the ship. This paper is obtained control constants of autopilot system from the RCGA pursued the minimum energy loss. In addition, the controller which is designed involves a constrained optimization problem. The performance of the proposed method is demonstrated through a set of simulation.

Proactive Network Optimizer for Critical Applications (크리티컬한 응용을 위한 능동형 네트워크 최적화기)

  • Park, Bongsang;Park, Pangun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.9
    • /
    • pp.1250-1256
    • /
    • 2018
  • Recently, wireless networks are becoming an important infrastructure for the critical large-scale applications such as cyber-physical systems and next generation industrial automations. However, the fundamental performance uncertainty of wireless networks may incur the serious instability problem of the overall systems. This paper proposes the proactive network optimizer to guarantee the application demands without any real-time link monitoring information of the networks. In particularly, the proposed proactive optimizer is the cross-layer approach to jointly optimize the routing path and traffic distribution in order to guarantee the performance demand within a maximum k number of link faults. Through the simulations, the proposed proactive network optimizer provides better robustness than the traditional existing reactive networks. Furthermore, the proactive network does not expose to the major weakness of the reactive networks such as the performance degradation due to the erroneous link monitoring information and the network reconfiguration cost.

A Study on Developing an Optimization Model for Particleboard Manufacturing Processes (파티클보드 제조공정(製造工程)의 최적화(最適化) 모델개발에 관한 연구(硏究))

  • Chung, Joo Sang;Park, Hee Jun;Lee, Phil Woo
    • Journal of Korean Society of Forest Science
    • /
    • v.82 no.4
    • /
    • pp.396-405
    • /
    • 1993
  • In this paper, a nonlinear programming model to determine the optimal operating policy to minimize production costs for particleboard plants is presented. The model provides optimal values for three decision variables : specific gravity of particleboard, mat moisture content and mat resin content. These decision variables are key factors influencing the cost and quality of particleboard manufacturing processes. In formulating the nonlinear programming model, the minimum quality standards for internal bond strength and modulus of rupture of particleboard are used as industry-wide quality constraints. These quality standards are expressed as nonlinear functions of the decision variables. In order to demonstrate the applicability of the proposed model, the model is applied to solve for optimal solutions of four theoretical problems. The problem scenarios are built to investigate effects of changes in hot-pressing speed and purchase price of chip and resin.

  • PDF

A Spatial Hash Strip Join Algorithm for Effective Handling of Skewed Data (편중 데이타의 효율적인 처리를 위한 공간 해쉬 스트립 조인 알고리즘)

  • Shim Young-Bok;Lee Jong-Yun
    • Journal of KIISE:Databases
    • /
    • v.32 no.5
    • /
    • pp.536-546
    • /
    • 2005
  • In this paper, we focus on the filtering step of candidate objects for spatial join operations on the input tables that none of the inputs is indexed. Over the last decade, several spatial Join algorithms for the input tables with index have been extensively studied. Those algorithms show excellent performance over most spatial data, while little research on solving the performance degradation in the presence of skewed data has been attempted. Therefore, we propose a spatial hash strip join(SHSJ) algorithm that can refine the problem of skewed data in the conventional spatial hash Join(SHJ) algorithm. The basic idea is similar to the conventional SHJ algorithm, but the differences are that bucket capacities are not limited while allocating data into buckets and SSSJ algorithm is applied to bucket join operations. Finally, as a result of experiment using Tiger/line data set, the performance of the spatial hash strip join operation was improved over existing SHJ algorithm and SSSJ algorithm.

A Genetic Algorithm with a New Encoding Method for Bicriteria Network Designs (2기준 네트워크 설계를 위한 새로운 인코딩 방법을 기반으로 하는 유전자 알고리즘)

  • Kim Jong-Ryul;Lee Jae-Uk;Gen Mituso
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.10
    • /
    • pp.963-973
    • /
    • 2005
  • Increasing attention is being recently devoted to various problems inherent in the topological design of networks systems. The topological structure of these networks can be based on service centers, terminals (users), and connection cable. Lately, these network systems are well designed with tiber optic cable, because the requirements from users become increased. But considering the high cost of the fiber optic cable, it is more desirable that the network architecture is composed of a spanning tree. In this paper, we present a GA (Genetic Algorithm) for solving bicriteria network topology design problems of wide-band communication networks connected with fiber optic cable, considering the connection cost, average message delay, and the network reliability We also employ the $Pr\ddot{u}fer$ number (PN) and cluster string in order to represent chromosomes. Finally, we get some experiments in order to certify that the proposed GA is the more effective and efficient method in terms of the computation time as well as the Pareto optimality.

Speed Enhancement Technique for Ray Casting using 2D Resampling (2차원 리샘플링에 기반한 광선추적법의 속도 향상 기법)

  • Lee, Rae-Kyoung;Ihm, In-Sung
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.8
    • /
    • pp.691-700
    • /
    • 2000
  • The standard volume ray-tracing, optimized with octree, needs to repeatedly traverse hierarchical structures for each ray that often leads to redundant computations. It also employs the expensive 3D interpolation for producing high quality images. In this paper, we present a new ray-casting method that efficiently computes shaded colors and opacities at resampling points by traversing octree only once. This method traverses volume data in object-order, finds resampling points on slices incrementally, and performs resampling based on 2D interpolation. While the early ray-termination, which is one of the most effective optimization techniques, is not easily combined with object-order methods, we solved this problem using a dynamic data structure in image space. Considering that our new method is easy to implement, and need little additional memory, it will be used as very effective volume method that fills the performance gap between ray-casting and shear-warping.

  • PDF