To investigate the mechanisms for the perception of relative numerosity, we used two-interval forced-choice (temporal 2AFC) to measure thresholds for area, density and numerosity differences between dot textures, and a 2×2 FC task to measure the ability of observers to distinguish changes in area from changes in density. To prevent the use of a one-dimensional size signal we used textures in wh...

The authors demonstrate that different NMDAR antagonists (ketamine and MK-801) have varying effects on spine density depending on dose, drug regimen, and brain region. While acute ketamine treatment increases cortical spine density in mice, subchronic exposure to either drug reduces spine density in both the cortex and striatum.

Spreading processes represent a very efficient tool to investigate the structural properties of networks and the relative importance of their constituents, and have been widely used to this aim in static networks. Here we consider simple disease spreading processes on empirical time-varying networks of contacts between individuals, and compare the effect of several immunization strategies on th...

We consider stochastic, time-varying transportation networks, where the arc weights (arc travel times) are random variables with probability distribution functions that vary with time. Efficient procedures are widely available for determining least time paths in deterministic networks. In stochastic but time-invariant networks, least expected time paths can be determined by setting each random ...

It has already been confirmed that the traffic in high-speed terrestrial network presents self-similarity, but there is little research on self-similarity of traffic in satellite network. Considering time-varying network topology and link status, this paper analyzes the aggregation and propagation of self-similar traffic between nodes in satellite network. Furthermore, a sort of special network...

We consider a wireless network consisting of multiple transmitters with multicast traffic destined for a set of receivers. We are interested in the problem of joint scheduling and rate control under two performance objectives; the objective of maximizing the total sum throughput of the network and of being proportionally fair with respect to the received rate at each receiver. We first consider...

Real-time information dissemination is essential for the success of key applications such as transportation management and battlefield monitoring. In these applications, relevant information should be disseminated to interested users in a timely fashion. However, it is challenging to support timely information dissemination due to the limited and even time-varying network bandwidth. Thus, a nai...

A well-known result of Ahlswede asserts that the determinis-tic code capacity of an arbitrarily varying channel (AVC), under the average error probability criterion, either equals its random code capacity or else is zero. A necessary and sufficient condition is identified for deciding between these alternatives, namely, the capacity is zero if and only if the AVC is symmetrizable. The capacity ...

We study the asymptotics of large simple graphs constrained by the limiting density of edges and the limiting subgraph density of an arbitrary fixed graph H. We prove that, for all but finitely many values of the edge density, if the density of H is constrained to be slightly higher than that for the corresponding Erdős-Rényi graph, the typical large graph is bipodal with parameters varying ana...