This research explores how an existing analytic framework (the cognitive dimensions framework) for interactive digital design reflects knowledge relevant to exploring the design space. The work examines this idea through the analysis of the transcripts of three digital design collaborative workshops run as part of "Studying Professional Software Design"1. Expert deliberation within these worksh...

One of the questions frequently asked nowadays about model theory is whether it is still logic. The reason for asking the question is mainly that more and more of model theoretic research focuses on concrete mathematical fields, uses extensively their tools and attacks their inner problems. Nevertheless the logical roots in the case of model theoretic geometric stability theory are not only cle...

Introduction: cognitive biases might affect decision-making processes such as clinical reasoning and confirmation bias is among the most important ones. The use of strategies that stimulate deliberate reflection during diagnostic process seems to reduce availability bias, but its effect in reducing needs be evaluated.Aims: examine whether reduces increases accuracy orthopedic residents solving ...

Abstract In this work we examine a posteriori error control for post-processed approximations to elliptic boundary value problems. We introduce class of post-processing operator that “tweaks” wide variety existing techniques enable efficient and reliable bounds be proven. This ultimately results in optimal all manner reconstruction operators, including those superconverge. showcase our by apply...

We prove a conjecture of [3] giving a closed form formula for the norm of the Jack polynomials in superspace with respect to a certain scalar product. The proof is mainly combinatorial and relies on the explicit expression in terms of admissible tableaux of the non-symmetric Jack polynomials. In the final step of the proof appears an identity on weighted sums of partitions that we demonstrate u...

The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a mechanism for producing a classic-like description of them in terms of an effective variety of bivalent semantics; (ii) a mechanism for extracting, from the bival...