A multiaxial elastic potential with error-minimizing approximation to rubberlike elasticity

This study is concerned with a new,explicit approach by means of which forms of the large strain elastic potential for multiaxial rubberlike elasticity may be obtained based on data for a single deformation mode.As a departure from usual studies,here for the first time errors may be estimated and rendered minimal for all possible deformation modes and,furthermore,failure behavior may be incorporated.Numerical examples presented are in accurate agreement with Treloar's well-known data.     

A generalized super AKNS hierarchy associated with orthosymplectic Lie superalgebra OSP(2,2) and its super bi-Hamiltonian structures

For the orthosymplectic Lie superalgebra $\text{◂⋅▸}OSP(2,2)$, we choose a set of basis matrices. A linear combination of those basis matrices presents a spatial spectral matrix. The compatible condition of the spatial part and the corresponding temporal parts of the spectral problem leads to a generalized super AKNS (GSAKNS) hierarchy. By making use of the supertrace identity, the obtained GSAKNS hierarchy can be written as the super bi-Hamiltonian structures.     

Molecular dynamics study of cluster structure and rotational wave properties in solid-state nanostructures

Molecular dynamics simulation was performed to study the formation of cluster structure, interfaces, and surfaces with different curvature radii in a perfect nanocrystal passed through by a nonlinear wave. It is shown that this process is a type of nanostructure self-organization in response to an external energy flux with subsequent development of a strong rotational field.     

Uniform local well-posedness and inviscid limit for the Benjamin-Ono-Burgers equation

In this paper, we study the Cauchy problem for the Benjamin-Ono-Burgers equation \({\partial _t}u - \epsilon \partial _x^2u + {\cal H}\partial _x^2u + u{u_x} = 0\), where \({\cal H}\) denotes the Hilbert transform operator. We obtain that it is uniformly locally well-posed for small data in the refined Sobolev space \({\tilde H^\sigma }(\mathbb{R})\,\,(\sigma \geqslant 0)\), which is a subspace of L²(ℝ). It is worth noting that the low-frequency part of \({\tilde H^\sigma }(\mathbb{R})\) is scaling critical, and thus the small data is necessary. The high-frequency part of \({\tilde H^\sigma }(\mathbb{R})\) is equal to the Sobolev space H^σ (ℝ) (σ ⩾ 0) and reduces to L²(ℝ). Furthermore, we also obtain its inviscid limit behavior in \({\tilde H^\sigma }(\mathbb{R})\) (σ ⩾ 0).

     

12β-Acetyloxyperforatin,a New Limonoid from Harrisonia Perforata

A new A, D-seco limonoid, named 12-acetyloxyperforatin (1), along with three known ones, were isolated from the leaves of Harrisonia perforata. Their structures were elucidated on the basis of spectroscopic analysis, including extensive NMR techniques and computational modelling. These compounds showed no inhibitory activity against the 11β-HSD1 enzyme.     

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.     

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}}...