• Title/Summary/Keyword: Cutting Plane

Search Result 178, Processing Time 0.043 seconds

2-D Field Analysis of Flat-type Motor (평판형 전동기의 2차원 자계 해석에 관한 연구)

  • Kim, Pill-Soo
    • Journal of IKEEE
    • /
    • v.2 no.1 s.2
    • /
    • pp.160-165
    • /
    • 1998
  • This paper describes a method for field analysis inside the flat-type brushless DC motor using 2-D field simulator. Rigorous field analysis entail 3-D analysis. However, this analysis is not often appropriate for system designs because of the time and cost involved. For field analysis in this study, the 3-D problem is reduced to a 2-D boundary value problem by introducing a cylindrical cutting plane at the mean radius of the magnets. Independent of sizes and shapes of systems, the exact 2-D field results can be obtained with reasonable predictability.

  • PDF

An interactive multicriteria simulation optimization method

  • Shin, Wan-Seon;Boyle, Carolyn-R.
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1992.04b
    • /
    • pp.117-126
    • /
    • 1992
  • This study proposes a new interactive multicriteria method for determining the best levels of the decision variables needed to optimize a stochastic computer simulation with multiple response variables. The method, called the Pairwise Comparison Stochastic Cutting Plane (PCSCP) method, combines good features from interactive multiple objective mathematical programming methods and response surface methodology. The major characteristics of the PCSCP algorithm are: (1) it interacts progressively with the decision maker (DM) to obtain his preferences, (2) it uses good experimental design to adequately explore the decision space while reducing the burden on the DM, and (3) it uses the preference information provided by the DM and the sampling error in the responses to reduce the decision space. This paper presents the basic concepts of the PCSCP method along with its performance for solving randomly selected test problems.

  • PDF

Prediction of the Machined Surface Roughness using Geometrical Characteristic Lines (기하학적 특징선을 이용한 밀링 가공면의 표면 조도 예측)

  • 정태성;양민양
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2003.06a
    • /
    • pp.66-69
    • /
    • 2003
  • This paper presents the procedures for the evaluation of the maximum surface roughness and the shapes of the cut remainder employing the ridge method. The shapes and the heights of the cut remainder are estimated by overlapping adjacent ridges in consideration of the various machining parameters: the feedrate. the path interval. The maximum surface roughness in plane cutting modes are derived as a function of the maximum effective cutter radius, R$\_$eff,max/. and the path interval ratio, $\tau$$\_$fp/, The predicted results are compared with the values estimated by the conventional roughness model.

  • PDF

An Optimization Algorithm for Minimum Connected Dominating Set Problem in Wireless Sensor Network

  • Ahn, Nam-Su;Park, Sung-Soo
    • Industrial Engineering and Management Systems
    • /
    • v.10 no.3
    • /
    • pp.221-231
    • /
    • 2011
  • One of the critical issues in wireless sensor network is the design of a proper routing protocol. One possible approach is utilizing a virtual infrastructure, which is a subset of sensors to connect all the sensors in the network. Among the many virtual infrastructures, the connected dominating set is widely used. Since a small connected dominating set can help to decrease the protocol overhead and energy consumption, it is preferable to find a small sized connected dominating set. Although many algorithms have been suggested to construct a minimum connected dominating set, there have been few exact approaches. In this paper, we suggest an improved optimal algorithm for the minimum connected dominating set problem, and extensive computational results showed that our algorithm outperformed the previous exact algorithms. Also, we suggest a new heuristic algorithm to find the connected dominating set and computational results show that our algorithm is capable of finding good quality solutions quite fast.

Solving Integer Programming Problems Using Genetic Algorithms

  • Anh Huy Pham Nguyen;Bich San Chu Tat;Triantaphyllou E
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.400-404
    • /
    • 2004
  • There are many methods to find solutions for Integer Programming problems (IPs) such as the Branch-Bound philosophy or the Cutting Plane algorithm. However, most of them have a problem that is the explosion of sets in the computing process. In addition, GA is known as a heuristic search algorithm for solutions of optimization problems. It is started from a random initial guess solution and attempting to find one that is the best under some criteria and conditions. The paper will study an artificial intelligent method to solve IPs by using Genetic Algorithms (GAs). The original solution of this was presented in the papers of Fabricio Olivetti de Francaand and Kimmo Nieminen [2003]. However, both have several limitations which causes could be operations in GAs. The paper proposes a method to upgrade these operations and computational results are also shown to support these upgrades.

  • PDF

Evaluation of Two Lagrangian Dual Optimization Algorithms for Large-Scale Unit Commitment Problems

  • Fan, Wen;Liao, Yuan;Lee, Jong-Beom;Kim, Yong-Kab
    • Journal of Electrical Engineering and Technology
    • /
    • v.7 no.1
    • /
    • pp.17-22
    • /
    • 2012
  • Lagrangian relaxation is the most widely adopted method for solving unit commitment (UC) problems. It consists of two steps: dual optimization and primal feasible solution construction. The dual optimization step is crucial in determining the overall performance of the solution. This paper intends to evaluate two dual optimization methods - one based on subgradient (SG) and the other based on the cutting plane. Large-scale UC problems with hundreds of thousands of variables and constraints have been generated for evaluation purposes. It is found that the evaluated SG method yields very promising results.

Asynchronous Decentralized Optimization Method for Coordinating Electricity Markets (비동기분산처리 방식을 이용한 연계전력시장청산)

  • Moon, Guk-Hyun;Huang, Anni;Joo, Sung-Kwan;Wi, Young-Min;Song, Kyung-Bin
    • Proceedings of the KIEE Conference
    • /
    • 2007.07a
    • /
    • pp.832-833
    • /
    • 2007
  • This paper presents an asynchronous decentralized optimization method to coordinate energy trading between electricity markets. The proposed method decomposes the market optimization problem of interconnected electricity markets into individual market optimization problems. The decomposed problem is solved by using the Interior Point/Cutting Plane (IP/CP) method with asynchronous communication model. A numerical example is presented to validate the effectiveness of the proposed method.

  • PDF

The Beauty of the Lines on Men′s Po in the Chosun Dynasty

  • Do, Ju-Yeun
    • The International Journal of Costume Culture
    • /
    • v.4 no.2
    • /
    • pp.94-114
    • /
    • 2001
  • Men's Po of (he Chosun period became simple and stable in shape as the nation moved from its early to late period. Re lines of the external structure of the clothing shows the beauty of the garment. Re lines generally derive their beauty from curved lines, gradually replacing the straight lines of the earlier part of the Chosun period. The linear beauty of the external structure of men's Po is found in the outline and silhouette. Generally in the early Chosun period it could be seen that H-shaped silhouettes, narrowed strips and flexible drapes descending to the ankles were still in use from the period of the Koryo dynasty And in the 17th century, or the mid Chosun period, considerable numbers of H-shaped drapes with wide sleeves and side Moo were seen. At the beginning of the 18th century, voluminous A-shaped outlines appeared. From the late Chosun period through the mid and late Chosun period, or the 18th and 19th centuries, the from silhouette changed from voluminous A-shapes to narrower H-shapes. The beauty of the lines of the external structure of men's Po is due to its harmonising with the straight body lines of men. The straight Git of the early Chosun period harmonises beautifully with the straight Baerae and Doryun and the curved Git of the later Chosun period similarly harmonises with the curved Baerae and Doryun lines. The shape of men's Po has a balance betweon right and left, centering around the Sup lines. The sleeves have the balanced beauty of vertical lines. Git and Sup have beauty through the balance of oblique and straight lines while Baerae and Doryun have similar balances through curves. Jikrung, Chulik, Dapho's side Moo, coat strings, Doryun and sleeves drape, all of which are manufactured by means of plane cutting, Pow together beautifully. Re Git, Sup, and the silhouette and drape of men's Po, which are also manufactured through plane cutting, make the wearer look tall and at the same time express the beauty of mature manhood. The linear beauty shown in men's Po during the Chosun Period have beauty through harmonizing with straight and curved lines, beauty balance, beauty of flow, beutity of emphasis and beauty of optical illusion.

  • PDF

Quality Properties of Peeled Ginger by Controlled Atmosphere(CA) Storage (CA저장에 의한 박피생강의 품질특성)

  • Lee, Myung-Hee;Lee, Kyoung-Hoe;Kim, Kyung-Tack
    • Journal of Food Hygiene and Safety
    • /
    • v.26 no.4
    • /
    • pp.342-348
    • /
    • 2011
  • The quality properties of peeled ginger (PG) were investigated during CA storage at different $CO_2$ concentrations. $O_2$ concentration was kept constant at 5% while $CO_2$ of 6%, 14%, 22% and 30% were used. It was found that the weight loss rate tended to decrease with an increase of $CO_2$. In the case of fixed $10^{\circ}C$ storage, the L-value and a-value of the exterior color in treatment increased more than that of control with respect to time, while the b-value of the exterior color and the cutting plane color showed no significant difference. In the exterior color, the results of PG-$25^{\circ}C$ showed similar with PG-$10^{\circ}C$ except b-value of the exterior color which showed not a little change. The cutting plane color did not showed significantly difference in the PG samples between $25^{\circ}C$ and $10^{\circ}C$. Hardness of the PG during storage was found to decrease most severely at 6% of $CO_2$ concentration regardless of storage temperature. The growth of microorganisms during storage of the PG tended to be restrained as $CO_2$ concentration increased. However, microorganisms, when maintained at $25^{\circ}C$ storage, multiplied rapidly to $10^8$ CFU/g within 4 days regardless of concentration.

Rate-Distortion Based Segmentation of Tumor Region in an Breast Ultrasound Volume Image (유방 초음파 볼륨영상에서의 율왜곡 기반 종양영역 분할)

  • Kwak, Jong-In;Kim, Sang-Hyun;Kim, Nam-Chul
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.42 no.5 s.305
    • /
    • pp.51-58
    • /
    • 2005
  • This paper proposes an efficient algorithm for extracting a tumor region from an breast ultrasound volume image by using rate-distortion (R-D) based seeded region growing. In the proposed algorithm the rate and the distortion represent the roughness of the contour and the dissimilarity of pixels in a region, respectively. Staring from an initial seed region set in each cutting plane of a volume, a pair of the seed region and one of adjacent regions whose R-D cost is minimal is searched and then they are merged into a new updated seed region. This procedure is recursively performed until the averaged R-D cost values per the number of contour pixels in the seed region becomes maxim. As a result, the final seed region has good pixel homogeneity and a much smooth contour. Finally, the tumor volume is extracted using the contours of the final seed regions in all the cutting planes. Experimental results show that the averaged error rate of the proposed method is shown to be below 4%.