Subset representations and eigenvalues of the universal intertwining matrix

We solve a combinatorial question concerning eigenvalues of the universal intertwining endomorphism of a subset representation.     

基于差异信息量的多源数据融合方法

D-S证据理论可应用于多源数据融合领域，但在处理高度冲突的证据时，可能会出现反直觉的结果.为解决这一问题，本文提出了差异信息量的概念及融合方法.首先，通过信息熵表明证据的相对重要性，采用散度获取证据可信度.然后利用证据可信度优化证据差异度以得到差异信息量，经过计算获取数据的最终权重，并将其作为D-S证据理论中的基本概率分配进行决策.在处理冲突证据、一致证据及不同数量证据等方面的数据融合问题时与其他方法对比，所提方法收敛更快，准确度更高.故障诊断的应用实例表明，所提方法的不确定性更小，优于现存的其他方法.     

3维Maxwell方程局部1维多辛格式的能量恒等式

在理想导体边界条件下,对3维Maxwell方程的局部1维多辛Preissman格式的能量守恒性质进行研究.运用能量分析法推导了2个能量恒等式,这些恒等式说明了给出的格式在所定义的离散范数下是能量守恒和无条件稳定的,数值算例验证了结论的正确性.     

A simple three‐wave approximate Riemann solver for the Saint‐Venant‐Exner equations

Erosion and sediments transport processes have a great impact on industrial structures and on water quality. Despite its limitations, the Saint‐Venant‐Exner system is still (and for sure for some years) widely used in industrial codes to model the bedload sediment transport. In practice, its numerical resolution is mostly handled by a splitting technique that allows a weak coupling between hydraulic and morphodynamic distinct softwares but may suffer from important stability issues. In recent works, many authors proposed alternative methods based on a strong coupling that cure this problem but are not so trivial to implement in an industrial context. In this work, we then pursue 2 objectives. First, we propose a very simple scheme based on an approximate Riemann solver, respecting the strong coupling framework, and we demonstrate its stability and accuracy through a number of numerical test cases. However, second, we reinterpret our scheme as a splitting technique and we extend the purpose to propose what should be the minimal coupling that ensures the stability of the global numerical process in industrial codes, at least, when dealing with collocated finite volume method. The resulting splitting method is, up to our knowledge, the only one for which stability properties are fully demonstrated.     

On generalized perfect difference sets constructed from Sidon sets

Let $\mathbb{N}$ be the set of positive integers. For a nonempty set A of integers and every integer u, denote by $d_A(u)$ the number of $(a,a^{\prime })$ with $a,a^{\prime }\in A$ such that $u=a-a^{\prime }$. For a sequence S of positive integers, let $S(x)$ be the counting function of S. The set $A\subseteq \mathbb{N}$ is called a perfect difference set if $d_A(u)=1$ for every positive integer u. In 2008, Cilleruelo and Nathanson (2008) [4] constructed dense perfect difference sets from dense Sidon sets. In this paper, as a main result, we prove that: let $f:\mathbb{N}\to \mathbb{N}$ be an increasing function satisfying $f(n)\ge 2$ for any positive integer n, then for every Sidon set B and every function $\omega (x)\to \infty$, there exists a set $A\subseteq \mathbb{N}$ such that $d_A(u)=f(u)$ for every positive integer u and $B(x/3)-\omega (x)\le A(x)\le B(x/3)+\omega (x)$ for all $x\ge C_{f,B,\omega }$.     

Numerical Evaluation of a Two-Loop Diagram in the Cutoff Regularization

The sunset diagram of λφ4 theory is evaluated numerically in cutoff scheme and a nonzero finite term(in accordance with dimensional regularization (DR) result) is found in contrast to published calculations. This findingdramatically reduces the critical couplings for symmetry breaking in the two-loop effective potential discussed in ourprevious work.     

On the Moments of Overflow and Freed Carried Traffic for the GI/M/C/0 System

In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.     

EXISTENCE OF PERIODIC SOLUTIONS OF SYSTEM OF DIFFERENCE EQUATIONS

This paper studies the nonautonomous nonlinear system of difference equationsΔx(n)=A(n)x(n)+f(n,x(n)),n∈Z,(*) where x(n)∈R~N,A(n)=(a_(ij)(n))N×N is an N×N matrix,with a-(ij)∈C(R,R) for i,j= 1,2,3,...,N,and f=(f_1,f_2,...,f_N)~T∈C(R×R~N,R~N),satisfying A(t+ω)=A(t),f(t+ω,z)=f(t,z) for any t∈R,(t,z)∈R×R~N andωis a positive integer.Sufficient conditions for the existence ofω-periodic solutions to equations (*) are obtained.     

一类非线性Schr(o)dinger方程的守恒差分法与Fourier谱方法

考察了一类带导数项的非线性Schrodinger方程的周期边值问题，提出了一种守恒的差分格式，在空间方向上采用Fourier谱方法，证明了格式的稳定性和收敛性．数值试验得到了与理论分析一致的结果．