• 재활복지
• /
• 제21권1호
• /
• pp.253-277
• /
• 2017

이 연구는 지체장애인의 운동참여제약을 측정할 수 있는 운동참여제약 측정도구(Constraints in Physical Activity Scale for people with physical Disabilities: CPASD)를 개발하는 데에 목적이 있다. 이를 위해 이 연구에서는 Messick(1995)의 통합적 타당도, Benson(1998)의 강력한 구인타당도 프로그램 틀을 기반으로 한 다섯 가지 단계로 연구를 설계하였고, 지체장애인 264명을 대상으로 공통요인모형과 측정모형을 적용하여 CPASD의 타당도 증거를 체계적으로 제시하였다. 이 연구의 결과와 논의를 토대로 결론을 제시하면 다음과 같다. 첫째, CPASD는 구인타당도의 증거를 제시하였다. 요인구조의 해석가능성과 요인계수의 적합성을 통해 지도자 제약, 경제적 제약, 편견, 운동환경 제약으로 구성된 4요인, 17개 문항으로 개발되었다. 둘째, 개발된 CPASD의 요인구조(지도자제약, 경제적제약, 편견, 운동환경제약)는 통계적으로 구분됨과 동시에, 기존 운동참여제약 관련 이론을 안정적으로 반영하였다. 셋째, 개발된 CPASD는 준거관련타당도 증거를 제시하였다. 지도자제약, 편견은 긍정적 운동정서와 부적인 상관관계를, 지도자제약, 편견, 운동환경제약은 부정적 운동정서와 정적인 상관관계를 나타내었다. 따라서 후속 연구에서는 CPASD의 요인로 도출된 지도자제약, 경제적제약, 편견, 운동환경제약과 관련된 현재의 제도, 실태 등을 재평가할 필요성이 대두되고, 이를 위해 CPASD를 활용한 인과관계검증, IRT 이론을 적용한 현실 수준정도를 판단할 필요가 있다.

• ETRI Journal
• /
• 제29권2호
• /
• pp.201-211
• /
• 2007

This paper focuses on the scheduling problem with the objective of maximizing system throughput, while guaranteeing long-term quality of service (QoS) constraints for non-realtime data users and short-term QoS constraints for realtime multimedia users in multiclass service high-speed uplink packet access (HSUPA) systems. After studying the feasible rate region for multiclass service HSUPA systems, we formulate this scheduling problem and propose a multi-constraints HSUPA opportunistic scheduling (MHOS) algorithm to solve this problem. The MHOS algorithm selects the optimal subset of users for transmission at each time slot to maximize system throughput, while guaranteeing the different constraints. The selection is made according to channel condition, feasible rate region, and user weights, which are adjusted by stochastic approximation algorithms to guarantee the different QoS constraints at different time scales. Simulation results show that the proposed MHOS algorithm guarantees QoS constraints, and achieves high system throughput.

• 한국산업정보학회논문지
• /
• 제7권3호
• /
• pp.95-106
• /
• 2002

As the information technology including Internet not only opened the cyber world but also has evolved as a platform that enables a new generation of businesses and remolds the shape of thinking and the rules of supply chain management (SCM). By using the Theory of Constraints, which seems simple but robust to review the traditional SCM context, the paper proposes a conceptual framework to handle the SCM issues. From the strategic perspective, this paper focuses on three policy constraints: supplier-manufacturer oriented constraints, manufacturer-distributor oriented constraints, and supply chain oriented constraints. To optimize the throughput and sustain the competitiveness of supply chain members in the dynamic business environment, the companies should utilize the potential competency of information technology and consistently perform the activities of removing and/or reinforcing the constraints.

• Journal of Mechanical Science and Technology
• /
• 제14권6호
• /
• pp.655-665
• /
• 2000

We propose an efficient algorithm for the purpose of satisfying a wide range of design constraints represented with equality and inequality equations as well as production rules. The algorithm employs simulated-annealing and a production rule inference engine and works on design constraints represented with networks. The algorithm fulfills equality constraints through constraint satisfaction processes like variable elimination while taking into account inequality constraints and inferring production rules. It can also reduce the load of the optimization procedure if necessary. We demonstrate the implementation of the algorithm with the result on machine tool design.

• Asia pacific journal of information systems
• /
• 제14권1호
• /
• pp.79-100
• /
• 2004

As a part of ebXML(Electronic Business using eXtensible Markup Language) framework, BPSS(Business Process Specification Schema) has been provided to support the direct specification of the set of elements required to configure a runtime system in order to execute a set of ebXML business transactions. The BPS,' is available in two stand-alone representations, a UML version and an XML version. Due to the limitations of UML notations and XML syntax, however, current ebXML BPSS specification fails to specify formal semantic constraints completely. In this study, we propose a constraint classification scheme for the BPSS specification and describe how to formally represent those semantic constraints using OCL(Object Constraint Language). As a way to validate p Business Process Specification(BPS) with the formal semantic constraints, we suggest a rule-based approach to represent the formal constraints and demonstrate its detailed mechanism for applying the rule-based constraints to the BPS with a prototype implementation.

• 전자공학회논문지A
• /
• 제31A권2호
• /
• pp.94-103
• /
• 1994

In testing for practical scan disigned logic circuits, there may exist logic value constraints on some part of primary inputs due to various requirements on design and test. This paper presents a logic value system called taboo logic values which targets the test pattern generation of logic circuits under logic value constraints. The taboo logic system represents the logic value constraints and identifies additional logic value constraints through the implication of the tqaboo logic values using a taboo logic calculus. Those identified logic value constraints will guide the search during the test pattern generation of avoid the unfruitful searches and to identify redundant faults due to the logic value constraints very quickly. Finally, experimental results on ISCAS85 benchmark circuits will demonstrate the efficiency of the taboo logic values.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2003년도 추계종합학술대회
• /
• pp.183-187
• /
• 2003

In this paper, we describe an implementation method of "set constraints logic language" using the logic language Prolog. "Set constraints logic language" is a programming language with a new paradigm that uses the "set theory" in programming. In this paper, we explain "set constraints problem solver" that has been proposed by A. Dovier and his researchers and we describe an implementation method of this solver using Prolog. We ran easily implement the "set constraints problem solver" in Prolog, since Prolog easily implements nondeterministic problems and provides a data structure railed list. We have applied the language to several application fields to show the usefulness of the language.

• 대한전기학회논문지:전력기술부문A
• /
• 제49권7호
• /
• pp.339-344
• /
• 2000

This paper presents an improved optimal power flow algorithm, which solves an optimization problem with equality constraints with converted inequality constraints. The standard OPF and the penalty function method should do reconstructing active constraints among the inequality constraints so that the activation of the inequality constraints has been imposing an additional burden to solve OPF problem efficiently. However the proposed algorithm converts active inequality constraints into the equality constraints in order to preclude us from reconstructing the procedures. The effectiveness of the new OPF algorithm is validated by applying the IEEE 14 bus system.

• 한국영어학회지:영어학
• /
• 제3권4호
• /
• pp.547-570
• /
• 2003

There are a fair number of suffixes in English whose conditions on attachment refer to stress and/or segmental information contained within the words they attach to (see Siegel 1974, Jespersen 1942 and Marchand 1969). Through a wide study of relevant data, we will delve deeply into such phonological restrictions on the bases, which may as well be divided into four distinct types: haplological constraints; segmental constraints; prosodic constraints; and mixed types. We will further assume here that the category/ subcategorization requirements of affixes are subject to the Projection Principle (PP) as conceived in Kiparsky (1983). It will be shown how this PP interacts with phonological constraints placed upon the affix in question, especially in the treatment of-ful (inventful/mournful) or -en (longen/lengthen). Our account of problematic affixations in English is based on a number of violable constraints in OT.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 A
• /
• pp.143-145
• /
• 1998

This paper presents the shape optimization algorithm of magnetic systems with, state variable constraints using the Finite Element Method. In the design' of electromagnetic systems, sometimes we have to consider the state variables when they seriously affect the performance of electromagnetic systems. So we should define that some design problems have the constraints of the state variables. We use the gradient of constraints and sensitivity analysis in order to consider the state variable constraints and obtain an optimal shape. The optimal shape must be satisfied constraints, so we take the gradient projection method as a kind of optimization methods. In this paper a numerical example with state variable constraints uses the superconducting electromagnet that has another constraint which the volume of the superconductor should be constant.