In this paper, we continue studying the so called best m-term one-sided approximation and Greedy-liked one-sided ap- proximation by the trigonometric polynomials. The asymptotic estimations of the best m-terms one-sid...In this paper, we continue studying the so called best m-term one-sided approximation and Greedy-liked one-sided ap- proximation by the trigonometric polynomials. The asymptotic estimations of the best m-terms one-sided approximation by the trigonometric polynomials on some classes of Besov spaces in the metricLp(Td(1≤p≤∞ are given.展开更多
Nonlinear m-term approximation plays an important role in machine learning, signal processing and statistical estimating. In this paper by means of a nondecreasing dominated function, a greedy adaptive compression num...Nonlinear m-term approximation plays an important role in machine learning, signal processing and statistical estimating. In this paper by means of a nondecreasing dominated function, a greedy adaptive compression numerical algorithm in the best m -term approximation with regard to tensor product wavelet-type basis is pro-posed. The algorithm provides the asymptotically optimal approximation for the class of periodic functions with mixed Besov smoothness in the L q norm. Moreover, it depends only on the expansion of function f by tensor pro-duct wavelet-type basis, but neither on q nor on any special features of f.展开更多
In this paper, we continue studying the so-called non-linear best m-term one-sided approximation problems and obtain the asymptotic estimations of non-linear best m-term one-sided trigonometric approximation under the...In this paper, we continue studying the so-called non-linear best m-term one-sided approximation problems and obtain the asymptotic estimations of non-linear best m-term one-sided trigonometric approximation under the norm Lp （1 ≤ p ≤ ∞） of multiplier function classes and the corresponding m-term Greedy-liked one-sided trigonometric approximation results.展开更多
We investigate the efficiency of weak greedy algorithms for m-term expansional approximation with respect to quasi-greedy bases in general Banach spaces.We estimate the corresponding Lebesgue constants for the weak th...We investigate the efficiency of weak greedy algorithms for m-term expansional approximation with respect to quasi-greedy bases in general Banach spaces.We estimate the corresponding Lebesgue constants for the weak thresholding greedy algorithm(WTGA) and weak Chebyshev thresholding greedy algorithm.Then we discuss the greedy approximation on some function classes.For some sparse classes induced by uniformly bounded quasi-greedy bases of L_p,1<p<∞,we show that the WTGA realizes the order of the best m-term approximation.Finally,we compare the efficiency of the weak Chebyshev greedy algorithm(WCGA) with the thresholding greedy algorithm(TGA) when applying them to quasi-greedy bases in L_p,1≤p<∞,by establishing the corresponding Lebesgue-type inequalities.It seems that when p>2 the WCGA is better than the TGA.展开更多
相对于传统的基于通信的列车运行控制系统(communication based train control,CBTC),下一代列控系统将具有架构可靠、速率快、成本低以及服务质量高等优点,且数据通信系统的可用性能够保障列车的安全和高效运行。面向下一代列控系统,...相对于传统的基于通信的列车运行控制系统(communication based train control,CBTC),下一代列控系统将具有架构可靠、速率快、成本低以及服务质量高等优点,且数据通信系统的可用性能够保障列车的安全和高效运行。面向下一代列控系统,首先设计基于LTE-M(long term evolution-metro,LTE-M)的通信系统结构;然后针对下一代列控系统典型场景,利用确定与随机Petri网(deterministic and stochastic petri nets,DSPN)进行可用性建模,最后进行模型求解和可用性评估。仿真结果显示,基于LTE-M的下一代列控数据通信系统能够满足实际通信需求,其可用性分析方法可以完成数据通信系统的可用性建模与评估。展开更多
近年来,城市轨道交通建设加速增长,对城市轨道交通车地通信系统的可靠运行提出了更高的要求。随着第四代移动网络(4th Generation mobile networks,4G)具体化的长期演进(Long Term Evolution,LTE)系统已经广泛地进行了部署,而且技术也...近年来,城市轨道交通建设加速增长,对城市轨道交通车地通信系统的可靠运行提出了更高的要求。随着第四代移动网络(4th Generation mobile networks,4G)具体化的长期演进(Long Term Evolution,LTE)系统已经广泛地进行了部署,而且技术也逐渐趋于成熟,地铁长期演进(Long Term Evolution for Metro,LTE-M)车地通信系统具有较强的抗干扰能力、支持快速移动状态下的列车通信、资源调度灵活等优点,突破融合不同通信制式的关键技术,研制出信号通信设备样机,并根据列车控制系统的业务需求对新的通信制式进行测试,保障城铁列车的安全稳定运行。展开更多
文摘In this paper, we continue studying the so called best m-term one-sided approximation and Greedy-liked one-sided ap- proximation by the trigonometric polynomials. The asymptotic estimations of the best m-terms one-sided approximation by the trigonometric polynomials on some classes of Besov spaces in the metricLp(Td(1≤p≤∞ are given.
基金Supported by National Natural Science Foundation of China (No. 60872161, 10501026, 60675010 and 10626029)Natural Science Foundation of Tianjin (No. 08JCYBJC09600)China Postdoctoral Science Foundation ( No. 20070420708).
文摘Nonlinear m-term approximation plays an important role in machine learning, signal processing and statistical estimating. In this paper by means of a nondecreasing dominated function, a greedy adaptive compression numerical algorithm in the best m -term approximation with regard to tensor product wavelet-type basis is pro-posed. The algorithm provides the asymptotically optimal approximation for the class of periodic functions with mixed Besov smoothness in the L q norm. Moreover, it depends only on the expansion of function f by tensor pro-duct wavelet-type basis, but neither on q nor on any special features of f.
基金Supported by National Natural Science Foundation of China (Grant No. 10771016) supported by Shandong Agricultural University Youth Foundation
文摘In this paper, we continue studying the so-called non-linear best m-term one-sided approximation problems and obtain the asymptotic estimations of non-linear best m-term one-sided trigonometric approximation under the norm Lp （1 ≤ p ≤ ∞） of multiplier function classes and the corresponding m-term Greedy-liked one-sided trigonometric approximation results.
文摘We investigate the efficiency of weak greedy algorithms for m-term expansional approximation with respect to quasi-greedy bases in general Banach spaces.We estimate the corresponding Lebesgue constants for the weak thresholding greedy algorithm(WTGA) and weak Chebyshev thresholding greedy algorithm.Then we discuss the greedy approximation on some function classes.For some sparse classes induced by uniformly bounded quasi-greedy bases of L_p,1<p<∞,we show that the WTGA realizes the order of the best m-term approximation.Finally,we compare the efficiency of the weak Chebyshev greedy algorithm(WCGA) with the thresholding greedy algorithm(TGA) when applying them to quasi-greedy bases in L_p,1≤p<∞,by establishing the corresponding Lebesgue-type inequalities.It seems that when p>2 the WCGA is better than the TGA.
文摘相对于传统的基于通信的列车运行控制系统(communication based train control,CBTC),下一代列控系统将具有架构可靠、速率快、成本低以及服务质量高等优点,且数据通信系统的可用性能够保障列车的安全和高效运行。面向下一代列控系统,首先设计基于LTE-M(long term evolution-metro,LTE-M)的通信系统结构;然后针对下一代列控系统典型场景,利用确定与随机Petri网(deterministic and stochastic petri nets,DSPN)进行可用性建模,最后进行模型求解和可用性评估。仿真结果显示,基于LTE-M的下一代列控数据通信系统能够满足实际通信需求,其可用性分析方法可以完成数据通信系统的可用性建模与评估。
文摘近年来,城市轨道交通建设加速增长,对城市轨道交通车地通信系统的可靠运行提出了更高的要求。随着第四代移动网络(4th Generation mobile networks,4G)具体化的长期演进(Long Term Evolution,LTE)系统已经广泛地进行了部署,而且技术也逐渐趋于成熟,地铁长期演进(Long Term Evolution for Metro,LTE-M)车地通信系统具有较强的抗干扰能力、支持快速移动状态下的列车通信、资源调度灵活等优点,突破融合不同通信制式的关键技术,研制出信号通信设备样机,并根据列车控制系统的业务需求对新的通信制式进行测试,保障城铁列车的安全稳定运行。
