Which sexual abuse victims receive a forensic medical examination? : The impact of Children\u27s Advocacy Centers

Abstract Objective This study examines the impact of Children\u27s Advocacy Centers (CAC) and other factors, such as the child\u27s age, alleged penetration, and injury on the use of forensic medical examinations as part of the response to reported child sexual abuse. Methods This analysis is part of a quasi-experimental study, the Multi-Site Evaluation of Children\u27s Advocacy Centers, which evaluated four CACs relative to within-state non-CAC comparison communities. Case abstractors collected data on forensic medical exams in 1,220 child sexual abuse cases through review of case records. Results Suspected sexual abuse victims at CACs were two times more likely to have forensic medical examinations than those seen at comparison communities, controlling for other variables. Girls, children with reported penetration, victims who were physically injured while being abused, White victims, and younger children were more likely to have exams, controlling for other variables. Non-penetration cases at CACs were four times more likely to receive exams as compared to those in comparison communities. About half of exams were conducted the same day as the reported abuse in both CAC and comparison communities. The majority of caregivers were very satisfied with the medical professional. Receipt of a medical exam was not associated with offenders being charged. Conclusions Results of this study suggest that CACs are an effective tool for furthering access to forensic medical examinations for child sexual abuse victims

Microscopic derivation of Frenkel excitons in second quantization

Starting from the microscopic hamiltonian describing free electrons in a periodic lattice, we derive the hamiltonian appropriate to Frenkel excitons. This is done through a grouping of terms different from the one leading to Wannier excitons. This grouping makes appearing the atomic states as a relevant basis to describe Frenkel excitons in the second quantization. Using them, we derive the Frenkel exciton creation operators as well as the commutators which rule these operators and which make the Frenkel excitons differing from elementary bosons. The main goal of the present paper is to provide the necessary grounds for future works on Frenkel exciton many-body effects, with the composite nature of these particles treated exactly through a procedure similar to the one we have recently developed for Wannier excitons.Comment: 16 pages, 4 figure

Polycyclic aromatic hydrocarbons in residential dust: sources of variability.

BackgroundThere is interest in using residential dust to estimate human exposure to environmental contaminants.ObjectivesWe aimed to characterize the sources of variability for polycyclic aromatic hydrocarbons (PAHs) in residential dust and provide guidance for investigators who plan to use residential dust to assess exposure to PAHs.MethodsWe collected repeat dust samples from 293 households in the Northern California Childhood Leukemia Study during two sampling rounds (from 2001 through 2007 and during 2010) using household vacuum cleaners, and measured 12 PAHs using gas chromatography-mass spectrometry. We used a random- and a mixed-effects model for each PAH to apportion observed variance into four components and to identify sources of variability.ResultsMedian concentrations for individual PAHs ranged from 10 to 190 ng/g of dust. For each PAH, total variance was apportioned into regional variability (1-9%), intraregional between-household variability (24-48%), within-household variability over time (41-57%), and within-sample analytical variability (2-33%). Regional differences in PAH dust levels were associated with estimated ambient air concentrations of PAH. Intraregional differences between households were associated with the residential construction date and the smoking habits of residents. For some PAHs, a decreasing time trend explained a modest fraction of the within-household variability; however, most of the within-household variability was unaccounted for by our mixed-effects models. Within-household differences between sampling rounds were largest when the interval between dust sample collections was at least 6 years in duration.ConclusionsOur findings indicate that it may be feasible to use residential dust for retrospective assessment of PAH exposures in studies of health effects

Positive semidefinite matrix completion, universal rigidity and the Strong Arnold Property

This paper addresses the following three topics: positive semidefinite (psd) matrix completions, universal rigidity of frameworks, and the Strong Arnold Property (SAP). We show some strong connections among these topics, using semidefinite programming as unifying theme. Our main contribution is a sufficient condition for constructing partial psd matrices which admit a unique completion to a full psd matrix. Such partial matrices are an essential tool in the study of the Gram dimension \gd(G) of a graph G, a recently studied graph parameter related to the low psd matrix completion problem. Additionally, we derive an elementary proof of Connelly's sufficient condition for universal rigidity of tensegrity frameworks and we investigate the links between these two sufficient conditions. We also give a geometric characterization of psd matrices satisfying the Strong Arnold Property in terms of nondegeneracy of an associated semidefinite program, which we use to establish some links between the Gram dimension \gd(\cdot) and the Colin de Verdi\`ere type graph parameter ν=(⋅)

Positive semidefinite matrix completion, universal rigidity and the Strong Arnold Property

This paper addresses the following three topics: positive semidefinite (psd) matrix completions, universal rigidity of frameworks, and the Strong Arnold Property (SAP). We show some strong connections among these topics, using semidefinite programming as unifying theme. Our main contribution is a sufficient condition for constructing partial psd matrices which admit a unique completion to a full psd matrix. Such partial matrices are an essential tool in the study of the Gram dimension \gd(G) of a graph G, a recently studied graph parameter related to the low psd matrix completion problem. Additionally, we derive an elementary proof of Connelly's sufficient condition for universal rigidity of tensegrity frameworks and we investigate the links between these two sufficient conditions. We also give a geometric characterization of psd matrices satisfying the Strong Arnold Property in terms of nondegeneracy of an associated semidefinite program, which we use to establish some links between the Gram dimension \gd(\cdot) and the Colin de Verdi\`ere type graph parameter ν=(⋅)

A new graph parameter related to bounded rank positive semidefinite matrix completions.

The Gram dimension gd(G) of a graph G is the smallest inte- ger k ≥ 1 such that any partial real symmetric matrix, whose entries are specified on the diagonal and at the off-diagonal positions corresponding to edges of G, can be completed to a positive semidefinite matrix of rank at most k (assuming a positive semidefinite completion exists). For any fixed k the class of graphs satisfying gd(G) ≤ k is minor closed, hence it can characterized by a finite list of forbidden minors. We show that the only minimal forbidden minor is Kk+1 for k ≤ 3 and that there are two minimal forbidden minors: K5 and K2,2,2 for k = 4. We also show some close connections to Euclidean realizations of graphs and to the graph parameter ν=(G) of [21]. In particular, our characterization of the graphs with gd(G) ≤ 4 implies the forbidden minor characterization of the 3-realizable graphs of Belk and Connelly [8,9] and of the graphs with ν=(G) ≤ 4 of van der Holst [21]

Positive semidefinite matrix completion, universal rigidity and the Strong Arnold Property

This paper addresses the following three topics: positive semidefinite (psd) matrix completions, universal rigidity of frameworks, and the Strong Arnold Property (SAP). We show some strong connections among these topics, using semidefinite programming as unifying theme. Our main contribution is a sufficient condition for constructing partial psd matrices which admit a unique completion to a full psd matrix. Such partial matrices are an essential tool in the study of the Gram dimension \gd(G) of a graph G, a recently studied graph parameter related to the low psd matrix completion problem. Additionally, we derive an elementary proof of Connelly's sufficient condition for universal rigidity of tensegrity frameworks and we investigate the links between these two sufficient conditions. We also give a geometric characterization of psd matrices satisfying the Strong Arnold Property in terms of nondegeneracy of an associated semidefinite program, which we use to establish some links between the Gram dimension \gd(\cdot) and the Colin de Verdi\`ere type graph parameter ν=(⋅)

Positive semidefinite matrix completion, universal rigidity and the Strong Arnold Property

This paper addresses the following three topics: positive semidefinite (psd) matrix completions, universal rigidity of frameworks, and the Strong Arnold Property (SAP). We show some strong connections among these topics, using semidefinite programming as unifying theme. Our main contribution is a sufficient condition for constructing partial psd matrices which admit a unique completion to a full psd matrix. Such partial matrices are an essential tool in the study of the Gram dimension \gd(G) of a graph G, a recently studied graph parameter related to the low psd matrix completion problem. Additionally, we derive an elementary proof of Connelly's sufficient condition for universal rigidity of tensegrity frameworks and we investigate the links between these two sufficient conditions. We also give a geometric characterization of psd matrices satisfying the Strong Arnold Property in terms of nondegeneracy of an associated semidefinite program, which we use to establish some links between the Gram dimension \gd(\cdot) and the Colin de Verdi\`ere type graph parameter ν=(⋅)

On Leonid Gurvits's proof for permanents

We give a concise exposition of the elegant proof given recently by Leonid Gurvits for several lower bounds on permanents

Two-Cooper-pair problem and the Pauli exclusion principle

While the one-Cooper pair problem is now a textbook exercise, the energy of two pairs of electrons with opposite spins and zero total momentum has not been derived yet, the exact handling of Pauli blocking between bound pairs being not that easy for N=2 already. The two-Cooper pair problem however is quite enlightening to understand the very peculiar role played by the Pauli exclusion principle in superconductivity. Pauli blocking is known to drive the change from 1 to $N$ pairs, but no precise description of this continuous change has been given so far. Using Richardson procedure, we here show that Pauli blocking increases the free part of the two-pair ground state energy, but decreases the binding part when compared to two isolated pairs - the excitation gap to break a pair however increasing from one to two pairs. When extrapolated to the dense BCS regime, the decrease of the pair binding while the gap increases strongly indicates that, at odd with common belief, the average pair binding energy cannot be of the order of the gap.Comment: 9 pages, no figures, final versio