Chinese Physics

In this paper, we propose a new approach to implementing boundary conditions in the lattice Boltzmann method (LBM). The basic idea is to decompose the distribution function at the boundary node into its equilibrium and non-equilibrium parts and then to approximate the non-equilibrium part with a first-order extrapolation of the non-equilibrium part of the distribution at the neighbouring fluid node. Schemes for velocity and pressure boundary conditions are constructed based on this method. The resulting schemes are of second-order accuracy. Numerical tests show that the numerical solutions of the LBM together with the present boundary schemes are in excellent agreement with the analytical solutions. Second-order convergence is also verified from the results. It is also found that the numerical stability of the present schemes is much better than that of the original extrapolation schemes proposed by Chen et al. (1996 Phys. Fluids 8 2527).

The surface energies for 38 surfaces of fcc metals Cu, Ag, Au, Ni, Pd, Pt, Al, Pb, Rh and Ir have been calculated by using the modified embedded-atom method. The results show that, for Cu, Ag, Ni, Al, Pb and Ir, the average values of the surface energies are very close to the polycrystalline experimental data. For all fcc metals, as predicted, the close-packed (111) surface has the lowest surface energy. The surface energies for the other surfaces increase linearly with increasing angle between the surfaces (hkl) and (111). This can be used to estimate the relative values of the surface energy.

The steady-state fluorescence spectrum characteristic of ethanol–water excimer has been studied in this paper. By analysing the features of the sharp emission spectrum with fine structures in a shortwave band and the characteristics of the broad and featureless fluorescence peaks in the longwave band, one can conclude that the excimers are formed between the new ethanol–water cluster molecules in the excited state and the ground state through the interaction among different chromophores. The excitation spectra in the two fluorescence bands have been studied, and their emission mechanisms have been ascertained based on the energy transfer theory. Furthermore, the critical distance of the resonance energy transfer has been calculated.

In this paper a scheme for quantum secure direct communication (QSDC) network is proposed with a sequence of polarized single photons. The single photons are prepared originally in the same state |0〉 by the servers on the network, which will reduce the difficulty for the legitimate users to check eavesdropping largely. The users code the information on the single photons with two unitary operations which do not change their measuring bases. Some decoy photons, which are produced by operating the sample photons with a Hadamard, are used for preventing a potentially dishonest server from eavesdropping the quantum lines freely. This scheme is an economical one as it is the easiest way for QSDC network communication securely.

By introducing the double complex scalar field, this paper constructs the double Lagrangian with the potential V(Φ(J), Φ*(J)) = V(|Φ(J)|), which not only can describe the evolution of quintom Universe, but also can naturally give the spintessence and hessence Universe. Furthermore, the U(1, J) symmetry of the double complex Lagrangian is verified, and the total conserved charge within the physical volume is derived by means of the Noëther theorem. Moreover, it can point out that the 'imaginary motion' of the angular parameter in Ref.[14], in fact, is only a real phase displacement in our model.

We investigate an evolutionary snowdrift game on a square N = L × L lattice with periodic boundary conditions, where a population of n₀ (n₀ ≤ N) players located on the sites of this lattice can either cooperate with or defect from their nearest neighbours. After each generation, every player moves with a certain probability p to one of the player's nearest empty sites. It is shown that, when p = 0, the cooperative behaviour can be enhanced in disordered structures. When p > 0, the effect of mobility on cooperation remarkably depends on the payoff parameter r and the density of individuals ρ (ρ = n₀/N). Compared with the results of p = 0, for small r, the persistence of cooperation is enhanced at not too small values of ρ; whereas for large r, the introduction of mobility inhibits the emergence of cooperation at any ρ < 1; for the intermediate value of r, the cooperative behaviour is sometimes enhanced and sometimes inhibited, depending on the values of p and ρ. In particular, the cooperator density can reach its maximum when the values of p and ρ reach their respective optimal values. In addition, two absorbing states of all cooperators and all defectors can emerge respectively for small and large r in the case of p > 0.

Complex networks have been applied to model numerous interactive nonlinear systems in the real world. Knowledge about network topology is crucial to an understanding of the function, performance and evolution of complex systems. In the last few years, many network metrics and models have been proposed to investigate the network topology, dynamics and evolution. Since these network metrics and models are derived from a wide range of studies, a systematic study is required to investigate the correlations among them. The present paper explores the effect of degree correlation on the other network metrics through studying an ensemble of graphs where the degree sequence (set of degrees) is fixed. We show that to some extent, the characteristic path length, clustering coefficient, modular extent and robustness of networks are directly influenced by the degree correlation.

In this paper, the Faddeev–Jackiw approach is improved by the Wu elimination method, so a great many complicated computations in solving constraints for the finite-dimensional polynomial-type constrained dynamics can be executed easily by using computers. Moreover, based on the Faddeev–Jackiw approach, a new algorithm of solving the constrained dynamics is presented. The new algorithm is simpler and stricter than the Faddeev–Jackiw approach. Using the new algorithm, the second Cawley counterexample is solved.