• The Korean Society of Law and Medicine
• /
• v.25 no.1
• /
• pp.149-192
• /
• 2024

People with mental illness are generally either unaware of their illness or unwilling to voluntarily seek treatment, which makes treatment difficult and the pain mainly passed on to their families. Accordingly, non-face-to-face treatment, in which the patient is diagnosed by interviews with the family and unannounced medication, in which medication is secretly administered through the family, can be performed, and this has been considered a necessary evil. Even considering realistic aspects such as the special nature of mental health care and families' suffer, not-informed treatment without consent violates not only medical laws, but also human rights of mentally ill patients. Above all, if the patient finds out about this late, the trust between the patient, family, and doctor is completely broken, and a treatment is absolutely refused. Japan's Chiba decision, which presents exceptional conditions for allowance might be a solution. However, it would not be a right solution, considering that it could lead to long-term unannounced medication and completely cut off treatment through therapeutic dialogue. Ultimately, it need to approach this problem and seek alternatives through restoration of therapeutic dialogue.

• 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.