A probabilistic approach to spectral analysis of growth-fragmentation equations

The growth-fragmentation equation describes a system of growing and dividing particles, and arises in models of cell division, protein polymerisation and even telecommunications protocols. Several important questions about the equation concern the asymptotic behaviour of solutions at large times: at what rate do they converge to zero or infinity, and what does the asymptotic profile of the solutions look like? Does the rescaled solution converge to its asymptotic profile at an exponential speed? These questions have traditionally been studied using analytic techniques such as entropy methods or splitting of operators. In this work, we present a probabilistic approach: we use a Feynman–Kac formula to relate the solution of the growth-fragmentation equation to the semigroup of a Markov process, and characterise the rate of decay or growth in terms of this process. We then identify the Malthus exponent and the asymptotic profile in terms of a related Markov process, and give a spectral interpretation in terms of the growth-fragmentation operator and its dual.     

Response surface methodology toward the optimization of high-energy carotenoid extraction from Aristeus antennatus shrimp

High-energy assisted extraction techniques, like ultrasound assisted extraction (UAE) and microwave assisted extraction (MAE), are widely applied over the last years for the recovery of bioactive compounds such as carotenoids, antioxidants and phenols from foods, animals and herbal natural sources. Especially for the case of xanthophylls, the main carotenoid group of crustaceans, they can be extracted in a rapid and quantitative way with the use of UAE and MAE.     

A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form

The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot. It is believed that the structural characteristics of different SAT formula classes are the reasons behind this difference. In this paper, we study the structural properties of propositional formulas in conjunctive normal form (CNF) by the principle of structural entropy of formulas. First, we used structural entropy to measure the complex structure of a formula and found that the difficulty solving the formula is related to the structural entropy of the formula. The smaller the compressing information of a formula, the more difficult it is to solve the formula. Secondly, we proposed a λ-approximation strategy to approximate the structural entropy of large formulas. The experimental results showed that the proposed strategy can effectively approximate the structural entropy of the original formula and that the approximation ratio is more than 92%. Finally, we analyzed the structural properties of a formula in the solution process and found that a local search solver tends to select variables in different communities to perform the next round of searches during a search and that the structural entropy of a variable affects the probability of the variable being flipped. By using these conclusions, we also proposed an initial candidate solution generation strategy for a local search for SAT, and the experimental results showed that this strategy effectively improves the performance of the solvers CCAsat and Sparrow2011 when incorporated into these two solvers.     

基于Kronecker型替换的黑盒多项式稀疏插值

本文基于新的Kronecker型替换,给出两个由黑盒表示的稀疏多项式的新确定性插值算法.令f∈R[x1,……,xn]是一个稀疏黑盒多项式,其次数上界为D.当R是C或者是有限域时,相对于已有算法,新算法具有更好的计算复杂度或者关于D的复杂度更低.特别地,对于一般黑盒模型,D是复杂度中的主要因素,而在所有的确定性算法中,本文的第二个算法的复杂度关于D是最低的.     

Zero dissipation limit to rarefaction wave with vacuum for the one-dimensional non-isentropic micropolar equations

The zero dissipation limit of the one-dimensional non-isentropic micropolar equations is studied in this paper. If the given rarefaction wave which connects to vacuum at one side, a sequence of solution to the micropolar equations can be constructed which converge to the above rarefaction wave with vacuum as the viscosity and the heat conduction coefficient tend to zero. Moreover, the uniform convergence rate is obtained. The key point in our analysis is how to control the degeneracies in the vacuum region in the zero dissipation limit process.     

一阶最优性条件研究

本对由Botsko的关于多变量函数取极值的一阶导数检验条件定理^[1]进行了分析研究，给出了更实用而简捷的差别条件。最后，举出若干例子予以说明。     

一类稀疏效应下捕食┐被捕食者系统极限环的存在性和唯一性

本文研究捕食者种群具有线性密度制约的一类稀疏效应下捕食－被捕食者系统ｘ＝ｘ（ａｘ－ｃｘ３－ｂｙ），ｙ＝ｙ（－α＋βｘ－γｙ）．（＊）得到：（１）当Ａ１＜Ａ１，Ａ２＜Ａ２，Ａ３＞Ａ３时，系统（＊）在第一象限内存在极限环；（２）当Ａ２＜Ａ２，Ａ３＞Ａ３时，系统（＊）在第一象限内存在唯一极限环     

Isotopic families of contact manifolds for elliptic PDE

A test for a function to be a solution of an elliptic PDE is given in terms of extensions, as solutions, from the boundaries inside the domains belonging to an isotopic family. It generalizes a result of Ehrenpreis for spheres moved along a straight line.

     

Clifford分析中无界域上正则函数的边值问题

在引入修正Cauchy核的基础上,讨论了无界域上正则函数的带共轭值的边值问题：a(t)Φ (t) b(t)Φ (t) c(t)Φ-(t) d(t)Φ=g(t)．首先给出了无界域上正则函数的Plemelj公式,然后利用积分方程方法和压缩不动点原理证明了问题解的存在唯一性．