In theory, usability work is an important and well-integrated activity in developing software. In practice, collaboration on improving usability is ridden with challenges relating to conflicting professional goals, tight project schedules, and unclear usability findings. The authors study those challenges through 16 interviews with software developers, usability experts, and project managers. F...

In theory, usability work is an important and well-integrated activity in developing software. In practice, collaboration on improving usability is ridden with challenges relating to conflicting professional goals, tight project schedules, and unclear usability findings. The authors study those challenges through 16 interviews with software developers, usability experts, and project managers. F...

Fuzzy Cognitive Maps (FCM) are a promising approach for socio-ecological systems modelling. FCMs represent problem knowledge extracted from different stakeholders in the form of connected factors/variables with imprecise cause-effect relationships and many feedback loops. These typically large maps are condensed and aggregated to obtain a summary view of the system. However, representation, con...

An underrepresentation of stakeholder perspectives within urban health research arguably limits our understanding of what is a multi-dimensional and complex relationship between the built environment and health. By engaging a wide range of stakeholders using a participatory concept mapping approach, this study aimed to achieve a more holistic and nuanced understanding of the built environments ...

It is shown that for any set of disjoint line segments in the plane there exists a pointed binary encompassing tree, that is, a spanning tree on the segment endpoints that contains all input segments, has maximal degree three, and such that every vertex is incident to an angle greater than π. As a consequence, it follows that every set of disjoint line segments has a bounded degree pseudo-trian...

We show that for any set of disjoint line segments in the plane there exists a pointed binary encompassing tree T , that is, a spanning tree on the segment endpoints that contains all input segments, has maximum degree three, and every vertex v ∈ T is pointed, that is, v has an incident angle greater than π. Such a tree can be completed to a minimum pseudo-triangulation. In particular, it follo...

It is shown that every disconnected vertex-colored plane straight line graph with no isolated vertices can be augmented (by adding edges) into a connected plane straight line graph such that the new edges respect the coloring and the degree of every vertex increases by at most two. The upper bound for the increase of vertex degrees is best possible: there are input graphs that require the addit...

We consider tests of forecast encompassing for probability forecasts, for both quadratic and logarithmic scoring rules. We propose test statistics for the null of forecast encompassing, present the limiting distributions of the test statistics, and investigate the impact of estimating the forecasting models’ parameters on these distributions. The small-sample performance is investigated, in ter...