土壤肥料学实验课程的教学改革与实践

为全面培育卓越农林人才，提高教学培养质量，本研究结合土壤肥料学的课程内容、教学特点及实验方法，对存在的问题进行了剖析，并结合实际针对存在问题做出了相应改革，适时调整《土壤肥料学》实验课程内容和形式。通过删减验证性实验内容，增设综合性实验，传统部分教学内容实现网络化等三方面对该课程的实验课部分进行了改革与实践，以期提高学生综合运用所学《土壤肥料学》的相关知识来解决生产实际问题的能力。     

财政性科技经费监管体系探析

我国初步建立了财政性科技经费监管体系,但是在监督主体、监督制度等方面还存在缺陷,科技经费监督出现诸多问题。建立要加强宏观层面的统筹规划,建立由政府、承担单位和外部主体上下联动、横向联合的立体监督体系。     

仿生非光滑花纹沟对轮胎抗滑水性能的影响

以205/55R16乘用车轮胎为研究对象,采用计算流体动力学建立了考虑胎面花纹变形的轮胎滑水分析模型;以气-液二相流数值模型分析了轮胎的滑水性能,并将临界滑水速度仿真值与NASA滑水速度预测值及轮胎发生滑水时力平衡下的速度进行对比.在此基础上,引入仿生减阻理念,研究了夹角为60°、高度为0.6mm的仿生对称V形结构对花纹沟排水量和水流阻力的影响,并将其结构特征信息等效移植到接地区轮胎花纹沟底,进行了仿生花纹轮胎的滑水性能分析.结果表明:所建滑水分析模型可用来分析轮胎滑水时的流体运动特性;相对原花纹轮胎,仿生非光滑花纹沟轮胎通过提高接地区花纹沟内水流速度,降低了胎面动水压力,提高了临界滑水速度.     

创新研究系统隐性知识生成转化反馈环特性仿真分析

隐性知识反馈环结构是创新研究系统的核心结构,运用组织管理系统动力学理论,进行科研创新系统隐性知识生产转化系统仿真研究,以南昌大学系统动力学创新团队研究系统为例,分析确定该系统的隐性知识量、显性知识量、创新投资量、团队人员数和创新成果量五个核心变量,运用新建的逐枝建模和逐树仿真技术建立五棵流率基本入树模型及其等价流图模型.运用枝向量行列式新增反馈环计算法,计算出系统包含创新成果流位作用于隐性知识流入率的第一类反馈环五条,团队成员数作用于隐性知识流入率第二类正反馈环十条.然后,结合模型的仿真曲线和仿真数据,对第一类反馈环进行极性转移仿真分析和主导反馈环转移仿真分析,对第二类正反馈环进行正反馈环的作用分析,以及"原始创新度"低对这十条正反馈环的制约分析,并基于上述十五条反馈环特性仿真分析结果提出四条创新研究系统发展对策.     

迹为整数的3×3阶正交矩阵的谱

讨论了3×3阶正交矩阵的特征值和迹的关系,证明了迹为整数的3×3阶正交矩阵的谱可由迹确定,为应用广泛的3×3阶正交矩阵的谱的计算提供了简单实用的方法.     

[Zn(Pybox)Br2]配合物的合成, 晶体结构及催化性质研究

合成了一种锌的配位化合物(Dm-Pybox)ZnBr2(1),(Dm-pybox为2,6-二[4',4'-二甲基噁唑啉]吡啶),通过核磁,元素分析,红外和X-射线单晶衍射表征确定其结构.对于配合物C15 H19 N3 O2 ZnBr2,Mr(分子量)=498.52,单斜晶系,空间群为P21/c,a=10.2422(19)?,b=16.141(3)?,c=11.513(2)?,β=99.128(2),V=1879.2(6)?3,Z=4,F(000)=984,μ=5.570mm-1,ρc=1.762g/cm3,最终的R1=0.0584(I>2σ(I))和wR2=0.1773(所有数据).配合物1可以在水溶剂和室温条件下高效催化二茂铁甲醛与活泼亚甲基化合物Knoevenagel缩合反应.     

A Method for Time-Series Location Data Publication Based on Differential Privacy

In the age of information sharing, logistics information sharing also faces the risk of privacy leakage. In regard to the privacy leakage of time-series location information in the field of logistics, this paper proposes a method based on differential privacy for time-series location data publication. Firstly, it constructs public region of interest(PROI) related to time by using clustering optimal algorithm. And it adopts the method of the centroid point to ensure the public interest point(PIP) representing the location of the public interest zone. Secondly, according to the PIP, we can construct location search tree(LST) that is a commonly used index structure of spatial data, in order to ensure the inherent relation among location data. Thirdly, we add Laplace noise to the node of LST, which means fewer times to add Laplace noise on the original data set and ensures the data availability. Finally, experiments show that this method not only ensures the security of sequential location data publishing, but also has better data availability than the general differential privacy method, which achieves a good balance between the security and availability of data.     

部件寿命服从威布尔分布时典型系统的寿命与剩余寿命估计

在实际工程中,对系统寿命以及剩余寿命的估计非常重要。在已知系统中部件寿命与可靠度的前提下,关于如何快速得到系统级寿命与剩余寿命的相关研究比较缺乏。针对这一问题,首先研究了可靠度、寿命以及剩余寿命的关系,进一步假设部件寿命服从同一威布尔分布,根据部件的寿命与可靠度函数,推导得到串联、并联和表决系统寿命与剩余寿命期望的封闭表达式,并给出了相应的计算方法。对于冷备系统,当部件寿命服从同一指数分布时,推得了系统寿命及剩余寿命期望的封闭表达式,而当部件寿命服从同一威布尔分布时,给出了系统寿命与剩余寿命的数值计算方法。仿真试验证明本文所提出的方法是准确高效的。最后,以卫星中的动量轮r/n(G)表决系统为例开展了实例研究,证明了该方法在工程实践中的有效性。     

Hierarchical Community Detection Based on Partial Matrix Convergence Using Random Walks

Random walks are a standard tool for modeling the spreading process in social and biological systems.But in the face of large-scale networks,to achieve convergence,iterative calculation of the transition matrix in random walk methods consumes a lot of time.In this paper,we propose a three-stage hierarchical community detection algorithm based on Partial Matrix Approximation Convergence(PMAC) using random walks.First,this algorithm identifies the initial core nodes in a network by classical measurement and then utilizes the error function of the partial transition matrix convergence of the core nodes to determine the number of random walks steps.As such,the PMAC of the core nodes replaces the final convergence of all the nodes in the whole matrix.Finally,based on the approximation convergence transition matrix,we cluster the communities around core nodes and use a closeness index to merge two communities.By recursively repeating the process,a dendrogram of the communities is eventually constructed.We validated the performance of the PMAC by comparing its results with those of two representative methods for three real-world networks with different scales.