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.     

薄板结构加筋布局优化设计方法研究

提出一种两步优化策略，以加筋板结构的固有频率最大化为目标函数，以结构所受外载荷作用的最大静变形为约束条件，开展薄板结构加筋构件的布局优化设计研究。为了降低加筋布局优化的难度，提高优化设计的效率，将加筋等效为一系列弹性铰（点）支撑，以便快速获得加筋横向移动的灵敏度信息。在基本不改变结构重量的情形下，通过合理布局加筋位置，能显著改善结构的刚度分布，提高结构的整体承载能力。随后，小幅调整加筋的截面尺寸，以满足对结构最大变形的设计要求。最后，用两个算例验证了所提优化方法的可行性和有效性。     

Stochastic Maximum Principle for Forward-Backward Regime Switching Jump Diffusion Systems and Applications to Finance

The authors prove a sufficient stochastic maximum principle for the optimal control of a forward-backward Markov regime switching jump diffusion system and show its connection to dynamic programming principle. The result is applied to a cash flow valuation problem with terminal wealth constraint in a financial market. An explicit optimal strategy is obtained in this example.     

Anisotropy Effects and Observational Data on the Constraints of Evolution Dark Energy Models

We investigate cosmological dark energy models where the accelerated expansion of the universe is driven by a field with an anisotropic universe. The constraints on the parameters are obtained by maximum likelihood analysis using observational of 194 Type Ia supernovae(SNIa) and the most recent joint light-curve analysis(JLA) sample. In particular we reconstruct the dark energy equation of state parameter w(z) and the deceleration parameter q(z). We find that the best fit dynamical w(z) obtained from the 194 SNIa dataset does not cross the phantom divide line w(z) =-1 and remains above and close to w(z)≈-0.92 line for the whole redshift range 0 ≤ z ≤ 1.75 showing no evidence for phantom behavior. By applying the anisotropy effect on the ΛCDM model, the joint analysis indicates that ?_(σ0)= 0.0163 ± 0.03,with 194 SNIa, ?_(σ0)=-0.0032 ± 0.032 with 238 the SiFTO sample of JLA and ?_(σ0)= 0.011 ± 0.0117 with 1048 the SALT2 sample of Pantheon at 1σ′confidence interval. The analysis shows that by considering the anisotropy, it leads to more best fit parameters in all models with JLA SNe datasets. Furthermore, we use two statistical tests such as the usual χ_(min)~2/dof and p-test to compare two dark energy models with ΛCDM model. Finally we show that the presence of anisotropy is confirmed in mentioned models via SNIa dataset.     

一种考虑瞬态效应的散热结构导热路径设计的拓扑优化模型

实际工程中,热载荷多数具有短时和周期性特点,瞬态效应显著。目前的散热结构导热路径设计多基于稳态热传导模型,未考虑瞬态效应。本文提出了一种以区域温度控制函数作为设计目标的瞬态热传导问题的拓扑优化模型,能够实现在整个时间历程上特定区域内最高温度最小。使用伴随变量法,推导了目标函数关于设计变量的敏度计算格式。算例表明,基于本文优化模型获得的散热路径设计与基于稳态热传导模型的结果有明显差别,具有更优的散热性能。因此,时变热荷载下的散热结构构型设计需要考虑瞬态响应的影响。     

Radial symmetry for systems of fractional Laplacian

In this paper, we consider systems of fractional Laplacian equations in Rnwith nonlinear terms satisfying some quite general structural conditions. These systems were categorized critical and subcritical cases. We show that there is no positive solution in the subcritical cases, and we classify all positive solutions ui in the critical cases by using a direct method of moving planes introduced in Chen-Li-Li [11] and some new maximum principles in Li-Wu-Xu [27].     

Strong cliques in vertex-transitive graphs

A clique (resp, independent set) in a graph is strong if it intersects every maximal independent set (resp, every maximal clique). A graph is clique intersect stable set (CIS) if all of its maximal cliques are strong and localizable if it admits a partition of its vertex set into strong cliques. In this paper we prove that a clique $C$ in a vertex-transitive graph $\mathrm{\Gamma }$ is strong if and only if $\text{◂=▸}\text{◂⋅▸}\mid C\mid \mid I\mid =\mid V\left(\mathrm{\Gamma }\right)\mid$ for every maximal independent set $I$ of $\mathrm{\Gamma }$. On the basis of this result we prove that a vertex-transitive graph is CIS if and only if it admits a strong clique and a strong independent set. We classify all vertex-transitive graphs of valency at most 4 admitting a strong clique, and give a partial characterization of 5-valent vertex-transitive graphs admitting a strong clique. Our results imply that every vertex-transitive graph of valency at most 5 that admits a strong clique is localizable. We answer an open question by providing an example of a vertex-transitive CIS graph which is not localizable.     

Submanifolds in Cauchy Riemann Geometry

In this paper I would like to make a report on the results about hypersurfaces in the Heisenberg group and invariant curves and surfaces in CR geometry. The results are contained in the papers [8, 9, 16] and [14]. Besides, I would also report on the results about the strong maximum principle for a class of mean curvature type operators in [10].