盾构隧道施工物料无人运输发展现状及关键技术

盾构隧道施工物料无人运输有助于提升运输效率、降低运输成本、减少运输安全事故率。与公路汽车无人驾驶、港口车辆无人驾驶、轨道交通无人驾驶等逐步成熟的无人驾驶技术不同，在隧道场景下实施施工物料无人运输存在运输物料种类繁多、运输调度困难、地下定位信号拒止、狭窄车道频繁会车、行车路面工况复杂、地上地下联动响应慢等诸多挑战。从实现盾构隧道施工物料无人运输的关键问题分析入手，综述当前盾构隧道施工物料运输方式、运输需求、无人运输发展现状及存在的挑战，提出盾构隧道施工物料无人运输的五大关键技术：多种类物料智能货控能效管理技术，无人化垂直装卸门机控制技术，多传感器融合同步定位与地图构建技术，隧道复杂环境路径规划与自主避障技术，隧-地一体化联动响应的高可靠性无线通信技术。     

非线性正则代数微分方程系统的控制

介绍一类非线性正则代数微分方程(DAEs)的反馈控制:对奇异代数方程进行一系列代数变换来定义x的基本代数约束,对这些约束进行微分直到得到的方程可以获得代数变量z的解.然后便可获得其状态空间实现,并作为控制器综合的基础.     

高纯均匀A1-V4中间合金制备工艺研究

利用铝热还原法，通过过量铝粉一步还原工业V2O5得到Al－V50合金。在300kg熔铝用中频感应炉中， 温度1050－1150℃，把Al－V50分批加入Al99．85熔体，机械装置强力搅拌条件下。可以生产出优质高纯且成分均匀的Al－V4中间合金，并用于生产各种大型复杂关键的ZL205A合金铸件。     

通用树脂制备分离膜的研究进展

综述了近年来制备聚丙烯(PP)、聚乙烯(PE)分离膜及分离膜表面改性的研究进展,介绍了熔融纺丝-冷却拉伸法、热致相分离法、共混拉伸法、熔融烧结法等分离膜的常用制备方法。PP、PE分离膜的制备在我国有着广阔的发展前景。     

A THEORETICAL STUDY OF MASS AND HEAT TRANSFER IN FILM FLOW OF NONNEWTONIAN POWER LAW FLUIDS

The exact expressions of concentration and local or average Sherwood number,Sh or Sh for non-Newtonian fluids which obey the famous power law:τ={K|1/2(1/2)~(1/2)|~(n=1)}in which the flow index n takes any positive rational value,have been obtained by solving the differen-tial equation of diffusion together with the velocity distribution in the falling film flow.The use of Fourth-order Runge-Kutta method and Wegstien's iteration method by means of thecomputer yields results which are a series of values of dimensionless concentration O,local and averageSherwood number for n equal to 1/4,1/3,1/2,1/1.4,1/1.2,1,1.25,2.5,and ∞.When the flow indexn=1,i.e.for Newtonian fluids,the result agrees well with the data from the literature.     

结合汉明码和图像矫正的彩色图像盲水印

目的 随着互联网技术的飞速发展,彩色数字图像带来极大便利的同时,也产生了一些篡改、剽窃等侵权行为;同时,几何处理对含水印载体的破坏使水印盲检测的难度增加,因此,本文提出一种基于汉明码和图像矫正的彩色图像盲水印方法,旨在解决当前图像版权保护的难点问题。方法 嵌入水印时,使用仿射变换加密彩色水印,并将已加密的信息编为汉明码,然后利用特征值分解计算出像素块的全部特征值,并通过对特征值绝对值的和进行量化来完成水印的嵌入;提取水印时,利用图像的几何属性对多种几何攻击后的图像进行判断、矫正,并借助量化技术提取水印。结果 基于彩色图像标准数据库,将本文方法与7种相关方法进行了对比实验：在不可见性方面,与LU分解的水印方法相比,本文算法峰值信噪比（peak signal-to-noise ratio,PSNR）提高了4 dB;在常规攻击鲁棒性方面,与Schur分解的最新方法相比,本文算法平均归一化互相关（normalized cross-correlation,NC）的值稍有提高;在几何攻击鲁棒性方面,本文算法NC值具有一定的优势;同时,本文算法的水印容量达到了0.25 bit/像素,密钥空间达到了2⁴³²,运行时间仅需3 s左右。结论 所提方法不仅具有较好的水印不可见性和较强的鲁棒性,而且具有较大的水印容量、较高的安全性和实时性。     

钨酸锆填料与沥青的粘附与水损害特性

为分析亲水性钨酸锆材料作为沥青混合料填料的合理性,基于表面能和粘附功理论,对不同填料和沥青的表面能参数及粘附功进行测试和计算,通过设计水侵蚀试验,研究不同填料组成的沥青胶浆在水损害条件下的自由能和拉拔强度变化规律.试验结果表明:钨酸锆填料具有更大的Lewis碱和范德华表面能分量,基质沥青则具备比SBS改性沥青更大的Lewis酸碱和范德华表面能分量;在干燥状态下,钨酸锆替代矿粉作为填料,可提高其与沥青的粘附功,进而提高沥青胶浆拉拔强度;在有水侵蚀下,钨酸锆沥青胶浆具有更大的表面自由能变化,水更倾向于取代基质沥青与钨酸锆浸润.钨酸锆沥青胶浆比矿粉胶浆具有稍差的耐水损害能力.     

Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees

A set A is computably Lipschitz or cl-reducible, for short, to a set B if A is Turing reducible to B by an oracle Turing machine with use function ? such that ? is bounded by the identity function up to an additive constant, i.e., ?(n)??n+O(1). In this paper we study maximal pairs of computably enumerable (c.e.) cl-degrees or maximal pairs, for short, i.e., pairs of c.e. cl-degrees such that there is no c.e. cl-degree that is above both cl-degrees in this pair. Our main results are as follows. (1) A c.e. Turing degree contains a c.e. cl-degree that is half of a maximal pair if and only if this Turing degree contains a maximal pair if and only if this Turing degree is array noncomputable. (2) The cl-degrees of all weak truth-table complete sets are halves of maximal pairs while there is a Turing complete set A such that the cl-degree of A is not half of any maximal pair. In fact, any high c.e. Turing degree contains a c.e. cl-degree that is not half of a maximal pair. (3) Above any c.e. cl-degree there is a maximal pair. (4) There is a maximal pair which at the same time is a minimal pair. (5) There is a pair of c.e. cl-degrees that is not maximal and does not possess a least upper bound. Moreover, we make some observations on the structure of the c.e. cl-degrees in general. For instance, we give a very simple proof of the fact that there are no maximal c.e. cl-degrees.     

基于肠道菌群探讨葛根芩连汤治疗湿热型2型糖尿病研究进展*

摘 要: 近年来世界范围内2型糖尿病(Diabetes Mellitus type 2,T2DM)的发病率不断上升。微生态学研究证实,T2DM疾病的发生与肠道菌群数量及比例的失调有很大的关联性,这成为研究热点。现有实验发现:肠道菌群紊乱可通过短链脂肪酸学说、胆汁酸代谢学说、内毒素学说、支链氨基酸学说等机制来影响T2DM的发生发展。湿热证T2DM患者在临床最为常见,该类患者胰岛素抵抗最为严重,而动物实验研究发现葛根芩连汤可通过特定的分子机制及通路作用于肠道菌群,通过调节胰岛β细胞的功能、提高胰岛素敏感性、减轻氧化应激反应,从而调节血糖,减轻胰岛素抵抗,为临床治疗T2DM患者提供更科学的依据。但由于菌群数量庞杂,现有数据多偏重于动物实验,且研究菌群特异性不足,为此今后需进一步加强对T2DM特定菌群的研究,以及增加临床大样本数据统计。     

Another Sub-exponential Algorithm for the Simple Stochastic Game

We study the problem of solving simple stochastic games, and give both an interesting new algorithm and a hardness result. We show a reduction from fine approximation of simple stochastic games to coarse approximation of a polynomial sized game, which can be viewed as an evidence showing the hardness to approximate the value of simple stochastic games. We also present a randomized algorithm that runs in \(\tilde{O}(\sqrt{|V_{\mathrm{R}}|!})\) time, where |V _R| is the number of RANDOM vertices and \(\tilde{O}\) ignores polynomial terms. This algorithm is the fastest known algorithm when |V _R|=ω(log?n) and \(|V_{\mathrm{R}}|=o(\sqrt{\min{|V_{\min}|,|V_{\max}|}})\) and it works for general (non-stopping) simple stochastic games.