一种通过梯形PPMgLN波导倍频实现带宽可调谐光源的理论研究

本文设计了一种梯形的周期极化掺镁铌酸锂(PPMgLN)波导,并通过在传播方向上引入温度梯度来拓宽其倍频(SHG)过程的泵浦光源可接收带宽。通过有限差分的光束传输法,计算波导的有效折射率,并进行波导尺寸的设计。结果表明,通过改变梯形波导不同位置的温度,使其形成一个温度梯度,可拓宽泵浦光源的波长可接收带宽。本文所设计的PPMgLN波导最大泵浦光源可接收带宽为C波段,即1 530~1 565 nm,该波导可倍频C波段,得到输出波段带宽为765~782.5 nm,温度调谐范围为30~150 ℃。     

以磷化铁为添加剂沿(111)面生长磷掺杂金刚石大单晶

掺杂是调控金刚石性能的一种重要手段。本文采用温度梯度法,在5.6 GPa、1 312 ℃的条件下,选用Fe₃P作为磷源进行磷掺杂金刚石大单晶的合成。金刚石样品的显微光学照片表明,随着Fe₃P添加比例的增加,金刚石晶体的颜色逐渐变深,包裹体数量逐渐增加,晶形由板状转变为塔状直至骸晶。金刚石晶形的变化表明Fe₃P的添加使生长金刚石的V形区向右偏移,这是Fe₃P改变触媒特性的缘故。红外光谱分析表明,Fe₃P的添加使金刚石晶体中氮含量上升,这说明磷的进入诱使氮原子更容易进入金刚石晶格中。激光拉曼光谱测试表明,随着Fe₃P添加比例的增加,所合成的掺磷金刚石的拉曼峰位变化不大,其半峰全宽(FWHM)值变大,这说明磷的进入使得金刚石晶格畸变增加。XPS测试结果显示,随着Fe₃P添加比例的增加,金刚石晶体中磷相对碳的原子百分含量也会增加,这意味着添加Fe₃P所合成的金刚石晶体中有磷存在。     

Nonlinear elastic constitutive relations of residually stressed composites with stiff curved fibres

Applied Mathematics and Mechanics - Mechanical models of residually stressed fibre-reinforced solids, which do not resist bending, have been developed in the literature. However, in some residually...     

Quantum algorithm for neighborhood preserving embedding

Neighborhood preserving embedding (NPE) is an important linear dimensionality reduction technique that aims at preserving the local manifold structure. NPE contains three steps, i.e., finding the nearest neighbors of each data point, constructing the weight matrix, and obtaining the transformation matrix. Liang et al. proposed a variational quantum algorithm (VQA) for NPE [Phys. Rev. A 101 032323 (2020)]. The algorithm consists of three quantum sub-algorithms, corresponding to the three steps of NPE, and was expected to have an exponential speedup on the dimensionality n. However, the algorithm has two disadvantages: (i) It is not known how to efficiently obtain the input of the third sub-algorithm from the output of the second one. (ii) Its complexity cannot be rigorously analyzed because the third sub-algorithm in it is a VQA. In this paper, we propose a complete quantum algorithm for NPE, in which we redesign the three sub-algorithms and give a rigorous complexity analysis. It is shown that our algorithm can achieve a polynomial speedup on the number of data points m and an exponential speedup on the dimensionality n under certain conditions over the classical NPE algorithm, and achieve a significant speedup compared to Liang et al.'s algorithm even without considering the complexity of the VQA.     

全局优化问题的一个新的无参数填充函数

求全局最优化问题的填充函数算法被提出以来，参数的选取和调整一直是制约算法有效性的因素。如何在实际的计算过程中选取合适的参数，直接影响和决定了运算速度和效率。因此，构造不含参数的填充函数就显得极为重要。提出一个新的无参数的填充函数，对其理论性质进行了分析，并给出相应的填充函数算法，数值计算验证了算法的有效性。     

Performance guarantees of forward and reverse greedy algorithms for minimizing nonsupermodular nonsubmodular functions on a matroid

This letter studies the problem of minimizing increasing set functions, equivalently, maximizing decreasing set functions, over the base matroid. This setting has received great interest, since it generalizes several applied problems including actuator and sensor placement problems in control, task allocation problems, video summarization, and many others. We study two greedy heuristics, namely, the forward and reverse greedy. We provide two novel performance guarantees for the approximate solutions obtained by them depending on both submodularity ratio and curvature.     

Euler Characteristics on virtually free products

We define Euler characteristics on classes of residually finite and virtually torsion free groups and we show that they satisfy certain formulas in the case of amalgamated free products and HNN extensions over finite subgroups. These formulas are obtained from a general result which applies to the rank gradient and the first L²?Betti number of a finitely generated group.     

求解矩阵方程AXB+CXD=F参数迭代法的最优参数分析

本文针对求矩阵方程AXB+CXD=F唯一解的参数迭代法，分析当矩阵A，B，C，D均是Hermite正（负）定矩阵时，迭代矩阵的特征值表达式，给出了最优参数的确定方法，并提出了相应的加速算法.     

Linearly χ-bounding (P6, C4)-free graphs*

Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let and be the path on vertices and the cycle on vertices, respectively. In this paper we show that for any -free graph it holds that , where and are the chromatic number and clique number of , respectively. Our bound is attained by several graphs, for instance, the 5-cycle, the Petersen graph, the Petersen graph with an additional universal vertex, and all -critical -free graphs other than (see Hell and Huang [Discrete Appl. Math. 216 (2017), pp. 211–232]). The new result unifies previously known results on the existence of linear -binding functions for several graph classes. Our proof is based on a novel structure theorem on -free graphs that do not contain clique cutsets. Using this structure theorem we also design a polynomial time -approximation algorithm for coloring -free graphs. Our algorithm computes a coloring with colors for any -free graph in time.     

零误差计算

研究采用有误差的数值计算来获得无误差的准确值具有重要的理论价值和应用价值.这种通过近似的数值方法获得准确结果的计算被称为零误差计算.本文首先指出,只有一致离散集合中的数才能够开展零误差计算,即有非零隔离界的数集,这也是"数"可以进行零误差计算的一个充要条件.以此为基本出发点,本文分析代数数零误差计算的最低理论精度,该精度对应于恢复近似代数数的准确值时必要的误差控制条件,但由于所采用恢复算法的局限性,这一理论精度往往不能保证成功恢复出代数数的准确值.为此,本文给出采用PSLQ (partial-sum-LQ-decomposition)算法进行代数数零误差计算所需的精度控制条件,与基于LLL (Lenstra-Lenstra-Lovász)算法相比,该精度控制条件关于代数数次数的依赖程度由二次降为拟线性,从而可降低相应算法的复杂度.最后探讨零误差计算未来的发展趋势.