We introduce a new protocol for prediction with expert advice in which each expert evaluates the learner’s and his own performance using a loss function that may change over time and may be different from the loss functions used by the other experts. The learner’s goal is to perform better or not much worse than each expert, as evaluated by that expert, for all experts simultaneously. If the lo...

414 CMAJ, March 19, 2013, 185(5) © 2013 Canadian Medical Association or its licensors A 34-year-old man who has sex with men and has a remote history of primary syphilis presents to his primary care physician with painful urination and a purulent urethral discharge. He received unprotected oral sex from a new sexual partner 3 weeks ago. Two weeks before his current visit, he presented to a walk...

How people maintain and repair their self-esteem has been a topic of widespread interest. In this article, the authors ask, What determines whether people will use direct, remedial actions, or defensive actions? In three studies, they tested the hypothesis that a belief in fixed intelligence (entity theory) would produce defensiveness, whereas a belief in improvable intelligence (incremental th...

Abstract Defence cases with an escalatory structure, in which the levels of violence between aggressor and defender start out as minor then become major, even lethal, raise sharp problems for defence theory, our understanding conditions defence: proportionality, necessity, imminence. It is argued here that defenders are not morally required to withdraw from participation these cases, defensive ...

A defensive k-alliance in a graph G = (V, E) is a set of vertices A ⊆ V such that for every vertex v ∈ A, the number of neighbors v has in A is at least k more than the number of neighbors it has in V − A (k is a measure of the strength of alliance). In this paper, we deal with two types of sets associated with defensive k-alliances; maximum defensive k-alliance free and minimum defensive k-all...