• 한국멀티미디어학회논문지
• /
• 제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.

• 천문학회보
• /
• 제36권1호
• /
• pp.46.1-46.1
• /
• 2011

New statistical method is proposed to coherently combine Baryon Acoustic Oscillation statistics (BAO) and peculiar velocity measurements exploiting decomposed density--density and velocity--velocity spectra in real space from the observed redshift distortions in redshift space, 1) to achieve stronger dark energy constraints, sigma(w)=0.06 and sigma(w_a)=0.20, which are enhanced from BAO or velocity measurements alone, and 2) to cross--check consistency of dark energy constraints from two different approaches; BAO as geometrical measurements and peculiar velocity as large scale structure formation observables.

• Asian Journal of Business Environment
• /
• 제9권1호
• /
• pp.21-28
• /
• 2019

Purpose - The purpose of this paper is to investigate the relationship between corporate social responsibility disclosure (CSRD) and investment-cash flow sensitivity, which is a surrogate for financing constraints. Research design, data, and methodology - Taking China's A-share listed companies between 2009 and 2016 as a sample, this paper empirically tests the relationship between CSRD and investment-cash flow sensitivity by Panel VAR model. By introducing the orthogonal impulse response function, this paper distinguishes the fundamental factors and financial ones that affect corporate investment behavior. Results - Findings indicate that: (1) investment-cash flow sensitivity of firms with low level of CSRD is significantly lower than that of firms with high level of CSRD; (2) the orthogonal impulse response of corporate investment to cash flow in firms with high level of CSRD is significantly different from zero, but it is not significant in firms with low level of CSRD; (3) for firms with low level of CSRD, 0.7% of corporate investment volatility can be explained by the change in cash flow, which is lower than that of firms with high level of CSRD (1.1%). Conclusions - Corporations disclosing more and higher quality CSRD are often those faced with financing constraints. Voluntary disclosure can help them alleviate information asymmetry and financing constraints.

• 가정과삶의질연구
• /
• 제24권1호
• /
• pp.11-30
• /
• 2006

The purpose of this study was to verify a Structural Equation Model that constructed the causations among the leisure constraints, leisure. motivation, and leisure participation. This model posits that constraints determine motivation to participation. Concretely, structural and interpersonal leisure constraints(contextual factors) will affect interpersonal leisure constraints in the light of ecological perspective. Also, leisure constraints will affect leisure motivation based on self-determination theory that may influence leisure participation indirectly. A survey questionnaire was administered to 301 elderly in an institution for the elderly. A measurement model and a structural equation model estimates by Maximum Likelihood method(ML method) utilizing LISREL 8.0 ver. The analysis showed that a goodness of fit is good of structural equation model presented in the study. And, all hypothesis adopted about causations among the leisure constraints, leisure motivation, leisure participation.

• 산업경영시스템학회지
• /
• 제38권4호
• /
• pp.64-71
• /
• 2015

In this paper, we present a multi-period 0-1 knapsack problem which has the cardinality constraints. Theoretically, the presented problem can be regarded as an extension of the multi-period 0-1 knapsack problem. In the multi-period 0-1 knapsack problem, there are n jobs to be performed during m periods. Each job has the execution time and its completion gives profit. All the n jobs are partitioned into m periods, and the jobs belong to i-th period may be performed not later than in the i-th period, i = 1, ${\cdots}$, m. The total production time for periods from 1 to i is given by $b_i$ for each i = 1, ${\cdots}$, m, and the objective is to maximize the total profit. In the extended problem, we can select a specified number of jobs from each of periods associated with the corresponding cardinality constraints. As the extended problem is NP-hard, the branch and bound method is preferable to solve it, and therefore it is important to have efficient procedures for solving its linear programming relaxed problem. So we intensively explore the LP relaxed problem and suggest a polynomial time algorithm. We first decompose the LP relaxed problem into m subproblems associated with each cardinality constraints. Then we identify some new properties based on the parametric analysis. Finally by exploiting the special structure of the LP relaxed problem, we develop an efficient algorithm for the LP relaxed problem. The developed algorithm has a worst case computational complexity of order max[$O(n^2logn)$, $O(mn^2)$] where m is the number of periods and n is the total number of jobs. We illustrate a numerical example.

• 한국체육학회지인문사회과학편
• /
• 제55권1호
• /
• pp.579-588
• /
• 2016

본 연구는 동계스포츠 참여자를 대상으로 여가촉진, 여가제약협상 및 진지한 여가의 인과관계를 규명하는데 목적이 있다. 연구의 목적을 달성하기 위해 경기, 강원지역에 위치한 스키장 4곳을 중심으로 활동하는 참여자를 모집단으로 선정하고 총 320명을 대상으로 설문조사를 실시하였다. 수집된 설문자료는 SPSS 21.0과 Amos 18.0 통계프로그램을 활용하여 분석한 결과는 다음과 같다. 첫째, 여가촉진, 여가제약협상 및 진지한 여가의 가설적 모형에 대한 모형적합도 검증을 실시한 결과 모형적합도가 적합기준을 충족하는 것으로 나타났다. 둘째, 여가촉진은 여가제약협상과 진지한 여가에 유의한 영향을 미치는 것으로 나타났으며, 여가제약협상은 진지한 여가에 유의한 영향을 미치는 것으로 나타났다. 검증결과 본 연구에서 제시한 가설은 모두 채택되었다. 여가촉진은 제한적 요소를 극복하고 참여를 유도하기 위한 행동적, 인식적 전략으로 여가활동에서 나타날 수 있는 부정적 상황을 제거하고 감소시키기 위한 제약협상노력을 촉진시키고, 여가참여의지를 높임으로서 지속적 참여를 계획하고 노력하는 진지한 여가 활동에 긍정적 효과를 나타내고 있다.

• 대한가정학회지
• /
• 제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.

• 융합신호처리학회논문지
• /
• 제3권3호
• /
• pp.1-5
• /
• 2002

본 논문에서는 실용적인 한국어 가격 문장인식기를 구성하기 위한 유한 상태 망(FSN)의 개선된 문법적인 구조를 제안한다. 기존에 제안된 가격 문장의 문법 제한은 실용적인 한국어 가격 문장의 인식을 위하여 문법 제한과 문법적인 구조를 수정해야 할 필요가 있다. 문법 제한은 실용적 관점에서 한국어 가격 문장의 세 번째와 네 번째 문법 제한을 개선하였다. 본 논문에서는 기존의 문법 제한을 개선하였고, FSN[1]의 문법적인 구조의 단점을 보완하였다. 개선된 문법적 구조의 성능평가를 위하여 FSN0, FSN-1, FSN-2의 세 가지 실험을 하여 평가하였다. 가격 문장의 인식결과, 단어 인식률은 FSN0, FSN1, FSN2의 경우에 각각 81.37%, 83.92%, 85.49%의 성능을 보였다. 또한 문장 인식률은 FSN0, FSN1, FSN2의 경우에 각각 35%, 45%, 52%의 성능을 보였다.

• 한국경영과학회지
• /
• 제17권1호
• /
• pp.55-65
• /
• 1992

There are takes performed on only one side (right side or left side) of the assembly line, and task groups in which the tasks are more related to one another like a subassembly. In the Assembly Line Balancing (ALB) of the large-sized product such as bus and truck, the side on which tasks are performed and the related task groups should be considered to improve work methods and to appropriately lay out parts and facilities in the line. In this paper, presented are the 0-1 programming formulations for the ALB with the constraints of assigning the same side tasks to the station. The objective of minimizing the number of stations is combined with the objective that the total number of the related task groups handled by all the stations is minimized. Also, proposed are the methods of reducing the number of variables and constraints, and of determining the station to which subassembly tasks are assigned.

• Journal of the Korean Statistical Society
• /
• 제8권2호
• /
• pp.107-109
• /
• 1979

Consider a linear model with n observations and k explanatory variables: (1)b $y=X\beta+u, u\simN(0,\sigma^2I_n)$. We assume that the model satisfies the ideal conditions. Consider the general linear constraints on regression coefficient vector: (2) $R\beta=r$, where R and r are known matrices of orders $q\timesk$ and q\times1$ respectively, and the rank of R is $qk+q$.