We prove generalized Fefferman-Stein type theorems on sharp functions with Ap weights in spaces of homogeneous type with either finite or infinite underlying measure. We then apply these results to establish mixed-norm weighted Lp-estimates for elliptic and parabolic equations/systems with (partially) BMO coefficients in regular or irregular domains.

Randomness often plays an important role in the spatial and temporal dynamics of biological systems. General stochastic simulation methods may lead to excessive computational cost for a system in which a large number of molecules involved. Therefore, multi-scale hybrid simulation methods become important for stochastic simulations. Here we build a spatially hybrid method which couples two approaches: discrete stochastic simulation and continuous stochastic differential equations. In our method, the locations of the interfaces between the two approaches are changing according to the distribution of molecules in a one-dimensional domain. To balance the accuracy and efficiency, the time step of the numerical method for the continuous stochastic differential equations is adapted to the dynamics of the molecules near the adaptive interfaces. The simulation results for a linear system and two nonlinear biological systems in different one-dimensional domains demonstrate the effectiveness and advantage of our new hybrid method with the adaptive time step control.

No abstract uploaded!

Let A be an abelian category and B be the Happel-Reiten-Smalo tilt of A with respect to a torsion pair. We give necessary and sufficient conditions for the existence of a derived equivalence between A and B, which is compatible with the inclusion of B into the derived category of A. As applications, we obtain new derived equivalences related to splitting torsion pairs, TTF-triples and two-term silting subcategories, respectively. We prove that for the realization functor of any bounded t-structure, its denseness implies its fully-faithfulness.

Dijkstra and Bellman-ford are the two basic methods to solve Single-source shortest paths problem，and SPFA is the optimized version of Bellman-ford. However, since the algorithm time complexity is 0 (kn), SPFA’s time efficiency has some instabilities. This paper will compare the time efficiency between Dijkstra optimized with heap and three kinds of SPFA in different density graphs. Meanwhile, random data is created to test optimized Dijkstra and 3 types of SPFA. Finally, according to the calculation result of two methods’ time efficiency, some suggestion is given for their application under different situation.