In this investigation we perform a systematic computational search for potential singularities in 3D Navier-Stokes flows based on the Ladyzhenskaya-Prodi-Serrin conditions. They assert that if quantity $\int_0^T \| \mathbf{u}(t) \|_{L^q(\Omega)}^p \, dt$, where $2/p+3/q \le 1$, $q > 3$, is bounded, then solution $\mathbf{u}(t)$ of system smooth interval $[0,T]$. other words, singularity should ...

A mathematical model for collision-induced breakage is considered. Existence of weak solutions to the continuous nonlinear equation shown a large class unbounded collision kernels and daughter distribution functions, assuming kernel $K$ be given by $K(x,y)= x^{\alpha} y^{\beta} + x^{\beta} y^{\alpha}$ with $\alpha \le \beta 1$. When \in [1,2]$, it that there exists at least one mass-conserving ...

data envelopment analysis (dea) is a method for measuring the relative efficiencies of a set of decision-making units (dmus) that use multiple inputs to produce multiple outputs. in this paper, we study the measurement of dmu performances in dea in situations where input and/or output values are given as imprecise data. by imprecise data we mean situations where we only know that the actual val...

This paper unifies the representations of different kinds of computer arithmetic. It is motivated by ideas developed in the book The End of Error by John Gustafson [5]. Here interval arithmetic just deals with connected sets of real numbers. These can be closed, open, half-open, bounded or unbounded. The first chapter gives a brief informal review of computer arithmetic from early floating-poin...

algebraic frames are generalizations of fourier transforms on locally compact abelian groups in the sense that the family of vectors forming the frame are replaced by a family of unbounded linear functionals. the paper studies the indexing measure space of the algebraic frames; as the investigation narrows down to the class of lower semiframes, more relations are revealed between the discret...

We study the maximum weighted independent-set problem on interval graphs with uncertainty on the vertex weights. We use the absolute robustness criterion and the min-max regret criterion to evaluate solutions. For a discrete scenario set, we find that the problem is NP-hard for each of the robustness criteria; we also provide pseudo-polynomial time algorithms when there is a constant number of ...

A k-path power is the k-power graph of a simple path of arbitrary length. Path powers form a non-trivial subclass of proper interval graphs. Their clique-width is not bounded by a constant, and no polynomial-time algorithm is known for computing their clique-width or linear clique-width. We show that k-path powers above a certain size have linear clique-width exactly k + 2, providing the first ...