Preparation and gas sensing activity of La and Y co-doped titania nanoparticles

Journal of Sol-Gel Science and Technology - A novel gas sensing material, La–Y co-doped TiO2 nanoparticles, was synthesized by sol–gel method and applied to detect organic pollutants...     

Three-weight linear codes from Weil sums

Journal of Algebraic Combinatorics - By appropriately choosing a defining set, we define a class of linear codes and establish their complete weight enumerators and weight enumerators using Weil...     

Dimeric Manganese-Catalyzed Hydroarylation and Hydroalkenylation of Unsaturated Amides

An unprecedented Mn(I)-catalyzed selective hydroarylation and hydroalkenylation of unsaturated amides with commercially available organic boronic acids is reported. Alkenyl boronic acids have been successfully employed for the first time in Mn(I)-catalyzed carbon–carbon bond formation. A wide array of β-alkenylated amide products can be obtained in moderate to good yields, which offers practical access to five- and six-membered lactams. This protocol has predictable regio- and chemoselectivity, excellent functional group compatibility and ease of operation in air, representing a significant step-forward towards manganese-catalyzed C−C coupling.     

介质折射率对一维三元光子晶体带隙的影响

利用光学传输矩阵法,数值模拟了一维二元、三元光子晶体的带隙结构,得出:三元光子晶体的主带隙略宽于二元光子晶体的主带隙;三元光子晶体的主带隙主要取决于最高折射率的介质和最低折射率的介质,而与居于两者之间的介质关系不大,并作出了相应的关系曲线。最后推导了三元光子晶体的色散关系。     

波片复合旋光器研究

利用矩阵光学方法，分析了波片复合旋光器的理论基础，给出了二元和三元复合波片旋光器的条件及其旋光角的大小的数学表达式，并根据此理论作了典型设计。结果表明，旋光角的大小与各波片的延迟量和它们的快轴同X轴的夹角有关。     

Single item lot-sizing problems with backlogging on a single machine at a finite production rate

In this paper we consider a single item lot-sizing problem with backlogging on a single machine at a finite production rate. The objective is to minimize the total cost of setup, stockholding and backlogging to satisfy a sequence of discrete demands. Both varying demands over a finite planning horizon and fixed demands at regular intervals over an infinite planning horizon are considered. We have characterized the structure of an optimal production schedule for both cases. As a consequence of this characterization, a dynamic programming algorithm is proposed for the computation of an optimal production schedule for the varying demands case and a simpler one for the fixed demands case.     

A Modified SQP Method and Its Global Convergence

The sequential quadratic programming method developed by Wilson, Han andPowell may fail if the quadratic programming subproblems become infeasibleor if the associated sequence of search directions is unbounded. In [1], Hanand Burke give a modification to this method wherein the QP subproblem isaltered in a way which guarantees that the associated constraint region isnonempty and for which a robust convergence theory is established. In thispaper, we give a modification to the QP subproblem and provide a modifiedSQP method. Under some conditions, we prove that the algorithm eitherterminates at a Kuhn–Tucker point within finite steps or generates aninfinite sequence whose every cluster is a Kuhn–Tucker point.Finally, we give some numerical examples.     

Some results on fractionaln-factor-critical graphs

A simple graphG is said to be fractionaln-factor-critical if after deleting anyn vertices the remaining subgraph still has a fractional perfect matching. For fractionaln-factor-criticality, in this paper, one necessary and sufficient condition, and three sufficient conditions related to maximum matching, complete closure are given.