Accumulation of heavy metals from agricultural soils contaminated by low levels heavy metals has important implications in the understanding of heavy metal contamination in the food chain. Through field experiments (1994-1996), the influence of thermal regime under different treatments on the accumulation of zinc, cadmium, copper, and lead in Chinese cabbage [Brassica pekinensis (Lour) Rupr. cv...

The recent advances in Computer Science and Technology have revolutionized the way graphical user interfaces are used towards Human Machine Interface (HMI). The graphical user interface is so powerful, that the knowledge of a process or system can be transferred to plant personnel accurately and effectively within a short period of time. The techniques of animation can enhance the illusion of d...

The recent advances in Computer Science and Technology have revolutionized the way graphical user interfaces are used towards Human Machine Interface (HMI). The graphical user interface is so powerful, that the knowledge of a process or system can be transferred to plant personnel accurately and effectively within a short period of time. The techniques of animation can enhance the illusion of d...

Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is wellknown. A general result is obtained for such graphs where no restriction is put on the number of ends. It is shown that such a graph can be built up from one-ended or finite pla...

Let W be a first-order structure and ρ be an Aut(W )-congruence on W . In this paper we define the almost-free finite covers of W with respect to ρ, and we show how to construct them. These are a generalization of free finite covers. A consequence of a result of [5] is that any finite cover of W with binding groups all equal to a simple non-abelian permutation group is almostfree with respect t...

Izmestiev and Joswig described how to obtain a simplicial covering space (the partial unfolding) of a given simplicial complex, thus obtaining a simplicial branched cover [Adv. Geom. 3(2):191-255, 2003]. We present a large class of branched covers which can be constructed via the partial unfolding. In particular, for d ≤ 4 every closed oriented PL d-manifold is the partial unfolding of some pol...

Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-dimensional matching problem asks whether there is a disjoint collection of the hyperedges which covers all vertices. We show it can be solved by a randomized polynomial space algorithm in time O(2). The O∗() notation hides factors polynomial in n and k. W...