The Decision to Self-Regulate: A Comparative Study of Marinas in New England and the Netherlands

This research investigates the participation of marinas in the New England region of the United States, and in the Netherlands in environment self-regulation , while examining specific sources of influence on the decision to self-regulate. Environmental agencies in both countries have implemented industry specific self-regulatory programs, the Clean Marina Program, and the Blue Flag Program, to encourage marinas to implement best management practices, and reduce the environmental impacts of nonpoint source pollution.While traditional economic theory asserts that taking on environmental responsibilities beyond those required by law will jeopardize a business\u27 economic performance, many small businesses have chosen to self-regulate

Rate adaption using acknowledgement feedback in finite-state Markov channels with collisions

We investigate packet-by-packet rate adaptation so as to maximize the throughput. We consider a finite-state Markov channel (FSMC) with collisions, which models channel fading as well as collisions due to multi-user interference. To limit the amount of feedback data, we only use past packet acknowledgements (ACKs) and past rates as channel state information. The maximum achievable throughput is computationally prohibitive to determine, thus we employ a two-pronged approach. Firstly, we derive new upper bounds on the maximum achievable throughput, which are tighter than previously known ones. Secondly, we propose the particle-filter-based rate adaptation (PRA), which employs a particle filter to estimate the a posteriori channel distribution. The PRA can easily be implemented even when the number of available rates is large. Numerical studies show that the PRA performs within one dB of SNR to the proposed upper bounds for a slowly time-varying channel, even in the presence of multi-user interference

Translation and validation of the Dutch version of the Effective Consumer Scale (EC-17)

PURPOSE: The Effective Consumer Scale (EC-17) measures the skills of musculoskeletal patients in managing their own healthcare. The objectives of this study were to translate the EC-17 into Dutch and to further evaluate its psychometric properties. METHODS: The EC-17 was translated and cognitively pretested following cross-cultural adaptation guidelines. Two hundred and thirty-eight outpatients (52 % response rate) with osteoarthritis or fibromyalgia completed the EC-17 along with other validated measures. Three weeks later, 101 patients completed the EC-17 again. RESULTS: Confirmatory factor analysis supported the unidimensional structure of the scale. The items adequately fit the Rasch model and only one item demonstrated differential item functioning. Person reliability was high (0.92), but item difficulty levels tended to cluster around the middle of the scale, and measurement precision was highest for moderate and lower levels of skills. The scale demonstrated adequate test-retest reliability (ICC = 0.71), and correlations with other measures were largely as expected. CONCLUSION: The results supported the validity and reliability of the Dutch version of the EC-17, but suggest that the scale is best targeted at patients with relatively low levels of skills. Future studies should further examine its sensitivity to change in a clinical trial specifically aimed at improving effective consumer skills

Parameterized Complexity of Streaming Diameter and Connectivity Problems

We initiate the investigation of the parameterized complexity of Diameter and Connectivity in the streaming paradigm. On the positive end, we show that knowing a vertex cover of size k allows for algorithms in the Adjacency List (AL) streaming model whose number of passes is constant and memory is O(logn) for any fixed k. Underlying these algorithms is a method to execute a breadth-first search in O(k) passes and O(klogn) bits of memory. On the negative end, we show that many other parameters lead to lower bounds in the AL model, where Ω(n/p) bits of memory is needed for any p-pass algorithm even for constant parameter values. In particular, this holds for graphs with a known modulator (deletion set) of constant size to a graph that has no induced subgraph isomorphic to a fixed graph H, for most H. For some cases, we can also show one-pass, Ω(nlogn) bits of memory lower bounds. We also prove a much stronger Ω(n2/p) lower bound for Diameter on bipartite graphs. Finally, using the insights we developed into streaming parameterized graph exploration algorithms, we show a new streaming kernelization algorithm for computing a vertex cover of size k. This yields a kernel of 2k vertices (with O(k2) edges) produced as a stream in poly(k) passes and only O(klogn) bits of memory

Items and dimensions for the construction of a multidimensional computerized adaptive test to measure fatigue in patients with rheumatoid arthritis

Objectives Development of an item pool to construct a future computerized adaptive test (CAT) for fatigue in rheumatoid arthritis (RA). The item pool was based on the patients' perspective and examined for face and content validity previously. This study assessed the fit of the items with seven predefined dimensions and examined the item pool's dimensionality structure in statistical terms. Study Design and Setting A total of 551 patients with RA participated in this study. Several steps were conducted to come from an explorative item pool to a psychometrically sound item bank. The item response theory (IRT) analysis using the generalized partial credit model was conducted for each of the seven predefined dimensions. Poorly fitting items were removed. Finally, the best possible multidimensional IRT (MIRT) model for the data was identified. Results In IRT analysis, 49 items showed insufficient item characteristics. Items with a discriminative ability below 0.60 and/or model misfit effect sizes greater than 0.10 were removed. Factor analysis on the 196 remaining items revealed three dimensions, namely severity, impact, and variability of fatigue. The dimensions were further confirmed in MIRT model analysis. Conclusion This study provided an initially calibrated item bank and showed which dimensions and items can be used for the development of a multidimensional CAT for fatigue in R

Alternative oblique head CT scanning technique reduces bone artifact and improves interpretability of brainstem anatomy

Brainstem pathology due to infections, infarcts and tumors are common in developing countries, but neuroimaging technology in these resource-poor settings is often limited to single slice, and occasionally spiral, CT. Unlike multislice CT and MRI, single slice and spiral CT are compromised by bone artifacts in the posterior fossa due to the dense petrous bones, often making imaging of the brainstem non-diagnostic. With appropriate head positioning, the petrous ridges can be avoided with 40° sagittal oblique scans parallel to either petrous ridge. We describe an alternative sagittal oblique scanning technique that significantly reduces brainstem CT artifacts thereby improving clarity of anatomy. With Institutional Ethical approval, 13 adult patients were enrolled (5 males; 39%). All patients had routine axial brain CT and sagittal oblique scans with no lesions found. Images were read by 2 readers who gave a score for amount of artefact and clarity of structures in the posterior fossa. The mean artifact score was higher for routine axial images compared to sagittal oblique (2.92 vs. 1.23; P<0.0001). The mean anatomical certainty scores for the brainstem were significantly better in the sagittal oblique views compared to routine axial (1.23 vs. 2.77; P<0.0001). No difference was found between the two techniques with respect to the fourth ventricle or the cerebellum (axial vs. sag oblique: 1.15 vs. 1.27; P=0.37). When using single slice CT, the sagittal oblique scanning technique is valuable in improving clarity of anatomy in the brainstem if axial images are non-diagnostic due to bone artifacts

Comparing "challenge-based" and "code-based" internet voting verification implementations

Internet-enabled voting introduces an element of invisibility and unfamiliarity into the voting process, which makes it very different from traditional voting. Voters might be concerned about their vote being recorded correctly and included in the final tally. To mitigate mistrust, many Internet-enabled voting systems build verifiability into their systems. This allows voters to verify that their votes have been cast as intended, stored as cast and tallied as stored at the conclusion of the voting period. Verification implementations have not been universally successful, mostly due to voter difficulties using them. Here, we evaluate two cast as intended verification approaches in a lab study: (1) "Challenge-Based" and (2) "Code-Based". We assessed cast-as-intended vote verification efficacy, and identified usability issues related to verifying and/or vote casting. We also explored acceptance issues post-verification, to see whether our participants were willing to engage with Internet voting in a real election. Our study revealed the superiority of the code-based approach, in terms of ability to verify effectively. In terms of real-life Internet voting acceptance, convenience encourages acceptance, while security concerns and complexity might lead to rejection

The Parameterised Complexity of Integer Multicommodity Flow

The Integer Multicommodity Flow problem has been studied extensively in the literature. However, from a parameterised perspective, mostly special cases, such as the Disjoint Paths problem, have been considered. Therefore, we investigate the parameterised complexity of the general Integer Multicommodity Flow problem. We show that the decision version of this problem on directed graphs for a constant number of commodities, when the capacities are given in unary, is XNLP-complete with pathwidth as parameter and XALP-complete with treewidth as parameter. When the capacities are given in binary, the problem is NP-complete even for graphs of pathwidth at most 13. We give related results for undirected graphs. These results imply that the problem is unlikely to be fixed-parameter tractable by these parameters. In contrast, we show that the problem does become fixed-parameter tractable when weighted tree partition width (a variant of tree partition width for edge weighted graphs) is used as parameter