Computational Analysis Reveals a Critical Point Mutation in the N-Terminal Region of the Signaling Lymphocytic Activation Molecule Responsible for the Cross-Species Infection with Canine Distemper Virus

Infection of hosts by morbilliviruses is facilitated by the interaction between viral hemagglutinin (H-protein) and the signaling lymphocytic activation molecule (SLAM). Recently, the functional importance of the n-terminal region of human SLAM as a measles virus receptor was demonstrated. However, the functional roles of this region in the infection process by other morbilliviruses and host range determination remain unknown, partly because this region is highly flexible, which has hampered accurate structure determination of this region by X-ray crystallography. In this study, we analyzed the interaction between the H-protein from canine distemper virus (CDV-H) and SLAMs by a computational chemistry approach. Molecular dynamics simulations and fragment molecular orbital analysis demonstrated that the unique His28 in the N-terminal region of SLAM from Macaca is a key determinant that enables the formation of a stable interaction with CDV-H, providing a basis for CDV infection in Macaca. The computational chemistry approach presented should enable the determination of molecular interactions involving regions of proteins that are difficult to predict from crystal structures because of their high flexibility.     

Probabilism,entropies and strictly proper scoring rules

Accuracy arguments are the en vogue route in epistemic justifications of probabilism and further norms governing rational belief. These arguments often depend on the fact that the employed inaccuracy measure is strictly proper. I argue controversially that it is ill-advised to assume that the employed inaccuracy measures are strictly proper and that strictly proper statistical scoring rules are a more natural class of measures of inaccuracy. Building on work in belief elicitation I show how strictly proper statistical scoring rules can be used to give an epistemic justification of probabilism.An agent's evidence does not play any role in these justifications of probabilism. Principles demanding the maximisation of a generalised entropy depend on the agent's evidence. In the second part of the paper I show how to simultaneously justify probabilism and such a principle. I also investigate scoring rules which have traditionally been linked with entropies.     

Sobolev Stability of Plane Wave Solutions to the Nonlinear Schrödinger Equation

This article explores the questions of long time orbital stability in high order Sobolev norms of plane wave solutions to the NLSE in the defocusing case.     

Semilinear wave models with friction and viscoelastic damping

In this paper, we study the global (in time) existence of small data solutions to the Cauchy problem for the semilinear wave equation with friction, viscoelastic damping, and a power nonlinearity. We are interested in the connection between regularity assumptions for the data and the admissible range of exponents p in the power nonlinearity.     

基于化学学科认知障碍突破的中考复习教学实践* ——以“二氧化碳的性质”为例

分析学生对二氧化碳的3个典型学科认知障碍,以“二氧化碳的捕捉”为情境,通过“尝试捕捉二氧化碳”“谁在捕捉二氧化碳”“捕捉背后的原理”等3个主要环节,实现对学科认知障碍的突破,展示了一种新的中考复习教学思路。     

Convergence of solutions for the fractional Cahn–Hilliard system

This paper deals with the Cauchy–Dirichlet problem for the fractional Cahn–Hilliard equation. The main results consist of global (in time) existence of weak solutions, characterization of parabolic smoothing effects (implying under proper condition eventual boundedness of trajectories), and convergence of each solution to a (single) equilibrium. In particular, to prove the convergence result, a variant of the so-called ?ojasiewicz–Simon inequality is provided for the fractional Dirichlet Laplacian and (possibly) non-analytic (but $C^1$) nonlinearities.     

Potts models with magnetic field: Arithmetic,geometry, and computation

We give a sheaf theoretic interpretation of Potts models with external magnetic field, in terms of constructible sheaves and their Euler characteristics. We show that the polynomial countability question for the hypersurfaces defined by the vanishing of the partition function is affected by changes in the magnetic field: elementary examples suffice to see non-polynomially countable cases that become polynomially countable after a perturbation of the magnetic field. The same recursive formula for the Grothendieck classes, under edge-doubling operations, holds as in the case without magnetic field, but the closed formulae for specific examples like banana graphs differ in the presence of magnetic field. We give examples of computation of the Euler characteristic with compact support, for the set of real zeros, and find a similar exponential growth with the size of the graph. This can be viewed as a measure of topological and algorithmic complexity. We also consider the computational complexity question for evaluations of the polynomial, and show both tractable and NP-hard examples, using dynamic programming.     

The effects of resource limitation and consensual incentives on cooperation

Exploring the evolution of cooperation has been one of the most challenging topics and attracted increasing attention in various realms. Hereby, we institute an analytic model where the relationship between the common benefits and contributions is the typical saturation nonlinearity. We investigate the evolutionary dynamics of cooperation with and without consensual incentives respectively. The population always evolves to full defection when the incentives are absent. Cooperation, however, can be promoted by consensual incentives when the degree of cooperators' preferences for incentives is great. There exists an intermediate amount of resources at which the positive effect of consensual incentives on cooperation is minimized. Furthermore, there is a U-shape relationship between the degree of cooperators' preference for an incentive and the evolution of cooperation. A greater basin of full cooperation can be induced when the cooperators' preference for reward is more pronounced than that for punishment.