Effective length calibration method for processing the fluorescence signal detected by charge‐coupled device in capillary electrophoresis

A novel method named effective length calibration method has been developed to process the fluorescence signal detected by charge‐coupled device during capillary electrophoresis. The new method treated each pixel as an individual point detector, and effectively binned a large number of pixels into a final electropherogram without losing the narrow detection window defined by a single pixel. Capillary electrophoresis separations of DNA were carried out and detected by charge‐coupled device and conventional detector (photomultiplier tube). Detection properties including signal‐to‐noise ratio, peak width, detection frequency, and tilt of detector were investigated. It was found that the new method achieved much higher signal‐to‐noise ratio and smaller peak width than the conventional detector did. A Detection width of 0.5 μm was easily achieved.     

Rough path properties for local time of symmetric α stable process

In this paper, we first prove that the local time associated with symmetric $\alpha$-stable processes is of bounded $p$-variation for any $p>\frac{2}{\alpha ?1}$ partly based on Barlow’s estimation of the modulus of the local time of such processes.  The fact that the local time is of bounded $p$-variation for any $p>\frac{2}{\alpha ?1}$ enables us to define the integral of the local time ${\int }_{?\infty }^{\infty }{?}_{?}^{\alpha ?1}f\left(x\right)d_x{L}_t^x$ as a Young integral for less smooth functions being of bounded $q$-variation with $1\le q<\frac{2}{3?\alpha }$. When $q\ge \frac{2}{3?\alpha }$, Young’s integration theory is no longer applicable. However, rough path theory is useful in this case. The main purpose of this paper is to establish a rough path theory for the integration with respect to the local times of symmetric $\alpha$-stable processes for $\frac{2}{3?\alpha }\le q<4$.     

Leaf‐Critical and Leaf‐Stable Graphs

The minimum leaf number ml(G) of a connected graph G is defined as the minimum number of leaves of the spanning trees of G if G is not hamiltonian and 1 if G is hamiltonian. We study nonhamiltonian graphs with the property for each or for each . These graphs will be called ‐leaf‐critical and l‐leaf‐stable, respectively. It is far from obvious whether such graphs exist; for example, the existence of 3‐leaf‐critical graphs (that turn out to be the so‐called hypotraceable graphs) was an open problem until 1975. We show that l‐leaf‐stable and l‐leaf‐critical graphs exist for every integer , moreover for n sufficiently large, planar l‐leaf‐stable and l‐leaf‐critical graphs exist on n vertices. We also characterize 2‐fragments of leaf‐critical graphs generalizing a lemma of Thomassen. As an application of some of the leaf‐critical graphs constructed, we settle an open problem of Gargano et al. concerning spanning spiders. We also explore connections with a family of graphs introduced by Grünbaum in correspondence with the problem of finding graphs without concurrent longest paths.     

On the Auslander–Reiten conjecture for Cohen–Macaulay rings and path algebras

In this note, it is shown that the validity of the Auslander–Reiten conjecture for a given d-dimensional Cohen–Macaulay local ring R depends on its validity for all direct summands of d-th syzygy of R-modules of finite length, provided R is an isolated singularity. Based on this result, it is shown that under a mild assumption on the base ring R, satisfying the Auslander–Reiten conjecture behaves well under completion and reduction modulo regular elements. In addition, it will turn out that, if R is a commutative Noetherian ring and 𝒬 a finite acyclic quiver, then the Auslander–Reiten conjecture holds true for the path algebra R𝒬, whenever so does R. Using this result, examples of algebras satisfying the Auslander–Reiten conjecture are presented.     

Koszulity of some path categories

We prove Koszulity of certain linear path categories obtained from connected graphs with some infinite directed walk. These categories can be viewed as locally quadratic dual to preprojective algebras.     

The Gauss-Newton Methods via Conjugate Gradient Path without Line Search Technique for Solving Nonlinear Systems

In this article, we propose the Gauss-Newton methods via conjugate gradient path for solving nonlinear systems. By constructing and solving a linearized model of the nonlinear systems, we obtain the iterative direction by employing the conjugate gradient path. In successive iterations, the approximate Jacobian of the nonlinear systems is updated by a Broyden formula to construct the conjugate path. The global convergence and local superlinear convergence rate of the proposed algorithms are established under some reasonable conditions. Finally, the numerical results are reported to show the effectiveness of the proposed algorithms.     

Positions of characters in finite groups and the Taketa inequality

We define the position of an irreducible complex character of a finite group as an alternative to the degree. We then use this to define three classes of groups: position reducible (PR)-groups, inductively position reducible (IPR)-groups and weak IPR-groups. We show that IPR-groups and weak IPR-groups are solvable and satisfy the Taketa inequality (ie, that the derived length of the group is at most the number of degrees of irreducible complex characters of the group), and we show that any M-group is a weak IPR-group. We also show that even though PR-groups need not be solvable, they cannot be perfect.     

ISSUE INFORMATION

Modeling social‐ecological systems is difficult due to the complexity of ecosystems and of individual and collective human behavior. Key components of the social‐ecological system are often over‐simplified or omitted. Generalized modeling is a dynamical systems approach that can overcome some of these challenges. It can rigorously analyze qualitative system dynamics such as regime shifts despite incomplete knowledge of the model's constituent processes. Here, we review generalized modeling and use a recent study on the Baltic Sea cod fishery's boom and collapse to demonstrate its application to modeling the dynamics of empirical social‐ecological systems. These empirical applications demand new methods of analysis suited to larger, more complicated generalized models. Generalized modeling is a promising tool for rapidly developing mathematically rigorous, process‐based understanding of a social‐ecological system's dynamics despite limited knowledge of the system.     

考虑损伤的修正梯度弹性理论

梯度弹性理论在描述材料微结构起主导作用的力学行为时具有显著优势,将其与损伤理论相结合,可在材料破坏研究中考虑微结构的影响.基于修正梯度弹性理论,将应变张量、应变梯度张量和损伤变量作为Helmholtz自由能函数的状态变量,并在自然状态附近对自由能函数作Taylor展开,进而由热力学基本定律,推导出修正梯度弹性损伤理论本构方程的一般形式.编制有限元程序,模拟土样损伤局部化带的发展演化过程.结果表明,修正梯度弹性损伤理论消除了网格依赖性;损伤局部化带不是与损伤同时发生,而是在损伤发展到一定程度后再逐渐显现出来.