A statewide assessment was conducted of assaults, experiences, needs, and recommendations of 125 adult victims receiving care at 19 sexual assault centers (SACs) in the State of Maryland. More than one half of the victims (55.6%) waited years before disclosing, with delays in reporting especially likely if the assault was perpetrated by a family member (the most frequent perpetrators at 42.4% of respondents). About one half of the victims (51.3%) had been previously sexually assaulted, yet only 9% of these victims had sought treatment. The majority of respondents (69.4%) indicated they would not be filing charges against perpetrators, and of those who did, 46.2% reported dissatisfaction with the interview with police. Psychological symptoms such as depression and anxiety were the most common reasons for seeking care at the centers. Nearly all of respondents rated the care they received at the centers as very good or excellent. Respondents recommended more SACs, better advertising of their services, more mental health care within them (especially group therapy), and improved laws and law enforcement of perpetrators.

Graphics processing units (GPUs) are increasingly common in both safety-critical and high-performance computing (HPC) applications. Some current supercomputers are composed of thousands of GPUs so the probability of device corruption becomes very high. Moreover, the GPU's parallel capabilities are very attractive for the automotive and aerospace markets, where reliability is a serious concern. In this paper, the neutron sensitivity of the modern GPU caches, and internal resources are experimentally evaluated. Various Duplication With Comparison strategies to reduce GPU radiation sensitivity are then presented and validated through radiation experiments. Threads should be carefully duplicated to avoid undesired errors on shared resources and to avoid the exacerbation of errors in critical resources such as the scheduler.

No abstract

No abstract

No abstract

No abstract

No abstract

We get a B-ordering of all binary n-tuples V n by choosing an o:dered basis { y i , ...,yn} o f V n and ordering the n-tuples as follows: 0, y l , y2, y2+y1, y 3 , y 3 + y 1 , y3+y2, y3+y2+yi, y 4 , ... Given a minimum