102,669 research outputs found

    Variations in radiocarbon ages of various organic fractions in core sediments from Erhai Lake, SW China

    Get PDF
    Radiocarbon dating was performed for the extracted organic fractions (cellulose-rich and humic acid fractions of plant fragment; fulvic acid, humic acid and humin fractions of humus substance) and shell from core sediments of the Erhai Lake, SW China. The C-14 dating results reveal that there are considerable differences, but there apparently is a humic acid less than or equal to humin < fulvic acid fraction sequence of C-14 age increase. The variability in radiocarbon ages of organic fraction of lake sediment suggests that special caution is necessary when radiocarbon ages of bulk sediments are used. The linear correlation between C-14 age of allochthonous terrestrial macrofossil (plant fragment and shell) and depth indicates roughly a constant sedimentation rate of ca. 0.7 rum yr(-1) in central Erhai Lake since 4500 yr BP. The C-14 ages of the autochthonous humic acid fraction are 210similar to4800 yr shift from "the true C-14 age" obtained by interpolating the corresponding horizontal level to the above C-14 age-depth correlation. Such age difference may be alternatively attributed to a uniform reservoir effect (most likely ca. 300 yr). The period with large C-14 age shift synchronizes with the period of changes in (delta(13)C and ARM intensity and ARM/susceptibility values

    Quantifying and Transferring Contextual Information in Object Detection

    Get PDF
    (c) 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other work

    On the Weak Computability of Continuous Real Functions

    Full text link
    In computable analysis, sequences of rational numbers which effectively converge to a real number x are used as the (rho-) names of x. A real number x is computable if it has a computable name, and a real function f is computable if there is a Turing machine M which computes f in the sense that, M accepts any rho-name of x as input and outputs a rho-name of f(x) for any x in the domain of f. By weakening the effectiveness requirement of the convergence and classifying the converging speeds of rational sequences, several interesting classes of real numbers of weak computability have been introduced in literature, e.g., in addition to the class of computable real numbers (EC), we have the classes of semi-computable (SC), weakly computable (WC), divergence bounded computable (DBC) and computably approximable real numbers (CA). In this paper, we are interested in the weak computability of continuous real functions and try to introduce an analogous classification of weakly computable real functions. We present definitions of these functions by Turing machines as well as by sequences of rational polygons and prove these two definitions are not equivalent. Furthermore, we explore the properties of these functions, and among others, show their closure properties under arithmetic operations and composition
    corecore