A rejoinder to "Psychotherapy research ethics: Continuing the debate on controlled clinical trials."

Responds to C. A. Heflinger's (1987) critique of the present authors (1986) by reiterating their concern for the principle of autonomy. The present authors note that all patients were fully informed about the research plan and their right to withdraw. Nonetheless, the ethical criticism offered by Heflinger regarding randomization cannot be entirely dismissed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Autoantibodies before, during and after administration of recombinant interferon-alpha for chronic viral hepatitis

This study was undertaken to investigate the presence of autoantibodies in patients with chronic viral hepatitis B and C, before, during and after interferon-alpha (IFN-alpha) therapy and to study their relation to dose and type of IFN-alpha and response to treatment. Fifty patients with chronic hepatitis were divided in two groups, a control-group of 21 patients (10 type B and 11 type C) who were followed for 6 months without treatment and an IFN-group consisting of 29 patients (8 type B and 21 type C) who received IFN therapy for 6 months. Serum samples were tested for a range of antibodies at the start of the study, during therapy and at the end of the 6 month period. Antibodies tested for included: antinuclear, smooth muscle, antimitochondrial, parietal cell and thyroid microsomal. Four (8%) of the total patient group had autoantibodies at the beginning of the study (two in each group). During the follow-up period no patient in the control group developed antibodies compared with 3 (11%) patients in the treatment group. Autoantibodies developed in patients treated with higher doses of IFN and were found in those patients who tended to show a poor response to IFN-therapy. Further studies are needed to establish the relationship between poor response to IFN-alpha and development of autoantibodies.     

The cortical regulation of lactogenesis and lactopoiesis

The mammary gland secretory activity, blood circulation, respiration, gas-energy exchange and feed efficiency were studied in cows of a strong (S) and weak (W) types of the nervous system. In the W cows, the lactating dominant was found to be weak, their mammary gland's secretory activity increased less obviously and was stabilised at a lower level than in the S cows.     

Applying the Collaborative Study Psychotherapy Rating Scale to rate therapist adherence in cognitive-behavior therapy, interpersonal therapy, and clinical management.

Adherence of therapists to behaviors specified in cognitive-behavior therapy, interpersonal therapy, and clinical management manuals was studied. Raters used the Collaborative Study Psychotherapy Rating Scale (CSPRS) to rate therapist adherence in each of 4 sessions from 180 patients in the treatment phase of the National Institute of Mental Health Treatment of Depression Collaboration Research Program. Results indicate that therapists exhibited more behaviors appropriate to their own respective treatment approaches than to other treatment approaches. In fact, the 3 treatments could be discriminated almost perfectly using the CSPRS. Analysis of the psychometric properties of the CSPRS revealed high interrater reliability and high internal consistency. However, a 5-component structure extracted from the intercorrelations of the CSPRS items was substantially different from a 5-factor structure found in an earlier study. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Distributed deterministic edge coloring using bounded neighborhood independence

We study the edge-coloring problem in the message-passing model of distributed computing. This is one of the most fundamental problems in this area. Currently, the best-known deterministic algorithms for (2Δ ?1)-edge-coloring requires O(Δ) +  log* n time (Panconesi and Rizzi in Distrib Comput 14(2):97–100, 2001), where Δ is the maximum degree of the input graph. Also, recent results of Barenboim and Elkin (2010) for vertex-coloring imply that one can get an O(Δ)-edge-coloring in ${O(\Delta^{\epsilon}\cdot \log n)}$ time, and an ${O(\Delta^{1 + \epsilon})}$ -edge-coloring in O(log Δ log n) time, for an arbitrarily small constant ${\epsilon > 0}$ . In this paper we devise a significantly faster deterministic edge-coloring algorithm. Specifically, our algorithm computes an O(Δ)-edge-coloring in ${O(\Delta^{\epsilon}) + \log* n}$ time, and an ${O(\Delta^{1 + \epsilon})}$ -edge-coloring in O(log Δ) +  log* n time. This result improves the state-of-the-art running time for deterministic edge-coloring with this number of colors in almost the entire range of maximum degree Δ. Moreover, it improves it exponentially in a wide range of Δ, specifically, for 2 ^Ω(log*n) ≤ Δ ≤ polylog(n). In addition, for small values of Δ (up to log^{1 - δ} n, for some fixed δ > 0) our deterministic algorithm outperforms all the existing randomized algorithms for this problem. Also, our algorithm is the first O(Δ)-edge-coloring algorithm that has running time o(Δ) + log* n, for the entire range of Δ. All previous (deterministic and randomized) O(Δ)-edge-coloring algorithms require ${\Omega(\min \{\Delta, \sqrt{\log n}\ \})}$ time. On our way to these results we study the vertex-coloring problem on graphs with bounded neighborhood independence. This is a large family of graphs, which strictly includes line graphs of r-hypergraphs (i.e., hypergraphs in which each hyperedge contains r or less vertices) for r =  O(1), and graphs of bounded growth. We devise a very fast deterministic algorithm for vertex-coloring graphs with bounded neighborhood independence. This algorithm directly gives rise to our edge-coloring algorithms, which apply to general graphs. Our main technical contribution is a subroutine that computes an O(Δ/p)-defective p-vertex coloring of graphs with bounded neighborhood independence in O(p ²) + log* n time, for a parameter p, 1 ≤ p ≤ Δ. In all previous efficient distributed routines for m-defective p-coloring the product m· p is super-linear in Δ. In our routine this product is linear in Δ, and this enables us to speed up the algorithm drastically.