• Title/Summary/Keyword: Simplex 법

Search Result 102, Processing Time 0.025 seconds

3D Object Restoration and Data Compression Based on Adaptive Simplex-Mesh Technique (적응 Simplex-Mesh 기술에 기반한 3차원 물체 복원과 자료 압축)

  • 조용군
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.9 no.4
    • /
    • pp.436-443
    • /
    • 1999
  • Most of the 3D object reconstruction techniques divide the object into multiplane and approximate the surfaces of the object. The Marching Cubes Algorithm which initializes the mesh structure using a given isovalue. and Delaunay Tetrahedrisation are widely used. Deformable models are well-suited for general object reconstruction because they make little assumptions about the shape to recover and they can reconstruct objects *om various types of datasets. Now, many researchers are studying the reconstruction systems based on a deformable model. In this paper, we propose a novel method for reconstruction of 3D objects. This method, for a 3D object composed of curved planes, compresses the 3D object based on the adaptive simplexmesh technique. It changes the pre-defined mesh structure, so that it may approach to the original object. Also, we redefine the geometric characteristics such as curvatures. As results of simulations, we show reconstruction of the original object with high compression and concentration of vertices towards parts of high curvature in order to optimize the shape description.

  • PDF

A Case Study on the Application of Decomposition Principle to a Linear Programming Problem (분할기법(分割技法)을 이용한 선형계획법(線型計劃法)의 응용(應用)에 관한 사례 연구(事例 硏究))

  • Yun, In-Jung;Kim, Seong-In
    • IE interfaces
    • /
    • v.1 no.1
    • /
    • pp.1-7
    • /
    • 1988
  • This paper discusses the applicability of the decomposition principle to an LP (Linear Programming) problem. Through a case study on product mix problems in a chemical process of Korean Steel Chemical Co., Ltd., the decomposition algorithm, LP Simplex method and a modified method are compared and evaluated in computation time and number of iterations.

  • PDF

패턴 인식기법을 이용한 유출모형의 매개변수 최적화

  • 정창삼;허준행
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2002.05b
    • /
    • pp.1316-1321
    • /
    • 2002
  • 일반적으로 강우-유출모형은 lumped model과 distributed model로 크게 구분될 수 있으며, 우리나라에서는 이중 비교적 부족한 자료를 이용하여도 개략적 모의가 가능한 전자를 널리 사용하고 있다. 본 연구에서는 이러한 모형들의 매개변수를 보정하는 방법에 관해 연구하였다. 일반적으로 모형의 보정 방법에는 크게 시행오차에 의한 수동보정(manual calibration) 방법과 최적화 기법에 의한 자동보정(automatic calibration) 방법으로 나눌 수 있다. 수동보정 방법은 모형 수행결과를 수문곡선의 시각적 비교에 의해 관측치와 비교하여 모형 운영자의 주관적인 판단하에 조정하는 기법이며, 자동보정 방법은 최적화 기법을 이용8하여 특정한 산정기준(estimation criteria)을 최대 또는 최소화시켜 모형의 매개변수를 결정하는 방법이다. 이러한 최적화기법은 일반적으로 직접탐색법과 경사법으로 구분할 수 있다. 경사법은 수렴속도가 빠르지만 편미분에 의해 방향을 찾아가는 방법으로 편도함수가 필요하므로 수문모형에는 적용하기가 힘들므로 적합하지 않다. 그러나, 보다 많은 컴퓨터 수행시간을 필요로 하는 직접탐색법의 경우 수렴속도는 느리지만, 편도함수를 필요치 않으므로 수문모형의 최적화 기법으로 적합하다고 할 수 있다. 직접탐색법에는 simplex-search 법, 패턴인식(pattern-search)법, rotating-direction 법, brent 법 등이 있으며, 본 연구에서는 직접탐색법의 일종인 패턴인식(pattern -search)법을 이용하여 매개변수 최적화 과정을 모의하였다. 이러한 매개변수 보정모형을 구성한 후 이를 가장 보편적으로 사용되고 있는 유출모형인 각종 단위도법들을 결합하는 모형을 구성하였다. 또한 구성된 모형을 시범유역에 적용하여 나온 결과를 HEC-1에서 적용되고 있는 단일변량 증감법과 같은 최적화 기법을 이용한 결과와 비교·분석을 실시하였다. 본 모형을 활용하여 강우-유출 모형의 매개변수를 지속적으로 산정하고 일반화할 경우 임의의 유역의 수문기상학적 특성에 부합한 매개변수를 정량화 시킬 수 있었다.

  • PDF

An Applied Technique of Linear Programming Using Multi-Softwares (다종 S/W 적용에 의한 선형계획법 연구)

  • 한계섭
    • The Journal of Information Systems
    • /
    • v.5
    • /
    • pp.21-41
    • /
    • 1996
  • Linear programming has become an important tool in decision-making of modern business management. This remarkable growth can be traced to the pioneering efforts of many individuals and research organizations. The popular using of personal computers make it very easy to process those complicated linear programming models. Furthermore advanced linear programming software packages assist us to solve L.P. models without any difficult process. Even though the advanced L.P. professional packages, the needs of more detailed deterministic elements for business decisions have forced us to apply dynamic approaches for more resonable solutions. For the purpose of these problems applying to the "Mathematica" packages which is composed of mathematic tools, the simplex processes show us the flexible and dynamic decision elements included to any other professional linear programming tools. Especially we need proper dynamic variables to analyze the shadow prices step by step. And applying SAS(Statistical Analysis System) packages to the L.P. problems, it is also one of the best way to get good solution. On the way trying to the other L.P. packages which are prepared for Spreadsheets i.e., MS-Excel, Lotus-123, Quatro etc. can be applied to linear programming models. But they are not so much useful for the problems. Calculating simplex tableau is an important method to interpret L.P. format for the optimal solution. In this paper we find out that the more detailed and efficient techniques to interpret useful software of mathematica and SAS for business decision making of linear programming. So it needs to apply more dynamic technique of using of Mathematica and SAS multiple software to get more efficient deterministic factors for the sophiscated L.P. solutions.

  • PDF

Using Design of Mixture Experiments to Select the Ratio of a Three-Component Electrode for Optimal Generation of Hydroxyl Radicals (혼합물 실험계획법을 이용한 OH라디칼 최적 생성을 위한 삼성분 전극의 비율 선정)

  • Park, Young-Seek
    • Journal of Environmental Science International
    • /
    • v.29 no.8
    • /
    • pp.793-800
    • /
    • 2020
  • The conventional development of multi-component electrodes is based on the researcher's experience and is based on trial and error. Therefore, there is a need for a scientific method to reduce the time and economic losses thereof and systematize the mixing of electrode components. In this study, we use design of mixture experiments (DOME)- in particular a simplex lattice design with Design Expert program- to attempt to find an optimum mixing ratio for a three-component electrode for the high RNO degradation; RNO is an indictor of OH radical formation. The experiment included 12 experimental points with 2 center replicates for 3 different independent variables (with the molar ratio of Ru, Ti, Ir). As the Prob > F value of the 'Quadratic' model is 0.0026, the secondary model was found to be suitable. Applying the molar ratio of the electrode components to the corrected response model results is an RNO removal efficiency (%) = 59.89 × [Ru] + 9.78 × [Ti] + 67.03 × [Ir] + 66.38 × [Ru] × [Ir] + 132.86 × [Ti] × [Ir]. The R2 value of the equation is 0.9374 after the error term is excluded. The optimized formulation of the ternary electrode for an high RNO degradation was acquired when the molar ratio of Ru 0.100, Ti 0.200, Ir 0.700 (desirability d value, 1).

2D Microwave Image Reconstruction of Breast Cancer Detection for Breast Types (유방 조직형태에 따른 유방암 진단 2차원 마이크로파 영상복원)

  • Kim, Ki-Chai;Kim, Tae-Hong;Lee, Jong-Moon;Jeon, Soon-Ik;Pack, Jeong-Ki
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.27 no.7
    • /
    • pp.646-652
    • /
    • 2016
  • This paper presents a tumor detection for breast cancer that utilizes two-dimensional(2D) image reconstruction with microwave tomographic imaging. The breast cancer detection system under development consists of 16 transmit/receive antennas, and the microwave tomography system operates at 1,700 MHz. The four types of breast(ED-, HD-, SC-, and FT-type) are used for image reconstruction. To solve a 2D inverse scattering problem, the method of moments(MoM) is employed for forward problem solving, and the simplex method employed as an optimization algorithm. The results of the reconstructed image show that the ED- and HD-types of breasts are well reconstructed, but SC- and FT-type breasts are not well because of the error including.

Optimization of Ramen Flour Formulation by Mixture Experimental Design (혼합물실험설계법에 의한 라면 밀가루 혼합비의 최적화)

  • Park, Hye Ryong;Lee, Seung Ju
    • Food Engineering Progress
    • /
    • v.15 no.4
    • /
    • pp.297-304
    • /
    • 2011
  • Ramen flour formulation was optimized by applying a mixture experimental design. In the optimization, the overall palatability (OP) of cooked ramen and the rheological properties of selected dough were maximized or minimized. Blended ratios of the ingredients such as Dark Northern Spring (DNS), Hard Red Winter (HRW), and Soft White (SW) were designed on a simplex-lattice. Dough rheological properties were measured by Rapid Visco Analyser (RVA), Farinograph, and Extensograph, and the overall palatability by sensory evaluation. Several principal dough rheological properties such as RVA peak viscosity (PV), Farinograph development time (DT), and Extensograph resistance/extensibility after 45 min (R/E 45 min) were selected to influence the overall palatability by canonical correlation analysis (CCA). Goals of the optimization were given as OP maximized, PV maximized, DT minimized, and R/E at 45 min maximized. The optimization results were found to be DNS 33.3%, HRW 33.3%, and SW 33.3% with OP, 5.825; PV, 587.9 cP; DT, 3.1 min; R/E at 45 min, 2.339 BU/mm.

Determination of the Optimal Height using the Simplex Algorithm in Network-RTK Surveying (Network-RTK측량에서 심플렉스해법을 이용한 최적표고 결정)

  • Lee, Suk Bae;Auh, Su Chang
    • Journal of Korean Society for Geospatial Information Science
    • /
    • v.24 no.1
    • /
    • pp.35-41
    • /
    • 2016
  • GNSS/Geoid positioning technology allows orthometric height determination using both the geoidal height calculated from geoid model and the ellipsoidal height achieved by GNSS survey. In this study, Network-RTK surveying was performed through the Benchmarks in the study area to analyze the possibility of height positioning of the Network-RTK. And the orthometric heights were calculated by applying the Korean national geoid model KNGeoid13 according to the condition of with site calibration and without site calibration and the results were compared. Simplex algorithm was adopted for liner programming in this study and the heights of all Benchmarks were calculated in both case of applying site calibration and does not applying site calibration. The results were compared to Benchmark official height of the National Geographic Information Institute. The results showed that the average value of the height difference was 0.060m, and the standard deviation was 0.072m in Network-RTK without site calibration and the average value of the height difference was 0.040m, and the standard deviation was 0.047m in Network-RTK with the application of the site calibration. With linearization method to obtain the optimal solution for observations it showed that the height determination within 0.033m was available in GNSS Network-RTK positioning.

Multibody Elastic Contact Analysis by Modified Linear Programming (수정된 선형계획법을 이용한 다물체 탄성 접촉 문제 해석)

  • 이대희;전범준;최동훈;임장근;윤갑영
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.13 no.1
    • /
    • pp.1-8
    • /
    • 1989
  • A general and efficient algorithm is proposed for the analyses of multibody elastic contact problems. It is presumed that there exists negligible friction between the bodies. It utilizes a simplex type algorithm with a modified entry rule and incoporates finite element method to obtain flexibility matrices for arbitrarily shaped bodies. The multibody contact problem of a vehicle support on an elastic foundation is considered first to show the effictiveness of the suggested algorithm. Its solution is compared favorably with the existing solution. A contact problem among inner race, rollers and outer race is analyzed and the distribution of load, rigid body movements and contact pressure distributions are obtained. The trend of contact characteristics is compared with that of the idealized Hertzian solutions for two separate two-body contact problems. The numerical results obtained by directly treating a multibody contact are believed to be more exact than the Hertzian solution for the idealized two separate two-body contact problems.

Aggregate Planning Using Least Cost First Assignment Algorithm of Transportation Problem (운송 문제의 최소비용 우선 배정 알고리즘을 적용한 총괄계획)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.5
    • /
    • pp.181-188
    • /
    • 2021
  • In preparing a aggregate production plan(APP), the transportation method generally uses a linear planning(LP) software package for TSM(transportation simplex method), which seeks initial solutions with either NCM, LCM, or VAM specialized in transportation issues and optimizes them with either SSM or MODI. On the other hand, this paper proposes a transportation method that easily, quickly, and accurately prepares a APP without software package assistance. This algorithm proposed simply assigned to least cost-first, and minimized the inventory periods. Applying the proposed algorithm to 6-benchmarking data, this algorithm can be obtained better optimal solution than VAM or LP for 4 data, and we obtain the same results for the remained 2 data.