t Let f（z） be a holomorphic Hecke eigencuspform of weight k for the full mod- ular group. Let Af（n） be the nth normalized Fourier coefficient of f（z）. Suppose that L（sym2f, s） is the symmetric square L-functio...t Let f（z） be a holomorphic Hecke eigencuspform of weight k for the full mod- ular group. Let Af（n） be the nth normalized Fourier coefficient of f（z）. Suppose that L（sym2f, s） is the symmetric square L-function associated with f（z）, and Asym2f（n） de- notes the nth coefficient L（sym2f, s）. In this paper, it is proved that where P2 （t） is a polynomial in t of degree 2. Similarly, it is obtained that where P2（t） is a polynomial in t of degree 2.展开更多
Let L（s, sym2f） be the symmetric-square L-function associated to a primitive holomorphic cusp form f for SL（2, Z）, with tf（n, 1） denoting the nthcoefficient of the Dirichlet series for it. It is proved that, for...Let L（s, sym2f） be the symmetric-square L-function associated to a primitive holomorphic cusp form f for SL（2, Z）, with tf（n, 1） denoting the nthcoefficient of the Dirichlet series for it. It is proved that, forN≥2and anyα∈ there exists an effective positive constant c such that ∑n≤N∧（n）tf（n,1）e（nα）〈〈N exp （-c√logN,where ∧（n） is the von Mangoldt function, and the implied constant only depends on f. We also study the analogue of Vinogradov＇s three primes theorem associated to the coefficients of Rankin-Selberg L-functions.展开更多
The constructional methods of pandiagonal snowflake magic squares of orders 4m are established in paper [3]. In this paper, the constructional methods of pandiagonal snowflake magic squares of odd orders n are establi...The constructional methods of pandiagonal snowflake magic squares of orders 4m are established in paper [3]. In this paper, the constructional methods of pandiagonal snowflake magic squares of odd orders n are established with n = 6m+l, 6m+5 and 6m+3, m is an odd positive integer and m is an even positive integer 9|6m + 3. It is seen that the number sets for constructing pandiagonal snowflake magic squares can be extended to the matrices with symmetric partial difference in each direction for orders 6m + 1 , 6m + 5; to the trisection matrices with symmetric partial difference in each direction for order 6m + 3.展开更多
Large eddy simulation cooperated with the second order full extension ETG(Euler-Taylor-Galerkin) finite element method was applied to simulate the flow around two square cylinders arranged side by side at a spacing ra...Large eddy simulation cooperated with the second order full extension ETG(Euler-Taylor-Galerkin) finite element method was applied to simulate the flow around two square cylinders arranged side by side at a spacing ratio of (1.5.) The second order full extension ETG finite element method was developed by Wang and He. By means of Taylor expansion of terms containing time derivative, time derivative is replaced by space derivative. The function of it is equal to introducing an artificial viscosity term. The streamlines of the flow at different moments were obtained. The time history of drag coefficient, lift coefficient and the streamwise velocity on the symmetrical points were presented. Furthermore, the symmetrical problem of the frequency spectrum of flow around two square cylinders arranged side by side were studied by using the spectral analysis technology. The data obtained at the initial stage are excluded in order to avoid the influence of initial condition on the results. The power spectrums of drag coefficient, lift coefficient, the streamwise velocity on the symmetrical points were analyzed respectively. The results show that although the time domain process of dynamic parameters is non-symmetrical, the frequency domain process of them is symmetrical under the symmetrical boundary conditions.展开更多
The asymptotic behaviors for estimators of the drift parameters in the Ornstein-Uhlenbeck process driven by small symmetricα-stable motion are studied in this paper.Based on the discrete observations,the conditional ...The asymptotic behaviors for estimators of the drift parameters in the Ornstein-Uhlenbeck process driven by small symmetricα-stable motion are studied in this paper.Based on the discrete observations,the conditional least squares estimators(CLSEs)of all the parameters involved in the Ornstein–Uhlenbeck process are proposed.We establish the consistency and the asymptotic distributions of our estimators asεgoes to 0 and n goes to∞simultaneously.展开更多
We study the eight infinite sequences of triples of natural numbers A=(F2n+1,4F2n+3,F2n+7), B=(F2n+1,4F2n+5,F2n+7), C=(F2n+1,5F2n+1,F2n+3), D=(F2n+3,4F2n+1,F2n+3) and A=(L2n+1,4L2n+3,L2n+7), B=(L2n+1,4L2n+5,L2n+7), C=...We study the eight infinite sequences of triples of natural numbers A=(F2n+1,4F2n+3,F2n+7), B=(F2n+1,4F2n+5,F2n+7), C=(F2n+1,5F2n+1,F2n+3), D=(F2n+3,4F2n+1,F2n+3) and A=(L2n+1,4L2n+3,L2n+7), B=(L2n+1,4L2n+5,L2n+7), C=(L2n+1,5L2n+1,L2n+3), D=(L2n+3,4L2n+1,L2n+3. The sequences A,B,C and D are built from the Fibonacci numbers Fn while the sequences A, B, C and D from the Lucas numbers Ln. Each triple in the sequences A,B,C and D has the property D(-4) (i. e., adding -4 to the product of any two different components of them is a square). Similarly, each triple in the sequences A, B, C and D has the property D(20). We show some interesting properties of these sequences that give various methods how to get squares from them.展开更多
In this paper, an iterative method is constructed to find the least-squares solutions of generalized Sylvester equation , where is real matrices group, and satisfies different linear constraint. By this iterative meth...In this paper, an iterative method is constructed to find the least-squares solutions of generalized Sylvester equation , where is real matrices group, and satisfies different linear constraint. By this iterative method, for any initial matrix group within a special constrained matrix set, a least squares solution group with satisfying different linear constraint can be obtained within finite iteration steps in the absence of round off errors, and the unique least norm least-squares solution can be obtained by choosing a special kind of initial matrix group. In addition, a minimization property of this iterative method is characterized. Finally, numerical experiments are reported to show the efficiency of the proposed method.展开更多
Least-squares solution of AXB = D with respect to symmetric positive semidefinite matrix X is considered. By making use of the generalized singular value decomposition, we derive general analytic formulas, and present...Least-squares solution of AXB = D with respect to symmetric positive semidefinite matrix X is considered. By making use of the generalized singular value decomposition, we derive general analytic formulas, and present necessary and sufficient conditions for guaranteeing the existence of the solution. By applying MATLAB 5.2, we give some numerical examples to show the feasibility and accuracy of this construction technique in the finite precision arithmetic.展开更多
Denote by SFin（v） the set of all integer pairs （t, s） for which there exist three symmetric Latin squares of order v on the same set having fine structure （t, s）. We completely determine the set SFin（2n） for a...Denote by SFin（v） the set of all integer pairs （t, s） for which there exist three symmetric Latin squares of order v on the same set having fine structure （t, s）. We completely determine the set SFin（2n） for any integer n ≥ 5.展开更多
针对高速移动场景中正交时频空间(Orthogonal Time Frequency Space, OTFS)系统线性最小均方误差(Linear Minimum Mean Square Error, LMMSE)检测复杂度过高而难以快速有效实现的问题,利用零填充(Zero Padding, ZP)OTFS系统时域信道矩...针对高速移动场景中正交时频空间(Orthogonal Time Frequency Space, OTFS)系统线性最小均方误差(Linear Minimum Mean Square Error, LMMSE)检测复杂度过高而难以快速有效实现的问题,利用零填充(Zero Padding, ZP)OTFS系统时域信道矩阵呈块对角稀疏特性提出一种逐块迭代的对称逐次超松弛(Symmetric Successive over Relaxation, SSOR)迭代算法,在降低系统复杂度的同时获得与LMMSE检测近似的性能。仿真结果表明,与逐次超松弛(Successive over Relaxation, SOR)算法相比,所提算法对松弛参数不敏感且具有更快的收敛速度,在迭代次数为10次时误码性能几乎达到LMMSE误码性能,显著降低了检测器的复杂度。展开更多
Let f and g be holomorphic cusp forms of weights k1 and k2 for the congruence subgroups TO(N1)and Γ0(N2),respectively.In this paper the square moment of the Rankin-Selberg L-function for f and g in the aspect of both...Let f and g be holomorphic cusp forms of weights k1 and k2 for the congruence subgroups TO(N1)and Γ0(N2),respectively.In this paper the square moment of the Rankin-Selberg L-function for f and g in the aspect of both weights in short intervals is bounded,when k1^ε <<k^2<<k1^1-ε.These bounds are the mean Lindelof hypothesis in one case and subconvexity bounds on average in other cases.These square moment estimates also imply subconvexity bounds for individual L(1/2+it,f×g) for all g when f is chosen outside a small exceptional set.In the best case scenario the subconvexity bound obtained reaches the Weyl-type bound proved by Lau et al.(2006) in both the k1 and k2 aspects.展开更多
动态电压恢复器(dynamic voltage restorer,DVR)的响应速度是衡量DVR特性的重要指标,锁相环和电压跌落检测算法则是决定其响应速度的2个关键因素,而电网电压畸变、跌落过程中发生的相位跳变和电压不平衡制约着锁相环和检测算法的快速性...动态电压恢复器(dynamic voltage restorer,DVR)的响应速度是衡量DVR特性的重要指标,锁相环和电压跌落检测算法则是决定其响应速度的2个关键因素,而电网电压畸变、跌落过程中发生的相位跳变和电压不平衡制约着锁相环和检测算法的快速性。该文结合最小方差(least error squares,LES)滤波器和改进对称分量法设计了新的软件锁相环和电压跌落检测算法,对这2种方法进行详细的理论推导,阐明各频次的正负序分量解耦的机理。在Matlab/Simulink中搭建仿真模型,与传统锁相环方法和电压跌落检测算法进行对比分析。最后,在电压跌落平台进行工业样机验证,结果表明所提方法可行有效,且具有较高的响应速度。展开更多
基金Project supported by the National Natural Science Foundation of China(Nos.10971119,11101249)the Shandong Provincial Natural Science Foundation of China(No.ZR2009AQ007)
文摘t Let f（z） be a holomorphic Hecke eigencuspform of weight k for the full mod- ular group. Let Af（n） be the nth normalized Fourier coefficient of f（z）. Suppose that L（sym2f, s） is the symmetric square L-function associated with f（z）, and Asym2f（n） de- notes the nth coefficient L（sym2f, s）. In this paper, it is proved that where P2 （t） is a polynomial in t of degree 2. Similarly, it is obtained that where P2（t） is a polynomial in t of degree 2.
文摘Let L（s, sym2f） be the symmetric-square L-function associated to a primitive holomorphic cusp form f for SL（2, Z）, with tf（n, 1） denoting the nthcoefficient of the Dirichlet series for it. It is proved that, forN≥2and anyα∈ there exists an effective positive constant c such that ∑n≤N∧（n）tf（n,1）e（nα）〈〈N exp （-c√logN,where ∧（n） is the von Mangoldt function, and the implied constant only depends on f. We also study the analogue of Vinogradov＇s three primes theorem associated to the coefficients of Rankin-Selberg L-functions.
文摘The constructional methods of pandiagonal snowflake magic squares of orders 4m are established in paper [3]. In this paper, the constructional methods of pandiagonal snowflake magic squares of odd orders n are established with n = 6m+l, 6m+5 and 6m+3, m is an odd positive integer and m is an even positive integer 9|6m + 3. It is seen that the number sets for constructing pandiagonal snowflake magic squares can be extended to the matrices with symmetric partial difference in each direction for orders 6m + 1 , 6m + 5; to the trisection matrices with symmetric partial difference in each direction for order 6m + 3.
文摘Large eddy simulation cooperated with the second order full extension ETG(Euler-Taylor-Galerkin) finite element method was applied to simulate the flow around two square cylinders arranged side by side at a spacing ratio of (1.5.) The second order full extension ETG finite element method was developed by Wang and He. By means of Taylor expansion of terms containing time derivative, time derivative is replaced by space derivative. The function of it is equal to introducing an artificial viscosity term. The streamlines of the flow at different moments were obtained. The time history of drag coefficient, lift coefficient and the streamwise velocity on the symmetrical points were presented. Furthermore, the symmetrical problem of the frequency spectrum of flow around two square cylinders arranged side by side were studied by using the spectral analysis technology. The data obtained at the initial stage are excluded in order to avoid the influence of initial condition on the results. The power spectrums of drag coefficient, lift coefficient, the streamwise velocity on the symmetrical points were analyzed respectively. The results show that although the time domain process of dynamic parameters is non-symmetrical, the frequency domain process of them is symmetrical under the symmetrical boundary conditions.
基金Key Natural Science Foundation of Anhui Education Commission,China(No.KJ2017A568)Natural Science Foundation of Anhui Province,China(No.1808085MA02)+1 种基金Quality Engineering Project of Anhui Province,China(No.2019jyxm0476)Quality Engineering Project of Bengbu University,China(No.2018JYXML8)。
文摘The asymptotic behaviors for estimators of the drift parameters in the Ornstein-Uhlenbeck process driven by small symmetricα-stable motion are studied in this paper.Based on the discrete observations,the conditional least squares estimators(CLSEs)of all the parameters involved in the Ornstein–Uhlenbeck process are proposed.We establish the consistency and the asymptotic distributions of our estimators asεgoes to 0 and n goes to∞simultaneously.
文摘We study the eight infinite sequences of triples of natural numbers A=(F2n+1,4F2n+3,F2n+7), B=(F2n+1,4F2n+5,F2n+7), C=(F2n+1,5F2n+1,F2n+3), D=(F2n+3,4F2n+1,F2n+3) and A=(L2n+1,4L2n+3,L2n+7), B=(L2n+1,4L2n+5,L2n+7), C=(L2n+1,5L2n+1,L2n+3), D=(L2n+3,4L2n+1,L2n+3. The sequences A,B,C and D are built from the Fibonacci numbers Fn while the sequences A, B, C and D from the Lucas numbers Ln. Each triple in the sequences A,B,C and D has the property D(-4) (i. e., adding -4 to the product of any two different components of them is a square). Similarly, each triple in the sequences A, B, C and D has the property D(20). We show some interesting properties of these sequences that give various methods how to get squares from them.
文摘In this paper, an iterative method is constructed to find the least-squares solutions of generalized Sylvester equation , where is real matrices group, and satisfies different linear constraint. By this iterative method, for any initial matrix group within a special constrained matrix set, a least squares solution group with satisfying different linear constraint can be obtained within finite iteration steps in the absence of round off errors, and the unique least norm least-squares solution can be obtained by choosing a special kind of initial matrix group. In addition, a minimization property of this iterative method is characterized. Finally, numerical experiments are reported to show the efficiency of the proposed method.
基金Subsidized by The Special Funds For Major State Basic Research Project G1999032803.
文摘Least-squares solution of AXB = D with respect to symmetric positive semidefinite matrix X is considered. By making use of the generalized singular value decomposition, we derive general analytic formulas, and present necessary and sufficient conditions for guaranteeing the existence of the solution. By applying MATLAB 5.2, we give some numerical examples to show the feasibility and accuracy of this construction technique in the finite precision arithmetic.
基金Supported by National Natural Science Foundation of China （Grant No. 10771013）
文摘Denote by SFin（v） the set of all integer pairs （t, s） for which there exist three symmetric Latin squares of order v on the same set having fine structure （t, s）. We completely determine the set SFin（2n） for any integer n ≥ 5.
文摘针对高速移动场景中正交时频空间(Orthogonal Time Frequency Space, OTFS)系统线性最小均方误差(Linear Minimum Mean Square Error, LMMSE)检测复杂度过高而难以快速有效实现的问题,利用零填充(Zero Padding, ZP)OTFS系统时域信道矩阵呈块对角稀疏特性提出一种逐块迭代的对称逐次超松弛(Symmetric Successive over Relaxation, SSOR)迭代算法,在降低系统复杂度的同时获得与LMMSE检测近似的性能。仿真结果表明,与逐次超松弛(Successive over Relaxation, SOR)算法相比,所提算法对松弛参数不敏感且具有更快的收敛速度,在迭代次数为10次时误码性能几乎达到LMMSE误码性能,显著降低了检测器的复杂度。
基金supported by National Natural Science Foundation of China(Grant No.11531008)Ministry of Education of China(Grant No.IRT16R43)+3 种基金Taishan Scholar Project of Shandong Provincesupported by National Natural Science Foundation of China(Grant No.11601271)China Postdoctoral Science Foundation(Grant No.2016M602125)China Scholarship Council(Grant No.201706225004)。
文摘Let f and g be holomorphic cusp forms of weights k1 and k2 for the congruence subgroups TO(N1)and Γ0(N2),respectively.In this paper the square moment of the Rankin-Selberg L-function for f and g in the aspect of both weights in short intervals is bounded,when k1^ε <<k^2<<k1^1-ε.These bounds are the mean Lindelof hypothesis in one case and subconvexity bounds on average in other cases.These square moment estimates also imply subconvexity bounds for individual L(1/2+it,f×g) for all g when f is chosen outside a small exceptional set.In the best case scenario the subconvexity bound obtained reaches the Weyl-type bound proved by Lau et al.(2006) in both the k1 and k2 aspects.
文摘动态电压恢复器(dynamic voltage restorer,DVR)的响应速度是衡量DVR特性的重要指标,锁相环和电压跌落检测算法则是决定其响应速度的2个关键因素,而电网电压畸变、跌落过程中发生的相位跳变和电压不平衡制约着锁相环和检测算法的快速性。该文结合最小方差(least error squares,LES)滤波器和改进对称分量法设计了新的软件锁相环和电压跌落检测算法,对这2种方法进行详细的理论推导,阐明各频次的正负序分量解耦的机理。在Matlab/Simulink中搭建仿真模型,与传统锁相环方法和电压跌落检测算法进行对比分析。最后,在电压跌落平台进行工业样机验证,结果表明所提方法可行有效,且具有较高的响应速度。
基金supported by National Natural Science Foundation of China (Grant Nos.11026075, 10971119)the Natural Science Foundation of Shandong Province (Grant No. ZR2009AQ007)
文摘We prove a non-trivial upper bound for the quantity ∫X2|X ∑_(n≤x)λ~2(nj)-c(j-1)x| 2dx for j=2, 3, 4.
