5,858 research outputs found
Building up the “Accountable Ulysses” model. The impact of GDPR and national implementations, ethics, and health-data research: Comparative remarks.
The paper illustrates obligations emerging under articles 9 and 89 of the EU Reg. 2016/679 (General Data Protection Regulation, hereinafter “GDPR”) within the health-related data pro- cessing for research purposes. Furthermore, through a comparative analysis of the national implementations of the GDPR on the topic, the paper highlights few practical issues that the researcher might deal with while accomplishing the GDPR obligations and the other ethical requirements. The result of the analyses allows to build up a model to achieve an acceptable standard of accountability in health-related data research. The legal remarks are framed within the myth of Ulysse
Dynamical effects of interactions and the Tully-Fisher relation for Hickson compact groups
We investigate the properties of the B-band Tully-Fisher (T-F) relation for
25 compact group galaxies, using Vmax derived from 2-D velocity maps. Our main
result is that the majority of the Hickson Compact Group galaxies lie on the
T-F relation. However, about 20% of the galaxies, including the lowest-mass
systems, have higher B luminosities for a given mass, or alternatively, a mass
which is too low for their luminosities. We favour a scenario in which outliers
have been brightened due to either enhanced star formation or merging.
Alternatively, the T-F outliers may have undergone truncation of their dark
halo due to interactions. It is possible that in some cases, both effects
contribute. The fact that the B-band T-F relation is similar for compact group
and field galaxies tells us that these galaxies show common mass-to-size
relations and that the halos of compact group galaxies have not been
significantly stripped inside R25. We find that 75% of the compact group
galaxies studied (22 out of 29) have highly peculiar velocity fields.
Nevertheless, a careful choice of inclination, position angle and center,
obtained from the velocity field, and an average of the velocities over a large
sector of the galaxy enabled the determination of fairly well-behaved rotation
curves for the galaxies. However, two of the compact group galaxies which are
the most massive members in M51--like pairs, HCG 91a and HCG 96a, have very
asymmetric rotation curves, with one arm rising and the other one falling,
indicating, most probably, a recent perturbation by the small close companions.Comment: 15 pages, 4 figures, accepted for publication in the Astronomical
Journa
The Hardness of Finding Linear Ranking Functions for Lasso Programs
Finding whether a linear-constraint loop has a linear ranking function is an
important key to understanding the loop behavior, proving its termination and
establishing iteration bounds. If no preconditions are provided, the decision
problem is known to be in coNP when variables range over the integers and in
PTIME for the rational numbers, or real numbers. Here we show that deciding
whether a linear-constraint loop with a precondition, specifically with
partially-specified input, has a linear ranking function is EXPSPACE-hard over
the integers, and PSPACE-hard over the rationals. The precise complexity of
these decision problems is yet unknown. The EXPSPACE lower bound is derived
from the reachability problem for Petri nets (equivalently, Vector Addition
Systems), and possibly indicates an even stronger lower bound (subject to open
problems in VAS theory). The lower bound for the rationals follows from a novel
simulation of Boolean programs. Lower bounds are also given for the problem of
deciding if a linear ranking-function supported by a particular form of
inductive invariant exists. For loops over integers, the problem is PSPACE-hard
for convex polyhedral invariants and EXPSPACE-hard for downward-closed sets of
natural numbers as invariants.Comment: In Proceedings GandALF 2014, arXiv:1408.5560. I thank the organizers
of the Dagstuhl Seminar 14141, "Reachability Problems for Infinite-State
Systems", for the opportunity to present an early draft of this wor
On Decidable Growth-Rate Properties of Imperative Programs
In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple "core"
programming language - an imperative language with bounded loops, and
arithmetics limited to addition and multiplication - it was possible to decide
precisely whether a program had certain growth-rate properties, namely
polynomial (or linear) bounds on computed values, or on the running time.
This work emphasized the role of the core language in mitigating the
notorious undecidability of program properties, so that one deals with
decidable problems.
A natural and intriguing problem was whether more elements can be added to
the core language, improving its utility, while keeping the growth-rate
properties decidable. In particular, the method presented could not handle a
command that resets a variable to zero. This paper shows how to handle resets.
The analysis is given in a logical style (proof rules), and its complexity is
shown to be PSPACE-complete (in contrast, without resets, the problem was
PTIME). The analysis algorithm evolved from the previous solution in an
interesting way: focus was shifted from proving a bound to disproving it, and
the algorithm works top-down rather than bottom-up
A Comment on Budach's Mouse-in-an-Octant Problem
Budach's Mouse-in-an-Octant Problem (attributed to Lothar Budach in a 1980
article by van Emde Boas and Karpinski) concerns the behaviour of a very simple
finite-state machine ("the mouse") moving on the integer two-dimensional grid.
Its decidability is apparently still open. This note sketches a proof that an
extended version of the problem (a super-mouse) is undecidable.Comment: 3 pages, 2 bibliographic reference
- …