Estimation in binary longitudinal data by using generalized estimating equation (GEE) becomes complicated in the presence of missing data because standard GEEs are only valid under the restrictive missing completely at random assumption. Weighted GEE has therefore been proposed to allow the validity of GEE's under the weaker missing at random assumption. Multiple imputation offers an attractive...

With the discovery of some hidden-charm pentaquark resonances by LHCb Collaboration, investigations states containing heavy quarks have aroused interest theorists. We study herein $qqq\bar{q}Q$ ($q = u$ or $d$, $Q=c$ $b$) system, in framework chiral quark model. In consequence, charmed and bottomed pentaquarks are considered to exist five-body dynamical calculations. charm sector, $\Sigma_c\pi(...

We single out the polygonal paths of order that solve each of the 1 odd n  2 odd n       different longest non-cyclic Euclidean Hamiltonian path problems in      iπ e 1 , odd n n n ij n n K d     networks by an arithmetic algorithm. As by product, the procedure determines the winding index of cyclic Hamiltonian polygonals on the vertices of a regular polygon.

The aim of this paper is to introduce the concepts of τ1τ2-regular generalized star star closed sets , τ1τ2-regular generalized star star open sets and study their basic properties in bitopological spaces. Keywords—τ1τ2-regular closed sets; τ1τ2-regular open sets; τ1τ2-regular generalized closed sets; τ1τ2-regular generalized star closed sets; τ1τ2-regular generalized star star closed sets.

Let M m;n (respectively, H n) denote the space of m n complex matrices (respectively, n n Hermitian matrices). Let S H n be a closed convex set. We obtain necessary and suucient conditions for X 0 2 S to attain the maximum in the following concave maximization problem: maxf min (A + X) : X 2 Sg where A 2 H n is a xed matrix. Let denote the Hadamard (entrywise) product, i.e., given matrices A = ...

Let $G$ be a strongly connected digraph with vertex set $\{v_1, v_2, \dots, v_n\}$. Denote by $D_{ij}$ the distance between vertices $v_i$ and $v_j$ in $G$. Two variant versions of matrix were proposed Yan Yeh (Adv. Appl. Math.), Bapat et al. (Linear Algebra Appl.) independently, one is $q$-distance matrix, other exponential matrix. Given nonzero indeterminate $q$, $\mathscr{D}_G=(\mathscr{D}_{...

S s p s ij ij ijl ijl ij jl jl i M l j l D X D D f q β ∈ ≠ =   + − +       ∑ ∑ ∑ () () () () () () 1 1 () 1 2 4 3 2 4 3 s p s s p p iz iz iz iz ij iz zj iz ij iz zj iz ij iz zj s p S s s p p iz iz iz i z N l iz ij izl iz zj izl iz ij izl iz zj izl iz ij izl iz zj izl l w x w x w x w x w x w x T w x C w x C w x C w x C w x C w x C λ λ λ λ λ λ α () 2 1 0.5 s p s ij ij ijl ijl ij i M l j T...

The imposition of a cost constraint for constructing the optimal navigation structure surely represents a crucial ingredient in the design and development of any realistic navigation network. Previous works have focused on optimal transport in small-world networks built from two-dimensional lattices by adding long-range connections with Manhattan length r(ij) taken from the distribution P(ij)~r...