基于化学计量学结合ICP-MS的党参道地性的研究及安全评价

微量元素与中药的功效和安全性密切相关,也是药材道地性研究的一部分,为探讨党参中重金属元素的安全性、风险性及道地性的相关性。本文采用电感耦合等离子体质谱法（ICP-MS）及原子荧光光谱法(AFS)测定来源于甘肃、山西、湖北、四川等产区的39批党参药材中的20种元素的含量,结果结合化学计量学分析对党参产区进行差异判别。通过单因子污染指数法和内梅罗综合污染指数法对其进行安全性评价,通过健康风险基于暴露量、危害指数法和暴露限值法对其进行风险评估。结果表明,重金属在各自范围内线性关系良好,加样回收率,仪器精密度和重复性良好,其中 Ba、Sr、Mn的含量最高。主成分分析显示39批药材分为三类,同一产区的党参能较好的聚在一起,元素含量差异与产区分布有一定规律,其中Cs、Ga、As、Co、Li、Pb、Hg、Se、V、Mn为关键的差异标志物,为产地元素特征分析鉴别提供依据。安全评价结果为39批党参药材污染等级为安全,但风险评估后DS-31、DS-32、DS-34、DS-36及 DS-37在人体长期蓄积中具有健康风险。结论：本研究方法高效、准确、简便,结合化学计量学可以对党参进行有效的产地判别,评价党参中元素的安全性及风险性,为党参道地性及健康评价提供了科学依据。     

水体透射光谱结合主成分分析(PCA )改进化学需氧量(COD)含量估算研究

化学需氧量（Chemical Oxygen Demand,COD）是水体有机污染的一项重要指标,化学需氧量越高,表示水污染程度越严重。 为了解决传统的COD测量方法耗时较长,不利于快速、实时地获取水体中COD的信息等问题。本文提出了基于透射光谱测量结合主成分分析(Principal Component Analysis, PCA)改进水体COD含量估算模型。具体的,采集100组COD水体光谱信息,分别使用3种不同的高光谱数据预处理方法对光谱数据进行预处理,分析不同预处理方法对模型精度的影响,并基于不同的预处理方法分别建立高斯过程回归模型(Gaussian Process Regression, GPR)和BP神经网络模型,分析不同预处理方法对模型精度的影响;并对各模型结合PCA数据降维方法进行模型的改进,通过比较模型的精度选择最优模型进行水体COD含量的检测。结果显示,相比于原始光谱数据建立的GPR模型和BP神经网络模型,数据预处理后的模型精度明显提升;且结合PCA对预处理后的数据进一步降维处理后,模型精度得到了进一步的提升。其中,基于标准正态变量变换特征结合PCA改进BP神经网络模型基于PCA改进的BP神经网络模型R^2高达0.9940,均方根误差RMSE为0.022540。证明了基于PCA改进的BP神经网络数据降维方法对预处理后的光谱数据进行降维处理,有利于去除光谱中的冗余信息,提取特征信息,可以实现高光谱检测方法可以实现COD含量估算模型的优化,从而为传统COD测量方法存在的问题提出了一种新的解决思路。     

基于流量测点的热网变动阻力系数优化辨识

随着供热计量系统的普及,系统可以根据负荷的变化进行调整,管网的阻力系数随即发生变化.对变动阻力系数进行优化辨识是了解供热管网实时运行状况的有效手段.提出一种基于流量监测数据的供热管网变动阻力系数优化辨识方法,并利用遗传算法进行求解.对洛阳市某小区供暖季管网实际运行数据进行验证,辨识结果的相对误差在5％以内.结果表明:该...     

基于小波能量距的雷达距离像特征提取

基于小波分析的方法,采用雷达目标一维距离像回波在不同频带的能量距特征,以此特征为基础,利用径向基概率神经网络对4类目标进行识别,并与传统的子带能量特征方法进行对比,仿真实验结果表明：对雷达目标距离像进行特征提取时,能量距特征更好地利用了小波分析的时频信息,所得特征向量类间类内距离比大于能量特征,目标的可分性更好,识别率得到了提高,因而能量距特征优于能量特征。     

An Extensive Assessment of Network Embedding in PPI Network Alignment

Network alignment is a fundamental task in network analysis. In the biological field, where the protein–protein interaction (PPI) is represented as a graph, network alignment allowed the discovery of underlying biological knowledge such as conserved evolutionary pathways and functionally conserved proteins throughout different species. A recent trend in network science concerns network embedding, i.e., the modelling of nodes in a network as a low-dimensional feature vector. In this survey, we present an overview of current PPI network embedding alignment methods, a comparison among them, and a comparison to classical PPI network alignment algorithms. The results of this comparison highlight that: (i) only five network embeddings for network alignment algorithms have been applied in the biological context, whereas the literature presents several classical network alignment algorithms; (ii) there is a need for developing an evaluation framework that may enable a unified comparison between different algorithms; (iii) the majority of the proposed algorithms perform network embedding through matrix factorization-based techniques; (iv) three out of five algorithms leverage external biological resources, while the remaining two are designed for domain agnostic network alignment and tested on PPI networks; (v) two algorithms out of three are stated to perform multi-network alignment, while the remaining perform pairwise network alignment.     

Space-Air-Ground Integrated Mobile Crowdsensing for Partially Observable Data Collection by Multi-Scale Convolutional Graph Reinforcement Learning

Mobile crowdsensing (MCS) is attracting considerable attention in the past few years as a new paradigm for large-scale information sensing. Unmanned aerial vehicles (UAVs) have played a significant role in MCS tasks and served as crucial nodes in the newly-proposed space-air-ground integrated network (SAGIN). In this paper, we incorporate SAGIN into MCS task and present a Space-Air-Ground integrated Mobile CrowdSensing (SAG-MCS) problem. Based on multi-source observations from embedded sensors and satellites, an aerial UAV swarm is required to carry out energy-efficient data collection and recharging tasks. Up to date, few studies have explored such multi-task MCS problem with the cooperation of UAV swarm and satellites. To address this multi-agent problem, we propose a novel deep reinforcement learning (DRL) based method called Multi-Scale Soft Deep Recurrent Graph Network (ms-SDRGN). Our ms-SDRGN approach incorporates a multi-scale convolutional encoder to process multi-source raw observations for better feature exploitation. We also use a graph attention mechanism to model inter-UAV communications and aggregate extra neighboring information, and utilize a gated recurrent unit for long-term performance. In addition, a stochastic policy can be learned through a maximum-entropy method with an adjustable temperature parameter. Specifically, we design a heuristic reward function to encourage the agents to achieve global cooperation under partial observability. We train the model to convergence and conduct a series of case studies. Evaluation results show statistical significance and that ms-SDRGN outperforms three state-of-the-art DRL baselines in SAG-MCS. Compared with the best-performing baseline, ms-SDRGN improves 29.0% reward and 3.8% CFE score. We also investigate the scalability and robustness of ms-SDRGN towards DRL environments with diverse observation scales or demanding communication conditions.     

Small World Effects in a Harmonious Unifying Hybrid Preferential Model Networks

Small world effects in the harmonious unifying hybrid preferential model (HUHPM) networks are studied both numerically and analytically. The idea and method of the HUHPM is applied to three typical examples of unweighted BA model, weighted BBV model, and the TDE model, so-called HUHPM-BA, HUHPM-BBV and HUHPM-TDE networks. Comparing the HUHPM with current typical models above, it is found that the HUHPM networks has the smallest average path length and the biggest average clustering coefficient. The results demonstrate that the HUHPM is more suitable not only for the un-weighted models but also for the weighted models.     

D2D协作边缘缓存系统中基于传输时延的缓存策略

为了满足5G系统低时延高可靠的需求,针对单缓存终端直传(D2D)协作边缘缓存系统,提出了一种基于传输时延的缓存策略.运用随机几何理论,将请求用户和空闲用户的动态分布建模为相互独立的齐次泊松点过程,综合考虑内容流行度、用户位置信息、设备传输功率以及干扰,推导出用户的平均传输时延与缓存概率分布的关系式.以平均传输时延为目标...     

KEADA: Identifying Key Classes in Software Systems Using Dynamic Analysis and Entropy-Based Metrics

Software maintenance is indispensable in the software development process. Developers need to spend a lot of time and energy to understand the software when maintaining the software, which increases the difficulty of software maintenance. It is a feasible method to understand the software through the key classes of the software. Identifying the key classes of the software can help developers understand the software more quickly. Existing techniques on key class identification mainly use static analysis techniques to extract software structure information. Such structure information may contain redundant relationships that may not exist when the software runs and ignores the actual interaction times between classes. In this paper, we propose an approach based on dynamic analysis and entropy-based metrics to identify key classes in the Java GUI software system, called KEADA (identifying KEy clAsses based on Dynamic Analysis and entropy-based metrics). First, KEADA extracts software structure information by recording the calling relationship between classes during the software running process; such structure information takes into account the actual interaction of classes. Second, KEADA represents the structure information as a weighted directed network and further calculates the importance of each node using an entropy-based metric OSE (One-order Structural Entropy). Third, KEADA ranks classes in descending order according to their OSE values and selects a small number of classes as the key class candidates. In order to verify the effectiveness of our approach, we conducted experiments on three Java GUI software systems and compared them with seven state-of-the-art approaches. We used the Friedman test to evaluate all approaches, and the results demonstrate that our approach performs best in all software systems.     

RBFT:基于Raft集群的拜占庭容错共识机制

针对现有联盟链共识机制因可拓展性不足,无法在支持大规模网络的同时满足低时延、高吞吐量和安全性的问题,采用网络分片的思想,提出一种适用于联盟链的带有监督节点的两级共识机制——RBFT.首先对网络节点进行分组,组内采用改进的Raft机制进行共识,然后由每个组内选出的领导者组成网络委员会,网络委员会内部采用PBFT机制进行共...