In this paper, we present a Lattice Boltzmann scheme for diffusion on unstructured triangular grids. In this formulation there is no need for interpolation, as is required in other LB schemes on irregular grids. At the end of the propagation step, the lattice gas particles arrive exactly at neighbouring lattice sites, as is the case in LB schemes on Bravais lattices. The scheme is constructed u...

Intrusive subjective speech quality estimation of mean opinion score (MOS) often involves mapping a raw similarity extracted from differences between the clean and degraded utterance onto MOS with fitted function. More recent models such as support vector regression (SVR) or deep neural networks use multidimensional input, which allows for more accurate prediction than one-dimensional (1-D) map...

a connected graph g is said to be neighbourly irregular graph if no two adjacent vertices of g have same degree. in this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.

A method for embedding graphs in Euclidean space is suggested. The method connects nodes to their geographically closest neighbors and economizes on the total physical length of links. The topological and geometrical properties of scalefree networks embedded by the suggested algorithm are studied both analytically and through simulations. Our findings indicate dramatic changes in the embedded n...

Irregular neuronal activity is observed in a variety of brain regions and states. This work illustrates a novel mechanism by which irregular activity naturally emerges in two-cell neuronal networks featuring coupling by synaptic inhibition. We introduce a one-dimensional map that captures the irregular activity occurring in our simulations of conductance-based differential equations and mathema...

King [3] introduced and examined the concepts of almost A-summable sequence, almost conservative matrix and almost regular matrix. In this paper, we introduce and examine the concepts of λ-almost A-summable sequence, λalmost conservative matrix and λ-almost regular matrix. Also we introduce statistically (V, λ)-summable sequence.

In 1911, Steinhaus presented the following theorem: if A is a regular matrix then there exists a sequence of 0’s and 1’s which is not A-summable. In 1943, R. C. Buck characterized convergent sequences as follows: a sequence x is convergent if and only if there exists a regular matrix A which sums every subsequence of x. In this paper, definitions for “subsequences of a double sequence” and “Pri...

A robust algorithm is presented for labeling rows and columns in an irregular array. The algorithm is based on hierarchical pattern matching to a local lattice which is used as a template. Starting from the best local match, the pattern is expanded hierarchically to encompass the entire array. An application to labeling digitized images of an array of tissue sections mounted on a microscope sli...

Simple and practical finite-volume schemes for the lattice Boltzmann equation are derived in two and three dimensions through the application of modern finite-volume methods. The schemes use a finite-volume vortex-type formulation based on quadrilateral elements in two dimensions and trilinear hexahedral elements in three dimensions. It is shown that the schemes are applicable to domains with i...