基于网络药理学-分子对接探索大黄牡丹汤治疗大肠癌的作用机制

目的：利用网络药理学-分子对接技术探索经方大黄牡丹汤治疗大肠癌的作用机制。方法：通过TCMSP、TCMID数据库获得大黄牡丹汤药物成分,通过PubChem、Swisstarget prediction数据库获得药物成分对应靶点,分析GSE113513芯片获得差异基因,随即获取大黄牡丹汤与大肠癌的共同靶点。利用R、Cytoscape、Autodock软件进行PPI、GO、KEGG、分子对接等分析。结果：获得大黄牡丹汤靶点561个,大肠癌差异基因1227个,共同靶点71个。共同靶点的通路富集分析显示主要与PPAR、p53等信号通路相关,Reactome机制分析显示大黄牡丹汤治疗大肠癌主要通过影响信号转导、免疫系统、疾病等产生作用,分子对接结果显示大肠癌核心靶点与大黄牡丹汤主要成分亲和力较好,能够有效自由结合。结论：经方大黄牡丹汤可通过多层次、多途径、多靶点发挥对大肠癌的治疗作用。     

相空间重构在滑坡预测中的应用

针对滑坡位移时间序列的非线性特性,引入基于相空间重构和最小二乘支持向量机(LSSVM)的预测法.利用Cao氏方法确定嵌入维数,根据互信息法计算最佳延迟时间;然后在相空间中,利用最小二乘支持向量机(LSSVM)建立预测模型,对滑坡进行了实证计算,且与LSSVM模型和BP神经网络模型进行了比较.结果表明,模型具有较高的精度...     

Efficient seismic response data storage and transmission using ARX model‐based sensor data compression algorithm

This paper presents a linear predictor (LP)‐based lossless sensor data compression algorithm for efficient transmission, storage and retrieval of seismic data. Auto‐Regressive with eXogenous input (ARX) model is selected as the model structure of LP. Since earthquake ground motion is typically measured at the base of monitored structures, the ARX model parameters are calculated in a system identification framework using sensor network data and measured input signals. In this way, sensor data compression takes advantage of structural system information to maximize the sensor data compression performance. Numerical simulation results show that several factors including LP order, measurement noise, input and limited sensor number affect the performance of the proposed lossless sensor data compression algorithm concerned. Generally, the lossless data compression algorithm is capable of reducing the size of raw sensor data while causing no information loss in the sensor data. Copyright © 2005 John Wiley & Sons, Ltd.     

复杂网络中多话题信息传播仿真研究

传统复杂网络话题传播研究,重点关注的是单个话题在网络中的传播,较少考虑多话题之间的相互影响因素。论文分析舆论传播过程中多个话题之间的竞争关系对话题传播的影响机制,建立基于复杂网络的多话题信息传播模型。通过对模型仿真实验及其结果分析表明,当引入个体信息环境影响因素后,一个话题的影响力大于舆论话题环境中其他话题的平均影响力,才会有较大概率影响到更多个体,否则只能在小范围内传播;个体对于话题记忆能力的变化在不同网络中会产生不同影响,在随机网络和BA网络中,人们对于话题的记忆越深,其传播的影响范围越大,而在规则网络和小世界网络中,较小的记忆长度能够让话题传播影响力更大;同时,在具有社群结构的网络中,度大的节点并非会一定会更多的参与某一话题的传播,因为度大的节点有更大概率获得更多的话题。     

湖南东江水库诱发地震

东江水库自蓄水前约半年起就开始进行地震监测，发震后通过密集台网强化观测、震源机制解及地震地质等多项工作，综合研究该库诱发地震发震原因，认为由于库水渗透引起的多种局部性应力调整导致水库诱发地震活动．其发展趋势将表现为逐渐衰减，今后不致于发生破坏性地震．     

Assessment of flow paths and confluences for saltwater intrusion in a deltaic river network

Saltwater intrusion is a serious issue in estuarine deltas all over the world due to rapid urban sprawl and water shortage. Therefore, detecting the major flow paths or locations at risk of saltwater intrusion in estuarine ecosystems is important for mitigating saltwater intrusion. In this paper, we introduce a centrality index, the betweenness centrality (BC), to address this problem. Using the BC as the weighted attribute of the river network, we identify the critical confluences for saltwater intrusion and detect the preferential flow paths for saltwater intrusion through the least‐cost‐path algorithm from a graph theory approach. Moreover, we analyse the responses of the BC values of confluences calculated in the river network to salinity. Our results show that the major flow paths and critical confluences for saltwater intrusion in a deltaic river network can be represented by the least cost paths and the BC values of confluences, respectively. In addition, a significant positive correlation between the BC values of confluences and salinity is determined in the Pearl River Delta. Changes in the salinity can produce significant variation in the BC values of confluences. Therefore, freshwater can be diverted into these major flow paths and critical confluences to improve river network management under saltwater intrusion. Copyright © 2015 John Wiley & Sons, Ltd.     

A block-based selection method for road network generalization

Abstract

When road symbols are shown in a size proportionate to the reduced scale, several problems of legibility may arise concerning the urban blocks. By the method proposed in this paper, in order to overcome these problems, urban block areas are enlarged through amalgamation and the intervening roads in the amalgams are eliminated. This method includes two new approaches for computation of threshold used in determination of important roads based on the connectivity measure, and for definition of minimum block space and area requirements based on graphic limits. A block life cycle was designed for amalgamation of blocks. For the amalgamation process, a new algorithm was developed. The experimental testing indicates that important roads and the roads surrounding the urban area have been preserved. A simpler and more legible road network has been acquired. This method can be described as a more holistic approach as the buildings are taken into account. The problems arising in the experimental testing indicate that the cartographic selection/elimination process is not sufficient by itself for road network generalization, which can be assumed as one of the integral parts of Digital Earth. As well as the selection/elimination, processes such as displacement and caricaturizing are also needed.     

Enrichment of topographic road database for the purpose of routing and navigation

With growing demand on multi-purpose or multi-modal navigation, the route calculation needs to traverse semantically enriched road networks for different transportation modes. Currently, operational route planning algorithms reveal rather limited performances or their potential for comprehensive applications are constrained by the unavailable or insufficient interoperation among the underlying geo-data that are separately maintained in different spatial databases. To overcome this limitation, a novel approach has been proposed to integrate the routing-relevant information from different data sources, which involves three processes: (1) automatic matching to identify the corresponding road objects between different datasets; (2) interaction to refine the automatic matching result; and (3) transferring the routing-relevant information from one data-set to another. In process (1), the Delimited Stroke Oriented algorithm is employed to achieve the automatic data matching between different datasets, which has revealed a high matching rate and certainty. However uncertain matching problems occur in areas where topological conditions are too complicated or inconsistent. The remaining unmatched or wrongly matched objects are treated in process (2), with the help of a series of interaction tools. On the basis of refined matching results after the interaction, process (3) is dedicated to automatic integration of the routing-relevant information from different data sources.     

城市交通网络分形维数的不确定性估计、控制与分析

长度-半径维数模型作为描述城市交通网络复杂不确定性现象的一种分形分维方法,其自身存在的不确定性往往被忽视,且相关研究更是鲜见报道。故针对该模型在分形维数测算全过程中存在的不确定性问题,本文率先开展了系统剖析、定量估计和质量控制研究。首先对数据源、矢量化处理、测算中心、尺度选择、以及分维数模型估计等一系列环节进行了不确定性估计与分析,其中首次给出了分形维数在一定置信水平下的不确定性度量区间,并依据误差传播理论对误差的传递和累积进行了描述;然后着重提出了基于LMed S(Least Median of Squares)的质量控制方法。最后通过对拉萨市的算例实验表明:道路的矢量化过程、测算中心和测算尺度的选择都会导致分维的不确定性;并在对数据质量进行控制的基础上,通过置信区间对长度-半径维数模型的不确定性进行了在一定概率水平下的首次度量;同时结合区域现状对研究结果给出了合乎实际的解释。本文在描述表征不确定性问题的分形几何和分形维数的基础上,系统地揭示了其自身不确定性的本质,不仅进一步丰富了分形分维理论,为控制其质量奠定理论基础,而且可为城市交通网络分形维数的地学应用提供可靠的科学依据。     

基于交通信息流的江苏省流空间网络结构研究

基于江苏省13个地级市之间的公路、普速列车、高铁（CRH）与信息网络数据,从流空间视角对江苏省空间结构特征及其发展趋势进行综合分析与判断。结果表明：① 公路和普速铁路网络所展现的区域空间结构较为无序且影响范围有限,高铁网络则在大幅度拓展城市有效联系范围的同时凸显了发达地区的重要地位,而信息网络所反映的空间结构更加完整、有序与协调,代表了未来江苏省城市联系网络的发展方向;② 在高铁与信息网络的冲击下,流空间视角下的江苏省省域空间结构研究显出了一些区别于传统认知的新特征与变化趋势,如跳跃性的与非相邻地区产生主要联系、“等级+网络”的变化趋势等;③ 基于交通信息流的江苏省流空间结构呈现出明显的“中心-外围”格局,区域联系线密度由“沪宁线”向“沿海线”逐级递减,空间结构指数的计算结果也基本支持这一论断;④ 以高铁与信息为代表的新要素流对江苏省省域空间格局网络化的效率与公平产生了积极与消极两种影响,前者体现在改善区际可达性促进区域发展,后者体现在核心城市的“虹吸效应”。