Least‐squares finite element method on adaptive grid for PDEs with shocks

We apply the least‐squares finite element method with adaptive grid to nonlinear time‐dependent PDEs with shocks. The least‐squares finite element method is also used in applying the deformation method to generate the adaptive moving grids. The effectiveness of this method is demonstrated by solving a Burgers' equation with shocks. Computational results on uniform grids and adaptive grids are compared for the purpose of evaluation. The results show that the adaptive grids can capture the shock more sharply with significantly less computational time. For moving shock, the adaptive grid moves correctly with the shock. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

BERNOULLI CONVOLUTIONS ASSOCIATED WITH CERTAIN NON-PISOT NUMBERS

1　IntroductionForany 0 <λ <1 ,letνλ　denotethedistributionof ∞n=0 εnλn wherethecoefficientsεnareeither0or1 ,chosenindependentlywithprobability12 foreach .Itistheinfiniteconvo lutionproductofthedistributions 12 (δ0 +δλn) ,givingrisetotheterm“infiniteBernoulliconvolution”orsimply“Bernoulliconvolution” .TheBernoulliconvolutioncanbeexpressedasaself similarmeasureνλsatisfyingtheequationνλ =12 νλ φ- 10 + 12 νλ φ- 11,( 1 .1 )whereφ0 (x) =λxand φ1(x) =λx + 1 .Thisme…     

Impact of demand uncertainty on coordinating supply chain inventories through common replenishment epochs

Prior studies have shown that inventories in a one vendor, multi-buyer supply chain with deterministic demands can be coordinated effectively through the use of common replenishment epochs (CRE). In this paper, we study the impact of demand uncertainty on the effectiveness of coordinating such a supply chain. We develop a model to analyse the coordination mechanism using CRE in a one-vendor, multi-buyer supply chain, when the demand faced by the buyers is stochastic. Our numerical study based on the model found that coordination through CRE may not always be beneficial when the demand variance is high. We also investigate a strategy of advance order processing by the vendor to improve the effectiveness of coordination through CRE.     

Synthesis and application as polymer electrolyte of hyperbranched polyether made by cationic ring‐opening polymerization of 3‐{2‐[2‐(2‐hydroxyethoxy)ethoxy]ethoxymethyl}‐3′‐methyl‐oxetane

A novel cyclic ether monomer 3‐{2‐[2‐(2‐hydroxyethoxy)ethoxy]ethoxy‐methyl}‐3′‐methyloxetane (HEMO) was prepared from the reaction of 3‐hydroxymethyl‐3′‐methyloxetane tosylate with triethylene glycol. The corresponding hyperbranched polyether (PHEMO) was synthesized using BF₃·Et₂O as initiator through cationic ring‐opening polymerization. The evidence from ¹H and ¹³C NMR analyses revealed that the hyperbranched structure is constructed by the competition between two chain propagation mechanisms, i.e. active chain end and activated monomer mechanism. The terminal structure of PHEMO with a cyclic fragment was definitely detected by MALDI‐TOF measurement. A DSC test implied that the resulting polyether has excellent segment motion performance potentially beneficial for the ion transport of polymer electrolytes. Moreover, a TGA assay showed that this hyperbranched polymer possesses high thermostability as compared to its liquid counterpart. The ion conductivity was measured to reach 5.6 × 10^?5 S/cm at room temperature and 6.3 × 10^?4 S/cm at 80 °C after doped with LiTFSI at a ratio of Li:O = 0.05, presenting the promise to meet the practical requirement of lithium ion batteries for polymer electrolytes. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 44: 3650–3665, 2006     

可用于激光核聚变的闪烁中子探测器

在当前激光核聚变实验中,中子集中在短时间内出现、且产额低。为适应这种特点,要求探测器的效率高,分辨时间短。利用闪烁中子探测器探测激光核聚变所产生的中子,能测定中子产额,记录中子能量,而且探测效率高,分辨时间短。缺点是易受γ射线、X射线的干扰。     

Weak and Strong Solutions for the Stokes Approximation of Non-homogeneous Incompressible Navier-Stokes Equations

In this paper,the Dirichlet problem of Stokes approximate of non-homogeneous incompressibleNavier-Stokes equations is studied.It is shown that there exist global weak solutions as well as global andunique strong solution for this problem,under the assumption that initial density ρ_0(x)is bounded away from0 and other appropriate assumptions(see Theorem 1 and Theorem 2).The semi-Galerkin method is applied toconstruct the approximate solutions and a prior estimates are made to elaborate upon the compactness of theapproximate solutions.     

Resonant-induced transparency and coupled modes in layered metamaterials

We present an overview of some of our work on transmission properties and mode characteristics of layered metamaterials and their potential applications. In particular, we will show how layered metamaterials exhibit unusual transmission properties and unconventional features of guided modes, such as resonance-induced transparency in multilayer structures and slope reversal of dispersion curves in coupled waveguides. PACS 78.67.-n; 73.21.Ac; 61.46.+w; 42.25.Bs; 42.82.Et     

Dynamic behavior of discrete-time multiagent systems with general communication structures

In this paper, we discuss the dynamic behavior of networks of dynamic agents with general communication topologies. We first analyze the basic case: systems with communication topologies that have spanning trees, i.e., the systems that solve consensus problems. We establish an algebraic condition to characterize each agent's contributions to the final state. And we also study the influence of time-delays on each agent's contributions. Then, we investigate the general case: systems with weakly connected topologies. By using matrix theory, we prove that the states of internal agents will converge to a convex combination of boundary agents in the absence or presence of communication time-delays, and we also show that the coefficients of the convex combination are independent of time-delays even if the delays are time-varying. These results have broad applications in other areas, e.g., study of swarm behavior, formation control of vehicles, etc.     

LIMITING BEHAVIOR OF UNIFORM RECURSIVE TREES

The authors consider the limiting behavior of various branches in a uniform recursive tree with size growing to infinity.The limiting distribution ofζ_(n,m),the number of branches with size m in a uniform recursive tree of order n,converges weakly to a Poisson distribution with parameter 1/m with convergence of all moments.The size of any large branch tends to infinity almost surely.     

Semilinear Differential Inclusions in Separable Banach Spaces

Ｓｅｍｉｌｉｎｅａｒ　Ｄｉｆｆｅｒｅｎｔｉａｌ　Ｉｎｃｌｕｓｉｏｎｓ　ｉｎ　Ｓｅｐａｒａｂｌｅ　Ｂａｎａｃｈ　ＳｐａｃｅｓＸｕｅＸｉｎｇｍｅｉ（薛星美）ａｎｄＳｏｎｇＧｕｏｚｈｕ（宋国柱）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，Ｎａｎｊｉｎ...