Angular Distributions for

[1]G.T.Bodwin,E.Braaten,and G.P.Lepage,Phys.Rev.D 51 (1995) 1125;[Erratum-ibid.D 55 (1997) 5853][arXiv:hep-ph/9407339]; J.Boltz,P.Kroll,and G.A.Schulre,Phys.Lett.B 392 (1997) 198; J.Boltz,P.Kroll,and G.A.Schulre,Phys.J.C 2 (1998) 705. [2]S.M.Wong,Nucl.Phys.A 674 (2000) 185; S.M.Wong,Eur.Phys.J.C 14 (2000) 643. [3]J.Z.Bai,Y.Ban,J.G.Bian,et al.,Phys.Rev.D 67 (2003)112001. [4]M.Jacob and G.C.Wick,Ann.Phys.7 (1959) 404. [5]S.U.Chung,Phys.Rev.D 48 (1993) 1225; S.U.Chung,Phys.Rev.D 57 (1998) 431; B.S.Zou and D.V.Bugg,Eur.Phys.J.A 16 (2003) 537. [6]Particle Data Group,Phys.Lett.B 592 (2004) pp.924-966. [7]M.A.Doncheski,et al.,Phys.Rev.D 42 (1990) 2293; E.Eichten,et al.,Phys.Rev.D 21 (1980) 203; K.J.Sebastian,Phys.Rev.D 26 (1982) 2295; G.Hardekopf and J.Sucher,Phys.Rev.D 25 (1982) 2938; R.McClary and N.Byers,Phys.Rev.D 28 (1983) 1692; P.Moxhay and J.L.Rosner,Phys.Rev.D 28 (1983) 1132. [8]B.S.Zou and F.Hussain,Phys.Rev.C 67 (2003) 015204.     

Re-study of Nucleon Pole Contribution in J/

[1]V.D.Burkert,Phys.Lett.B 72 (1997) 109. [2]S.Capstick and W.Roberts,Prog.Part.Nucl.Phys.45 (2000) S241,and references therein. [3]B.S.Zou,Nucl.Phys.A 675 (2000) 167c; B.S.Zou,Nucl.Phys.A 684 (2001) 330; BES Collaboration (J.Z.Bai,et al.) Phys.Lett.B 510 (2001) 75; BES Collaboration (M.Ablikim,et al.),hep-ex/0405030. [4]R.Sinha and Susumu Okubo,Phys.Rev.D 30 (1984)2333. [5]W.H.Liang,P.N.Shen,B.S.Zou,and A.Faessler,Euro.Phys.J A 21 (2004) 487. [6]Particle Data Group,Euro.Phys.J.C 15 (2000) 1. [7]K.Tsushima,A.Sibrtsev,and A.W.Thomas,Phys.Lett.B 390 (1997) 29. [8]J.Kogut,Rev.Mod.Phys.51 (1979) 659; Rev.Mod.Phys.55 (1983) 775. [9]Q.Haider and L.C.Liu,J.Phys.G 22 (1996) 1187; L.C.Liu and W.X.Ma,J.Phys.G 26 (2000) L59. [10]V.G.J.Stoks,R.A.M.Klomp,C.P.F.Terheggen,and J.J.de Swart,Phys.Rev.C 49 (1994) 2950. [11]H.Haberzettl,C.Bennhold,T.Mart,and T.Feuster,Phys.Rev.C 58 (1998) R40. [12]Y.Oh,A.I.Titov,and T.-S.H.Lee,Phys.Rev.C 63(2001) 25201.     

Measuring distances between complex networks

A previously introduced concept of higher order neighborhoods in complex networks, [R.F.S. Andrade, J.G.V. Miranda, T.P. Lobão, Phys. Rev. E 73 (2006) 046101] is used to define a distance between networks with the same number of nodes. With such measure, expressed in terms of the matrix elements of the neighborhood matrices of each network, it is possible to compare, in a quantitative way, how far apart in the space of neighborhood matrices two networks are. The distance between these matrices depends on both the network topologies and the adopted node numberings. While the numbering of one network is fixed, a Monte Carlo algorithm is used to find the best numbering of the other network, in the sense that it minimizes the distance between the matrices. The minimal value found for the distance reflects differences in the neighborhood structures of the two networks that arise only from distinct topologies. This procedure ends up by providing a projection of the first network on the pattern of the second one. Examples are worked out allowing for a quantitative comparison for distances among distinct networks, as well as among distinct realizations of random networks.     

Dynamics of Two-Photon Lasers with

[1]C.O.Weiss and R.Vilaseca,Dynamics of Lasers,VCH,Weinheim (1991); Instabilities and Chaos in Quantum Optics,eds.F.T.Arecchi and R.G.Harrison,Springer-Verlag,Berlin (1987). [2]H.Haken,Phys.Lett.A 53 (1975) 77. [3]Ju Rui,Huang Hong-Bin,Yang Peng,Xie Xia,and Zhao Huan,Commun.Theor.Phys.(Beijing,China) 44 (2005) 65; Ju Rui,Zhang Ya-Jun,Huang Hong-Bin,and Zhao Huan,Acta Phys.Sin.53 (2004) 2191 (in Chinese). [4]C.Z.Ning and H.Haken,Z.Phys.B 77 (1989) 247; B 77 (1989) 157; B 77 (1989) 163; J.Zakrenwski and M.Lewenstein,Phys.Rev.A 45 (1992) 2057. [5]G.J.deValearcel,E.Roldan,and R.Vilaseca,Phys.Rev.A 45 (1992) R2674; Phys.Rev.A 49 (1994) 1243. [6]X.Xie,H.B.Huang,F.Qian,Y.J.Zhang,P.Yang,and G.X.Qi,Commun.Theor.Phys.(Beijing,China) 46 (2006) 1042. [7]X.L.Deng,H.Q.Ma,B.D.Chen,and H.B.Huang,Phys.Lett.A 290 (2001) 77. [8]C.Benkert,and M.O.Scully,Phys.Rev.A 42 (1990) 2817. [9]M.O.Scully and M.S.Zubairy,Quantum Optics,Cambridge University Press,Cambridge (1997).     

Reply to: “Comment on: ‘Epidemic spreading on heterogeneous networks with identical infectivity’ [Phys. Lett. A 364 (2007) 189]” [Phys. Lett. A 372 (2008) 1722]

In a recent Letter [R. Yang, B.H. Wang, J. Ren, W.J. Bai, Z.W. Shi, W.X. Wang, T. Zhou, Phys. Lett. A 364 (2007) 189], we proposed a modified susceptible-infected-recovered (SIR) model, in which each node is assigned with an identical capability of active contact, A, at each time step. We found a threshold value λc=1/A in uncorrelated and unlocalized networks. A corresponding Comment, raised by Alberto d'Onofrio, claimed that (i) our model is not biologically relevant; (ii) our model does not have a threshold behavior for recovered population; (iii) the analytical result λc=1/A is incorrect being considered as a threshold for epidemic outbreak, because of an improper approximation of the initial configuration. In this Reply, I show that, by debating from point to point, our analysis and conclusion are solid and reasonable.     

Parameter identification of chaos system based on unknown parameter observer

Parameter identification of chaos system based on unknown parameter observer is discussed generally. Based on the work of Guan et al. [X.P. Guan, H.P. Peng, L.X. Li, et al., Acta Phys. Sinica 50 (2001) 26], the design of unknown parameter observer is improved. The application of the improved approach is extended greatly. The works in some literatures [X.P. Guan, H.P. Peng, L.X. Li, et al., Acta Phys. Sinica 50 (2001) 26; J.H. Lü, S.C. Zhang, Phys. Lett. A 286 (2001) 148; X.Q. Wu, J.A. Lu, Chaos Solitons Fractals 18 (2003) 721; J. Liu, S.H. Chen, J. Xie, Chaos Solitons Fractals 19 (2004) 533] are only the special cases of our Corollaries 1 and 2. Some observers for Lü system and a new chaos system are designed to test our improved method, and simulations results demonstrate the effectiveness and feasibility of the improved approach.     

Top Quark Flavor Changing Decay t

[1]R. Casalbuoani, A. Deandrea, and M. Oertel, JHEP 032(2004) 0402. [2]G. Hooft, In Search of the Ultimate Building Blocks, Cambridge University Press, Cambridge (1997). [3]J. Belazey, Searches for New Physics at Hadron Coliders,Northern Illinois University (2005). [4]N. Arkani-hamed, A.G. Cohen, and H. Georgi, Phys. Lett.B 513 (2001) 232 [hep-ph/0105239]. [5]I. Low, W. Skiba, and D. Smith, Phys. Rev. D 66 (2002)072001 [hep-ph/0207243]. [6]N. Arkani-hamed, A.G. Cohen, E. Katz, and A.E. Nelson,JHEP 0207 (2002) 304 [hep-ph/0206021]. [7]N. Arkani-hamed, A.G. Cohen, E. Katz, A.E. Nelson, T.Gregoire, and J. G. Wacker, JHEP 0208 (2002) 021 [hepph/0206020]. [8]T. Gregoire and J.G. Wacker, JHEP 0208 (2002) 019[hep-ph/0206023]. [9]For a recent review, see e.g., M. Schmaltz, Nucl. Phys. B (Proc. Suppl.) 117 (2003) 40. [10]N. Arkani-hamed, A.G. Cohen, T. Gregoire, and J.G.Jacker, JHEP 0208 (2002) 020 [hep-ph/0202089]. [11]or a recent review, see e.g., M. Schmaltz, Nucl. Phys.Proc. Suppl. 117 (2003) 40 [hep-ph/0210415]. [12]E. Katz, J. Lee, A.E. Nelson, and D.G. Walker, hepph/0312287. [13]M. Beneke, I. Efthymiopoulos, M.L. Mangano, et al., hepph/0003033. [14]D.O. Carlson and C.-P. Yuan, hep-ph/9211289. [15]R. Frey, D. Gerdes, and J. Jaros, hep-ph/9704243. [16]G. Eilam, J.L. Hewett, and A. Soni, Phys. Rev. D 44(1991) 1473; W.S. Hou, Phys. Lett. B 296 (1992) 179; K.Agashe and M. Graesser, Phys. Rev. D 54 (1996) 4445;M. Hosch, K. Whisnant, and B.L. Young, Phys. Rev. D56 (1997) 5725. [17]C.S. Li, R.J. Oakes, and J.M. Yang, Phys. Rev. D 49(1994) 293, Erratum-ibid. D 56 (1997) 3156; G. Couture,C. Hamzaoui, and H. Koenig, Phys. Rev. D 52 (1995)1713; G. Couture, M. Frank, and H. Koenig, Phys. Rev.D 56 (1997) 4213; G.M. de Divitiis, et al., Nucl. Phys. B 504 (1997) 45. [18]B. Mele, S. Petrarca, and A. Soddu, Phys. Lett. B 435(1998) 401. [19]B. Mele, hep-ph/0003064. [20]J.M. Yang and C.S. Li, Phys. Rev. D 49 (1994) 3412,Erratum, ibid. D 51 (1995) 3974; J.G. Inglada, hepph/9906517. [21]L.R. Xing, W.G. Ma, R.Y. Zhang, Y.B. Sun, and H.S.Hou, Commun. Theor. Phys. (Beijing, China) 41 (2004)241. [22]L.R. Xing, W.G. Ma, R.Y. Zhang, Y.B. Sun, and H.S.Hou, Commun. Theor. Phys. (Beijing, China) 40 (2003)171. [23]T. Han, H.E. Logan, B. McElrath, and L.T. Wang, Phys.Rev. D 67 (2003) 095004. [24]I. Low, W. Skiba, and D. Smith, Phys. Rev. D 66 (2002)072001. [25]T. Han, H.E. Logan, B. McElrath, and L.T. Wang, hepph/0302188. [26]A.J. Buras, A. Poschenrieder, and S. Uhlig, hepph/0410309. [27]S. Eidelman, et al., Phys. Lett. B 592 (2004) 1. [28]F. Legerlehner, DESY 01-029, hep-ph/0105283.     

Deterministic modularity optimization

We study community structure of networks. We have developed a scheme for maximizing the modularity Q [Newman and Girvan, Phys. Rev. E 69, 026113 (2004)] based on mean field methods. Further, we have defined a simple family of random networks with community structure; we understand the behavior of these networks analytically. Using these networks, we show how the mean field methods display better performance than previously known deterministic methods for optimization of Q.     

Shape Coexistence for 179Hg in Relativistic Mean-Field Theory

[1]J.H. Hamilton,A. VRamayya, W.T. Pinkston, et al.,Phys. Rev. Lett. 32 (1974) 239. [2]R. Julin, K. Helariutta, and M. Muikku, J. Phys. G 27(2001) R109. [3]J.H. Hamilton, Nukleonika 24 (1979) 561. [4]W.C. Ma, et al., Phys. Lett. B 139 (1984) 276. [5]R. Bengtsson, et al., Phys. Lett. B 183 (1987) 1. [6]S. Yoshida and N. Takigawa, Phys. Rev. C 55 (1996)1255. [7]T. Niksic, D. Vretenar, P. Ring, et al., Phys. Rev. C 65(2002) 054320. [8]F.G. Condev, M.P. Carpenter, R.V.F. Janssens, et al.,Phys. Lett. B 528 (2002) 221. [9]D.G. Jenkins, A.N. Andreyev, R.D. Page, et al., Phys.Rev. C 66 (2002) 011301(R). [10]B.D. Serot and J.D. Walecka, Adv. Nuc]. Phys. 16 (1986)1. [11]P. Ring, Prog. Part. Nucl. Phys. 37 (1996) 193. [12]J. Meng and P. Ring, Phys. Rev. Lett. 77 (1996) 3963. [13]J. Meng and P. Ring, Phys. Rev. Lett. 80 (1998) 460. [14]S.K. Patra, S. Yoshida, N. Takigawa, and C.R. Praharaj,Phys. Rev. C 50 (1994) 1924. [15]S. Yoshida, S.K. Patra, N. Takigawa, and C.R. Praharaj,Phys. Rev. C 50 (1994) 1938. [16]G.A. Lalazissis and P. Ring, Phys. Lett. B 427 (1998)225. [17]Jun-Qing Li, Zhong-Yu Ma, Bao-Qiu Chen, and Yong Zhou, Phys. Rev. C 65 (2002) 064305. [18]G. Audi and A.H. Wapstra, Nucl. Phys. A 565 (1993) 1. [19]G. Audi and A.H. Wapstra, Nucl. Phys. A 595 (1995)409. [20]G. Audi and A.H. Wapstra, Nucl. Phys. A 624 (1997) 1. [21]P. MOller and J.R. Nix, Atom. Data and Nucl. Data Table 59 (1995) 307.     

Sigma Terms and Strangeness Contents of Baryon Octet in Modified Chiral Perturbation Theory

[1]J.Gasser,H.Leutwyler,and M.E.Sainio,Phys.Lett.B 253 (1991) 252. [2]John Ellis,Eur.Phys.J.A 24S2 (2005) 3,[arXive:hepph/0411369]. [3]T.Inoue,V.E.Lyubovitskij,Th.Gutsche,and Amand Faessler,Phys.Rev.C 69 (2004) 035207,[arXive:hepph/0311275]. [4]M.M.Pavan,I.I.Strakovsky,R.L.Workman,and R.A.Arndt,PiN Newslett.16 (2002) 110,[arXive:hepph/0111066]. [5]V.E.Lyubovitskij,Th.Gutsche,Amand Faessler,and E.G.Drukarev,Phys.Rev.D 63 (2001) 054026,[arXive:hep-ph/0009341]. [6]S.D.Bass,Phys.Lett.B 329 (1994) 358,[arXive:hepph/9404294]. [7]Marc Knecht,PiN Newslett.15 (1999) 108,[arXive:hepph/9912443]. [8]P.Schweitzer,Phys.Rev.D 69 (2004) 034003. [9]B.C.Lehnhart,J.Gegelia,and S.Scherer,J.Phys.G 31(2005) 89,[arXive:hep-ph/0412092]. [10]P.J.Ellis and K.Torikoshi,Phys.Rev.C 61 (1999)015205. [11]Gerald E.Hite,William B.Kaufmann,and Richard J.Jacob,Phys.Rev.C 71 (2005) 065201. [12]S.Weinberg,Physica A 96 (1979) 327. [13]J.Gasser and H.Leutwyler,Nucl.Phys.B 250 (1985)465. [14]J.Gasser,M.E.Sainio,and A.Svarc,Nucl.Phys.B 307(1988) 779. [15]P.Papazoglou,D.Zschiesche,S.Schramm,J.SchaffnerBielich,H.St(o)cker,and W.Greiner,Phys.Rev.C 59(1999) 411. [16]T.Fuchs and J.Gegelia,Phys.Rev.D 68 (2003) 056005.     

Reexamining the security of the improved quantum secret sharing scheme

We find that, in the improvement [S.J. Qin et al., Phys. Lett. A 357 (2006) 101] of the multiparty quantum secret sharing [Z.J. Zhang et al., Phys. Rev. A 71 (2005) 044301], Charlie can solely obtain Alice’s secret messages without Bob’s helps. In other words, the improved secret sharing scheme is still insecure. In the end, we further modify Qin et al. improved three-party quantum secret sharing scheme and make it really secure.     

Robustness of heterogeneous complex networks

In this paper we study the robustness of heterogeneous preferential attachment networks. The robustness of a network measures its structural tolerance to the random removal of nodes and links. We numerically analyze the influence of the affinity parameters on a set of ensemble-averaged robustness metrics. We show that the presence of heterogeneity does not fundamentally alter the smooth nature of the fragmentation process of the models. We also show that a moderate level of locality translates into slight improvements in the robustness metrics, which prompts us to conjecture an evolutionary argument for the existence of real networks with power-law scaling in their connectivity and clustering distributions.     

Walks on Apollonian networks

We carry out comparative studies of random walks on deterministic Apollonian networks (DANs) and random Apollonian networks (RANs). We perform computer simulations for the mean first-passage time, the average return time, the mean-square displacement, and the network coverage for the unrestricted random walk. The diffusions both on DANs and RANs are proved to be sublinear. The effects of the network structure on the dynamics and the search efficiencies of walks with various strategies are also discussed. Contrary to intuition, it is shown that the self-avoiding random walk, which has been verified as an optimal local search strategy in networks, is not the best strategy for the DANs in the large size limit.     

Comment on “Multiparty secret sharing of quantum information via cavity QED”

In a recent paper [Z.J. Zhang, Opt. Commun. 261 (2006) 199], a scheme on secret sharing of quantum information in cavity QED has been discussed. The author claims that he has improved the success probability of teleportation from 6.25% in our original paper [Y.Q. Zhang, X.R. Jin, S. Zhang, Phys. Lett. A 341 (2005) 380] to 100%. However, in this comment, we show that it is not the case and the author has mistakenly understood our original paper [Y.Q. Zhang, X.R. Jin, S. Zhang, Phys. Lett. A 341 (2005) 380].     

Inevitable self-similar topology of binary trees and their diverse hierarchical density

Self-similar topology, which can be characterized as power law size distribution, has been found in diverse tree networks ranging from river networks to taxonomic trees. In this study, we find that the statistical self-similar topology is an inevitable consequence of any full binary tree organization. We show this by coding a binary tree as a unique bifurcation string. This coding scheme allows us to investigate trees over the realm from deterministic to entirely random trees. To obtain partial random trees, partial random perturbation is added to the deterministic trees by an operator similar to that used in genetic algorithms. Our analysis shows that the hierarchical density of binary trees is more diverse than has been described in earlier studies. We find that the connectivity structure of river networks is far from strict self-similar trees. On the other hand, organization of some social networks is close to deterministic supercritical trees.     

Properties of wealth distribution in multi-agent systems of a complex network

We present a simple model for examining the wealth distribution with agents playing evolutionary games (the Prisoners’ Dilemma and the Snowdrift Game) on complex networks. Pareto’s power law distribution of wealth (from 1897) is reproduced on a scale-free network, and the Gibbs or log-normal distribution for a low income population is reproduced on a random graph. The Pareto exponents of a scale-free network are in agreement with empirical observations. The Gini coefficient of an ER random graph shows a sudden increment with game parameters. We suggest that the social network of a high income group is scale-free, whereas it is more like a random graph for a low income group.     

Synchronization of Kuramoto oscillators in random complex networks

We study the synchronization of coupled phase oscillators in random complex networks. The topology of the networks is assumed to be vary over time. Here we mainly study the onset of global phase synchronization when the topology switches rapidly over time. We find that the results are, to some extent, different from those in deterministic situations. In particular, the synchronizability of coupled oscillators can be enhanced in ER networks and scale-free networks under fast switching, while in stochastic small-world networks such enhancement is not significant.     

Cryptanalysis of a chaos-based image encryption algorithm

A chaos-based image encryption algorithm was proposed in [Z.-H. Guan, F. Huang, W. Guan, Phys. Lett. A 346 (2005) 153]. In this Letter, we analyze the security weaknesses of the proposal. By applying chosen-plaintext and known-plaintext attacks, we show that all the secret parameters can be revealed.     

Topological properties of stock networks based on minimal spanning tree and random matrix theory in financial time series

We investigated the topological properties of stock networks constructed by a minimal spanning tree. We compared the original stock network with the estimated network; the original network is obtained by the actual stock returns, while the estimated network is the correlation matrix created by random matrix theory. We found that the consistency between the two networks increases as more eigenvalues are considered. In addition, we suggested that the largest eigenvalue has a significant influence on the formation of stock networks.     

Topologically protected qubits as minimal Josephson junction arrays with non-trivial boundary conditions: A proposal

Recently a one-dimensional closed ladder of Josephson junctions has been studied [G. Cristofano, V. Marotta, A. Naddeo, G. Niccoli, Phys. Lett. A 372 (2008) 2464] within a twisted conformal field theory (CFT) approach [G. Cristofano, G. Maiella, V. Marotta, Mod. Phys. Lett. A 15 (2000) 1679; G. Cristofano, G. Maiella, V. Marotta, G. Niccoli, Nucl. Phys. B 641 (2002) 547] and shown to develop the phenomenon of flux fractionalization [G. Cristofano, V. Marotta, A. Naddeo, G. Niccoli, Eur. Phys. J. B 49 (2006) 83]. That led us to predict the emergence of a topological order in such a system [G. Cristofano, V. Marotta, A. Naddeo, J. Stat. Mech.: Theory Exp. (2005) P03006]. In this Letter we analyze the ground states and the topological properties of fully frustrated Josephson junction arrays (JJA) arranged in a Corbino disk geometry for a variety of boundary conditions. In particular minimal configurations of fully frustrated JJA are considered and shown to exhibit the properties needed in order to build up a solid state qubit, protected from decoherence. The stability and transformation properties of the ground states of the JJA under adiabatic magnetic flux changes are analyzed in detail in order to provide a tool for the manipulation of the proposed qubit.