We study bivariate stochastic recurrence equations with triangular matrix coefficients and we characterize the tail behavior of their stationary solutions W=(W1,W2). Recently it has been observed that W1,W2 may exhibit regularly varying tails different indices, which is in contrast to well-known Kesten-type results. However, only partial results have derived. Under typical “Kesten–Goldie” “Grey...

the aim of this paper is to study the popular models used for the simulation of major elements of a water quality system. the present study compares results of the ce-qual-w2 model with the wasp5 and mike11 models to assess the water quality of pasikhan river. the contaminant loadings of nitrate and phosphate are utilized in the ce-qual-w2, wasp5 and mike11 simulations. this study is the first ...

Transportation cost metrics, also known as the Wasserstein distances Wp, are a natural choice for defining distances between two pointsets, or distributions, and have been applied in numerous fields. From the computational perspective, there has been an intensive research effort for understanding the Wp metrics over R, with work on the W1 metric (a.k.a earth mover distance) being most successfu...

Delsarte showed that for any projective linear code over a finite field GF (p) with two nonzero Hamming weights w1 < w2 there exist positive integers u and s such that w1 = p u and w2 = p (u + 1). Moreover, he showed that the additive group of such a code has a strongly regular Cayley graph. Here we show that for any proper, regular, projective linear code C over a finite Frobenius ring with tw...

A computational model of the construction of word meaning through exposure to texts is built in order to simulate the effects of co-occurrence values on word semantic similarities, paragraph by paragraph. Semantic similarity is here viewed as association. It turns out that the similarity between two words W1 and W2 strongly increases with a co-occurrence, decreases with the occurrence of W1 wit...

Example. Every non-zero element of ⋀ V is trivially totally decomposable. Example. If dimV = 3, then every non-zero element of ⋀ V is totally decomposable. Proof. Given a sum v1 ∧v2 +v3 ∧v4 of two non-zero elements of ⋀ V , the two-dimensional subspaces Span(v1, v2) and Span(v3, v4) must intersect. If w1 is in the intersection, then we can rewrite v1∧v2 = w1 ∧w2 for some w1 ∈ Span(v1, v2). Simi...