• Title/Summary/Keyword: Constraint Resource

Search Result 207, Processing Time 0.025 seconds

The Leisure Constraint and Leisure Life Satisfaction of the Institutionalized Elderly in Seoul - Focusing on the Free Institutionalized Elderly - (서울시 시설거주 노인의 여가프로그램제약정도와 여가생활만족도 - 무료양로시설을 중심으로 -)

  • Park Mee Sok
    • Journal of the Korean Home Economics Association
    • /
    • v.43 no.4 s.206
    • /
    • pp.203-223
    • /
    • 2005
  • This study investigated the leisure constraints and leisure life satisfaction of the institutional elderly. The respondents were 302 elderly people residing in 5 free institutionalized elderly homes in Seoul. The data were analyzed by frequency analysis, factor analysis, One-way ANOVA, Duncan's post hoc test and regression analysis using SPSS WIN 12.0 program. Exploratory factor analysis revealed that the 10 items in the proposed scale could be grouped into four factors of constraint on leisure:'physical constraint','psychological constraint','interpersonal constraint', and 'structural constraint 'There were differences in leisure constraints according to sex, age, education degree, interaction with facility colleagues, and interaction with facility staff. There were differences in leisure life satisfaction according to sex, age, having religion or not, interaction with facility colleagues, interaction with facility staff and leisure constraints. Regression analysis results indicated that the main effective factors of leisure life satisfaction were leisure constraints.

APPLICATION OF CONSTRAINT LOGIC PROGRAMMING TO JOB SEQUENCING

  • Ko, Jesuk;Ku, Jaejung
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.617-620
    • /
    • 2000
  • In this paper, we show an application of constraint logic programming to the operation scheduling on machines in a job shop. Constraint logic programming is a new genre of programming technique combining the declarative aspect of logic programming with the efficiency of constraint manipulation and solving mechanisms. Due to the latter feature, combinatorial search problems like scheduling may be resolved efficiently. In this study, the jobs that consist of a set of related operations are supposed to be constrained by precedence and resource availability. We also explore how the constraint solving mechanisms can be defined over a scheduling domain. Thus the scheduling approach presented here has two benefits: the flexibility that can be expected from an artificial intelligence tool by simplifying greatly the problem; and the efficiency that stems from the capability of constraint logic programming to manipulate constraints to prune the search space in an a priori manner.

  • PDF

A Study on the Erection Scheduling in the Shipbuilding Using Constraint Satisfaction Technique (제약 만족 기법을 이용한 조선 산업에서의 탑재 일정 생성에 관한 연구)

  • Kim, Ki-Dong;Jang, Yong-Sung
    • Journal of Industrial Technology
    • /
    • v.19
    • /
    • pp.91-99
    • /
    • 1999
  • The dock is the most important resource in shipbuilding yard. Among the shipbuilding schedules, the ship erection schedule in a dock is preferentially built. As results of it, the other schedules(machining in plants, block assembly, pre-painting, pre-rigging, painting and etc) are made. In this study, ship erection scheduling is formulated using ILOG Scheduler. This study is to develop a new problem solving method for ship erection to make an effective schedule based on Constraint Satisfaction Technique(CST).

  • PDF

Scheduling Algorithms with Transmit Power Constraint fer CDMA Packet Services

  • Minjoung Sheen;Lee, Seungbeom;Park, Sin-Chong
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1721-1723
    • /
    • 2002
  • In 3rd-generation mobile communication systems providing packet service, optimal scheduling algorithms we needed to increase service efficiency. In this paper, three scheduling algorithms (SP, EDF, and RPQ) which have been studied in the field of computer networks are applied with transmit power constraint to an interference-limited CDMA system, proving to be efficient.

  • PDF

Environmental Regulation and Technological Constraint (환경규제와 기술제약 -한국지역제조업을 중심으로-)

  • Kang, Sang Mok;Gim, Uhn Soon
    • Environmental and Resource Economics Review
    • /
    • v.11 no.3
    • /
    • pp.345-375
    • /
    • 2002
  • The purpose of this paper is to measure the change of the production efficiency which may happen when environmental regulation incurs technological constraint in the process of production, and to compute the opportunity cost of pollution reduction with the lost products based on the change of efficiency. The patterns of production technoloy in the paper are divided into the technologies of strong disposability and weak disposabilty to grasp the effect of the technological constraint due to the environmental regulation. The endowment of the technolgical constraints in the process of production is considered to bring the greatest restriction on firm's production. When the environmental efficiencies of Korean regional manufactures were measured with linear programming model, the lost products related with the constraint of production technology that environmental regulation incurred, was average 148.1 billion dollar per year(5.87% of one year overall products) for total manufactures in 1991~1998. The ratio of the lost products for total products was spread from 0.78% to 1l.08%. The average lost products of 15 regions were changed from 4.66% to 18.35% of total products. Generally the environmental efficiency index of regional manufactures being decreased continuously since 1991, it is estimated that the environmental performance of Korean manufactures has been more and more deteriorating.

  • PDF

The Collaboration Framework for Robot Application (로봇 어플리케이션을 위한 협업 프레임워크)

  • Lee, Chang-mug;Kwon, Oh-young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.889-891
    • /
    • 2009
  • The utilization of robot application is growing up in recent years, but there is a constraint to execute various application on the robot because of difference of robot resource. This paper presents the framework in order to solve the resource constraint by sharing resources with other devices near by robot. The framework defines common factors that are needed to collaboration work. Furthermore, We show the working flow of framework with an example consisted of robot and some devices in same network.

  • PDF

Statistically Controlled Opportunistic Resource Block Sharing for Femto Cell Networks

  • Shin, Dae Kyu;Choi, Wan;Yu, Takki
    • Journal of Communications and Networks
    • /
    • v.15 no.5
    • /
    • pp.469-475
    • /
    • 2013
  • In this paper, we propose an efficient interference management technique which controls the number of resource blocks (or subcarriers) shared with other cells based on statistical interference levels among cells. The proposed technique tries to maximize average throughput of a femto cell user under a constraint on non-real time control of a femto cell network while guaranteeing a target throughput value of a macro cell user. In our proposed scheme, femto cells opportunistically use resource blocks allocated to other cells if the required average user throughput is not attained with the primarily allocated resource blocks. The proposed method is similar to the underlay approach in cognitive radio systems, but resource block sharing among cells is statistically controlled. For the statistical control, a femto cell sever constructs a table storing average mutual interference among cells and periodically updates the table. This statistical approach fully satisfies the constraint of non-real time control for femto cell networks. Our simulation results show that the proposed scheme achieves higher average femto user throughput than conventional frequency reuse schemes for time varying number of users.

Scheduling of Workflows under Resource Allocation Constraints using CTR (CTR을 이용한 자윈 할당 제약조건 하에서 워크플로우의 스케줄링)

  • Koh Jae-Jin;An Hyoung-Keun;Lee Dan-Young
    • The KIPS Transactions:PartD
    • /
    • v.13D no.2 s.105
    • /
    • pp.191-198
    • /
    • 2006
  • Many enterprises have introduced workflow to enhance work efficiency and support effective work processes in their various work environments. Recently, Business Process Management(BPM), an extension of workflow, is spotlighted in enterprise software markets Although woklflow plays an important role in Business Process Managements, researches in workflow are mostly concentrated on temporal constraints which finds exact execution sequences for complicated jobs. On that reason, majority of workflow scheduling has concentrated on modeling of various resources which should be handled and the interest for workflow scheduling under constraints related to resources is rather unsatisfactory In this paper we presents the Transformation Template based on Concurrent Transaction Logic(CTR) which is suitable for scheduling workflows with resource allocation constraints, and the logical framework. The Transformation Template consists of a Workflow Transformation Template and a Constraint Transaction Template. Especially the Transformation Template can be conveniently used to logically represent new workflows under the existing resource allocation constraints.

Resource Reallocation Algorithm for Layered Video Multicast (계층적 비디오 멀티캐스트를 위한 자원 재할당 알고리즘)

  • Yun, Jiun;Park, Dong Chan;Hwang, Sung Sue;Kim, Min Ki;Kim, Suk Chan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.5
    • /
    • pp.293-301
    • /
    • 2014
  • It has been grown interests ot the convergence services about broadcasting and multicasting services such as Mobile IPTV. It needs the efficient scheduling and resource allocation algorithm because video contents have the large data. This paper proposes the resource allocation algorithm for the layered-encoded video coding in the multicasting services. Existing approaches only deal with the utility maximization in the current video frames. However, these algorithms have a problem for the Quality of Services(QoS) if the user's channel states are not good. We apply the delay constraint and find to maximize the utility values using the current content's frames and already assigned content's frames within the constraint periods. The performance of the proposed algorithm is evaluated by the higher layer transmission rates compared the existing algorithm and significantly improved for the QoS.