A simple algorithm for the adaptation of scores and power behavior of the corresponding rank test

The purpose of this paper is twofold:On one hand we want to give a very simple algorithm for evaluating a special rank estimator of the type given in Behnen, Neuhaus, and Ruymgaart (1983) for the approximate optimal choice of the scores-generating function of a two-sample linear rank test for the general testing problem H_o:F=G versus H₁:F ≤ G, F ≠ G, in order to demonstrate that the corresponding adaptive rank statistic is simple enough for practical applications. On the other hand we prove the asymptotic normality of the adaptive rank statistic under H (leading to approximate critical values) and demonstrate the adaptive behavior of the corresponding rank test by a Monte Carlo power simulation for sample sizes as low as m=10, n=10.     

Intersensory Perception at Birth: Newborns Match Nonhuman Primate Faces and Voices

Previous studies have shown that infants, including newborns, can match previously unseen and unheard human faces and vocalizations. More recently, it has been reported that infants as young as 4 months of age also can match the faces and vocalizations of other species raising the possibility that such broad multisensory perceptual tuning is present at birth. To test this possiblity, we investigated whether newborns can match monkey facial and vocal gestures. Using a paired preference procedure, in Experiment 1 we presented pairs of different visible monkey calls in silence and then in the presence of one or the other corresponding audible call and compared preferences across the silent and in‐sound conditions. In Experiment 2 , we presented the same monkey visible calls but this time together with a tone analog of the natural calls in the in‐sound trials. We found that newborns looked longer at the matching visible call in the in‐sound condition than in the silent condition in both experiments. These findings indicate that multisensory perceptual tuning is so broad at birth that it enables newborns to integrate the facial and vocal gestures of other primates and that integration is based on newborns’ detection of audio‐visual temporal synchrony relations.     

On the Ghoudi,Khoudraji, and Rivest test for extreme‐value dependence

Ghoudi, Khoudraji & Rivest [The Canadian Journal of Statistics 1998;26:187–197] showed how to test whether the dependence structure of a pair of continuous random variables is characterized by an extreme‐value copula. The test is based on a U‐statistic whose finite‐ and large‐sample variance are determined by the present authors. They propose estimates of this variance which they compare to the jackknife estimate of Ghoudi, Khoudraji & Rivest ( 1998 ) through simulations. They study the finite‐sample and asymptotic power of the test under various alternatives. They illustrate their approach using financial and geological data. The Canadian Journal of Statistics © 2009 Statistical Society of Canada     

On vertex-parity edge-colorings

A vertex signature \(\pi \) of a finite graph G is any mapping \(\pi \,{:}\,V(G)\rightarrow \{0,1\}\). An edge-coloring of G is said to be vertex-parity for the pair \((G,\pi )\) if for every vertex v each color used on the edges incident to v appears in parity accordance with \(\pi \), i.e. an even or odd number of times depending on whether \(\pi (v)\) equals 0 or 1, respectively. The minimum number of colors for which \((G,\pi )\) admits such an edge-coloring is denoted by \(\chi '_p(G,\pi )\). We characterize the existence and prove that \(\chi '_p(G,\pi )\) is at most 6. Furthermore, we give a structural characterization of the pairs \((G,\pi )\) for which \(\chi '_p(G,\pi )=5\) and \(\chi '_p(G,\pi )=6\). In the last part of the paper, we consider a weaker version of the coloring, where it suffices that at every vertex, at least one color appears in parity accordance with \(\pi \). We show that the corresponding chromatic index is at most 3 and give a complete characterization for it.     

Broadcasting multiple messages in the 1-in port model in optimal time

In the 1-in port model, every vertex of a synchronous network can receive at most one message in each time unit. We consider simultaneous broadcasting of multiple messages from the same source or from distinct sources in such networks with an additional restriction that every received message can be sent out to neighbors only in the next time unit and never to already informed vertex. We use a general concept of level-disjoint partitions developed for this scenario. Here we introduce a subgraph extension technique for efficient spreading information within this concept. Surprisingly, this approach with so called biwheels leads to simultaneous broadcasting of optimal number of messages on a wide class of graphs in optimal time. In particular, we provide tight results for bipartite tori, meshes, hypercubes, Knödel graphs, circulant graphs. We also propose several open problems and conjectures.     

The Experience of Learning EFT in Spanish-speaking Countries: A Multi-National Replication Study

This study is a multi-national follow-up to the original (Sandberg and Knestel (2011) Journal of Marital and Family Therapy, 37, 393–410) article on the process of learning Emotionally Focused Couples Therapy (EFT). A total of 102 clinicians from nine Spanish-speaking countries (Mexico, Costa Rica, Guatemala, Spain, Colombia, Argentina, Chile, Ecuador, and El Salvador) participated in the study. A comparison of results across the two studies revealed more similarities than differences. However, a few notable differences emerged from responses to qualitative questions, namely a heightened sense of appreciation for and resonance with the focus on core emotion in EFT and less frequent reports of difficulty learning and adapting to the model among Spanish-speaking therapists. These differences were consistent with common cultural values and forms of expression in Latin America and Spain. Results are discussed in terms of training, supervision, and future research as well.