It is over 120 years since Richard Bright first described the condition of nephritis, a symptom complex of oedema, haematuria, and proteinuria, following scarlatina. Since then various investigators have suggested that nephritis and the nephrotic syndrome may be immunologically determined. The possibility of 'hypersensitivity' as the pathogenic mechanism was suggested by Schick (1907) and the e...

For self-dual codes with all weights divisible by an integer greater than one, the minimum distance is bounded by the Mallows-Sloane upper bounds and by their improvements due to Krasikov-Litsyn and Rains. We obtain the improved upper bounds from short relations with constant coefficients on suitable binomial moments of the codes. In this approach, the Mallows-Sloane bounds are analogues of the...

In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.

this study was carried out to examine aflatoxin b1 (afb1) removal ability of four strains of lactic acidbacteria (lab). three indigenous (lactobacillus rhamnosus tmu094, lactobacillus fermentum tmu121and pedioccus pentosaceus tmu457) and a non-indigenous (labacillus rhamnosus ptcc1637) isolateswere studied. the strains were incubated with (afb1) at different time. the toxin residual in the supe...

An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and proved. Moreover, we obtain a polynomial time complexity bound which matches the currently best known iteration bound for infeasible interior-point ...

In this paper, we present a full Newton step feasible interior-pointmethod for circular cone optimization by using Euclidean Jordanalgebra. The search direction is based on the Nesterov-Todd scalingscheme, and only full-Newton step is used at each iteration.Furthermore, we derive the iteration bound that coincides with thecurrently best known iteration bound for small-update methods.

a famous theorem of schur states that for a group $g$ finiteness of $g/z(g)$‎ ‎implies the finiteness of $g'.$ the converse of schur's theorem is an interesting problem which has been considered by some‎ ‎authors‎. ‎recently‎, ‎podoski and szegedy proved the truth of the converse of schur's theorem for capable groups‎. ‎they also established an explicit bound for the index of the center of such...

Yukawa interactions of neutrinos with a new light scalar boson $\phi$ can lead to formation stable bound states and systems many ($\nu$-clusters). For allowed values the coupling $y$ mass $m_\phi$, state two would have size larger than $10^{12}$ cm. Bound sub-cm sizes are possible for keV scale sterile $y > 10^{-4}$. $\nu$-clusters we study in detail properties final configurations. If there is...