A reversible infinite HMM using normalised random measures

Copyright 2014 by the author(s). We present a nonparametric prior over reversible Markov chains. We use completely random measures, specifically gamma processes, to construct a countably infinite graph with weighted edges. By enforcing symmetry to make the edges undirected we define a prior over random walks on graphs that results in a reversible Markov chain. The resulting prior over infinite transition matrices is closely related to the hierarchical Dirichlet process but enforces reversibility. A reinforcement scheme has recently been proposed with similar properties, but the de Finetti measure is not well characterised. We take the alternative approach of explicitly constructing the mixing measure, which allows more straightforward and efficient inference at the cost of no longer having a closed form predictive distribution. We use our process to construct a reversible infinite HMM which we apply to two real datasets, one from epigenomics and one ion channel recording.

Preparation of pH-sensitive polymer by thermal initiation polymerization and its application in fluorescence immunoassay

A fluorescence immunoassay for human IgG (Ag) was developed using a pH-sensitive polymer prepared by thermal initiation or redox initiation polymerization as a carrier. In the competitive immunoassay, appropriate quantity of Ag was immobilized on the polymer and the standard Ag (or sample) solution, and a constant amount of fluorescein isothiocyanate labeled goat anti-human IgG antibody (Ab-FITC) was added. Immobilized Ag and the standard (or sample) Ag competed for binding to the Ab-FITC in 37 C in homogeneous format. After changing the pH to separate the polymer-immune complex precipitate, it was re-dissolved and determined by fluorescence method. The results showed that the immobilization efficiency, immunological reaction activities of immobilized Au and phase transition pH range were improved as Ag was immobilized by thermal initiation instead of redox initiation polymerization. Under optimum conditions, the calibration graphs for the Ag in both methods, thermal initiation and redox initiation, were linear over the concentration range of 0.0-1000 ng mL(-1), with detection limits 8 (thermal initiation) and 12 ng mL(1) (redox initiation), respectively. Moreover, some pH-sensitive polymer prepared only in organic solvent or under high temperature could also be used as an immunoreaction carrier by thermal initiation polymerization. Thermal initiation polymerization was a better immobilization mode. (C) 2004 Elsevier B.V. All rights reserved.

Viruses' complete genomes classification based on geometrical learning

In this paper, we proposed a method of classification for viruses' complete genomes based on graph geometrical theory in order to viruses classification. Firstly, a model of triangular geometrical graph was put forward, and then constructed feature-space-samples-graphs for classes of viruses' complete genomes in feature space after feature extraction and normalization. Finally, we studied an algorithm for classification of viruses' complete genomes based on feature-space-samples-graphs. Compared with the BLAST algorithm, experiments prove its efficiency.

Complex networks constructed from irrational number sequences

In this paper, we construct (d, r) networks from sequences of different irrational numbers. In detail, segment an irrational number sequence of length M into groups of d digits which represent the nodes while two consecutive groups overlap by r digits (r = 0,1,...,d-1), and the undirected edges indicate the adjacency between two consecutive groups. (3, r) and (4, r) networks are respectively constructed from 14 different irrational numbers and their topological properties are examined. By observation, we find that network topologies change with different values of d, r and even sequence length M instead of the types of irrational numbers, although they share some similar features with traditional random graphs. We make a further investigation to explain these interesting phenomena and propose the identical-degree random graph model. The results presented in this paper provide some insight into distributions of irrational number digits that may help better understanding of the nature of irrational numbers.

谓词μ演算和模态图的语义一致性

模态图是谓词μ演算的一种有效的图形表示形式。证明了谓词μ演算和模态图的语义一致性，详细讨论了谓词μ演算公式、嵌套谓词等式系和模态图之间的关系，并给出了一种优化的从线性公式到嵌套谓词等式系的转换算法。

带赋值符号迁移图的局部优化算法

National Natural Science Foundation of China; Public Administration and Civil Service Bureau of Macau SAR; Companhia de Telecomunicacoes de Macau S.A.R.L.; Macau SAR Government Tourist Office

一种基于OBDD图的事件复合匹配方法

基于内容的Pub／Sub系统的核心问题是基于内容的事件匹配．在现有的方法中，订阅者使用简单约束来匹配事件内容，难以支持事件复合匹配．针对此问题，提出新的匹配模型，扩展简单匹配方法为多语义匹配并引入时间约束变量，支持依据语义对事件采取不同的操作和离散事件的处理，增强了事件匹配表达能力.在此基础上，将OBDD图扩展为层次着色OBDD图，证明了图扩展的等价性，给出基于扩展ODBB图的复合匹配算法，分析并验证了该算法的有效性．

Determination of appropriate condition on replacing methane from hydrate with carbon dioxide

This paper is intended to determine the appropriate conditions for replacing CH4 from NGH with CO2. By analyzing the hydration equilibrium graphs and geotherms, the HSZs of NGH and CO2 hydrate, both in permafrost and under deep sea, were determined. Based on the above analysis and experimental results, it is found that to replace CH4 from NGH with gaseous CO2, the appropriate experimental condition should be in the area surrounded by four curves: the geotherm, (H-V)(CO2), (L-V)(CO2) and (H-V)(CH4), and to replace CH4 from NGH with liquid CO2, the condition should be in the area surrounded by three curves: (L-V)(CO2), (H-L)(CO2) and (H-V)CH4. For conditions in other areas, either CO2 can not form a hydrate or CH4 can release little from its hydrate, which are not desirable results.

基于GIS和CSLE的陕西省土壤侵蚀定量评价方法研究

通过对陕西省土壤侵蚀的定量评估,探索省域尺度上土壤侵蚀定量评价制图方法,以期为第四次全国土壤侵蚀普查提供技术支撑。利用陕西省日降雨数据、土壤类型图、土地利用图、DEM、植被覆盖图,选择CSLE模型,在ArcGIS平台上计算研究区2006年土壤侵蚀量,并与水利部标准评价结果进行对比分析。探索了坡度坡长变换对土壤侵蚀的影响。定量化的评价结果能较好的反映气候、土壤及水保措施对土壤侵蚀的影响,比水利部标准评价结果更能反映实际侵蚀。坡度坡长变换后对土壤侵蚀有明显影响。在GIS支持下,通过土壤侵蚀模型进行定量评价,可高效、客观反映土壤侵蚀情况及其主要影响因子,对区域治理和有关决策有极其重要参考价值。为了准确真实的反映土壤侵蚀程度,必须进行坡度坡长变换。

Magnetic characterization of Co1-xNixFe2O4 (0 <= x <= 1) nanoparticles prepared by co-precipitation route

Magnetic nanoparticles of Ni-doped cobalt ferrite [Co1-xNixFe2O4(0 <= x <= 1)] synthesized by coprecipitation route have been studied as a function of doping concentration (x) and particle size. The size of the particles as determined by X-ray diffractometer (XRD) and transmission electron microscope (TEM) analyses was found in the range 12-48 nm. The coercivity (H-C) and saturation magnetization (M-S) showed a decreasing behavior with increasing Ni concentration. M-S of all the samples annealed at 600 degrees C lies in the range 65.8-13.7 emu/gm. Field-cooled (FC) studies of the samples showed horizontal shift (exchange bias) and vertical shift in the magnetization loop. Strong decrease in exchange bias (H-b) and vertical shift (delta M) was found for low Ni concentrations while negligible decrease was found at higher concentrations. The presence of exchange bias in the low Ni-concentration region has been explained with reference to the interface spins interaction between a surface region (with structural and spin disorder) and a ferrimagnetic core region. M(T) graphs of the samples showed a decreasing trend of blocking temperature (T-b) with increasing Ni concentration. The decrease of T-b with increasing Ni concentration has been attributed to the lower anisotropy energy of Ni+2 ions as compared to Co+2 that increases the probability of the jump across the anisotropy barrier which in turn decreases the blocking temperature of the system.

Range-based attacks on links in random scale-free networks

Range and load play key roles in the problem of attacks on links in random scale-free (RSF) networks. In this paper we obtain the approximate relation between range and load in RSF networks by the generating function theory, and then give an estimation about the impact of attacks on the efficiency of the network. The results show that short-range attacks are more destructive for RSF networks, and are confirmed numerically.

基于Context_Graphs的主题爬虫系统的设计与实现

为了利用有限的硬件资源和存储空间，即时获取网络上用户最关心的数据，研究者们提出了主题爬虫。以往的通用爬虫既不考虑页面内容与主题的相关度，也不做任何预测，相比之下，主题爬虫以一定策略去评价网页的优先度，选择最为可能获取主题网页的路径进行搜索，因此有能力更快更准地获取目标网页。 主题爬虫爬行策略有很多方法，其中，Context Graphs方法是一种结合了网页的文字内容信息与Web超链结构信息的综合方法。Context Graphs方法将网络中的页面视为分层的结构，链接到达主题网页的页面根据其特征会被分到一定层次中。基于各个层次的特征，可以指导爬行器更快地去发掘可能存在的主题页面。然而，以往的Context Graphs方法在建立层次模型的时候没有区分网页不同部分文本信息的重要程度，但是在很多情况下，网页标题、超链锚文字等信息在区分网页主题时比网页正文内容更重要。此外，Context Graphs方法在指导抓取的时候不能根据新得到的主题网页更新模型，事实上，如果能利用这些新得到的网页来增量更新模型，将有可能获得更为准确的结果。基于这两点，作者提出了一种采用混合打分法以及引入模型反馈更新机制的M-Context Graphs方法，并进一步设计并实现了一个主题爬虫原型系统。 本文首先对目前已有的和正在探索中的各种主题爬行策略进行了综述和分析，并对国内外主题爬虫系统的开发现状做了简要介绍；接下来，本文详细介绍了M-Context Graphs方法中的混合打分法和模型反馈更新策略，并进一步给出了一个主题爬虫原型系统的详细设计和实现方案。最后，利用该系统通过实验比较了M-Context Graphs算法与以往算法，结果表明，M-Context Graphs方法确实获得了更好的效果。