In this study, 115 samples taken from the stream sediments were analyzed for concentrations of As, Co, Cr, Cu, Ni, Pb, W, Zn, Au, Ba, Fe, Mn, Sr, Ti, U, V and Zr. In order to outline mineralization-derived stream sediments, various mapping techniques including fuzzy factor score, geochemical halos and fractal model were used. Based on these models, concentrations of Co, Cr, Ni, Zn, Ba, Fe, Mn, ...

Let H be a subgraph of a graph G, and let V ⊆ X. We say that an H-design (V, C) of order u and index μ is embedded into a G-design (X,B) of order v and index λ, μ ≤ λ, if there is an injective mapping f : C → B such that B is a subgraph of f(B) for every B ∈ C. The mapping f is called the embedding of (V, C) into (X,B). For every pair of positive integers v, λ, we determine the minimum value of...

A mapping T from a topological space X to a topological space Y is said to be compact if T (X) is contained in a compact subset of Y. The aim of the paper is to prove the existence of fixed points of a nonexpansive compact self-mapping defined on a closed subset having a contractive jointly continuous family when the underlying space is a metric space. The proved result generalizes and extends ...

It has been observed experimentally that the mapping of global to detailed routing in conventional FPGA routing architecture (2D array) yields unpredictable results. In [8,10,13], a different class of FPGA structures called Greedy Routing Architectures (GRAs), where a locally optimal switch box routing can be extended to an optimal entire chip routing, were investigated. It was shown that GRAs ...

= zu2(i + k) for all i E I,. If I = Z we call w a Z-word or a bi-infinite word. If I is finite we call x finite and its length Ixl is defined as The usual notation for a finite word of length n is x = xi ... zn where all xi E {a, &}. We write {a, b}* for the collection of finite words and {a, b~+ for the nonempty finite words. (The empty word will be denoted throughout by e). The concatena...

UNLABELLED Motivation. The UMLS has been used in natural language processing applications such as information retrieval and information extraction systems. The mapping of free-text to UMLS concepts is important for these applications. To improve the mapping, we need a method to disambiguate terms that possess multiple UMLS concepts. In the general English domain, machine-learning techniques hav...

In this paper, we will provide some examples of Banach spaces that are Gâteaux differentiability spaces but not weak Asplund, weak Asplund but not in class(
̃), in class(
̃) but whose dual space is not weak∗ fragmentable. We begin with some definitions. A Banach space X is called a weak Asplund space [almost weak Asplund] (Gâteaux differentiability space) if each continuous convex function define...

Altered Patterns of Protein Synthesis in Infection by SV40 Mutants P. Tegtmeyer The Semiautonomous Replicon: A Molecular Model for the Oncogenicity of SV40 R. G. Martin, J. Y. Chou, J. Avila and R. Saral Transformation of Primate and Rodent Cells by Temperature-sensitive Mutants of SV40 J. S. Butel, J. S. Brugge and C. A. Noonan Properties of Temperature-sensitive Mutants of Polyoma Virus W. Ec...

is valid for any infinite word u with language closed under reversal and for any n. Therefore, the fact that a word u is rich in palindromes expresses that u is saturated by palindromes up to the highest possible level. Arnoux-Rauzy words (among them Sturmian words) and words coding interval exchange transformation with the symmetric permutation belong to the most prominent examples of rich wor...