• 제목/요약/키워드: Constraints

검색결과 6,960건 처리시간 0.032초

THE EFFECT OF INFLATION RISK AND SUBSISTENCE CONSTRAINTS ON PORTFOLIO CHOICE

  • Lim, Byung Hwa
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제17권2호
    • /
    • pp.115-128
    • /
    • 2013
  • The optimal portfolio selection problem under inflation risk and subsistence constraints is considered. There are index bonds to invest in financial market and it helps to hedge the inflation risk. By applying the martingale method, the optimal consumption rate and the optimal portfolios are obtained explicitly. Furthermore, the quantitative effect of inflation risk and subsistence constraints on the optimal polices are also described.

Constraints and Type Hierarchies for Korean Serial Verb Constructions - An Analytic Study within the HPSG Framework -

  • Song, Sang-Houn
    • 한국언어정보학회:학술대회논문집
    • /
    • 한국언어정보학회 2007년도 정기학술대회
    • /
    • pp.440-449
    • /
    • 2007
  • This paper provides a fine-grained analysis of Korean serial verb constructions within the HPSG framework, and covers major descriptive characteristics of the phenomena. This paper discusses constraints on serial verb constructions in terms of four aspects; transitivity, argument structure, semantic properties, and complementizers. As a result, 17 constraints have been built, which support the type hierarchies for Korean serial verb constructions. This paper also presents a sample derivation on the basis of on the constraints and the type hierarchies.

  • PDF

일반적 효용함수 하에서 대출제약의 정도와 최적 소비 및 투자 (Degree of Borrowing Constraints and Optimal Consumption and Investment under a General Utility Function)

  • 심규철
    • 경영과학
    • /
    • 제33권1호
    • /
    • pp.77-87
    • /
    • 2016
  • I study optimal consumption and investment choices of an infinitely-lived economic agent with a general time-separable von Neumann-Morgenstern utility under general borrowing constraints against future labor income. An explicit solution is provided by the dynamic programming method. It is shown that the optimal consumption and risky investment decrease as the borrowing constraints become stronger.

An IMM Approach for Tracking a Maneuvering Target with Kinematic Constraints Based on the Square Root Information Filter

  • Kim, Kyung-Youn;Kim, Joong-Soo
    • Journal of Electrical Engineering and information Science
    • /
    • 제1권2호
    • /
    • pp.39-44
    • /
    • 1996
  • An efficient interacting multiple mode(IMM) approach for tracking a maneuvering target with kinematic constraints is described based on the square root information filter(SRIF). The SRIF is employed instead of the conventional Kalman filter since it exhibits more efficient features in handling the kinematic constraints and improved numerical characteristics. The kinematic constraints are considered in the filtering process as pseudomeasurements where the degree of uncertainty is represented by the magnitude of the pseudomeasurement noise variance. The Monte Carlo simulations for the constant speed, maneuvering target are provided to demonstrate the improved tracking performance of the proposed algorithm.

  • PDF

민간경비원의 여가제약과 생활체육 참가 및 주관적 행복감의 관계 (Relationship between Leisure Constraints, Participation in Sports for All and Subjective Happiness among Private Guards)

  • 김경식;김평수;김찬선
    • 한국콘텐츠학회논문지
    • /
    • 제7권12호
    • /
    • pp.167-178
    • /
    • 2007
  • 이 연구의 목적은 민간경비원의 여가제약이 생활체육 참가 및 주관적 행복감에 미치는 영향을 규명하는데 있다. 이 연구는 2007년 서울소재 5개소 민간경비회사의 민간경비원을 모집단으로 설정한 다음, 집락무선표집법을 이용하여 193명을 표집하였다. 설문지의 신뢰도는 Cronbach's ${\alpha}$값이 .725이상으로 나타났다. 결론은 다음과 같다. 첫째, 여가제약은 생활체육 참가경험에 영향을 미친다. 즉, 개인내적, 주변의식적, 경제적 제약이 증가하면 생활체육 참가율은 감소한다. 둘째, 여가제약은 생활체육 참가정도에 영향을 미친다. 즉, 개인내적, 주변의식적, 경제적 여가제약이 증가하면 생활체육 참가빈도는 감소한다. 주변의식적 여가제약이 증가하면 생활체육 참가기간은 감소한다. 개인내적, 주변의식적 여가제약이 증가하면 생활체육 참가 강도는 감소한다. 셋째, 여가제약은 주관적 행복감에 영향을 미친다. 즉, 시간적 제약이 증가하면 행복감의 하위요인인 유능감은 감소한다. 넷째, 여가제약은 생활체육 참가 및 주관적 행복감에 인과적 영향을 미친다. 즉, 여가제약은 생활체육 참가를 통하여 주관적 행복감에 간접적 영향을 미친다.

제약조건을 고려한 통합대중교통망의 대안경로탐색 (Finding Alternative Routes in Inter Modal Transit Networks Considering Constraints)

  • 이미영;백남철
    • 한국ITS학회 논문지
    • /
    • 제4권1호
    • /
    • pp.1-13
    • /
    • 2005
  • 다양한 대중교통수단이 함께 구축되어 있는 통합대중교통망(Integrated Transit Network)에 대하여, 최적통행시간 경로정보뿐만 아니라 다수의 최적통행시간 정보를 제공하는 방안에 대한 기초연구는 그 사례를 찾아보기 어렵다. 본 연구는 다수의 대중교통경로를 탐색하기 위하여, 버스와 지하철의 두 수단이 함께 존재하는 복합교통망에서 K개의 최소통행시간을 갖는 경로를 탐색하는 방안을 제안한다 제안된 방안은 통행정보에서 대중교통 사용자가 일반적으로 필요로 하는 다음의 3가지 제약조건 (1) 수단의 서비스시간제약, (2) 통합거리비례제 요금제약, 3) 환승회수제약을 고려한다. 사례연구를 통해 K개의 최소통행시간 경로정보뿐만 아니라 위의 제약조건을 조합적으로 반영하여 사용자에게 필요한 경로정보의 질적 향상 및 다양화에 대한 가능성을 제시한다.

  • PDF

Power control with QoS and Interference Temperature Constraints in Cognitive Radio Networks

  • Do, Cuong The;Hong, Choong-Sean
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2011년도 한국컴퓨터종합학술대회논문집 Vol.38 No.1(A)
    • /
    • pp.420-421
    • /
    • 2011
  • This paper derive an optimal distributed power control strategy under both the probability of dropping a packet due to buffer overflow constraints at the secondary users and the interference constraints to the primary users.

PRE-GALACTIC CONSTRAINTS ON THE GALACTIC EVOLUTION

  • Hyun, J.J.
    • 천문학회지
    • /
    • 제14권2호
    • /
    • pp.51-54
    • /
    • 1981
  • The characteristic size and mass of galaxies as pre-galactic constraints on the Galactic evolution are reviewed and the general constraints for their existence in gravitationally bound systems are examined. Implications on the self-similar gravitational clustering are also discussed.

  • PDF

Constraint Programming Approach for a Course Timetabling Problem

  • Kim, Chun-Sik;Hwang, Junha
    • 한국컴퓨터정보학회논문지
    • /
    • 제22권9호
    • /
    • pp.9-16
    • /
    • 2017
  • The course timetabling problem is a problem assigning a set of subjects to the given classrooms and different timeslots, while satisfying various hard constraints and soft constraints. This problem is defined as a constraint satisfaction optimization problem and is known as an NP-complete problem. Various methods has been proposed such as integer programming, constraint programming and local search methods to solve a variety of course timetabling problems. In this paper, we propose an iterative improvement search method to solve the problem based on constraint programming. First, an initial solution satisfying all the hard constraints is obtained by constraint programming, and then the solution is repeatedly improved using constraint programming again by adding new constraints to improve the quality of the soft constraints. Through experimental results, we confirmed that the proposed method can find far better solutions in a shorter time than the manual method.