Measuring the Imbalance of Regional Development from Outer Space in China

We develop a statistical framework to use the data of night-time-lights (DN) from satellite to augment official GDP measures, and a non-linear substitution relationship between DN and GDP is given. In this paper, we take advantage of DN instead of GDP to measure the imbalance of regional development (IRD) in China by using the method of bi-dimensional decomposition under the population-weighted coefficient of variation. The method enables us to analyze the contributions of DN components to within-region and between-regions inequality under the framework which has been proposed, we can get the conclusion that the imbalance between-regions rather than within-region is the main reason for the influence of IRD for the whole country in China.

Displacement-Time Graph of a Point on a Wave Pulse

Using a linear substitution of distance by velocity and time, it is shown how a displacement-time profile of a particle on a wave pulse is graphed.

Beyond-Birthday-Bound Security for 4-round Linear Substitution-Permutation Networks

Recent works of Cogliati et al. (CRYPTO 2018) have initiated provable treatments of Substitution-Permutation Networks (SPNs), one of the most popular approach to construct modern blockciphers. Such theoretical SPN models may employ non-linear diffusion layers, which enables beyond-birthday-bound provable security. Though, for the model of real world blockciphers, i.e., SPN models with linear diffusion layers, existing provable results are capped at birthday security up to 2n/2 adversarial queries, where n is the size of the idealized S-boxes.In this paper, we overcome this birthday barrier and prove that a 4-round SPN with linear diffusion layers and independent round keys is secure up to 22n/3 queries. For this, we identify conditions on the linear layers that are sufficient for such security, which, unsurprisingly, turns out to be slightly stronger than Cogliati et al.’s conditions for birthday security. These provides additional theoretic supports for real world SPN blockciphers.

On the Growth Order and Growth Type of Entire Functions of Several Complex Matrices

In this paper, we establish an explicit relation between the growth of the maximum modulus and the Taylor coefficients of entire functions in several complex matrix variables (FSCMVs) in hyperspherical regions. The obtained formulas enable us to compute the growth order and the growth type of some higher dimensional generalizations of the exponential, trigonometric, and some special FSCMVs which are analytic in some extended hyperspherical domains. Furthermore, a result concerning linear substitution of the mode of increase of FSCMVs is given.

Tight typings and split bounds, fully developed

Multi types – aka non-idempotent intersection types – have been used. to obtain quantitative bounds on higher-order programs, as pioneered by de Carvalho. Notably, they bound at the same time the number of evaluation steps and the size of the result. Recent results show that the number of steps can be taken as a reasonable time complexity measure. At the same time, however, these results suggest that multi types provide quite lax complexity bounds, because the size of the result can be exponentially bigger than the number of steps. Starting from this observation, we refine and generalise a technique introduced by Bernadet and Graham-Lengrand to provide exact bounds. Our typing judgements carry counters, one measuring evaluation lengths and the other measuring result sizes. In order to emphasise the modularity of the approach, we provide exact bounds for four evaluation strategies, both in the λ-calculus (head, leftmost-outermost, and maximal evaluation) and in the linear substitution calculus (linear head evaluation). Our work aims at both capturing the results in the literature and extending them with new outcomes. Concerning the literature, it unifies de Carvalho and Bernadet & Graham-Lengrand via a uniform technique and a complexity-based perspective. The two main novelties are exact split bounds for the leftmost strategy – the only known strategy that evaluates terms to full normal forms and provides a reasonable complexity measure – and the observation that the computing device hidden behind multi types is the notion of substitution at a distance, as implemented by the linear substitution calculus.

An algebraic study of multivariable integration and linear substitution

We set up an algebraic theory of multivariable integration, based on a hierarchy of Rota–Baxter operators and an action of the matrix monoid as linear substitutions. Given a suitable coefficient domain with a bialgebra structure, this allows us to build an operator ring that acts naturally on the given Rota–Baxter hierarchy. We conjecture that the operator relations are a noncommutative Gröbner–Shirshov basis for the ideal they generate.