34 research outputs found

    A COMPREHENSIVE STUDY OF THE NEUTRON ACTIVATION ANALYSIS OF URANIUM BY DELAYED-NEUTRON COUNTING

    Full text link
    The method of neutron activation analysis of U by delayed-neutron counting was investigated in order to ascertain if the method would be suitable for routine application to such analyses. It was shown that the method can be used extensively and routinely for the determination of U. Emphasis was placed on the determination of U in the types of sample materials encountered in nuclear technology. Determinations of U were made on such materials as ores, granite, sea sediments, biological tissue, graphite, and metal alloys. The method is based upon the fact that delayed neutrons are emitted from fission products from the interaction of neutrons with U/sup 235/. Since the U/sup 235/ component of U undergoes most of the fissions when a sample is in a neutron flux, the method is predominately one for the determination of U/sup 235/. The total U in a sample or the isotopic composition of the U in a sample can be determined provided there is a prior knowledge of one of these quantities. The U/sup 235/ content of a test sample is obtained by comparing its delayed-neutron count to that obtained with a comparator sample containing a known quantity of U/sup 235/. (auth

    The Convex Geometry of Linear Inverse Problems

    Get PDF
    In applications throughout science and engineering one is often faced with the challenge of solving an ill-posed inverse problem, where the number of available measurements is smaller than the dimension of the model to be estimated. However in many practical situations of interest, models are constrained structurally so that they only have a few degrees of freedom relative to their ambient dimension. This paper provides a general framework to convert notions of simplicity into convex penalty functions, resulting in convex optimization solutions to linear, underdetermined inverse problems. The class of simple models considered are those formed as the sum of a few atoms from some (possibly infinite) elementary atomic set; examples include well-studied cases such as sparse vectors and low-rank matrices, as well as several others including sums of a few permutations matrices, low-rank tensors, orthogonal matrices, and atomic measures. The convex programming formulation is based on minimizing the norm induced by the convex hull of the atomic set; this norm is referred to as the atomic norm. The facial structure of the atomic norm ball carries a number of favorable properties that are useful for recovering simple models, and an analysis of the underlying convex geometry provides sharp estimates of the number of generic measurements required for exact and robust recovery of models from partial information. These estimates are based on computing the Gaussian widths of tangent cones to the atomic norm ball. When the atomic set has algebraic structure the resulting optimization problems can be solved or approximated via semidefinite programming. The quality of these approximations affects the number of measurements required for recovery. Thus this work extends the catalog of simple models that can be recovered from limited linear information via tractable convex programming

    FORENSIC APPLICATIONS OF TRACE ELEMENTS IN HAIR.

    No full text
    corecore