Side Information Generation Scheme Based on Coefficient Matrix Improvement Model in Transform Domain Distributed Video Coding

In order to effectively improve the quality of side information in distributed video coding, we propose a side information generation scheme based on a coefficient matrix improvement model. The discrete cosine transform coefficient bands of the Wyner–Ziv frame at the encoder side are divided into entropy coding coefficient bands and distributed video coding coefficient bands, and then the coefficients of entropy coding coefficient bands are sampled, which are divided into sampled coefficients and unsampled coefficients. For sampled coefficients, an adaptive arithmetic encoder is used for lossless compression. For unsampled coefficients and the coefficients of distributed video coding coefficient bands, the low density parity check accumulate encoder is used to calculate the parity bits, which are stored in the buffer and transmitted in small amount upon decoder request. At the decoder side, the optical flow method is used to generate the initial side information, and the initial side information is improved according to the sampled coefficients by using the coefficient matrix improvement model. The experimental results demonstrate that the proposed side information generation scheme based on the coefficient matrix improvement model can effectively improve the quality of side information, and the quality of the generated side information is improved by about 0.2–0.4 dB, thereby improving the overall performance of the distributed video coding system.     

Cofinal elementary extensions

We investigate some properties of ordered structures that are related to their having cofinal elementary extensions. Special attention is paid to models of some very weak fragments of Peano Arithmetic.     

Forbidden arithmetic progressions in permutations of subsets of the integers

Permutations of the positive integers avoiding arithmetic progressions of length 5 were constructed in Davis et al. (1977), implying the existence of permutations of the integers avoiding arithmetic progressions of length 7. We construct a permutation of the integers avoiding arithmetic progressions of length 6. We also prove a lower bound of $\frac{1}{2}$ on the lower density of subsets of positive integers that can be permuted to avoid arithmetic progressions of length 4, sharpening the lower bound of $\frac{1}{3}$ from LeSaulnier and Vijay (2011).     

Prym Representations of Mapping Class Groups

Let S be a closed orientable surface of genus at least 2 and let to S be a connected finite abelian covering with covering group $G$. The lifts of liftable mapping classes of S determine a central extension (by G) of a subgroup of finite index of the mapping class group of S. This extension acts on H₁( ). With a few exceptions for genus 2, we determine the Zariski closure of the image of this representation, and prove that the image is an arithmetic group.     

Novikov Conjectures for Arithmetic Groups with Large Actions at Infinity

We construct a new compactification of a noncompact rank one globally symmetric space. The result is a nonmetrizable space which also compactifies the Borel–Serre enlargement X of X, contractible only in the appropriate ech sense, and with the action of any arithmetic subgroup of the isometry group of X on X not being small at infinity. Nevertheless, we show that such a compactification can be used in the approach to Novikov conjectures developed recently by G. Carlsson and E. K. Pedersen. In particular, we study the nontrivial instance of the phenomenon of bounded saturation in the boundary of X and deduce that integral assembly maps split in the case of a torsion-free arithmetic subgroup of a semi-simple algebraic Q-group of real rank one or, in fact, the fundamental group of any pinched hyperbolic manifold. Using a similar construction we also split assembly maps for neat subgroups of Hilbert modular groups.     

各种线性控制器适应性算法及计算比较

阐述了各类线性控制器的相应控制算法 ,及其可辨识条件。给出有关计算工作量评估结论 ,对设计各类线性控制器具有很好的参考价值     

影响子母弹终端效应的关键参数及其搜索方法

为解决航空子母弹抛撒点抛撒高度、速度等参数设定问题,基于一种子弹单圈多段排布的航空子母弹模型,通过建立子弹的外弹道方程,研究它的地面散布并且寻找其散布规律；然后根据在实战中要求的所要摧毁的目标形状、面积,从子母弹作战效能角度出发,提出一种搜索算法,用该算法能搜索出覆盖目标范围所要求的子母弹的几种抛撒参数.仿真验证表明:该算法能够使子弹有效地覆盖目标,最大误差2.5％,提高了航空子母弹的作战效能.     

Random Walks on Trees and an Inequality of Means

We define trees generated by bi-infinite sequences, calculate their walk-invariant distribution and the speed of a biased random walk. We compare a simple random walk on a tree generated by a bi-infinite sequence with a simple random walk on an augmented Galton-Watson tree. We find that comparable simple random walks require the augmented Galton-Watson tree to be larger than the corresponding tree generated by a bi-infinite sequence. This is due to an inequality for random variables with values in [1, [ involving harmonic, geometric and arithmetic mean.     

Entiers Lexicographiques

An integer n is called lexicographic if the increasing sequence of its divisors, regarded as words on the (finite) alphabet of the prime factors (arranged in increasing size), is ordered lexicographically. This concept easily yields to a new type of multiplicative structure for the exceptional set in the Maier-Tenenbaum theorem on the propinquity of divisors, which settled a well-known conjecture of Erdös. We provide asymptotic formulae for the number of lexicographic integers not exceeding a given limit, as well as for certain arithmetically weighted sums over the same set. These results are subsequently applied to establishing an Erdös-Kac theorem with remainder for the distribution of the number of prime factors over lexicographic integers. This provides quantitative estimates for lexicographical exceptions to Erdos' conjecture that also satisfy the Hardy-Ramanujan theorem.