A novel aptasensor based on 3D-inorganic hybrid composite as immobilized substrate for sensitive detection of platelet-derived growth factor

A novel electrochemical detection approach for platelet-derived growth factor(PDGF) via "sandwich"structure is reported in this paper. 3D-4MgCO_3 Mg(OH)_2 4H_2O-Au NPs inorganic hybrid composite was utilized as immobilized substrate for sensitive PDGF detection and Pt-Au bimetallic nanoparticles were labelled on PDGF aptamer to indirectly detect PDGF for the first time. The proposed aptasensor exhibited a high catalytic efficiency towards reduction of H_2O_2, hence the sensitive detection of PDGF was achieved.Results showed that the aptasensor exhibited excellent linear response to PDGF, in the range of 0.1 pg/m L–10 ng/m L(4 fmol/L–400 pmol/L), with detection limit of 0.03 pg/m L(1.2 fmol/L).     

Chromatographic performance of deuterated solvents in reversed phase micro high performance liquid chromatography

The chromatographic performance of the deuterated solvents, CD₃OD and D₂O, has been investigated in reversed-phase micro high performance liquid chromatography. The chromatographic performance of CD₃OD is only slightly superior to that of CH₃OH. However, the performance of D₂ is significantly superior to that of H₂O, separation of aromatics being improved by about 30%. D₂ is a particularly powerful solvent for the separation iof deuterated and non-deuterated compounds.     

统计模型在中文文本挖掘中的应用

本文讨论了中文文本挖掘的三个问题:分词、关键词提取和文本分类。对分词问题,介绍了基于层叠隐马尔可夫模型的ICTCLAS分词法,以及将词与词之间的分隔视为缺失数据并用EM算法求解的WDM方法;对关键词提取问题,提出了贝叶斯因子法,并介绍了使用稀疏回归的CCS方法;对文本分类问题,介绍了根据关键词频率建立分类器的方法,以及先建立主题模型再根据主题概率建立分类器的方法。本文通过两组文本数据对上述方法进行比较,并给出使用建议。     

股票市场的长记忆及其动态结构

本文提出了结合平均小波系数法和自回归原始自助法的稳健长记忆检验,蒙特卡罗模拟显示该方法对于短期记忆过程具有稳定性。基于该方法对2005年4月8日至2015年6月30日的中国、美国、香港和德国股市进行了实证分析。全局检验结果表明仅中国的股票市场存在显著的长记忆,并且风险因素无法对长记忆解释,而美国、德国和香港的股市不存在长记忆。基于递增窗口的动态Hurst指数分析显示,金融危机时期4个股市都存在显著的长记忆。2010年后,除中国股市外,其余三个股市几乎不存在长记忆现象。     

改进差分进化算法求解装载率凹费用装箱问题

研究了广泛存在于物流作业中一类新型的装箱问题,主要特征体现在箱子使用费用是关于装载率的凹函数。为求解问题,提出了一种基于分组编码策略的改进差分进化算法,以避免常规实数和整数编码方法存在放大搜索空间的不足。针对分组编码策略,定制化设计了以促进优秀基因传播为导向的新型变异和交叉操作,另外还嵌入了以物品置换为邻域的自适应局部搜索操作以增强局部搜索能力。对以往文献给出算例在不同凹费用函数下进行测试,实验结果显示所提出的算法明显优于BFD启发式算法,并且较遗传算法也有显著性改进。     

Adaptive Fourier decomposition‐based Dirac type time‐frequency distribution

The Dirac‐type time‐frequency distribution (TFD), regarded as ideal TFD, has long been desired. It, until the present time, cannot be implemented, due to the fact that there has been no appropriate representation of signals leading to such TFD. Instead, people have been developing other types of TFD, including the Wigner and the windowed Fourier transform types. This paper promotes a practical passage leading to a Dirac‐type TFD. Based on the proposed function decomposition method, viz., adaptive Fourier decomposition, we establish a rigorous and practical Dirac‐type TFD theory. We do follow the route of analytic signal representation of signals founded and developed by Garbo, Ville, Cohen, Boashash, Picinbono, and others. The difference, however, is that our treatment is theoretically throughout and rigorous. To well illustrate the new theory and the related TFD, we include several examples and experiments of which some are in comparison with the most commonly used TFDs. Copyright © 2016 John Wiley & Sons, Ltd.     

Synchronization of complex networks with time‐varying inner coupling and outer coupling matrices

Synchronization of complex networks with time‐varying coupling matrices is studied in this paper. Two kinds of time‐varying coupling are taken into account. One is the time‐varying inner coupling in the node state space and the other is the time‐varying outer coupling in the network topology space. By respectively setting linear controllers and adaptive controllers, time‐varying complex networks can be synchronized to a desired state. Meanwhile, different influences of the control parameters of linear controllers and adaptive controllers on the synchronization have also been investigated. Based on the Lyapunov function theory, we construct appropriate positive‐definite functions, and several sufficient synchronization criteria are obtained. Numerical simulations further illustrate the effectiveness of conclusions. Copyright © 2017 John Wiley & Sons, Ltd.     

A self‐adaptive intelligence gray prediction model with the optimal fractional order accumulating operator and its application

The self‐adaptive intelligence gray predictive model (SAIGM) has an alterable‐flexible model structure, and it can build a dynamic structure to fit different external environments by adjusting the parameter values of SAIGM. However, the order number of the raw SAIGM model is not optimal, which is an integer. For this, a new SAIGM model with the fractional order accumulating operator (SAIGM_FO) was proposed in this paper. Specifically, the final restored expression of SAIGM_FO was deduced in detail, and the parameter estimation method of SAIGM_FO was studied. After that, the Particle Swarm Optimization algorithm was used to optimize the order number of SAIGM_FO, and some steps were provided. Finally, the SAIGM_FO model was applied to simulate China's electricity consumption from 2001 to 2008 and forecast it during 2009 to 2015, and the mean relative simulation and prediction percentage errors of the new model were only 0.860% and 2.661%, in comparison with the ones obtained from the raw SAIGM model, the GM(1, 1) model with the optimal fractional order accumulating operator and the GM(1, 1) model, which were (1.201%, 5.321%), (1.356%, 3.324%), and (2.013%, 23.944%), respectively. The findings showed both the simulation and the prediction performance of the proposed SAIGM_FO model were the best among the 4 models.     

On the largest prime factor of shifted primes

For any integer n ≥ 2, let P(n) be the largest prime factor of n. In this paper, we prove that the number of primes p ≤ x with P(p-1) ≥ p~c is more than(1-c + o(1))π(x) for 0 c 1/2. This extends a recent result of Luca, Menares and Madariaga for1/4≤ c ≤1/2. We also pose two conjectures for further research.     

Hereditary,Additive and Divisible Classes in Epireflective Subcategories of Top

Hereditary coreflective subcategories of an epireflective subcategory A of Top such that I ₂ ? A (here I ₂ is the two-point indiscrete space) were studied in [4]. It was shown that a coreflective subcategory B of A is hereditary (closed under the formation subspaces) if and only if it is closed under the formation of prime factors. The main problem studied in this paper is the question whether this claim remains true if we study the (more general) subcategories of A which are closed under topological sums and quotients in A instead of the coreflective subcategories of A. We show that this is true if A ? Haus or under some reasonable conditions on B. E.g., this holds if B contains either a prime space, or a space which is not locally connected, or a totally disconnected space or a non-discrete Hausdorff space. We touch also other questions related to such subclasses of A. We introduce a method extending the results from the case of non-bireflective subcategories (which was studied in [4]) to arbitrary epireflective subcategories of Top. We also prove some new facts about the lattice of coreflective subcategories of Top and ZD.