The co-prime array, which utilizes a co-prime pair of uniform linear sub-arrays, provides a systematical means for sparse array construction. By choosing two co-prime integers M and N , O(MN) co-array elements can be formed from only O(M +N) physical sensors. As such, a higher number of degrees-of-freedom (DOFs) is achieved, enabling direction-of-arrival (DOA) estimation of more targets than th...

A module M is called epi-retractable if every submodule of M is a homomorphic image of M. Dually, a module M is called co-epi-retractable if it contains a copy of each of its factor modules. In special case, a ring R is called co-pli (resp. co-pri) if RR (resp. RR) is co-epi-retractable. It is proved that if R is a left principal right duo ring, then every left ideal of R is an epi-retractable ...

Co-prime sampling and co-prime arrays have recently been shown to improve active and passive sensing in radar and underwater acoustics using both narrowband and wideband signal platforms. Co-prime processing provides a systematical framework for sparse sampling and array configuration with increased aperture and improved spatial resolution. Co-prime based approaches to sampling and arrays can c...

We study the polyhedra of splittable and unsplittable single arc–set relaxations of multicommodity flow capacitated network design problems. We investigate the optimization problems over these sets and the separation and lifting problems of valid inequalities for them. In particular, we give a linear–time separation algorithm for the residual capacity inequalities [19] and show that the separat...

In this paper, we introduce a modified CQ iterative scheme for finding a common element of the set of solutions of an equilibrium problem, the set of fixed points of an infinite family of nonexpansive mappings and the set of the variational inequality for an α-inverse strongly monotone mapping in a Hilbert space. We obtain a strong convergence theorem for three sequences generated by this proce...

Abstract. In this paper, connected domination in fuzzy graphs using strong arcs is introduced. The strong connected domination number of different classes of fuzzy graphs is obtained. An upper bound for the strong connected domination number of fuzzy graphs is obtained. Strong connected domination in fuzzy trees is studied. It is established that the set of fuzzy cut nodes of a fuzzy tree is a ...

In this paper we present a proof of a mathematical version of the strong cosmic censor conjecture attributed to Geroch–Horowitz and Penrose but formulated explicitly by Wald. The proof is based on the existence of future-inextendible causal curves in causal pasts of events on the future Cauchy horizon in a non-globally hyperbolic space-time. By examining explicit non-globally hyperbolic space-t...

Martin-Löf (ML)-reducibility compares K-trivial sets by examining the Martin-Löf random sequences that compute them. We show that every K-trivial set is computable from a c.e. set of the same ML-degree. We investigate the interplay between ML-reducibility and cost functions, which are used to both measure the number of changes in a computable approximation, and the type of null sets used to cap...

The influence of plasma elongation and Shafranov shift on the stability of electrostatic ion-temperature-gradient driven modes (ηi-modes) is investigated. An advanced fluid model is used for the ions together with Boltzmann distributed electrons. The derived eigenvalue equation is solved both analytically, in the strong ballooning limit, and numerically. It is found that the effects of elongati...