CuFe2O4 magnetic heterogeneous nanocatalyst: Low power sonochemical-coprecipitation preparation and applications in synthesis of 4H-chromene-3-carbonitrile scaffolds

The paper presents the synthesis and catalytic activity of CuFe₂O₄ nanoparticles. The CuFe₂O₄ nanoparticles have been prepared by sonochemical route under low power ultrasonic irradiation (UI) and using silent stirring at room temperature only (ST) along with co-precipitation method, without using any additive/capping agent. The synthesized magnetic nanoparticles were successfully used and compared for the synthesis of 4H-chromene-3-carbonitrile derivatives. The CuFe₂O₄ nanoparticles obtained by sonochemical route exhibit higher catalytic activity because of small size (0.5–5 nm), high surface area (214.55 m²/g), high thermal stability up to 700 °C, recyclability and reusability due to its magnetic characteristics than CuFe₂O₄ nanoparticles obtained by room temperature silent stirring. The synthesized CuFe₂O₄ nanoparticles were characterized by FT-IR, SEM–EDX, HR-TEM, XRD, TGA/DTA/DTG, BET, VSM techniques. The present method is of great interest due to its salient features such as environmentally compatible, efficient, short reaction time, chemoselectivity, high yield, cheap, moisture insensitive, green and recyclable catalyst which make it sustainable protocol.     

基于神经网络的三维宽场显微图像复原研究

提出一种利用BP神经网络进行三维宽场显微图像复原的非线性映射方法，将三维图像转化为二维图像进行处理，利用神经网络的学习能力，通过训练，建立含有散焦信息的二维模糊图像与二维清晰图像之间的映射关系，然后对切片堆叠进行逐幅复原，从而实现显微图像的三维复原.得到的复原图像在视觉上和定量分析上都获得了很好的效果.由于采用小规模神经网络，训练时间短，计算量小，使实时复原成为可能.     

On potentially <Emphasis Type="Italic">H</Emphasis>-graphic sequences

For given a graph H, a graphic sequence π = (d ₁, d ₂,..., d _n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K ₅ − e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to be potentially K ₅-graphic, where K _r is a complete graph on r vertices and K _r-e is a graph obtained from K _r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence π to be potentially K ₆-graphic. Project supported by National Natural Science Foundation of China (No. 10401010).     

Fixed-point theorems for families of weakly non-expansive maps

In this paper, we present some fixed-point theorems for families of weakly non-expansive maps under some relatively weaker and more general conditions. Our results generalize and improve several results due to Jungck [G. Jungck, Fixed points via a generalized local commutativity, Int. J. Math. Math. Sci. 25 (8) (2001) 497-507], Jachymski [J. Jachymski, A generalization of the theorem by Rhoades and Watson for contractive type mappings, Math. Japon. 38 (6) (1993) 1095-1102], Guo [C. Guo, An extension of fixed point theorem of Krasnoselski, Chinese J. Math. (P.O.C.) 21 (1) (1993) 13-20], Rhoades [B.E. Rhoades, A comparison of various definitions of contractive mappings, Trans. Amer. Math. Soc. 226 (1977) 257-290], and others.     

26Al的加速器质谱测量及其应用

26Al是一个在多个学科都非常有意义的放射性核素。主要介绍了国内外在利用加速器质谱技术测量26Al时所开展的各种测量方法、各自的优缺点和测量灵敏度，并介绍了目前利用^26Al在地球科学、生物医学、核物理以及天体物理等诸多方面的应用研究工作。     

树映射的分布混沌

设T是个有限树,f是T上的连续映射．证明了f是分布混沌的当且仅当它的拓扑熵是正数．一些已知结论得到了改进．     

A Strongly and Superlinearly Convergent SQP Algorithm for Optimization Problems with Linear Complementarity Constraints

This paper discusses a kind of optimization problem with linear complementarity constraints, and presents a sequential quadratic programming (SQP) algorithm for solving a stationary point of the problem. The algorithm is a modification of the SQP algorithm proposed by Fukushima et al. [Computational Optimization and Applications, 10 (1998), 5-34], and is based on a reformulation of complementarity condition as a system of linear equations. At each iteration, one quadratic programming and one system of equations needs to be solved, and a curve search is used to yield the step size. Under some appropriate assumptions, including the lower-level strict complementarity, but without the upper-level strict complementarity for the inequality constraints, the algorithm is proved to possess strong convergence and superlinear convergence. Some preliminary numerical results are reported.     

变量有广义界线性规划的直接对偶单纯形法

本文讨论变量有广义界线性规划问题借助标准形线性规划同单纯形法技术，建立问题的一个直接对偶单纯形法。分析了方法的性质，给出了初始对偶可行基的计算方法，并用实例说明方法的具体操作。     

On Two Theorems of Finite Solvable Groups

For a finite group G, let T（G） denote a set of primes such that a prime p belongs to T（G） if and only if p is a divisor of the index of some maximal subgroup of G. It is proved that if G satisfies any one of the following conditions： （1） G has a p-complement for each p∈T（G）; （2）│T（G）│= 2： （3） the normalizer of a Sylow p-subgroup of G has prime power index for each odd prime p∈T（G）; then G either is solvable or G/Sol（G）≌PSL（2, 7） where Sol（G） is the largest solvable normal subgroup of G.     

关于E-凸函数及E-凸规划几个错误结论的修正

本文研究Youness在1999年建立的有关E凸函数和E规划的结论.利用E凸函数和E凸规划的基本性质和优化分析技术,获得了有关E凸函数E凸规划的几个错误结论的修正..