Matching Recall and Storage in Sequence Learning with Spiking Neural Networks

Storing and recalling spiking sequences is a general problem the brain needs to solve. It is, however, unclear what type of biologically plausible learning rule is suited to learn a wide class of spatiotemporal activity patterns in a robust way. Here we consider a recurrent network of stochastic spiking neurons composed of both visible and hidden neurons. We derive a generic learning rule that is matched to the neural dynamics by minimizing an upper bound on the Kullback–Leibler divergence from the target distribution to the model distribution. The derived learning rule is consistent with spike-timing dependent plasticity in that a presynaptic spike preceding a postsynaptic spike elicits potentiation while otherwise depression emerges. Furthermore, the learning rule for synapses that target visible neurons can be matched to the recently proposed voltage-triplet rule. The learning rule for synapses that target hidden neurons is modulated by a global factor, which shares properties with astrocytes and gives rise to testable predictions.

Search for microscopic black holes and string balls in final states with leptons and jets with the ATLAS detector at √s = 8 TeV

A search for an excess of events with multiple high transverse momentum objects including charged leptons and jets is presented, using 20.3 fb−1 of proton-proton collision data recorded by the ATLAS detector at the Large Hadron Collider in 2012 at a centre-of-mass energy of √s = 8TeV. No excess of events beyond Standard Model expectations is observed. Using extra-dimensional models for black hole and string ball production and decay, exclusion contours are determined as a function of the mass threshold for production and the fundamental gravity scale for two, four and six extra dimensions. For six extra dimensions, mass thresholds of 4.8–6.2TeV are excluded at 95% confidence level, depending on the fundamental gravity scale and model assumptions. Upper limits on the fiducial cross-sections for non-Standard Model production of these final states are set.

Matching Social and Ecological Systems in Complex Ocean Fisheries

This paper considers ocean fisheries as complex adaptive systems and addresses the question of how human institutions might be best matched to their structure and function. Ocean ecosystems operate at multiple scales, but the management of fisheries tends to be aimed at a single species considered at a single broad scale. The paper argues that this mismatch of ecological and management scale makes it difficult to address the fine-scale aspects of ocean ecosystems, and leads to fishing rights and strategies that tend to erode the underlying structure of populations and the system itself. A successful transition to ecosystem-based management will require institutions better able to economize on the acquisition of feedback about the impact of human activities. This is likely to be achieved by multiscale institutions whose organization mirrors the spatial organization of the ecosystem and whose communications occur through a polycentric network. Better feedback will allow the exploration of fine-scale science and the employment of fine-scale fishing restraints, better adapted to the behavior of fish and habitat. The scale and scope of individual fishing rights also needs to be congruent with the spatial structure of the ecosystem. Place-based rights can be expected to create a longer private planning horizon as well as stronger incentives for the private and public acquisition of system relevant knowledge.

Preference Structure and Random Paths to Stability in Matching Markets

This paper examines how preference correlation and intercorrelation combine to influence the length of a decentralized matching market's path to stability. In simulated experiments, marriage markets with various preference specifications begin at an arbitrary matching of couples and proceed toward stability via the random mechanism proposed by Roth and Vande Vate (1990). The results of these experiments reveal that fundamental preference characteristics are critical in predicting how long the market will take to reach a stable matching. In particular, intercorrelation and correlation are shown to have an exponential impact on the number of blocking pairs that must be randomly satisfied before stability is attained. The magnitude of the impact is dramatically different, however, depending on whether preferences are positively or negatively intercorrelated.

Google Analytics & CONTENTdm: Harness Up Your Repository Metrics

A demonstration of the installation and use of Google Analytics with CONTENTdm in order to better gather metrics and insight into both general and specific online traffic across such digital repositories. Issues addressed will include collection-level traffic, digital object-level traffic, general site referrals to the repository, specific referrals to the repository, search engine referrals, user keywords, traffic occurring inside and/or outside an institution’s own network, reporting options.

Marriage Matching with Correlated Preferences

Authors of experimental, empirical, theoretical and computational studies of two-sided matching markets have recognized the importance of correlated preferences. We develop a general method for the study of the effect of correlation of preferences on the outcomes generated by two-sided matching mechanisms. We then illustrate our method by using it to quantify the effect of correlation of preferences on satisfaction with the men-propose Gale-Shapley matching for a simple one-to-one matching problem.

Marriage Matching and Intercorrelation of Preferences

Men's and women's preferences are intercorrelated to the extent that men rank highly those women who rank them highly. Intercorrelation plays an important but overlooked role in determining outcomes of matching mechanisms. We study via simulation the effect of intercorrelated preferences on men's and women's aggregate satisfaction with the outcome of the Gale-Shapley matching mechanism. We conclude with an application of our results to the student admission matching problem.