INVESTIGATION OF SALT DAMAGE IN MANGO TREES IN XIAMEN

“叶焦病”是闽南地区芒果（Ｍａｎｇｉｆｅｒａ ｉｎｄｉｃａ Ｌ．）的一种常见病．对不同地点受害植物的叶片及土壤理化指标的分析表明：①土壤酸度、总Ｎ、总Ｐ、Ｋ、Ｎａ等含量与芒果受害程度无关；②受害程度与叶片Ｃｌ、Ｋ含量、３０—４０ ｃｍ土壤Ｃｌ含量及总盐含量呈显著正相关；③造成厦门地区芒果“叶焦病”的主要原因是盐害，其中起主要作用的是Ｃｌ；④芒果是一种对盐比较敏感的植物，土壤总盐含量达０．４８９‰时仍可正常生长，高于此含量则出现受害症状．Leaf scorch in mango (Mangifera indica L.) trees was investigated in March, 1997 in 13 sites at 30-300 m from seashore of Xiamen City. Symptom of leaf scorch in shoot leaves was divided into 6 grades. Soil properties and elements in leaves were tested. The results showed that soil pH and the total N, P, K and Na contents were not related to the leaf scorch damage. The degrees of injury caused by leaf scorch were positively related to the content of Cl and K in leaves and to the Cl and salt contents in soil at 30-40 cm depth. It is concluded that the main factor resulting in leaf scorch is salt, and Cl plays an important role. Mango trees grow normally in soil under 0.489‰ salinity

卷积神经网络模型在儿科疾病预测中的应用

目的:针对儿童看病需求量大导致的儿科诊疗服务效率和准确率偏低等问题,利用自然语言处理和深度学习技术,从儿科历史病历数据中自动\"学习\"专家医生诊断模式,形成智能辅助诊断模型,从而对新的儿科病历数据输出疾病诊断决策。结果:基于深度卷积神经网络的七分类疾病智能诊断模型的正确率为84.26%,F1-score为84.33%,基本达到可投入实际应用的级别。结论:智能诊断决策作为预诊信息提供给医生进行确诊参考,对提升医生诊断速度效果明显。国家自然科学基金面上项目(编号:71571056);;福建省自然科学基金面上项目(编号:2012J01274)~

MLICP-CNN:基于CNN与ICP的多标记胸片置信诊断模型

针对胸片的多标记预测集缺少可校准性的缺陷,提出一种基于卷积神经网络(Convolutional Neural Networks,CNN)与归纳一致性预测器(Inductive Conformal Prediction,ICP)的多标记胸片置信诊断模型MLICP-CNN。该模型将学习数据划分为训练集和校准集,通过使用CNN从训练集中学习出规则D。基于规则D和校准集使用算法随机性对被测数据进行置信预测,即为每个被测数据提供附带置信度的多标记预测集。在对Chest X-ray14胸片数据集的实验结果表明,该模型在临床常用的95%置信度下,模型准确率为95%,体现了置信度评估的恰好可校准性。在CNN架构为Resenet50并采用LS-MLICP为奇异值映射函数下,模型性能最好,其确定预测率为96.43%,理想预测率为92.31%。另外,CNN架构对预测效率的影响程度远远小于奇异值映射函数。国家自然科学基金面上项目(61673186);;\n福建省自然科学基金面上项目(2012J01274

Search for gravitational-lensing signatures in the full third observing run of the LIGO-Virgo network

Gravitational lensing by massive objects along the line of sight to the source causes distortions of gravitational wave-signals; such distortions may reveal information about fundamental physics, cosmology and astrophysics. In this work, we have extended the search for lensing signatures to all binary black hole events from the third observing run of the LIGO--Virgo network. We search for repeated signals from strong lensing by 1) performing targeted searches for subthreshold signals, 2) calculating the degree of overlap amongst the intrinsic parameters and sky location of pairs of signals, 3) comparing the similarities of the spectrograms amongst pairs of signals, and 4) performing dual-signal Bayesian analysis that takes into account selection effects and astrophysical knowledge. We also search for distortions to the gravitational waveform caused by 1) frequency-independent phase shifts in strongly lensed images, and 2) frequency-dependent modulation of the amplitude and phase due to point masses. None of these searches yields significant evidence for lensing. Finally, we use the non-detection of gravitational-wave lensing to constrain the lensing rate based on the latest merger-rate estimates and the fraction of dark matter composed of compact objects

基于 TPM 2.0 的协议设计与分析研究

&nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 摘要 可信计算是一种经典的系统安全技术，在保障国家网络空间安全方面具有重要的作用。随着移动计算、物联网等新型计算平台的出现，国际可信计算组织发布了支持这些新型计算平台的下一代 TPM 规范，即 TPM 2.0。与 TPM 1.2 相比，新的 TPM 2.0 规范在密码学操作原语 API、授权协议以及应用灵活性等各个方面都有很多改进与提升。之前很多研究工作都是针对 TPM 1.2 的安全性进行分析，而 TPM 2.0 新增改进的功能还缺少相应的分析方法；为此，本文重点研究在 TPM 2.0 中新增和改进功能模块的安全性，以及基于 TPM 2.0 功能模块所能实现协议的设计与分析研究。基于 TPM 2.0 的协议设计与分析研究主要包含两条研究主线：其一是 TPM 2.0 协议和接口的形式化分析方法研究；其二是TPM 2.0 协议及匿名认证协议的设计和应用研究。这两个方面的研究是相辅相成的，对 TPM 2.0 协议的形式化分析研究能够促进协议的改进与完善，而对协议的设计改进与应用研究又能反过来促进形式化模型更加精确。因此，基于 TPM 2.0的协议设计与分析工作主要从三个方面展开：安全协议形式化理论与分析、基于 TPM 2.0 的基础协议和接口的安全性分析以及可信计算延伸协议的设计与形式化分析。本文已经取得的主要研究成果如下： (1) 完成基于 HMAC 的 TPM 2.0 授权协议的自动化证明。使用基于计算模型的证明工具 CryptoVerif 证明了 TPM 2.0 授权协议的安全性，它的方法采用基于游戏序列的证明技术，这些游戏由一种概率多项式时间的进程演算的语言来表述。首先，使用概率多项式进程演算对 TPM 2.0 的授权协议建模，并提出对应性（correspondence 属性）作为授权协议的一个更加通用的安全目标；然后，使用 CryptoVerif 工具自动证明 TPM 2.0 授权协议中的对应性。证明结果表明计算模型下 TPM 2.0 授权协议的认证性成立。 (2) 提出了一个分析 TPM 2.0 密码支撑命令的通用形式化模型。该形式化模型支持密钥创建和删除、密钥导出、对称加密、非对称加密、消息认证码、签名等操作。模型建立过程中考虑了密钥的类型和简单的属性，并且提出在现代密码学概念下的安全属性，利用自动证明工具证明了在现代密码学假设下的安全性。该模型具有广泛的通用性和普适性，除了适用于分析 TPM 2.0 的命令，还能分析PKCS#11 等的密码学 API。 (3) 改进并设计了一种匿名认证协议。匿名认证协议保证证明方能够向验证方证明自己合法的身份信息，但又避免暴露自己真实的身份信息。匿名认证是TPM 2.0 在隐私认证方面的一个重要特征（如 TPM 2.0 支持的 DAA 协议）。通过研究一系列匿名认证协议及其黑名单撤销机制实现的过程后，发现了匿名认证协议存在的一些不足与漏洞：匿名认证系统 BLACR 在启用快速通道认证时，不支持移出奖励名单和惩罚名单的功能； BLACR 快速通道令牌存在重放攻击安全漏洞。本文提出了 ExBLACR 方案，对存在的问题进行了改进，并解决了重放攻击问题。 (4) 提出了针对无可信第三方黑名单匿名认证协议的形式化分析方法。首先，使用应用 Pi 演算给出了在符号模型下 BLAC 类系统的一些通用安全属性的定义；然后，将这些定义表示为适合形式化分析工具可验证的对应性（correspondence，包含认证性, 不可陷害性和抗误认证性）以及等价性（equivalence，包含匿名性和不可链接性）。本文在 BLACR 系统中验证了这些安全属性，在分析中发现了快速通道认证令牌机制的一个已知攻击；并针对性地提出了一个安全修订，使得该令牌机制能够成功通过 ProVerif 的验证。 总的来说，本文对可信计算最新 TPM 2.0 规范的相关协议和接口进行了深入分析与研究。相关研究成果为 TPM 2.0 技术的应用推广提供了科学的理论基础和严谨的技术验证，并为可信计算协议的进一步发展与改进提供了有益参考。 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;Abstract Trusted Computing is a classic technology for system security, and plays an important role in guaranteeing the security of national cyberspace. With the emergence ofnew computing platforms such as mobile computing and the Internet of Things (IoT),TCG (Trusted Computing Group) has released the next-generation TPM specification(called TPM 2.0) that supporting these new computing platforms. Compared to the traditional TPM 1.2, there are many improvements in the new TPM 2.0 specification, such as cryptographic operations, authorization protocols and application flexibility. Previous work mainly aimed at the security analysis of TPM 1.2, and the analysis methodsfor the new and improved features in TPM 2.0 are lack. Thus, this thesis focuses on the security of the new and improved functional modules in TPM 2.0, as well as the design and analysis of protocols that can be implemented based on TPM 2.0. The protocol design and analysis based on TPM 2.0 mainly includes two research main lines: one is the formal analysis method of TPM 2.0 protocols and interfaces; the second is the design and application research of TPM 2.0 protocols (especially, the anonymous attestation protocols). These two aspects of research are mutually reinforcing, the formal analysis methods can promote the improvement of the TPM 2.0 protocols, and the design improvement and application research of the protocols can in turn makes the formal model more accurate. Therefore, this thesis is dedicated to research on the design and analysis of the TPM 2.0 protocols and API interfaces. The work is mainly carried out in three aspects: the formalization theory and analysis of security protocols, the security analysis of basic protocols and interfaces based on TPM 2.0, and the design and formal analysis of trusted computing extension protocols (like anonymous credentials). The main contributions of this thesis are as follows: (1) The thesis has finished the automated proof of HMAC-based authorization protocol in the TPM 2.0. The security of the authorization protocols in the TPM 2.0 are proved by using the tool CryptoVerif in the computational model. CryptoVerif builds proofs by sequences of games, and these games are expressed by a probabilistic polynomial-time calculus. First, we model the authorization protocols by using a probabilistic polynomial-time calculus, and propose correspondence property as a more general security goal. Then, we apply CryptoVerif to prove the correspondence properties of the authorization protocols in the TPM 2.0 automatically. The proof results show that the authentication of the authorization protocols of TPM 2.0 in the computational model is established. (2) The thesis has proposed a general formal model for analyzing the cryptographic support commands in the TPM 2.0. The model supports many commands, such as key creations, key deletions, key exports, symmetric encryption, asymmetric encryption, message authentication code, signature, etc. The model also considers the key types and simple properties. We model these commands with a security policy expressed in the notion of modern cryptography, and prove that these commands satisfy this security policy by using an automated formal tool. The model has a wide range of versatility and universality, which is suitable for analyzing the commands and cryptographic APIs in both TPM 2.0 and PKCS11. (3) The thesis has improved and designed a kind of anonymous attestation protocol. The anonymous attestation protocol guarantees that the prover can prove its legal identity to the verifier, but at the same time avoids exposing its true identity information. It is an important feature in the privacy authentication of TPM 2.0 (such as DAA protocols supported by TPM 2.0). After the study of a series of anonymous attestation protocols and their revocation mechanisms, we discovered some problems and vulnerabilities: the BLACR does not support unblacklisting when enabling the express lane tokens; the express lane tokens can be reused (replay attack). Thus, we propose ExBLACR method, which provides solutions to these problems, and can resist replay attack. (4) The thesis has introduced a formal analysis method for the TTP-Free blacklistable anonymous credentials system. First, we give the definitions of some common security properties for BLAC-like systems in the symbolic model using applied pi calculus. Then, these definitions are expressed as correspondence properties (authenticity, non-frameability, and mis-authentication resistance) and equivalence properties (anonymity and unlinkability) that are suited to verify by formal analysis tool. We verify these properties in BLACR system, and finds a known attack aiming at the token mechanism in the express-lane authentication. Finally, we offer a security revision that makes the token mechanism be successfully proved by using ProVerif. In summary, this thesis conducts a deep research and analysis for the related protocols and interfaces in the newest TPM 2.0 specification of trusted computing. The research results of this thesis provide a scientific theoretical foundation and a rigorous technical verification for the application and promotion of TPM 2.0 related technologies, and show a useful reference for the further development and improvement of trusted computing protocols.</p

厦门地区耐盐园林植物的筛选

针对厦门市四周环海、市区部分土壤含盐量高而导致的园林植物屡屡遭受盐害的情况，通过对土壤含盐量、植物叶片元素含 量及植株受害情况的综合分析，对厦门市主要园林植物的耐盐能力进行了评价，并筛选出一批耐盐园林植物。厦门市园林风景管理局科研基金资助项目

拟南芥COPT家族蛋白研究进展

铜(Cu)是植物必需的微量元素,作为多种酶的辅因子参与许多植物生理生化反应。Cu缺乏和过量均影响植物正常生长发育,因此植物进化出精妙复杂的调控网络来严格控制植物体内的Cu含量。植物Cu转运蛋白COPT家族成员与Cu有很高的亲和力,能够调节植物对Cu的吸收和转运,在维持植物体内Cu稳态平衡过程中发挥重要作用。COPT蛋白涉及不同的Cu转运功能,如从外界环境中摄取Cu、从细胞器中输出Cu、长距离运输Cu以及在不同器官间动用和再分配Cu。此外, COPT蛋白在其它离子的稳态平衡维持、昼夜节律性生物钟调控、植物激素合成和植物对激素信号的感受过程中也发挥重要作用。该文综述了模式植物拟南芥(Arabidopsis thaliana) COPT家族各成员的表达和定位、调控机制以及生物学功能等方面的最新进展

Effect of Membranes and Inhibitors on Soil Evaporation

通过培养试验研究了聚氨酯膜、渗水布膜覆盖物和聚丙烯酸钠 (保水剂 )、聚乙烯醇、聚丙烯酰胺、海藻糖蒸发抑制剂对土壤蒸发的影响。结果表明 :聚氨酯膜、渗水布膜对黑垆土蒸发有极显著影响 ,聚氨酯膜与渗水布膜的抑制作用差异极显著 ;聚氨酯膜对沙土蒸发有显著的抑制作用 ;几种抑制剂对土壤蒸发的抑制作用以保水剂最好 ,其效果随用量的增加而增大 ;沙土中加入海泡石或草炭 ,抑制剂的保水效果增