• Title/Summary/Keyword: Inequality constraints

Search Result 166, Processing Time 0.021 seconds

A Study on the Position and Role of Korean Medicine Doctors Working at Long-Term Care Hospitals (요양병원 근무 한의사의 지위와 역할에 관한 연구)

  • Kang, Tae-Ri;Lee, Sang-Ryong
    • Journal of Society of Preventive Korean Medicine
    • /
    • v.19 no.3
    • /
    • pp.77-90
    • /
    • 2015
  • Objective : The purpose of this study is to discuss the role and ways to improve the position and rights of Korean Medicine Doctors (KMDs) working at long-term care hospitals (LTCHs) through survey analysis. Method : (1) The legal and institutional position of KMDs is studied using current law and related papers. (2) The online survey was conducted through KMD community websites, targeted at KMDs working at LTCHs. Results : (1) Whereas there is perceived added benefit for the eight specializations for a specialist of Western medicine at LTCHs, in the case of a specialist of Korean Medicine, their value is not institutionally recognized at all. (2) A Western inpatient's medical fee is more than a Korean inpatient's medical fee, and the individual fee for the same medical treatment is also higher in Western hospitalization. So, Korean medical hospitalization actually cannot be made. Because of that, Korean Medicine Doctors find it difficult to be primary care physicians. (3) Musculoskeletal diseases and the aftereffects of cerebrovascular diseases were the most common chief complaints addressed in Korean medical consultations. Conclusion : This study shows that KMDs working at LTCHs have suffered many kinds of inequality. That is because of the limited medical scope of the current medical system and real constraints from the gap in Korean-Western medical fees by the National Health Insurance Corporation. Therefore, it is necessary to eliminate these variations along with revising the statute with continuous research.

Development of finite element analysis program and simplified formulas of bellows and shape optimization (벨로우즈에 대한 유한요소해석 프로그램 및 간편식의 개발과 형상최적설계)

  • Koh, Byung-Kab;Park, Gyung-Jin
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.21 no.8
    • /
    • pp.1195-1208
    • /
    • 1997
  • Bellows is a component in piping systems which absorbs mechanical deformation with flexibility. Its geometry is an axial symmetric shell which consists of two toroidal shells and one annular plate or conical shell. In order to analyze bellows, this study presents the finite element analysis using a conical frustum shell element. A finite element analysis is developed to analyze various bellows. The validity of the developed program is verified by the experimental results for axial and lateral stiffness. The formula for calculating the natural frequency of bellows is made by the simple beam theory. The formula for fatigue life is also derived by experiments. The shape optimal design problem is formulated using multiple objective optimization. The multiple objective functions are transformed to a scalar function by weighting factors. The stiffness, strength and specified stiffness are considered as the multiple objective function. The formulation has inequality constraints imposed on the fatigue limit, the natural frequencies, and the manufacturing conditions. Geometric parameters of bellows are the design variables. The recursive quadratic programming algorithm is selected to solve the problem. The results are compared to existing bellows, and the characteristics of bellows is investigated through optimal design process. The optimized shape of bellows is expected to give quite a good guideline to practical design.

Sequential Approximate Optimization by Dual Method Based on Two-Point Diagonal Quadratic Approximation (이점 대각 이차 근사화 기법을 쌍대기법에 적용한 순차적 근사 최적설계)

  • Park, Seon-Ho;Jung, Sang-Jin;Jeong, Seung-Hyun;Choi, Dong-Hoon
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.35 no.3
    • /
    • pp.259-266
    • /
    • 2011
  • We present a new dual sequential approximate optimization (SAO) algorithm called SD-TDQAO (sequential dual two-point diagonal quadratic approximate optimization). This algorithm solves engineering optimization problems with a nonlinear objective and nonlinear inequality constraints. The two-point diagonal quadratic approximation (TDQA) was originally non-convex and inseparable quadratic approximation in the primal design variable space. To use the dual method, SD-TDQAO uses diagonal quadratic explicit separable approximation; this can easily ensure convexity and separability. An important feature is that the second-derivative terms of the quadratic approximation are approximated by TDQA, which uses only information on the function and the derivative values at two consecutive iteration points. The algorithm will be illustrated using mathematical and topological test problems, and its performance will be compared with that of the MMA algorithm.

Identifying a Shape of Input Data Structure for Automated Program Testing (자동화된 프로그램 시험을 위한 입력 자료구조의 모양 식별)

  • Insang, Chung
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.10
    • /
    • pp.1304-1319
    • /
    • 2004
  • We can significantly reduce the cost o# program testing by automating the process of test data generation. Test data generation usually concerns identifying input values on which a selected path is executed. Although lots of research has been done so far, there still remains a lot of issues to be addressed. One of the issues is the shape problem. The shape problem refers to the problem of figuring out a shape of the input data structure required to cause the traversal of a given path. In this paper, we introduce a new method for the shape problem. The method converts the selected path into static single assignment (SSA) form without pointer dereferences. This allows us to consider each statement in the selected path as a constraint involving equality or inequality. We solve the constraints to get a solution which will be represented in terms of the points-to relations for each input variable. Simple, but illustrative examples are given to explain the proposed method.

LMI Design of Multi-Objective$ Η_2/Η_\infty$Controllers for an Inverted Pendulum on the Cart Using Polytope Models (폴리토프 모델을 이용한 도립진자의 다목적$ Η_2/Η_\infty$ 제어기의 LMI 설계)

  • 이상철
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.1
    • /
    • pp.6-13
    • /
    • 2002
  • This paper deals with the linear matrix inequality (LMI) design procedures for multi-objective Η$_2$$_{\infty}$ controllers with pole-placement constraints for an inverted pendulum system modeled as convex polytopes to ensure the stabilizing regulator and tracking performances. Polytopic models with multiple linear time-invariant models linearized at some operating points are derived to design controllers overcoming the conservativeness such as a controller may have when it is designed for a model linearized at a single operating point. Multi-objective controllers are designed for polytopic models by the LMT design technique with convex algorithms. It is observed that the inverted pendulum controlled by any controller designed for each polytopic model is stabilizingly restored to the vertical angle position for initial values of larger tilt anlges.

High-revenue Online Provisioning for Virtual Clusters in Multi-tenant Cloud Data Center Network

  • Lu, Shuaibing;Fang, Zhiyi;Wu, Jie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.3
    • /
    • pp.1164-1183
    • /
    • 2019
  • The rapid development of cloud computing and high requirements of operators requires strong support from the underlying Data Center Networks. Therefore, the effectiveness of using resources in the data center networks becomes a point of concern for operators and material for research. In this paper, we discuss the online virtual-cluster provision problem for multiple tenants with an aim to decide when and where the virtual cluster should be placed in a data center network. Our objective is maximizing the total revenue for the data center networks under the constraints. In order to solve this problem, this paper divides it into two parts: online multi-tenancy scheduling and virtual cluster placement. The first part aims to determine the scheduling orders for the multiple tenants, and the second part aims to determine the locations of virtual machines. We first approach the problem by using the variational inequality model and discuss the existence of the optimal solution. After that, we prove that provisioning virtual clusters for a multi-tenant data center network that maximizes revenue is NP-hard. Due to the complexity of this problem, an efficient heuristic algorithm OMS (Online Multi-tenancy Scheduling) is proposed to solve the online multi-tenancy scheduling problem. We further explore the virtual cluster placement problem based on the OMS and propose a novel algorithm during the virtual machine placement. We evaluate our algorithms through a series of simulations, and the simulations results demonstrate that OMS can significantly increase the efficiency and total revenue for the data centers.