• Title/Summary/Keyword: 볼록형

Search Result 92, Processing Time 0.028 seconds

Isogeometric Analysis of Electrostatic Adhesive Forces in Two-Dimensional Curved Electrodes (2차원 곡면형 전극에서 정전기 흡착력의 아이소-지오메트릭 해석)

  • Oh, Myung-Hoon;Kim, Jae-Hyun;Kim, Hyun-Seok;Cho, Seonho
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.34 no.4
    • /
    • pp.199-204
    • /
    • 2021
  • In this study, an isogoemetric analysis (IGA) method that uses NURBS (Non-Uniform Rational B-Spline) basis functions in computer-aided design (CAD) systems is employed to account for the geometric exactness of curved electrodes constituting an electro-adhesive pad in electrostatic problems. The IGA is advantageous for obtaining precise normal vectors when computing the electro-adhesive forces on curved surfaces. By performing parametric studies using numerical examples, we demonstrate the superior performance of the curved electrodes, which is attributed to the increase in the normal component of the electro-adhesive forces. In addition, concave curved electrodes exhibit better performance than their convex counterparts.

An Algorithm for the Singly Linearly Constrained Concave Minimization Problem with Upper Convergent Bounded Variables (상한 융합 변수를 갖는 단선형제약 오목함수 최소화 문제의 해법)

  • Oh, Se-Ho
    • Journal of the Korea Convergence Society
    • /
    • v.7 no.5
    • /
    • pp.213-219
    • /
    • 2016
  • This paper presents a branch-and-bound algorithm for solving the concave minimization problem with upper bounded variables whose single constraint is linear. The algorithm uses simplex as partition element. Because the convex envelope which most tightly underestimates the concave function on the simplex is uniquely determined by solving the related linear equations. Every branching process generates two subsimplices one lower dimensional than the candidate simplex by adding 0 and upper bound constraints. Subsequently the feasible points are partitioned into two sets. During the bounding process, the linear programming problems defined over subsimplices are minimized to calculate the lower bound and to update the incumbent. Consequently the simplices which do certainly not contain the global minimum are excluded from consideration. The major advantage of the algorithm is that the subproblems are defined on the one less dimensinal space. It means that the amount of work required for the subproblem decreases whenever the branching occurs. Our approach can be applied to solving the concave minimization problems under knapsack type constraints.

Structural Characteristics of Shoot Apex Developed from Somatic Embryos of Daucus carota L. (당근의 체세포배로부터 발생한 경정부의 구조적 특성)

  • 홍성식;소웅영
    • Korean Journal of Plant Resources
    • /
    • v.12 no.2
    • /
    • pp.133-138
    • /
    • 1999
  • The structure of shoot apex in zygotic and somatic embryos of Daucus carota L. cv. Hongshim was observed by using SEM and longitudinal sections. Shoot apex of zygotic embryo was of an inverted boat shape, and these of two, three and four cotyledon somatic embryos were of an inverted boat shape, a pyramid shape and a convex diamond shape, respectively. In zygotic embryo shoot apex is consisted of small cells which are arranged in layers (tunica) and show corpus in central region. In somatic embryos shoot apices are consisted of somewhat large cells which are arranged in irregularly or slight regularly.

  • PDF

A generation of Optimal Path Passing through Shadow Volume in Terrain (지형에서의 음영공간을 통과하는 최적경로 생성)

  • Im, In-Sun;Koo, Ja-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.6
    • /
    • pp.131-137
    • /
    • 2007
  • I intend to seek the shortest path which an aircraft safely flies to its destination through the shadow volume of three dimensional terrain which propagation does not extend. Herein, I propose a method in which a relatively wide shadow volume is divided with a polygon type of block polygon, a path up to the intermediate destination is sought in the divided block polygons according to the weight, and then, the shortest path up to the final destination is sought by repeating courses for seeking a destination again from the adjacent polygon based on the starting point of the intermediate destination within the divided polygon. The shortest path was searched by using the revised algorithms which apply to a critical angle from graph growth algorithms on the shadow volume which propagation on the actual three dimensional terrain does not extend to. The experiment shows that a method proposed in this paper creates effective flying curves.

  • PDF

Optimum Tuning of PID-PD Controller considering Robust Stability and Sensor Noise Insensitivity (센서 잡음 저감도 및 안정-강인성을 고려한 PID-PD 제어기의 최적 동조)

  • Kim, Chang-Hyun;Lim, Dong-Kyun;Suh, Byung-Suhl
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.44 no.1
    • /
    • pp.19-24
    • /
    • 2007
  • In this paper, we propose a tuning method of PID-PD controller to satisfy design specifications in frequency domain as well as time domain. The proposed tuning method of PID-PD controller consists of the convex set of PID and PI-PD controller. PID-PD controller controls the closed-loop response to be located between the step responses, and Bode magnitudes of closed-loop transfer functions controlled by PID and PI-PD controller. The controller is designed by the optimum tuning method to minimize the proposed specific cost function subject to sensor noise insensitivity and robust stability. Its effectiveness is examined by the case study and analysis.

Expansion of Motion Planning Algorithms by Cell-Decomposition (셀-분할 방식에 의한 운동계획 알고리즘의 확장)

  • 안진영;유견아
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04a
    • /
    • pp.887-889
    • /
    • 2003
  • 사다리꼴-분할 방식은 로봇 경로 계획 알고리즘 중 완전 셀-분할 방식중의 하나로서 장애물과 떨어진 경로를 제공하므로 안정성을 제공하는 방식이다. 사다리꼴-분할 방식은 다각형 환경으로 이루어진 형상공간에서 정의되며 자유공간을 볼록 다각형으로 이루어진 셀(cell)로 나누어 로봇 운동을 계획하는데, 원과 같은 비다각형 장애물이 존재하는 경우에 대해서는 이 성질을 만족하는 분할 방법이 알려져 있지 않다. 본 논문에서는 기존의 다각형 환경에서 정의된 사다리꼴-분할 방식을 분할의 완전성을 잃지 않고 원의 호를 포함하는 환경으로 확장하는 알고리즘을 소개하고 구현한다.

  • PDF

Efficacy of Transcervical Fallopian Tube Catheterization in Infertility Patients with Fallopian Tube Occlusion (난관 폐쇄에 기인한 불임 환자에서 난관 개통술의 효용성)

  • Park, Chan-Woo;Cha, Sun-Hwa;Yang, Kwang-Moon;Han, Ae-Ra;Yoo, Ji-Hee;Song, In-Ok;Kim, Hye-OK;Kang, Inn-Soo;Koong, Mi-Kyoung;Lee, Kyung-Sang
    • Clinical and Experimental Reproductive Medicine
    • /
    • v.37 no.4
    • /
    • pp.321-327
    • /
    • 2010
  • Objective: To evaluate the significance and efficacy of trans-cervical fallopian tube catheterization (TFTC) in diagnosis and optimal treatment modality for tubal blockage. Methods: The retrospective study was performed in those underwent TFTC from January 2005 to December 2009. A total of 342 fallopian tubes in 215 patients which showed tubal blockage in hysterosalpingography (HSG), were subjected to TFTC. Recanalization rate (RR) was compared according to portion of tubal blockage; proximal, isthmic and distal portion and blockage type; tapering, concave, and convex type. Results: In total, RR was 72.5% (248/342 tube). According to the portion of tubal blockage, RR was 83.8% in proximal, 45.6% in isthmic and 100% in distal portion. RR was 92.3% in tapering, 80.2% in concave and 25.5% in convex type, respectively. There were 98 pregnancies in 156 patients after successful recanalization, which shows 62.7% pregnancy rate. Conclusio: TFTC were capable of recanalizing tubal blockage in 248 of 342 tubes in 156 of 215 patients (72.5%). The RR was increased with proximal portion and tapering type tubal blockage.

Fuzzy Modeling and Fuzzy Control of HIV-1 Biodynamics (HIV-1 바이오 동역학 모델의 퍼지 모델링 및 제어)

  • Kim Do-Wan;Ju Yeong-Hun;Park Jin-Bae
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2006.05a
    • /
    • pp.75-78
    • /
    • 2006
  • 본 논문에서 우리는 HIV-1 바이오 동역학모델의 퍼지 모델링 및 디지털 퍼지 제어 기법을 소개한다. 그것의 제어구조는 샘플링 점들에서 측정한 상태로부터 현재 상태를 대략적으로 예측하는 수치적 적분 구조를 사용한다. 제안된 지능형 디지털 재설계에서는 전역 상태-정합과 안정도 조건들을 동시적으로 만족하는 타당한 디지털 제어 이득들을 찾는 것이다. 우리는 보상된 블록-펄스 함수를 이용하여 새로운 전역 상태-정합 조건을 우선 제시하며 그리고 나서 안정도 조건들을 이 조건들에 추가한다. 유도된 조건들은 선형행렬 부등식으로 묘사되며, 그로인해 볼록 최적화 문제로 쉽게 해결될 수 있다. 또한, 안정도 조건으로 인한 성능 하강을 방지하기 위해 두 단계 지능형 디지털 재설계 과정이 제안된다. 첫 번째 단계에서는 전역 상태-정합만을 고려한 디지털 제어 이득을 찾는다. 두 번째 단계에서는 얻어진 디지털 제어하의 폐루프 시스템을 안정화 시키는 추가디지털 제어기를 설계한다.

  • PDF

Investigation of Behaviours of Wall and Adjacent Ground Considering Shape of Geosynthetic Retaining Wall (보강토 옹벽의 형상을 고려한 벽체 및 인접지반 거동 연구)

  • Lee, Jong-Hyun;Oh, Dong-Wook;Kong, Suk-Min;Jung, Hyuk-Sang;Lee, Yong-Joo
    • Journal of the Korean Geosynthetics Society
    • /
    • v.17 no.1
    • /
    • pp.95-109
    • /
    • 2018
  • Recently, GRS (Geosynthetic Retaining Segmental) wall has been widely used as a method to replace concrete retaining wall because of its excellent structural stability and economic efficiency. It has been variously applied for foundation, slope, road as well as retaining wall. The GRS wall system, however, has a weak point that is serious crack of wall due to stress concentration at curved part of it. In this study, therefore, behaviour of GRS wall according to shape of it, shich has convex and concave, are analysed and compared using Finite Element analysis as the fundamental study for design optimization. Results including lateral deflection, settlements of ground surface and wall obtained from 2D FE analysis are compared between straight and curved parts from 3D FE analysis.

The Design of Optimal Recall Insurance Product (최적 리콜보험상품 설계에 관한 연구)

  • 김두철
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.3 no.4
    • /
    • pp.325-332
    • /
    • 2002
  • In the process of designing pareto optimal insurance contract, it is necessary to assume that insurance contract conditions are endogenous to build a model. The expected utility, the non-expected utility and the state-dependent utility function can be applied as a insurance decision making principle. The insurance costs may have the linear, convex, and concave ralationship with the indemnity schedule. However, the sunk cost and fixed cost must be recognized. The deductible which decides whether an insurance contract to be a full or partial insurance contract can exist in the forms of straight deductible or diminishing deductible. Indeciding the level of deductible, the types of the insurance and the risks to be insured should be the deciding factors. Especially for recall insurance, there is relatively high chance that the recalling company being bankrupt. Therefore, the possibility of bankrupcy should be the considering factor in deciding the policy limit. The existence of the incomplete market and uninsurable background risk should be understood as restricting conditions of the pareto-optimal insurance contract.

  • PDF