Behaviors of susceptible-infected epidemics on scale-free networks with identical infectivity

In this article, we proposed a susceptible-infected model with identical infectivity, in which, at every time step, each node can only contact a constant number of neighbors. We implemented this model on scale-free networks, and found that the infected population grows in an exponential form with the time scale proportional to the spreading rate. Further more, by numerical simulation, we demonstrated that the targeted immunization of the present model is much less efficient than that of the standard susceptible-infected model. Finally, we investigated a fast spreading strategy when only local information is available. Different from the extensively studied path finding strategy, the strategy preferring small-degree nodes is more efficient than that preferring large-degree nodes. Our results indicate the existence of an essential relationship between network traffic and network epidemic on scale-free networks.Comment: 5 figures and 7 page

Efficient routing on complex networks

In this letter, we propose a new routing strategy to improve the transportation efficiency on complex networks. Instead of using the routing strategy for shortest path, we give a generalized routing algorithm to find the so-called {\it efficient path}, which considers the possible congestion in the nodes along actual paths. Since the nodes with largest degree are very susceptible to traffic congestion, an effective way to improve traffic and control congestion, as our new strategy, can be as redistributing traffic load in central nodes to other non-central nodes. Simulation results indicate that the network capability in processing traffic is improved more than 10 times by optimizing the efficient path, which is in good agreement with the analysis.Comment: 4 pages, 4 figure

Duplex quantum communication through a spin chain

Data multiplexing within a quantum computer can allow for the simultaneous transfer of multiple streams of information over a shared medium thereby minimizing the number of channels needed for requisite data transmission. Here, we investigate a two-way quantum communication protocol using a spin chain placed in an external magnetic field. In our scheme, Alice and Bob each play the role of a sender and a receiver as two states cos({\theta}1/2)|0> + sin({\theta}1/2)exp(i{\phi}1)|1>, cos({\theta}2/2)|0> + sin({\theta}2/2)exp(i{\phi}2)|1> are transferred through one channel simultaneously. We find that the transmission fidelity at each end of a spin chain can usually be enhanced by the presence of a second party. This is an important result for establishing the viability of duplex quantum communication through spin chain networks.Comment: 5 pages, 4 figure

Hot and repulsive traffic flow

We study a message passing model, applicable also to traffic problems. The model is implemented in a discrete lattice, where particles move towards their destination, with fluctuations around the minimal distance path. A repulsive interaction between particles is introduced in order to avoid the appearance of traffic jam. We have studied the parameter space finding regions of fluid traffic, and saturated ones, being separated by abrupt changes. The improvement of the system performance is also explored, by the introduction of a non-constant potential acting on the particles. Finally, we deal with the behavior of the system when temporary failures in the transmission occurs.Comment: 22 pages, uuencoded gzipped postscript file. 11 figures include

Computerized cognitive training in prostate cancer patients on androgen deprivation therapy: a pilot study

© 2017, Springer-Verlag GmbH Germany, part of Springer Nature. Purpose: Prostate cancer patients who have undergone androgen deprivation therapy (ADT) may experience cognitive impairment, yet there is an unmet need for nonpharmacological interventions to address cognitive impairment in this population. This study examines the feasibility, acceptability, and preliminary efficacy of a home-based computerized cognitive training (CCT) program to treat cancer-related cognitive impairment. Methods: Sixty men who had received ≥ 3 months of ADT were screened for at least mild cognitive or neurobehavioral impairment and randomized to 8 weeks of CCT or usual care. Follow-up assessments occurred immediately post-intervention or equivalent (T2) and 8 weeks later (T3). The acceptability of CCT was also assessed. Results: Feasibility:A priori feasibility thresholds were partially met (i.e., randomization rate \u3e 50%, retention rate \u3e 70% excluding CCT drop-outs, but \u3c 70% for intent-to-treat). Acceptability: Participants were mostly satisfied with CCT and found it somewhat enjoyable, though barriers to uptake existed. Preliminary efficacy: Linear mixed models indicated significant time by group effects favorable to CCT in reaction time (p =.01), but unfavorable to CCT in verbal and visual memory (ps \u3c .05). Memory was temporarily suppressed in the CCT group at T2, but normalized by T3. There was no effect of CCT on self-reported cognitive functioning, neurobehavioral functioning, nor quality of life. Conclusions: This study provides tentative support for the feasibility and acceptability of CCT to treat mild cognitive impairment in ADT patients. CCT had a beneficial effect on reaction time, but temporarily suppressed memory. CCT’s benefits may be limited to a narrow area of functioning. Larger-scale studies are needed

On the Particle Data Group evaluation of Psi' and chi_c Branching Ratios

I propose a new evaluation of $\psi'(2S)$ and $\chi_c(1P)$ branching ratios which avoids the correlations affecting the current Particle Data Group evaluation. These correlations explain the apparent technique-dependent discrepancies between the available determinations of the ${\cal B}(\chi_c(1P)\to p\bar p)$ and $\Gamma(\chi_c(1P)\to \gamma\gamma)$ under the hypotesis that the current values of the $\psi'(2S)\to\chi_c(1P)\gamma$ branching ratios are overestimated. In the process I also noticed that Particle Data Group has not restated many of the older measurements, when necessary, for the new value of ${\cal B}(J/\psi\to l^+l^-)$, which significantly affects the evaluation of some relevant $\psi'(2S)$ and $\chi_c(1P)$ exclusive branching ratios.Comment: 13 pages. Revised version. Submitted to Phys. Rev.

Priority diffusion model in lattices and complex networks

We introduce a model for diffusion of two classes of particles ($A$ and $B$) with priority: where both species are present in the same site the motion of $A$'s takes precedence over that of $B$'s. This describes realistic situations in wireless and communication networks. In regular lattices the diffusion of the two species is normal but the $B$ particles are significantly slower, due to the presence of the $A$ particles. From the fraction of sites where the $B$ particles can move freely, which we compute analytically, we derive the diffusion coefficients of the two species. In heterogeneous networks the fraction of sites where $B$ is free decreases exponentially with the degree of the sites. This, coupled with accumulation of particles in high-degree nodes leads to trapping of the low priority particles in scale-free networks.Comment: 5 pages, 3 figure