kalchoye copper-gold deposit is located about 110 kilometers east of esfahan province and within the eocene volcano sedimentary rocks. sandy tuff and andesite lava are important members of this complex.the form of mineralization in area is vein and veinlet and quartz as the main gangue phase. the main ore minerals are chalcopyrite, chalcocite, galena and weathered minerals such as goethite, iro...

We show that the computation of the Popov form of Ore polynomial matrices can be formulated as a problem of computing the left nullspace of such matrices. While this technique is already known for polynomial matrices, the extension to Ore polynomial matrices is not immediate because multiplication of the matrix entries is not commutative. A number of results for polynomial matrices are extended...

Modern microscopes of all kinds (optical, electron, scanning probe) are controlled by software and have digital image acquisition. This setup allows many integrated tasks to be run under the control of automation routines like, for instance, specimen scanning and automatic focusing. Additionally, some microscopes can be fully automated. Thus, it is possible to integrate specimen scanning, image...

When R is a local ring with a nilpotent maximal ideal, the Ore extension R[x;σ, δ] will or will not be 2-primal depending on the δ-stability of the maximal ideal of R. In the case where R[x;σ, δ] is 2-primal, it will satisfy an even stronger condition; in the case where R[x;σ, δ] is not 2-primal, it will fail to satisfy an even weaker condition. 1. Background and motivation In [13, Proposition ...

Bioleaching is technologically feasible for extraction of manganese from low grade ores (containing manganese less than 35% by weight). The principle involves the non-enzymatic reduction of pyrolusite [Mn(IV) oxides] to +2 oxidation state by fungi with the production of metabolites such as oxalic acid and citric acid. In the present investigation, a fungal strain, Penicillium citrinum was isola...

A weighted graph is a graph provided with an edge-weighting function w from the edge set to nonnegative real numbers. Bondy and Fan [Annals of Discrete Math. 41 (1989), 53– 69] began the study on the existence of heavy cycles in weighted graphs. Though several results with Dirac-type degree condition can be generalized to Ore-type one in unweighted graphs, it is shown in [Bondy et al., Discuss....

In 1960 Ore proved the following theorem: Let G be a graph of order n. If d(u)+d(v )≥n for every pair of nonadjacent vertices u and v , then G is hamiltonian. Since then for several other graph properties similar sufficient degree conditions have been obtained, so-called “Ore-type degree conditions”. In [R. J. Faudree, R. H. Schelp, A. Saito, and I. Schiermeyer, Discrete Math 307 (2007), 873–87...

Core Erlang is a new, o ial ore language for the on urrent fun tional language Erlang. Core Erlang is fun tional, stri t, dynami ally typed, pattern mat hing, higher order and on urrent. It has been developed in ooperation between the High-Performan e Erlang proje t at Uppsala University and the Erlang/Open Tele om Platform development team at Eri sson, and is a entral omponent in the new relea...

Mining companies world-wide are faced with the problem of how to accurately value and plan extraction projects subject to uncertainty in both future price and ore grade. Whilst the methodology of modelling price uncertainty is reasonably well understood, modelling ore-grade uncertainty is a much harder problem to formulate, and when attempts have been made the solutions take unfeasibly long tim...

We take an application of the Kernel Lemma by Kostochka and Yancey [10] to its logical conclusion. The consequence is a sort of magical way to draw conclusions about list coloring (and online list coloring) just from the existence of an independent set incident to many edges. We use this to prove an Ore-degree version of Brooks’ Theorem for online list-coloring. The Ore-degree of an edge xy in ...