Guideline to Authors

1. Aims and scope Chinese Physics C (CPC) covers the fields of Particle Physics, Nuclear Physics, Astrophysics and Cosmology related to particles and nuclei, Detectors and Experimental Methods, Accelerator, Synchrotron Radiation and     

中微子的螺旋度反转

庆祝著名物理学家Maurice Goldhaber百岁生日的文章,该文的作者是Maurice Goldhaber本人(前美国布鲁克海文国家实验室主任)和他的儿子Alfred Scharff Goldhaber(美国纽约大学石溪分校杨振宁理论物理研究所教授).在文章中,Goldhaber父子阐明了粒子的螺旋度和手征性     

光电效应和康普顿效应的矛盾辨析

高中物理(人教版)教材第三册先后出现了光电效应和康普顿效应这两个内容,作为光具有粒子性的重要证据来学习.为了解释光电效应中的极限频率和瞬时性问题,爱因斯坦假设了这样一个情景:一个电子只能吸收一个光子的能量,而且必须是整份吸收,即是说,     

激光诱导击穿光谱数据特征自动提取方法研究

根据激光诱导击穿光谱(LIBS)展宽主要为非线性Lorentz函数模型,利用Levenberg-Marquardt(L-M)算法对该理论模型中的待定参数进行优化估值,扣除了光谱信号中的连续背景,校正和还原了峰位和峰强,并对拟合数据点自动提取方法进行了分析;以MatrixVB与VB混合编程相结合,实现了基于L-M算法的L...     

樽海鞘群算法在可见光通信调制器的应用

针对可见光多载波通信系统传输速率低、帧间干扰大的问题,采用改进的樽海鞘群算法对可见光多载波通信系统的调制器算法进行优化,以提高可见光通信的数据传输速率。该文详细分析了可见光通信系统的多载波调制器,全面考虑了相关调制系统的重要参数集,并给出合理的质量评价函数。将布谷鸟搜索算子引入樽海鞘群算法以增强其全局搜索能力,最终利用改进的樽海鞘群算法对可见光通信多载波调制器做优化。仿真实验结果表明,运用樽海鞘群算法能够对可见光通信多载波调制系统的参数进行优化,提高可见光通信的传输速率。     

基于改进亚像素算法的弹簧内外径尺寸检测

针对传统像素级边缘检测算法Canny算法进行改进,将高斯滤波换成了引导滤波,在降噪平滑的基础上更好的保留了边缘的清晰度,同时设计算法自适应获得适合图片的高低阈值。提出了一种改进的基于反正切函数模型的亚像素边缘检测方法,根据反正切函数中心对称的特性,通过面积相等的理论计算亚像素边缘位置,相比传统方法极大的减小了计算量及计算时间。通过对弹簧顶部图片进行3次最小二乘法拟合圆,快速、同步获得弹簧的内径、外径尺寸信息。实验结果表明:与传统反正切亚像素拟合方法相比,该方法在保证检测精度的同时,将平均计算时间缩减到1.7%以下。     

Risk models for the Prize Collecting Steiner Tree problems with interval data

Given a connected graph G=(V,E)with a nonnegative cost on each edge in E,a nonnegative prize at each vertex in V,and a target set V′V,the Prize Collecting Steiner Tree(PCST)problem is to find a tree T in G interconnecting all vertices of V′such that the total cost on edges in T minus the total prize at vertices in T is minimized.The PCST problem appears frequently in practice of operations research.While the problem is NP-hard in general,it is polynomial-time solvable when graphs G are restricted to series-parallel graphs.In this paper,we study the PCST problem with interval costs and prizes,where edge e could be included in T by paying cost xe∈[c e,c+e]while taking risk(c+e xe)/(c+e c e)of malfunction at e,and vertex v could be asked for giving a prize yv∈[p v,p+v]for its inclusion in T while taking risk(yv p v)/(p+v p v)of refusal by v.We establish two risk models for the PCST problem with interval data.Under given budget upper bound on constructing tree T,one model aims at minimizing the maximum risk over edges and vertices in T and the other aims at minimizing the sum of risks over edges and vertices in T.We propose strongly polynomial-time algorithms solving these problems on series-parallel graphs to optimality.Our study shows that the risk models proposed have advantages over the existing robust optimization model,which often yields NP-hard problems even if the original optimization problems are polynomial-time solvable.     

Geometric Property （T）

This paper discusses“geometric property （T）”. This is a property of metric spaces introduced in earlier works of the authors for its applications to K-theory. Geometric property （T） is a strong form of “expansion property”, in particular, for a sequence （Xn） of bounded degree finite graphs, it is strictly stronger than （Xn） being an expander in the sense that the Cheeger constants h（Xn） are bounded below. In this paper, the authors show that geometric property （T） is a coarse invariant, i.e., it depends only on the large-scale geometry of a metric space X. The authors also discuss how geometric property （T） interacts with amenability, property （T） for groups, and coarse geometric notions of a-T-menability. In particular, it is shown that property （T） for a residually finite group is characterised by geometric property （T） for its finite quotients.     

C*-Algebraic Intertwiners for Degenerate Principal Series of Special Linear Groups

The author constructs unitary intertwiners for degenerate C＊-algebraic uni- versal principal series of SL（n＋ 1） over a local field by explicitely normalizing standard intertwining integrals at the level of Hilbert modules.     

PrefaceJin CHENG Jijun LIU Masahiro YAMAMOTO

Inverse problems and ill-posed problems are motivated by many applications in science and engineering, and have become an important area of applied mathematics. The mathematical analysis and numerical algorithms on this subject have broad impacts on the rapid development of engineering areas, including nondestructive tests, medical imaging, remote sensing, geophysics and so on. The main difficulties in studying the inverse problems for partial differential equations are their nonlinearity and ill-posedness. Since the 1980s, there have been many new mathematical results on the theory of inverse problems and the regularization of ill-posed problems.