Gottingen : Dieterich, 1843.

Breslau : Preuss & Junger, 1897.

Jena : Fischer, 1904.

Leipzig : T.O. Weigel, 1859.

Hull : Andrews, 1896.

Paris : Librarie des sciences médicales de Just Rouvier et E. Le Bouvier, 1836.

[London] : Chapman and Hall, [1877]

London : J. Churchill, 1864.

Stuttgart : In Kommission: Wissenschaftliche Verlagsgesellschaft, 2019.

Rockville, Maryland : National Institute on Drug Abuse, 1986.

Rockville, Maryland : National Institute on Drug Abuse, 1980.

Washington, D.C. : Wynne Associates, 1974.

One of the common tasks in unsupervised learning is dimensionality reduction, where the goal is to find meaningful low-dimensional structures hidden in high-dimensional data. Sometimes referred to as manifold learning, this problem is closely related to the problem of localization, which aims at embedding a weighted graph into a low-dimensional Euclidean space. Several methods have been proposed for localization, and also manifold learning. Nonetheless, the robustness property of most of them is little understood. In this paper, we obtain perturbation bounds for classical scaling and trilateration, which are then applied to derive performance bounds for Isomap, Landmark Isomap, and Maximum Variance Unfolding. A new perturbation bound for procrustes analysis plays a key role.

In statistical learning framework with regressions, interactions are the contributions to the response variable from the products of the explanatory variables. In high-dimensional problems, detecting interactions is challenging due to combinatorial complexity and limited data information. We consider detecting interactions by exploring their connections with the principal Hessian matrix. Specifically, we propose a one-step synthetic approach for estimating the principal Hessian matrix by a penalized M-estimator. An alternating direction method of multipliers (ADMM) is proposed to efficiently solve the encountered regularized optimization problem. Based on the sparse estimator, we detect the interactions by identifying its nonzero components. Our method directly targets at the interactions, and it requires no structural assumption on the hierarchy of the interactions effects. We show that our estimator is theoretically valid, computationally efficient, and practically useful for detecting the interactions in a broad spectrum of scenarios.

Durba Bhattacharya, Sourabh Bhattacharya.

Source: Brazilian Journal of Probability and Statistics, Volume 34, Number 1, 71--89.

Abstract:
Present day bio-medical research is pointing towards the fact that cognizance of gene–environment interactions along with genetic interactions may help prevent or detain the onset of many complex diseases like cardiovascular disease, cancer, type2 diabetes, autism or asthma by adjustments to lifestyle. In this regard, we propose a Bayesian semiparametric model to detect not only the roles of genes and their interactions, but also the possible influence of environmental variables on the genes in case-control studies. Our model also accounts for the unknown number of genetic sub-populations via finite mixtures composed of Dirichlet processes. An effective parallel computing methodology, developed by us harnesses the power of parallel processing technology to increase the efficiencies of our conditionally independent Gibbs sampling and Transformation based MCMC (TMCMC) methods. Applications of our model and methods to simulation studies with biologically realistic genotype datasets and a real, case-control based genotype dataset on early onset of myocardial infarction (MI) have yielded quite interesting results beside providing some insights into the differential effect of gender on MI.

Jere Koskela, Paul A. Jenkins, Adam M. Johansen, Dario Spanò.

Source: The Annals of Statistics, Volume 48, Number 1, 560--583.

Abstract:
We study weighted particle systems in which new generations are resampled from current particles with probabilities proportional to their weights. This covers a broad class of sequential Monte Carlo (SMC) methods, widely-used in applied statistics and cognate disciplines. We consider the genealogical tree embedded into such particle systems, and identify conditions, as well as an appropriate time-scaling, under which they converge to the Kingman $n$-coalescent in the infinite system size limit in the sense of finite-dimensional distributions. Thus, the tractable $n$-coalescent can be used to predict the shape and size of SMC genealogies, as we illustrate by characterising the limiting mean and variance of the tree height. SMC genealogies are known to be connected to algorithm performance, so that our results are likely to have applications in the design of new methods as well. Our conditions for convergence are strong, but we show by simulation that they do not appear to be necessary.

Mohamad Elmasri, Maxwell J. Farrell, T. Jonathan Davies, David A. Stephens.

Source: The Annals of Applied Statistics, Volume 14, Number 1, 221--240.

Abstract:
Identifying undocumented or potential future interactions among species is a challenge facing modern ecologists. Recent link prediction methods rely on trait data; however, large species interaction databases are typically sparse and covariates are limited to only a fraction of species. On the other hand, evolutionary relationships, encoded as phylogenetic trees, can act as proxies for underlying traits and historical patterns of parasite sharing among hosts. We show that, using a network-based conditional model, phylogenetic information provides strong predictive power in a recently published global database of host-parasite interactions. By scaling the phylogeny using an evolutionary model, our method allows for biological interpretation often missing from latent variable models. To further improve on the phylogeny-only model, we combine a hierarchical Bayesian latent score framework for bipartite graphs that accounts for the number of interactions per species with host dependence informed by phylogeny. Combining the two information sources yields significant improvement in predictive accuracy over each of the submodels alone. As many interaction networks are constructed from presence-only data, we extend the model by integrating a correction mechanism for missing interactions which proves valuable in reducing uncertainty in unobserved interactions.

Qiwei Li, Xinlei Wang, Faming Liang, Guanghua Xiao.

Source: The Annals of Applied Statistics, Volume 13, Number 3, 1708--1732.

Abstract:
With the advance of imaging technology, digital pathology imaging of tumor tissue slides is becoming a routine clinical procedure for cancer diagnosis. This process produces massive imaging data that capture histological details in high resolution. Recent developments in deep-learning methods have enabled us to identify and classify individual cells from digital pathology images at large scale. Reliable statistical approaches to model the spatial pattern of cells can provide new insight into tumor progression and shed light on the biological mechanisms of cancer. We consider the problem of modeling spatial correlations among three commonly seen cells observed in tumor pathology images. A novel geostatistical marking model with interpretable underlying parameters is proposed in a Bayesian framework. We use auxiliary variable MCMC algorithms to sample from the posterior distribution with an intractable normalizing constant. We demonstrate how this model-based analysis can lead to sharper inferences than ordinary exploratory analyses, by means of application to three benchmark datasets and a case study on the pathology images of $188$ lung cancer patients. The case study shows that the spatial correlation between tumor and stromal cells predicts patient prognosis. This statistical methodology not only presents a new model for characterizing spatial correlations in a multitype spatial point pattern conditioning on the locations of the points, but also provides a new perspective for understanding the role of cell–cell interactions in cancer progression.

Giacomo Aletti, Irene Crimaldi, Andrea Ghiglietti.

Source: Bernoulli, Volume 26, Number 2, 1098--1138.

Abstract:
This work deals with a system of interacting reinforced stochastic processes , where each process $X^{j}=(X_{n,j})_{n}$ is located at a vertex $j$ of a finite weighted directed graph, and it can be interpreted as the sequence of “actions” adopted by an agent $j$ of the network. The interaction among the dynamics of these processes depends on the weighted adjacency matrix $W$ associated to the underlying graph: indeed, the probability that an agent $j$ chooses a certain action depends on its personal “inclination” $Z_{n,j}$ and on the inclinations $Z_{n,h}$, with $h eq j$, of the other agents according to the entries of $W$. The best known example of reinforced stochastic process is the Pólya urn. The present paper focuses on the weighted empirical means $N_{n,j}=sum_{k=1}^{n}q_{n,k}X_{k,j}$, since, for example, the current experience is more important than the past one in reinforced learning. Their almost sure synchronization and some central limit theorems in the sense of stable convergence are proven. The new approach with weighted means highlights the key points in proving some recent results for the personal inclinations $Z^{j}=(Z_{n,j})_{n}$ and for the empirical means $overline{X}^{j}=(sum_{k=1}^{n}X_{k,j}/n)_{n}$ given in recent papers (e.g. Aletti, Crimaldi and Ghiglietti (2019), Ann. Appl. Probab. 27 (2017) 3787–3844, Crimaldi et al. Stochastic Process. Appl. 129 (2019) 70–101). In fact, with a more sophisticated decomposition of the considered processes, we can understand how the different convergence rates of the involved stochastic processes combine. From an application point of view, we provide confidence intervals for the common limit inclination of the agents and a test statistics to make inference on the matrix $W$, based on the weighted empirical means. In particular, we answer a research question posed in Aletti, Crimaldi and Ghiglietti (2019).

The Round Rock Independent School District in Texas is looking for a digital curriculum and blended learning program. Baltimore is looking for a comprehensive high school literacy program.

The post Austin-Area District Looks for Digital/Blended Learning Program; Baltimore Seeks High School Literacy Program appeared first on Market Brief.

Quan Zhou, Yongtao Guan.

Source: Bayesian Analysis, Volume 14, Number 2, 573--594.

Abstract:
Bayesian variable selection regression (BVSR) is able to jointly analyze genome-wide genetic datasets, but the slow computation via Markov chain Monte Carlo (MCMC) hampered its wide-spread usage. Here we present a novel iterative method to solve a special class of linear systems, which can increase the speed of the BVSR model-fitting tenfold. The iterative method hinges on the complex factorization of the sum of two matrices and the solution path resides in the complex domain (instead of the real domain). Compared to the Gauss-Seidel method, the complex factorization converges almost instantaneously and its error is several magnitude smaller than that of the Gauss-Seidel method. More importantly, the error is always within the pre-specified precision while the Gauss-Seidel method is not. For large problems with thousands of covariates, the complex factorization is 10–100 times faster than either the Gauss-Seidel method or the direct method via the Cholesky decomposition. In BVSR, one needs to repetitively solve large penalized regression systems whose design matrices only change slightly between adjacent MCMC steps. This slight change in design matrix enables the adaptation of the iterative complex factorization method. The computational innovation will facilitate the wide-spread use of BVSR in reanalyzing genome-wide association datasets.

Stephanie McMains
Jan 12, 2011; 31:587-597
BehavioralSystemsCognitive

M Niethammer
Apr 1, 1996; 16:2157-2163
Articles

EL Bienenstock
Jan 1, 1982; 2:32-48
Articles

Jamie D. Roitman
Nov 1, 2002; 22:9475-9489
Behavioral

Endogenous neuropeptide Y (NPY) and corticotrophin-releasing factor (CRF) modulate the responses of the basolateral amygdala (BLA) to stress and are associated with the development of stress resilience and vulnerability, respectively. We characterized persistent effects of repeated NPY and CRF treatment on the structure and function of BLA principal neurons in a novel organotypic slice culture (OTC) model of male rat BLA, and examined the contributions of specific NPY receptor subtypes to these neural and behavioral effects. In BLA principal neurons within the OTCs, repeated NPY treatment caused persistent attenuation of excitatory input and induced dendritic hypotrophy via Y₅ receptor activation; conversely, CRF increased excitatory input and induced hypertrophy of BLA principal neurons. Repeated treatment of OTCs with NPY followed by an identical treatment with CRF, or vice versa, inhibited or reversed all structural changes in OTCs. These structural responses to NPY or CRF required calcineurin or CaMKII, respectively. Finally, repeated intra-BLA injections of NPY or a Y₅ receptor agonist increased social interaction, a validated behavior for anxiety, and recapitulated structural changes in BLA neurons seen in OTCs, while a Y₅ receptor antagonist prevented NPY's effects both on behavior and on structure. These results implicate the Y₅ receptor in the long-term, anxiolytic-like effects of NPY in the BLA, consistent with an intrinsic role in stress buffering, and highlight a remarkable mechanism by which BLA neurons may adapt to different levels of stress. Moreover, BLA OTCs offer a robust model to study mechanisms associated with resilience and vulnerability to stress in BLA.

SIGNIFICANCE STATEMENT Within the basolateral amygdala (BLA), neuropeptide Y (NPY) is associated with buffering the neural stress response induced by corticotropin releasing factor, and promoting stress resilience. We used a novel organotypic slice culture model of BLA, complemented with in vivo studies, to examine the cellular mechanisms associated with the actions of NPY. In organotypic slice cultures, repeated NPY treatment reduces the complexity of the dendritic extent of anxiogenic BLA principal neurons, making them less excitable. NPY, via activation of Y5 receptors, additionally inhibits and reverses the increases in dendritic extent and excitability induced by the stress hormone, corticotropin releasing factor. This NPY-mediated neuroplasticity indicates that resilience or vulnerability to stress may thus involve neuropeptide-mediated dendritic remodeling in BLA principal neurons.

In the days before his death, the New York man spoke often of his lost twin and the lessons humanity seemed not to have learned

The last time Charlene Chiddenton saw her father in person was on March 7 — visitor restrictions at long-term care homes during the pandemic had kept them apart — and less than two months later, she was saying goodbye to her father by video call.

Decorate a guitar, skateboard, or bike to help veterans, foster children  AZFamily

Veteran forward Kelly Babstock signed with the new Toronto franchise of the National Women's Hockey League on Saturday. The two-time all-star has 27 goals and 60 points in 65 games over four seasons.

The Toronto Maple Leafs have signed Finnish defenceman Mikko Lehtonen to a one-year, entry-level contract for the 2020-21 season, the club announced Monday.

Central Bank of Chile Working Papers by Tomás Gómez, Alejandro Jara and David Moreno

Bus4Life is OM’s mobile missions centre to the unreached people of Central and Eastern Europe, bringing books and also participating in summer programmes, as it did in summer 2017.

A BIOTECH veteran has hailed a Glasgow firm that claims to have discovered two separate potential treatments for Covid-19 patients for use before they are put on ventilators.

IT was on board a supply ship which had docked in the port of Marseille that Barney Roberts learned the news that the war was over.

It dates back to1885 and started out as a fund to help military families at home while the Second Expeditionary Force set sail for Egypt. Major James Gildea wrote a letter appealing for money and a fund was set up to provide allowances.

The free literacy app Khan Academy Kids boosted early literacy skills in children and parents said it improved their home-teaching skills.