基于Faster-RCNN和Level-Set的桥小脑角区肿瘤自动精准分割

桥小脑角区（CPA）肿瘤的精准分割在手术治疗、放疗中有重要影响,本文结合更快速区域卷积神经网络（Faster-RCNN）和水平集（Level-Set）方法对CPA肿瘤的自动分割进行了研究.首先,采集317名CPA肿瘤患者的T₁WI-SE序列磁共振图像,使用基于Faster-RCNN主干网络VGG16提取特征,结合区域建议网络（RPN）进行学习训练,建立带有CPA肿瘤位置信息的定位模型,再应用Level-Set对肿瘤进行精准分割.本文对比了不同CPA肿瘤区域勾画范围对分割结果产生的影响,并以精确率、召回率、均值平均精度值（mAP）和戴斯系数（Dice系数）等指标评估了模型定位和分割的性能.实验结果表明,结合Faster-RCNN和Level-Set建立的模型能更有效对CPA肿瘤进行精准分割,减轻临床医生的负担,并提升治疗效果.     

自由大气紫外光学通信的研究

本文对紫外日盲区光谱在近距离、保密通信中的应用进行了探讨 ,并建立了紫外光学通信原理实验系统。所描述的系统是以日盲区紫外光作为信息载体的 ,用被调制的低压汞蒸汽紫外放电灯作为发射器件 ,以日盲型滤光片和光电倍增管或日盲型紫外光电倍增管作为接收器件 ,以达到在任何时间和在任何气候下完成窄频带模拟或低速数字信号的传输。由于近地表大气臭氧层的吸收 ,所以传输距离被限制在一个较小的范围内 ,构成了短距离的、秘密的、安全的和抗干扰的通信系统 ,并且不需要传统意义上的天线。由于地球大气上层臭氧的吸收作用 ,阳光中的日盲区 (2 0 0～ 2 80 nm)辐射几乎无法到达地球表面 ,因此 ,采用这个波段的光学通信系统几乎不会受到太阳光的干扰。典型的大气臭氧浓度高度分布大约在距地表 2 5 km处达到最高值 ,在海平面处有一个较低的值。相对较低的浓度值来说 ,虽然紫外辐射传输有限 ,但是具有足够远的距离 ,同时可达到安全、秘密和抗干扰的目的     

非线性最小二乘问题的信赖域方法

本文提出一个新的非线性最小二乘的信赖域方法,在该方法中每个信赖域子问题只需要一次求解,而且每次迭代的一维搜索步长因子是给定的,避开一维搜索的环节,大大地提高了算法效率.文中证明了在一定的条件下算法的全局收敛性.     

统计深度的几何推广

改进统计深度的定义,并将点的深度概念推广到直线与平面的深度,由此得到深度计算的基本定理和深度的一系列性质.最后讨论应用展望.     

Enhanced nonlinearity in photonic crystal fiber by germanium doping in the core region

Germanium doping in silica can be used as a method for nonlinearity enhancement.Properties of the enhanced nonlinearity in photonic crystal fiber(PCF)with a GeO2-doped core are investigated theoretically by using all-vector finite element method.Numerical result shows that the nonlinear coefficient of PCF is greatly enhanced with increasing doping concentration,furthermore,optimal radius of the doped region should be considered for the desired operating wavelength.     

An explanation for deviations from the quark number scaling of elliptic flows in low pT region

We carry out a systematic study of the different contributions to the deviations of the elliptic flows from the quark number scaling in high energy heavy ion collision in a quark combination model.The effects that we considered are:the resonance decay,the flavor dependence of the quark elliptic flow and the combination of quarks/antiquarks with slightly different transverse momenta.Our results show that the deviations observed in experiments can be well reproduced within the combination framework if all the three effects are considered. We make a detailed analysis of the different contributions using a Monte-Carlo program and suggest measuring the quark number scaling in intermediate pT range more precisely.     

Systematics on fission fragment mass distribution of neutron induced 235U fission

Based on the neutron induced fission fragment mass distribution data up to neutron energy 20 MeV measured with the double kinetic energy method (KEM) and the radio active method (RAM), the systematics of fission fragment mass distribution was investigated by using 5 Gaussian model and the systematics parameters were obtained by fitting the experimental data. With the systematics, the yields of any mass A and at any energy in the region from 0 to 20 MeV of neutron energy can be calculated. The calculated results could well reproduce the experimental data measured with KEM, but show some systematical deviation from the data measured by RAM, which reflects some systematical deviations between the two kinds of measured data.The error of systematics yield was calculated in an exact error transformation way, including from the error of the experimental yield data to the error of the discrete parameters, then to the systematics parameters,and at last to the yield calculated with systematics.     

SUPPLEMENT TO “PASSAGE, BLOCKADE, SINK AND SOURCE OF A PLANAR DYNAMICAL SYSTEM”

A Theorem is given on the number of passages passing throgh a multiply-connected region,which corrects a wrong conjecture in a former paper of the author.     

Numerical experience with the truncated Newton method for unconstrained optimization

The truncated Newton algorithm was devised by Dembo and Steihaug (Ref. 1) for solving large sparse unconstrained optimization problems. When far from a minimum, an accurate solution to the Newton equations may not be justified. Dembo's method solves these equations by the conjugate direction method, but truncates the iteration when a required degree of accuracy has been obtained. We present favorable numerical results obtained with the algorithm and compare them with existing codes for large-scale optimization.