• Title/Summary/Keyword: 0/1 constraint

Search Result 170, Processing Time 0.03 seconds

An On-line Algorithm to Search Minimum Total Error for Imprecise Real-time Tasks with 0/1 Constraint

  • Song Gi-Hyeon
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.12
    • /
    • pp.1589-1596
    • /
    • 2005
  • The imprecise real-time system provides flexibility in scheduling time-critical tasks. Most scheduling problems of satisfying both 0/1 constraint and timing constraints, while the total error is minimized, are NP complete when the optional tasks have arbitrary processing times. Liu suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on uniprocessors for minimizing the total error. Song et al suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on multiprocessors for minimizing the total error. But, these algorithms are all off-line algorithms. On the other hand, in the case of on line scheduling, Shih and Liu proposed the NORA algorithm which can find a schedule with the minimum total error for a task system consisting solely of on-line tasks that are ready upon arrival. But, for the task system with 0/1 constraint, it has not been known whether the NORA algorithm can be optimal or not in the sense that it guarantees all mandatory tasks are completed by their deadlines and the total error is minimized. So, this paper suggests an optimal algorithm to search minimum total error for the imprecise on-line real-time task system with 0/1 constraint. Furthermore, the proposed algorithm has the same complexity, O(N log N), as the NORA algorithm, where N is the number of tasks.

  • PDF

Constraint-based fracture mechanics analysis of cylinders with internal circumferential cracks

  • Bach, Michael;Wang, Xin
    • Structural Engineering and Mechanics
    • /
    • v.47 no.1
    • /
    • pp.131-147
    • /
    • 2013
  • In this paper, constraint-based fracture mechanics analyses of hollow cylinders with internal circumferential crack under tensile loading are conducted. Finite element analyses of the cracked cylinders are carried out to determine the fracture parameters including elastic T-stresses, and fully-plastic J-integrals. Linear elastic finite element analysis is conducted to obtain the T-stresses, and elastic-plastic analysis is conducted to obtain the fully plastic J-integrals. A wide range of cylinder geometries are studied, with cylinder radius ratios of $r_i/r_o$ = 0.2 to 0.8 and crack depth ratio a/t = 0.2 to 0.8. Fully plastic J-integrals are obtained for Ramberg-Osgood power law hardening material of n = 3, 5 and 10. These fracture parameters are then used to construct conventional and constraint-based failure assessment diagrams (FADs) to determine the maximum load carrying capacity of cracked cylinders. It is demonstrated that these tensile loaded cylinders with circumferential cracks are under low constraint conditions, and the load carrying capacity are higher when the low constraint effects are properly accounted for, using constraint-based FADs, comparing to the predictions from the conventional FADs.

A Heuristic Scheduling Algorithm for Reducing the Total Error of an Imprecise Multiprocessor System with 0/1 Constraint

  • Song, Ki-Hyun;Park, Kyung-Hee;Park, Seung-Kyu;Park, Dug-Kyoo;Yun, Kyong-Ok
    • Journal of Electrical Engineering and information Science
    • /
    • v.2 no.6
    • /
    • pp.1-6
    • /
    • 1997
  • The scheduling problem of satisfying both 0/1 constraint and the timing constraint while minimizing the total error is NP-complete when the optional parts have arbitrary processing times. In this paper, we present a heuristic scheduling algorithm for 0/1 constraint imprecise systems which consist of communicating tasks running on multiple processors. The algorithm is based on the program graph which is similar to the one presented in[4]. To check the schedulability, we apply Lawler and Moore's theorem. To analyze the performance of the proposed algorithm, intensive simulation is done. The results of the simulation shows that the longest processing first selection strategy outperforms random or minimal laxity policies.

  • PDF

An Algorithm for the Concave Minimization Problem under 0-1 Knapsack Constraint (0-1 배낭 제약식을 갖는 오목 함수 최소화 문제의 해법)

  • Oh, S.H.;Chung, S.J.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.19 no.2
    • /
    • pp.3-13
    • /
    • 1993
  • In this study, we develop a B & B type algorithm for the concave minimization problem with 0-1 knapsack constraint. Our algorithm reformulates the original problem into the singly linearly constrained concave minimization problem by relaxing 0-1 integer constraint in order to get a lower bound. But this relaxed problem is the concave minimization problem known as NP-hard. Thus the linear function that underestimates the concave objective function over the given domain set is introduced. The introduction of this function bears the following important meanings. Firstly, we can efficiently calculate the lower bound of the optimal object value using the conventional convex optimization methods. Secondly, the above linear function like the concave objective function generates the vertices of the relaxed solution set of the subproblem, which is used to update the upper bound. The fact that the linear underestimating function is uniquely determined over a given simplex enables us to fix underestimating function by considering the simplex containing the relaxed solution set. The initial containing simplex that is the intersection of the linear constraint and the nonnegative orthant is sequentially partitioned into the subsimplices which are related to subproblems.

  • PDF

An Efficient Algorithm to Minimize Total Error of the Imprecise Real Time Tasks with 0/1 Constraint (0/1 제약조건을 갖는 부정확한 실시간 태스크들의 총오류를 최소화시키는 효율적인 알고리즘)

  • Song, Gi-Hyeon
    • Journal of the Korea Computer Industry Society
    • /
    • v.7 no.4
    • /
    • pp.309-320
    • /
    • 2006
  • The imprecise real-time system provides flexibility in scheduling time-critical tasks. Most scheduling problems of satisfying both 0/1 constraint and timing constraints, while the total error is minimized, are NP-complete when the optional tasks have arbitrary processing times. Liu suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on uniprocessors for minimizing the total error. Song et al suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on multiprocessors for minimizing the total error. But, these algorithms are all off-line algorithms. In the online scheduling, NORA algorithm can find a schedule with the minimum total error for the imprecise online task system. In the NORA algorithm, the EDF strategy is adopted in the optional scheduling.<중략> The algorithm, proposed in this paper, can be applied to some applications efficiently such as radar tracking, image processing, missile control and so on.

  • PDF

The Effects of Action Observation Combined with Modified Constraint-induced Movement Therapy on Upper-extremity Function of Subacute Stroke Patients with Moderate Impairment -A Single-blinded Randomized Controlled Trial-

  • Bang, Dae-Hyouk;Lee, Soon-Hyun
    • PNF and Movement
    • /
    • v.18 no.1
    • /
    • pp.23-34
    • /
    • 2020
  • Purpose: To explore the effects of action observation combined with modified constraint-induced movement therapy on upper-extremity function and the activities of daily living in subacute stroke patients. Methods: Twenty-four subacute stroke patients were randomly assigned to the experimental group or the control group (n = 12 each). Both groups received therapy based on motor learning concepts, including repetitive and task-specific practice. The experimental group watched video clips for 10 minutes related to tasks performed during modified constraint-induced movement therapy while the control group watched videos unrelated to upper-extremity movement. These programs were performed for 40 minutes a day five times a week for four weeks. Their scores on the Fugl-Meyer assessment of upper extremities (FMA-UE), the action research arm test (ARAT), a motor activity log (amount of use [AOU] and quality of movement [QOM]), and the modified Barthel index (MBI) were recorded. Results: In both groups, all variables were significantly different between the pre-test and post-test periods (p < 0.05). The post-test variables were significantly different within each group (p < 0.05). In the experimental group, the changes between pre-test and post-test scores in the FMA-UE (14.39 ± 4.31 versus 6.31 ± 4.63), the ARAT (16.00 ± 4.73 versus 11.46 ± 3.73), MAL-AOU (1.57 ± 0.15 versus 1.18 ± 0.28), and MBI (27.54 ± 4.65 versus 18.08 ± 8.52) were significantly higher than those of the control group (p < 0.05). Conclusion: These findings suggest that action observation combined with modified constraint-induced movement therapy may be a beneficial rehabilitation option to improve upper-extremity function in subacute stroke patients with moderate impairment.

Numerical method to impose constraint conditions in phase transformation (상변태의 구속 조건을 부가하기 위한 수치 방법)

  • Yang, Seung-Yong;Goo, Byeong-Choon
    • Proceedings of the KSME Conference
    • /
    • 2004.04a
    • /
    • pp.706-709
    • /
    • 2004
  • A numerical method was developed that imposes constraint condition on the order parameters in martensitic phase transformation. In the method, an amplitude function having values of 1 or 0 was multiplied to transformation rates. The merit of the method is that the imposition of the constraint condition is more straightforward than a method with Lagrangian multiplier and easy to implement in the tangent modulus method. The developed method is applied to three-dimensional finite element analyses of single and poly crystalline shape memory alloys.

  • PDF

Evaluation of the Plastic Region Using Recrystallization Heat Treatment for Constraint Effect with STS 316L (STS 316L의 재결정 열처리법을 이용한 구속효과 평가)

  • Han, Min-Su;Jang, Seok-Ki
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.33 no.4
    • /
    • pp.539-544
    • /
    • 2009
  • The constraint effect $A_2$ has to be evaluated within plastic region near crack tip front using opening displacement. Plastic boundary and stress or strain conditions in the vicinity of the crack tip using recrystallization heat treatment was represented. It was found that the plastic deformation boundary by recrystallization heat treatment method was the true strain of ${\epsilon}t$ = 0.05mm/mm. With the estimation of constraint effects $A_2$, the region of proper displacement measurement point near crack tip was between 0mm and 1mm distance toward direction of crack propagation, and was between 1mm to 3mm distance toward direction of load line.

An Improved Online Algorithm to Minimize Total Error of the Imprecise Tasks with 0/1 Constraint (0/1 제약조건을 갖는 부정확한 태스크들의 총오류를 최소화시키기 위한 개선된 온라인 알고리즘)

  • Song, Gi-Hyeon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.10
    • /
    • pp.493-501
    • /
    • 2007
  • The imprecise real-time system provides flexibility in scheduling time-critical tasks. Most scheduling problems of satisfying both 0/1 constraint and timing constraints, while the total error is minimized, are NP-complete when the optional tasks have arbitrary processing times. Liu suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on uniprocessors for minimizing the total error. Song et at suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on multiprocessors for minimizing the total error. But, these algorithms are all off-line algorithms. In the online scheduling, the NORA algorithm can find a schedule with the minimum total error for the imprecise online task system. In NORA algorithm, EDF strategy is adopted in the optional scheduling. On the other hand, for the task system with 0/1 constraint, EDF_Scheduling may not be optimal in the sense that the total error is minimized. Furthermore, when the optional tasks are scheduled in the ascending order of their required processing times, NORA algorithm which EDF strategy is adopted may not produce minimum total error. Therefore, in this paper, an online algorithm is proposed to minimize total error for the imprecise task system with 0/1 constraint. Then, to compare the performance between the proposed algorithm and NORA algorithm, a series of experiments are performed. As a conseqence of the performance comparison between two algorithms, it has been concluded that the proposed algorithm can produce similar total error to NORA algorithm when the optional tasks are scheduled in the random order of their required processing times but, the proposed algorithm can produce less total error than NORA algorithm especially when the optional tasks are scheduled in the ascending order of their required processing times.

A Study on the Fracture Behavior of a Crack in 9% Ni Steel Considering Constraint Effect (구속효과를 고려한 9% Ni강 균열의 파괴거동 해석에 관한 연구)

  • Kim, Young Kyun;Yoon, Ihn soo;Kim, Jae Hoon
    • Journal of the Korean Institute of Gas
    • /
    • v.25 no.6
    • /
    • pp.14-21
    • /
    • 2021
  • Inner shell material of LNG storage tanks that store ultra-low temperature LNG at -162℃ requires structural integrity assessment of a crack-like defect. From the viewpoint of conventional fracture mechanics, the assessment has mainly performed by single parameter using stress intensity factor K, J-integral and CTOD. However, the stresses in a material of crack tip are not unique caused by constraint loss due to size and geometry of the structure. Various attempts have been made to complement a single parameter fracture mechanics, typically with Q-stress. In this paper, we have performed a two-parameter approach by deriving the Q-stress coupling with J-integral suitable for the evaluation of the crack tip stress field in the non-linear elastic region. A quantitative evaluation of the constraint effect has performed by using the J-Q approach. It was evaluated that the SENB type specimen had a crack ratio of 0.1 to 0.7 and the wide type specimen had a crack ratio of 0.2 to 0.6.