Context-free grammars to detect straight segments and a novel polygonal approximation method

A new method for the polygonal approximation is presented. The method is based on the search for break points through a context-free grammar, that accepts digital straight segments with loss of information, as well as the decrease in the error committed employing the comparison of a tolerable error. We present an application of our method to different sets of objects widely used, as well as a comparison of our results with the best results reported in the literature, proving that our method achieves better values of error criteria. Besides, a new way to find polygonal approximations, with context-free grammars to recognize digital straight segments without loss of pixels, it is also addressed.     

A posteriori error analysis of a quadratic finite volume method for nonlinear elliptic problems

In this article, we construct and analyze a residual-based a posteriori error estimator for a quadratic finite volume method (FVM) for solving nonlinear elliptic partial differential equations with homogeneous Dirichlet boundary conditions. We shall prove that the a posteriori error estimator yields the global upper and local lower bounds for the norm error of the FVM. So that the a posteriori error estimator is equivalent to the true error in a certain sense. Numerical experiments are performed to illustrate the theoretical results.     

On the performance of improved quadrature spatial modulation

Quadrature spatial modulation (QSM) utilizes the in‐phase and quadrature spatial dimensions to transmit the real and imaginary parts of a single signal symbol, respectively. The improved QSM (IQSM) transmits two signal symbols per channel use through a combination of two antennas for each of the real and imaginary parts. The main contributions of this study can be summarized as follows. First, we derive an upper bound for the error performance of the IQSM. We then design constellation sets that minimize the error performance of the IQSM for several system configurations. Second, we propose a double QSM (DQSM) that transmits the real and imaginary parts of two signal symbols through any available transmit antennas. Finally, we propose a parallel IQSM (PIQSM) that splits the antenna set into equal subsets and performs IQSM within each subset using the same two signal symbols. Simulation results demonstrate that the proposed constellations significantly outperform conventional constellations. Additionally, DQSM and PIQSM provide a performance similar to that of IQSM while requiring a smaller number of transmit antennas and outperform IQSM with the same number of transmit antennas.     

激光脉冲编码抗有源干扰效果研究

激光脉冲编码是激光制导武器的抗干扰措施之一。角度欺骗式干扰和高重频干扰是目前半主动激光制导武器的主要有源干扰来源。为研究不同激光脉冲编码方式对激光半主动制导武器抗这两种干扰性能的影响,本文针对敌方激光告警机的识别算法与我方导引头的解码过程,提出自相关函数与归一化互相关函数评价方法,并对目前主要编码方式进行仿真,仿真结果表明:激光脉冲编码的抗角度欺骗式干扰能力受编码序列周期性与脉冲间隔随机性的影响；抗高重频激光干扰能力受编码序列脉冲间隔随机性的影响；LFSR状态码的抗角度欺骗式干扰与抗高重频干扰效果均优于其他编码方式。     

DISPERSION COMPENSATION CFBG IN100km 10Gbit／s RECIRCULATING SYSTEMS

A 10Gbit/s recirculating system is configured with Chirped Fiber Bragg Grating (CFBG) for the dispersion compensation. For the first time, the transmission distance in the loop reaches 1000km with bit error rate of 10-9. The effect of the group delay ripple of the fiber grating is also investigated in the recirculating systems, and it is shown that the transmission distance is limited to 4 cycles (4×167.1km ) in the loop with the power penalty fluctuation below 1.0dB. Thus the group delay ripple should be reduced to allow for the wavelength drift of±5GHz. At the end of this letter, the principles are given for designing long haul recirculating systems with dispersion compensation CFBG.     

数字化正弦平方脉冲信号

依据正弦平方脉冲的数学方程及其频谱分布，分别导出了与理想和标称视频带宽相对应的正弦平方脉冲的数学表达式及其编程生成方法。实验表明，此法不仅精确，而且便于修改参数，并可直接读人数字电视系统，来测定视频线性响应。     

电子天平示值误差测量结果的不确定度评定

一切测量结果都不可避免地具有不确定度，结合实际应用的情况，详细介绍了电子天平示值误差测量结果的不确定度评定方法。     

On the effects of the packet size distribution on the packet loss process

Real-time multimedia applications have to use forward error correction (FEC) anderror concealment techniques to cope with losses in today’s best-effort Internet. The efficiency of these solutions is known however to depend on the correlation between losses in the media stream. In this paper we investigate how the packet size distribution affects the packet loss process, that is, the distribution of the number of lost packets in a block, the related FEC performance and the average loss run length. We present mathematical models for the loss process of the MMPP+M/D/1/K and the MMPP+M/M/1/K queues; we validate the models via simulations, and compare the results to simulation results with an MPEG-4 coded video trace. We conclude that the deterministic packet size distribution (PSD) not only results in lower stationary loss probability than the exponential one, but also gives a less correlated loss process, both at a particular average link load and at a particular stationary loss probability as seen by the media stream.Our results show that for applications that can only measure the packet loss probability, the effects of the PSD on FEC performance are higher in access networks, where a single multimedia stream might affect the multiplexing behavior. Our results show that the effects of the PSD on FEC performance are higher in access networks, where a single multimedia stream might affect the multiplexing behavior and thus can improve the queuing performance by decreasing the variance of its PSD.