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).     

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.     

On molecular topological properties of hex‐derived networks

Topological indices are numerical parameters of a molecular graph, which characterize its topology and are usually graph invariant. In quantitative structure–activity relationship/quantitative structure–property relationship study, physico‐chemical properties and topological indices such as Randić, atom–bond connectivity (ABC), and geometric–arithmetic (GA) index are used to predict the bioactivity of chemical compounds. Graph theory has found a considerable use in this area of research. In this paper, we study hex‐derived networks HDN1(n) and HDN2(n), which are generated by hexagonal network of dimension n and derive analytical closed results of general Randić index R_α(G) for different values of α, for these networks of dimension n. We also compute the general first Zagreb, ABC, GA, ABC₄, and GA₅ indices for these hex‐derived networks for the first time and give closed formulae of these degree‐based indices for hex‐derived networks. Copyright © 2016 John Wiley & Sons, Ltd.     

Toader型平均的算术与调和平均界

给出了Toader型平均T[A(a,b),G(a,b)]关于调和平均H(a,b)与算术平均A(a,b)组合的精确界.作为应用,发现了几个关于第二类完全椭圆积分的精确不等式.     

Efficient remainder rule

Understanding the solution of a problem may require the reader to have background knowledge on the subject. For instance, finding an integer which, when divided by a nonzero integer leaves a remainder; but when divided by another nonzero integer may leave a different remainder. To find a smallest positive integer or a set of integers following the given conditions, one may need to understand the concept of modulo arithmetic in number theory. The Chinese Remainder Theorem is a known method to solve these types of problems using modulo arithmetic. In this paper, an efficient remainder rule has been proposed based on basic mathematical concepts. These core concepts are as follows: basic remainder rules of divisions, linear equation in slope intercept form, arithmetic progression and the use of a graphing calculator. These are easily understood by students who have taken prealgebra or intermediate algebra.     

Subspace arrangements as generalized star configurations

In this note, we show that any projective subspace arrangement can be realized as a generalized star configuration variety. This type of interpolation result may be useful in designing linear codes with prescribed codewords of minimum weight, as well as in answering a couple of questions about the number of equations needed to define a generalized star configuration variety.     

基于动态神经元网络的激光陀螺输出误差模型

惯性敏感器误差补偿技术对提高武器装备的性能具有重要的意义,而误差补偿的关键在于误差模型的辨识。由于动态神经元网络是在前馈网络的节点引入前馈和反馈环节,理论上已证明其具有很强的动态逼近能力,可用来描述任意的非线性动态系统。根据惯性敏感器误差的动态特性,本探讨将动态神经元网络引入到激光陀螺误差建模中去,详细介绍了网络结构和对应的动态梯度算法。通过仿真算例说明,动态神经元网络在激光陀螺输出误差建模时具有一定的优点：网络收敛速度快、较好的跟踪性能、稳定性好。     

模糊桁架结构在模糊激励下的动力响应分析

研究了模糊参数桁架结构在模糊荷载激励下的动力响应分析问题. 不仅模糊桁架结构的物 理参数、几何尺寸具有模糊性，而且外载荷幅值也具有模糊性时，从Duhamel积分式出发，利用模糊因子法、区间运算和振型叠加法求出了结构动力响应模糊变量的表达式. 最后通过算例考察了结构参数和作用荷载的模糊性对结构动力响应的影响，表明所提出的计算模型和 分析方法是正确与可行的.     

Rotating bunsen flames as solutions of the Kuramoto-Sivashinsky equation

Steadily rotating solutions of the Kuramoto-Sivashinsky equationu _t + ² u++¦u¦ ² =c ² are studied. These solutions bifurcate from the steady radial solution of the above equation. For large values ofc and angular velocities such thatN¦¦<2c<(N+1)¦¦, we show that there exists a 2N-1 family of bifurcating solutions. The proof is based on a certain generic transversality assumption. A computer-assisted proof of this assumption is given for 1N10.