Low-Temperature Magnetic Properties of Co Antidot Array

Cobalt antidot arrays with different thicknesses are fabricated by rf magnetron sputtering onto porous alumina substrates. Scanning electron microscopy and grazing incidence x-ray diffraction are employed to characterize the morphology and crystal structure of the antidot array, respectively. The temperature dependence of magnetic properties shows that in the temperature range 5K--300K, coercivity and squareness increase firstly, reach their maximum values, then decrease. The anomalous temperature dependences of coercivity and squareness are discussed by considering the pinning effect of the antidot and the magnetocrystalline anisotropy.     

Magnetic anisotropy and anisotropic ballistic conductance of thin magnetic wires

The magnetocrystalline anisotropy of thin magnetic wires of iron and cobalt is quite different from the bulk phases. The spin moment of monatomic Fe wire may be as high as 3.4 μ_B, while the orbital moment as high as 0.5 μ_B. The magnetocrystalline anisotropy energy (MAE) was calculated for wires up to 0.6 nm in diameter starting from monatomic wire and adding consecutive shells for thicker wires. I observe that Fe wires exhibit the change sign with the stress applied along the wire. It means that easy axis may change from the direction along the wire to perpendicular to the wire. We find that ballistic conductance of the wire depends on the direction of the applied magnetic field, i.e. shows anisotropic ballistic magnetoresistance. This effect occurs due to the symmetry dependence of the splitting of degenerate bands in the applied field which changes the number of bands crossing the Fermi level. We find that the ballistic conductance changes with applied stress. Even for thicker wires the ballistic conductance changes by factor 2 on moderate tensile stain in our 5×4 model wire. Thus, the ballistic conductance of magnetic wires changes in the applied field due to the magnetostriction. This effect can be observed as large anisotropic BMR in the experiment.     

Lorentz-Compton佯谬与一个双赢判决性散射实验设计

通过对“可见光区域是否存在Compton效应”的讨论而进一步深化到经典条件下“光的量子理论能否包含光的经典电磁理论”的实验验证,发现了Lorentz-Compton佯谬,并基于逆Compton散射设计了一个敏感而又可行的双赢判决性散射实验来解决此佯谬。     

儒家以德治国思想的历史反思

儒家德治思想是中国几千年来占据主导地位的治国思想。儒家把统计者立身惟正，修德示范作为治国前提，而把提高官吏道德修养作为治国关键。同时儒家也认识到法治的作用，提出要教而后刑，主张德主刑辅。通过树立榜样示范作用，兴学校明教化正民心等方法实现其治国思想，传统儒家德治思想对今天的德治建设有一定的借鉴意义，对国家经济发展和社会进步起着不可替代的作用。     

A mixed‐FEM formulation for nonlinear incompressible elasticity in the plane

This article deals with an expanded mixed finite element formulation, based on the Hu‐Washizu principle, for a nonlinear incompressible material in the plane. We follow our related previous works and introduce both the stress and the strain tensors as further unknowns, which yields a two‐fold saddle point operator equation as the corresponding variational formulation. A slight generalization of the classical Babu?ka‐Brezzi's theory is applied to prove unique solvability of the continuous and discrete formulations, and to derive the corresponding a priori error analysis. An extension of the well‐known PEERS space is used to define an stable associated Galerkin scheme. Finally, we provide an a posteriori error analysis based on the classical Bank‐Weiser approach. © 2002 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 18: 105–128, 2002     

Joint detection of a given number of reference fragments in a quasi-periodic sequence and its partition into segments containing series of identical fragments

The problem of joint a posteriori detection of reference fragments in a quasi-periodic sequence and its partition into segments containing series of recurring fragments from the reference tuple is solved. It is assumed that (i) an ordered reference tuple of sequences to be detected is given, (ii) the number of desired fragments is known, (iii) the index of the sequence term corresponding to the beginning of a fragment is a deterministic (not random) value, and (iv) a sequence distorted by an additive uncorrelated Gaussian noise is available for observation. It is established that the problem consists in testing a set of hypotheses about the mean of a random Gaussian vector. The cardinality of the set grows exponentially as the vector dimension (i.e., the sequence length) increases. An efficient a posteriori algorithm producing a maximum-likelihood optimal solution to the problem is substantiated. Time and space complexity bounds related to the parameters of the problem are derived. The results of numerical simulation are presented.     

Magnetic behavior of core–shell particles

We have prepared composite magnetic core–shell particles using the process of soap-free emulsion polymerization and the co-precipitation method. The shell of the synthesized composite sphere is cobalt ferrite (CoFe₂O₄) nanoparticles and the core consists of poly(styrene-co-methacrylic acid) polymer. The mean crystallite sizes of the coated CoFe₂O₄ nanoparticles were controlled in the range of 2.4–6.7 nm by the concentration of [NH₄⁺] and heated temperature. The magnetic properties of the core–shell spherical particles can go from superparamagnetic to ferromagnetic behavior depending on the crystalline sizes of CoFe₂O₄.     

Fixed point theorems for multivalued nonexpansive mappings satisfying inwardness conditions

Let X be a Banach space whose characteristic of noncompact convexity is less than 1 and satisfies the nonstrict Opial condition. Let C be a bounded closed convex subset of X, KC(X) the family of all compact convex subsets of X and T a nonexpansive mapping from C into KC(X) with bounded range. We prove that T has a fixed point. The nonstrict Opial condition can be removed if, in addition, T is an 1-χ-contractive mapping.     

Upper and lower bounds for the energy of bipartite graphs

Using Lagrange's multiplier rule, we find upper and lower bounds of the energy of a bipartite graph G, in terms of the number of vertices, edges and the spectral moment of fourth order. Moreover, the upper bound is attained in a graph G if and only if G is the graph of a symmetric balanced incomplete block design (BIBD). Also, we determine the graphs for which the lower bound is sharp.