Mammal distribution in the Alamogordo region, New Mexico

http://deepblue.lib.umich.edu/bitstream/2027.42/56652/1/OP213.pd

Description of two new pocket mice and a new woodrat from New Mexico

http://deepblue.lib.umich.edu/bitstream/2027.42/56642/1/OP203.pd

Variation in the wood-mouse, Peromyscus leucopus noveboracensis, in the northeastern United States

http://deepblue.lib.umich.edu/bitstream/2027.42/56791/1/OP352.pd

The land vertebrate associations of interior Alaska

http://deepblue.lib.umich.edu/bitstream/2027.42/56524/1/OP085.pd

Notes on Pacific Coast rabbits and pikas

http://deepblue.lib.umich.edu/bitstream/2027.42/56605/1/OP166.pd

Additional data on variation in the prairie deer-mouse, Peromyscus maniculatus bairdii

http://deepblue.lib.umich.edu/bitstream/2027.42/56790/1/OP351.pd

The mammals of Warren Woods, Berrien County, Michigan

http://deepblue.lib.umich.edu/bitstream/2027.42/56525/1/OP086.pd

Notes on the mammals of Gogebic and Ontonagon Counties, Michigan. 1920

http://deepblue.lib.umich.edu/bitstream/2027.42/56548/1/OP109.pd

Methodological and terminological issues in animal-assisted interventions: An umbrella review of systematic reviews

Recently, animal-assisted interventions (AAIs), which are defined as psychological, educational, and rehabilitation support activities, have become widespread in different contexts. For many years, they have been a subject of interest in the international scientific community and are at the center of an important discussion regarding their effectiveness and the most appropriate practices for their realization. We carried out an umbrella review (UR) of systematic reviews (SRs), created for the purpose of exploring the literature and aimed at deepening the terminological and methodological aspects of AAIs. It is created by exploring the online databases PubMed, Google Scholar, and Cochrane Library. The SRs present in the high-impact indexed search engines Web of Sciences and Scopus are selected. After screening, we selected 15 SRs that met the inclusion criteria. All papers complained of the poor quality of AAIs; some considered articles containing interventions that did not always correspond to the terminology they have explored and whose operating practices were not always comparable. This stresses the need for the development and consequent diffusion of not only operational protocols, but also research protocols which provide for the homogeneous use of universally recognized terminologies, thus facilitating the study, deepening, and comparison between the numerous experiences described

Progressive Transactional Memory in Time and Space

Transactional memory (TM) allows concurrent processes to organize sequences of operations on shared \emph{data items} into atomic transactions. A transaction may commit, in which case it appears to have executed sequentially or it may \emph{abort}, in which case no data item is updated. The TM programming paradigm emerged as an alternative to conventional fine-grained locking techniques, offering ease of programming and compositionality. Though typically themselves implemented using locks, TMs hide the inherent issues of lock-based synchronization behind a nice transactional programming interface. In this paper, we explore inherent time and space complexity of lock-based TMs, with a focus of the most popular class of \emph{progressive} lock-based TMs. We derive that a progressive TM might enforce a read-only transaction to perform a quadratic (in the number of the data items it reads) number of steps and access a linear number of distinct memory locations, closing the question of inherent cost of \emph{read validation} in TMs. We then show that the total number of \emph{remote memory references} (RMRs) that take place in an execution of a progressive TM in which $n$ concurrent processes perform transactions on a single data item might reach $\Omega(n \log n)$, which appears to be the first RMR complexity lower bound for transactional memory.Comment: Model of Transactional Memory identical with arXiv:1407.6876, arXiv:1502.0272