Finding any given 2‐factor in sparse pseudorandom graphs efficiently

Given an $n$‐vertex pseudorandom graph $G$ and an $n$‐vertex graph $H$ with maximum degree at most two, we wish to find a copy of $H$ in $G$, that is, an embedding $\phi :V\left(H\right)\to V\left(G\right)$ so that $\phi \left(u\right)\phi \left(v\right)\in E\left(G\right)$ for all $uv\in E\left(H\right)$. Particular instances of this problem include finding a triangle‐factor and finding a Hamilton cycle in $G$. Here, we provide a deterministic polynomial time algorithm that finds a given $H$ in any suitably pseudorandom graph $G$. The pseudorandom graphs we consider are $\left(p,\lambda \right)$‐bijumbled graphs of minimum degree which is a constant proportion of the average degree, that is, $\mathrm{\Omega }\left(pn\right)$. A $\left(p,\lambda \right)$‐bijumbled graph is characterised through the discrepancy property: $|e\left(A,B\right)?p|A||B||<\lambda \sqrt{|A||B|}$ for any two sets of vertices $A$ and $B$. Our condition $\lambda =O(p^{2}n/\log n)$ on bijumbledness is within a log factor from being tight and provides a positive answer to a recent question of Nenadov. We combine novel variants of the absorption‐reservoir method, a powerful tool from extremal graph theory and random graphs. Our approach builds on our previous work, incorporating the work of Nenadov, together with additional ideas and simplifications.     

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.     

Asymptotic Behavior of Least Energy Solutions for a Fractional Laplacian Eigenvalue Problem on ℝN

Acta Mathematica Sinica, English Series - We are interested in the existence and asymptotic behavior for the least energy solutions of the following fractional eigenvalue problem $$\left({\rm{P}}...     

Photodegradation mechanisms of acyclovir in water and the toxicity of photoproducts

Journal of Radioanalytical and Nuclear Chemistry - In the present work the final products of coumarin radiation chemical transformation are investigated by chromatography. During radiolysis of...     

Recent advances and challenges in the recovery and purification of cellular exosomes

Exosomes are nanovesicles secreted by most cellular types that carry important biochemical compounds throughout the body with different purposes, playing a preponderant role in cellular communication. Because of their structure, physicochemical properties and stability, recent studies are focusing in their use as nanocarriers for different therapeutic compounds for the treatment of different diseases ranging from cancer to Parkinson's disease. However, current bioseparation protocols and methodologies are selected based on the final exosome application or intended use and present both advantages and disadvantages when compared among them. In this context, this review aims to present the most important technologies available for exosome isolation while discussing their advantages and disadvantages and the possibilities of being combined with other strategies. This is critical since the development of novel exosome‐based therapeutic strategies will be constrained to the effectiveness and yield of the selected downstream purification methodologies for which a thorough understanding of the available technological resources is needed.     

基于电化学老化衰退模型的锂离子动力电池外特性

当前锂离子动力电池电化学模型存在模型复杂、建模难度大、计算效率低、老化评估效果差的问题,本文提出一种考虑电池衰退老化的机理模型(ADME).本文首先通过有限差分法对伪二维(P2D)电化学模型进行离散降阶处理,得到简化伪二维(SP2D)模型.在SP2D模型的基础上,基于阴阳两极发生的副反应导致的衰退老化现象,提出一种考虑电池衰退老化的机理模型.其次,使用多变量偏差补偿最小二乘法实现模型参数辨识.最后通过动力电池衰退老化性能循环实验,对比分析了恒流、脉冲工况下SP2D模型和ADME模型的终端电压输出.结果表明:ADME模型较为简单、计算效率和估算精度高,可以有效评估电池容量老化衰退,得到理想的锂离子动力电池外特性曲线.     

Editorial to the Special Issue: Adsorption,Absorption and Thermochemical Transport Processes in Complex Porous Structures

Transport in Porous Media - The theme of coupling problems for adsorption, absorption and thermochemical transport in porous media is very important for engineering applications. Based on the...