Disjoint Paths in Decomposable Digraphs

The k‐linkage problem is as follows: given a digraph and a collection of k terminal pairs such that all these vertices are distinct; decide whether D has a collection of vertex disjoint paths such that is from to for . A digraph is k‐linked if it has a k‐linkage for every choice of 2k distinct vertices and every choice of k pairs as above. The k‐linkage problem is NP‐complete already for [11] and there exists no function such that every ‐strong digraph has a k‐linkage for every choice of 2k distinct vertices of D [17]. Recently, Chudnovsky et al. [9] gave a polynomial algorithm for the k‐linkage problem for any fixed k in (a generalization of) semicomplete multipartite digraphs. In this article, we use their result as well as the classical polynomial algorithm for the case of acyclic digraphs by Fortune et al. [11] to develop polynomial algorithms for the k‐linkage problem in locally semicomplete digraphs and several classes of decomposable digraphs, including quasi‐transitive digraphs and directed cographs. We also prove that the necessary condition of being ‐strong is also sufficient for round‐decomposable digraphs to be k‐linked, obtaining thus a best possible bound that improves a previous one of . Finally we settle a conjecture from [3] by proving that every 5‐strong locally semicomplete digraph is 2‐linked. This bound is also best possible (already for tournaments) [1].     

Non-parametric clustering over user features and latent behavioral functions with dual-view mixture models

We present a dual-view mixture model to cluster users based on their features and latent behavioral functions. Every component of the mixture model represents a probability density over a feature view for observed user attributes and a behavior view for latent behavioral functions that are indirectly observed through user actions or behaviors. Our task is to infer the groups of users as well as their latent behavioral functions. We also propose a non-parametric version based on a Dirichlet Process to automatically infer the number of clusters. We test the properties and performance of the model on a synthetic dataset that represents the participation of users in the threads of an online forum. Experiments show that dual-view models outperform single-view ones when one of the views lacks information.     

一种结构故障的振动诊断法

文章分析了振动参数对结构故障的敏感度，选取对故障比较敏感、又能反映结构动力特性的频响函数，作为诊断故障的参数，采用了最小二乘辨识、卡尔曼滤波、自适应滤波等方法，进行故障诊断、仿真试验的结果表明，本文提出的方法可行，且有一定精度，实物试验结果表明，当局部刚度下降5%时，运用本文方法可诊断出故障。     

提高光电编码器分辨率的位置细分方法的研究

本文提出一种实用可行的光电码盘分辨率的位置细分方法——幅值细分方法，从原理上进行了深入的分析，并设计了硬件电路，同时采用软件算法解决了细分中存在的随机干扰和非线性补偿问题。这种方法具有实时、细分数高且任意可调的特点。     

SYNTHESIS AND CHARACTERIZATION OF SURFACE-HYPERBRANCHED MAGNETITE NANOPARTICLE FOR BOVINE SERUM ALBUMIN IMMOBILIZATION

A hyperbranched polyamidoamine polymer was synthesized on the surface of magnetite nanoparticles to enhance bovine serum albumin (BSA) immobilization efficiency. The amount of immobilized bovine serum albumin (BSA) on the surface-hyperbranched magnetite nanoparticle was up to 2.5 times as much as that of magnetite nanoparticle modified with only amino silane.     

核电工程地质（二）

核电工程地质（二）古迅（中国科学院地质研究所北京100029）3能动断层及其调查与评价3.1关于活动断层断层活动是现代地壳活动最为强烈的一种构造作用,因此,活动断层作为说明地壳的现代活动性的一个重要的地质标志。     

结构形状优化设计数值方法的研究和应用

本文论述了连续体结构形状优化设计数值方法的研究和应用进展,讨论了结构模型化、灵敏度分析、优化方法改进、优化实用软件开发以及同CAD技术相结合等问题,介绍了在结构优化设计软件MCADS中采用的方法,并通过工程实例说明了结构形状优化设计的应用及其价值。     

求解转子系统突加不平衡响应方法的研究

本文提出并研究了用传递函数分析法求转子系统的突加不平衡响应,讨论了求这一响应的最佳数值积分方法。用本文提出的理论解方法及三种常用的数值积分法:尤拉后差法,纽马克法,及呼伯特法,对一模型转子算例进行了分析计算,结果表明;尤拉后差法最适用于求转子系统的突加不平衡响应。本文提出的传递函数分析法,可以和试验模态分析方法相结合,以求解复杂转子系统的突加不平衡响应。     

核电工程地质(五)

核电工程地质(五)古迅(中国科学院地质研究所北京100029)7反应堆厂房周围边坡的勘察、试验和稳定性评价核电厂的核设施, 在任何情况下都必须维持其功能, 确保安全性。     

考虑设计规范的海洋平台结构选型优化

针对具体海洋环境条件和生产要求，对导管架平台结构进行选型优化——拓扑布局与构件尺寸的联合优化，充分考虑设计规范的要求，建立多设计准则、多约束条件和多荷载工况的设计模型，其中环境荷载包括：风、浪、流、海冰从不同方向对平台的作用。通过结构选型优化获得最佳的结构拓扑布局形式，在降低平台造价的同时，设计出满足结构的稳定特性、安全寿命等多种设计准则的新型平台结构。