A local-world heterogeneous model of wireless sensor networks with node and link diversity

In this paper, we present a novel local-world model of wireless sensor networks (WSN) with two kinds of nodes: sensor nodes and sink nodes, which is different from other models with identical nodes and links. The model balances energy consumption by limiting the connectivity of sink nodes to prolong the life of the network. How the proportion of sink nodes, different energy distribution and the local-world scale would affect the topological structure and network performance are investigated. We find that, using mean-field theory, the degree distribution is obtained as an integral with respect to the proportion of sink nodes and energy distribution. We also show that, the model exhibits a mixed connectivity correlation which is greatly distinct from general networks. Moreover, from the perspective of the efficiency and the average hops for data processing, we find some suitable range of the proportion p of sink nodes would make the network model have optimal performance for data processing.     

Detecting communities in clustered networks based on group action on set

In this paper, we propose a well targeted algorithm (GAS algorithm) for detecting communities in high clustered networks by presenting group action technology on community division. During the processing of this algorithm, the underlying community structure of a clustered network emerges simultaneously as the corresponding partition of orbits by the permutation groups acting on the node set are achieved. As the derivation of the orbit partition, an algebraic structure r-cycle can be considered as the origin of the community. To be a priori estimation for the community structure of the algorithm, the community separability is introduced to indicate whether a network has distinct community structure. By executing the algorithm on several typical networks and the LFR benchmark, it shows that this GAS algorithm can detect communities accurately and effectively in high clustered networks. Furthermore, we compare the GAS algorithm and the clique percolation algorithm on the LFR benchmark. It is shown that the GAS algorithm is more accurate at detecting non-overlapping communities in clustered networks. It is suggested that algebraic techniques can uncover fresh light on detecting communities in complex networks.     

天然黄铁矿光吸收特征

以天然黄铁矿为样本,用Cary 500型紫外可见近红外分光光度计在200～2 000 nm范围内测出了样品的吸收谱和反射谱,计算出了吸收系数,并根据Tauc规则算出了样品的禁带宽度.结果表明:所测天然黄铁矿光吸收系数在105数量级;在吸收图谱中出现了明显的肩行结构,可以判断样品属于间接禁带半导体,其禁带宽度为0.64 ...     

The fekete-szegö problem for close-to-convex functions with respect to the koebe function

An analytic function f   in the unit disk D :={z ∈ ? : |z| < 1}$\mathbb{D}\hspace{0.17em}:=\left\{z\hspace{0.17em}\in \hspace{0.17em}?\hspace{0.17em}:\hspace{0.17em}\left|z\right|\hspace{0.17em}<\hspace{0.17em}1\right\}$, standardly normalized, is called close-to-convex with respect to the Koebe function k(z) := z/(1−z)², z ∈ D$k\left(z\right)\hspace{0.17em}:=\hspace{0.17em}z/{\left(1-z\right)}^2,\hspace{0.17em}z\hspace{0.17em}\in \hspace{0.17em}\mathbb{D}$ if there exists δ∈(-π/2,π/2) such that Re{eiδ(1−z)²f^′(z)} > 0, ∈ D$\text{Re}\left\{{\text{e}}^{\text{i}\delta }{\left(1-z\right)}^2{f}^{\prime }\left(z\right)\right\}\hspace{0.17em}>\hspace{0.17em}0,\hspace{0.17em}\in \hspace{0.17em}\mathbb{D}$. For the class C(k) of all close-to-convex functions with respect to k, related to the class of functions convex in the positive direction of the imaginary axis, the Fekete-Szegö problem is studied.     

培养学生科学思维和创新能力的研究与实践——谈大学数学研究型教学

通过从一个导数值等式的证明谈起,探讨教师在课堂教学中如何根据教学内容创设能激起学生新异感的问题情景,启发和引导学生发散思考,类比、联想、猜想,探索和发现新问题并给出解答.使学生思维不断攀升,丰富教学内容,激发学生兴趣,培养学生科学思维方法和创新能力.     

Lie algebroid modules and representations up to homotopy

We establish a relationship between two different generalizations of Lie algebroid representations: representation up to homotopy and Vaĭntrob’s Lie algebroid modules. Specifically, we show that there is a noncanonical way to obtain a representation up to homotopy from a given Lie algebroid module, and that any two representations up to homotopy obtained in this way are equivalent in a natural sense. We therefore obtain a one-to-one correspondence, up to equivalence.     

基于系数相关性的自适应水印算法

根据人类视觉特征提出了一种基于小波系数相关性的自适应水印嵌入算法.该算法先对原始图像进行的小波分解,选取水印所要嵌入的子带并将所选取的子带划分成2×2大小的块,同时利用每一个小波块中相邻的4个系数之间具有一定的相关性与所要嵌入的水印图像来构造该小波块的水印系数,利用人类视觉模型调整水印的嵌入强度,从而在保证水印不可见性的基础上最大限度的保证水印的鲁棒性.选取不同特点的两幅图片进行实验,实验结果表明,该算法对高斯噪声、椒盐噪声、JPEG压缩、剪切、中值滤波等攻击都具有较好的鲁棒性,对旋转几何攻击具有一定的鲁棒性.     

On Rockafellar’s theorem using proximal point algorithm involving -maximal monotonicity framework

On the basis of the general framework of H-maximal monotonicity (also referred to as H-monotonicity in the literature), a generalization to Rockafellar’s theorem in the context of solving a general inclusion problem involving a set-valued maximal monotone operator using the proximal point algorithm in a Hilbert space setting is explored. As a matter of fact, this class of inclusion problems reduces to a class of variational inequalities as well as to a class of complementarity problems. This proximal point algorithm turns out to be of interest in the sense that it plays a significant role in certain computational methods of multipliers in nonlinear programming. The notion of H-maximal monotonicity generalizes the general theory of set-valued maximal monotone mappings to a new level. Furthermore, some results on general firm nonexpansiveness and resolvent mapping corresponding to H-monotonicity are also given.     

Total synthesis of (±)-17-norcamptothecin, a novel E-ring modified camptothecin

The first total synthesis of (±)-17-norcamptothecin, a novel camptothecin analog possessing an α-hydroxy-γ-lactone E-ring, has been accomplished by using a short and flexible route. The stability of this new compound in aqueous medium has been evaluated through fluorescence spectroscopy.