Let $\mathbb N$ be the set of nonnegative integers and $\mathbb Z$ the ring of integers. Let $\mathcal B$ be the ring of $N \times N$ matrices over $\mathbb Z$ generated by the following two matrices: one obtained from the identity matrix by shifting the ones one position to the right and the other one position down. This ring plays an important role in the study of directly finite rings. Calculation of invertible and idempotent elements of $\mathcal B$ yields that the subrings generated by them coincide. This subring is the sum of the ideal $\mathcal F$ consisting of all matrices in $\mathcal B$ with only a finite number of nonzero entries and the subring of $\mathcal B$ generated by the identity matrix. Regular elements are also described. We characterize all ideals of $\mathcal B$, show that all ideals are finitely generated and that not all ideals of $\mathcal B$ are principal. Some general ring theoretic properties of $\mathcal B$ are also established.
The increasing availability of computing power in the past two decades has been used to develop new techniques for optimizing the solution of estimation problem. Today's computational capacity and the widespread availability of computers have enabled the development of a new generation of intelligent computing techniques, such as the algorithm of our interest. This paper presents a new member of the class of stochastic search algorithms (known as Canonical Genetic Algorithm "CGA") for optimizing the maximum likelihood function ln (L(θ, σa2 )) of the first order moving average MA(1) model. The presented strategy is composed of three main steps: recombination, mutation, and selection. The experimental design is based on simulating the CGA with different values of (θ), and sample size n. The results are compared with those of moment method. Based on MSE value obtained from both methods, one can conclude that CGA can give estimators (\hat \theta) for MA(1) parameter which are good and more reliable than those estimators obtained by moment method.
The Cantor-Bernstein theorem was extended to $\sigma $-complete boolean algebras by Sikorski and Tarski. Chang’s MV-algebras are a nontrivial generalization of boolean algebras: they stand to the infinite-valued calculus of Łukasiewicz as boolean algebras stand to the classical two-valued calculus. In this paper we further generalize the Cantor-Bernstein theorem to $\sigma $-complete MV-algebras, and compare it to a related result proved by Jakubík for certain complete MV-algebras.
Accurate survey methods are required for any wildlife research to yield reliable population data. This constraint finds significance in amphibian research that involves a highly threatened group of animals with a large proportion of cryptic species not easily detected by conventional survey methods. Across a growing spectrum of zoology research, survey outcomes are benefitting from the efficacy of scent detection dogs in assisting with species detection. We investigated the ability of a scent detection dog to locate and identify traces of giant bullfrog, Pyxicephalus adspersus scent and investigate methods of preserving frog scent for use in subsequent conditioning training of dogs. The scent detection dog was able to detect 100,000 times diluted scent with 87% sensitivity and 84% efficacy. High specificity (98,6%) was also achieved while presented with the challenge of detecting P. adspersus scent amid that of other frog species. Detection sensitivity was negatively correlated with scent preservation time but yielded the highest sensitivity for samples that were preserved as skin swabs stored at 4 °C and diluted shortly before use. Conservationists, scientists, and customs officials alike can benefit from scent detection dog detection of amphibians through enhanced sample acquisition rates with reduced collection biases.
Twenty eight species of winter-active Heleomyzidae were collected during a long-term study in Poland. More than 130 samples of insects, including Heleomyzidae, were collected from the surface of snow in lowland and mountain areas using a semi-quantitative method. Lowland and mountain assemblages of Heleomyzidae recorded on snow were quite different. Heleomyza modesta (Meigen, 1835) and Scoliocentra (Leriola) brachypterna (Loew, 1873) dominated in the mountains, Tephrochlamys rufiventris (Meigen, 1830) mainly in the lowlands and Heteromyza rotundicornis (Zetterstedt, 1846) was common in both habitats. Heleomyzidae were found on snow during the whole period of snow cover, but the catches peaked from late November to the beginning of February. In late winter and early spring the occurrence of heleomyzids on snow decreased. Most individuals were active on snow at air temperatures between -2 and +2.5°C. A checklist of 78 winter active European Heleomyzidae is presented. Helomyza nivalis Wahlgren, 1918 is herein considered as a new junior synonym of Helomyza caesia Meigen, 1830, syn. n., Agnieszka Soszyńska-Maj, Andrzej J. Woźnica., and Obsahuje bibliografii