• 전자공학회논문지A
• /
• 제32A권7호
• /
• pp.104-114
• /
• 1995

In this paper, an intermediate representation HSFG(Hanyang Sequential Flow GRaph) and a new scheduling algorithm for the control-dominated ASIC design is presented. The HSFG represents control flow, data dependency and such constraints as resource constraints and timing constraints. The scheduling algorithm minimizes the total operating time by reducing the number of the constraints as maximal as possible, searching a few paths among all the paths produced by conditional branches. The constraints are substitute by subgraphs, and then the number of subgraphs (that is the number kof the constraints) is minimized by using the inclusion and overlap relation among subgraphs. The proposed algorithm has achieved the better results than the previous ones on the benchmark data.

• 한국해양공학회:학술대회논문집
• /
• 한국해양공학회 2004년도 학술대회지
• /
• pp.40-44
• /
• 2004

A fact that limits a company's ability to achieve more of its goal is referred to as a 'constraint' shipbuilding industries need to identify and manage constraints. The theory of constraints is evolved out of the problems of bottleneck formation. This happens and is conserved for the formulation if various real time problems for arriving standard uniquely addressed problems If, for example, the goal of a shipbuilding industry is to make money now and in the future, it is suggested that TOC will enable th mangers of the company to do so. TOC, focuses the organization scare resources on improving the performance of the true constraints, and therefore the bottom line of the organization. An attempt is made for the implantation of the theory into real world shipyard decision support mechanism.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2005년도 추계학술대회 및 정기총회
• /
• pp.51-55
• /
• 2005

Assuring integrity of permission assignment (PA) constraints is a difficult task in role-based access control (RBAC) because of the large number of constraints, users, roles and permissions in a large enterprise environment. We provide solutions for this problem using the conflict concept. This paper introduces the conflict model in order to understand the conflicts easily and to detect conflicts effectively. The conflict model is classified as a permission-permission model and a role-permission model. This paper defines two type conflicts using the conflict model. The first type is an inter-PA-constraints (IPAC) conflict that takes place between PA constraints. The other type is a PA-PAC conflict that takes place between a PA and a PA constraint (PAC) Also, the conditions of conflict occurrence are formally specified and proved. We can assure integrity on permission assignment by checking conflicts before PA and PA constraints are applied.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제29권10호
• /
• pp.755-765
• /
• 2002

본 논문에서는 한국어 구문분석에 적합한 다양한 구문정보에 대해 살펴보고, 이를 바탕으로 학습한 제약규칙을 이용하여 구문분석모델의 효율성을 개선시키는 방법을 제안한다. 제안하는 방법의 특징은 다음과 같다. 첫째, 제약규칙을 이용하여 불필요한 중간결과물의 생성을 제약하므로, 구문분석의 효율성이 향상된다. 둘째, 제약규칙의 학습에 이용되는 구문정보가 한국어의 특성을 적절히 반영하고 있으므로, 한국어 문장에 대해 비교적 견고하게 분석할 수 있다. 셋째, 제약규칙은 결정트리 학습알고리즘에 의해 말뭉치에서 자동으로 학습되므로, 제약규칙의 획득이 용이하다. 제약규칙을 이용하여 실험한 결과 구문분석모델의 과생성이 1/2~1/3로 줄고 처리속도가 2~3배 빨라졌다.

• 가정과삶의질연구
• /
• 제28권2호
• /
• pp.27-37
• /
• 2010

The purpose of the study was to analyze the constraints that are normally experienced before moving in the context of the household characteristics of households that had recently moved to newly-built apartments. The data for the analysis was collected through a self-administered questionnaire from July 1, 2008 to August 10, 2008. The sample consisted of 251 households in Ulsan living in an apartment complex who had moved within a year. The data from the sample was analyzed by descriptive statistics, factor analysis, and analysis of variance with Duncan's multiple range tests. The results are as follows. The constraints were categorized into information gathering, attractive housing characteristics, expectations of residential mobility, housing development and policies, and resources. Overall, the constraints did not have a huge impact on the performance of the residential mobility of the sample households. Resources, however, were the most influential factors among the five constraints followed by attractive housing characteristics, information gathering, etc. The constraints varied based on the demographic characteristics, such as the household size, duration of marriage, age of the household head, and the socio-economic characteristics, such as the education level of the household head, household income, and the number of mobility. As the number of family members increased, the age of the household head went up, or the level of education went down, the constraints on information gathering were affected in terms of performing residential mobility. Households with a middle aged head with a professional occupation were more constrained by the attractive characteristics of the housing. The impact of the resources related constraints was significantly different based on the number of family members, marriage duration, and the household head's age and occupation, and the number of mobility.

• 제어로봇시스템학회논문지
• /
• 제3권5호
• /
• pp.542-554
• /
• 1997

In this paper, we present a resource conscious approach to designing distributed real-time systems as an extension of our original approach [8][9] which was limited to single processor systems. Starting from a given task graph and a set of end-to-end constraints, we automatically generate task attributes (e.g., periods and deadlines) such that (i) the task set is schedulable, and (ii) the end-to-end timing constraints are satisfied. The method works by first transforming the end-to-end timing constraints into a set of intermediate constraints on task attributes, and then solving the intermediate constraints. The complexity of constraint solving is tackled by reducing the problem into relatively tractable parts, and then solving each sub-problem using heuristics to enhance schedulability. In this paper, we build on our single processor solution and show how it can be extended for distributed systems. The extension to distributed systems reveals many interesting sub-problems, solutions to which are presented in this paper. The main challenges arise from end-to-end propagation delay constraints, and therefore this paper focuses on our solutions for such constraints. We begin with extending our communication scheme to provide tight delay bounds across a network, while hiding the low-level details of network communication. We also develop an algorithm to decompose end-to-end bounds into local bounds on each processor of making extensive use of relative load on each processor. This results in significant decoupling of constraints on each processor, without losing its capability to find a schedulable solution. Finally, we show, how each of these parts fit into our overall methodology, using our previous results for single processor systems.

• 대한가정학회지
• /
• 제44권11호
• /
• pp.117-131
• /
• 2006

The purpose of this study was to verify a Structural Equation Model that constructed the causations among the structural leisure constraints, interpersonal leisure constraints, intrapersonal leisure constraints, leisure motivation, leisure activity participation, leisure satisfaction and the quality of life from the ecological perspective. The respondents were 301 elderly people residing in 4 free institutionalized elderly homes in Seoul. The data were analyzed by confirmatory factor analysis and covariance structure analysis using USREL 8.0 ver. The major results are summarized as follows: 1) Statistically, a goodness of fit is good of structural equation model presented in the study. 2) The structural leisure constraints and the interpersonal leisure constraints are some types of leisure environment of the aged in public homes from the ecological perspective. Such constraints would inevitably lead to a direct effect on individual leisure life and leisure motivation. 3) The important valuable factor which affected the leisure satisfaction and the quality of life in the elderly was the leisure motivation.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.187-190
• /
• 2003

Many manufacturing companies consider the integrated and concurrent scheduling because they need the global optimization technology that could manufacture various products more responsive to customer needs. In this paper, we propose an advanced scheduling model to generate the schedules considering resource constraints and precedence constraints in make-to-order (MTO) manufacturing environments. Precedence of work- in-process(WIP) and resources constraints have recently emerged as one of the main constraints in advanced scheduling problems. The advanced scheduling problems is formulated as a multiobjective mathematical model for generating operation schedules which are obeyed resources constraints, alternative workstations of operations and the precedence constraints of WIP in MTO manufacturing. For effectively solving the advanced scheduling problem, the multi-objective hybrid genetic algorithm (m-hGA) is proposed in this paper. The m-hGA is to minimize the makespan, total flow time of order, and maximum tardiness for each order, simultaneously. The m-hGA approach with local search-based mutation through swap mutation is developed to solve the advanced scheduling problem. Numerical example is tested and presented for advanced scheduling problems with various orders to describe the performance of the proposed m-hGA.

• 한국멀티미디어학회논문지
• /
• 제10권12호
• /
• pp.1741-1751
• /
• 2007

The imprecise computation technique ensures that all time-critical tasks produce their results before their deadlines by trading off the quality of the results for the computation time requirements of the tasks. In the imprecise computation, most scheduling problems of satisfying both 0/1 constraints and timing constraints, while the total error is minimized, are NP-complete when the optional tasks have arbitrary processing times. In the previous studies, the reasonable strategies of scheduling tasks with the 0/1 constraints on uniprocessors and multiprocessors for minimizing the total error are proposed. But, these algorithms are all off-line algorithms. Then, in the on-line scheduling, NORA(No Off-line tasks and on-line tasks Ready upon Arrival) algorithm can find a schedule with the minimum total error. In NORA algorithm, EDF(Earliest Deadline First) strategy is adopted in the scheduling of optional tasks. On the other hand, for the task system with 0/1 constraints, NORA algorithm may not suitable any more for minimizing total error of the imprecise tasks. Therefore, in this paper, an on-line algorithm is proposed to minimize total error for the imprecise real-time task system with 0/1 constraints. This algorithm is suitable for the imprecise on-line system with 0/1 constraints. Next, to evaluate performance of this algorithm, a series of experiments are done. As a consequence of the performance comparison, it has been concluded that IOSMTE(Imprecise On-line Scheduling to Minimize Total Error) algorithm proposed in this paper outperforms LOF(Longest Optional First) strategy and SOF(Shortest Optional First) strategy for the most cases.

• 경영과학
• /
• 제32권1호
• /
• pp.15-33
• /
• 2015

Under complete information, introducing additional constraints to a portfolio will have a negative impact on performance. However, real-life investments inevitably involve use of error-prone estimations, such as expected stock returns. In addition to the reality of incomplete data, investments of most Korean domestic equity funds are regulated externally by the government, as well as internally, resulting in limited maximum investment allocation to single stocks and risk free assets. This paper presents an investment framework, which takes such real-life situations into account, based on a newly developed portfolio selection model considering realistic constraints under incomplete information. Additionally, we examined the effects of additional constraints on portfolio's performance under incomplete information, taking the well-known Samsung and SK group stocks as performance benchmarks during the period beginning from the launch of each commercial fund, 2005 and 2007 respectively, up to 2013. The empirical study shows that an investment model, built under incomplete information with additional constraints, outperformed a model built without any constraints, and benchmarks, in terms of rate of return, standard deviation of returns, and Sharpe ratio.