[en] In this paper, two simple non-contact and cost-effective methods to acquire data in the student laboratory are applied to investigate the motion of a torsion pendulum. The first method is based on a Hall sensor, while the second makes use of an optical mouse

[en] In the evolution of cooperation, the motion of players plays an important role. In this paper, we incorporate, into an evolutionary prisoner dilemma's game on networks, a new factor that cooperators and defectors move with different probabilities. By investigating the dependence of the cooperator frequency on the moving probabilities of cooperators and defectors, μ_c and μ_d, we find that cooperation is greatly enhanced in the parameter regime of μ_c<μ_d. The snapshots of strategy pattern and the evolutions of cooperator clusters and defector clusters reveal that either the fast motion of defectors or the slow motion of cooperators always favors the formation of large cooperator clusters. The model is investigated on different types of networks such as square lattices, Erdoes-Renyi networks and scale-free networks and with different types of strategy-updating rules such as the richest-following rule and the Fermi rule. The numerical results show that the observed phenomena are robust to different networks and to different strategy-updating rules.

[en] Highlights: ► Introducing probabilistic strategies instead of the pure C/D in the PDG. ► The strategies patterns depends on interaction structures and updating rules. ► There exists an optimal increment of the probabilistic strategy. - Abstract: In this work, we investigate an evolutionary prisoner’s dilemma game in structured populations with probabilistic strategies instead of the pure strategies of cooperation and defection. We explore the model in details by considering different strategy update rules and different population structures. We find that the distribution of probabilistic strategies patterns is dependent on both the interaction structures and the updating rules. We also find that, when an individual updates her strategy by increasing or decreasing her probabilistic strategy a certain amount towards that of her opponent, there exists an optimal increment of the probabilistic strategy at which the cooperator frequency reaches its maximum.

[en] In reality, migration of an individual usually correlates with the individual's financial or social status. Here, we consider the situation where migration of a player depends on the player's payoff to an evolutionary prisoner's dilemma game. When the mobility of a player is positively correlated with the player's normalized payoff, P_i, where the mobility of player i is defined as μ_i=P_i^α, we found that cooperation could be promoted strongly in the case of a high density of players because of the introduction of this kind of migration. Moreover, the system could reach a state of complete cooperation in a large region on the given parameter space. Interestingly, enhancement of cooperation shows a non-monotonic behavior with an increase in α. We also found that the positive effects of this kind of migration on cooperation are robust in the face of changes to the network structure and the strategy-updating rule. In addition, we consider another situation where the mobility of a player is anti-correlated with the player's normalized payoff, and we observe that cooperation enhancement still exists.

[en] We investigate the evolutionary prisoner's dilemma game in structured populations by introducing dimers, which are defined as that two players in each dimer always hold a same strategy. We find that influences of dimers on cooperation depend on the type of dimers and the population structure. For those dimers in which players interact with each other, the cooperation level increases with the number of dimers though the cooperation improvement level depends on the type of network structures. On the other hand, the dimers, in which there are not mutual interactions, will not do any good to the cooperation level in a single community, but interestingly, will improve the cooperation level in a population with two communities. We explore the relationship between dimers and self-interactions and find that the effects of dimers are similar to that of self-interactions. Also, we find that the dimers, which are established over two communities in a multi-community network, act as one type of interaction through which information between communities is communicated by the requirement that two players in a dimer hold a same strategy. (general)

[en] A one-way coupled spatiotemporally chaotic map lattice is used to construct cryptosystem. With the combinatorial applications of both chaotic computations and conventional algebraic operations, our system has optimal cryptographic properties much better than the separative applications of known chaotic and conventional methods. We have realized experiments to practice duplex voice secure communications in realistic Wired Public Switched Telephone Network by applying our chaotic system and the system of Advanced Encryption Standard (AES), respectively, for cryptography. Our system can work stably against strong channel noise when AES fails to work