In this resolution, the AD is defined as: The set of wishes, previously and expressly manifested by the patient, about the care and treatment that he or she wants to receive when he or she is unable to freely and autonomously express their will [1]. It states that the individual may choose to record the medical treatments he or she does not wish to receive in certain situations in the future, t...

In this paper we aim to clarify that participants of conversation can predict whether an utterance includes grammatical terminal elements, which have been referred to as the utterance-final elements (UFEs) in Japanese. We carried out perceptual experiments with Japanese utterances missing a part close to their end. The results showed that subjects distinguished whether an UFE follows at the ver...

We discuss new measures in assessing the skill level of students based on their interactions with the Socratic homework tutor, MasteringPhysics. We show that the measurement of the difficulty of problems for a given student as determined by the time to first correct response, the number of incorrect responses without advice, and hints have high reliability (96%). As an immediate application, we...

Goal modeling in general, and i* in particular, are typically taught in specialized courses that are part of postgraduate programs. In this paper, we report on our experience concerning teaching i* and its basic, essential dialect called simple i* to over 130 first-year students of a bachelor degree in information science. We present the intended learning outcomes and activities, we introduce t...

We investigate existing and novel methods to approximate matrix functions using subspace methods. We analyze a two-sided harmonic Ritz approach and apply this to the extraction from a subspace for matrix functions. We derive all methods in various ways and provide a framework to fit in the techniques.

We will perform a reduction from the MIN-WEIGHT k-CLIQUE problem for k = p+ 2 to the VITERBI PATH problem. In the instance of the MIN-WEIGHT k-CLIQUE problem, we are given a k-partite graphG = (V1∪V2∪U1 . . .∪Up, E) such that |V1| = |V2| = n and |U1| = . . . = |Up| = m = Θ(n). We want to find a clique of minimum weight in the graph G. Before describing our final VITERBI PATH instance, we first ...