考虑地质分层约束的长短期记忆循环神经网络测井曲线重构

延长油田东部裸眼井区早期测井资料普遍只有自然电位（SP）、自然伽马（GR）及梯度电阻率(R2.5)三条曲线,因缺失声波（AC）、地层电阻率（RT）等测井曲线,难以满足精细油藏地质研究需求。东部裸眼井区开发时间长、单井产量低,重新测井缺乏可行性及经济性。采用长短期记忆循环神经网络(Long Short-Term Memory,LSTM)进行缺失测井曲线重构是一种经济有效方法,适用于地层测井序列数据。然而延长油田东部浅层油藏上覆黄土层段测井数据信号干扰大,直接应用模型精度较差。针对此问题,本文采用考虑地质分层约束的LSTM模型进行缺失测井曲线的重构,通过分层数据截取每口井长6层段测井数据作为样本数据,既保留了LSTM模型处理序列数据的优势,同时又避免了上覆黄土层测井数据对模型的干扰。利用裸眼井区完整测井数据进行模型训练优化和验证,讨论了考虑地质分层约束的LSTM测井曲线重构精度,结果表明通过引入地质分层约束,模型重构测井曲线精度更高。应用优化后模型实现裸眼井区50口仅有GR、SP、R2.5三条曲线数据井的AC、RT曲线重构,对50口井的142个射孔段进行二次解释,对比试油解释结论符合率达到89.4%,验证了该方法对测井曲线重构的实用性和有效性。     

基于帕累托最优效率模型的轨道交通沿线公交线路运行效率评价

通过建立公交运行效率评价模型,确定轨道交通沿线待优化线路,为两网融合奠定理论基础。研究首先通过定性定量法筛选出与轨道交通关联度大且有研究意义公交线路,其次以公交线网自身合理性、两网之间协同关系等数据构建评价体系,最后采用帕累托最优交叉效率模型,求解沿线公交线路运行效率。以南昌市1号线为例,筛选出沿线25条公交线路并进行实证分析。结果表明：帕累托最优交叉效率模型的评分更容易被所有的决策单元（Decision-Making Units,DUM s）接受;数据分析得出南昌公交线网自身合理性较好,但在两网协同关系方面,可优化线路走向、调整线路重复系数等加强其协同性。最后基于两者的帕累托交叉效率均值,将25条公交线路划分为4种案例,为公共交通系统的管理者和决策者提供了更实用和有价值的观点。     

基于卷积神经网络的新奇检测技术在结构损伤识别中的应用

针对新奇检测难以同时识别结构损伤时刻和损伤位置的问题,提出在新奇检测中引入卷积神经网络以实现损伤时刻和损伤位置的一次性确定。首先,采用小波包技术处理结构响应得到小波包能量,并将相邻测点对应频带的能量比作为新奇检测模型的特征向量;然后,以结构健康时的特征向量作为训练数据,建立健康模式下的基于卷积神经网络的新奇检测模型;接着,将结构实时输出的特征向量输入到新奇检测模型,所得输出与健康状态的输出进行对比,并将输出和输入的欧氏距离作为新奇指标;最后,根据新奇指标的变化识别结构损伤时刻和损伤位置。数值模拟和实验室试验验证了该方法的有效性。     

石榴枯萎病的生防木霉菌株的筛选及鉴定

目的 石榴枯萎病是由甘薯长喙壳菌引起,对石榴有严重危害的土传病害。利用拮抗微生物抑制病原菌的繁殖是石榴枯萎病绿色防控的有效手段。通过筛选具有对石榴枯萎病原菌产生拮抗效果的微生物,研究其抑制菌作用,以期为石榴枯萎病生物防控提供菌种资源。方法 从石榴的根际土壤中分离出真菌,根据产孢量、生长速率、拮抗系数及平板对峙结果进行筛选,对防效较好的真菌根据形态学和分子系统学进行鉴定,通过盆栽实验评估其对石榴枯萎病的防治效果。结果 能有效抑制石榴枯萎病菌菌丝的生长的菌株T9经鉴定为非洲哈茨木霉菌（Trichoderma afroharzianum）,盆栽防治效果最高可达71.35%。结论 该菌株展现出了对石榴枯萎病的生物防治效果,具有应用价值。     

血吸虫病蔓延周期的灰色预测模型

对血吸虫病蔓延高峰期的预测具有深远的意义。本文建立一种新的灰色预测模型,对该病蔓延发展的高峰期进行预测,通过实例计算分析,预测结果正确,模型拟合精度为优。     

SEA方法及其在C~3I系统效能分析中的应用(Ⅱ)——交战模型

本文采用ＳＥＡ方法建立了Ｃ３Ｉ系统在一种典型交战环境下的系统效能模型及其分析程序,举例说明了系统效能计算结果的战术涵义。由于Ｃ３Ｉ系统所处的交战环境是千变万化的,因此采用ＳＥＡ方法建立一般交战情形下通用的Ｃ３Ｉ系统效能模型仍是十分困难的工作。然而,本文的分析过程可起到一定的示范作用。     

基于神经网络和微分对策理论的制导律

根据微分对策制导律目前面临的困境,本文尝试将神经网络引入微分对策制导律。采用ＢＰ模型,将微分对策的定量和定性分析结合起来。以导弹与飞机格斗为例,探讨其实现的可能性和优点,为将来发展基于微分对策理论的智能制导律提供了一定的思路。     

COMPARISON OF TWO METHODS OF OPERATING THEATRE PLANNING： APPLICATION IN BELGIAN HOSPITAL

Operating Theatre is the centre of the hospital management＇s efforts. It constitutes the most expensive sector with more than 10% of the intended operating budget of the hospital. To reduce the costs while maintaining a good quality of care, one of the solutions is to improve the existent planning and scheduling methods by improving the services and surgical specialty coordination or finding the best estimation of surgical case durations. The other solution is to construct an effective surgical case plan and schedule. The operating theatre planning and scheduling is the two important steps, which aim to make a surgical case programming with an objective of obtaining a realizable and efficient surgical case schedule. This paper focuses on the first step, the operating theatre planning problem. Two planning methods are introduced and compared. Real data of a Belgian university hospital ＂Tivoli＂ are used for the experiments.     

Research on secure buyer-seller watermarking protocol

A new buyer-seller watermarking protocol is proposed by applying a double encryption method and a novel mechanism of embedding a buyer＇s watermark. The protocol can effectively prevent against collusion attacks and the man in the middle attack if the third party is not trusted. Also, based on the proposed scheme for the first-hand transaction, a new buyer-reseller watermarking protocol and a formal multi-party watermarking protocol are also proposed. The proposed buyer-resell watermarking protocol only needs the original seller to provide transfer certificate and encryption-decryption service to support the second-hand transaction, and the multi-party watermarking protocol with distributed certificate authorities can overcome the difficulty in the combination of multicast mechanism with multiple unique watermarks and allow a seller to multicast the watermarked digital contents and key transaction information to n buyers. Furthermore, the idea of zero knowledge proof is also applied into the proposed scheme to allow the seller to take an effective control on the task performed by the third party.     

Cluster Synchronization in a Complex Dynamical Network with Two Nonidentical Clusters

This paper further investigates cluster synchronization in a complex dynamical network with two-cluster. Each cluster contains a number of identical dynamical systems, however, the subsystems composing the two clusters can be different, i.e., the individual dynamical system in one cluster can differ from that in the other cluster. Complete synchronization within each cluster is possible only if each node from one cluster receives the same input from nodes in other cluster. In this case, the stability condition of one-cluster synchronization is known to contain two terms： the first accounts for the contribution of the inner-cluster coupling structure while the second is simply an extra linear term, which can be deduced by the ＂same-input＂ condition. Applying the connection graph stability method, the authors obtain an upper bound of input strength for one cluster if the first account is known, by which the synchronizability of cluster can be scaled. For different clusters, there are different upper bound of input strength by virtue of different dynamics and the corresponding cluster structure. Moreover, two illustrative examples are presented and the numerical simulations coincide with the theoretical analysis.