Reanalysis of the photoassociation spectrum of 133Cs2 （6P3/2） lg state

Reanalysis of the photoassociation spectrum of the weakly binding （6S1/2 ＋ 6P3/2） lg 133Cs2 levels, reported in the previous study [J. Mol. Spectro. 255 （2009） 106], is performed by using a Lu-Fano graph coupled to the improved LeRoy- Bernstein formula including two additional modified terms. A more accurate coefficient （c3） is obtained for the leading long-range potential （-c3/R3） of a diatomic molecule.     

Visible Channeled Spectra of a Multilayer Wood Filter

The transmission factor of multilayer Wood filters containing quartz and rutile layers was simulated in order to avoid the experimental trials for obtaining optical filters with predicted transmission. The main refractive indices of uniaxial crystals—quartz and rutile—were interferometrically determined and Cauchy constants were obtained by simulation. The transmission factor of optical devices consisting of quartz and rutile layers was simulated using the Maple Program.     

Investigating the time dynamics of seismicity by using the visibility graph approach: Application to seismicity of Mexican subduction zone

By using the method of the visibility graph (VG), five magnitude time series extracted from the seismic catalog of the Mexican subduction zone were investigated. The five seismic sequences represent the seismicity which occurred between 2005 and 2012 in five seismic areas: Guerrero, Chiapas, Oaxaca, Jalisco and Michoacán. Among the five seismic sequences, the Jalisco sequence shows VG properties significantly different from those shown by the other four. Such a difference could be inherent in the different tectonic settings of Jalisco with respect to those characterizing the other four areas. The VG properties of the seismic sequences have been put in relationship with the more typical seismological characteristics (b$b$-value and a$a$-value of the Gutenberg–Richter law).     

Doubly stochastic graph matrices,II

If G is a graph on n vertices, its Laplacian matrix L(G) = D(G) - A(G) is the difference of the diagonal matrix of vertex degrees and the adjacency matrix. The main purpose of this note is to continue the study of the positive definite, doubly stochastic graph matrix (I_n + L(G))?¹= ω(G) = (w_ij). If, for example, w(G) = min w_ij, then w(G)≥0 with equality if and only if G is disconnected and w(G) ≤ l/(n + 1) with equality if and only if G = K_n. If i¦j, then w_ii ≥2wij, with equality if and only if the ith vertex has degree n - 1. In a sense made precise in the note, max w,, identifies most remote vertices of G. Relations between these new graph invariants and the algebraic connectivity emerge naturally from the fact that the second largest eigenvalue of ω(G) is 1/(1 + a(G)).     

Bifurcation analysis on a diffusive Holling–Tanner predator–prey model

This paper is concerned with a diffusive Holling–Tanner predator–prey model subject to homogeneous Neumann boundary condition. By choosing the ratio of intrinsic growth rates of predator to prey λ as the bifurcation parameter, we find that spatially homogeneous and non-homogeneous Hopf bifurcation occur at the positive constant steady state as λ varies. The steady state bifurcation of simple and double eigenvalues are intensively investigated. The techniques of space decomposition and the implicit function theorem are adopted to deal with the case of double eigenvalues. Our results show that this model can exhibit spatially non-homogeneous periodic and stationary patterns induced by the parameter λ. Numerical simulations are presented to illustrate our theoretical results.     

Intrinsic ordering,combinatorial numbers and reliability engineering

A new algorithm for evaluating the top event probability of large fault trees (FTs) is presented. This algorithm does not require any previous qualitative analysis of the FT. Indeed, its efficiency is independent of the FT logic, and it only depends on the number n of basic system components and on their failure probabilities. Our method provides exact lower and upper bounds on the top event probability by using new properties of the intrinsic order relation between binary strings. The intrinsic order enables one to select binary n  -tuples with large occurrence probabilities without necessity to evaluate them. This drastically reduces the complexity of the problem from exponential (2ⁿ$2^n$ binary n-tuples) to linear (n Boolean variables). Our algorithm is mainly based on a recursive formula for rapidly computing the sum of the occurrence probabilities of all binary n-tuples with weight m whose 1s are placed among the k right-most positions. This formula, as well as the balance between accuracy and computational cost, is closely related to the famous Pascal’s triangle.     

On bipartite graphs with small number of laplacian eigenvalues greater than two and three

All connected bipartite graphs with exactly two Laplacian eigenvalues greater than two are determined. Besides, all connected bipartite graphs with exactly one Laplacian eigenvalue greater than three are determined.