WorldWideScience

Sample records for sparse lu factorisation

  1. Using sparse LU factorisation to precondition GMRES for a family of similarly structured matrices arising from process modelling

    Energy Technology Data Exchange (ETDEWEB)

    Brooking, C. [Univ. of Bath (United Kingdom)

    1996-12-31

    Process engineering software is used to simulate the operation of large chemical plants. Such simulations are used for a variety of tasks, including operator training. For the software to be of practical use for this, dynamic simulations need to run in real-time. The models that the simulation is based upon are written in terms of Differential Algebraic Equations (DAE`s). In the numerical time-integration of systems of DAE`s using an implicit method such as backward Euler, the solution of nonlinear systems is required at each integration point. When solved using Newton`s method, this leads to the repeated solution of nonsymmetric sparse linear systems. These systems range in size from 500 to 20,000 variables. A typical integration may require around 3000 timesteps, and if 4 Newton iterates were needed on each time step, then this means approximately 12,000 linear systems must be solved. The matrices produced by the simulations have a similar sparsity pattern throughout the integration. They are also severely ill-conditioned, and have widely-scattered spectra.

  2. SuperLU{_}DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems

    Energy Technology Data Exchange (ETDEWEB)

    Li, Xiaoye S.; Demmel, James W.

    2002-03-27

    In this paper, we present the main algorithmic features in the software package SuperLU{_}DIST, a distributed-memory sparse direct solver for large sets of linear equations. We give in detail our parallelization strategies, with focus on scalability issues, and demonstrate the parallel performance and scalability on current machines. The solver is based on sparse Gaussian elimination, with an innovative static pivoting strategy proposed earlier by the authors. The main advantage of static pivoting over classical partial pivoting is that it permits a priori determination of data structures and communication pattern for sparse Gaussian elimination, which makes it more scalable on distributed memory machines. Based on this a priori knowledge, we designed highly parallel and scalable algorithms for both LU decomposition and triangular solve and we show that they are suitable for large-scale distributed memory machines.

  3. Sparse Localization with a Mobile Beacon Based on LU Decomposition in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Chunhui Zhao

    2015-09-01

    Full Text Available Node localization is the core in wireless sensor network. It can be solved by powerful beacons, which are equipped with global positioning system devices to know their location information. In this article, we present a novel sparse localization approach with a mobile beacon based on LU decomposition. Our scheme firstly translates node localization problem into a 1-sparse vector recovery problem by establishing sparse localization model. Then, LU decomposition pre-processing is adopted to solve the problem that measurement matrix does not meet the re¬stricted isometry property. Later, the 1-sparse vector can be exactly recovered by compressive sensing. Finally, as the 1-sparse vector is approximate sparse, weighted Cen¬troid scheme is introduced to accurately locate the node. Simulation and analysis show that our scheme has better localization performance and lower requirement for the mobile beacon than MAP+GC, MAP-M, and MAP-MN schemes. In addition, the obstacles and DOI have little effect on the novel scheme, and it has great localization performance under low SNR, thus, the scheme proposed is robust.

  4. A new scheduling algorithm for parallel sparse LU factorization with static pivoting

    Energy Technology Data Exchange (ETDEWEB)

    Grigori, Laura; Li, Xiaoye S.

    2002-08-20

    In this paper we present a static scheduling algorithm for parallel sparse LU factorization with static pivoting. The algorithm is divided into mapping and scheduling phases, using the symmetric pruned graphs of L' and U to represent dependencies. The scheduling algorithm is designed for driving the parallel execution of the factorization on a distributed-memory architecture. Experimental results and comparisons with SuperLU{_}DIST are reported after applying this algorithm on real world application matrices on an IBM SP RS/6000 distributed memory machine.

  5. Link prediction via generalized coupled tensor factorisation

    DEFF Research Database (Denmark)

    Ermiş, Beyza; Evrim, Acar Ataman; Taylan Cemgil, A.

    2012-01-01

    and higher-order tensors. We propose to use an approach based on probabilistic interpretation of tensor factorisation models, i.e., Generalised Coupled Tensor Factorisation, which can simultaneously fit a large class of tensor models to higher-order tensors/matrices with com- mon latent factors using...... different loss functions. Numerical experiments demonstrate that joint analysis of data from multiple sources via coupled factorisation improves the link prediction performance and the selection of right loss function and tensor model is crucial for accurately predicting missing links....

  6. Fast Bayesian Non-Negative Matrix Factorisation and Tri-Factorisation

    DEFF Research Database (Denmark)

    Brouwer, Thomas; Frellsen, Jes; Liò, Pietro

    We present a fast variational Bayesian algorithm for performing non-negative matrix factorisation and tri-factorisation. We show that our approach achieves faster convergence per iteration and timestep (wall-clock) than Gibbs sampling and non-probabilistic approaches, and do not require additional...... samples to estimate the posterior. We show that in particular for matrix tri-factorisation convergence is difficult, but our variational Bayesian approach offers a fast solution, allowing the tri-factorisation approach to be used more effectively....

  7. Comparative Study of Inference Methods for Bayesian Nonnegative Matrix Factorisation

    DEFF Research Database (Denmark)

    Brouwer, Thomas; Frellsen, Jes; Liò, Pietro

    2017-01-01

    In this paper, we study the trade-offs of different inference approaches for Bayesian matrix factorisation methods, which are commonly used for predicting missing values, and for finding patterns in the data. In particular, we consider Bayesian nonnegative variants of matrix factorisation and tri......-factorisation, and compare non-probabilistic inference, Gibbs sampling, variational Bayesian inference, and a maximum-a-posteriori approach. The variational approach is new for the Bayesian nonnegative models. We compare their convergence, and robustness to noise and sparsity of the data, on both synthetic and real...

  8. Matrix factorisations for rational boundary conditions by defect fusion

    International Nuclear Information System (INIS)

    Behr, Nicolas; Fredenhagen, Stefan

    2015-01-01

    A large class of two-dimensional N=(2,2) superconformal field theories can be understood as IR fixed-points of Landau-Ginzburg models. In particular, there are rational conformal field theories that also have a Landau-Ginzburg description. To understand better the relation between the structures in the rational conformal field theory and in the Landau-Ginzburg theory, we investigate how rational B-type boundary conditions are realised as matrix factorisations in the SU(3)/U(2) Grassmannian Kazama-Suzuki model. As a tool to generate the matrix factorisations we make use of a particular interface between the Kazama-Suzuki model and products of minimal models, whose fusion can be realised as a simple functor on ring modules. This allows us to formulate a proposal for all matrix factorisations corresponding to rational boundary conditions in the SU(3)/U(2) model.

  9. Matrix factorisations for rational boundary conditions by defect fusion

    Energy Technology Data Exchange (ETDEWEB)

    Behr, Nicolas [Department of Mathematics, Heriot-Watt University,Riccarton, Edinburgh, EH14 4AS (United Kingdom); Maxwell Institute for Mathematical Sciences,Edinburgh (United Kingdom); Fredenhagen, Stefan [Max-Planck-Institut für Gravitationsphysik, Albert-Einstein-Institut,D-14424 Golm (Germany)

    2015-05-11

    A large class of two-dimensional N=(2,2) superconformal field theories can be understood as IR fixed-points of Landau-Ginzburg models. In particular, there are rational conformal field theories that also have a Landau-Ginzburg description. To understand better the relation between the structures in the rational conformal field theory and in the Landau-Ginzburg theory, we investigate how rational B-type boundary conditions are realised as matrix factorisations in the SU(3)/U(2) Grassmannian Kazama-Suzuki model. As a tool to generate the matrix factorisations we make use of a particular interface between the Kazama-Suzuki model and products of minimal models, whose fusion can be realised as a simple functor on ring modules. This allows us to formulate a proposal for all matrix factorisations corresponding to rational boundary conditions in the SU(3)/U(2) model.

  10. A New Factorisation of a General Second Order Differential Equation

    Science.gov (United States)

    Clegg, Janet

    2006-01-01

    A factorisation of a general second order ordinary differential equation is introduced from which the full solution to the equation can be obtained by performing two integrations. The method is compared with traditional methods for solving these type of equations. It is shown how the Green's function can be derived directly from the factorisation…

  11. Extended nonnegative tensor factorisation models for musical sound source separation.

    Science.gov (United States)

    FitzGerald, Derry; Cranitch, Matt; Coyle, Eugene

    2008-01-01

    Recently, shift-invariant tensor factorisation algorithms have been proposed for the purposes of sound source separation of pitched musical instruments. However, in practice, existing algorithms require the use of log-frequency spectrograms to allow shift invariance in frequency which causes problems when attempting to resynthesise the separated sources. Further, it is difficult to impose harmonicity constraints on the recovered basis functions. This paper proposes a new additive synthesis-based approach which allows the use of linear-frequency spectrograms as well as imposing strict harmonic constraints, resulting in an improved model. Further, these additional constraints allow the addition of a source filter model to the factorisation framework, and an extended model which is capable of separating mixtures of pitched and percussive instruments simultaneously.

  12. Extended Nonnegative Tensor Factorisation Models for Musical Sound Source Separation

    Directory of Open Access Journals (Sweden)

    Derry FitzGerald

    2008-01-01

    Full Text Available Recently, shift-invariant tensor factorisation algorithms have been proposed for the purposes of sound source separation of pitched musical instruments. However, in practice, existing algorithms require the use of log-frequency spectrograms to allow shift invariance in frequency which causes problems when attempting to resynthesise the separated sources. Further, it is difficult to impose harmonicity constraints on the recovered basis functions. This paper proposes a new additive synthesis-based approach which allows the use of linear-frequency spectrograms as well as imposing strict harmonic constraints, resulting in an improved model. Further, these additional constraints allow the addition of a source filter model to the factorisation framework, and an extended model which is capable of separating mixtures of pitched and percussive instruments simultaneously.

  13. Combined incomplete LU and strongly implicit procedure preconditioning

    Energy Technology Data Exchange (ETDEWEB)

    Meese, E.A. [Univ. of Trondheim (Norway)

    1996-12-31

    For the solution of large sparse linear systems of equations, the Krylov-subspace methods have gained great merit. Their efficiency are, however, largely dependent upon preconditioning of the equation-system. A family of matrix factorisations often used for preconditioning, is obtained from a truncated Gaussian elimination, ILU(p). Less common, supposedly due to it`s restriction to certain sparsity patterns, is factorisations generated by the strongly implicit procedure (SIP). The ideas from ILU(p) and SIP are used in this paper to construct a generalized strongly implicit procedure, applicable to matrices with any sparsity pattern. The new algorithm has been run on some test equations, and efficiency improvements over ILU(p) was found.

  14. Transverse momentum in double parton scattering. Factorisation, evolution and matching

    International Nuclear Information System (INIS)

    Buffing, Maarten G.A.; Diehl, Markus; Kasemets, Tomas

    2017-08-01

    We give a description of double parton scattering with measured transverse momenta in the final state, extending the formalism for factorisation and resummation developed by Collins, Soper and Sterman for the production of colourless particles. After a detailed analysis of their colour structure, we derive and solve evolution equations in rapidity and renormalisation scale for the relevant soft factors and double parton distributions. We show how in the perturbative regime, transverse momentum dependent double parton distributions can be expressed in terms of simpler nonperturbative quantities and compute several of the corresponding perturbative kernels at one-loop accuracy. We then show how the coherent sum of single and double parton scattering can be simplified for perturbatively large transverse momenta, and we discuss to which order resummation can be performed with presently available results. As an auxiliary result, we derive a simple form for the square root factor in the Collins construction of transverse momentum dependent parton distributions.

  15. Transverse momentum in double parton scattering. Factorisation, evolution and matching

    Energy Technology Data Exchange (ETDEWEB)

    Buffing, Maarten G.A.; Diehl, Markus [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Kasemets, Tomas [Nikhef, Amsterdam (Netherlands). Theory Group; VU Univ. Amsterdam (Netherlands)

    2017-08-15

    We give a description of double parton scattering with measured transverse momenta in the final state, extending the formalism for factorisation and resummation developed by Collins, Soper and Sterman for the production of colourless particles. After a detailed analysis of their colour structure, we derive and solve evolution equations in rapidity and renormalisation scale for the relevant soft factors and double parton distributions. We show how in the perturbative regime, transverse momentum dependent double parton distributions can be expressed in terms of simpler nonperturbative quantities and compute several of the corresponding perturbative kernels at one-loop accuracy. We then show how the coherent sum of single and double parton scattering can be simplified for perturbatively large transverse momenta, and we discuss to which order resummation can be performed with presently available results. As an auxiliary result, we derive a simple form for the square root factor in the Collins construction of transverse momentum dependent parton distributions.

  16. Massless spectra and gauge couplings at one-loop on non-factorisable toroidal orientifolds

    Science.gov (United States)

    Berasaluce-González, Mikel; Honecker, Gabriele; Seifert, Alexander

    2018-01-01

    So-called 'non-factorisable' toroidal orbifolds can be rewritten in a factorised form as a product of three two-tori by imposing an additional shift symmetry. This finding of Blaszczyk et al. [1] provides a new avenue to Conformal Field Theory methods, by which the vector-like massless matter spectrum - and thereby the type of gauge group enhancement on orientifold invariant fractional D6-branes - and the one-loop corrections to the gauge couplings in Type IIA orientifold theories can be computed in addition to the well-established chiral matter spectrum derived from topological intersection numbers among three-cycles. We demonstrate this framework for the Z4 × ΩR orientifolds on the A3 ×A1 ×B2-type torus. As observed before for factorisable backgrounds, also here the one-loop correction can drive the gauge groups to stronger coupling as demonstrated by means of a four-generation Pati-Salam example.

  17. Memories of Lu Jingqing

    Institute of Scientific and Technical Information of China (English)

    1994-01-01

    Lu Jingqing was a woman of letters who wrote poems when she was young and also worked as an editor and teacher. Her main works are Women poets of the Tang Dynasty (1931), Whisper (a collection of poems, 1932), Plain Writing (a collection of verses, 1930) and The Wandering (1933). In March 1993, 86-year-old Lu Jingqing, Professor of the Shanghai College of Finance and Economics, died in Shanghai. Zhu Bokang, an old friend of Lu and her husband wrote the following article in her memory.

  18. Fast wavelet based sparse approximate inverse preconditioner

    Energy Technology Data Exchange (ETDEWEB)

    Wan, W.L. [Univ. of California, Los Angeles, CA (United States)

    1996-12-31

    Incomplete LU factorization is a robust preconditioner for both general and PDE problems but unfortunately not easy to parallelize. Recent study of Huckle and Grote and Chow and Saad showed that sparse approximate inverse could be a potential alternative while readily parallelizable. However, for special class of matrix A that comes from elliptic PDE problems, their preconditioners are not optimal in the sense that independent of mesh size. A reason may be that no good sparse approximate inverse exists for the dense inverse matrix. Our observation is that for this kind of matrices, its inverse entries typically have piecewise smooth changes. We can take advantage of this fact and use wavelet compression techniques to construct a better sparse approximate inverse preconditioner. We shall show numerically that our approach is effective for this kind of matrices.

  19. SLAP, Large Sparse Linear System Solution Package

    International Nuclear Information System (INIS)

    Greenbaum, A.

    1987-01-01

    1 - Description of program or function: SLAP is a set of routines for solving large sparse systems of linear equations. One need not store the entire matrix - only the nonzero elements and their row and column numbers. Any nonzero structure is acceptable, so the linear system solver need not be modified when the structure of the matrix changes. Auxiliary storage space is acquired and released within the routines themselves by use of the LRLTRAN POINTER statement. 2 - Method of solution: SLAP contains one direct solver, a band matrix factorization and solution routine, BAND, and several interactive solvers. The iterative routines are as follows: JACOBI, Jacobi iteration; GS, Gauss-Seidel Iteration; ILUIR, incomplete LU decomposition with iterative refinement; DSCG and ICCG, diagonal scaling and incomplete Cholesky decomposition with conjugate gradient iteration (for symmetric positive definite matrices only); DSCGN and ILUGGN, diagonal scaling and incomplete LU decomposition with conjugate gradient interaction on the normal equations; DSBCG and ILUBCG, diagonal scaling and incomplete LU decomposition with bi-conjugate gradient iteration; and DSOMN and ILUOMN, diagonal scaling and incomplete LU decomposition with ORTHOMIN iteration

  20. Faster tissue interface analysis from Raman microscopy images using compressed factorisation

    Science.gov (United States)

    Palmer, Andrew D.; Bannerman, Alistair; Grover, Liam; Styles, Iain B.

    2013-06-01

    The structure of an artificial ligament was examined using Raman microscopy in combination with novel data analysis. Basis approximation and compressed principal component analysis are shown to provide efficient compression of confocal Raman microscopy images, alongside powerful methods for unsupervised analysis. This scheme allows the acceleration of data mining, such as principal component analysis, as they can be performed on the compressed data representation, providing a decrease in the factorisation time of a single image from five minutes to under a second. Using this workflow the interface region between a chemically engineered ligament construct and a bone-mimic anchor was examined. Natural ligament contains a striated interface between the bone and tissue that provides improved mechanical load tolerance, a similar interface was found in the ligament construct.

  1. Non-abelian factorisation for next-to-leading-power threshold logarithms

    International Nuclear Information System (INIS)

    Bonocore, D.; Laenen, E.; Magnea, L.; Vernazza, L.; White, C.D.

    2016-01-01

    Soft and collinear radiation is responsible for large corrections to many hadronic cross sections, near thresholds for the production of heavy final states. There is much interest in extending our understanding of this radiation to next-to-leading power (NLP) in the threshold expansion. In this paper, we generalise a previously proposed all-order NLP factorisation formula to include non-abelian corrections. We define a non-abelian radiative jet function, organising collinear enhancements at NLP, and compute it for quark jets at one loop. We discuss in detail the issue of double counting between soft and collinear regions. Finally, we verify our prescription by reproducing all NLP logarithms in Drell-Yan production up to NNLO, including those associated with double real emission. Our results constitute an important step in the development of a fully general resummation formalism for NLP threshold effects.

  2. Non-abelian factorisation for next-to-leading-power threshold logarithms

    Energy Technology Data Exchange (ETDEWEB)

    Bonocore, D. [Nikhef, Science Park 105, NL-1098 XG Amsterdam (Netherlands); Institute for Theoretical Particle Physics and Cosmology, RWTH Aachen University, Sommerfeldstr. 16, 52074 Aachen (Germany); Laenen, E. [Nikhef, Science Park 105, NL-1098 XG Amsterdam (Netherlands); ITFA, University of Amsterdam, Science Park 904, Amsterdam (Netherlands); ITF, Utrecht University, Leuvenlaan 4, Utrecht (Netherlands); Kavli Institute for Theoretical Physics, University of California, Santa Barbara, CA 93106-4030 (United States); Magnea, L. [Dipartimento di Fisica, Università di Torino and INFN, Sezione di Torino, Via P. Giuria 1, I-10125 Torino (Italy); Vernazza, L. [Higgs Centre for Theoretical Physics, School of Physics and Astronomy, The University of Edinburgh, Edinburgh EH9 3JZ, Scotland (United Kingdom); White, C.D. [Centre for Research in String Theory, School of Physics and Astronomy, Queen Mary University of London, 327 Mile End Road, London E1 4NS (United Kingdom)

    2016-12-22

    Soft and collinear radiation is responsible for large corrections to many hadronic cross sections, near thresholds for the production of heavy final states. There is much interest in extending our understanding of this radiation to next-to-leading power (NLP) in the threshold expansion. In this paper, we generalise a previously proposed all-order NLP factorisation formula to include non-abelian corrections. We define a non-abelian radiative jet function, organising collinear enhancements at NLP, and compute it for quark jets at one loop. We discuss in detail the issue of double counting between soft and collinear regions. Finally, we verify our prescription by reproducing all NLP logarithms in Drell-Yan production up to NNLO, including those associated with double real emission. Our results constitute an important step in the development of a fully general resummation formalism for NLP threshold effects.

  3. Sparse structure regularized ranking

    KAUST Repository

    Wang, Jim Jing-Yan; Sun, Yijun; Gao, Xin

    2014-01-01

    Learning ranking scores is critical for the multimedia database retrieval problem. In this paper, we propose a novel ranking score learning algorithm by exploring the sparse structure and using it to regularize ranking scores. To explore the sparse

  4. On some aspects of optimisation of factorisation scheme dependence at the next-to-leading order in QCD

    International Nuclear Information System (INIS)

    Chyla, J.

    1989-01-01

    Several recent papers attempting to apply the optimised QCD perturbation theory to reactions involving real or virtual photons are discussed with particular attention paid to the ambiguity appearing in the definition of parton distribution and fragmentation functions at the next-to-leading order (NLO). The necessity to use NLO parametrisations of quark densities is stressed and the problem with respect to the factorisation mass M for the 'physical' definition of parton densities is pointed out. (orig.)

  5. Evaluation of SuperLU on multicore architectures

    International Nuclear Information System (INIS)

    Li, X S

    2008-01-01

    The Chip Multiprocessor (CMP) will be the basic building block for computer systems ranging from laptops to supercomputers. New software developments at all levels are needed to fully utilize these systems. In this work, we evaluate performance of different high-performance sparse LU factorization and triangular solution algorithms on several representative multicore machines. We included both Pthreads and MPI implementations in this study and found that the Pthreads implementation consistently delivers good performance and that a left-looking algorithm is usually superior

  6. Structural Sparse Tracking

    KAUST Repository

    Zhang, Tianzhu

    2015-06-01

    Sparse representation has been applied to visual tracking by finding the best target candidate with minimal reconstruction error by use of target templates. However, most sparse representation based trackers only consider holistic or local representations and do not make full use of the intrinsic structure among and inside target candidates, thereby making the representation less effective when similar objects appear or under occlusion. In this paper, we propose a novel Structural Sparse Tracking (SST) algorithm, which not only exploits the intrinsic relationship among target candidates and their local patches to learn their sparse representations jointly, but also preserves the spatial layout structure among the local patches inside each target candidate. We show that our SST algorithm accommodates most existing sparse trackers with the respective merits. Both qualitative and quantitative evaluations on challenging benchmark image sequences demonstrate that the proposed SST algorithm performs favorably against several state-of-the-art methods.

  7. Tests of QCD factorisation in the diffractive production of dijets in deep-inelastic scattering and photoproduction at HERA

    Science.gov (United States)

    Aktas, A.; Andreev, V.; Anthonis, T.; Antunovic, B.; Aplin, S.; Asmone, A.; Astvatsatourov, A.; Babaev, A.; Backovic, S.; Baghdasaryan, A.; Baranov, P.; Barrelet, E.; Bartel, W.; Baudrand, S.; Beckingham, M.; Begzsuren, K.; Behnke, O.; Behrendt, O.; Belousov, A.; Berger, N.; Bizot, J. C.; Boenig, M.-O.; Boudry, V.; Bozovic-Jelisavcic, I.; Bracinik, J.; Brandt, G.; Brinkmann, M.; Brisson, V.; Bruncko, D.; Büsser, F. W.; Bunyatyan, A.; Buschhorn, G.; Bystritskaya, L.; Campbell, A. J.; Cantun Avila, K. B.; Cassol-Brunner, F.; Cerny, K.; Cerny, V.; Chekelian, V.; Cholewa, A.; Contreras, J. G.; Coughlan, J. A.; Cozzika, G.; Cvach, J.; Dainton, J. B.; Daum, K.; de Boer, Y.; Delcourt, B.; Del Degan, M.; de Roeck, A.; de Wolf, E. A.; Diaconu, C.; Dodonov, V.; Dubak, A.; Eckerlin, G.; Efremenko, V.; Egli, S.; Eichler, R.; Eisele, F.; Eliseev, A.; Elsen, E.; Essenov, S.; Falkewicz, A.; Faulkner, P. J. W.; Favart, L.; Fedotov, A.; Felst, R.; Feltesse, J.; Ferencei, J.; Finke, L.; Fleischer, M.; Flucke, G.; Fomenko, A.; Franke, G.; Frisson, T.; Gabathuler, E.; Garutti, E.; Gayler, J.; Ghazaryan, S.; Ginzburgskaya, S.; Glazov, A.; Glushkov, I.; Goerlich, L.; Goettlich, M.; Gogitidze, N.; Gorbounov, S.; Gouzevitch, M.; Grab, C.; Greenshaw, T.; Gregori, M.; Grell, B. R.; Grindhammer, G.; Habib, S.; Haidt, D.; Hansson, M.; Heinzelmann, G.; Helebrant, C.; Henderson, R. C. W.; Henschel, H.; Herrera, G.; Hildebrandt, M.; Hiller, K. H.; Hoffmann, D.; Horisberger, R.; Hovhannisyan, A.; Hreus, T.; Hussain, S.; Jacquet, M.; Janssen, X.; Jemanov, V.; Jönsson, L.; Johnson, D. P.; Jung, A. W.; Jung, H.; Kapichine, M.; Katzy, J.; Kenyon, I. R.; Kiesling, C.; Klein, M.; Kleinwort, C.; Klimkovich, T.; Kluge, T.; Knies, G.; Knutsson, A.; Korbel, V.; Kostka, P.; Kraemer, M.; Krastev, K.; Kretzschmar, J.; Kropivnitskaya, A.; Krüger, K.; Landon, M. P. J.; Lange, W.; Laštovička-Medin, G.; Laycock, P.; Lebedev, A.; Leibenguth, G.; Lendermann, V.; Levonian, S.; Lindfeld, L.; Lipka, K.; Liptaj, A.; List, B.; List, J.; Loktionova, N.; Lopez-Fernandez, R.; Lubimov, V.; Lucaci-Timoce, A.-I.; Lueders, H.; Lytkin, L.; Makankine, A.; Malinovski, E.; Marage, P.; Marti, L.; Martisikova, M.; Martyn, H.-U.; Maxfield, S. J.; Mehta, A.; Meier, K.; Meyer, A. B.; Meyer, H.; Meyer, J.; Michels, V.; Mikocki, S.; Milcewicz-Mika, I.; Mladenov, D.; Mohamed, A.; Moreau, F.; Morozov, A.; Morris, J. V.; Mozer, M. U.; Müller, K.; Murín, P.; Nankov, K.; Naroska, B.; Naumann, T.; Newman, P. R.; Niebuhr, C.; Nikiforov, A.; Nowak, G.; Nowak, K.; Nozicka, M.; Oganezov, R.; Olivier, B.; Olsson, J. E.; Osman, S.; Ozerov, D.; Palichik, V.; Panagoulias, I.; Pandurovic, M.; Papadopoulou, T.; Pascaud, C.; Patel, G. D.; Peng, H.; Perez, E.; Perez-Astudillo, D.; Perieanu, A.; Petrukhin, A.; Picuric, I.; Piec, S.; Pitzl, D.; Plačakytė, R.; Povh, B.; Prideaux, P.; Rahmat, A. J.; Raicevic, N.; Reimer, P.; Rimmer, A.; Risler, C.; Rizvi, E.; Robmann, P.; Roland, B.; Roosen, R.; Rostovtsev, A.; Rurikova, Z.; Rusakov, S.; Salvaire, F.; Sankey, D. P. C.; Sauter, M.; Sauvan, E.; Schätzel, S.; Schmidt, S.; Schmitt, S.; Schmitz, C.; Schoeffel, L.; Schöning, A.; Schultz-Coulon, H.-C.; Sefkow, F.; Shaw-West, R. N.; Sheviakov, I.; Shtarkov, L. N.; Sloan, T.; Smiljanic, I.; Smirnov, P.; Soloviev, Y.; South, D.; Spaskov, V.; Specka, A.; Steder, M.; Stella, B.; Stiewe, J.; Stoilov, A.; Straumann, U.; Sunar, D.; Sykora, T.; Tchoulakov, V.; Thompson, G.; Thompson, P. D.; Toll, T.; Tomasz, F.; Traynor, D.; Trinh, T. N.; Truöl, P.; Tsakov, I.; Tsipolitis, G.; Tsurin, I.; Turnau, J.; Tzamariudaki, E.; Urban, K.; Usik, A.; Utkin, D.; Valkárová, A.; Vallée, C.; van Mechelen, P.; Vargas Trevino, A.; Vazdik, Y.; Vinokurova, S.; Volchinski, V.; Wacker, K.; Weber, G.; Weber, R.; Wegener, D.; Werner, C.; Wessels, M.; Wissing, C.; Wolf, R.; Wünsch, E.; Xella, S.; Yan, W.; Yeganov, V.; Žáček, J.; Zálešák, J.; Zhang, Z.; Zhelezov, A.; Zhokin, A.; Zhu, Y. C.; Zimmermann, J.; Zimmermann, T.; Zohrabyan, H.; Zomer, F.

    2007-08-01

    Measurements are presented of differential dijet cross sections in diffractive photoproduction (Q2<0.01 GeV2) and deep-inelastic scattering processes (DIS, 4factorisation. The diffractive DIS dijet data are more sensitive to the diffractive gluon density at high fractional parton momentum than the measurements of inclusive diffractive DIS. In photoproduction, the predicted dijet cross section has to be multiplied by a factor of approximately 0.5 for both direct and resolved photon interactions to describe the measurements. The ratio of measured dijet cross section to NLO prediction in photoproduction is a factor 0.5±0.1 smaller than the same ratio in DIS. This suppression is the first clear observation of QCD hard scattering factorisation breaking at HERA. The measurements are also compared to the two soft colour neutralisation models SCI and GAL. The SCI model describes diffractive dijet production in DIS but not in photoproduction. The GAL model fails in both kinematic regions.

  8. Sparse structure regularized ranking

    KAUST Repository

    Wang, Jim Jing-Yan

    2014-04-17

    Learning ranking scores is critical for the multimedia database retrieval problem. In this paper, we propose a novel ranking score learning algorithm by exploring the sparse structure and using it to regularize ranking scores. To explore the sparse structure, we assume that each multimedia object could be represented as a sparse linear combination of all other objects, and combination coefficients are regarded as a similarity measure between objects and used to regularize their ranking scores. Moreover, we propose to learn the sparse combination coefficients and the ranking scores simultaneously. A unified objective function is constructed with regard to both the combination coefficients and the ranking scores, and is optimized by an iterative algorithm. Experiments on two multimedia database retrieval data sets demonstrate the significant improvements of the propose algorithm over state-of-the-art ranking score learning algorithms.

  9. Structural Sparse Tracking

    KAUST Repository

    Zhang, Tianzhu; Yang, Ming-Hsuan; Ahuja, Narendra; Ghanem, Bernard; Yan, Shuicheng; Xu, Changsheng; Liu, Si

    2015-01-01

    candidate. We show that our SST algorithm accommodates most existing sparse trackers with the respective merits. Both qualitative and quantitative evaluations on challenging benchmark image sequences demonstrate that the proposed SST algorithm performs

  10. SparseM: A Sparse Matrix Package for R *

    Directory of Open Access Journals (Sweden)

    Roger Koenker

    2003-02-01

    Full Text Available SparseM provides some basic R functionality for linear algebra with sparse matrices. Use of the package is illustrated by a family of linear model fitting functions that implement least squares methods for problems with sparse design matrices. Significant performance improvements in memory utilization and computational speed are possible for applications involving large sparse matrices.

  11. Sparse distributed memory overview

    Science.gov (United States)

    Raugh, Mike

    1990-01-01

    The Sparse Distributed Memory (SDM) project is investigating the theory and applications of massively parallel computing architecture, called sparse distributed memory, that will support the storage and retrieval of sensory and motor patterns characteristic of autonomous systems. The immediate objectives of the project are centered in studies of the memory itself and in the use of the memory to solve problems in speech, vision, and robotics. Investigation of methods for encoding sensory data is an important part of the research. Examples of NASA missions that may benefit from this work are Space Station, planetary rovers, and solar exploration. Sparse distributed memory offers promising technology for systems that must learn through experience and be capable of adapting to new circumstances, and for operating any large complex system requiring automatic monitoring and control. Sparse distributed memory is a massively parallel architecture motivated by efforts to understand how the human brain works. Sparse distributed memory is an associative memory, able to retrieve information from cues that only partially match patterns stored in the memory. It is able to store long temporal sequences derived from the behavior of a complex system, such as progressive records of the system's sensory data and correlated records of the system's motor controls.

  12. Efficient convolutional sparse coding

    Science.gov (United States)

    Wohlberg, Brendt

    2017-06-20

    Computationally efficient algorithms may be applied for fast dictionary learning solving the convolutional sparse coding problem in the Fourier domain. More specifically, efficient convolutional sparse coding may be derived within an alternating direction method of multipliers (ADMM) framework that utilizes fast Fourier transforms (FFT) to solve the main linear system in the frequency domain. Such algorithms may enable a significant reduction in computational cost over conventional approaches by implementing a linear solver for the most critical and computationally expensive component of the conventional iterative algorithm. The theoretical computational cost of the algorithm may be reduced from O(M.sup.3N) to O(MN log N), where N is the dimensionality of the data and M is the number of elements in the dictionary. This significant improvement in efficiency may greatly increase the range of problems that can practically be addressed via convolutional sparse representations.

  13. Sparse approximation with bases

    CERN Document Server

    2015-01-01

    This book systematically presents recent fundamental results on greedy approximation with respect to bases. Motivated by numerous applications, the last decade has seen great successes in studying nonlinear sparse approximation. Recent findings have established that greedy-type algorithms are suitable methods of nonlinear approximation in both sparse approximation with respect to bases and sparse approximation with respect to redundant systems. These insights, combined with some previous fundamental results, form the basis for constructing the theory of greedy approximation. Taking into account the theoretical and practical demand for this kind of theory, the book systematically elaborates a theoretical framework for greedy approximation and its applications.  The book addresses the needs of researchers working in numerical mathematics, harmonic analysis, and functional analysis. It quickly takes the reader from classical results to the latest frontier, but is written at the level of a graduate course and do...

  14. Efficient implementations of block sparse matrix operations on shared memory vector machines

    International Nuclear Information System (INIS)

    Washio, T.; Maruyama, K.; Osoda, T.; Doi, S.; Shimizu, F.

    2000-01-01

    In this paper, we propose vectorization and shared memory-parallelization techniques for block-type random sparse matrix operations in finite element (FEM) applications. Here, a block corresponds to unknowns on one node in the FEM mesh and we assume that the block size is constant over the mesh. First, we discuss some basic vectorization ideas (the jagged diagonal (JAD) format and the segmented scan algorithm) for the sparse matrix-vector product. Then, we extend these ideas to the shared memory parallelization. After that, we show that the techniques can be applied not only to the sparse matrix-vector product but also to the sparse matrix-matrix product, the incomplete or complete sparse LU factorization and preconditioning. Finally, we report the performance evaluation results obtained on an NEC SX-4 shared memory vector machine for linear systems in some FEM applications. (author)

  15. Factorisation scale independence, the connection between alternative explanations of the EMC effect and QCD predictions for nuclear properties

    International Nuclear Information System (INIS)

    Close, F.E.; Roberts, R.G.; Ross, G.G.

    1987-05-01

    Different models are examined for deep inelastic scattering in nuclei in the context of the operator product expansion where the operator matrix elements involve a factorisation scale characterising the separation of short or long distance physics. By exploiting the independence of physical quantities upon this scale seemingly different models for the nucleus can be connected, such as dynamical rescaling and the standard convolution models of nuclear physics, allowing nuclear properties to be simply expressed in terms of the anomalous dimensions of QCD. A discussion is carried out of how non-convolution contributions may also be described by dynamical rescaling and it is shown how to extend dynamical rescaling to describe spin dependent quantities. (author)

  16. The contribution of scalars to N=4 SYM amplitudes II: Young tableaux, asymptotic factorisation and strong coupling

    Directory of Open Access Journals (Sweden)

    Alfredo Bonini

    2018-06-01

    Full Text Available We disentangle the contribution of scalars to the OPE series of null hexagonal Wilson loops/MHV gluon scattering amplitudes in multicolour N=4 SYM. In specific, we develop a systematic computation of the SU(4 matrix part of the Wilson loop by means of Young tableaux (with several examples. Then, we use a peculiar factorisation property (when a group of rapidities becomes large to deduce an explicit polar form. Furthermore, we emphasise the advantages of expanding the logarithm of the Wilson loop in terms of ‘connected functions’ as we apply this procedure to find an explicit strong coupling expansion (definitively proving that the leading order can prevail on the classical AdS5 string contribution.

  17. Supervised Convolutional Sparse Coding

    KAUST Repository

    Affara, Lama Ahmed

    2018-04-08

    Convolutional Sparse Coding (CSC) is a well-established image representation model especially suited for image restoration tasks. In this work, we extend the applicability of this model by proposing a supervised approach to convolutional sparse coding, which aims at learning discriminative dictionaries instead of purely reconstructive ones. We incorporate a supervised regularization term into the traditional unsupervised CSC objective to encourage the final dictionary elements to be discriminative. Experimental results show that using supervised convolutional learning results in two key advantages. First, we learn more semantically relevant filters in the dictionary and second, we achieve improved image reconstruction on unseen data.

  18. Supervised Transfer Sparse Coding

    KAUST Repository

    Al-Shedivat, Maruan

    2014-07-27

    A combination of the sparse coding and transfer learn- ing techniques was shown to be accurate and robust in classification tasks where training and testing objects have a shared feature space but are sampled from differ- ent underlying distributions, i.e., belong to different do- mains. The key assumption in such case is that in spite of the domain disparity, samples from different domains share some common hidden factors. Previous methods often assumed that all the objects in the target domain are unlabeled, and thus the training set solely comprised objects from the source domain. However, in real world applications, the target domain often has some labeled objects, or one can always manually label a small num- ber of them. In this paper, we explore such possibil- ity and show how a small number of labeled data in the target domain can significantly leverage classifica- tion accuracy of the state-of-the-art transfer sparse cod- ing methods. We further propose a unified framework named supervised transfer sparse coding (STSC) which simultaneously optimizes sparse representation, domain transfer and classification. Experimental results on three applications demonstrate that a little manual labeling and then learning the model in a supervised fashion can significantly improve classification accuracy.

  19. Discrete Sparse Coding.

    Science.gov (United States)

    Exarchakis, Georgios; Lücke, Jörg

    2017-11-01

    Sparse coding algorithms with continuous latent variables have been the subject of a large number of studies. However, discrete latent spaces for sparse coding have been largely ignored. In this work, we study sparse coding with latents described by discrete instead of continuous prior distributions. We consider the general case in which the latents (while being sparse) can take on any value of a finite set of possible values and in which we learn the prior probability of any value from data. This approach can be applied to any data generated by discrete causes, and it can be applied as an approximation of continuous causes. As the prior probabilities are learned, the approach then allows for estimating the prior shape without assuming specific functional forms. To efficiently train the parameters of our probabilistic generative model, we apply a truncated expectation-maximization approach (expectation truncation) that we modify to work with a general discrete prior. We evaluate the performance of the algorithm by applying it to a variety of tasks: (1) we use artificial data to verify that the algorithm can recover the generating parameters from a random initialization, (2) use image patches of natural images and discuss the role of the prior for the extraction of image components, (3) use extracellular recordings of neurons to present a novel method of analysis for spiking neurons that includes an intuitive discretization strategy, and (4) apply the algorithm on the task of encoding audio waveforms of human speech. The diverse set of numerical experiments presented in this letter suggests that discrete sparse coding algorithms can scale efficiently to work with realistic data sets and provide novel statistical quantities to describe the structure of the data.

  20. Sparse inpainting and isotropy

    Energy Technology Data Exchange (ETDEWEB)

    Feeney, Stephen M.; McEwen, Jason D.; Peiris, Hiranya V. [Department of Physics and Astronomy, University College London, Gower Street, London, WC1E 6BT (United Kingdom); Marinucci, Domenico; Cammarota, Valentina [Department of Mathematics, University of Rome Tor Vergata, via della Ricerca Scientifica 1, Roma, 00133 (Italy); Wandelt, Benjamin D., E-mail: s.feeney@imperial.ac.uk, E-mail: marinucc@axp.mat.uniroma2.it, E-mail: jason.mcewen@ucl.ac.uk, E-mail: h.peiris@ucl.ac.uk, E-mail: wandelt@iap.fr, E-mail: cammarot@axp.mat.uniroma2.it [Kavli Institute for Theoretical Physics, Kohn Hall, University of California, 552 University Road, Santa Barbara, CA, 93106 (United States)

    2014-01-01

    Sparse inpainting techniques are gaining in popularity as a tool for cosmological data analysis, in particular for handling data which present masked regions and missing observations. We investigate here the relationship between sparse inpainting techniques using the spherical harmonic basis as a dictionary and the isotropy properties of cosmological maps, as for instance those arising from cosmic microwave background (CMB) experiments. In particular, we investigate the possibility that inpainted maps may exhibit anisotropies in the behaviour of higher-order angular polyspectra. We provide analytic computations and simulations of inpainted maps for a Gaussian isotropic model of CMB data, suggesting that the resulting angular trispectrum may exhibit small but non-negligible deviations from isotropy.

  1. Sparse matrix test collections

    Energy Technology Data Exchange (ETDEWEB)

    Duff, I.

    1996-12-31

    This workshop will discuss plans for coordinating and developing sets of test matrices for the comparison and testing of sparse linear algebra software. We will talk of plans for the next release (Release 2) of the Harwell-Boeing Collection and recent work on improving the accessibility of this Collection and others through the World Wide Web. There will only be three talks of about 15 to 20 minutes followed by a discussion from the floor.

  2. Evidence for a magnetic moment at the Lu site of LuFe2

    International Nuclear Information System (INIS)

    Kasamatsu, Y.; Armitage, J.G.M.; Lord, J.S.; Riedi, P.C.; Fort, D.

    1995-01-01

    High pressure 175 Lu NMR measurements of LuFe 2 at 4.2 K suggest that Lu, like Y and Zr, carries a negative magnetic moment, in agreement with self-consistent energy band calculations. The observed spectrum is more complicated than would be expected for a Laves phase compound. ((orig.))

  3. Matrix Factorisation-based Calibration For Air Quality Crowd-sensing

    Science.gov (United States)

    Dorffer, Clement; Puigt, Matthieu; Delmaire, Gilles; Roussel, Gilles; Rouvoy, Romain; Sagnier, Isabelle

    2017-04-01

    Internet of Things (IoT) is extending internet to physical objects and places. The internet-enabled objects are thus able to communicate with each other and with their users. One main interest of IoT is the ease of production of huge masses of data (Big Data) using distributed networks of connected objects, thus making possible a fine-grained yet accurate analysis of physical phenomena. Mobile crowdsensing is a way to collect data using IoT. It basically consists of acquiring geolocalized data from the sensors (from or connected to the mobile devices, e.g., smartphones) of a crowd of volunteers. The sensed data are then collectively shared using wireless connection—such as GSM or WiFi—and stored on a dedicated server to be processed. One major application of mobile crowdsensing is environment monitoring. Indeed, with the proliferation of miniaturized yet sensitive sensors on one hand and, on the other hand, of low-cost microcontrollers/single-card PCs, it is easy to extend the sensing abilities of smartphones. Alongside the conventional, regulated, bulky and expensive instruments used in authoritative air quality stations, it is then possible to create a large-scale mobile sensor network providing insightful information about air quality. In particular, the finer spatial sampling rate due to such a dense network should allow air quality models to take into account local effects such as street canyons. However, one key issue with low-cost air quality sensors is the lack of trust in the sensed data. In most crowdsensing scenarios, the sensors (i) cannot be calibrated in a laboratory before or during their deployment and (ii) might be sparsely or continuously faulty (thus providing outliers in the data). Such issues should be automatically handled from the sensor readings. Indeed, due to the masses of generated data, solving the above issues cannot be performed by experts but requires specific data processing techniques. In this work, we assume that some mobile

  4. Hybrid synchronization of hyperchaotic Lu system

    Indian Academy of Sciences (India)

    In this paper, we study the hybrid synchronization between two identical hyperchaotic Lu systems. Hybrid synchronization of hyperchaotic Lu system is achieved through synchronization of two pairs of states and anti-synchronization of the other two pairs of states. Active controls are designed to achieve hybrid ...

  5. Compressed sensing & sparse filtering

    CERN Document Server

    Carmi, Avishy Y; Godsill, Simon J

    2013-01-01

    This book is aimed at presenting concepts, methods and algorithms ableto cope with undersampled and limited data. One such trend that recently gained popularity and to some extent revolutionised signal processing is compressed sensing. Compressed sensing builds upon the observation that many signals in nature are nearly sparse (or compressible, as they are normally referred to) in some domain, and consequently they can be reconstructed to within high accuracy from far fewer observations than traditionally held to be necessary. Apart from compressed sensing this book contains other related app

  6. Tests of QCD Factorisation in the Diffractive Production of Dijets in Deep-Inelastic Scattering and Photoproduction at HERA

    CERN Document Server

    Aktas, A.; Anthonis, T.; Antunovic, B.; Aplin, S.; Asmone, A.; Astvatsatourov, A.; Babaev, A.; Backovic, S.; Baghdasaryan, A.; Baranov, P.; Barrelet, E.; Bartel, W.; Baudrand, S.; Beckingham, M.; Begzsuren, K.; Behnke, O.; Behrendt, O.; Belousov, A.; Berger, N.; Bizot, J.C.; Boenig, M.-O.; Boudry, V.; Bozovic-Jelisavcic, I.; Bracinik, J.; Brandt, G.; Brinkmann, M.; Brisson, V.; Bruncko, D.; Busser, F.W.; Bunyatyan, A.; Buschhorn, G.; Bystritskaya, L.; Campbell, A.J.; Cantun Avila, K.B.; Cassol-Brunner, F.; Cerny, K.; Cerny, V.; Chekelian, V.; Cholewa, A.; Contreras, J.G.; Coughlan, J.A.; Cozzika, G.; Cvach, J.; Dainton, J.B.; Daum, K.; de Boer, Y.; Delcourt, B.; Del Degan, M.; De Roeck, A.; De Wolf, E.A.; Diaconu, C.; Dodonov, V.; Dubak, A.; Eckerlin, Guenter; Efremenko, V.; Egli, S.; Eichler, R.; Eisele, F.; Eliseev, A.; Elsen, E.; Essenov, S.; Falkewicz, A.; Faulkner, P.J.W.; Favart, L.; Fedotov, A.; Felst, R.; Feltesse, J.; Ferencei, J.; Finke, L.; Fleischer, M.; Flucke, G.; Fomenko, A.; Franke, G.; Frisson, T.; Gabathuler, E.; Garutti, E.; Gayler, J.; Ghazaryan, Samvel; Ginzburgskaya, S.; Glazov, A.; Glushkov, I.; Goerlich, L.; Goettlich, M.; Gogitidze, N.; Gorbounov, S.; Gouzevitch, M.; Grab, C.; Greenshaw, T.; Gregori, M.; Grell, B.R.; Grindhammer, G.; Habib, S.; Haidt, D.; Hansson, M.; Heinzelmann, G.; Helebrant, C.; Henderson, R.C.W.; Henschel, H.; Herrera, G.; Hildebrandt, M.; Hiller, K.H.; Hoffmann, D.; Horisberger, R.; Hovhannisyan, A.; Hreus, T.; Hussain, S.; Jacquet, M.; Janssen, X.; Jemanov, V.; Jonsson, L.; Johnson, D.P.; Jung, Andreas Werner; Jung, H.; Kapichine, M.; Katzy, J.; Kenyon, I.R.; Kiesling, Christian M.; Klein, M.; Kleinwort, C.; Klimkovich, T.; Kluge, T.; Knies, G.; Knutsson, A.; Korbel, V.; Kostka, P.; Kraemer, M.; Krastev, K.; Kretzschmar, J.; Kropivnitskaya, A.; Kruger, K.; Landon, M.P.J.; Lange, W.; Lastovicka-Medin, G.; Laycock, P.; Lebedev, A.; Leibenguth, G.; Lendermann, V.; Levonian, S.; Lindfeld, L.; Lipka, K.; Liptaj, A.; List, B.; List, J.; Loktionova, N.; Lopez-Fernandez, R.; Lubimov, V.; Lucaci-Timoce, A.-I.; Lueders, H.; Lytkin, L.; Makankine, A.; Malinovski, E.; Marage, P.; Marti, Ll.; Martisikova, M.; Martyn, H.-U.; Maxfield, S.J.; Mehta, A.; Meier, K.; Meyer, A.B.; Meyer, H.; Meyer, J.; Michels, V.; Mikocki, S.; Milcewicz-Mika, I.; Mladenov, D.; Mohamed, A.; Moreau, F.; Morozov, A.; Morris, J.V.; Mozer, Matthias Ulrich; Muller, K.; Murin, P.; Nankov, K.; Naroska, B.; Naumann, Th.; Newman, Paul R.; Niebuhr, C.; Nikiforov, A.; Nowak, G.; Nowak, K.; Nozicka, M.; Oganezov, R.; Olivier, B.; Olsson, J.E.; Osman, S.; Ozerov, D.; Palichik, V.; Panagoulias, I.; Pandurovic, M.; Papadopoulou, Th.; Pascaud, C.; Patel, G.D.; Peng, H.; Perez, E.; Perez-Astudillo, D.; Perieanu, A.; Petrukhin, A.; Picuric, I.; Piec, S.; Pitzl, D.; Placakyte, R.; Povh, B.; Prideaux, P.; Rahmat, A.J.; Raicevic, N.; Reimer, P.; Rimmer, A.; Risler, C.; Rizvi, E.; Robmann, P.; Roland, B.; Roosen, R.; Rostovtsev, A.; Rurikova, Z.; Rusakov, S.; Salvaire, F.; Sankey, D.P.C.; Sauter, M.; Sauvan, E.; Schatzel, S.; Schmidt, S.; Schmitt, S.; Schmitz, C.; Schoeffel, L.; Schoning, A.; Schultz-Coulon, H.-C.; Sefkow, F.; Shaw-West, R.N.; Sheviakov, I.; Shtarkov, L.N.; Sloan, T.; Smiljanic, Ivan; Smirnov, P.; Soloviev, Y.; South, D.; Spaskov, V.; Specka, Arnd E.; Steder, M.; Stella, B.; Stiewe, J.; Stoilov, A.; Straumann, U.; Sunar, D.; Sykora, T.; Tchoulakov, V.; Thompson, G.; Thompson, P.D.; Toll, T.; Tomasz, F.; Traynor, D.; Trinh, T.N.; Truol, P.; Tsakov, I.; Tsipolitis, G.; Tsurin, I.; Turnau, J.; Tzamariudaki, E.; Urban, K.; Usik, A.; Utkin, D.; Valkarova, A.; Vallee, C.; Van Mechelen, P.; Vargas Trevino, A.; Vazdik, Y.; Vinokurova, S.; Volchinski, V.; Wacker, K.; Weber, G.; Weber, R.; Wegener, D.; Werner, C.; Wessels, M.; Wissing, Ch.; Wolf, R.; Wunsch, E.; Xella, S.; Yan, W.; Yeganov, V.; Zacek, J.; Zalesak, J.; Zhang, Z.; Zhelezov, A.; Zhokin, A.; Zhu, Y.C.; Zimmerman, J.; Zimmerman, T.; Zohrabyan, H.; Zomer, F.

    2007-01-01

    Measurements are presented of differential dijet cross sections in diffractive photoproduction (Q^2 e X Y, in which the system X, containing at least two jets, is separated from a leading low-mass proton remnant system Y by a large rapidity gap. The dijet cross sections are compared with NLO QCD predictions based on diffractive parton densities previously obtained from a QCD analysis of inclusive diffractive DIS cross sections by H1. In DIS, the dijet data are well described, supporting the validity of QCD factorisation. The diffractive DIS dijet data are more sensitive to the diffractive gluon density at high fractional parton momentum than the measurements of inclusive diffractive DIS. In photoproduction, the predicted dijet cross section has to be multiplied by a factor of approximately 0.5 for both direct and resolved photon interactions to describe the measurements. The ratio of measured dijet cross section to NLO prediction in photoproduction is a factor 0.5+-0.1 smaller than the same ratio in DIS. This...

  7. Semi-supervised sparse coding

    KAUST Repository

    Wang, Jim Jing-Yan; Gao, Xin

    2014-01-01

    Sparse coding approximates the data sample as a sparse linear combination of some basic codewords and uses the sparse codes as new presentations. In this paper, we investigate learning discriminative sparse codes by sparse coding in a semi-supervised manner, where only a few training samples are labeled. By using the manifold structure spanned by the data set of both labeled and unlabeled samples and the constraints provided by the labels of the labeled samples, we learn the variable class labels for all the samples. Furthermore, to improve the discriminative ability of the learned sparse codes, we assume that the class labels could be predicted from the sparse codes directly using a linear classifier. By solving the codebook, sparse codes, class labels and classifier parameters simultaneously in a unified objective function, we develop a semi-supervised sparse coding algorithm. Experiments on two real-world pattern recognition problems demonstrate the advantage of the proposed methods over supervised sparse coding methods on partially labeled data sets.

  8. Semi-supervised sparse coding

    KAUST Repository

    Wang, Jim Jing-Yan

    2014-07-06

    Sparse coding approximates the data sample as a sparse linear combination of some basic codewords and uses the sparse codes as new presentations. In this paper, we investigate learning discriminative sparse codes by sparse coding in a semi-supervised manner, where only a few training samples are labeled. By using the manifold structure spanned by the data set of both labeled and unlabeled samples and the constraints provided by the labels of the labeled samples, we learn the variable class labels for all the samples. Furthermore, to improve the discriminative ability of the learned sparse codes, we assume that the class labels could be predicted from the sparse codes directly using a linear classifier. By solving the codebook, sparse codes, class labels and classifier parameters simultaneously in a unified objective function, we develop a semi-supervised sparse coding algorithm. Experiments on two real-world pattern recognition problems demonstrate the advantage of the proposed methods over supervised sparse coding methods on partially labeled data sets.

  9. A comparison of SuperLU solvers on the intel MIC architecture

    Science.gov (United States)

    Tuncel, Mehmet; Duran, Ahmet; Celebi, M. Serdar; Akaydin, Bora; Topkaya, Figen O.

    2016-10-01

    In many science and engineering applications, problems may result in solving a sparse linear system AX=B. For example, SuperLU_MCDT, a linear solver, was used for the large penta-diagonal matrices for 2D problems and hepta-diagonal matrices for 3D problems, coming from the incompressible blood flow simulation (see [1]). It is important to test the status and potential improvements of state-of-the-art solvers on new technologies. In this work, sequential, multithreaded and distributed versions of SuperLU solvers (see [2]) are examined on the Intel Xeon Phi coprocessors using offload programming model at the EURORA cluster of CINECA in Italy. We consider a portfolio of test matrices containing patterned matrices from UFMM ([3]) and randomly located matrices. This architecture can benefit from high parallelism and large vectors. We find that the sequential SuperLU benefited up to 45 % performance improvement from the offload programming depending on the sparse matrix type and the size of transferred and processed data.

  10. Evaluation of the 175Lu(n,2n)174Lu, 175Lu(n,2n/sup 174m/Lu, and 175Lu(n,3n)173Lu cross sections from threshold to 20 MeV

    International Nuclear Information System (INIS)

    Philis, C.; Young, P.G.; Arthur, E.D.

    1978-04-01

    An evaluation of the 175 Lu(n,2n) 174 Lu, 175 Lu(n,2n)/sup 174m/Lu, and 175 Lu(n,3n) 173 Lu reactions from threshold to 20 MeV is presented. Available experimental data were renormalized to a consistent set of standards and were used along with results from statistical-preequilibrium model calculations to produce recommended curves for each of these reactions

  11. Sparse distributed memory

    Science.gov (United States)

    Denning, Peter J.

    1989-01-01

    Sparse distributed memory was proposed be Pentti Kanerva as a realizable architecture that could store large patterns and retrieve them based on partial matches with patterns representing current sensory inputs. This memory exhibits behaviors, both in theory and in experiment, that resemble those previously unapproached by machines - e.g., rapid recognition of faces or odors, discovery of new connections between seemingly unrelated ideas, continuation of a sequence of events when given a cue from the middle, knowing that one doesn't know, or getting stuck with an answer on the tip of one's tongue. These behaviors are now within reach of machines that can be incorporated into the computing systems of robots capable of seeing, talking, and manipulating. Kanerva's theory is a break with the Western rationalistic tradition, allowing a new interpretation of learning and cognition that respects biology and the mysteries of individual human beings.

  12. Parallel Sparse Matrix - Vector Product

    DEFF Research Database (Denmark)

    Alexandersen, Joe; Lazarov, Boyan Stefanov; Dammann, Bernd

    This technical report contains a case study of a sparse matrix-vector product routine, implemented for parallel execution on a compute cluster with both pure MPI and hybrid MPI-OpenMP solutions. C++ classes for sparse data types were developed and the report shows how these class can be used...

  13. Sparse decompositions in 'incoherent' dictionaries

    DEFF Research Database (Denmark)

    Gribonval, R.; Nielsen, Morten

    2003-01-01

    a unique sparse representation in such a dictionary. In particular, it is proved that the result of Donoho and Huo, concerning the replacement of a combinatorial optimization problem with a linear programming problem when searching for sparse representations, has an analog for dictionaries that may...

  14. lu sildistamine / Erkki Bahovski

    Index Scriptorium Estoniae

    Bahovski, Erkki, 1970-

    2007-01-01

    President Toomas Hendrik Ilvese üleskutsest moodustada Mälu Instituut Eesti lähimineviku uurimiseks. Autori arvates on Vene propaganda taustal raske uurida ajalugu sine ira et studio ("ilma viha ja eelarvamusteta"), nagu soovitas president

  15. Advances on LuGre friction model

    OpenAIRE

    Fuad, Mohammad; Ikhouane, Fayçal

    2013-01-01

    LuGre friction model is an ordinary differential equation that is widely used in describing the friction phenomenon for mechanical systems. The importance of this model comes from the fact that it captures most of the friction behavior that has been observed including hysteresis. In this paper, we study some aspects related to the hysteresis behavior induced by the LuGre friction model.

  16. lu defragmenteerimine / Ilja Sundelevitsh

    Index Scriptorium Estoniae

    Sundelevitsh, Ilja

    2007-01-01

    Viktor Misiano kureeritud projekt "Mälu tagasitulek" Kumu Kunstimuuseumis kuni 29. VII. Dmitri Gutovi projektist, mis koosneb videotest "Sula" ja "Kajakad" ning kolmest maalist, Valentin Arhipovi projektist "Vassili Grigorjevitsh Arhipovi looming aastail 1962-2006", Juri Leidermani heliinstallatsioonist "Isa jutustus", Jevgeni Fiksi projektist, Gljuklja & Tzaplja (Olga Jegorova, Natalja Pershina) installatsioonist "Punased purjed", Igor Shtsherbini tööst "Defragmenteerimine. Stirlitzi mälu" ja Sergei Bratkovi tööst

  17. Double dissociation in the reaction K-p→K-π+π-Nπ+ at 14.3GeV/c and pomeron factorisation

    International Nuclear Information System (INIS)

    Denegri, D.; Pons, Y.; Borg, A.; Spiro, M.; Paler, K.; Tovey, S.; Combes, C.; Shah, T.P.

    1975-01-01

    Evidence for the double dissociation process K - p→QN*1/2→(antikaon neutral* π - ) (nπ + ) at 14.3GeV/c is presented. The cross section for this process is of the order of 10μb. The production differential cross section is steep, as typical of diffractive processes, and exhibits a strong correlation between the production slope and the dissociation system mass. The mass variation of the differential cross section slope and the total cross section of the double dissociation component are consistent with the factorisable Pomeron exchange model predictions [fr

  18. Consensus Convolutional Sparse Coding

    KAUST Repository

    Choudhury, Biswarup

    2017-12-01

    Convolutional sparse coding (CSC) is a promising direction for unsupervised learning in computer vision. In contrast to recent supervised methods, CSC allows for convolutional image representations to be learned that are equally useful for high-level vision tasks and low-level image reconstruction and can be applied to a wide range of tasks without problem-specific retraining. Due to their extreme memory requirements, however, existing CSC solvers have so far been limited to low-dimensional problems and datasets using a handful of low-resolution example images at a time. In this paper, we propose a new approach to solving CSC as a consensus optimization problem, which lifts these limitations. By learning CSC features from large-scale image datasets for the first time, we achieve significant quality improvements in a number of imaging tasks. Moreover, the proposed method enables new applications in high-dimensional feature learning that has been intractable using existing CSC methods. This is demonstrated for a variety of reconstruction problems across diverse problem domains, including 3D multispectral demosaicing and 4D light field view synthesis.

  19. Consensus Convolutional Sparse Coding

    KAUST Repository

    Choudhury, Biswarup

    2017-04-11

    Convolutional sparse coding (CSC) is a promising direction for unsupervised learning in computer vision. In contrast to recent supervised methods, CSC allows for convolutional image representations to be learned that are equally useful for high-level vision tasks and low-level image reconstruction and can be applied to a wide range of tasks without problem-specific retraining. Due to their extreme memory requirements, however, existing CSC solvers have so far been limited to low-dimensional problems and datasets using a handful of low-resolution example images at a time. In this paper, we propose a new approach to solving CSC as a consensus optimization problem, which lifts these limitations. By learning CSC features from large-scale image datasets for the first time, we achieve significant quality improvements in a number of imaging tasks. Moreover, the proposed method enables new applications in high dimensional feature learning that has been intractable using existing CSC methods. This is demonstrated for a variety of reconstruction problems across diverse problem domains, including 3D multispectral demosaickingand 4D light field view synthesis.

  20. Consensus Convolutional Sparse Coding

    KAUST Repository

    Choudhury, Biswarup; Swanson, Robin; Heide, Felix; Wetzstein, Gordon; Heidrich, Wolfgang

    2017-01-01

    Convolutional sparse coding (CSC) is a promising direction for unsupervised learning in computer vision. In contrast to recent supervised methods, CSC allows for convolutional image representations to be learned that are equally useful for high-level vision tasks and low-level image reconstruction and can be applied to a wide range of tasks without problem-specific retraining. Due to their extreme memory requirements, however, existing CSC solvers have so far been limited to low-dimensional problems and datasets using a handful of low-resolution example images at a time. In this paper, we propose a new approach to solving CSC as a consensus optimization problem, which lifts these limitations. By learning CSC features from large-scale image datasets for the first time, we achieve significant quality improvements in a number of imaging tasks. Moreover, the proposed method enables new applications in high-dimensional feature learning that has been intractable using existing CSC methods. This is demonstrated for a variety of reconstruction problems across diverse problem domains, including 3D multispectral demosaicing and 4D light field view synthesis.

  1. Turbulent flows over sparse canopies

    Science.gov (United States)

    Sharma, Akshath; García-Mayoral, Ricardo

    2018-04-01

    Turbulent flows over sparse and dense canopies exerting a similar drag force on the flow are investigated using Direct Numerical Simulations. The dense canopies are modelled using a homogeneous drag force, while for the sparse canopy, the geometry of the canopy elements is represented. It is found that on using the friction velocity based on the local shear at each height, the streamwise velocity fluctuations and the Reynolds stress within the sparse canopy are similar to those from a comparable smooth-wall case. In addition, when scaled with the local friction velocity, the intensity of the off-wall peak in the streamwise vorticity for sparse canopies also recovers a value similar to a smooth-wall. This indicates that the sparse canopy does not significantly disturb the near-wall turbulence cycle, but causes its rescaling to an intensity consistent with a lower friction velocity within the canopy. In comparison, the dense canopy is found to have a higher damping effect on the turbulent fluctuations. For the case of the sparse canopy, a peak in the spectral energy density of the wall-normal velocity, and Reynolds stress is observed, which may indicate the formation of Kelvin-Helmholtz-like instabilities. It is also found that a sparse canopy is better modelled by a homogeneous drag applied on the mean flow alone, and not the turbulent fluctuations.

  2. Sparse Regression by Projection and Sparse Discriminant Analysis

    KAUST Repository

    Qi, Xin; Luo, Ruiyan; Carroll, Raymond J.; Zhao, Hongyu

    2015-01-01

    predictions. We introduce a new framework, regression by projection, and its sparse version to analyze high-dimensional data. The unique nature of this framework is that the directions of the regression coefficients are inferred first, and the lengths

  3. In Defense of Sparse Tracking: Circulant Sparse Tracker

    KAUST Repository

    Zhang, Tianzhu; Bibi, Adel Aamer; Ghanem, Bernard

    2016-01-01

    Sparse representation has been introduced to visual tracking by finding the best target candidate with minimal reconstruction error within the particle filter framework. However, most sparse representation based trackers have high computational cost, less than promising tracking performance, and limited feature representation. To deal with the above issues, we propose a novel circulant sparse tracker (CST), which exploits circulant target templates. Because of the circulant structure property, CST has the following advantages: (1) It can refine and reduce particles using circular shifts of target templates. (2) The optimization can be efficiently solved entirely in the Fourier domain. (3) High dimensional features can be embedded into CST to significantly improve tracking performance without sacrificing much computation time. Both qualitative and quantitative evaluations on challenging benchmark sequences demonstrate that CST performs better than all other sparse trackers and favorably against state-of-the-art methods.

  4. In Defense of Sparse Tracking: Circulant Sparse Tracker

    KAUST Repository

    Zhang, Tianzhu

    2016-12-13

    Sparse representation has been introduced to visual tracking by finding the best target candidate with minimal reconstruction error within the particle filter framework. However, most sparse representation based trackers have high computational cost, less than promising tracking performance, and limited feature representation. To deal with the above issues, we propose a novel circulant sparse tracker (CST), which exploits circulant target templates. Because of the circulant structure property, CST has the following advantages: (1) It can refine and reduce particles using circular shifts of target templates. (2) The optimization can be efficiently solved entirely in the Fourier domain. (3) High dimensional features can be embedded into CST to significantly improve tracking performance without sacrificing much computation time. Both qualitative and quantitative evaluations on challenging benchmark sequences demonstrate that CST performs better than all other sparse trackers and favorably against state-of-the-art methods.

  5. Radiation hardness of LuAG:Ce and LuAG:Pr scintillator crystals

    CERN Document Server

    Derdzyan, M V; Belsky, A; Dujardin, C; Lecoq, P; Lucchini, M; Ovanesyan, K L; Pauwels, K; Pedrini, C; Petrosyan, A G

    2012-01-01

    Single crystals of LuAG:Ce, LuAG:Pr and un-doped LuAG were grown by the vertical Bridgman method and studied for radiation hardness under gamma-rays with doses in the range 10-10(5) Gy (Co-60). A wide absorption band peaking at around 600 nm springs up in all three types of crystals after the irradiations. The second band peaking at around 375 nm appears in both LuAG:Pr and un-doped LuAG. Compositional variations have been done to reveal the spectral behavior of induced color centers in more detail and to understand their origin. Similarities in behavior of Yb2+ centers in as-grown garnets are found, indicating that radiation induced color centers can be associated with residual trace amounts of Yb present in the raw materials. Un-doped LuAG and LuAG:Ce demonstrate moderate radiation hardness (the induced absorption coefficients being equal to 0.05-0.08 cm(-1) for accumulated doses of 10(3)-10(4) Gy), while LuAG:Pr is less radiation hard. The ways to improve the radiation hardness are discussed.

  6. Language Recognition via Sparse Coding

    Science.gov (United States)

    2016-09-08

    explanation is that sparse coding can achieve a near-optimal approximation of much complicated nonlinear relationship through local and piecewise linear...training examples, where x(i) ∈ RN is the ith example in the batch. Optionally, X can be normalized and whitened before sparse coding for better result...normalized input vectors are then ZCA- whitened [20]. Em- pirically, we choose ZCA- whitening over PCA- whitening , and there is no dimensionality reduction

  7. Shearlets and Optimally Sparse Approximations

    DEFF Research Database (Denmark)

    Kutyniok, Gitta; Lemvig, Jakob; Lim, Wang-Q

    2012-01-01

    Multivariate functions are typically governed by anisotropic features such as edges in images or shock fronts in solutions of transport-dominated equations. One major goal both for the purpose of compression as well as for an efficient analysis is the provision of optimally sparse approximations...... optimally sparse approximations of this model class in 2D as well as 3D. Even more, in contrast to all other directional representation systems, a theory for compactly supported shearlet frames was derived which moreover also satisfy this optimality benchmark. This chapter shall serve as an introduction...... to and a survey about sparse approximations of cartoon-like images by band-limited and also compactly supported shearlet frames as well as a reference for the state-of-the-art of this research field....

  8. Sparse Representations of Hyperspectral Images

    KAUST Repository

    Swanson, Robin J.

    2015-01-01

    Hyperspectral image data has long been an important tool for many areas of sci- ence. The addition of spectral data yields significant improvements in areas such as object and image classification, chemical and mineral composition detection, and astronomy. Traditional capture methods for hyperspectral data often require each wavelength to be captured individually, or by sacrificing spatial resolution. Recently there have been significant improvements in snapshot hyperspectral captures using, in particular, compressed sensing methods. As we move to a compressed sensing image formation model the need for strong image priors to shape our reconstruction, as well as sparse basis become more important. Here we compare several several methods for representing hyperspectral images including learned three dimensional dictionaries, sparse convolutional coding, and decomposable nonlocal tensor dictionaries. Addi- tionally, we further explore their parameter space to identify which parameters provide the most faithful and sparse representations.

  9. Sparse Representations of Hyperspectral Images

    KAUST Repository

    Swanson, Robin J.

    2015-11-23

    Hyperspectral image data has long been an important tool for many areas of sci- ence. The addition of spectral data yields significant improvements in areas such as object and image classification, chemical and mineral composition detection, and astronomy. Traditional capture methods for hyperspectral data often require each wavelength to be captured individually, or by sacrificing spatial resolution. Recently there have been significant improvements in snapshot hyperspectral captures using, in particular, compressed sensing methods. As we move to a compressed sensing image formation model the need for strong image priors to shape our reconstruction, as well as sparse basis become more important. Here we compare several several methods for representing hyperspectral images including learned three dimensional dictionaries, sparse convolutional coding, and decomposable nonlocal tensor dictionaries. Addi- tionally, we further explore their parameter space to identify which parameters provide the most faithful and sparse representations.

  10. Spectral properties of hydrothermally-grown Nd:LuAG, Yb:LuAG, and Yb:Lu{sub 2}O{sub 3} laser materials

    Energy Technology Data Exchange (ETDEWEB)

    Brown, David C., E-mail: DBrown@snakecreeklasers.com [Snake Creek Lasers LLC, Friendsville, PA 18818 (United States); McMillen, Colin D.; Moore, Cheryl; Kolis, Joseph W. [Department of Chemistry and Center for Optical Materials Science and Engineering Technologies, Clemson University, Clemson, SC 29634-0973 (United States); Envid, Victoria [Snake Creek Lasers LLC, Friendsville, PA 18818 (United States)

    2014-04-15

    We have investigated the hydrothermal growth of, and spectrally characterized, the lutetium based laser materials Nd:LuAG, Yb:LuAG, and Yb:Lu{sub 2}O{sub 3}. Absorption cross-section data are presented for Nd:LuAG at 83, 175, and 295 K. Absorption cross-section data was also obtained for Yb:LuAG at 83, 175, and 295 K; the 295 K data was used to generate emission cross-sections using the method of reciprocity. For Yb:Lu{sub 2}O{sub 3}, we present absorption cross-sections at 295 K as well as emission cross-sections derived using reciprocity. -- Highlights: • We present spectral properties for hydrothermally-grown laser crystals. • Absorption cross-section data are presented for Nd:LuAG and Yb:LuAG at 83, 175, and 295 K. • Emission cross-sections are presented for Yb:LuAG at 295 K derived by reciprocity. • We present absorption cross-sections at 295 K as well as emission cross-sections derived using reciprocity for the laser material Yb:Lu{sub 2}O{sub 3}.

  11. Luminescent properties of LuPO4-Pr and LuPO4-Eu nanoparticles

    International Nuclear Information System (INIS)

    Vistovskyy, V.; Malyi, T.; Vas’kiv, A.; Chylii, M.; Mitina, N.; Zaichenko, A.; Gektin, A.; Voloshinovskii, A.

    2016-01-01

    Spectral-luminescence parameters of LuPO 4 -Eu and LuPO 4 -Pr nanoparticles of different sizes are studied upon excitation by the synchrotron radiation with photon energies 4–40 eV. Influence of the nanoparticle size on Eu 3+ and Pr 3+ impurity luminescence is analyzed for intracenter and recombination excitation. It is shown that the luminescence intensity of impurities in the case of recombination excitation significantly stronger decreases with decreasing of nanoparticle size compared to intracenter excitation. This feature is explained by the influence of thermalization length to nanoparticle size ratio on the recombination luminescence. Electron recombination luminescence inherent for LuPO 4 -Eu nanoparticles shows a weaker dependence on the nanoparticle size than the hole one in LuPO 4 -Pr nanoparticles. The difference between energy states of praseodymium impurity ions in nanoparticles of different sizes is revealed.

  12. Image understanding using sparse representations

    CERN Document Server

    Thiagarajan, Jayaraman J; Turaga, Pavan; Spanias, Andreas

    2014-01-01

    Image understanding has been playing an increasingly crucial role in several inverse problems and computer vision. Sparse models form an important component in image understanding, since they emulate the activity of neural receptors in the primary visual cortex of the human brain. Sparse methods have been utilized in several learning problems because of their ability to provide parsimonious, interpretable, and efficient models. Exploiting the sparsity of natural signals has led to advances in several application areas including image compression, denoising, inpainting, compressed sensing, blin

  13. Permuting sparse rectangular matrices into block-diagonal form

    Energy Technology Data Exchange (ETDEWEB)

    Aykanat, Cevdet; Pinar, Ali; Catalyurek, Umit V.

    2002-12-09

    This work investigates the problem of permuting a sparse rectangular matrix into block diagonal form. Block diagonal form of a matrix grants an inherent parallelism for the solution of the deriving problem, as recently investigated in the context of mathematical programming, LU factorization and QR factorization. We propose graph and hypergraph models to represent the nonzero structure of a matrix, which reduce the permutation problem to those of graph partitioning by vertex separator and hypergraph partitioning, respectively. Besides proposing the models to represent sparse matrices and investigating related combinatorial problems, we provide a detailed survey of relevant literature to bridge the gap between different societies, investigate existing techniques for partitioning and propose new ones, and finally present a thorough empirical study of these techniques. Our experiments on a wide range of matrices, using state-of-the-art graph and hypergraph partitioning tools MeTiS and PaT oH, revealed that the proposed methods yield very effective solutions both in terms of solution quality and run time.

  14. LU factorization for accelerator-based systems

    KAUST Repository

    Agullo, Emmanuel

    2011-12-01

    Multicore architectures enhanced with multiple GPUs are likely to become mainstream High Performance Computing (HPC) platforms in a near future. In this paper, we present the design and implementation of an LU factorization using tile algorithm that can fully exploit the potential of such platforms in spite of their complexity. We use a methodology derived from previous work on Cholesky and QR factorizations. Our contributions essentially consist of providing new CPU/GPU hybrid LU kernels, studying the impact on performance of the looking variants as well as the storage layout in presence of pivoting, tuning the kernels for two different machines composed of multiple recent NVIDIA Tesla S1070 (four GPUs total) and Fermi-based S2050 GPUs (three GPUs total), respectively. The hybrid tile LU asymptotically achieves 1 Tflop/s in single precision on both hardwares. The performance in double precision arithmetic reaches 500 Gflop/s on the Fermi-based system, twice faster than the old GPU generation of Tesla S1070. We also discuss the impact of the number of tiles on the numerical stability. We show that the numerical results of the tile LU factorization will be accurate enough for most applications as long as the computations are performed in double precision arithmetic. © 2011 IEEE.

  15. Structure of wobbling excitations in 163Lu

    International Nuclear Information System (INIS)

    Carlsson, B.G.

    2007-01-01

    Using a many-particles plus rotor model, wobbling excitations built on top of a triaxial superdeformed band in 163 Lu are investigated. By extracting all parameters for the rotor from a mean field calculation a good correspondence with calculations based on the random-phase approximation is achieved. (author)

  16. ON LU FACTORIZATION ALGORITHM WITH MULTIPLIERS

    African Journals Online (AJOL)

    Various algorithm such as Doolittle, Crouts and Cholesky's have been proposed to factor a square matrix into a product of L and U matrices, that is, to find L and U such that A = LU; where L and U are lower and upper triangular matrices respectively. These methods are derived by writing the general forms of L and U and the ...

  17. Study of the production of 177Lu through 176Yb (n, γ) 177Yb → 177Lu nuclear reaction

    International Nuclear Information System (INIS)

    Silva, Giovana Pasqualini da; Osso Junior, Joao Alberto

    2007-01-01

    The beta minus emitter 177 Lu is a promising therapeutic radioisotope for the curative treatment of cancer using labelled proteins. It has a half - life of T 1/2 = 6.71 day and maximum and average β - energies of 421 and 133 keV, resulting in a short range of radiation in tissue. The decay is accompanied by the emission of low energy γ-radiation with 208.3 keV (11%) and 113 keV (6.4%) suitable for simultaneous imaging, 177 Lu can be produced by two different routes, namely, by irradiation of natural Lu 2 O 3 target ( 176 Lu, 2.6%) or enriched (in 176 Lu) Lu 2 O 3 target, as also by irradiation of Yb target (Yb 2 O 3 ) followed by radiochemical separation of 177 Lu from Yb isotopes. The objective of this work is to study the production of 177 Lu through the indirect 176 Yb(n,γ) 177 Yb → 177 Lu nuclear reaction. The results of the production yield of 177 Lu will be shown and compared with the direct reaction. The method of choice for the chemical separation between Lu and Yb was the ion exchange, using an cation exchange resin in Cl - form and α-HIBA as eluent. Preliminary results showed a good separation of 177 Lu from Yb 2 O 3 indirect targets. (author)

  18. Double diffractive dissociation in the reaction K-p→K-π+π-nπ+ at 14.3 GeV/c and pomeron factorisation

    International Nuclear Information System (INIS)

    Denegri, D.; Pons, Y.; Borg, A.; Spiro, M.; Paler, K.; Tovey, S.; Comber, C.; Shah, T.P.

    1975-01-01

    Evidence is presented for the double dissociation process K - p→QN*sub(1/2)→(anti K* 0 π - ) (nπ + ) at 14.3GeV/c. The cross section for the process is of the order of 10 μb. The production differential cross section is steep (for near-threshold excitation masses), as typical of diffractive processes, and exhibits a strong correlation between the production slope and the masses of the dissociated systems. The spin-parity composition and states of the two dissociation systems closely resemble those found in single dissociation, indicating that a common diffraction-like mechanism is responsible for both processes. The mass variations of the differential cross-section slope, the decay angular correlations and the total cross section of the double dissociation component are consistent with the predictions of a factorisable pomeron exchange model. (Auth.)

  19. Sparse PCA with Oracle Property.

    Science.gov (United States)

    Gu, Quanquan; Wang, Zhaoran; Liu, Han

    In this paper, we study the estimation of the k -dimensional sparse principal subspace of covariance matrix Σ in the high-dimensional setting. We aim to recover the oracle principal subspace solution, i.e., the principal subspace estimator obtained assuming the true support is known a priori. To this end, we propose a family of estimators based on the semidefinite relaxation of sparse PCA with novel regularizations. In particular, under a weak assumption on the magnitude of the population projection matrix, one estimator within this family exactly recovers the true support with high probability, has exact rank- k , and attains a [Formula: see text] statistical rate of convergence with s being the subspace sparsity level and n the sample size. Compared to existing support recovery results for sparse PCA, our approach does not hinge on the spiked covariance model or the limited correlation condition. As a complement to the first estimator that enjoys the oracle property, we prove that, another estimator within the family achieves a sharper statistical rate of convergence than the standard semidefinite relaxation of sparse PCA, even when the previous assumption on the magnitude of the projection matrix is violated. We validate the theoretical results by numerical experiments on synthetic datasets.

  20. CW laser properties of Nd:GdYAG, Nd:LuYAG, and Nd:GdLuAG mixed crystals

    Science.gov (United States)

    Di, J. Q.; Xu, X. D.; Li, D. Z.; Zhou, D. H.; Wu, F.; Zhao, Z. W.; Xu, J.; Tang, D. Y.

    2011-10-01

    Three mixed crystals, Nd:GdYAG, Nd:LuYAG, and Nd:GdLuAG, were grown by Czochralski method. We report the continuous-wave (CW) Nd:GdYAG, Nd:LuYAG, and Nd:GdLuAG laser operation under laser diode pumping. The maximum output powers are 4.11, 5.31, and 7.47 W, with slope efficiency of 73.0, 55.3, and 57.1%, respectively. With replacing Lu3+ or Y3+ ions with large Gd3+ ions, the pump efficiency increases.

  1. Sparse Regression by Projection and Sparse Discriminant Analysis

    KAUST Repository

    Qi, Xin

    2015-04-03

    © 2015, © American Statistical Association, Institute of Mathematical Statistics, and Interface Foundation of North America. Recent years have seen active developments of various penalized regression methods, such as LASSO and elastic net, to analyze high-dimensional data. In these approaches, the direction and length of the regression coefficients are determined simultaneously. Due to the introduction of penalties, the length of the estimates can be far from being optimal for accurate predictions. We introduce a new framework, regression by projection, and its sparse version to analyze high-dimensional data. The unique nature of this framework is that the directions of the regression coefficients are inferred first, and the lengths and the tuning parameters are determined by a cross-validation procedure to achieve the largest prediction accuracy. We provide a theoretical result for simultaneous model selection consistency and parameter estimation consistency of our method in high dimension. This new framework is then generalized such that it can be applied to principal components analysis, partial least squares, and canonical correlation analysis. We also adapt this framework for discriminant analysis. Compared with the existing methods, where there is relatively little control of the dependency among the sparse components, our method can control the relationships among the components. We present efficient algorithms and related theory for solving the sparse regression by projection problem. Based on extensive simulations and real data analysis, we demonstrate that our method achieves good predictive performance and variable selection in the regression setting, and the ability to control relationships between the sparse components leads to more accurate classification. In supplementary materials available online, the details of the algorithms and theoretical proofs, and R codes for all simulation studies are provided.

  2. Hydrogen migration in Lu at low temperatures

    International Nuclear Information System (INIS)

    Yamakawa, K.

    1997-01-01

    The migration of hydrogen in Lu is determined by electrical resistance measurements in temperature range of 140-170 K. Disordered hydrogen atoms, which are formed by quenching, migrate to order during annealing in the above temperature range. The rate of the resistance decrease depends on the ordering rate of hydrogen. From the resistance decrease during isothermal annealings, the activation energy of hydrogen migration is determined as 0.43 eV (41.5 kJ mol -1 ). (orig.)

  3. Late night activity regarding stroke codes: LuNAR strokes.

    Science.gov (United States)

    Tafreshi, Gilda; Raman, Rema; Ernstrom, Karin; Rapp, Karen; Meyer, Brett C

    2012-08-01

    There is diurnal variation for cardiac arrest and sudden cardiac death. Stroke may show a similar pattern. We assessed whether strokes presenting during a particular time of day or night are more likely of vascular etiology. To compare emergency department stroke codes arriving between 22:00 and 8:00 hours (LuNAR strokes) vs. others (n-LuNAR strokes). The purpose was to determine if late night strokes are more likely to be true strokes or warrant acute tissue plasminogen activator evaluations. We reviewed prospectively collected cases in the University of California, San Diego Stroke Team database gathered over a four-year period. Stroke codes at six emergency departments were classified based on arrival time. Those arriving between 22:00 and 8:00 hours were classified as LuNAR stroke codes, the remainder were classified as 'n-LuNAR'. Patients were further classified as intracerebral hemorrhage, acute ischemic stroke not receiving tissue plasminogen activator, acute ischemic stroke receiving tissue plasminogen activator, transient ischemic attack, and nonstroke. Categorical outcomes were compared using Fisher's Exact test. Continuous outcomes were compared using Wilcoxon's Rank-sum test. A total of 1607 patients were included in our study, of which, 299 (19%) were LuNAR code strokes. The overall median NIHSS was five, higher in the LuNAR group (n-LuNAR 5, LuNAR 7; P=0·022). There was no overall differences in patient diagnoses between LuNAR and n-LuNAR strokes (P=0·169) or diagnosis of acute ischemic stroke receiving tissue plasminogen activator (n-LuNAR 191 (14·6%), LuNAR 42 (14·0%); P=0·86). Mean arrival to computed tomography scan time was longer during LuNAR hours (n-LuNAR 54·9±76·3 min, LuNAR 62·5±87·7 min; P=0·027). There was no significant difference in 90-day mortality (n-LuNAR 15·0%, LuNAR 13·2%; P=0·45). Our stroke center experience showed no difference in diagnosis of acute ischemic stroke between day and night stroke codes. This

  4. Phase equilibria and crystalline structure of compounds in the Lu-Al and Lu-Cu-Al systems

    International Nuclear Information System (INIS)

    Kuz'ma, Yu.B.; Stel'makhovich, B.M.; Galamushka, L.I.

    1992-01-01

    Phase equilibria and crystal structure of compounds in Lu-Al and Lu-Cu-Al systems were studied. Existence of Lu 2 Al compound having the structure of the PbCl 2 type is ascertained. Diagram of phase equilibria of Lu-Cu-Al system at 870 K is plotted. Compounds Lu 2 (Cu,Al) 17 (the Th 2 Zn 17 type structure), Lu(Cu,Al) 5 (CaCu 5 type structure), Lu 6 (Cu,Al) 23 (Th 6 Mn 23 type structure) and ∼ LuCuAl 2 have been prepared for the first time. Investigation of component interaction in Lu-Cu-Al system shows that the system is similar to previously studied systems Dy-Cu-Al and Er-Cu-Al. The main difference consists in the absence of LuCuAl 3 compound with rhombic structure of the CeNi 2+x Sb 2-x type in the system investigated

  5. High spin K isomeric target of 177mLu

    International Nuclear Information System (INIS)

    Roig, O.; Belier, G.; Daugas, J.-M.; Delbourgo, P.; Maunoury, L.; Meot, V.; Morichon, E.; Sauvestre, J.-E.; Aupiais, J.; Boulin, Y.; Fioni, G.; Letourneau, A.; Marie, F.; Ridikas, D.

    2004-01-01

    The techniques used to produce a 177m Lu (J π =23/2 - ,T 1/2 =160.4 days) target are described in this paper. Firstly, an isotopic separation of an enriched lutetium sample was used to reach a purity of 176 Lu close to 99.993%. Afterwards, the high neutron flux of the Grenoble Institut Laue-Langevin reactor was used to produce the 177m Lu isomer by the 176 Lu(n,γ) reaction. Finally, a chemical separation was performed to extract 10 13 nuclei of 177m Lu. Thanks to this experiment, we have been able to estimate the destruction cross-section of the 177m Lu

  6. Time-dependent transcriptional response of GOT1 human small intestine neuroendocrine tumor after 177Lu[Lu]-octreotate therapy.

    Science.gov (United States)

    Spetz, Johan; Rudqvist, Nils; Langen, Britta; Parris, Toshima Z; Dalmo, Johanna; Schüler, Emil; Wängberg, Bo; Nilsson, Ola; Helou, Khalil; Forssell-Aronsson, Eva

    2018-05-01

    Patients with neuroendocrine tumors expressing somatostatin receptors are often treated with 177 Lu[Lu]-octreotate. Despite being highly effective in animal models, 177 Lu[Lu]-octreotate-based therapies in the clinical setting can be optimized further. The aims of the study were to identify and elucidate possible optimization venues for 177 Lu[Lu]-octreotate tumor therapy by characterizing transcriptional responses in the GOT1 small intestine neuroendocrine tumor model in nude mice. GOT1-bearing female BALB/c nude mice were intravenously injected with 15 MBq 177 Lu[Lu]-octreotate (non-curative amount) or mock-treated with saline solution. Animals were killed 1, 3, 7 or 41 d after injection. Total RNA was extracted from the tumor samples and profiled using Illumina microarray expression analysis. Differentially expressed genes were identified (treated vs. control) and pathway analysis was performed. Distribution of differentially expressed transcripts indicated a time-dependent treatment response in GOT1 tumors after 177 Lu[Lu]-octreotate administration. Regulation of CDKN1A, BCAT1 and PAM at 1 d after injection was compatible with growth arrest as the initial response to treatment. Upregulation of APOE and BAX at 3 d, and ADORA2A, BNIP3, BNIP3L and HSPB1 at 41 d after injection suggests first activation and then inhibition of the intrinsic apoptotic pathway during tumor regression and regrowth, respectively. Transcriptional analysis showed radiation-induced apoptosis as an early response after 177 Lu[Lu]-octreotate administration, followed by pro-survival transcriptional changes in the tumor during the regrowth phase. Time-dependent changes in cell cycle and apoptosis-related processes suggest different time points after radionuclide therapy when tumor cells may be more susceptible to additional treatment, highlighting the importance of timing when administering multiple therapeutic agents. Copyright © 2018 The Authors. Published by Elsevier Inc. All

  7. Sparse Matrices in Frame Theory

    DEFF Research Database (Denmark)

    Lemvig, Jakob; Krahmer, Felix; Kutyniok, Gitta

    2014-01-01

    Frame theory is closely intertwined with signal processing through a canon of methodologies for the analysis of signals using (redundant) linear measurements. The canonical dual frame associated with a frame provides a means for reconstruction by a least squares approach, but other dual frames...... yield alternative reconstruction procedures. The novel paradigm of sparsity has recently entered the area of frame theory in various ways. Of those different sparsity perspectives, we will focus on the situations where frames and (not necessarily canonical) dual frames can be written as sparse matrices...

  8. Diffusion Indexes with Sparse Loadings

    DEFF Research Database (Denmark)

    Kristensen, Johannes Tang

    The use of large-dimensional factor models in forecasting has received much attention in the literature with the consensus being that improvements on forecasts can be achieved when comparing with standard models. However, recent contributions in the literature have demonstrated that care needs...... to the problem by using the LASSO as a variable selection method to choose between the possible variables and thus obtain sparse loadings from which factors or diffusion indexes can be formed. This allows us to build a more parsimonious factor model which is better suited for forecasting compared...... it to be an important alternative to PC....

  9. Sparse Linear Identifiable Multivariate Modeling

    DEFF Research Database (Denmark)

    Henao, Ricardo; Winther, Ole

    2011-01-01

    and bench-marked on artificial and real biological data sets. SLIM is closest in spirit to LiNGAM (Shimizu et al., 2006), but differs substantially in inference, Bayesian network structure learning and model comparison. Experimentally, SLIM performs equally well or better than LiNGAM with comparable......In this paper we consider sparse and identifiable linear latent variable (factor) and linear Bayesian network models for parsimonious analysis of multivariate data. We propose a computationally efficient method for joint parameter and model inference, and model comparison. It consists of a fully...

  10. Programming for Sparse Minimax Optimization

    DEFF Research Database (Denmark)

    Jonasson, K.; Madsen, Kaj

    1994-01-01

    We present an algorithm for nonlinear minimax optimization which is well suited for large and sparse problems. The method is based on trust regions and sequential linear programming. On each iteration, a linear minimax problem is solved for a basic step. If necessary, this is followed...... by the determination of a minimum norm corrective step based on a first-order Taylor approximation. No Hessian information needs to be stored. Global convergence is proved. This new method has been extensively tested and compared with other methods, including two well known codes for nonlinear programming...

  11. Dynamic Representations of Sparse Graphs

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Fagerberg, Rolf

    1999-01-01

    We present a linear space data structure for maintaining graphs with bounded arboricity—a large class of sparse graphs containing e.g. planar graphs and graphs of bounded treewidth—under edge insertions, edge deletions, and adjacency queries. The data structure supports adjacency queries in worst...... case O(c) time, and edge insertions and edge deletions in amortized O(1) and O(c+log n) time, respectively, where n is the number of nodes in the graph, and c is the bound on the arboricity....

  12. RDM lifetime measurement in 167Lu

    International Nuclear Information System (INIS)

    Rohilla, Aman; Gupta, C.K.; Chamoli, S.K.; Singh, R.P.; Muralithar, S.; Ashok Kumar; Govil, I.M.

    2014-01-01

    In this paper we are presenting the experiment performed for measuring lifetime in 167 Lu, which provides the measurement of the structural behavior of the nuclei due to single particle excitation. The enhanced γ-ray detection GDA setup present at IUAC was used and the data was acquired in the singles mode with the condition when any two of the BGO's element fire in coincidence with a Ge detector. The online data acquisition program CANDLE was used for data acquire in conjunction with CAMAC based data acquisition hardware

  13. 176Lu: Cosmic clock or stellar thermometer

    International Nuclear Information System (INIS)

    Ward, R.A.; Beer, H.; Kaeppeler, F.; Wisshak, K.

    1980-12-01

    We quantitatively examine the various experimental and theoretical aspects of the stellar synthesis of the long-lived ground state of 176 Lu (3.6 x 10 10 y). We discuss the various regimes of stellar temperature and free-neutron density in which either: (i) the internal electromagnetic couplings between 176 Lusup(o) and 176 Lusup(m) (3.68 hours) are sufficiently slow that they may be treated as separate nuclei, or (ii) the internal couplings are rapidly able to establish thermal equilibrium between 176 Lusup(o) and 176 Lusup(m). (orig.)

  14. Convergence of the standard RLS method and UDUT factorisation of covariance matrix for solving the algebraic Riccati equation of the DLQR via heuristic approximate dynamic programming

    Science.gov (United States)

    Moraes Rêgo, Patrícia Helena; Viana da Fonseca Neto, João; Ferreira, Ernesto M.

    2015-08-01

    The main focus of this article is to present a proposal to solve, via UDUT factorisation, the convergence and numerical stability problems that are related to the covariance matrix ill-conditioning of the recursive least squares (RLS) approach for online approximations of the algebraic Riccati equation (ARE) solution associated with the discrete linear quadratic regulator (DLQR) problem formulated in the actor-critic reinforcement learning and approximate dynamic programming context. The parameterisations of the Bellman equation, utility function and dynamic system as well as the algebra of Kronecker product assemble a framework for the solution of the DLQR problem. The condition number and the positivity parameter of the covariance matrix are associated with statistical metrics for evaluating the approximation performance of the ARE solution via RLS-based estimators. The performance of RLS approximators is also evaluated in terms of consistence and polarisation when associated with reinforcement learning methods. The used methodology contemplates realisations of online designs for DLQR controllers that is evaluated in a multivariable dynamic system model.

  15. Bayesian Inference Methods for Sparse Channel Estimation

    DEFF Research Database (Denmark)

    Pedersen, Niels Lovmand

    2013-01-01

    This thesis deals with sparse Bayesian learning (SBL) with application to radio channel estimation. As opposed to the classical approach for sparse signal representation, we focus on the problem of inferring complex signals. Our investigations within SBL constitute the basis for the development...... of Bayesian inference algorithms for sparse channel estimation. Sparse inference methods aim at finding the sparse representation of a signal given in some overcomplete dictionary of basis vectors. Within this context, one of our main contributions to the field of SBL is a hierarchical representation...... analysis of the complex prior representation, where we show that the ability to induce sparse estimates of a given prior heavily depends on the inference method used and, interestingly, whether real or complex variables are inferred. We also show that the Bayesian estimators derived from the proposed...

  16. lu Instituut uurib inimõiguste rikkumisi

    Index Scriptorium Estoniae

    2008-01-01

    President Toomas Hendrik Ilvese eestvedamisel asutati 20. sajandi teisel poolel Eestis toimunu põhjalikumaks uurimiseks Eesti Mälu Instituut. Ilmunud ka: Eesti Päevaleht (Stockholm) 14. veebr. 2008, lk. 2, pealk.: Mälu Instituut alustas tegevust; Vaba Eesti Sõna 7. veebr. 2008, lk. 12, pealk.: Under the leadership of President Ilves, the Memory Institute was established

  17. Image fusion using sparse overcomplete feature dictionaries

    Science.gov (United States)

    Brumby, Steven P.; Bettencourt, Luis; Kenyon, Garrett T.; Chartrand, Rick; Wohlberg, Brendt

    2015-10-06

    Approaches for deciding what individuals in a population of visual system "neurons" are looking for using sparse overcomplete feature dictionaries are provided. A sparse overcomplete feature dictionary may be learned for an image dataset and a local sparse representation of the image dataset may be built using the learned feature dictionary. A local maximum pooling operation may be applied on the local sparse representation to produce a translation-tolerant representation of the image dataset. An object may then be classified and/or clustered within the translation-tolerant representation of the image dataset using a supervised classification algorithm and/or an unsupervised clustering algorithm.

  18. Sparse Image Reconstruction in Computed Tomography

    DEFF Research Database (Denmark)

    Jørgensen, Jakob Sauer

    In recent years, increased focus on the potentially harmful effects of x-ray computed tomography (CT) scans, such as radiation-induced cancer, has motivated research on new low-dose imaging techniques. Sparse image reconstruction methods, as studied for instance in the field of compressed sensing...... applications. This thesis takes a systematic approach toward establishing quantitative understanding of conditions for sparse reconstruction to work well in CT. A general framework for analyzing sparse reconstruction methods in CT is introduced and two sets of computational tools are proposed: 1...... contributions to a general set of computational characterization tools. Thus, the thesis contributions help advance sparse reconstruction methods toward routine use in...

  19. Neutron capture reactions on Lu isotopes at DANCE

    CERN Document Server

    Roig, O

    2010-01-01

    The DANCE (Detector for Advanced Neutron Capture Experiments) array located at the Los Alamos national laboratory has been used to obtain the neutron capture cross sections for 175Lu and 176Lu with neutron energies from thermal up to 100 keV. Both isotopes are of current interest for the nucleosynthesis s-process in astrophysics and for applications as in reactor physics or in nuclear medicine. Three targets were used to perform these measurements. One was natLu foil and the other two were isotope-enriched targets of 175Lu and 176Lu. The cross sections are obtained for now through a precise neutron flux determination and a normalization at the thermal neutron cross section value. A comparison with the recent experimental data and the evaluated data of ENDF/B-VII.0 will be presented. In addition, resonances parameters and spin assignments for some resonances will be featured.

  20. When sparse coding meets ranking: a joint framework for learning sparse codes and ranking scores

    KAUST Repository

    Wang, Jim Jing-Yan; Cui, Xuefeng; Yu, Ge; Guo, Lili; Gao, Xin

    2017-01-01

    Sparse coding, which represents a data point as a sparse reconstruction code with regard to a dictionary, has been a popular data representation method. Meanwhile, in database retrieval problems, learning the ranking scores from data points plays

  1. Neural Network for Sparse Reconstruction

    Directory of Open Access Journals (Sweden)

    Qingfa Li

    2014-01-01

    Full Text Available We construct a neural network based on smoothing approximation techniques and projected gradient method to solve a kind of sparse reconstruction problems. Neural network can be implemented by circuits and can be seen as an important method for solving optimization problems, especially large scale problems. Smoothing approximation is an efficient technique for solving nonsmooth optimization problems. We combine these two techniques to overcome the difficulties of the choices of the step size in discrete algorithms and the item in the set-valued map of differential inclusion. In theory, the proposed network can converge to the optimal solution set of the given problem. Furthermore, some numerical experiments show the effectiveness of the proposed network in this paper.

  2. Diffusion Indexes With Sparse Loadings

    DEFF Research Database (Denmark)

    Kristensen, Johannes Tang

    2017-01-01

    The use of large-dimensional factor models in forecasting has received much attention in the literature with the consensus being that improvements on forecasts can be achieved when comparing with standard models. However, recent contributions in the literature have demonstrated that care needs...... to the problem by using the least absolute shrinkage and selection operator (LASSO) as a variable selection method to choose between the possible variables and thus obtain sparse loadings from which factors or diffusion indexes can be formed. This allows us to build a more parsimonious factor model...... in forecasting accuracy and thus find it to be an important alternative to PC. Supplementary materials for this article are available online....

  3. Sparse and stable Markowitz portfolios.

    Science.gov (United States)

    Brodie, Joshua; Daubechies, Ingrid; De Mol, Christine; Giannone, Domenico; Loris, Ignace

    2009-07-28

    We consider the problem of portfolio selection within the classical Markowitz mean-variance framework, reformulated as a constrained least-squares regression problem. We propose to add to the objective function a penalty proportional to the sum of the absolute values of the portfolio weights. This penalty regularizes (stabilizes) the optimization problem, encourages sparse portfolios (i.e., portfolios with only few active positions), and allows accounting for transaction costs. Our approach recovers as special cases the no-short-positions portfolios, but does allow for short positions in limited number. We implement this methodology on two benchmark data sets constructed by Fama and French. Using only a modest amount of training data, we construct portfolios whose out-of-sample performance, as measured by Sharpe ratio, is consistently and significantly better than that of the naïve evenly weighted portfolio.

  4. SPARSE FARADAY ROTATION MEASURE SYNTHESIS

    International Nuclear Information System (INIS)

    Andrecut, M.; Stil, J. M.; Taylor, A. R.

    2012-01-01

    Faraday rotation measure synthesis is a method for analyzing multichannel polarized radio emissions, and it has emerged as an important tool in the study of Galactic and extragalactic magnetic fields. The method requires the recovery of the Faraday dispersion function from measurements restricted to limited wavelength ranges, which is an ill-conditioned deconvolution problem. Here, we discuss a recovery method that assumes a sparse approximation of the Faraday dispersion function in an overcomplete dictionary of functions. We discuss the general case when both thin and thick components are included in the model, and we present the implementation of a greedy deconvolution algorithm. We illustrate the method with several numerical simulations that emphasize the effect of the covered range and sampling resolution in the Faraday depth space, and the effect of noise on the observed data.

  5. Numerical solution of large sparse linear systems

    International Nuclear Information System (INIS)

    Meurant, Gerard; Golub, Gene.

    1982-02-01

    This note is based on one of the lectures given at the 1980 CEA-EDF-INRIA Numerical Analysis Summer School whose aim is the study of large sparse linear systems. The main topics are solving least squares problems by orthogonal transformation, fast Poisson solvers and solution of sparse linear system by iterative methods with a special emphasis on preconditioned conjuguate gradient method [fr

  6. Sparse seismic imaging using variable projection

    NARCIS (Netherlands)

    Aravkin, Aleksandr Y.; Tu, Ning; van Leeuwen, Tristan

    2013-01-01

    We consider an important class of signal processing problems where the signal of interest is known to be sparse, and can be recovered from data given auxiliary information about how the data was generated. For example, a sparse Green's function may be recovered from seismic experimental data using

  7. Production of 177Lu for targeted radionuclide therapy: Available options

    International Nuclear Information System (INIS)

    Dah, Ashutosh; Pillai, Maroor Raghavan Ambikalmajan; Knapp, Furn F. Jr.

    2015-01-01

    This review provides a comprehensive summary of the production of 177 Lu to meet expected future research and clinical demands. Availability of options represents the cornerstone for sustainable growth for the routine production of adequate activity levels of 177 Lu having the required quality for preparation of a variety of 177 Lu-labeled radiopharmaceuticals. The tremendous prospects associated with production of 177 Lu for use in targeted radionuclide therapy (TRT) dictate that a holistic consideration should evaluate all governing factors that determine its success. While both “direct” and “indirect” reactor production routes offer the possibility for sustainable 177 Lu availability, there are several issues and challenges that must be considered to realize the full potential of these production strategies. This article presents a mini review on the latest developments, current status, key challenges and possibilities for the near future. A broad understanding and discussion of the issues associated with 177 Lu production and processing approaches would not only ensure sustained growth and future expansion for the availability and use of 177 Lu-labeled radiopharmaceuticals, but also help future developments

  8. High spin states in 162Lu

    International Nuclear Information System (INIS)

    Gupta, S.L.; Pancholi, S.C.; Juneja, P.; Mehta, D.; Kumar, A.; Bhowmik, R.K.; Muralithar, S.; Rodrigues, G.; Singh, R.P.

    1997-01-01

    An experimental investigation of the odd-odd 162 Lu nucleus, following the 148 Sm( 19 F,5n) reaction at beam energy E lab =112MeV, has been performed through in-beam gamma-ray spectroscopy. It revealed three signature-split bands. The yrast band based on πh 11/2 circle-times νi 13/2 configuration exhibits anomalous signature splitting (the unfavored signature Routhian lying lower than the favored one) whose magnitude Δe ' ∼25keV, is considerably reduced in contrast to sizable normal signature splitting Δe ' ∼125 and 60 keV observed in the yrast πh 11/2 bands of the neighboring odd-A 161,163 Lu nuclei, respectively. The signature inversion in this band occurs at spin ∼20ℎ (frequency=0.37MeV). The second signature-split band, observed above the band crossing associated with the alignment of a pair of i 13/2 quasineutrons, is a band based on the four-quasiparticle [πh 11/2 [523]7/2 - times νh 9/2 [521]3/2 - times(νi 13/2 ) 2 ], i.e., EABA p (B p ), configuration. The third signature-split band is also likely to be a four-quasiparticle band with configuration similar to the second band but involving F quasineutron, i.e., FABA p (B p ). The experimental results are discussed in comparison with the existing data in the neighboring nuclei and in the framework of the cranking shell model. copyright 1997 The American Physical Society

  9. Orthogonal sparse linear discriminant analysis

    Science.gov (United States)

    Liu, Zhonghua; Liu, Gang; Pu, Jiexin; Wang, Xiaohong; Wang, Haijun

    2018-03-01

    Linear discriminant analysis (LDA) is a linear feature extraction approach, and it has received much attention. On the basis of LDA, researchers have done a lot of research work on it, and many variant versions of LDA were proposed. However, the inherent problem of LDA cannot be solved very well by the variant methods. The major disadvantages of the classical LDA are as follows. First, it is sensitive to outliers and noises. Second, only the global discriminant structure is preserved, while the local discriminant information is ignored. In this paper, we present a new orthogonal sparse linear discriminant analysis (OSLDA) algorithm. The k nearest neighbour graph is first constructed to preserve the locality discriminant information of sample points. Then, L2,1-norm constraint on the projection matrix is used to act as loss function, which can make the proposed method robust to outliers in data points. Extensive experiments have been performed on several standard public image databases, and the experiment results demonstrate the performance of the proposed OSLDA algorithm.

  10. Spectra of sparse random matrices

    International Nuclear Information System (INIS)

    Kuehn, Reimer

    2008-01-01

    We compute the spectral density for ensembles of sparse symmetric random matrices using replica. Our formulation of the replica-symmetric ansatz shares the symmetries of that suggested in a seminal paper by Rodgers and Bray (symmetry with respect to permutation of replica and rotation symmetry in the space of replica), but uses a different representation in terms of superpositions of Gaussians. It gives rise to a pair of integral equations which can be solved by a stochastic population-dynamics algorithm. Remarkably our representation allows us to identify pure-point contributions to the spectral density related to the existence of normalizable eigenstates. Our approach is not restricted to matrices defined on graphs with Poissonian degree distribution. Matrices defined on regular random graphs or on scale-free graphs, are easily handled. We also look at matrices with row constraints such as discrete graph Laplacians. Our approach naturally allows us to unfold the total density of states into contributions coming from vertices of different local coordinations and an example of such an unfolding is presented. Our results are well corroborated by numerical diagonalization studies of large finite random matrices

  11. Discriminative sparse coding on multi-manifolds

    KAUST Repository

    Wang, J.J.-Y.; Bensmail, H.; Yao, N.; Gao, Xin

    2013-01-01

    Sparse coding has been popularly used as an effective data representation method in various applications, such as computer vision, medical imaging and bioinformatics. However, the conventional sparse coding algorithms and their manifold-regularized variants (graph sparse coding and Laplacian sparse coding), learn codebooks and codes in an unsupervised manner and neglect class information that is available in the training set. To address this problem, we propose a novel discriminative sparse coding method based on multi-manifolds, that learns discriminative class-conditioned codebooks and sparse codes from both data feature spaces and class labels. First, the entire training set is partitioned into multiple manifolds according to the class labels. Then, we formulate the sparse coding as a manifold-manifold matching problem and learn class-conditioned codebooks and codes to maximize the manifold margins of different classes. Lastly, we present a data sample-manifold matching-based strategy to classify the unlabeled data samples. Experimental results on somatic mutations identification and breast tumor classification based on ultrasonic images demonstrate the efficacy of the proposed data representation and classification approach. 2013 The Authors. All rights reserved.

  12. Discriminative sparse coding on multi-manifolds

    KAUST Repository

    Wang, J.J.-Y.

    2013-09-26

    Sparse coding has been popularly used as an effective data representation method in various applications, such as computer vision, medical imaging and bioinformatics. However, the conventional sparse coding algorithms and their manifold-regularized variants (graph sparse coding and Laplacian sparse coding), learn codebooks and codes in an unsupervised manner and neglect class information that is available in the training set. To address this problem, we propose a novel discriminative sparse coding method based on multi-manifolds, that learns discriminative class-conditioned codebooks and sparse codes from both data feature spaces and class labels. First, the entire training set is partitioned into multiple manifolds according to the class labels. Then, we formulate the sparse coding as a manifold-manifold matching problem and learn class-conditioned codebooks and codes to maximize the manifold margins of different classes. Lastly, we present a data sample-manifold matching-based strategy to classify the unlabeled data samples. Experimental results on somatic mutations identification and breast tumor classification based on ultrasonic images demonstrate the efficacy of the proposed data representation and classification approach. 2013 The Authors. All rights reserved.

  13. Blood clearance and occupational exposure for {sup 177}Lu-DOTATATE compared to {sup 177}Lu-PSMA radionuclide therapy

    Energy Technology Data Exchange (ETDEWEB)

    Abuqbeitah, Mohammad; Demir, Mustafa; Uslu-Besli, Lebriz; Yeyin, Nami; Soenmezoglu, Kerim [Istanbul University, Department of Nuclear Medicine, Cerrahpasa Faculty of Medicine, Istanbul (Turkey)

    2018-03-15

    The main target of this work is to examine blood clearance and external exposure for {sup 177}Lu-DOTATATE compared with new emerging {sup 177}Lu-PSMA therapy. Blood clearance and radiation exposure of 31 patients treated with 5.5 ± 1.1 GBq {sup 177}Lu-DOTATATE were compared to those of 23 patients treated with 7.4 GBq {sup 177}Lu-PSMA. Dose rates were measured at several distances and time points up to 120 h after treatment. Blood samples were collected conjunctively after infusion. Caregiver's cumulative dose was measured by means of an OSL (optically stimulated luminescence) dosimeter for 4-5 days and medical staff's dose was also estimated using electronic personal dosimeters. Finger dose was determined via ring TLD (Thermoluminescence Dosimeter) for radiopharmacists and nurses. Dose rates due to {sup 177}Lu-DOTATATE at a distance of 1 m, 4 h and 6 h after infusion, were 3.0 ± 2.8 and 2 ± 1.9 μSv/(h GBq), respectively, while those due to {sup 177}Lu-PSMA were 3.1 ± 0.8 and 2.2 ± 0.9 μSv/(h GBq). Total effective dose of 17 caregivers was 100-200 μSv for {sup 177}Lu-DOTATATE therapy. Mean effective doses to nurses and radiopharmacists were 5 and 4 μSv per patient, respectively, while those for physicists and physicians were 2 μSv per patient. For {sup 177}Lu-DOTATATE, effective half-life in blood and early elimination phase were 0.31 ± 0.13 and 4.5 ± 1 h, while they were found as 0.4 ± 0.1 and 5 ± 1 h, respectively, for {sup 177}Lu-PSMA. The first micturition time following {sup 177}Lu-DOTATATE infusion was noted after 36 ± 14 min, while the second and third voiding times were after 74 ± 9 and 128 ± 41 min, respectively. It is concluded that blood clearance and radiation exposure for {sup 177}Lu-DOTATATE are very similar to those for {sup 177}Lu-PSMA, and both treatment modalities are reasonably reliable for outpatient treatment, since the mean dose rate [2.1 μSv/(h GBq)] decreased below the dose rate that allows release of the patient

  14. Enhancing Scalability of Sparse Direct Methods

    International Nuclear Information System (INIS)

    Li, Xiaoye S.; Demmel, James; Grigori, Laura; Gu, Ming; Xia, Jianlin; Jardin, Steve; Sovinec, Carl; Lee, Lie-Quan

    2007-01-01

    TOPS is providing high-performance, scalable sparse direct solvers, which have had significant impacts on the SciDAC applications, including fusion simulation (CEMM), accelerator modeling (COMPASS), as well as many other mission-critical applications in DOE and elsewhere. Our recent developments have been focusing on new techniques to overcome scalability bottleneck of direct methods, in both time and memory. These include parallelizing symbolic analysis phase and developing linear-complexity sparse factorization methods. The new techniques will make sparse direct methods more widely usable in large 3D simulations on highly-parallel petascale computers

  15. Regression with Sparse Approximations of Data

    DEFF Research Database (Denmark)

    Noorzad, Pardis; Sturm, Bob L.

    2012-01-01

    We propose sparse approximation weighted regression (SPARROW), a method for local estimation of the regression function that uses sparse approximation with a dictionary of measurements. SPARROW estimates the regression function at a point with a linear combination of a few regressands selected...... by a sparse approximation of the point in terms of the regressors. We show SPARROW can be considered a variant of \\(k\\)-nearest neighbors regression (\\(k\\)-NNR), and more generally, local polynomial kernel regression. Unlike \\(k\\)-NNR, however, SPARROW can adapt the number of regressors to use based...

  16. Sparse adaptive filters for echo cancellation

    CERN Document Server

    Paleologu, Constantin

    2011-01-01

    Adaptive filters with a large number of coefficients are usually involved in both network and acoustic echo cancellation. Consequently, it is important to improve the convergence rate and tracking of the conventional algorithms used for these applications. This can be achieved by exploiting the sparseness character of the echo paths. Identification of sparse impulse responses was addressed mainly in the last decade with the development of the so-called ``proportionate''-type algorithms. The goal of this book is to present the most important sparse adaptive filters developed for echo cancellati

  17. Technique detection software for Sparse Matrices

    Directory of Open Access Journals (Sweden)

    KHAN Muhammad Taimoor

    2009-12-01

    Full Text Available Sparse storage formats are techniques for storing and processing the sparse matrix data efficiently. The performance of these storage formats depend upon the distribution of non-zeros, within the matrix in different dimensions. In order to have better results we need a technique that suits best the organization of data in a particular matrix. So the decision of selecting a better technique is the main step towards improving the system's results otherwise the efficiency can be decreased. The purpose of this research is to help identify the best storage format in case of reduced storage size and high processing efficiency for a sparse matrix.

  18. Massive Asynchronous Parallelization of Sparse Matrix Factorizations

    Energy Technology Data Exchange (ETDEWEB)

    Chow, Edmond [Georgia Inst. of Technology, Atlanta, GA (United States)

    2018-01-08

    Solving sparse problems is at the core of many DOE computational science applications. We focus on the challenge of developing sparse algorithms that can fully exploit the parallelism in extreme-scale computing systems, in particular systems with massive numbers of cores per node. Our approach is to express a sparse matrix factorization as a large number of bilinear constraint equations, and then solving these equations via an asynchronous iterative method. The unknowns in these equations are the matrix entries of the factorization that is desired.

  19. SWGELLA DYSENTERIAE TYPE 1 IN KwAZuLU-NATAL

    African Journals Online (AJOL)

    -control. 1995: 15. ure co. LABORATORY SURV~ILLAN.CEOF. SWGELLA DYSENTERIAE TYPE 1 IN. KwAZuLU- ... freeze-dried quality-eontrol specimens were prepared containing ... (National Committee for Clinical Laboratory Standards,.

  20. Laulupidu, kultuurimälu ja rahvuslik identiteet / Marge Allandi

    Index Scriptorium Estoniae

    Allandi, Marge

    2012-01-01

    Artikkel on koostatud Marge Allandi magistritöö "Laulupidu kui rituaal: Eesti üldlaulupeod rahvusliku kultuurimälu ja identiteedi kujundajate ja kandjatena" põhjal, mis kaitsti Tallinna Ülikooli Eesti Humanitaarinstituudis 2009. aastal

  1. Alternative method to determine Specific Activity of (177)Lu by HPLC.

    Science.gov (United States)

    Breeman, Wouter A P; de Zanger, Rory M S; Chan, Ho Sze; de Blois, Erik

    2015-01-01

    Peptide Receptor Radionuclide Therapy (PRRT) with (177)Lu-DOTA-peptides requires (177)Lu with high specific activity (SA) and values >740 GBq (177)Lu per mg Lu to maximise the atom% of (177)Lu over total Lu. Vendors provide SA values which are based on activity and mass of the target, whereas due to "burn-up" of target, these SA values are not accurate. For a radiochemist the SA of (177)Lu is of interest prior to radiolabeling. An alternative method to determine SA was developed by HPLC, which includes a metal titration of a known amount of DOTA-peptide with a known amount of activity ((177)Lu), and a unknown amount of metal ((177+nat)Lu). Based on an HPLC separation of radiometal-DOTA-peptide and DOTA-peptide, and the concordant ratio of these components the metal content ((177+nat)Lu) can be calculated, and eventually the SA of (177)Lu can be accurately determined. These experimentally determined SA values exceeded the estimated values provided by vendors by 27 ± 16%, (range 6-73 %). The deviation of SA values for samples from the same Lu batch was <2% (n ≥ 10). the SA of (177)Lu is apparently often higher as stated by vendors in comparison to the experimentally determined actual values. For this reason, the SA of (177)Lu-DOTA-TATE and other Lu-DOTA-peptides could be increased accordingly.

  2. Experimental half-life determination of 176Lu

    International Nuclear Information System (INIS)

    Kossert, Karsten; Jörg, Gerhard; Gostomski, Christoph Lierse v.

    2013-01-01

    The half-life of the naturally occurring long-lived rare earth isotope 176 Lu was determined by a combination of highly sophisticated experimental procedures in order to further improve the reliability and the precision of literature data. The amount of lutetium in the samples was determined by inductively coupled plasma optical emission spectrometry (ICP-OES) using a NIST reference standard. The isotopic ratio N( 176 Lu)/N(Lu) in the samples was measured by means of inductively coupled plasma high resolution mass spectrometry (ICP-HRMS). The activity divided by the mass of Lu was determined by applying liquid scintillation (LS) counting. The LS counting efficiency of the beta/gamma emitter 176 Lu was determined with the CIEMAT/NIST efficiency tracing technique with low uncertainty. The influences of colour quenching and background effects are discussed in this paper. The half-life was found to be 3.640(35)×10 10 y. The result is in good agreement with other evaluations and the relative standard uncertainty of 0.95% is among the lowest of previously published data. - Highlights: • The half-life of 176 Lu was determined by ICP-OES, ICP-HRMS and LSC. • The LSC efficiency was determined with the CIEMAT/NIST method. • The half-life was found to be 3.640(35)×10 10 y

  3. Exploiting fine-grain parallelism in recursive LU factorization

    KAUST Repository

    Dongarra, Jack

    2012-01-01

    The LU factorization is an important numerical algorithm for solving system of linear equations. This paper proposes a novel approach for computing the LU factorization in parallel on multicore architectures. It improves the overall performance and also achieves the numerical quality of the standard LU factorization with partial pivoting. While the update of the trailing submatrix is computationally intensive and highly parallel, the inherently problematic portion of the LU factorization is the panel factorization due to its memory-bound characteristic and the atomicity of selecting the appropriate pivots. We remedy this in our new approach to LU factorization of (narrow and tall) panel submatrices. We use a parallel fine-grained recursive formulation of the factorization. It is based on conflict-free partitioning of the data and lock-less synchronization mechanisms. Our implementation lets the overall computation naturally flow with limited contention. Our recursive panel factorization provides the necessary performance increase for the inherently problematic portion of the LU factorization of square matrices. A large panel width results in larger Amdahl\\'s fraction as our experiments have revealed which is consistent with related efforts. The performance results of our implementation reveal superlinear speedup and far exceed what can be achieved with equivalent MKL and/or LAPACK routines. © 2012 The authors and IOS Press. All rights reserved.

  4. Structure-based bayesian sparse reconstruction

    KAUST Repository

    Quadeer, Ahmed Abdul; Al-Naffouri, Tareq Y.

    2012-01-01

    Sparse signal reconstruction algorithms have attracted research attention due to their wide applications in various fields. In this paper, we present a simple Bayesian approach that utilizes the sparsity constraint and a priori statistical

  5. Biclustering via Sparse Singular Value Decomposition

    KAUST Repository

    Lee, Mihee

    2010-02-16

    Sparse singular value decomposition (SSVD) is proposed as a new exploratory analysis tool for biclustering or identifying interpretable row-column associations within high-dimensional data matrices. SSVD seeks a low-rank, checkerboard structured matrix approximation to data matrices. The desired checkerboard structure is achieved by forcing both the left- and right-singular vectors to be sparse, that is, having many zero entries. By interpreting singular vectors as regression coefficient vectors for certain linear regressions, sparsity-inducing regularization penalties are imposed to the least squares regression to produce sparse singular vectors. An efficient iterative algorithm is proposed for computing the sparse singular vectors, along with some discussion of penalty parameter selection. A lung cancer microarray dataset and a food nutrition dataset are used to illustrate SSVD as a biclustering method. SSVD is also compared with some existing biclustering methods using simulated datasets. © 2010, The International Biometric Society.

  6. Tunable Sparse Network Coding for Multicast Networks

    DEFF Research Database (Denmark)

    Feizi, Soheil; Roetter, Daniel Enrique Lucani; Sørensen, Chres Wiant

    2014-01-01

    This paper shows the potential and key enabling mechanisms for tunable sparse network coding, a scheme in which the density of network coded packets varies during a transmission session. At the beginning of a transmission session, sparsely coded packets are transmitted, which benefits decoding...... complexity. At the end of a transmission, when receivers have accumulated degrees of freedom, coding density is increased. We propose a family of tunable sparse network codes (TSNCs) for multicast erasure networks with a controllable trade-off between completion time performance to decoding complexity...... a mechanism to perform efficient Gaussian elimination over sparse matrices going beyond belief propagation but maintaining low decoding complexity. Supporting simulation results are provided showing the trade-off between decoding complexity and completion time....

  7. SPARSE ELECTROMAGNETIC IMAGING USING NONLINEAR LANDWEBER ITERATIONS

    KAUST Repository

    Desmal, Abdulla; Bagci, Hakan

    2015-01-01

    minimization problem is solved using nonlinear Landweber iterations, where at each iteration a thresholding function is applied to enforce the sparseness-promoting L0/L1-norm constraint. The thresholded nonlinear Landweber iterations are applied to several two

  8. Learning sparse generative models of audiovisual signals

    OpenAIRE

    Monaci, Gianluca; Sommer, Friedrich T.; Vandergheynst, Pierre

    2008-01-01

    This paper presents a novel framework to learn sparse represen- tations for audiovisual signals. An audiovisual signal is modeled as a sparse sum of audiovisual kernels. The kernels are bimodal functions made of synchronous audio and video components that can be positioned independently and arbitrarily in space and time. We design an algorithm capable of learning sets of such audiovi- sual, synchronous, shift-invariant functions by alternatingly solving a coding and a learning pr...

  9. Hyperspectral Unmixing with Robust Collaborative Sparse Regression

    Directory of Open Access Journals (Sweden)

    Chang Li

    2016-07-01

    Full Text Available Recently, sparse unmixing (SU of hyperspectral data has received particular attention for analyzing remote sensing images. However, most SU methods are based on the commonly admitted linear mixing model (LMM, which ignores the possible nonlinear effects (i.e., nonlinearity. In this paper, we propose a new method named robust collaborative sparse regression (RCSR based on the robust LMM (rLMM for hyperspectral unmixing. The rLMM takes the nonlinearity into consideration, and the nonlinearity is merely treated as outlier, which has the underlying sparse property. The RCSR simultaneously takes the collaborative sparse property of the abundance and sparsely distributed additive property of the outlier into consideration, which can be formed as a robust joint sparse regression problem. The inexact augmented Lagrangian method (IALM is used to optimize the proposed RCSR. The qualitative and quantitative experiments on synthetic datasets and real hyperspectral images demonstrate that the proposed RCSR is efficient for solving the hyperspectral SU problem compared with the other four state-of-the-art algorithms.

  10. radiolabeling of DOTA-substance P with 177Lu and biodistribution of 177Lu-DOTA-substance P

    International Nuclear Information System (INIS)

    Liang Jixin; Li Hongyu; Xiang Xueqin; Luo Zhifu; Luo Hongyi; Hu Liansheng; Chen Yang; Zhuang Ling; Deng Xinrong

    2012-01-01

    The aim of this project is to evaluate the biodistribution of 177 Lu-DOTA-SP in normal mice and in PANC-1 tumor bearing nude mice and to pave the way for its potentially medical application. In this study, 177 Lu-DOTA-SP was successfully prepared with labeling yield of greater than 90% at optimized conditions and more than 98% of radiochemical purity after C18 Sep-Pak purification. 177 Lu-DOTA-SP showed good stability in saline and in 5% serum while it decomposed slowly in 10% serum. Biodistribution studies in normal mice showed high uptake of 177 Lu-DOTA-SP in the kidneys, indicating the excretion mainly by renal pathway. In addition, 177 Lu-DOTA-SP was washed out from the blood quickly. Bio- distribution of 177 Lu-DOTA-SP in PANC-1 tumor bearing mice showed higher uptake in pancreatic tumor than that in normal pancreas, indicating the presence of NK-1 receptors in PANC-1 pancreatic tumor. However, from SPECT image, no radioactivity accumulation was observed in PANC-1 tumor. Further evaluation is needed to confirm its potential application for radiotherapy of pancreatic cancers. (authors)

  11. Adhesive activity of Lu glycoproteins is regulated by interaction with spectrin

    Energy Technology Data Exchange (ETDEWEB)

    An, Xiuli; Gauthier, Emilie; Zhang, Xihui; Guo, Xinhua; Anstee, David; Mohandas, Narla; Anne Chasis, Joel

    2008-03-18

    The Lutheran (Lu) and Lu(v13) blood group glycoproteins function as receptors for extracellular matrix laminins. Lu and Lu(v13) are linked to the erythrocyte cytoskeleton through a direct interaction with spectrin. However, neither the molecular basis of the interaction nor its functional consequences have previously been delineated. In the present study, we defined the binding motifs of Lu and Lu(v13) on spectrin and identified a functional role for this interaction. We found that the cytoplasmic domains of both Lu and Lu(v13) bound to repeat 4 of the spectrin chain. The interaction of full-length spectrin dimer to Lu and Lu(v13) was inhibited by repeat 4 of {alpha}-spectrin. Further, resealing of this repeat peptide into erythrocytes led to weakened Lu-cytoskeleton interaction as demonstrated by increased detergent extractability of Lu. Importantly, disruption of the Lu-spectrin linkage was accompanied by enhanced cell adhesion to laminin. We conclude that the interaction of the Lu cytoplasmic tail with the cytoskeleton regulates its adhesive receptor function.

  12. Comparison of Spectral and Scintillation Properties of LuAP:Ce and LuAP:Ce,Sc Single Crystals

    Science.gov (United States)

    Petrosyan, Ashot G.; Derdzyan, Marina; Ovanesyan, Karine; Shirinyan, Grigori; Lecoq, Paul; Auffray, Etiennette; Kronberger, Matthias; Frisch, Benjamin; Pedrini, Christian; Dujardin, Christophe

    2009-10-01

    Scintillation properties of LuAP:Ce and LuAP:Ce,Sc crystal series were studied under excitation by gamma-rays from a 137Cs source. Both series demonstrated comparable optical quality in terms of underlying absorption at 260 nm, slope of the optical edge and transmission in the range of emission. The light yield of LuAP:Ce crystals measured in 0.2 cm times 0.2 cm times 0.8 cm pixels increases linearly with the Ce concentration reaching at 0.58 at. % 6448 plusmn 322 ph/MeV and 9911 plusmn 496 ph/MeV in the long and in the short directions respectively (the light yield ratio is 65%) and shows no sign of light saturation. The energy resolution is found to depend, among other factors, on the uniformity of Ce concentration within the pixels and is improved to 7.1 plusmn 0.4% (I = 0.2 cm), 9.5 plusmn 0.5% (I = 0.8 cm). Intentional co-doping with Sc + ions was tested and resulted in increase of the Ce distribution coefficient to about 0.3. This enabled to increase the concentration of Ce in LuAP:Ce,Sc crystals up to 0.7 at. %, while conserving high optical quality. In contrast to LuAP:Ce, the light yield in LuAP:Ce,Sc crystals does not increase with Ce concentration, the photo peak being gradually suppressed. The involved mechanisms are discussed basing on measurements of the unit cell volumes, Ce concentration uniformity, x-ray rocking spectra, absorption spectra of pure and variously doped LuAP crystals, and emission spectra under different excitations.

  13. When sparse coding meets ranking: a joint framework for learning sparse codes and ranking scores

    KAUST Repository

    Wang, Jim Jing-Yan

    2017-06-28

    Sparse coding, which represents a data point as a sparse reconstruction code with regard to a dictionary, has been a popular data representation method. Meanwhile, in database retrieval problems, learning the ranking scores from data points plays an important role. Up to now, these two problems have always been considered separately, assuming that data coding and ranking are two independent and irrelevant problems. However, is there any internal relationship between sparse coding and ranking score learning? If yes, how to explore and make use of this internal relationship? In this paper, we try to answer these questions by developing the first joint sparse coding and ranking score learning algorithm. To explore the local distribution in the sparse code space, and also to bridge coding and ranking problems, we assume that in the neighborhood of each data point, the ranking scores can be approximated from the corresponding sparse codes by a local linear function. By considering the local approximation error of ranking scores, the reconstruction error and sparsity of sparse coding, and the query information provided by the user, we construct a unified objective function for learning of sparse codes, the dictionary and ranking scores. We further develop an iterative algorithm to solve this optimization problem.

  14. The Bad Berka dose protocol: comparative results of dosimetry in peptide receptor radionuclide therapy using (177)Lu-DOTATATE, (177)Lu-DOTANOC, and (177)Lu-DOTATOC.

    Science.gov (United States)

    Schuchardt, Christiane; Kulkarni, Harshad R; Prasad, Vikas; Zachert, Carolin; Müller, Dirk; Baum, Richard P

    2013-01-01

    The objective of this study is to analyze the in vivo behavior of the (177)Lu-labeled peptides DOTATATE, DOTANOC, and DOTATOC used for peptide receptor radionuclide therapy (PRRNT) of neuroendocrine tumors (NETs), by measuring organ and tumor kinetics and by performing dosimetric calculations. Two hundred fifty-three patients (group 1) with metastasized NET who underwent PRRNT were examined. Out of these, 185 patients received (177)Lu-DOTATATE, 9 were treated with (177)Lu-DOTANOC, and 59 with (177)Lu-DOTATOC. Additionally, 25 patients receiving, in consecutive PRRNT cycles, DOTATATE followed by DOTATOC (group 2) and 3 patients receiving DOTATATE and DOTANOC (group 3) were analyzed. Dosimetric calculations (according to MIRD scheme) were performed using OLINDA software. In group 1, DOTATOC exhibited the lowest and DOTANOC the highest uptake and therefore mean absorbed dose in normal organs (whole body, kidney, and spleen). In group 2, there was a significant difference between DOTATATE and DOTATOC concerning kinetics and normal organ doses. (177)Lu-DOTATOC had the lowest uptake/dose delivered to normal organs and highest tumor-to-kidney ratio. There were no significant differences between the three peptides concerning tumor kinetics and mean absorbed tumor dose. The study demonstrates a correlation between high affinity of DOTANOC in vitro and high uptake in normal organs/whole body in vivo, resulting in a higher whole-body dose. DOTATOC exhibited the lowest uptake and dose delivered to normal tissues and the best tumor-to-kidney ratio. Due to large interpatient variability, individual dosimetry should be performed for each therapy cycle.

  15. Sparse Learning with Stochastic Composite Optimization.

    Science.gov (United States)

    Zhang, Weizhong; Zhang, Lijun; Jin, Zhongming; Jin, Rong; Cai, Deng; Li, Xuelong; Liang, Ronghua; He, Xiaofei

    2017-06-01

    In this paper, we study Stochastic Composite Optimization (SCO) for sparse learning that aims to learn a sparse solution from a composite function. Most of the recent SCO algorithms have already reached the optimal expected convergence rate O(1/λT), but they often fail to deliver sparse solutions at the end either due to the limited sparsity regularization during stochastic optimization (SO) or due to the limitation in online-to-batch conversion. Even when the objective function is strongly convex, their high probability bounds can only attain O(√{log(1/δ)/T}) with δ is the failure probability, which is much worse than the expected convergence rate. To address these limitations, we propose a simple yet effective two-phase Stochastic Composite Optimization scheme by adding a novel powerful sparse online-to-batch conversion to the general Stochastic Optimization algorithms. We further develop three concrete algorithms, OptimalSL, LastSL and AverageSL, directly under our scheme to prove the effectiveness of the proposed scheme. Both the theoretical analysis and the experiment results show that our methods can really outperform the existing methods at the ability of sparse learning and at the meantime we can improve the high probability bound to approximately O(log(log(T)/δ)/λT).

  16. In-place sparse suffix sorting

    DEFF Research Database (Denmark)

    Prezza, Nicola

    2018-01-01

    information regarding the lexicographical order of a size-b subset of all n text suffixes is often needed. Such information can be stored space-efficiently (in b words) in the sparse suffix array (SSA). The SSA and its relative sparse LCP array (SLCP) can be used as a space-efficient substitute of the sparse...... suffix tree. Very recently, Gawrychowski and Kociumaka [11] showed that the sparse suffix tree (and therefore SSA and SLCP) can be built in asymptotically optimal O(b) space with a Monte Carlo algorithm running in O(n) time. The main reason for using the SSA and SLCP arrays in place of the sparse suffix...... tree is, however, their reduced space of b words each. This leads naturally to the quest for in-place algorithms building these arrays. Franceschini and Muthukrishnan [8] showed that the full suffix array can be built in-place and in optimal running time. On the other hand, finding sub-quadratic in...

  17. Scalable group level probabilistic sparse factor analysis

    DEFF Research Database (Denmark)

    Hinrich, Jesper Løve; Nielsen, Søren Føns Vind; Riis, Nicolai Andre Brogaard

    2017-01-01

    Many data-driven approaches exist to extract neural representations of functional magnetic resonance imaging (fMRI) data, but most of them lack a proper probabilistic formulation. We propose a scalable group level probabilistic sparse factor analysis (psFA) allowing spatially sparse maps, component...... pruning using automatic relevance determination (ARD) and subject specific heteroscedastic spatial noise modeling. For task-based and resting state fMRI, we show that the sparsity constraint gives rise to components similar to those obtained by group independent component analysis. The noise modeling...... shows that noise is reduced in areas typically associated with activation by the experimental design. The psFA model identifies sparse components and the probabilistic setting provides a natural way to handle parameter uncertainties. The variational Bayesian framework easily extends to more complex...

  18. SPARSE ELECTROMAGNETIC IMAGING USING NONLINEAR LANDWEBER ITERATIONS

    KAUST Repository

    Desmal, Abdulla

    2015-07-29

    A scheme for efficiently solving the nonlinear electromagnetic inverse scattering problem on sparse investigation domains is described. The proposed scheme reconstructs the (complex) dielectric permittivity of an investigation domain from fields measured away from the domain itself. Least-squares data misfit between the computed scattered fields, which are expressed as a nonlinear function of the permittivity, and the measured fields is constrained by the L0/L1-norm of the solution. The resulting minimization problem is solved using nonlinear Landweber iterations, where at each iteration a thresholding function is applied to enforce the sparseness-promoting L0/L1-norm constraint. The thresholded nonlinear Landweber iterations are applied to several two-dimensional problems, where the ``measured\\'\\' fields are synthetically generated or obtained from actual experiments. These numerical experiments demonstrate the accuracy, efficiency, and applicability of the proposed scheme in reconstructing sparse profiles with high permittivity values.

  19. In vivo red cell destruction by anti-Lu6

    International Nuclear Information System (INIS)

    Issitt, P.D.; Valinsky, J.E.; Marsh, W.L.; DiNapoli, J.; Gutgsell, N.S.

    1990-01-01

    An example is presented of an IgG1, anti-Lu6, that reacted by indirect antiglobulin test and was capable of destroying antigen-positive red cells in vivo. Two methods for the measurement of red cell survival, 51 Cr labeling and flow cytometry, gave the same result: 20 percent of the test dose of Lu:6 red cells was destroyed in the first hour after injection and 80 percent in the first 24 hours. The clinical relevance of the antibody was correctly predicted by an in vitro monocyte monolayer assay. The finding that this example of anti-Lu6 was clinically significant should not be taken to mean that all antibodies directed against high-incidence Lutheran and Lutheran system-related antigens will behave similarly. When such antibodies are encountered, in vivo and/or in vitro studies to assess their clinical significance are necessary before rare blood is used for transfusion

  20. Surface magnetic phase transitions in Dy/Lu superlattices

    International Nuclear Information System (INIS)

    Goff, J.P.; Sarthour, R.S.; Micheletti, C.; Langridge, S.; Wilkins, C.J.T.; Ward, R.C.C.; Wells, M.R.

    1999-01-01

    Dy/Lu superlattices comprising ferromagnetic Dy blocks coupled antiferromagnetically across the Lu blocks may be modelled as a chain of XY spins with antiferromagnetic exchange and six-fold anisotropy. We have calculated the stable magnetic phases for the cases of large anisotropy and a field applied along an easy direction. For an infinite chain an intermediate phase (1, 5,...) is predicted, where the notation gives the angle between the moment and the applied field in units of π/3. Furthermore, the effects of surface reconstruction are determined for finite chains. A [Dy 20 Lu 12 ] 20 superlattice has been studied using bulk magnetization and polarized neutron reflectivity. The (1, 5,...) phase has been identified and the results provide direct evidence in support of the theoretical predictions. Dipolar forces are shown to account for the magnitude of the observed exchange coupling. (Copyright (c) 1999 Elsevier Science B.V., Amsterdam. All rights reserved.)

  1. Proton Radioactivity Measurements at HRIBF: Ho, Lu, and Tm Isotopes

    International Nuclear Information System (INIS)

    Akovali, Y.; Batchelder, J.C.; Bingham, C.R.; Davinson, T.; Ginter, T.N.; Gross, C.J.; Grzywacz, R.; Hamilton, J.H.; Janas, Z.; Karny, M.; Kim, S.H.; MacDonald, B.D.; Mas, J.F.; McConnell, J.W.; Piechaczek, A.; Ressler, J.J.; Rykaczewski, K.; Slinger, R.C.; Szerypo, J.; Toth, K.S.; Weintraub, W.; Woods, P.J.; Yu, C.-H.; Zganjar, E.F.

    1998-01-01

    Two new isotopes, 145 Tm and 140 Ho and three isomers in previously known isotopes, 141m Ho, 150m Lu and 151m Lu have been discovered and studied via their decay by proton emission. These proton emitters were produced at the Holifield Radioactive Ion Beam Facility (HRIBF) by heavy-ion fusion-evaporation reactions, separated in A/Q with a recoil mass spectrometer (RMS), and detected in a double-sided silicon strip detector (DSSD). The decay energy and half-life was measured for each new emitter. An analysis in terms of a spherical shell model is applied to the Tm and Lu nuclei, but Ho is considerably deformed and requires a collective model interpretation

  2. Evidence for inelastic neutron acceleration by the 177Lu isomer

    International Nuclear Information System (INIS)

    Roig, O.; Belier, G.; Meot, V.; Daugas, J.-M.; Abt, D.; Aupiais, J.; Jutier, Ch.; Petit, G. Le; Letourneau, A.; Marie, F.; Veyssiere, Ch.

    2006-01-01

    The neutron burnup cross section σ burnup m on the long-lived metastable state of 177 Lu has been measured from a specially designed isomeric target. The Maxwellian averaged cross section obtained for this reaction on 177 Lu m (J π =23/2 - ) is σ burnup m =626±45 b at the reactor temperature T=323 K. The difference between the burnup cross section and the previously measured capture cross section σ n,γ clearly shows a possible existence of 177 Lu m deexcitation via (n,n ' ) inelastic neutron acceleration channels. The results are interpreted in terms of a statistical approach using parameters from a deformed optical potential calculation

  3. Sparse regularization for force identification using dictionaries

    Science.gov (United States)

    Qiao, Baijie; Zhang, Xingwu; Wang, Chenxi; Zhang, Hang; Chen, Xuefeng

    2016-04-01

    The classical function expansion method based on minimizing l2-norm of the response residual employs various basis functions to represent the unknown force. Its difficulty lies in determining the optimum number of basis functions. Considering the sparsity of force in the time domain or in other basis space, we develop a general sparse regularization method based on minimizing l1-norm of the coefficient vector of basis functions. The number of basis functions is adaptively determined by minimizing the number of nonzero components in the coefficient vector during the sparse regularization process. First, according to the profile of the unknown force, the dictionary composed of basis functions is determined. Second, a sparsity convex optimization model for force identification is constructed. Third, given the transfer function and the operational response, Sparse reconstruction by separable approximation (SpaRSA) is developed to solve the sparse regularization problem of force identification. Finally, experiments including identification of impact and harmonic forces are conducted on a cantilever thin plate structure to illustrate the effectiveness and applicability of SpaRSA. Besides the Dirac dictionary, other three sparse dictionaries including Db6 wavelets, Sym4 wavelets and cubic B-spline functions can also accurately identify both the single and double impact forces from highly noisy responses in a sparse representation frame. The discrete cosine functions can also successfully reconstruct the harmonic forces including the sinusoidal, square and triangular forces. Conversely, the traditional Tikhonov regularization method with the L-curve criterion fails to identify both the impact and harmonic forces in these cases.

  4. Analog system for computing sparse codes

    Science.gov (United States)

    Rozell, Christopher John; Johnson, Don Herrick; Baraniuk, Richard Gordon; Olshausen, Bruno A.; Ortman, Robert Lowell

    2010-08-24

    A parallel dynamical system for computing sparse representations of data, i.e., where the data can be fully represented in terms of a small number of non-zero code elements, and for reconstructing compressively sensed images. The system is based on the principles of thresholding and local competition that solves a family of sparse approximation problems corresponding to various sparsity metrics. The system utilizes Locally Competitive Algorithms (LCAs), nodes in a population continually compete with neighboring units using (usually one-way) lateral inhibition to calculate coefficients representing an input in an over complete dictionary.

  5. Parallel transposition of sparse data structures

    DEFF Research Database (Denmark)

    Wang, Hao; Liu, Weifeng; Hou, Kaixi

    2016-01-01

    Many applications in computational sciences and social sciences exploit sparsity and connectivity of acquired data. Even though many parallel sparse primitives such as sparse matrix-vector (SpMV) multiplication have been extensively studied, some other important building blocks, e.g., parallel tr...... transposition in the latest vendor-supplied library on an Intel multicore CPU platform, and the MergeTrans approach achieves on average of 3.4-fold (up to 11.7-fold) speedup on an Intel Xeon Phi many-core processor....

  6. Structure-based bayesian sparse reconstruction

    KAUST Repository

    Quadeer, Ahmed Abdul

    2012-12-01

    Sparse signal reconstruction algorithms have attracted research attention due to their wide applications in various fields. In this paper, we present a simple Bayesian approach that utilizes the sparsity constraint and a priori statistical information (Gaussian or otherwise) to obtain near optimal estimates. In addition, we make use of the rich structure of the sensing matrix encountered in many signal processing applications to develop a fast sparse recovery algorithm. The computational complexity of the proposed algorithm is very low compared with the widely used convex relaxation methods as well as greedy matching pursuit techniques, especially at high sparsity. © 1991-2012 IEEE.

  7. Binary Sparse Phase Retrieval via Simulated Annealing

    Directory of Open Access Journals (Sweden)

    Wei Peng

    2016-01-01

    Full Text Available This paper presents the Simulated Annealing Sparse PhAse Recovery (SASPAR algorithm for reconstructing sparse binary signals from their phaseless magnitudes of the Fourier transform. The greedy strategy version is also proposed for a comparison, which is a parameter-free algorithm. Sufficient numeric simulations indicate that our method is quite effective and suggest the binary model is robust. The SASPAR algorithm seems competitive to the existing methods for its efficiency and high recovery rate even with fewer Fourier measurements.

  8. Preparation of 177Lu-DTPA-BIS-BIOTIN and biodistribution evaluation in normal mice

    International Nuclear Information System (INIS)

    Deng Xinrong; Luo Zhifu; Du Jin

    2010-01-01

    The labeling method for 177 Lu-DTPA-BIS-BIOTIN was established, and the biodistribution of 177 Lu-DTPA-BIS-BIOTIN in normal mice was carried out as well. Under the optimal experimental condition (DTPA-BIS-BIOTIN 25 μg, pH=4.5 reacting at 80 degree C for 20 min), the labeling yield of 177 Lu-DTPA-BIS-BIOTIN is more than 99.0%. 177 Lu-DTPA-BIS-BIOTIN shows pretty good in vitro stability. The biodistribution of 177 Lu-DTPA-BIS-BIOTIN in normal mice shows a rapid blood clearance. The uptake of 177 Lu-DTPA-BIS-BIOTIN is mainly accumulated in liver, spleen and kidney. 177 Lu-DTPA-BIS-BIOTIN is excreted by kidney. The results provide the basis for further study on 177 Lu-DTPA-BIS-BIOTIN used in pretargeted radioimage and radiotherapy of cancer. (authors)

  9. Revisiting the level scheme of the proton emitter 151Lu

    International Nuclear Information System (INIS)

    Wang, F.; Sun, B.H.; Liu, Z.; Scholey, C.; Eeckhaudt, S.; Grahn, T.; Greenlees, P.T.; Jones, P.; Julin, R.; Juutinen, S.; Kettelhut, S.; Leino, M.; Nyman, M.; Rahkila, P.; Saren, J.; Sorri, J.; Uusitalo, J.; Ashley, S.F.; Cullen, I.J.; Garnsworthy, A.B.; Gelletly, W.; Jones, G.A.; Pietri, S.; Podolyak, Z.; Steer, S.; Thompson, N.J.; Walker, P.M.; Williams, S.; Bianco, L.; Darby, I.G.; Joss, D.T.; Page, R.D.; Pakarinen, J.; Rigby, S.; Cullen, D.M.; Khan, S.; Kishada, A.; Gomez-Hornillos, M.B.; Simpson, J.; Jenkins, D.G.; Niikura, M.; Seweryniak, D.; Shizuma, Toshiyuki

    2015-01-01

    An experiment aiming to search for new isomers in the region of proton emitter 151 Lu was performed at the Accelerator Laboratory of the University of Jyväskylä (JYFL), by combining the high resolution γ-ray array JUROGAM, gas-filled RITU separator and GREAT detectors with the triggerless total data readout acquisition (TDR) system. In this proceeding, we revisit the level scheme of 151 Lu by using the proton-tagging technique. A level scheme consistent with the latest experimental results is obtained, and 3 additional levels are identified at high excitation energies. (author)

  10. Dosimetric Studies in Normal Mice of 177Lu-DOTA-SP and 177Lu-DOTA-His2-MG

    International Nuclear Information System (INIS)

    Puerta Yepes, N.; Rojo, A.M.; Lopez Bularte, A.C.; Nevares, N.; Zapata, M.; Perez, J.H.; Crudo, J.

    2010-01-01

    DOTA-Substance-P (SP) and DOTA-minigastrin (His2-MG) labeled with 177 Lu could be used in peptide receptor radionuclide therapy (PRRT) for treatment of various tumour species. Biodistribution studies of both radiopharmaceuticals in normal mice were performed at different times. Absorbed doses in mouse organs were estimated and extrapolated to humans. Dosimetric calculations showed that kidneys received the highest dose, for both radiopharmaceuticals. The Maximum Tolerated Activity (MTA) of 177 Lu-DOTA-SP that can be administered without kidney toxicity are 414 and 422 MBq/kg for the standard adult man and woman, respectively. In the same way, the MTA of 177 Lu-DOTA-His2-MG are 488 and 518 MBq/kg for the standard adult man and woman, respectively. (authors)

  11. Subspace Based Blind Sparse Channel Estimation

    DEFF Research Database (Denmark)

    Hayashi, Kazunori; Matsushima, Hiroki; Sakai, Hideaki

    2012-01-01

    The paper proposes a subspace based blind sparse channel estimation method using 1–2 optimization by replacing the 2–norm minimization in the conventional subspace based method by the 1–norm minimization problem. Numerical results confirm that the proposed method can significantly improve...

  12. Multilevel sparse functional principal component analysis.

    Science.gov (United States)

    Di, Chongzhi; Crainiceanu, Ciprian M; Jank, Wolfgang S

    2014-01-29

    We consider analysis of sparsely sampled multilevel functional data, where the basic observational unit is a function and data have a natural hierarchy of basic units. An example is when functions are recorded at multiple visits for each subject. Multilevel functional principal component analysis (MFPCA; Di et al. 2009) was proposed for such data when functions are densely recorded. Here we consider the case when functions are sparsely sampled and may contain only a few observations per function. We exploit the multilevel structure of covariance operators and achieve data reduction by principal component decompositions at both between and within subject levels. We address inherent methodological differences in the sparse sampling context to: 1) estimate the covariance operators; 2) estimate the functional principal component scores; 3) predict the underlying curves. Through simulations the proposed method is able to discover dominating modes of variations and reconstruct underlying curves well even in sparse settings. Our approach is illustrated by two applications, the Sleep Heart Health Study and eBay auctions.

  13. Continuous speech recognition with sparse coding

    CSIR Research Space (South Africa)

    Smit, WJ

    2009-04-01

    Full Text Available generative model. The spike train is classified by making use of a spike train model and dynamic programming. It is computationally expensive to find a sparse code. We use an iterative subset selection algorithm with quadratic programming for this process...

  14. Multisnapshot Sparse Bayesian Learning for DOA

    DEFF Research Database (Denmark)

    Gerstoft, Peter; Mecklenbrauker, Christoph F.; Xenaki, Angeliki

    2016-01-01

    The directions of arrival (DOA) of plane waves are estimated from multisnapshot sensor array data using sparse Bayesian learning (SBL). The prior for the source amplitudes is assumed independent zero-mean complex Gaussian distributed with hyperparameters, the unknown variances (i.e., the source...

  15. Better Size Estimation for Sparse Matrix Products

    DEFF Research Database (Denmark)

    Amossen, Rasmus Resen; Campagna, Andrea; Pagh, Rasmus

    2010-01-01

    We consider the problem of doing fast and reliable estimation of the number of non-zero entries in a sparse Boolean matrix product. Let n denote the total number of non-zero entries in the input matrices. We show how to compute a 1 ± ε approximation (with small probability of error) in expected t...

  16. Rotational image deblurring with sparse matrices

    DEFF Research Database (Denmark)

    Hansen, Per Christian; Nagy, James G.; Tigkos, Konstantinos

    2014-01-01

    We describe iterative deblurring algorithms that can handle blur caused by a rotation along an arbitrary axis (including the common case of pure rotation). Our algorithms use a sparse-matrix representation of the blurring operation, which allows us to easily handle several different boundary...

  17. Feature based omnidirectional sparse visual path following

    OpenAIRE

    Goedemé, Toon; Tuytelaars, Tinne; Van Gool, Luc; Vanacker, Gerolf; Nuttin, Marnix

    2005-01-01

    Goedemé T., Tuytelaars T., Van Gool L., Vanacker G., Nuttin M., ''Feature based omnidirectional sparse visual path following'', Proceedings IEEE/RSJ international conference on intelligent robots and systems - IROS2005, pp. 1003-1008, August 2-6, 2005, Edmonton, Alberta, Canada.

  18. Comparison of sparse point distribution models

    DEFF Research Database (Denmark)

    Erbou, Søren Gylling Hemmingsen; Vester-Christensen, Martin; Larsen, Rasmus

    2010-01-01

    This paper compares several methods for obtaining sparse and compact point distribution models suited for data sets containing many variables. These are evaluated on a database consisting of 3D surfaces of a section of the pelvic bone obtained from CT scans of 33 porcine carcasses. The superior m...

  19. A sparse-grid isogeometric solver

    KAUST Repository

    Beck, Joakim

    2018-02-28

    Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90’s in the context of the approximation of high-dimensional PDEs.The tests that we report show that, in accordance to the literature, a sparse-grid construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.

  20. A sparse version of IGA solvers

    KAUST Repository

    Beck, Joakim

    2017-07-30

    Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90s in the context of the approximation of high-dimensional PDEs. The tests that we report show that, in accordance to the literature, a sparse grids construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.

  1. A sparse-grid isogeometric solver

    KAUST Repository

    Beck, Joakim; Sangalli, Giancarlo; Tamellini, Lorenzo

    2018-01-01

    Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90’s in the context of the approximation of high-dimensional PDEs.The tests that we report show that, in accordance to the literature, a sparse-grid construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.

  2. A sparse version of IGA solvers

    KAUST Repository

    Beck, Joakim; Sangalli, Giancarlo; Tamellini, Lorenzo

    2017-01-01

    Isogeometric Analysis (IGA) typically adopts tensor-product splines and NURBS as a basis for the approximation of the solution of PDEs. In this work, we investigate to which extent IGA solvers can benefit from the so-called sparse-grids construction in its combination technique form, which was first introduced in the early 90s in the context of the approximation of high-dimensional PDEs. The tests that we report show that, in accordance to the literature, a sparse grids construction can indeed be useful if the solution of the PDE at hand is sufficiently smooth. Sparse grids can also be useful in the case of non-smooth solutions when some a-priori knowledge on the location of the singularities of the solution can be exploited to devise suitable non-equispaced meshes. Finally, we remark that sparse grids can be seen as a simple way to parallelize pre-existing serial IGA solvers in a straightforward fashion, which can be beneficial in many practical situations.

  3. New methods for sampling sparse populations

    Science.gov (United States)

    Anna Ringvall

    2007-01-01

    To improve surveys of sparse objects, methods that use auxiliary information have been suggested. Guided transect sampling uses prior information, e.g., from aerial photographs, for the layout of survey strips. Instead of being laid out straight, the strips will wind between potentially more interesting areas. 3P sampling (probability proportional to prediction) uses...

  4. Measurement of the cross sections for the 175Lu(n,2n)174m,gLu reaction

    International Nuclear Information System (INIS)

    Yu Weixiang; Zhao Wenrong; Lu Hanlin; Han Xiaogang

    1998-01-01

    The 175 Lu(n,2n) 174m,g Lu reaction is an important indicator. There are 10 sets of measured data since 1960 (total 58 experimental values). Most of the data are finished at 14 MeV with 20%∼30% discrepancy. So the authors measured the cross section by activation method in neutron energies of 14 MeV and 10∼12 MeV. The measurement is carried out at the Cockcroft-Walton and HI-13 Tandem accelerator of CIAE

  5. O- centers in LuAG:Ce,Mg ceramics

    Czech Academy of Sciences Publication Activity Database

    Hu, C.; Liu, S.; Fasoli, M.; Vedda, A.; Nikl, Martin; Feng, X. Q.; Pan, Y.B.

    2015-01-01

    Roč. 9, č. 4 (2015), s. 245-249 ISSN 1862-6254 R&D Projects: GA ČR GAP204/12/0805 Institutional support: RVO:68378271 Keywords : scintillator * hole center * EPR * LuAG * Ce 3+ Subject RIV: BM - Solid Matter Physics ; Magnetism Impact factor: 2.578, year: 2015

  6. Exploiting fine-grain parallelism in recursive LU factorization

    KAUST Repository

    Dongarra, Jack; Faverge, Mathieu; Ltaief, Hatem; Luszczek, Piotr R.

    2012-01-01

    is the panel factorization due to its memory-bound characteristic and the atomicity of selecting the appropriate pivots. We remedy this in our new approach to LU factorization of (narrow and tall) panel submatrices. We use a parallel fine-grained recursive

  7. Fast Sparse Coding for Range Data Denoising with Sparse Ridges Constraint.

    Science.gov (United States)

    Gao, Zhi; Lao, Mingjie; Sang, Yongsheng; Wen, Fei; Ramesh, Bharath; Zhai, Ruifang

    2018-05-06

    Light detection and ranging (LiDAR) sensors have been widely deployed on intelligent systems such as unmanned ground vehicles (UGVs) and unmanned aerial vehicles (UAVs) to perform localization, obstacle detection, and navigation tasks. Thus, research into range data processing with competitive performance in terms of both accuracy and efficiency has attracted increasing attention. Sparse coding has revolutionized signal processing and led to state-of-the-art performance in a variety of applications. However, dictionary learning, which plays the central role in sparse coding techniques, is computationally demanding, resulting in its limited applicability in real-time systems. In this study, we propose sparse coding algorithms with a fixed pre-learned ridge dictionary to realize range data denoising via leveraging the regularity of laser range measurements in man-made environments. Experiments on both synthesized data and real data demonstrate that our method obtains accuracy comparable to that of sophisticated sparse coding methods, but with much higher computational efficiency.

  8. Study of the production of {sup 177}Lu through {sup 176}Yb (n, {gamma}) {sup 177}Yb {yields} {sup 177}Lu nuclear reaction

    Energy Technology Data Exchange (ETDEWEB)

    Silva, Giovana Pasqualini da; Osso Junior, Joao Alberto [Instituto de Pesquisas Energeticas e Nucleares (IPEN/CNEN-SP), Sao Paulo, SP (Brazil)]. E-mail: gpsilva@ipen.br; jaosso@ipen.br

    2007-07-01

    The beta minus emitter {sup 177}Lu is a promising therapeutic radioisotope for the curative treatment of cancer using labelled proteins. It has a half - life of T{sub 1/2} = 6.71 day and maximum and average {beta}{sup -} energies of 421 and 133 keV, resulting in a short range of radiation in tissue. The decay is accompanied by the emission of low energy {gamma}-radiation with 208.3 keV (11%) and 113 keV (6.4%) suitable for simultaneous imaging, {sup 177}Lu can be produced by two different routes, namely, by irradiation of natural Lu{sub 2}O{sub 3} target ({sup 176}Lu, 2.6%) or enriched (in {sup 176}Lu) Lu{sub 2}O{sub 3} target, as also by irradiation of Yb target (Yb{sub 2}O{sub 3}) followed by radiochemical separation of {sup 177}Lu from Yb isotopes. The objective of this work is to study the production of {sup 177}Lu through the indirect {sup 176}Yb(n,{gamma}){sup 177}Yb {yields} {sup 177}Lu nuclear reaction. The results of the production yield of {sup 177}Lu will be shown and compared with the direct reaction. The method of choice for the chemical separation between Lu and Yb was the ion exchange, using an cation exchange resin in Cl{sup -} form and {alpha}-HIBA as eluent. Preliminary results showed a good separation of {sup 177}Lu from Yb{sub 2}O{sub 3} indirect targets. (author)

  9. 177Lu-DOTA-Bevacizumab: Radioimmunotherapy Agent for Melanoma.

    Science.gov (United States)

    Camacho, Ximena; Calzada, Victoria; Fernandez, Marcelo; Alonso, Omar; Chammas, Roger; Riva, Eloisa; Gambini, Juan Pablo; Cabral, Pablo

    2017-01-01

    Vascular endothelial growth factor (VEGF) is one of the classic factors to tumor-induced angiogenesis in several types, including melanoma. Bevacizumab is a humanized monoclonal antibody directed against VEGF. To radiolabel Bevacizumab with 177-Lutetium as a potential radioimmunotherapy agent for melanoma. Bevacizumab was derivatized with DOTA-NHS-ester at 4 ºC for 18 h. DOTABevacizumab was radiolabeled with 177LuCl3 (15 MBq/mg) at 37 ºC for 1 h. The studies were performed in healthy and B16F1 tumor-bearing C57BL/6J mice at 24 and 48 h (n = 5). Scinthigraphic imaging studies were performed at 24 h to determine the radiochemical stability, targeting specificity and pharmacokinetics of the 177Lutetium-labeled antibody. DOTA-Bevacizumab was efficiently labeled with 177LuCl3 at 37 °C. The in-vitro stability of labeled product was optimal over 72 h. In-vivo biodistribution studies showed a high liver and tumor uptake of 177Lu-DOTA-Bevacizumab, with tumor-to-muscle ratios of 11.58 and 6.37 at 24 and 48 h p.i. Scintigraphic imaging of melanoma tumor-bearing C57BL/6J mice showed liver and a high tumor selective uptake of 177Lu-DOTA-Bevacizumab at 24 h. Our results support the potential role of 177Lu-DOTA-Bevacizumab as a novel radioimmunotherapy agent for melanoma. We hope that these novel molecular imaging agents will open the path to new diagnostic and therapeutic strategies for Melanoma disease. Copyright© Bentham Science Publishers; For any queries, please email at epub@benthamscience.org.

  10. A sparse electromagnetic imaging scheme using nonlinear landweber iterations

    KAUST Repository

    Desmal, Abdulla; Bagci, Hakan

    2015-01-01

    Development and use of electromagnetic inverse scattering techniques for imagining sparse domains have been on the rise following the recent advancements in solving sparse optimization problems. Existing techniques rely on iteratively converting

  11. Efficient Pseudorecursive Evaluation Schemes for Non-adaptive Sparse Grids

    KAUST Repository

    Buse, Gerrit; Pflü ger, Dirk; Jacob, Riko

    2014-01-01

    In this work we propose novel algorithms for storing and evaluating sparse grid functions, operating on regular (not spatially adaptive), yet potentially dimensionally adaptive grid types. Besides regular sparse grids our approach includes truncated

  12. Improved Sparse Channel Estimation for Cooperative Communication Systems

    Directory of Open Access Journals (Sweden)

    Guan Gui

    2012-01-01

    Full Text Available Accurate channel state information (CSI is necessary at receiver for coherent detection in amplify-and-forward (AF cooperative communication systems. To estimate the channel, traditional methods, that is, least squares (LS and least absolute shrinkage and selection operator (LASSO, are based on assumptions of either dense channel or global sparse channel. However, LS-based linear method neglects the inherent sparse structure information while LASSO-based sparse channel method cannot take full advantage of the prior information. Based on the partial sparse assumption of the cooperative channel model, we propose an improved channel estimation method with partial sparse constraint. At first, by using sparse decomposition theory, channel estimation is formulated as a compressive sensing problem. Secondly, the cooperative channel is reconstructed by LASSO with partial sparse constraint. Finally, numerical simulations are carried out to confirm the superiority of proposed methods over global sparse channel estimation methods.

  13. Sparse reconstruction using distribution agnostic bayesian matching pursuit

    KAUST Repository

    Masood, Mudassir; Al-Naffouri, Tareq Y.

    2013-01-01

    A fast matching pursuit method using a Bayesian approach is introduced for sparse signal recovery. This method performs Bayesian estimates of sparse signals even when the signal prior is non-Gaussian or unknown. It is agnostic on signal statistics

  14. First evidence for triaxial superdeformation in sup 1 sup 6 sup 1 Lu and sup 1 sup 6 sup 2 Lu

    CERN Document Server

    Bringel, P; Domscheit, J; Neusser, A; Schoenwasser, G; Singh, A K; Amro, H; Axiotis, M; Kröll, T; Napoli, D R; Bazzacco, D; Lunardi, S; Ur, C; Bhattacharya, S; Bhowmik, R; Hagemann, G B; Jensen, D R; Pancholi, S C; Petrache, C M

    2003-01-01

    High-spin states in sup 1 sup 6 sup 1 Lu and sup 1 sup 6 sup 2 Lu have been investigated using the GASP gamma-ray spectrometer array. Excited states in these nuclei have been populated through the sup 1 sup 0 sup 0 Mo( sup 6 sup 5 Cu, xn) reaction at a beam energy of 260 MeV. Four presumably triaxial superdeformed bands, three in sup 1 sup 6 sup 2 Lu and one in sup 1 sup 6 sup 1 Lu, have been observed. This is the first evidence for triaxial superdeformation in the two isotopes. (orig.)

  15. LuFLA1PRO and LuBGAL1PRO promote gene expression in the phloem fibres of flax (Linum usitatissimum).

    Science.gov (United States)

    Hobson, Neil; Deyholos, Michael K

    2013-04-01

    Cell type-specific promoters were identified that drive gene expression in an industrially important product. To identify flax (Linum usitatissimum) gene promoters, we analyzed the genomic regions upstream of a fasciclin-like arabinogalactan protein (LuFLA1) and a beta-galactosidase (LuBGAL1). Both of these genes encode transcripts that have been found to be highly enriched in tissues bearing phloem fibres. Using a beta-glucuronidase (GUS) reporter construct, we found that a 908-bp genomic sequence upstream of LuFLA1 (LuFLA1PRO) directed GUS expression with high specificity to phloem fibres undergoing secondary cell wall development. The DNA sequence upstream of LuBGAL1 (LuBGAL1PRO) likewise produced GUS staining in phloem fibres with developing secondary walls, as well as in tissues of developing flowers and seed bolls. These data provide further evidence of a specific role for LuFLA1 in phloem fibre development, and demonstrate the utility of LuFLA1PRO and LuBGAL1PRO as tools for biotechnology and further investigations of phloem fibre development.

  16. Sparse DOA estimation with polynomial rooting

    DEFF Research Database (Denmark)

    Xenaki, Angeliki; Gerstoft, Peter; Fernandez Grande, Efren

    2015-01-01

    Direction-of-arrival (DOA) estimation involves the localization of a few sources from a limited number of observations on an array of sensors. Thus, DOA estimation can be formulated as a sparse signal reconstruction problem and solved efficiently with compressive sensing (CS) to achieve highresol......Direction-of-arrival (DOA) estimation involves the localization of a few sources from a limited number of observations on an array of sensors. Thus, DOA estimation can be formulated as a sparse signal reconstruction problem and solved efficiently with compressive sensing (CS) to achieve...... highresolution imaging. Utilizing the dual optimal variables of the CS optimization problem, it is shown with Monte Carlo simulations that the DOAs are accurately reconstructed through polynomial rooting (Root-CS). Polynomial rooting is known to improve the resolution in several other DOA estimation methods...

  17. Sparse learning of stochastic dynamical equations

    Science.gov (United States)

    Boninsegna, Lorenzo; Nüske, Feliks; Clementi, Cecilia

    2018-06-01

    With the rapid increase of available data for complex systems, there is great interest in the extraction of physically relevant information from massive datasets. Recently, a framework called Sparse Identification of Nonlinear Dynamics (SINDy) has been introduced to identify the governing equations of dynamical systems from simulation data. In this study, we extend SINDy to stochastic dynamical systems which are frequently used to model biophysical processes. We prove the asymptotic correctness of stochastic SINDy in the infinite data limit, both in the original and projected variables. We discuss algorithms to solve the sparse regression problem arising from the practical implementation of SINDy and show that cross validation is an essential tool to determine the right level of sparsity. We demonstrate the proposed methodology on two test systems, namely, the diffusion in a one-dimensional potential and the projected dynamics of a two-dimensional diffusion process.

  18. Sparseness- and continuity-constrained seismic imaging

    Science.gov (United States)

    Herrmann, Felix J.

    2005-04-01

    Non-linear solution strategies to the least-squares seismic inverse-scattering problem with sparseness and continuity constraints are proposed. Our approach is designed to (i) deal with substantial amounts of additive noise (SNR formulating the solution of the seismic inverse problem in terms of an optimization problem. During the optimization, sparseness on the basis and continuity along the reflectors are imposed by jointly minimizing the l1- and anisotropic diffusion/total-variation norms on the coefficients and reflectivity, respectively. [Joint work with Peyman P. Moghaddam was carried out as part of the SINBAD project, with financial support secured through ITF (the Industry Technology Facilitator) from the following organizations: BG Group, BP, ExxonMobil, and SHELL. Additional funding came from the NSERC Discovery Grants 22R81254.

  19. A density functional for sparse matter

    DEFF Research Database (Denmark)

    Langreth, D.C.; Lundqvist, Bengt; Chakarova-Kack, S.D.

    2009-01-01

    forces in molecules, to adsorbed molecules, like benzene, naphthalene, phenol and adenine on graphite, alumina and metals, to polymer and carbon nanotube (CNT) crystals, and hydrogen storage in graphite and metal-organic frameworks (MOFs), and to the structure of DNA and of DNA with intercalators......Sparse matter is abundant and has both strong local bonds and weak nonbonding forces, in particular nonlocal van der Waals (vdW) forces between atoms separated by empty space. It encompasses a broad spectrum of systems, like soft matter, adsorption systems and biostructures. Density-functional...... theory (DFT), long since proven successful for dense matter, seems now to have come to a point, where useful extensions to sparse matter are available. In particular, a functional form, vdW-DF (Dion et al 2004 Phys. Rev. Lett. 92 246401; Thonhauser et al 2007 Phys. Rev. B 76 125112), has been proposed...

  20. Robust Fringe Projection Profilometry via Sparse Representation.

    Science.gov (United States)

    Budianto; Lun, Daniel P K

    2016-04-01

    In this paper, a robust fringe projection profilometry (FPP) algorithm using the sparse dictionary learning and sparse coding techniques is proposed. When reconstructing the 3D model of objects, traditional FPP systems often fail to perform if the captured fringe images have a complex scene, such as having multiple and occluded objects. It introduces great difficulty to the phase unwrapping process of an FPP system that can result in serious distortion in the final reconstructed 3D model. For the proposed algorithm, it encodes the period order information, which is essential to phase unwrapping, into some texture patterns and embeds them to the projected fringe patterns. When the encoded fringe image is captured, a modified morphological component analysis and a sparse classification procedure are performed to decode and identify the embedded period order information. It is then used to assist the phase unwrapping process to deal with the different artifacts in the fringe images. Experimental results show that the proposed algorithm can significantly improve the robustness of an FPP system. It performs equally well no matter the fringe images have a simple or complex scene, or are affected due to the ambient lighting of the working environment.

  1. Solving Sparse Polynomial Optimization Problems with Chordal Structure Using the Sparse, Bounded-Degree Sum-of-Squares Hierarchy

    NARCIS (Netherlands)

    Marandi, Ahmadreza; de Klerk, Etienne; Dahl, Joachim

    The sparse bounded degree sum-of-squares (sparse-BSOS) hierarchy of Weisser, Lasserre and Toh [arXiv:1607.01151,2016] constructs a sequence of lower bounds for a sparse polynomial optimization problem. Under some assumptions, it is proven by the authors that the sequence converges to the optimal

  2. Evaluating Sparse Linear System Solvers on Scalable Parallel Architectures

    National Research Council Canada - National Science Library

    Grama, Ananth; Manguoglu, Murat; Koyuturk, Mehmet; Naumov, Maxim; Sameh, Ahmed

    2008-01-01

    .... The study was motivated primarily by the lack of robustness of Krylov subspace iterative schemes with generic, black-box, pre-conditioners such as approximate (or incomplete) LU-factorizations...

  3. The Romanian Căluş: Symbol of National Identity

    Directory of Open Access Journals (Sweden)

    Camelia Firică

    2011-05-01

    Full Text Available Of all Romanian dances with ritual functions the most archaic and dynamic is the căluş, a custom of great complexity in its functionality and manifestation, in which dance prevails. Over the course of time, the dance aroused the admiration and interest of many scholars due to the ancient ritual elements it contains, as well as for its spectacular virtuosity and the beauty of the performance and music. The purpose of this study is to reveal the meanings and functions of the căluş, primarily at the social level, in its natural environment – the traditional Romanian village – and to make an analysis of the key moments, the logical order of the dance sequences, gestures and ritual acts, the importance of its props and of group composition and organisation.

  4. The Romanian Căluş: Symbol of National Identity

    Directory of Open Access Journals (Sweden)

    Camelia Firică

    2010-12-01

    Full Text Available Of all Romanian dances with ritual functions the most archaic and dynamic is the căluş, a custom of great complexity in its functionality and manifestation, in which dance prevails. Over the course of time, the dance aroused the admiration and interest of many scholars due to the ancient ritual elements it contains, as well as for its spectacular virtuosity and the beauty of the performance and music. The purpose of this study is to reveal the meanings and functions of the căluş, primarily at the social level, in its natural environment – the traditional Romanian village – and to make an analysis of the key moments, the logical order of the dance sequences, gestures and ritual acts, the importance of its props and of group composition and organisation.

  5. Electronic, ductile, phase transition and mechanical properties of Lu-monopnictides under high pressures.

    Science.gov (United States)

    Gupta, Dinesh C; Bhat, Idris Hamid

    2013-12-01

    The structural, elastic and electronic properties of lutatium-pnictides (LuN, LuP, LuAs, LuSb, and LuBi) were analyzed by using full-potential linearized augmented plane wave within generalized gradient approximation in the stable rock-salt structure (B1 phase) with space group Fm-3m and high-pressure CsCl structure (B2 phase) with space group Pm-3m. Hubbard-U and spin-orbit coupling were included to predict correctly the semiconducting band gap of LuN. Under compression, these materials undergo first-order structural transitions from B1 to B2 phases at 241, 98, 56.82, 25.2 and 32.3 GPa, respectively. The computed elastic properties show that LuBi is ductile by nature. The electronic structure calculations show that LuN is semiconductor at ambient conditions with an indirect band gap of 1.55 eV while other Lu-pnictides are metallic. It was observed that LuN shows metallization at high pressures. The structural properties, viz, equilibrium lattice constant, bulk modulus and its pressure derivative, transition pressure, equation of state, volume collapse, band gap and elastic moduli, show good agreement with available data.

  6. K-electron capture probability in 171Lu

    International Nuclear Information System (INIS)

    Mishra, N.R.; Vara Prasad, N.V.S.; Chandrasekhara Rao, M.V.S.; Satyanarayana, G.; Sastry, D.L.; Chintalapudi, S.N.

    1999-01-01

    The K-electron capture probability in the decay of 171 Lu to the 835.06 keV level of the daughter nucleus 171 Yb is measured to be 0.822 ± 0.027 involving two transitions, in agreement with the theoretical value 0.833. The experimental value is seen to be consistent with the mass prediction of the relationship due to Wapstra and Bos. (author)

  7. Development of LuAG-based scintillator crystals - A review

    Czech Academy of Sciences Publication Activity Database

    Nikl, Martin; Yoshikawa, A.; Kamada, K.; Nejezchleb, K.; Stanek, C.R.; Mareš, Jiří A.; Blazek, K.

    2013-01-01

    Roč. 59, č. 2 (2013), s. 47-72 ISSN 0960-8974 R&D Projects: GA ČR GAP204/12/0805; GA AV ČR KAN300100802 Grant - others:GA AV(CZ) M100100910 Institutional support: RVO:68378271 Keywords : garnet * scintillator * Lu 3 Al 5 O 12 * Ce 3+ * Pr 3+ * Sc 3+ * Yb 3+ Subject RIV: BM - Solid Matter Physics ; Magnetism Impact factor: 1.476, year: 2013

  8. Multi-threaded Sparse Matrix Sparse Matrix Multiplication for Many-Core and GPU Architectures.

    Energy Technology Data Exchange (ETDEWEB)

    Deveci, Mehmet [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Trott, Christian Robert [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Rajamanickam, Sivasankaran [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2018-01-01

    Sparse Matrix-Matrix multiplication is a key kernel that has applications in several domains such as scientific computing and graph analysis. Several algorithms have been studied in the past for this foundational kernel. In this paper, we develop parallel algorithms for sparse matrix- matrix multiplication with a focus on performance portability across different high performance computing architectures. The performance of these algorithms depend on the data structures used in them. We compare different types of accumulators in these algorithms and demonstrate the performance difference between these data structures. Furthermore, we develop a meta-algorithm, kkSpGEMM, to choose the right algorithm and data structure based on the characteristics of the problem. We show performance comparisons on three architectures and demonstrate the need for the community to develop two phase sparse matrix-matrix multiplication implementations for efficient reuse of the data structures involved.

  9. Development of 177Lu-phytate Complex for Radiosynovectomy

    Directory of Open Access Journals (Sweden)

    Hassan Yousefnia

    2013-05-01

    Full Text Available Objective(s: In this work a new possible agent for radiosynovectomy has been targeted for articular pain palliation. Materials and Methods: Lu-177 of 2.6-3 GBq/mg specific activity was obtained by irradiation of natural Lu2O3 sample with thermal neutron flux of 4 × 1013 n.cm-2.s-1. The product was converted into chloride form which was further used for labeling of 177Lu-phytate complex and checked using ITLC (MeOH: H2O: acetic acid, 4: 4: 2, as mobile phase. The complex stability and viscosity were checked in the final solution up to seven days. The prepared complex solution (100 µCi/100 µl was injected intra-articularly to male rat knee joint. Leakage of radioactivity from injection site and its distribution in organs were investigated up to seven days. Results: The complex was successfully prepared with high radiochemical purity (>99.9 %. Approximately, the whole injected dose has remained in injection site seven days after injection. Conclusion: The complex was proved to be a feasible agent for cavital radiotherapy in oncology and rheumatology

  10. Incorporation of Pr into LuAG ceramics

    Science.gov (United States)

    Marchewka, M. R.; Chapman, M. G.; Qian, H.; Jacobsohn, L. G.

    2017-06-01

    An investigation of the effects of Pr in (Lu1-xPrx)3Al5O12 (LuAG:Pr) ceramics was carried out by means of x-ray diffraction (XRD), energy dispersive x-ray spectroscopy (EDX), and attenuated total reflection Fourier transform infrared spectroscopy (ATR FTIR) measurements coupled with luminescence measurements. It was found that the Pr concentration that maximizes luminescence emission depends on the thermal processing conditions. While the calcined LuAG:Pr powder showed maximum luminescence emission for Pr concentrations between 0.18 and 0.33 at.%, maximum emission of ceramic bodies sintered at 1500 °C for 20 h was obtained with Pr concentrations between 0.018 and 0.18 at.%. Further, for short sintering times up to about 3 h, luminescence emission intensity is maximum for Pr concentrations around 0.33 at.%. Longer sintering times lead to the formation of PrAlO3 as a secondary phase, concomitant with a reduction of the intensity of luminescence emission.

  11. Encapsulation of a radiolabeled cluster inside a fullerene cage, (177)Lu(x)Lu((3-x))N@C(80): an interleukin-13-conjugated radiolabeled metallofullerene platform.

    Science.gov (United States)

    Shultz, Michael D; Duchamp, James C; Wilson, John D; Shu, Chun-Ying; Ge, Jiechao; Zhang, Jianyuan; Gibson, Harry W; Fillmore, Helen L; Hirsch, Jerry I; Dorn, Harry C; Fatouros, Panos P

    2010-04-14

    In this communication, we describe the successful encapsulation of (177)Lu into the endohedral metallofullerene (177)Lu(x)Lu(3-x)N@C(80) (x = 1-3) starting with (177)LuCl(3) in a modified quartz Kraschmer-Huffman electric generator. We demonstrate that the (177)Lu (beta-emitter) in this fullerene cage is not significantly released for a period of up to at least one-half-life (6.7 days). We also demonstrate that this agent can be conjugated with an interleukin-13 peptide that is designed to target an overexpressed receptor in glioblastoma multiforme tumors. This nanoparticle delivery platform provides flexibility for a wide range of radiotherapeutic and radiodiagnostic multimodal applications.

  12. Noniterative MAP reconstruction using sparse matrix representations.

    Science.gov (United States)

    Cao, Guangzhi; Bouman, Charles A; Webb, Kevin J

    2009-09-01

    We present a method for noniterative maximum a posteriori (MAP) tomographic reconstruction which is based on the use of sparse matrix representations. Our approach is to precompute and store the inverse matrix required for MAP reconstruction. This approach has generally not been used in the past because the inverse matrix is typically large and fully populated (i.e., not sparse). In order to overcome this problem, we introduce two new ideas. The first idea is a novel theory for the lossy source coding of matrix transformations which we refer to as matrix source coding. This theory is based on a distortion metric that reflects the distortions produced in the final matrix-vector product, rather than the distortions in the coded matrix itself. The resulting algorithms are shown to require orthonormal transformations of both the measurement data and the matrix rows and columns before quantization and coding. The second idea is a method for efficiently storing and computing the required orthonormal transformations, which we call a sparse-matrix transform (SMT). The SMT is a generalization of the classical FFT in that it uses butterflies to compute an orthonormal transform; but unlike an FFT, the SMT uses the butterflies in an irregular pattern, and is numerically designed to best approximate the desired transforms. We demonstrate the potential of the noniterative MAP reconstruction with examples from optical tomography. The method requires offline computation to encode the inverse transform. However, once these offline computations are completed, the noniterative MAP algorithm is shown to reduce both storage and computation by well over two orders of magnitude, as compared to a linear iterative reconstruction methods.

  13. Galaxy redshift surveys with sparse sampling

    International Nuclear Information System (INIS)

    Chiang, Chi-Ting; Wullstein, Philipp; Komatsu, Eiichiro; Jee, Inh; Jeong, Donghui; Blanc, Guillermo A.; Ciardullo, Robin; Gronwall, Caryl; Hagen, Alex; Schneider, Donald P.; Drory, Niv; Fabricius, Maximilian; Landriau, Martin; Finkelstein, Steven; Jogee, Shardha; Cooper, Erin Mentuch; Tuttle, Sarah; Gebhardt, Karl; Hill, Gary J.

    2013-01-01

    Survey observations of the three-dimensional locations of galaxies are a powerful approach to measure the distribution of matter in the universe, which can be used to learn about the nature of dark energy, physics of inflation, neutrino masses, etc. A competitive survey, however, requires a large volume (e.g., V survey ∼ 10Gpc 3 ) to be covered, and thus tends to be expensive. A ''sparse sampling'' method offers a more affordable solution to this problem: within a survey footprint covering a given survey volume, V survey , we observe only a fraction of the volume. The distribution of observed regions should be chosen such that their separation is smaller than the length scale corresponding to the wavenumber of interest. Then one can recover the power spectrum of galaxies with precision expected for a survey covering a volume of V survey (rather than the volume of the sum of observed regions) with the number density of galaxies given by the total number of observed galaxies divided by V survey (rather than the number density of galaxies within an observed region). We find that regularly-spaced sampling yields an unbiased power spectrum with no window function effect, and deviations from regularly-spaced sampling, which are unavoidable in realistic surveys, introduce calculable window function effects and increase the uncertainties of the recovered power spectrum. On the other hand, we show that the two-point correlation function (pair counting) is not affected by sparse sampling. While we discuss the sparse sampling method within the context of the forthcoming Hobby-Eberly Telescope Dark Energy Experiment, the method is general and can be applied to other galaxy surveys

  14. A view of Kanerva's sparse distributed memory

    Science.gov (United States)

    Denning, P. J.

    1986-01-01

    Pentti Kanerva is working on a new class of computers, which are called pattern computers. Pattern computers may close the gap between capabilities of biological organisms to recognize and act on patterns (visual, auditory, tactile, or olfactory) and capabilities of modern computers. Combinations of numeric, symbolic, and pattern computers may one day be capable of sustaining robots. The overview of the requirements for a pattern computer, a summary of Kanerva's Sparse Distributed Memory (SDM), and examples of tasks this computer can be expected to perform well are given.

  15. Wavelets for Sparse Representation of Music

    DEFF Research Database (Denmark)

    Endelt, Line Ørtoft; Harbo, Anders La-Cour

    2004-01-01

    We are interested in obtaining a sparse representation of music signals by means of a discrete wavelet transform (DWT). That means we want the energy in the representation to be concentrated in few DWT coefficients. It is well-known that the decay of the DWT coefficients is strongly related...... to the number of vanishing moments of the mother wavelet, and to the smoothness of the signal. In this paper we present the result of applying two classical families of wavelets to a series of musical signals. The purpose is to determine a general relation between the number of vanishing moments of the wavelet...

  16. Sparse dynamics for partial differential equations.

    Science.gov (United States)

    Schaeffer, Hayden; Caflisch, Russel; Hauck, Cory D; Osher, Stanley

    2013-04-23

    We investigate the approximate dynamics of several differential equations when the solutions are restricted to a sparse subset of a given basis. The restriction is enforced at every time step by simply applying soft thresholding to the coefficients of the basis approximation. By reducing or compressing the information needed to represent the solution at every step, only the essential dynamics are represented. In many cases, there are natural bases derived from the differential equations, which promote sparsity. We find that our method successfully reduces the dynamics of convection equations, diffusion equations, weak shocks, and vorticity equations with high-frequency source terms.

  17. Abnormal Event Detection Using Local Sparse Representation

    DEFF Research Database (Denmark)

    Ren, Huamin; Moeslund, Thomas B.

    2014-01-01

    We propose to detect abnormal events via a sparse subspace clustering algorithm. Unlike most existing approaches, which search for optimized normal bases and detect abnormality based on least square error or reconstruction error from the learned normal patterns, we propose an abnormality measurem...... is found that satisfies: the distance between its local space and the normal space is large. We evaluate our method on two public benchmark datasets: UCSD and Subway Entrance datasets. The comparison to the state-of-the-art methods validate our method's effectiveness....

  18. Partitioning sparse rectangular matrices for parallel processing

    Energy Technology Data Exchange (ETDEWEB)

    Kolda, T.G.

    1998-05-01

    The authors are interested in partitioning sparse rectangular matrices for parallel processing. The partitioning problem has been well-studied in the square symmetric case, but the rectangular problem has received very little attention. They will formalize the rectangular matrix partitioning problem and discuss several methods for solving it. They will extend the spectral partitioning method for symmetric matrices to the rectangular case and compare this method to three new methods -- the alternating partitioning method and two hybrid methods. The hybrid methods will be shown to be best.

  19. Functional fixedness in a technologically sparse culture.

    Science.gov (United States)

    German, Tim P; Barrett, H Clark

    2005-01-01

    Problem solving can be inefficient when the solution requires subjects to generate an atypical function for an object and the object's typical function has been primed. Subjects become "fixed" on the design function of the object, and problem solving suffers relative to control conditions in which the object's function is not demonstrated. In the current study, such functional fixedness was demonstrated in a sample of adolescents (mean age of 16 years) among the Shuar of Ecuadorian Amazonia, whose technologically sparse culture provides limited access to large numbers of artifacts with highly specialized functions. This result suggests that design function may universally be the core property of artifact concepts in human semantic memory.

  20. Parallel preconditioning techniques for sparse CG solvers

    Energy Technology Data Exchange (ETDEWEB)

    Basermann, A.; Reichel, B.; Schelthoff, C. [Central Institute for Applied Mathematics, Juelich (Germany)

    1996-12-31

    Conjugate gradient (CG) methods to solve sparse systems of linear equations play an important role in numerical methods for solving discretized partial differential equations. The large size and the condition of many technical or physical applications in this area result in the need for efficient parallelization and preconditioning techniques of the CG method. In particular for very ill-conditioned matrices, sophisticated preconditioner are necessary to obtain both acceptable convergence and accuracy of CG. Here, we investigate variants of polynomial and incomplete Cholesky preconditioners that markedly reduce the iterations of the simply diagonally scaled CG and are shown to be well suited for massively parallel machines.

  1. Primary standardization of a {sup 177}Lu solution; Padronizacao primaria de uma solucao de {sup 177}Lu

    Energy Technology Data Exchange (ETDEWEB)

    Iwahara, Akira; Silva, Carlos Jose da; Tauhata, Luiz; Oliveira, Estela Maria de, E-mail: iwahara@ird.gov.b, E-mail: carlos@ird.gov.b, E-mail: tauhata@ird.gov.b, E-mail: estela@ird.gov.b [Instituto de Radioprotecao e Dosimetria (IRD/CNEN-RJ), Rio de Janeiro, RJ (Brazil); Rezende, Eduarda Alexandre, E-mail: eduarda@ird.gov.b [Centro Federal de Educacao Tecnologica de Quimica (CEFET), Nilopolis, RJ (Brazil)

    2009-07-01

    For the purpose to make available reliable standards of {sup 177}Lu to the users and producers, a radionuclide solution was standardized using the primary methods of coincidence 4{pi}{beta}(PC)-{gamma}(NaI(Tl)) and of 4{pi}{beta}(LS)-{gamma}(NaI(Tl)). The results presented a convergence in the range of evaluated uncertainties. The standard uncertainties were of the 0.50 and 0.74% for the anticoincidence and coincidence respectively

  2. High spin K isomeric target of {sup 177m}Lu

    Energy Technology Data Exchange (ETDEWEB)

    Roig, O. E-mail: olivier.roig@cea.fr; Belier, G.; Daugas, J.-M.; Delbourgo, P.; Maunoury, L.; Meot, V.; Morichon, E.; Sauvestre, J.-E.; Aupiais, J.; Boulin, Y.; Fioni, G.; Letourneau, A.; Marie, F.; Ridikas, D

    2004-03-21

    The techniques used to produce a {sup 177m}Lu (J{sup {pi}}=23/2{sup -},T{sub 1/2}=160.4 days) target are described in this paper. Firstly, an isotopic separation of an enriched lutetium sample was used to reach a purity of {sup 176}Lu close to 99.993%. Afterwards, the high neutron flux of the Grenoble Institut Laue-Langevin reactor was used to produce the {sup 177m}Lu isomer by the {sup 176}Lu(n,{gamma}) reaction. Finally, a chemical separation was performed to extract 10{sup 13} nuclei of {sup 177m}Lu. Thanks to this experiment, we have been able to estimate the destruction cross-section of the {sup 177m}Lu.

  3. Comparison of tumour and whole body absorbed doses of 177-Lu-DOTA-TATE and Lu-177-DOTA-NOC treatment in the same patient group

    International Nuclear Information System (INIS)

    Yeyin, N.; Kabasakal, L.; Akyel, R.; Demir, M.; Kanmaz, B.; Ocak, M.; Toklu, T.; Selcuk, N.

    2015-01-01

    Full text of publication follows. Peptide Receptor Radionuclide Therapy (PRRT) with Lu-177 labelled peptides in patients with neuroendocrine tumours (NETs) aroused great interest. An estimation of actual radiation doses to tumours is very important for therapy planning. There are several radiolabelled peptides, which can be used for PRRT with different biological behaviour. Aim: the aim of the study was to compare the tumour and normal organ absorbed doses in patients who have received Lu-177-DOTA-TATE and Lu-177 DOTA-NOC. Materials and methods: study was composed of 20 patients (M/F: 10/10, mean age: 51.5 ± 14.9) with histologically proven inoperable NETs. All patients received Lu-177-DOTA-NOC treatment 6 to 12 weeks after last Lu-177-DOTA-TATE treatment. Dosimetric calculations were performed using MIRD scheme and lesion doses were calculated using post therapy whole body images obtained at 4, 20, 44, and 68 hours after injection. Tumour volumes were determined from CT images. Thirteen blood samples beginning from time zero to 4 days after injection were obtained for bone marrow and whole body dosimetry. Results: There were 53 lesions in Lu-177-DOTA-TATE post-therapy whole body images and 49 lesions in Lu-177 DOTA-NOC post therapy images. Lesions were selected according to lesion delineation and superimposed lesions were excluded. Mean lesion absorbed dose is calculated to be 47.4 ± 53.4 and 42.9 ± 52.8 Gy per 370 MBq for Lu-177-DOTA-TATE and DOTA-NOC respectively (p>0.5). There were significantly higher absorbed doses for kidney and bone marrow after Lu-177-DOTA-NOC treatment as compared to Lu-177-DOTA-TATE treatment, which were 6.9 ± 2.7 vs 3.9 ± 1.7 (p<0.05) and 0.12 ± 0.0 vs 0.10 ± 0.0 (p<0.05) Gy, respectively. There was not any difference in plasma elimination times between two tracers. On the other hand the whole body absorbed dose was significantly higher after Lu-177-DOTA-NOC treatment, which was 0.24 ± 0.07 vs 0.20 ± 0.06 Gy (p<0

  4. LuIII parvovirus selectively and efficiently targets, replicates in, and kills human glioma cells.

    Science.gov (United States)

    Paglino, Justin C; Ozduman, Koray; van den Pol, Anthony N

    2012-07-01

    Because productive infection by parvoviruses requires cell division and is enhanced by oncogenic transformation, some parvoviruses may have potential utility in killing cancer cells. To identify the parvovirus(es) with the optimal oncolytic effect against human glioblastomas, we screened 12 parvoviruses at a high multiplicity of infection (MOI). MVMi, MVMc, MVM-G17, tumor virus X (TVX), canine parvovirus (CPV), porcine parvovirus (PPV), rat parvovirus 1A (RPV1A), and H-3 were relatively ineffective. The four viruses with the greatest oncolytic activity, LuIII, H-1, MVMp, and MVM-G52, were tested for the ability, at a low MOI, to progressively infect the culture over time, causing cell death at a rate higher than that of cell proliferation. LuIII alone was effective in all five human glioblastomas tested. H-1 progressively infected only two of five; MVMp and MVM-G52 were ineffective in all five. To investigate the underlying mechanism of LuIII's phenotype, we used recombinant parvoviruses with the LuIII capsid replacing the MVMp capsid or with molecular alteration of the P4 promoter. The LuIII capsid enhanced efficient replication and oncolysis in MO59J gliomas cells; other gliomas tested required the entire LuIII genome to exhibit enhanced infection. LuIII selectively infected glioma cells over normal glial cells in vitro. In mouse models, human glioblastoma xenografts were selectively infected by LuIII when administered intratumorally; LuIII reduced tumor growth by 75%. LuIII also had the capacity to selectively infect subcutaneous or intracranial gliomas after intravenous inoculation. Intravenous or intracranial LuIII caused no adverse effects. Intracranial LuIII caused no infection of mature mouse neurons or glia in vivo but showed a modest infection of developing neurons.

  5. Regularized generalized eigen-decomposition with applications to sparse supervised feature extraction and sparse discriminant analysis

    DEFF Research Database (Denmark)

    Han, Xixuan; Clemmensen, Line Katrine Harder

    2015-01-01

    We propose a general technique for obtaining sparse solutions to generalized eigenvalue problems, and call it Regularized Generalized Eigen-Decomposition (RGED). For decades, Fisher's discriminant criterion has been applied in supervised feature extraction and discriminant analysis, and it is for...

  6. Fast Sparse Coding for Range Data Denoising with Sparse Ridges Constraint

    Directory of Open Access Journals (Sweden)

    Zhi Gao

    2018-05-01

    Full Text Available Light detection and ranging (LiDAR sensors have been widely deployed on intelligent systems such as unmanned ground vehicles (UGVs and unmanned aerial vehicles (UAVs to perform localization, obstacle detection, and navigation tasks. Thus, research into range data processing with competitive performance in terms of both accuracy and efficiency has attracted increasing attention. Sparse coding has revolutionized signal processing and led to state-of-the-art performance in a variety of applications. However, dictionary learning, which plays the central role in sparse coding techniques, is computationally demanding, resulting in its limited applicability in real-time systems. In this study, we propose sparse coding algorithms with a fixed pre-learned ridge dictionary to realize range data denoising via leveraging the regularity of laser range measurements in man-made environments. Experiments on both synthesized data and real data demonstrate that our method obtains accuracy comparable to that of sophisticated sparse coding methods, but with much higher computational efficiency.

  7. Interferometric interpolation of sparse marine data

    KAUST Repository

    Hanafy, Sherif M.

    2013-10-11

    We present the theory and numerical results for interferometrically interpolating 2D and 3D marine surface seismic profiles data. For the interpolation of seismic data we use the combination of a recorded Green\\'s function and a model-based Green\\'s function for a water-layer model. Synthetic (2D and 3D) and field (2D) results show that the seismic data with sparse receiver intervals can be accurately interpolated to smaller intervals using multiples in the data. An up- and downgoing separation of both recorded and model-based Green\\'s functions can help in minimizing artefacts in a virtual shot gather. If the up- and downgoing separation is not possible, noticeable artefacts will be generated in the virtual shot gather. As a partial remedy we iteratively use a non-stationary 1D multi-channel matching filter with the interpolated data. Results suggest that a sparse marine seismic survey can yield more information about reflectors if traces are interpolated by interferometry. Comparing our results to those of f-k interpolation shows that the synthetic example gives comparable results while the field example shows better interpolation quality for the interferometric method. © 2013 European Association of Geoscientists & Engineers.

  8. Balanced and sparse Tamo-Barg codes

    KAUST Repository

    Halbawi, Wael; Duursma, Iwan; Dau, Hoang; Hassibi, Babak

    2017-01-01

    We construct balanced and sparse generator matrices for Tamo and Barg's Locally Recoverable Codes (LRCs). More specifically, for a cyclic Tamo-Barg code of length n, dimension k and locality r, we show how to deterministically construct a generator matrix where the number of nonzeros in any two columns differs by at most one, and where the weight of every row is d + r - 1, where d is the minimum distance of the code. Since LRCs are designed mainly for distributed storage systems, the results presented in this work provide a computationally balanced and efficient encoding scheme for these codes. The balanced property ensures that the computational effort exerted by any storage node is essentially the same, whilst the sparse property ensures that this effort is minimal. The work presented in this paper extends a similar result previously established for Reed-Solomon (RS) codes, where it is now known that any cyclic RS code possesses a generator matrix that is balanced as described, but is sparsest, meaning that each row has d nonzeros.

  9. Atmospheric inverse modeling via sparse reconstruction

    Science.gov (United States)

    Hase, Nils; Miller, Scot M.; Maaß, Peter; Notholt, Justus; Palm, Mathias; Warneke, Thorsten

    2017-10-01

    Many applications in atmospheric science involve ill-posed inverse problems. A crucial component of many inverse problems is the proper formulation of a priori knowledge about the unknown parameters. In most cases, this knowledge is expressed as a Gaussian prior. This formulation often performs well at capturing smoothed, large-scale processes but is often ill equipped to capture localized structures like large point sources or localized hot spots. Over the last decade, scientists from a diverse array of applied mathematics and engineering fields have developed sparse reconstruction techniques to identify localized structures. In this study, we present a new regularization approach for ill-posed inverse problems in atmospheric science. It is based on Tikhonov regularization with sparsity constraint and allows bounds on the parameters. We enforce sparsity using a dictionary representation system. We analyze its performance in an atmospheric inverse modeling scenario by estimating anthropogenic US methane (CH4) emissions from simulated atmospheric measurements. Different measures indicate that our sparse reconstruction approach is better able to capture large point sources or localized hot spots than other methods commonly used in atmospheric inversions. It captures the overall signal equally well but adds details on the grid scale. This feature can be of value for any inverse problem with point or spatially discrete sources. We show an example for source estimation of synthetic methane emissions from the Barnett shale formation.

  10. Balanced and sparse Tamo-Barg codes

    KAUST Repository

    Halbawi, Wael

    2017-08-29

    We construct balanced and sparse generator matrices for Tamo and Barg\\'s Locally Recoverable Codes (LRCs). More specifically, for a cyclic Tamo-Barg code of length n, dimension k and locality r, we show how to deterministically construct a generator matrix where the number of nonzeros in any two columns differs by at most one, and where the weight of every row is d + r - 1, where d is the minimum distance of the code. Since LRCs are designed mainly for distributed storage systems, the results presented in this work provide a computationally balanced and efficient encoding scheme for these codes. The balanced property ensures that the computational effort exerted by any storage node is essentially the same, whilst the sparse property ensures that this effort is minimal. The work presented in this paper extends a similar result previously established for Reed-Solomon (RS) codes, where it is now known that any cyclic RS code possesses a generator matrix that is balanced as described, but is sparsest, meaning that each row has d nonzeros.

  11. Crystal growth, spectroscopic and laser properties of Tm:LuAG crystal

    Science.gov (United States)

    Xu, X. D.; Wang, X. D.; Lin, Z. F.; Cheng, Y.; Li, D. Z.; Cheng, S. S.; Wu, F.; Zhao, Z. W.; Gao, C. Q.; Gao, M. W.; Xu, J.

    2009-11-01

    Tm:Lu3Al5O12 (Tm:LuAG) crystal was grown by the Czochralski method. The segregation coefficient was measured by Inductively Coupled Plasma Atomic Emission Spectrometer. The cell parameters were analyzed with X-ray powder diffraction experiments. The absorption and fluorescence spectra of Tm:LuAG crystal at room temperature were investigated. With a 20 W fiber-coupled diode laser as pump source, the continuous-wave (CW) laser action of Tm:LuAG crystal was demonstrated. The maximum output power at 2020 nm was obtained to be 3.04 W, and the slope efficiency was 25.3%.

  12. Synthesis of DOTMP and biodistribution and imaging study of 177-Lu-DOTMP

    International Nuclear Information System (INIS)

    Deng Xinrong; Luo Zhifu; Xiang Xueqin; Li Fenglin; Fan Caiyun; Liu Zihua; Ye Zhaoyun; Li Hongyu; Chen Yang; Zhuang Ling

    2012-01-01

    Cyclen (1, 4, 7, 10-tetraazacyclododecane) and H 3 PO 3 was used to synthesis DOTMP (1, 4, 7, 10-tetraazacyclododecane-1, 4, 7, 10-Tetraamino methylenephosphonate). 177 Lu was produced by irradiating enriched lutetium oxide ( 176 Lu 2 O 3 ) with thermal neutron flux of 2' × 10 13 n/cm 2 /S in swimming pool reactor (SPR) for 10 days. And then DOTMP was labelled by 177 Lu. The biodistribution of 177 Lu-DOTMP in model mice bearing S180 sarcoma and SPECT imaging in Japanese white rabbit were also carried out. The results showed that the total activity of 177 LuCl 3 solution obtained was 9.19 × 10 5 MBq after corresponding chemical process. According to the optimal condition of the labeling experiment, the labelling efficiency of 177 Lu-DOTMP was 99.4%. The results of biodistribution study indicated that 177 Lu-DOTMP eliminated rapidly from blood and was delivered to target bone. The radioactivity uptake was mainly in bone and less in other viscera. The results of SPECT imaging showed that the radioactivity was accumulated in bladder. 177 Lu-DOTMP was mainly excreted by kidney. The uptake of the activity in the skeleton was observed within 22 h postinjection and it became quite significant at 46 h post injection. It indicated that 177 Lu-DOTMP has good bone targeting and is worthy of further research. (authors)

  13. Parallel sparse direct solver for integrated circuit simulation

    CERN Document Server

    Chen, Xiaoming; Yang, Huazhong

    2017-01-01

    This book describes algorithmic methods and parallelization techniques to design a parallel sparse direct solver which is specifically targeted at integrated circuit simulation problems. The authors describe a complete flow and detailed parallel algorithms of the sparse direct solver. They also show how to improve the performance by simple but effective numerical techniques. The sparse direct solver techniques described can be applied to any SPICE-like integrated circuit simulator and have been proven to be high-performance in actual circuit simulation. Readers will benefit from the state-of-the-art parallel integrated circuit simulation techniques described in this book, especially the latest parallel sparse matrix solution techniques. · Introduces complicated algorithms of sparse linear solvers, using concise principles and simple examples, without complex theory or lengthy derivations; · Describes a parallel sparse direct solver that can be adopted to accelerate any SPICE-like integrated circuit simulato...

  14. A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems

    Czech Academy of Sciences Publication Activity Database

    Benzi, M.; Tůma, Miroslav

    1998-01-01

    Roč. 19, č. 3 (1998), s. 968-994 ISSN 1064-8275 R&D Projects: GA ČR GA201/93/0067; GA AV ČR IAA230401 Keywords : large sparse systems * interative methods * preconditioning * approximate inverse * sparse linear systems * sparse matrices * incomplete factorizations * conjugate gradient -type methods Subject RIV: BA - General Mathematics Impact factor: 1.378, year: 1998

  15. Dose-shaping using targeted sparse optimization

    Energy Technology Data Exchange (ETDEWEB)

    Sayre, George A.; Ruan, Dan [Department of Radiation Oncology, University of California - Los Angeles School of Medicine, 200 Medical Plaza, Los Angeles, California 90095 (United States)

    2013-07-15

    Purpose: Dose volume histograms (DVHs) are common tools in radiation therapy treatment planning to characterize plan quality. As statistical metrics, DVHs provide a compact summary of the underlying plan at the cost of losing spatial information: the same or similar dose-volume histograms can arise from substantially different spatial dose maps. This is exactly the reason why physicians and physicists scrutinize dose maps even after they satisfy all DVH endpoints numerically. However, up to this point, little has been done to control spatial phenomena, such as the spatial distribution of hot spots, which has significant clinical implications. To this end, the authors propose a novel objective function that enables a more direct tradeoff between target coverage, organ-sparing, and planning target volume (PTV) homogeneity, and presents our findings from four prostate cases, a pancreas case, and a head-and-neck case to illustrate the advantages and general applicability of our method.Methods: In designing the energy minimization objective (E{sub tot}{sup sparse}), the authors utilized the following robust cost functions: (1) an asymmetric linear well function to allow differential penalties for underdose, relaxation of prescription dose, and overdose in the PTV; (2) a two-piece linear function to heavily penalize high dose and mildly penalize low and intermediate dose in organs-at risk (OARs); and (3) a total variation energy, i.e., the L{sub 1} norm applied to the first-order approximation of the dose gradient in the PTV. By minimizing a weighted sum of these robust costs, general conformity to dose prescription and dose-gradient prescription is achieved while encouraging prescription violations to follow a Laplace distribution. In contrast, conventional quadratic objectives are associated with a Gaussian distribution of violations, which is less forgiving to large violations of prescription than the Laplace distribution. As a result, the proposed objective E{sub tot

  16. Dose-shaping using targeted sparse optimization

    International Nuclear Information System (INIS)

    Sayre, George A.; Ruan, Dan

    2013-01-01

    Purpose: Dose volume histograms (DVHs) are common tools in radiation therapy treatment planning to characterize plan quality. As statistical metrics, DVHs provide a compact summary of the underlying plan at the cost of losing spatial information: the same or similar dose-volume histograms can arise from substantially different spatial dose maps. This is exactly the reason why physicians and physicists scrutinize dose maps even after they satisfy all DVH endpoints numerically. However, up to this point, little has been done to control spatial phenomena, such as the spatial distribution of hot spots, which has significant clinical implications. To this end, the authors propose a novel objective function that enables a more direct tradeoff between target coverage, organ-sparing, and planning target volume (PTV) homogeneity, and presents our findings from four prostate cases, a pancreas case, and a head-and-neck case to illustrate the advantages and general applicability of our method.Methods: In designing the energy minimization objective (E tot sparse ), the authors utilized the following robust cost functions: (1) an asymmetric linear well function to allow differential penalties for underdose, relaxation of prescription dose, and overdose in the PTV; (2) a two-piece linear function to heavily penalize high dose and mildly penalize low and intermediate dose in organs-at risk (OARs); and (3) a total variation energy, i.e., the L 1 norm applied to the first-order approximation of the dose gradient in the PTV. By minimizing a weighted sum of these robust costs, general conformity to dose prescription and dose-gradient prescription is achieved while encouraging prescription violations to follow a Laplace distribution. In contrast, conventional quadratic objectives are associated with a Gaussian distribution of violations, which is less forgiving to large violations of prescription than the Laplace distribution. As a result, the proposed objective E tot sparse improves

  17. Dose-shaping using targeted sparse optimization.

    Science.gov (United States)

    Sayre, George A; Ruan, Dan

    2013-07-01

    Dose volume histograms (DVHs) are common tools in radiation therapy treatment planning to characterize plan quality. As statistical metrics, DVHs provide a compact summary of the underlying plan at the cost of losing spatial information: the same or similar dose-volume histograms can arise from substantially different spatial dose maps. This is exactly the reason why physicians and physicists scrutinize dose maps even after they satisfy all DVH endpoints numerically. However, up to this point, little has been done to control spatial phenomena, such as the spatial distribution of hot spots, which has significant clinical implications. To this end, the authors propose a novel objective function that enables a more direct tradeoff between target coverage, organ-sparing, and planning target volume (PTV) homogeneity, and presents our findings from four prostate cases, a pancreas case, and a head-and-neck case to illustrate the advantages and general applicability of our method. In designing the energy minimization objective (E tot (sparse)), the authors utilized the following robust cost functions: (1) an asymmetric linear well function to allow differential penalties for underdose, relaxation of prescription dose, and overdose in the PTV; (2) a two-piece linear function to heavily penalize high dose and mildly penalize low and intermediate dose in organs-at risk (OARs); and (3) a total variation energy, i.e., the L1 norm applied to the first-order approximation of the dose gradient in the PTV. By minimizing a weighted sum of these robust costs, general conformity to dose prescription and dose-gradient prescription is achieved while encouraging prescription violations to follow a Laplace distribution. In contrast, conventional quadratic objectives are associated with a Gaussian distribution of violations, which is less forgiving to large violations of prescription than the Laplace distribution. As a result, the proposed objective E tot (sparse) improves tradeoff between

  18. Data analysis in high-dimensional sparse spaces

    DEFF Research Database (Denmark)

    Clemmensen, Line Katrine Harder

    classification techniques for high-dimensional problems are presented: Sparse discriminant analysis, sparse mixture discriminant analysis and orthogonality constrained support vector machines. The first two introduces sparseness to the well known linear and mixture discriminant analysis and thereby provide low...... are applied to classifications of fish species, ear canal impressions used in the hearing aid industry, microbiological fungi species, and various cancerous tissues and healthy tissues. In addition, novel applications of sparse regressions (also called the elastic net) to the medical, concrete, and food...

  19. Greedy vs. L1 convex optimization in sparse coding

    DEFF Research Database (Denmark)

    Ren, Huamin; Pan, Hong; Olsen, Søren Ingvor

    2015-01-01

    Sparse representation has been applied successfully in many image analysis applications, including abnormal event detection, in which a baseline is to learn a dictionary from the training data and detect anomalies from its sparse codes. During this procedure, sparse codes which can be achieved...... solutions. Considering the property of abnormal event detection, i.e., only normal videos are used as training data due to practical reasons, effective codes in classification application may not perform well in abnormality detection. Therefore, we compare the sparse codes and comprehensively evaluate...... their performance from various aspects to better understand their applicability, including computation time, reconstruction error, sparsity, detection...

  20. Triaxiality and the wobbling mode In 167Lu

    International Nuclear Information System (INIS)

    Amro, H.; Ma, W.C.; Winger, J.A.; Li, Y.; Thompson, J.; Hagemann, G.; Herskind, B.; Sletten, G.; Wilson, J.N.; Jensen, D.R.; Fallon, P.; Ward, D.; Diamond, R.M.; Goergen, A.; Machiavelli, A.; Huebel, H.; Domscheit, J.; Wiedenhoewer, I.

    2002-01-01

    High spin states in 167Lu nucleus were populated through the 123Sb(48Ca,xn) reaction at 203 MeV. Five presumably triaxial superdeformed (TSD) bands have been found. The electromagnetic properties of several connecting transitions between the yrast (TSD1) and the excited (TSD2) bands have been established. Evidence for the assignment of TSD2 band as a wobbling mode built on the yrast TSD band is presented. These bands coexist with bands built on quasiparticle excitations in normal deformed (ND) minimum for which new data are also presented

  1. Sparse Bayesian Learning for Nonstationary Data Sources

    Science.gov (United States)

    Fujimaki, Ryohei; Yairi, Takehisa; Machida, Kazuo

    This paper proposes an online Sparse Bayesian Learning (SBL) algorithm for modeling nonstationary data sources. Although most learning algorithms implicitly assume that a data source does not change over time (stationary), one in the real world usually does due to such various factors as dynamically changing environments, device degradation, sudden failures, etc (nonstationary). The proposed algorithm can be made useable for stationary online SBL by setting time decay parameters to zero, and as such it can be interpreted as a single unified framework for online SBL for use with stationary and nonstationary data sources. Tests both on four types of benchmark problems and on actual stock price data have shown it to perform well.

  2. Narrowband interference parameterization for sparse Bayesian recovery

    KAUST Repository

    Ali, Anum

    2015-09-11

    This paper addresses the problem of narrowband interference (NBI) in SC-FDMA systems by using tools from compressed sensing and stochastic geometry. The proposed NBI cancellation scheme exploits the frequency domain sparsity of the unknown signal and adopts a Bayesian sparse recovery procedure. This is done by keeping a few randomly chosen sub-carriers data free to sense the NBI signal at the receiver. As Bayesian recovery requires knowledge of some NBI parameters (i.e., mean, variance and sparsity rate), we use tools from stochastic geometry to obtain analytical expressions for the required parameters. Our simulation results validate the analysis and depict suitability of the proposed recovery method for NBI mitigation. © 2015 IEEE.

  3. Modern algorithms for large sparse eigenvalue problems

    International Nuclear Information System (INIS)

    Meyer, A.

    1987-01-01

    The volume is written for mathematicians interested in (numerical) linear algebra and in the solution of large sparse eigenvalue problems, as well as for specialists in engineering, who use the considered algorithms in the investigation of eigenoscillations of structures, in reactor physics, etc. Some variants of the algorithms based on the idea of a gradient-type direction of movement are presented and their convergence properties are discussed. From this, a general strategy for the direct use of preconditionings for the eigenvalue problem is derived. In this new approach the necessity of the solution of large linear systems is entirely avoided. Hence, these methods represent a new alternative to some other modern eigenvalue algorithms, as they show a slightly slower convergence on the one hand but essentially lower numerical and data processing problems on the other hand. A brief description and comparison of some well-known methods (i.e. simultaneous iteration, Lanczos algorithm) completes this volume. (author)

  4. Sparse random matrices: The eigenvalue spectrum revisited

    International Nuclear Information System (INIS)

    Semerjian, Guilhem; Cugliandolo, Leticia F.

    2003-08-01

    We revisit the derivation of the density of states of sparse random matrices. We derive a recursion relation that allows one to compute the spectrum of the matrix of incidence for finite trees that determines completely the low concentration limit. Using the iterative scheme introduced by Biroli and Monasson [J. Phys. A 32, L255 (1999)] we find an approximate expression for the density of states expected to hold exactly in the opposite limit of large but finite concentration. The combination of the two methods yields a very simple geometric interpretation of the tails of the spectrum. We test the analytic results with numerical simulations and we suggest an indirect numerical method to explore the tails of the spectrum. (author)

  5. ESTIMATION OF FUNCTIONALS OF SPARSE COVARIANCE MATRICES.

    Science.gov (United States)

    Fan, Jianqing; Rigollet, Philippe; Wang, Weichen

    High-dimensional statistical tests often ignore correlations to gain simplicity and stability leading to null distributions that depend on functionals of correlation matrices such as their Frobenius norm and other ℓ r norms. Motivated by the computation of critical values of such tests, we investigate the difficulty of estimation the functionals of sparse correlation matrices. Specifically, we show that simple plug-in procedures based on thresholded estimators of correlation matrices are sparsity-adaptive and minimax optimal over a large class of correlation matrices. Akin to previous results on functional estimation, the minimax rates exhibit an elbow phenomenon. Our results are further illustrated in simulated data as well as an empirical study of data arising in financial econometrics.

  6. Optical and scintillating properties of Ce:Li(Y,Lu)F4 single crystals

    International Nuclear Information System (INIS)

    Yokota, Yuui; Kurosawa, Shunsuke; Chani, Valery; Kamada, Kei; Yoshikawa, Akira

    2014-01-01

    We have investigated the optical and scintillating properties of Lu co-doped Ce:LiYF 4 single crystals with various Lu content. In the transmittance and absorption spectra, the absorption peaks at 243 nm get systematically red shifted in contrast to the peaks at 197 and 200 nm which get blue shifted with the increase in Lu content. At the same time, emission peaks at 306 nm and 200 nm under 295 nm excitation also get red shifted. The decay time of Ce:Li(Y,Lu)F 4 crystals under 295 nm excitation is found to be faster than that of Ce:LiYF 4 and Ce:LiLuF 4 crystals. The alpha-peak positions in the pulse-height spectra and decay times of crystals under alpha-ray irradiation are found to vary with the Lu content. - Highlights: • Optical and scintillation properties of Ce:Li(Y 1-x Lu x )F 4 crystals were inspected. • Increase of Lu content resulted change of the position of four absorption peaks. • Admixing of Y and Lu decreased the light yield and increased the decay time. • The Ce:LiLuF 4 crystal indicated the largest light yield in the pulse-height spectra. • Li[(Y 0.8 Lu 0.2 ) 0.98 Ce 0.02 ]F 4 indicated larger light yield than Ce:LiYF 4 crystal

  7. Comparison of the luminescent properties of Lu3Al5O12:Pr crystals and films under synchrotron radiation excitation

    International Nuclear Information System (INIS)

    Zorenko, Yu.; Gorbenko, V.; Zorenko, T.; Voznyak, T.; Nizankovskiy, S.

    2016-01-01

    The work is dedicated to comparative investigation of the luminescent properties of Lu 3 Al 5 O 12 :Pr(LuAG:Pr) single crystals and single crystalline films using excitation by synchrotron radiation with an energy of 3.7–25 eV in the exciton range of LuAG host. We have found that the differences in the excitation spectra and luminescence decay kinetics of LuAG:Pr crystals and films are caused by involving the LuAl antisite defects and oxygen vacancies in the crystals and Pb 2+ flux related dopants in the films in the excitation processes of the Pr 3+ luminescence. Taking into account these differences, we have determined the energy structure of the Pr 3+ ions in LuAG host and estimated the differences in the energies of creation of excitons bound with the isolated Pr 3+ ions in LuAG:Pr films and the dipole Pr–LuAl antisite defect centers in the crystal counterpart. - Highlights: • Comparison of the luminescent properties of LuAG:Pr single crystals and films. • Superposition of the Pr 3+ and defect centers luminescence of LuAG:Pr crystal. • Different creation energies of an excitons bound with the Pr 3+ in LuAG:Pr crystals and films. • More faster decay kinetics of the Pr 3+ luminescence in LuAG:Pr films. • Low content of slow emission component in LuAG:Pr films.

  8. Miniature Laboratory for Detecting Sparse Biomolecules

    Science.gov (United States)

    Lin, Ying; Yu, Nan

    2005-01-01

    A miniature laboratory system has been proposed for use in the field to detect sparsely distributed biomolecules. By emphasizing concentration and sorting of specimens prior to detection, the underlying system concept would make it possible to attain high detection sensitivities without the need to develop ever more sensitive biosensors. The original purpose of the proposal is to aid the search for signs of life on a remote planet by enabling the detection of specimens as sparse as a few molecules or microbes in a large amount of soil, dust, rocks, water/ice, or other raw sample material. Some version of the system could prove useful on Earth for remote sensing of biological contamination, including agents of biological warfare. Processing in this system would begin with dissolution of the raw sample material in a sample-separation vessel. The solution in the vessel would contain floating microscopic magnetic beads coated with substances that could engage in chemical reactions with various target functional groups that are parts of target molecules. The chemical reactions would cause the targeted molecules to be captured on the surfaces of the beads. By use of a controlled magnetic field, the beads would be concentrated in a specified location in the vessel. Once the beads were thus concentrated, the rest of the solution would be discarded. This procedure would obviate the filtration steps and thereby also eliminate the filter-clogging difficulties of typical prior sample-concentration schemes. For ferrous dust/soil samples, the dissolution would be done first in a separate vessel before the solution is transferred to the microbead-containing vessel.

  9. Peptide receptor radionuclide therapy (PRRT) using Lu-177 DOTA-NOC and Lu-177 DOTA-TATE: Comparative results

    International Nuclear Information System (INIS)

    Wehrmann, C.; Senftleben, S.; Baum, R.P.

    2007-01-01

    Full text: Aim: One of the few treatment options for inoperable neuroendocrine tumors (NET) is peptide receptor radiotherapy with somatostatin analogues. DOTA-NOC shows the highest affinity to the somatostatin receptors (sstr) 3 and 5 and a very high affinity to sstr 2. We compared the dosimetric parameters uptake, half-life (kinetics) and mean absorbed organ and tumor doses of 177 Lu DOTANOC and 177 Lu DOTA-TATE. Methods: 139 patients with neuroendocrine tumors with high sstr expression (verified by Ga-68 DOTA-NOC PET/CT) were studied. 130 patients (57m, 73f; aged 60±11a) were treated with 2.5-7.4 GBq Lu-177 DOTA-TATE and 9 patients (3m, 6f, aged 64±10a) with 3.6-7.4 GBq Lu-177 DOTA-NOC. Whole-body scans were performed after 0.5h, 3h, 24h, 48h, 72h and 96h p.i. Blood samples from 23 patients were obtained after therapy. By means of geometric mean and after background correction, ROI results were used to calculate the estimated absorbed organ and tumor doses according to the MIRD-scheme (OLINDA software). Results: Lu-177 DOTA-NOC showed a higher uptake as compared to Lu-177 DOTATATE (=100%): for whole-body about 38% and in normal tissue 36%, in the spleen 17% and in the kidneys 18%. The tumor uptake was about 5% higher for DOTA-TATE. The effective half-life for whole-body was comparable for both peptides (t1/2a NOC 2.9h vs. TATE 2.4h and t1/2b NOC 54h vs. TATE 56h). In normal tissue, t1/2a was similar (NOC 3.3h; TATE 2.6h) but the t1/2b was longer for DOTA-TATE (NOC 43h; TATE 48h). t1/2b was longer for DOTA-NOC in the spleen (NOC 81h; TATE 72h) and in the kidney (NOC 68.1h; TATE 65h). The mean absorbed dose in the kidney (TATE 5Sv; NOC 6Sv) and spleen (TATE 7Sv; NOC 8Sv) was higher for DOTA-NOC. In the tumor, the t1/2b was higher for DOTA-TATE (NOC 65h; TATE 77h). For DOTA-TATE the whole-body dose was lower (0.27Sv) as compared to DOTA-NOC (0.38 Sv) (significant by unpaired sign test). The estimated mean absorbed tumor doses were 47+/-66 Sv for DOTA-TATE and 35

  10. İki uçlu bozukluk 1 ve iki uçlu bozukluk 2 depresyon tedavisi arasındaki farklar

    OpenAIRE

    Sayar, Kemal

    2013-01-01

    İki uçlu bozukluk 1 ve 2 depresyonları, klinik açıdan farklılıklar gösterebilmektedir. İki uçlu bozukluk 2 ve iki uçlu bozukluk 1 depresyonların tedavisi arasındaki farklar ise tartışmalı bir alandır. Henüz İki uçlu bozukluk 2 depresyon tedavisi konusunda yeterince kanıt birikmemişse de ilk veriler her iki durumun tedavisinde farklar olması gerektiğini düşündürmektedir. Özellikle antidepresan kullanımı konusunda dikkatli olmak gerekmektedir.

  11. Beta-glycosidase (amygdalase and linamarase) from Endomyces fibuliger (LU677): formation and crude enzymes properties.

    NARCIS (Netherlands)

    Brimer, L.; Nout, M.J.R.; Tuncel, G.

    1998-01-01

    In our previous studies, the yeast Endomyces fibuliger LU677 was found to degrade amygdalin in bitter apricot seeds. The present investigation shows that E. fibuliger LU677 produces extracellular beta-glycosidase activity when grown in malt extract broth (MEB). Growth was very good at 25 degrees C

  12. Neoadjuvant Treatment of Nonfunctioning Pancreatic Neuroendocrine Tumors with [177Lu-DOTA0,Tyr3]Octreotate

    NARCIS (Netherlands)

    van Vliet, Esther I.; van Eijck, Casper H.; de Krijger, Ronald R.; Nieveen van Dijkum, Elisabeth J.; Teunissen, Jaap J.; Kam, Boen L.; de Herder, Wouter W.; Feelders, Richard A.; Bonsing, Bert A.; Brabander, Tessa; Krenning, Eric P.; Kwekkeboom, Dik J.

    2015-01-01

    Pancreatic neuroendocrine tumors (NETs) are rare neoplasms for which surgery has almost the only potential for cure. When surgery is not possible because of tumor size and vascular involvement, neoadjuvant treatment with [(177)Lu-DOTA(0),Tyr(3)]octreotate ((177)Lu-octreotate) may be an option. We

  13. Classification of multispectral or hyperspectral satellite imagery using clustering of sparse approximations on sparse representations in learned dictionaries obtained using efficient convolutional sparse coding

    Science.gov (United States)

    Moody, Daniela; Wohlberg, Brendt

    2018-01-02

    An approach for land cover classification, seasonal and yearly change detection and monitoring, and identification of changes in man-made features may use a clustering of sparse approximations (CoSA) on sparse representations in learned dictionaries. The learned dictionaries may be derived using efficient convolutional sparse coding to build multispectral or hyperspectral, multiresolution dictionaries that are adapted to regional satellite image data. Sparse image representations of images over the learned dictionaries may be used to perform unsupervised k-means clustering into land cover categories. The clustering process behaves as a classifier in detecting real variability. This approach may combine spectral and spatial textural characteristics to detect geologic, vegetative, hydrologic, and man-made features, as well as changes in these features over time.

  14. Sparse Source EEG Imaging with the Variational Garrote

    DEFF Research Database (Denmark)

    Hansen, Sofie Therese; Stahlhut, Carsten; Hansen, Lars Kai

    2013-01-01

    EEG imaging, the estimation of the cortical source distribution from scalp electrode measurements, poses an extremely ill-posed inverse problem. Recent work by Delorme et al. (2012) supports the hypothesis that distributed source solutions are sparse. We show that direct search for sparse solutions...

  15. Support agnostic Bayesian matching pursuit for block sparse signals

    KAUST Repository

    Masood, Mudassir; Al-Naffouri, Tareq Y.

    2013-01-01

    priori knowledge of block partition and utilizes a greedy approach and order-recursive updates of its metrics to find the most dominant sparse supports to determine the approximate minimum mean square error (MMSE) estimate of the block-sparse signal

  16. Local posterior concentration rate for multilevel sparse sequences

    NARCIS (Netherlands)

    Belitser, E.N.; Nurushev, N.

    2017-01-01

    We consider empirical Bayesian inference in the many normal means model in the situation when the high-dimensional mean vector is multilevel sparse, that is,most of the entries of the parameter vector are some fixed values. For instance, the traditional sparse signal is a particular case (with one

  17. Joint Group Sparse PCA for Compressed Hyperspectral Imaging.

    Science.gov (United States)

    Khan, Zohaib; Shafait, Faisal; Mian, Ajmal

    2015-12-01

    A sparse principal component analysis (PCA) seeks a sparse linear combination of input features (variables), so that the derived features still explain most of the variations in the data. A group sparse PCA introduces structural constraints on the features in seeking such a linear combination. Collectively, the derived principal components may still require measuring all the input features. We present a joint group sparse PCA (JGSPCA) algorithm, which forces the basic coefficients corresponding to a group of features to be jointly sparse. Joint sparsity ensures that the complete basis involves only a sparse set of input features, whereas the group sparsity ensures that the structural integrity of the features is maximally preserved. We evaluate the JGSPCA algorithm on the problems of compressed hyperspectral imaging and face recognition. Compressed sensing results show that the proposed method consistently outperforms sparse PCA and group sparse PCA in reconstructing the hyperspectral scenes of natural and man-made objects. The efficacy of the proposed compressed sensing method is further demonstrated in band selection for face recognition.

  18. Confidence of model based shape reconstruction from sparse data

    DEFF Research Database (Denmark)

    Baka, N.; de Bruijne, Marleen; Reiber, J. H. C.

    2010-01-01

    Statistical shape models (SSM) are commonly applied for plausible interpolation of missing data in medical imaging. However, when fitting a shape model to sparse information, many solutions may fit the available data. In this paper we derive a constrained SSM to fit noisy sparse input landmarks...

  19. Comparison of Methods for Sparse Representation of Musical Signals

    DEFF Research Database (Denmark)

    Endelt, Line Ørtoft; la Cour-Harbo, Anders

    2005-01-01

    by a number of sparseness measures and results are shown on the ℓ1 norm of the coefficients, using a dictionary containing a Dirac basis, a Discrete Cosine Transform, and a Wavelet Packet. Evaluated only on the sparseness Matching Pursuit is the best method, and it is also relatively fast....

  20. Robust Face Recognition Via Gabor Feature and Sparse Representation

    Directory of Open Access Journals (Sweden)

    Hao Yu-Juan

    2016-01-01

    Full Text Available Sparse representation based on compressed sensing theory has been widely used in the field of face recognition, and has achieved good recognition results. but the face feature extraction based on sparse representation is too simple, and the sparse coefficient is not sparse. In this paper, we improve the classification algorithm based on the fusion of sparse representation and Gabor feature, and then improved algorithm for Gabor feature which overcomes the problem of large dimension of the vector dimension, reduces the computation and storage cost, and enhances the robustness of the algorithm to the changes of the environment.The classification efficiency of sparse representation is determined by the collaborative representation,we simplify the sparse constraint based on L1 norm to the least square constraint, which makes the sparse coefficients both positive and reduce the complexity of the algorithm. Experimental results show that the proposed method is robust to illumination, facial expression and pose variations of face recognition, and the recognition rate of the algorithm is improved.

  1. Crystal growth, spectral and laser properties of Nd:LuAG single crystal

    International Nuclear Information System (INIS)

    Xu, X D; Meng, J Q; Cheng, Y; Li, D Z; Cheng, S S; Wu, F; Zhao, Z W; Wang, X D; Xu, J

    2009-01-01

    Nd:LuAG (Nd:Lu 3 Al 5 O 12 ) crystal was grown by the Czochralski method. X-ray powder diffraction experiments show that the Nd:LuAG crystal crystallizes in the cubic with space group Ia3d and has the cell parameter: a = 1.1907 nm, V = 1.6882 nm 3 . The absorption and fluorescence spectra of Nd:LuAG crystal at room temperature were investigated. With a fiber-coupled diode laser as pump source, the continuous-wave (CW) laser action of Nd:LuAG crystal was demonstrated. The maximum output power at 1064 nm was obtained to be 3.8 W under the incident pump power of 17.3 W, with the optical conversion efficiency 22.0% and the slope efficiency 25.7%

  2. Crystal growth, spectral and laser properties of Nd:LuAG single crystal

    Science.gov (United States)

    Xu, X. D.; Wang, X. D.; Meng, J. Q.; Cheng, Y.; Li, D. Z.; Cheng, S. S.; Wu, F.; Zhao, Z. W.; Xu, J.

    2009-09-01

    Nd:LuAG (Nd:Lu3Al5O12) crystal was grown by the Czochralski method. X-ray powder diffraction experiments show that the Nd:LuAG crystal crystallizes in the cubic with space group Ia3d and has the cell parameter: a = 1.1907 nm, V = 1.6882 nm3. The absorption and fluorescence spectra of Nd:LuAG crystal at room temperature were investigated. With a fiber-coupled diode laser as pump source, the continuous-wave (CW) laser action of Nd:LuAG crystal was demonstrated. The maximum output power at 1064 nm was obtained to be 3.8 W under the incident pump power of 17.3 W, with the optical conversion efficiency 22.0% and the slope efficiency 25.7%.

  3. Green and red luminescence in co-precipitation synthesized Pr:LuAG nanophosphor

    Energy Technology Data Exchange (ETDEWEB)

    Kumar, S. Arun; Kumar, K. Ashok; Gunaseelan, M.; Senthilselvan, J., E-mail: jsselvan@hotmail.com [Department of Nuclear Physics, University of Madras, Guindy Campus, Chennai–600 025, Tamil Nadu (India); Asokan, K. [Materials Science Group, Inter University Accelerator Centre, New Delhi-110067 (India)

    2016-05-06

    Pr:LuAG nanophosphor is an effective candidate in magnetic resonance imaging coupled positron emission tomography (MRI-PET) for medical imaging and scintillator applications. LuAG:Pr (0.05, 0.15 mol%) nanoscale ceramic powders were synthesized by co-precipitation method using urea as precipitant. Effect of antisite defect on structure and luminescence behavior was investigated. Pr:LuAG nanoceramic powders are found crystallized in cubic structure by high temperature calcination at 1400 °C and it shows antisite defect. HR-SEM analysis revealed spherically shaped Pr:LuAG nanoceramic particulate powders with ∼100 nm size. By the excitation at 450 nm, Pr:LuAG nanophosphor exhibit green to red luminescence in the wavelength range of 520 to 680 nm, which is originated from multiplet transition of Pr{sup 3+} ions.

  4. In-beam spectroscopy study of the proton emitter 151Lu

    International Nuclear Information System (INIS)

    Yu, C.; Rykaczewski, K.; Toth, K.S.; Akovali, Y.; Baktash, C.; Galindo-Uribarri, A.; Gross, C.J.; Paul, S.D.; Radford, D.C.; Batchelder, J.C.; Gross, C.J.; Bingham, C.R.; Grzywacz, R.; Kim, S.H.; Weintraub, W.; Ginter, T.N.; Grzywacz, R.; Rykaczewski, K.; Karny, M.; MacDonald, B.D.; Szerypo, J.

    1998-01-01

    Gamma rays decaying from the excited states of the proton-unbound 151 Lu were observed for the first time in an experiment using the 96 Ru( 58 Ni,p2n) 151 Lu reaction. These γ rays were identified by correlating prompt γ radiations at the target position with 151 Lu proton radioactivities at the focal plane of a recoil mass separator. Systematic data on N=80 isotones suggest a possible isomeric level at high spin in 151 Lu. Our measurement was unable to observe such an isomer, but provided an upper limit on its half-life. The observed γ rays in 151 Lu can be interpreted in terms of two possible level structures. copyright 1998 The American Physical Society

  5. Optical spectroscopy and luminescence quenching of LuI3:Ce3+

    International Nuclear Information System (INIS)

    Birowosuto, M.D.; Dorenbos, P.; Haas, J.T.M. de; Eijk, C.W.E. van; Kraemer, K.W.; Guedel, H.U.

    2006-01-01

    Optical spectroscopy of LuI 3 doped with Ce 3+ using ultraviolet and visible light excitation is reported. LuI 3 host excitation and emission and 4f-5d excitation and emission of Ce 3+ are observed. An empirical model based on crystal field splitting was used to estimate the energy of the highest 4f-5d excitation band. The crystal field splitting and centroid shift were compared to those of LuCl 3 :Ce 3+ and LuBr 3 :Ce 3+ . Temperature dependence of X-ray excited luminescence spectra shows thermal quenching, whereas that of the decay curve of Ce 3+ emission excited at the lowest 5d band of Ce 3+ does not indicate the presence of quenching of Ce 3+ emission for temperature below 625K. The quenching in LuI 3 :Ce 3+ therefore occurs before the 5d Ce 3+ emission takes place

  6. Sparse Frequency Waveform Design for Radar-Embedded Communication

    Directory of Open Access Journals (Sweden)

    Chaoyun Mai

    2016-01-01

    Full Text Available According to the Tag application with function of covert communication, a method for sparse frequency waveform design based on radar-embedded communication is proposed. Firstly, sparse frequency waveforms are designed based on power spectral density fitting and quasi-Newton method. Secondly, the eigenvalue decomposition of the sparse frequency waveform sequence is used to get the dominant space. Finally the communication waveforms are designed through the projection of orthogonal pseudorandom vectors in the vertical subspace. Compared with the linear frequency modulation waveform, the sparse frequency waveform can further improve the bandwidth occupation of communication signals, thus achieving higher communication rate. A certain correlation exists between the reciprocally orthogonal communication signals samples and the sparse frequency waveform, which guarantees the low SER (signal error rate and LPI (low probability of intercept. The simulation results verify the effectiveness of this method.

  7. Comparative study of optical and scintillation properties of YVO4, (Lu0.5Y0.5)VO4, and LuVO4 single crystals

    International Nuclear Information System (INIS)

    Fujimoto, Yutaka; Yanagida, Takayuki; Yokota, Yuui; Chani, Valery; Kochurikhin, Vladimir V.; Yoshikawa, Akira

    2011-01-01

    Optical and scintillation properties of YVO 4 , (Lu 0.5 Y 0.5 )VO 4 , and LuVO 4 single crystals grown by the Czochralski (CZ) method with RF heating system are compared. All vanadate crystals show high transmittance (∼80%) in the 400-900 nm wavelength range. In both photo- and radio-luminescence spectra, intense peak around 400-500 nm, which was ascribed to the transition from triplet state of VO 4 3- , was clearly observed. The main decay time component was about 38 μs (YVO 4 ), 18 μs ((Lu 0.5 Y 0.5 )VO 4 ), and 17 μs (LuVO 4 ) under 340 nm excitation. The scintillation light yields of YVO 4 , (Lu 0.5 Y 0.5 )VO 4 , and LuVO 4 crystals (obtained from the 137 Cs excited pulse height spectra) were evaluated to be about 11,200, 10,700, and 10,300 ph/MeV, respectively.

  8. Biferroic LuCrO{sub 3}: Structural characterization, magnetic and dielectric properties

    Energy Technology Data Exchange (ETDEWEB)

    Durán, A., E-mail: dural@cnyn.unam.mx [Universidad Nacional Autónoma de México, Centro de Nanociencias y Nanotecnología, Km. 107 Carretera Tijuana-Ensenada, Apartado Postal 14, C.P. 22800 Ensenada, BC (Mexico); Meza F, C.; Morán, E.; Alario-Franco, M.A. [Departamento de Química Inorgánica y Laboratorio Complutense de Altas Presiones, Facultad de Química, Universidad Complutense de Madrid, EU, 28040 Madrid (Spain); Ostos, C., E-mail: ceostoso@gmail.com [Instituto de Química, Universidad de Antioquia UdeA, Calle 70 No. 52-21, Medellín (Colombia)

    2014-02-14

    Multiferroic LuCrO{sub 3} perovskite-type structure (Pbnm) obtained via auto-ignition synthesis was characterized by a combination of X-ray diffraction (XRD) and thermogravimetric (TG) techniques, and through magnetization and permittivity measurements. Results showed that amorphous combustion powders were fully transformed to orthorhombic LuCrO{sub 3} structure at 1200 K after the first LuCrO{sub 4} crystallization at 700 K. The magnetic response displays thermal irreversibility between zero-field-cooling and field-cooling condition which is due to spin canted AF switching at 116 K. Accordingly, a hysteresis loop in the M(H) data confirms weak ferromagnetism in LuCrO{sub 3}. On the other hand, the permittivity measurement shows a broad peak transition typical of relaxor-type ferroelectrics transition at ∼450 K. Electrical conductivity increases as temperature increases showing an anomaly around the diffuse phase transition. The diffuse phase transition and the formation of the charge carriers are discussed in terms of a local distortion around the Lu Site. - Highlights: • Multiferroic LuCrO{sub 3} was successfully obtained via auto-ignition synthesis. • Amorphous powder is transformed first to LuCrO{sub 4} (700 K) and next to LuCrO{sub 3} (1100 K). • The CrO{sub 6} octahedra are tilted away and rotates from the ideal octahedral shape. • LuCrO{sub 3} exhibits a canted AFM transition (116 K) and a relaxor ferroelectric behavior. • Tilting and rotation of CrO{sub 6} octahedra influenced transport properties on LuCrO{sub 3}.

  9. Biferroic LuCrO3: Structural characterization, magnetic and dielectric properties

    International Nuclear Information System (INIS)

    Durán, A.; Meza F, C.; Morán, E.; Alario-Franco, M.A.; Ostos, C.

    2014-01-01

    Multiferroic LuCrO 3 perovskite-type structure (Pbnm) obtained via auto-ignition synthesis was characterized by a combination of X-ray diffraction (XRD) and thermogravimetric (TG) techniques, and through magnetization and permittivity measurements. Results showed that amorphous combustion powders were fully transformed to orthorhombic LuCrO 3 structure at 1200 K after the first LuCrO 4 crystallization at 700 K. The magnetic response displays thermal irreversibility between zero-field-cooling and field-cooling condition which is due to spin canted AF switching at 116 K. Accordingly, a hysteresis loop in the M(H) data confirms weak ferromagnetism in LuCrO 3 . On the other hand, the permittivity measurement shows a broad peak transition typical of relaxor-type ferroelectrics transition at ∼450 K. Electrical conductivity increases as temperature increases showing an anomaly around the diffuse phase transition. The diffuse phase transition and the formation of the charge carriers are discussed in terms of a local distortion around the Lu Site. - Highlights: • Multiferroic LuCrO 3 was successfully obtained via auto-ignition synthesis. • Amorphous powder is transformed first to LuCrO 4 (700 K) and next to LuCrO 3 (1100 K). • The CrO 6 octahedra are tilted away and rotates from the ideal octahedral shape. • LuCrO 3 exhibits a canted AFM transition (116 K) and a relaxor ferroelectric behavior. • Tilting and rotation of CrO 6 octahedra influenced transport properties on LuCrO 3

  10. The infrared radiation spectrum of acupoint taiyuan (LU 9) in asthma patients.

    Science.gov (United States)

    Zhou, Yu; Shen, Xue-yong; Wang, Li-zhen; Wei, Jian-zi; Cheng, Ke

    2012-06-01

    To analyze the distinctive pathological characteristics in the spectrums of spontaneous infrared radiation at the Taiyuan (LU 9) acupoint in patients with asthma. A highly sensitive infrared spectrum detecting device was used to detect the spectrums of spontaneous infrared radiation at Taiyuan (LU 9) in 37 asthma patients and 34 healthy volunteers. Asthma patients had significantly lower infrared intensity than that of the healthy volunteers (P>0.01). Asthma patients had significantly lower overall infrared radiation intensity at the left Taiyuan (LU 9) than that of healthy volunteers (P > 0.05), but there was no significant difference between healthy volunteers and asthma patients at the right Taiyuan (LU 9) (P > 0.05). The infrared radiation intensity of 17 wavelength spots at the left Taiyuan (LU 9) and 4 wavelength spots at the right Taiyuan (LU 9) in asthma patients were significantly lower than those of healthy volunteers (P > 0.05). At 2 microm, the infrared radiation intensity of asthma patients was significantly stronger than that of healthy volunteers (P > 0.05). At 19 wavelength spots in the healthy volunteers and at 4 wave-length spots in the asthma patients, the left Taiyuan (LU 9) showed a significantly stronger intensity than that of the right Taiyuan (LU 9) (P > 0.05S). By Pearson's chi2 test, healthy volunteers had more wavelength spots that were significantly different between the left and right Taiyuan (LU 9) than the asthma patients (P > 0.01). Changes in the infrared spectrum at the Taiyuan (LU 9) acupoint in asthma patients may reflect distinct pathological changes. Certain acupuncture points may be related to specific organs.

  11. Relaxations to Sparse Optimization Problems and Applications

    Science.gov (United States)

    Skau, Erik West

    Parsimony is a fundamental property that is applied to many characteristics in a variety of fields. Of particular interest are optimization problems that apply rank, dimensionality, or support in a parsimonious manner. In this thesis we study some optimization problems and their relaxations, and focus on properties and qualities of the solutions of these problems. The Gramian tensor decomposition problem attempts to decompose a symmetric tensor as a sum of rank one tensors.We approach the Gramian tensor decomposition problem with a relaxation to a semidefinite program. We study conditions which ensure that the solution of the relaxed semidefinite problem gives the minimal Gramian rank decomposition. Sparse representations with learned dictionaries are one of the leading image modeling techniques for image restoration. When learning these dictionaries from a set of training images, the sparsity parameter of the dictionary learning algorithm strongly influences the content of the dictionary atoms.We describe geometrically the content of trained dictionaries and how it changes with the sparsity parameter.We use statistical analysis to characterize how the different content is used in sparse representations. Finally, a method to control the structure of the dictionaries is demonstrated, allowing us to learn a dictionary which can later be tailored for specific applications. Variations of dictionary learning can be broadly applied to a variety of applications.We explore a pansharpening problem with a triple factorization variant of coupled dictionary learning. Another application of dictionary learning is computer vision. Computer vision relies heavily on object detection, which we explore with a hierarchical convolutional dictionary learning model. Data fusion of disparate modalities is a growing topic of interest.We do a case study to demonstrate the benefit of using social media data with satellite imagery to estimate hazard extents. In this case study analysis we

  12. Scintillation properties of Ce-doped LuLiF{sub 4} and LuScBO{sub 3}

    Energy Technology Data Exchange (ETDEWEB)

    Yanagida, Takayuki, E-mail: t_yanagi@tagen.tohoku.ac.jp [IMRAM, Tohoku University, 2-1-1 Katahira, Aoba-ku, Sendai, Miyagi 980-8577 (Japan); Fujimoto, Yutaka [IMRAM, Tohoku University, 2-1-1 Katahira, Aoba-ku, Sendai, Miyagi 980-8577 (Japan); Kawaguchi, Noriaki [IMRAM, Tohoku University, 2-1-1 Katahira, Aoba-ku, Sendai, Miyagi 980-8577 (Japan); Tokuyama Corporation, Shibuya 3-chome, Shibuya-ku, Tokyo 150-8383 (Japan); Yokota, Yuui [IMRAM, Tohoku University, 2-1-1 Katahira, Aoba-ku, Sendai, Miyagi 980-8577 (Japan); Kamada, Kei [Materials Research Laboratory, Furukawa, Co. Ltd., 1-25-13 Kannondai, Tsukuba, Ibaragi 305-0856 (Japan); Totsuka, Daisuke [Nihon Kessho Kogaku Co., Ltd., 810-5 Nobe-cho, Tatebayashi, Gunma 374-0047 (Japan); Hatamoto, Shun-Ichi [Corporate Research and Development Center, Mitsui Mining and Smelting Co., Ltd., 1333-2 Haraichi, Ageo Saitama 362-0023 (Japan); Yoshikawa, Akira; Chani, Valery [IMRAM, Tohoku University, 2-1-1 Katahira, Aoba-ku, Sendai, Miyagi 980-8577 (Japan)

    2011-10-01

    The crystals of 1 mol% Ce-doped LuLiF{sub 4} (Ce:LLF) grown by the micro-pulling down ({mu}-PD) method and 1 mol% Ce-doped LuScBO{sub 3} (Ce:LSBO) grown by the conventional Czochralski (Cz) method were examined for their scintillation properties. Ce:LLF and Ce:LSBO demonstrated {approx}80% transparency at wavelengths longer than 300 and 400 nm, respectively. When excited by {sup 241}Am {alpha}-ray to obtain radioactive luminescence spectra, Ce{sup 3+} 5d-4f emission peaks were detected at around 320 nm for Ce:LLF and at around 380 nm for Ce:LSBO. In Ce:LSBO, the host luminescence was also observed at 260 nm. By recording pulse height spectra under {gamma}-ray irradiation, the absolute light yield of Ce:LLF and Ce:LSBO was measured to be 3600{+-}400 and 4200{+-}400 ph/MeV, respectively. Decay time kinetics was also investigated using a pulse X-ray equipped streak camera system. The main component of Ce:LLF was {approx}320 ns and that of Ce:LSBO was {approx}31 ns. In addition, the light yield non-proportionality and energy resolution against the {gamma}-ray energy were evaluated.

  13. Sparse alignment for robust tensor learning.

    Science.gov (United States)

    Lai, Zhihui; Wong, Wai Keung; Xu, Yong; Zhao, Cairong; Sun, Mingming

    2014-10-01

    Multilinear/tensor extensions of manifold learning based algorithms have been widely used in computer vision and pattern recognition. This paper first provides a systematic analysis of the multilinear extensions for the most popular methods by using alignment techniques, thereby obtaining a general tensor alignment framework. From this framework, it is easy to show that the manifold learning based tensor learning methods are intrinsically different from the alignment techniques. Based on the alignment framework, a robust tensor learning method called sparse tensor alignment (STA) is then proposed for unsupervised tensor feature extraction. Different from the existing tensor learning methods, L1- and L2-norms are introduced to enhance the robustness in the alignment step of the STA. The advantage of the proposed technique is that the difficulty in selecting the size of the local neighborhood can be avoided in the manifold learning based tensor feature extraction algorithms. Although STA is an unsupervised learning method, the sparsity encodes the discriminative information in the alignment step and provides the robustness of STA. Extensive experiments on the well-known image databases as well as action and hand gesture databases by encoding object images as tensors demonstrate that the proposed STA algorithm gives the most competitive performance when compared with the tensor-based unsupervised learning methods.

  14. Regression analysis of sparse asynchronous longitudinal data.

    Science.gov (United States)

    Cao, Hongyuan; Zeng, Donglin; Fine, Jason P

    2015-09-01

    We consider estimation of regression models for sparse asynchronous longitudinal observations, where time-dependent responses and covariates are observed intermittently within subjects. Unlike with synchronous data, where the response and covariates are observed at the same time point, with asynchronous data, the observation times are mismatched. Simple kernel-weighted estimating equations are proposed for generalized linear models with either time invariant or time-dependent coefficients under smoothness assumptions for the covariate processes which are similar to those for synchronous data. For models with either time invariant or time-dependent coefficients, the estimators are consistent and asymptotically normal but converge at slower rates than those achieved with synchronous data. Simulation studies evidence that the methods perform well with realistic sample sizes and may be superior to a naive application of methods for synchronous data based on an ad hoc last value carried forward approach. The practical utility of the methods is illustrated on data from a study on human immunodeficiency virus.

  15. Duplex scanning using sparse data sequences

    DEFF Research Database (Denmark)

    Møllenbach, S. K.; Jensen, Jørgen Arendt

    2008-01-01

    reconstruction of the missing samples possible. The periodic pattern has the length T = M + A samples, where M are for B-mode and A for velocity estimation. The missing samples can now be reconstructed using a filter bank. One filter bank reconstructs one missing sample, so the number of filter banks corresponds...... to M. The number of sub filters in every filter bank is the same as A. Every sub filter contains fractional delay (FD) filter and an interpolation function. Many different sequences can be selected to adapt the B-mode frame rate needed. The drawback of the method is that the maximum velocity detectable......, the fprf and the resolution are 15 MHz, 3.5 kHz, and 12 bit sample (8 kHz and 16 bit for the Carotid artery). The resulting data contains 8000 RF lines with 128 samples at a depth of 45 mm for the vein and 50 mm for Aorta. Sparse sequences are constructed from the full data sequences to have both...

  16. Transformer fault diagnosis using continuous sparse autoencoder.

    Science.gov (United States)

    Wang, Lukun; Zhao, Xiaoying; Pei, Jiangnan; Tang, Gongyou

    2016-01-01

    This paper proposes a novel continuous sparse autoencoder (CSAE) which can be used in unsupervised feature learning. The CSAE adds Gaussian stochastic unit into activation function to extract features of nonlinear data. In this paper, CSAE is applied to solve the problem of transformer fault recognition. Firstly, based on dissolved gas analysis method, IEC three ratios are calculated by the concentrations of dissolved gases. Then IEC three ratios data is normalized to reduce data singularity and improve training speed. Secondly, deep belief network is established by two layers of CSAE and one layer of back propagation (BP) network. Thirdly, CSAE is adopted to unsupervised training and getting features. Then BP network is used for supervised training and getting transformer fault. Finally, the experimental data from IEC TC 10 dataset aims to illustrate the effectiveness of the presented approach. Comparative experiments clearly show that CSAE can extract features from the original data, and achieve a superior correct differentiation rate on transformer fault diagnosis.

  17. Joint Sparse Recovery With Semisupervised MUSIC

    Science.gov (United States)

    Wen, Zaidao; Hou, Biao; Jiao, Licheng

    2017-05-01

    Discrete multiple signal classification (MUSIC) with its low computational cost and mild condition requirement becomes a significant noniterative algorithm for joint sparse recovery (JSR). However, it fails in rank defective problem caused by coherent or limited amount of multiple measurement vectors (MMVs). In this letter, we provide a novel sight to address this problem by interpreting JSR as a binary classification problem with respect to atoms. Meanwhile, MUSIC essentially constructs a supervised classifier based on the labeled MMVs so that its performance will heavily depend on the quality and quantity of these training samples. From this viewpoint, we develop a semisupervised MUSIC (SS-MUSIC) in the spirit of machine learning, which declares that the insufficient supervised information in the training samples can be compensated from those unlabeled atoms. Instead of constructing a classifier in a fully supervised manner, we iteratively refine a semisupervised classifier by exploiting the labeled MMVs and some reliable unlabeled atoms simultaneously. Through this way, the required conditions and iterations can be greatly relaxed and reduced. Numerical experimental results demonstrate that SS-MUSIC can achieve much better recovery performances than other MUSIC extended algorithms as well as some typical greedy algorithms for JSR in terms of iterations and recovery probability.

  18. Object tracking by occlusion detection via structured sparse learning

    KAUST Repository

    Zhang, Tianzhu

    2013-06-01

    Sparse representation based methods have recently drawn much attention in visual tracking due to good performance against illumination variation and occlusion. They assume the errors caused by image variations can be modeled as pixel-wise sparse. However, in many practical scenarios these errors are not truly pixel-wise sparse but rather sparsely distributed in a structured way. In fact, pixels in error constitute contiguous regions within the object\\'s track. This is the case when significant occlusion occurs. To accommodate for non-sparse occlusion in a given frame, we assume that occlusion detected in previous frames can be propagated to the current one. This propagated information determines which pixels will contribute to the sparse representation of the current track. In other words, pixels that were detected as part of an occlusion in the previous frame will be removed from the target representation process. As such, this paper proposes a novel tracking algorithm that models and detects occlusion through structured sparse learning. We test our tracker on challenging benchmark sequences, such as sports videos, which involve heavy occlusion, drastic illumination changes, and large pose variations. Experimental results show that our tracker consistently outperforms the state-of-the-art. © 2013 IEEE.

  19. Manifold regularization for sparse unmixing of hyperspectral images.

    Science.gov (United States)

    Liu, Junmin; Zhang, Chunxia; Zhang, Jiangshe; Li, Huirong; Gao, Yuelin

    2016-01-01

    Recently, sparse unmixing has been successfully applied to spectral mixture analysis of remotely sensed hyperspectral images. Based on the assumption that the observed image signatures can be expressed in the form of linear combinations of a number of pure spectral signatures known in advance, unmixing of each mixed pixel in the scene is to find an optimal subset of signatures in a very large spectral library, which is cast into the framework of sparse regression. However, traditional sparse regression models, such as collaborative sparse regression , ignore the intrinsic geometric structure in the hyperspectral data. In this paper, we propose a novel model, called manifold regularized collaborative sparse regression , by introducing a manifold regularization to the collaborative sparse regression model. The manifold regularization utilizes a graph Laplacian to incorporate the locally geometrical structure of the hyperspectral data. An algorithm based on alternating direction method of multipliers has been developed for the manifold regularized collaborative sparse regression model. Experimental results on both the simulated and real hyperspectral data sets have demonstrated the effectiveness of our proposed model.

  20. Production and Quality Control of 177Lu-Dotatate [177Lu-dota- try3]-Octreotate: Clinical Application

    International Nuclear Information System (INIS)

    Barboza, M.F. de; Herrerias, R.; Souza, A.A. de; Pereira, G.; Pires, J.A.; Fukumori, N.T.O.; Matsuda, M.M.N.; Almeida, E.V.; Mengatti, J.; Belfer, A.J.; Hilario, L.N.

    2009-01-01

    Introduction: Somatostatin receptors have been identified in different kinds of tumors such as neuroendocrine tumors and tumors of the central nervous system, breast, lung and lymphatic tissue making these receptors potential targets for radionuclide diagnostics and therapy. These observations have served as the biomolecular basis for the clinical use of radiolabeled somatostatin analogues which, at present, are of great interest in nuclear medicine for diagnostic and peptide receptor radionuclide therapy (PRRT) applications. There are only a few treatment modalities for metastasized neuroendocrine gastroenteropancreatic (GEP) tumors. Besides surgery, (chemo)-embolization, chemotherapy, and treatment with somatostatin (SST) analogs, peptide receptor radionuclide therapy (PRRT) offers therapeutic strategy, as the majority of GEP tumors possess somatostatin receptors (SSTRs). Somatostatin analogs featuring a DOTA-chelator can be radiolabeled with the β-emitters radioisotopes, Yttrium-90 ( 90 Y) and Lutetium-177 ( 177 Lu) for PRRT. Analogs frequently used for therapy are: [DOTA-Tyr 3 ]-octreotide and [DOTA-Tyr 3 ]octreotate. In the latter compound, the alcohol threoninol at the C-terminal of the octreotide has been replaced by the natural threonin amino acid. This alteration resulted in an analog: (Tyr 3 -octreotate), which showed increased affinity for sst2, compared to both [Tyr 3 ]-octreotide and [Phe 1 ]octreotide 'in-vitro' and 'in-vivo'. Clinical studies in patients with different SST-positives tumors proved advantages of [ 177 Lu- DOTA-Tr 3 ]-octreate for therapy. PRRT with radiolabeled somatostatin analogs was shown to be effective in patients with SST2-positive-size reduction, improving quality of life and survival. Objective: The aim of this work was to present the production and the quality control of 177 Lu-Tyr 3 ---octreotate, using DOTA (1,4,7,10-tetrazacyclododecane-N,N',N',N''-tetra acetic acid) as chelating agent at the Radiopharmacy Directory, IPEN

  1. Quadrupole moments of wobbling excitations in 163Lu

    International Nuclear Information System (INIS)

    Goergen, A.; Clark, R.M.; Cromaz, M.; Fallon, P.; Lee, I.Y.; Macchiavelli, A.O.; Ward, D.; Hagemann, G.B.; Sletten, G.; Huebel, H.; Bengtsson, R.

    2004-01-01

    Lifetimes of states in the triaxial strongly deformed bands of 163 Lu have been measured with the Gammasphere spectrometer using the Doppler-shift attenuation method. The bands have been interpreted as wobbling-phonon excitations from the characteristic electromagnetic properties of the transitions connecting the bands. Quadrupole moments are extracted for the zero-phonon yrast band and, for the first time, for the one-phonon wobbling band. The very similar results found for the two bands suggest a similar intrinsic structure and support the wobbling interpretation. While the in-band quadrupole moments for the bands show a decreasing trend towards higher spin, the ratio of the interband to the in-band transition strengths remains constant. Both features can be understood by a small increase in triaxiality towards higher spin. Such a change in triaxiality is also found in cranking calculations, to which the experimental results are compared

  2. Production of {sup 177}Lu for targeted radionuclide therapy: Available options

    Energy Technology Data Exchange (ETDEWEB)

    Dah, Ashutosh [Isotope Production and Applications Division, Bhabha Atomic Research Centre (BARC), Mumbai (India); Pillai, Maroor Raghavan Ambikalmajan [Molecular Group of Companies. Kerala (India); Knapp, Furn F. Jr. [Medical Isotopes Program, Isotope Dept. Group, Oak Ridge National Laboratory (ORNL), Oak Ridge (United States)

    2015-06-15

    This review provides a comprehensive summary of the production of {sup 177}Lu to meet expected future research and clinical demands. Availability of options represents the cornerstone for sustainable growth for the routine production of adequate activity levels of {sup 177}Lu having the required quality for preparation of a variety of {sup 177}Lu-labeled radiopharmaceuticals. The tremendous prospects associated with production of {sup 177}Lu for use in targeted radionuclide therapy (TRT) dictate that a holistic consideration should evaluate all governing factors that determine its success. While both “direct” and “indirect” reactor production routes offer the possibility for sustainable {sup 177}Lu availability, there are several issues and challenges that must be considered to realize the full potential of these production strategies. This article presents a mini review on the latest developments, current status, key challenges and possibilities for the near future. A broad understanding and discussion of the issues associated with {sup 177}Lu production and processing approaches would not only ensure sustained growth and future expansion for the availability and use of {sup 177}Lu-labeled radiopharmaceuticals, but also help future developments.

  3. Theoretical investigations on the high light yield of the LuI3:Ce scintillator

    International Nuclear Information System (INIS)

    Vasil'ev, A.N.; Iskandarova, I.M.; Scherbinin, A.V.; Markov, I.A.; Bagatur'yants, A.A.; Potapkin, B.V.; Srivastava, A.M.; Vartuli, J.S.; Duclos, S.J.

    2009-01-01

    The extremely high scintillation efficiency of lutetium iodide doped by cerium is explained as a result of at least three factors controlling the energy transfer from the host matrix to activator. We propose and theoretically validate the possibility of a new channel of energy transfer to excitons and directly to cerium, namely the Auger process when Lu 4f hole relaxes to the valence band hole with simultaneous creation of additional exciton or excitation of cerium. This process should be efficient in LuI 3 , and inefficient in LuCl 3 . To justify this channel, we perform calculations of density of states using a periodic plane-wave density functional approach. The second factor is the increase of the efficiency of valence hole capture by cerium in the row LuCl 3 -LuBr 3 -LuI 3 . The third one is the increase of the efficiency of energy transfer from self-trapped excitons to cerium ions in the same row. The latter two factors are verified by cluster ab initio calculations. We estimate either the relaxation of these excitations and barriers for the diffusion of self-trapped holes (STH) and self-trapped exciton (STE). The performed estimations theoretically justify the high LuI 3 :Ce 3+ scintillator yield.

  4. A comprehensive study of sparse codes on abnormality detection

    DEFF Research Database (Denmark)

    Ren, Huamin; Pan, Hong; Olsen, Søren Ingvor

    2017-01-01

    Sparse representation has been applied successfully in abnor-mal event detection, in which the baseline is to learn a dic-tionary accompanied by sparse codes. While much empha-sis is put on discriminative dictionary construction, there areno comparative studies of sparse codes regarding abnormal-ity...... detection. We comprehensively study two types of sparsecodes solutions - greedy algorithms and convex L1-norm so-lutions - and their impact on abnormality detection perfor-mance. We also propose our framework of combining sparsecodes with different detection methods. Our comparative ex-periments are carried...

  5. Electromagnetic Formation Flight (EMFF) for Sparse Aperture Arrays

    Science.gov (United States)

    Kwon, Daniel W.; Miller, David W.; Sedwick, Raymond J.

    2004-01-01

    Traditional methods of actuating spacecraft in sparse aperture arrays use propellant as a reaction mass. For formation flying systems, propellant becomes a critical consumable which can be quickly exhausted while maintaining relative orientation. Additional problems posed by propellant include optical contamination, plume impingement, thermal emission, and vibration excitation. For these missions where control of relative degrees of freedom is important, we consider using a system of electromagnets, in concert with reaction wheels, to replace the consumables. Electromagnetic Formation Flight sparse apertures, powered by solar energy, are designed differently from traditional propulsion systems, which are based on V. This paper investigates the design of sparse apertures both inside and outside the Earth's gravity field.

  6. Sparse Principal Component Analysis in Medical Shape Modeling

    DEFF Research Database (Denmark)

    Sjöstrand, Karl; Stegmann, Mikkel Bille; Larsen, Rasmus

    2006-01-01

    Principal component analysis (PCA) is a widely used tool in medical image analysis for data reduction, model building, and data understanding and exploration. While PCA is a holistic approach where each new variable is a linear combination of all original variables, sparse PCA (SPCA) aims...... analysis in medicine. Results for three different data sets are given in relation to standard PCA and sparse PCA by simple thresholding of sufficiently small loadings. Focus is on a recent algorithm for computing sparse principal components, but a review of other approaches is supplied as well. The SPCA...

  7. [{sup 177}Lu]pertuzumab: experimental studies on targeting of HER-2 positive tumour cells

    Energy Technology Data Exchange (ETDEWEB)

    Persson, Mikael; Gedda, Lars [Uppsala University, Biomedical Radiation Sciences, Rudbeck Laboratory, Uppsala (Sweden); Uppsala University, Experimental Urology, Rudbeck Laboratory, Uppsala (Sweden); Tolmachev, Vladimir; Andersson, Karl; Carlsson, Joergen [Uppsala University, Biomedical Radiation Sciences, Rudbeck Laboratory, Uppsala (Sweden); Sandstroem, Mattias [Uppsala University, Medical Radiation Physics, Uppsala University Hospital, Uppsala (Sweden)

    2005-12-01

    The new antibody pertuzumab (Omnitarg) targets the dimerisation subdomain of HER-2. The purpose of this study was to analyse whether pertuzumab retains HER-2 targeting capacity after labelling with the therapeutically interesting beta emitter {sup 177}Lu and to make initial characterisations in vitro and in vivo. Pertuzumab was conjugated with isothiocyanate-benzyl-CHX-A{sup ''}-DTPA and chelated to {sup 177}Lu. Immunoreactivity, affinity, cellular retention and internalisation were analysed using SKOV-3 cells. The affinity of non-radioactive pertuzumab was measured using a surface plasmon resonance biosensor. In vivo targeting and specific binding were assessed in Balb/c (nu/nu) mice carrying SKOV-3 xenografts. The biodistribution of {sup 177}Lu was determined 1, 3 and 7 days after [{sup 177}Lu]pertuzumab administration. Gamma camera images were taken after 3 days. The immunoreactivity of [{sup 177}Lu]pertuzumab was 85.8{+-}1.3%. The affinity of non-radioactive pertuzumab was 1.8{+-}1.1 nM, and that of [{sup 177}Lu]pertuzumab, 4.1{+-}0.7 nM. The cellular retention after 5 h pre-incubation was 90{+-}2% at 20 h. The targeting was HER-2 specific both in vitro and in vivo, since excess amounts of non-labelled antibody inhibited the uptake of labelled antibody (p<0.0001 and p<0.01, respectively). The biodistribution and gamma camera images of {sup 177}Lu showed extensive tumour uptake. Normal tissues had a surprisingly low uptake. Pertuzumab was efficiently labelled with {sup 177}Lu and showed good intracellular retention and HER-2 specific binding both in vitro and in vivo. The gamma camera images and the biodistribution study gave excellent tumour targeting results. Thus, [{sup 177}Lu]pertuzumab is of interest for further studies aimed at radionuclide therapy. (orig.)

  8. [{sup 177}Lu]DOTA-anti-CD20: Labeling and pre-clinical studies

    Energy Technology Data Exchange (ETDEWEB)

    Audicio, Paola F., E-mail: paudicio@cin.edu.u [Departamento de Radiofarmacia, Centro de Investigaciones Nucleares, Facultad de Ciencias, Universidad de la Republica, Mataojo 2055, 11400 Montevideo (Uruguay); Castellano, Gustavo, E-mail: gcas@famaf.unc.edu.a [FaMAF, Universidad Nacional de Cordoba, Ciudad Universitaria, 5016 Cordoba (Argentina); Tassano, Marcos R.; Rezzano, Maria E.; Fernandez, Marcelo [Departamento de Radiofarmacia, Centro de Investigaciones Nucleares, Facultad de Ciencias, Universidad de la Republica, Mataojo 2055, 11400 Montevideo (Uruguay); Riva, Eloisa [Clinica Hematologica ' Prof. Dra. L. Diaz' , Hospital de Clinicas. Av. Italia. sn, Montevideo (Uruguay); Robles, Ana; Cabral, Pablo; Balter, Henia; Oliver, Patricia [Departamento de Radiofarmacia, Centro de Investigaciones Nucleares, Facultad de Ciencias, Universidad de la Republica, Mataojo 2055, 11400 Montevideo (Uruguay)

    2011-07-15

    Anti-CD20 (Rituximab), a specific chimeric monoclonal antibody used in CD20-positive Non-Hodgkin's Lymphoma, was conjugated to a bifunctional quelate (DOTA) and radiolabeled with {sup 177}Lu through a simple method. [{sup 177}Lu]-DOTA-anti-CD20 was obtained with a radiochemical purity higher than 97%, and showed good chemical and biological stability, maintaining its biospecificity to CD20 antigens. Monte Carlo simulation showed high doses deposited on a spheroid tumor mass model. This method seems to be an appropriate alternative for the production of [{sup 177}Lu]-DOTA-anti-CD20 as therapeutic radiopharmaceutical.

  9. First observation of yrast band in odd-odd 162Lu

    International Nuclear Information System (INIS)

    Zhang, Y.H.; Yuan, G.J.; Liu, X.A.

    1996-01-01

    High spin states of the odd-odd 162 Lu nucleus have been studied via 147 Sm( 19 F, 4nγ) 162 Lu reaction at 95MeV beam energy. Level scheme for yrast band based on π[h 11/2 ] υ[i 13/2 ] quasiparticle configuration was established up to I π =(23 - ) for the first time. This band shows the signature inversion in energy before backbending generally appeared in this mass region. It is stressed that the signature splitting in 162 Lu is larger than that in the 160 Tm nucleus. (orig.)

  10. Development of a therapeutic radiopharmaceutical 177Lu-DOTA- Minigastrin for potential use in PRRT

    International Nuclear Information System (INIS)

    Lopez Bularte, A.C.; Nevares, N.N.; Zapata, A.M.; Perez, J.H.; Crudo, J.L.; Puerta Yepes, N.; Rojo, A.M.

    2010-01-01

    The aim of this work is to obtain 177 Lu-DOTA-Minigastrin with high radiochemical purity (RP) and the highest specific activity (Ae) as possible, using a locally produced (Nuclear Reactor RA-3, Ezeiza Atomic Center) 177 LuCl 3 of an intermediate level of Ae (between 6.36 to 17.95 Ci/mg of 176 Lu) ) and also to perform in vitro and in vivo stability tests, dose calculation in normal mice and its extrapolation to a human model. (authors) [es

  11. Lu AA21004, a novel multimodal antidepressantwith activity exerted through serotonergic targets

    DEFF Research Database (Denmark)

    Mork, A.; Pehrson, A.; Montezinho, L. C. P.

    2012-01-01

    Background: Lu AA21004 is a multimodal antidepressant that functions as a 5-HT3 and 5-HT7 receptor antagonist, 5-HT1B receptor partial agonist, 5-HT1A receptor agonist and inhibitor of the 5-HT transporter in vitro. Here we investigated preclinical effects of Lu AA21004 1) on target occupancies, 2...... (5-HT), noradrenaline (NA), dopamine (DA), acetylcholine (ACh), histamine (Hist)] were measured by microdialysis. Antidepressant potential was assessed in the forced swim test using Flinders Sensitive Line (FSL) rats. Moreover, effects of Lu AA21004 on acquisition, consolidation and recall...

  12. Additional lesions detected in therapeutic scans with 177Lu-DOTATATE reflect higher affinity of 177Lu-DOTATATE for somatostatin receptors.

    Science.gov (United States)

    Mirzaei, Siroos; Bastati, Brigitte; Lipp, Rainer W; Knoll, Peter; Zojer, Niklas; Ludwig, Heinz

    2011-01-01

    Peptide receptor-targeted radionuclide therapy (PRRT) of somatostatin receptor (SR)-expressing neuroendocrine tumors (NETs) has become an established therapeutic option in patients with advanced NETs. The aim of this study was to compare the lesion detection rate of (99m)Tc-EDDA/HYNIC-TOC, a newly developed tracer for NET imaging, with (177)Lu-DOTATATE used for PRRT. 8 patients (4 women, 4 men, age range 46-76 years) with histologically proven NETs, who showed high SR loads by (99m)Tc-EDDA/HYNIC-TOC scintigraphy, were treated with (177)Lu-DOTATATE. After treatment, all patients were subjected to whole-body scintigraphy with additional low-dose single-photon emission computed tomography (SPECT-CT) of the chest and abdomen. All patients demonstrated (177)Lu-DOTATATE accumulation in all lesions previously detected by (99m)Tc- EDDA/HYNIC-TOC scintigraphy. Three patients showed additional lesions in the liver and lungs. SPECT-CT after (177)Lu-DOTATATE therapy may be helpful in detecting additional lesions not seen using (99m)Tc-EDDA/HYNIC-TOC. This could reflect the broader affinity of (177)Lu-DOTATATE for SRs compared with (99m)Tc-EDDA/HYNIC-TOC. Copyright © 2011 S. Karger AG, Basel.

  13. High Order Tensor Formulation for Convolutional Sparse Coding

    KAUST Repository

    Bibi, Adel Aamer; Ghanem, Bernard

    2017-01-01

    Convolutional sparse coding (CSC) has gained attention for its successful role as a reconstruction and a classification tool in the computer vision and machine learning community. Current CSC methods can only reconstruct singlefeature 2D images

  14. Preconditioned Inexact Newton for Nonlinear Sparse Electromagnetic Imaging

    KAUST Repository

    Desmal, Abdulla; Bagci, Hakan

    2014-01-01

    with smoothness promoting optimization/regularization schemes. However, this type of regularization schemes are known to perform poorly when applied in imagining domains with sparse content or sharp variations. In this work, an inexact Newton algorithm

  15. Multiple instance learning tracking method with local sparse representation

    KAUST Repository

    Xie, Chengjun; Tan, Jieqing; Chen, Peng; Zhang, Jie; Helg, Lei

    2013-01-01

    as training data for the MIL framework. First, local image patches of a target object are represented as sparse codes with an overcomplete dictionary, where the adaptive representation can be helpful in overcoming partial occlusion in object tracking. Then MIL

  16. Low-rank sparse learning for robust visual tracking

    KAUST Repository

    Zhang, Tianzhu; Ghanem, Bernard; Liu, Si; Ahuja, Narendra

    2012-01-01

    In this paper, we propose a new particle-filter based tracking algorithm that exploits the relationship between particles (candidate targets). By representing particles as sparse linear combinations of dictionary templates, this algorithm

  17. Robust visual tracking via multi-task sparse learning

    KAUST Repository

    Zhang, Tianzhu; Ghanem, Bernard; Liu, Si; Ahuja, Narendra

    2012-01-01

    In this paper, we formulate object tracking in a particle filter framework as a multi-task sparse learning problem, which we denote as Multi-Task Tracking (MTT). Since we model particles as linear combinations of dictionary templates

  18. Sparse Machine Learning Methods for Understanding Large Text Corpora

    Data.gov (United States)

    National Aeronautics and Space Administration — Sparse machine learning has recently emerged as powerful tool to obtain models of high-dimensional data with high degree of interpretability, at low computational...

  19. Sparse PDF Volumes for Consistent Multi-Resolution Volume Rendering

    KAUST Repository

    Sicat, Ronell Barrera; Kruger, Jens; Moller, Torsten; Hadwiger, Markus

    2014-01-01

    This paper presents a new multi-resolution volume representation called sparse pdf volumes, which enables consistent multi-resolution volume rendering based on probability density functions (pdfs) of voxel neighborhoods. These pdfs are defined

  20. Sparse Linear Solver for Power System Analysis Using FPGA

    National Research Council Canada - National Science Library

    Johnson, J. R; Nagvajara, P; Nwankpa, C

    2005-01-01

    .... Numerical solution to load flow equations are typically computed using Newton-Raphson iteration, and the most time consuming component of the computation is the solution of a sparse linear system...

  1. Support agnostic Bayesian matching pursuit for block sparse signals

    KAUST Repository

    Masood, Mudassir

    2013-05-01

    A fast matching pursuit method using a Bayesian approach is introduced for block-sparse signal recovery. This method performs Bayesian estimates of block-sparse signals even when the distribution of active blocks is non-Gaussian or unknown. It is agnostic to the distribution of active blocks in the signal and utilizes a priori statistics of additive noise and the sparsity rate of the signal, which are shown to be easily estimated from data and no user intervention is required. The method requires a priori knowledge of block partition and utilizes a greedy approach and order-recursive updates of its metrics to find the most dominant sparse supports to determine the approximate minimum mean square error (MMSE) estimate of the block-sparse signal. Simulation results demonstrate the power and robustness of our proposed estimator. © 2013 IEEE.

  2. Detection of Pitting in Gears Using a Deep Sparse Autoencoder

    Directory of Open Access Journals (Sweden)

    Yongzhi Qu

    2017-05-01

    Full Text Available In this paper; a new method for gear pitting fault detection is presented. The presented method is developed based on a deep sparse autoencoder. The method integrates dictionary learning in sparse coding into a stacked autoencoder network. Sparse coding with dictionary learning is viewed as an adaptive feature extraction method for machinery fault diagnosis. An autoencoder is an unsupervised machine learning technique. A stacked autoencoder network with multiple hidden layers is considered to be a deep learning network. The presented method uses a stacked autoencoder network to perform the dictionary learning in sparse coding and extract features from raw vibration data automatically. These features are then used to perform gear pitting fault detection. The presented method is validated with vibration data collected from gear tests with pitting faults in a gearbox test rig and compared with an existing deep learning-based approach.

  3. Sparse logistic principal components analysis for binary data

    KAUST Repository

    Lee, Seokho; Huang, Jianhua Z.; Hu, Jianhua

    2010-01-01

    with a criterion function motivated from a penalized Bernoulli likelihood. A Majorization-Minimization algorithm is developed to efficiently solve the optimization problem. The effectiveness of the proposed sparse logistic PCA method is illustrated

  4. Sparse reconstruction using distribution agnostic bayesian matching pursuit

    KAUST Repository

    Masood, Mudassir

    2013-11-01

    A fast matching pursuit method using a Bayesian approach is introduced for sparse signal recovery. This method performs Bayesian estimates of sparse signals even when the signal prior is non-Gaussian or unknown. It is agnostic on signal statistics and utilizes a priori statistics of additive noise and the sparsity rate of the signal, which are shown to be easily estimated from data if not available. The method utilizes a greedy approach and order-recursive updates of its metrics to find the most dominant sparse supports to determine the approximate minimum mean-square error (MMSE) estimate of the sparse signal. Simulation results demonstrate the power and robustness of our proposed estimator. © 2013 IEEE.

  5. Occlusion detection via structured sparse learning for robust object tracking

    KAUST Repository

    Zhang, Tianzhu; Ghanem, Bernard; Xu, Changsheng; Ahuja, Narendra

    2014-01-01

    occlusion through structured sparse learning. We test our tracker on challenging benchmark sequences, such as sports videos, which involve heavy occlusion, drastic illumination changes, and large pose variations. Extensive experimental results show that our

  6. Object tracking by occlusion detection via structured sparse learning

    KAUST Repository

    Zhang, Tianzhu; Ghanem, Bernard; Xu, Changsheng; Ahuja, Narendra

    2013-01-01

    occlusion through structured sparse learning. We test our tracker on challenging benchmark sequences, such as sports videos, which involve heavy occlusion, drastic illumination changes, and large pose variations. Experimental results show that our tracker

  7. Sparse Vector Distributions and Recovery from Compressed Sensing

    DEFF Research Database (Denmark)

    Sturm, Bob L.

    It is well known that the performance of sparse vector recovery algorithms from compressive measurements can depend on the distribution underlying the non-zero elements of a sparse vector. However, the extent of these effects has yet to be explored, and formally presented. In this paper, I...... empirically investigate this dependence for seven distributions and fifteen recovery algorithms. The two morals of this work are: 1) any judgement of the recovery performance of one algorithm over that of another must be prefaced by the conditions for which this is observed to be true, including sparse vector...... distributions, and the criterion for exact recovery; and 2) a recovery algorithm must be selected carefully based on what distribution one expects to underlie the sensed sparse signal....

  8. Sparse encoding of automatic visual association in hippocampal networks

    DEFF Research Database (Denmark)

    Hulme, Oliver J; Skov, Martin; Chadwick, Martin J

    2014-01-01

    Intelligent action entails exploiting predictions about associations between elements of ones environment. The hippocampus and mediotemporal cortex are endowed with the network topology, physiology, and neurochemistry to automatically and sparsely code sensori-cognitive associations that can...

  9. Efficient collaborative sparse channel estimation in massive MIMO

    KAUST Repository

    Masood, Mudassir; Afify, Laila H.; Al-Naffouri, Tareq Y.

    2015-01-01

    We propose a method for estimation of sparse frequency selective channels within MIMO-OFDM systems. These channels are independently sparse and share a common support. The method estimates the impulse response for each channel observed by the antennas at the receiver. Estimation is performed in a coordinated manner by sharing minimal information among neighboring antennas to achieve results better than many contemporary methods. Simulations demonstrate the superior performance of the proposed method.

  10. Fast convolutional sparse coding using matrix inversion lemma

    Czech Academy of Sciences Publication Activity Database

    Šorel, Michal; Šroubek, Filip

    2016-01-01

    Roč. 55, č. 1 (2016), s. 44-51 ISSN 1051-2004 R&D Projects: GA ČR GA13-29225S Institutional support: RVO:67985556 Keywords : Convolutional sparse coding * Feature learning * Deconvolution networks * Shift-invariant sparse coding Subject RIV: JD - Computer Applications, Robotics Impact factor: 2.337, year: 2016 http://library.utia.cas.cz/separaty/2016/ZOI/sorel-0459332.pdf

  11. Discussion of CoSA: Clustering of Sparse Approximations

    Energy Technology Data Exchange (ETDEWEB)

    Armstrong, Derek Elswick [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2017-03-07

    The purpose of this talk is to discuss the possible applications of CoSA (Clustering of Sparse Approximations) to the exploitation of HSI (HyperSpectral Imagery) data. CoSA is presented by Moody et al. in the Journal of Applied Remote Sensing (“Land cover classification in multispectral imagery using clustering of sparse approximations over learned feature dictionaries”, Vol. 8, 2014) and is based on machine learning techniques.

  12. Efficient collaborative sparse channel estimation in massive MIMO

    KAUST Repository

    Masood, Mudassir

    2015-08-12

    We propose a method for estimation of sparse frequency selective channels within MIMO-OFDM systems. These channels are independently sparse and share a common support. The method estimates the impulse response for each channel observed by the antennas at the receiver. Estimation is performed in a coordinated manner by sharing minimal information among neighboring antennas to achieve results better than many contemporary methods. Simulations demonstrate the superior performance of the proposed method.

  13. A flexible framework for sparse simultaneous component based data integration

    Directory of Open Access Journals (Sweden)

    Van Deun Katrijn

    2011-11-01

    Full Text Available Abstract 1 Background High throughput data are complex and methods that reveal structure underlying the data are most useful. Principal component analysis, frequently implemented as a singular value decomposition, is a popular technique in this respect. Nowadays often the challenge is to reveal structure in several sources of information (e.g., transcriptomics, proteomics that are available for the same biological entities under study. Simultaneous component methods are most promising in this respect. However, the interpretation of the principal and simultaneous components is often daunting because contributions of each of the biomolecules (transcripts, proteins have to be taken into account. 2 Results We propose a sparse simultaneous component method that makes many of the parameters redundant by shrinking them to zero. It includes principal component analysis, sparse principal component analysis, and ordinary simultaneous component analysis as special cases. Several penalties can be tuned that account in different ways for the block structure present in the integrated data. This yields known sparse approaches as the lasso, the ridge penalty, the elastic net, the group lasso, sparse group lasso, and elitist lasso. In addition, the algorithmic results can be easily transposed to the context of regression. Metabolomics data obtained with two measurement platforms for the same set of Escherichia coli samples are used to illustrate the proposed methodology and the properties of different penalties with respect to sparseness across and within data blocks. 3 Conclusion Sparse simultaneous component analysis is a useful method for data integration: First, simultaneous analyses of multiple blocks offer advantages over sequential and separate analyses and second, interpretation of the results is highly facilitated by their sparseness. The approach offered is flexible and allows to take the block structure in different ways into account. As such

  14. A flexible framework for sparse simultaneous component based data integration.

    Science.gov (United States)

    Van Deun, Katrijn; Wilderjans, Tom F; van den Berg, Robert A; Antoniadis, Anestis; Van Mechelen, Iven

    2011-11-15

    High throughput data are complex and methods that reveal structure underlying the data are most useful. Principal component analysis, frequently implemented as a singular value decomposition, is a popular technique in this respect. Nowadays often the challenge is to reveal structure in several sources of information (e.g., transcriptomics, proteomics) that are available for the same biological entities under study. Simultaneous component methods are most promising in this respect. However, the interpretation of the principal and simultaneous components is often daunting because contributions of each of the biomolecules (transcripts, proteins) have to be taken into account. We propose a sparse simultaneous component method that makes many of the parameters redundant by shrinking them to zero. It includes principal component analysis, sparse principal component analysis, and ordinary simultaneous component analysis as special cases. Several penalties can be tuned that account in different ways for the block structure present in the integrated data. This yields known sparse approaches as the lasso, the ridge penalty, the elastic net, the group lasso, sparse group lasso, and elitist lasso. In addition, the algorithmic results can be easily transposed to the context of regression. Metabolomics data obtained with two measurement platforms for the same set of Escherichia coli samples are used to illustrate the proposed methodology and the properties of different penalties with respect to sparseness across and within data blocks. Sparse simultaneous component analysis is a useful method for data integration: First, simultaneous analyses of multiple blocks offer advantages over sequential and separate analyses and second, interpretation of the results is highly facilitated by their sparseness. The approach offered is flexible and allows to take the block structure in different ways into account. As such, structures can be found that are exclusively tied to one data platform

  15. In-Storage Embedded Accelerator for Sparse Pattern Processing

    OpenAIRE

    Jun, Sang-Woo; Nguyen, Huy T.; Gadepally, Vijay N.; Arvind

    2016-01-01

    We present a novel architecture for sparse pattern processing, using flash storage with embedded accelerators. Sparse pattern processing on large data sets is the essence of applications such as document search, natural language processing, bioinformatics, subgraph matching, machine learning, and graph processing. One slice of our prototype accelerator is capable of handling up to 1TB of data, and experiments show that it can outperform C/C++ software solutions on a 16-core system at a fracti...

  16. Process Knowledge Discovery Using Sparse Principal Component Analysis

    DEFF Research Database (Denmark)

    Gao, Huihui; Gajjar, Shriram; Kulahci, Murat

    2016-01-01

    As the goals of ensuring process safety and energy efficiency become ever more challenging, engineers increasingly rely on data collected from such processes for informed decision making. During recent decades, extracting and interpreting valuable process information from large historical data sets...... SPCA approach that helps uncover the underlying process knowledge regarding variable relations. This approach systematically determines the optimal sparse loadings for each sparse PC while improving interpretability and minimizing information loss. The salient features of the proposed approach...

  17. Occlusion detection via structured sparse learning for robust object tracking

    KAUST Repository

    Zhang, Tianzhu

    2014-01-01

    Sparse representation based methods have recently drawn much attention in visual tracking due to good performance against illumination variation and occlusion. They assume the errors caused by image variations can be modeled as pixel-wise sparse. However, in many practical scenarios, these errors are not truly pixel-wise sparse but rather sparsely distributed in a structured way. In fact, pixels in error constitute contiguous regions within the object’s track. This is the case when significant occlusion occurs. To accommodate for nonsparse occlusion in a given frame, we assume that occlusion detected in previous frames can be propagated to the current one. This propagated information determines which pixels will contribute to the sparse representation of the current track. In other words, pixels that were detected as part of an occlusion in the previous frame will be removed from the target representation process. As such, this paper proposes a novel tracking algorithm that models and detects occlusion through structured sparse learning. We test our tracker on challenging benchmark sequences, such as sports videos, which involve heavy occlusion, drastic illumination changes, and large pose variations. Extensive experimental results show that our proposed tracker consistently outperforms the state-of-the-art trackers.

  18. Exhaustive Search for Sparse Variable Selection in Linear Regression

    Science.gov (United States)

    Igarashi, Yasuhiko; Takenaka, Hikaru; Nakanishi-Ohno, Yoshinori; Uemura, Makoto; Ikeda, Shiro; Okada, Masato

    2018-04-01

    We propose a K-sparse exhaustive search (ES-K) method and a K-sparse approximate exhaustive search method (AES-K) for selecting variables in linear regression. With these methods, K-sparse combinations of variables are tested exhaustively assuming that the optimal combination of explanatory variables is K-sparse. By collecting the results of exhaustively computing ES-K, various approximate methods for selecting sparse variables can be summarized as density of states. With this density of states, we can compare different methods for selecting sparse variables such as relaxation and sampling. For large problems where the combinatorial explosion of explanatory variables is crucial, the AES-K method enables density of states to be effectively reconstructed by using the replica-exchange Monte Carlo method and the multiple histogram method. Applying the ES-K and AES-K methods to type Ia supernova data, we confirmed the conventional understanding in astronomy when an appropriate K is given beforehand. However, we found the difficulty to determine K from the data. Using virtual measurement and analysis, we argue that this is caused by data shortage.

  19. Sparse Representation Based SAR Vehicle Recognition along with Aspect Angle

    Directory of Open Access Journals (Sweden)

    Xiangwei Xing

    2014-01-01

    Full Text Available As a method of representing the test sample with few training samples from an overcomplete dictionary, sparse representation classification (SRC has attracted much attention in synthetic aperture radar (SAR automatic target recognition (ATR recently. In this paper, we develop a novel SAR vehicle recognition method based on sparse representation classification along with aspect information (SRCA, in which the correlation between the vehicle’s aspect angle and the sparse representation vector is exploited. The detailed procedure presented in this paper can be summarized as follows. Initially, the sparse representation vector of a test sample is solved by sparse representation algorithm with a principle component analysis (PCA feature-based dictionary. Then, the coefficient vector is projected onto a sparser one within a certain range of the vehicle’s aspect angle. Finally, the vehicle is classified into a certain category that minimizes the reconstruction error with the novel sparse representation vector. Extensive experiments are conducted on the moving and stationary target acquisition and recognition (MSTAR dataset and the results demonstrate that the proposed method performs robustly under the variations of depression angle and target configurations, as well as incomplete observation.

  20. Structure-aware Local Sparse Coding for Visual Tracking

    KAUST Repository

    Qi, Yuankai

    2018-01-24

    Sparse coding has been applied to visual tracking and related vision problems with demonstrated success in recent years. Existing tracking methods based on local sparse coding sample patches from a target candidate and sparsely encode these using a dictionary consisting of patches sampled from target template images. The discriminative strength of existing methods based on local sparse coding is limited as spatial structure constraints among the template patches are not exploited. To address this problem, we propose a structure-aware local sparse coding algorithm which encodes a target candidate using templates with both global and local sparsity constraints. For robust tracking, we show local regions of a candidate region should be encoded only with the corresponding local regions of the target templates that are the most similar from the global view. Thus, a more precise and discriminative sparse representation is obtained to account for appearance changes. To alleviate the issues with tracking drifts, we design an effective template update scheme. Extensive experiments on challenging image sequences demonstrate the effectiveness of the proposed algorithm against numerous stateof- the-art methods.

  1. Vector sparse representation of color image using quaternion matrix analysis.

    Science.gov (United States)

    Xu, Yi; Yu, Licheng; Xu, Hongteng; Zhang, Hao; Nguyen, Truong

    2015-04-01

    Traditional sparse image models treat color image pixel as a scalar, which represents color channels separately or concatenate color channels as a monochrome image. In this paper, we propose a vector sparse representation model for color images using quaternion matrix analysis. As a new tool for color image representation, its potential applications in several image-processing tasks are presented, including color image reconstruction, denoising, inpainting, and super-resolution. The proposed model represents the color image as a quaternion matrix, where a quaternion-based dictionary learning algorithm is presented using the K-quaternion singular value decomposition (QSVD) (generalized K-means clustering for QSVD) method. It conducts the sparse basis selection in quaternion space, which uniformly transforms the channel images to an orthogonal color space. In this new color space, it is significant that the inherent color structures can be completely preserved during vector reconstruction. Moreover, the proposed sparse model is more efficient comparing with the current sparse models for image restoration tasks due to lower redundancy between the atoms of different color channels. The experimental results demonstrate that the proposed sparse image model avoids the hue bias issue successfully and shows its potential as a general and powerful tool in color image analysis and processing domain.

  2. Sparse Reconstruction Schemes for Nonlinear Electromagnetic Imaging

    KAUST Repository

    Desmal, Abdulla

    2016-03-01

    synthetically generated or actually measured scattered fields, show that the images recovered by these sparsity-regularized methods are sharper and more accurate than those produced by existing methods. The methods developed in this work have potential application areas ranging from oil/gas reservoir engineering to biological imaging where sparse domains naturally exist.

  3. Intrinsic magnetic properties of hexagonal LuFeO3 and the effects of nonstoichiometry

    Directory of Open Access Journals (Sweden)

    Jarrett A. Moyer

    2014-01-01

    Full Text Available We used oxide molecular-beam epitaxy in a composition-spread geometry to deposit hexagonal LuFeO3 (h-LuFeO3 thin films with a monotonic variation in the Lu/Fe cation ratio, creating a mosaic of samples that ranged from iron rich to lutetium rich. We characterized the effects of composition variation with x-ray diffraction, atomic force microscopy, scanning transmission electron microscopy, and superconducting quantum interference device magnetometry. After identifying growth conditions leading to stoichiometric film growth, an additional sample was grown with a rotating sample stage. From this stoichiometric sample, we determined stoichiometric h-LuFeO3 to have a TN = 147 K and Ms = 0.018 μB/Fe.

  4. High-Spin Structure in Odd-Odd 160Lu Nucleus

    International Nuclear Information System (INIS)

    Wang Lie-Lin; Lu Jing-Bin; Yang Dong; Ma Ke-Yan; Yin Li-Chang; Zhou Yin-Hang; Wu Xiao-Guang; Wen Shu-Xian; Li Guang-Sheng; Yang Chun-Xiang

    2012-01-01

    The high-spin states of 160 Lu are populated by the fusion-evaporation reaction 144 Sm( 19 F,3n) 160 Lu at beam energies of 90 and 106 MeV. A new level scheme of 160 Lu is established. A possible isomeric state based on the πh 11/2 νh 9/2 configuration is observed. The new decoupled band with the configuration of πd 3/2 [411]1/2 + νi 13/2 [660]1/2 + is established, and the configurations of these similar decoupled bands in the neighboring odd-odd 162−166 Lu nuclei are suggested. A positive parity coupled band is assigned as the πd 5/2 [402]5/2 + νi 13/2 [660]1/2 + configuration. (nuclear physics)

  5. A routine high-precision method for Lu-Hf isotope geochemistry and chronology

    Science.gov (United States)

    Patchett, P.J.; Tatsumoto, M.

    1981-01-01

    A method for chemical separation of Lu and Hf from rock, meteorite and mineral samples is described, together with a much improved mass spectrometric running technique for Hf. This allows (i) geo- and cosmochronology using the176Lu???176Hf+??- decay scheme, and (ii) geochemical studies of planetary processes in the earth and moon. Chemical yields for the three-stage ion-exchange column procedure average 90% for Hf. Chemical blanks are international mass spectrometric standard; suitable aliquots, prepared from a single batch of JMC 475, are available from Denver. Lu-Hf analyses of the standard rocks BCR-1 and JB-1 are given. The potential of the Lu-Hf method in isotope geochemistry is assessed. ?? 1980 Springer-Verlag.

  6. lu ja liikumine kui ruumipraktikad = Memory and motion as spatial practices / Morten Lund

    Index Scriptorium Estoniae

    Lund, Morten, 1972-

    2015-01-01

    Artiklis on käsitletud nelja uurimust ruumist, mis illustreerivad võimalusi, kuidas sisearhitektuur võib kaasata mälu ja liikumise kui ruumilised praktikad läbi ruumilise kunsti ning 1:1 eksperimentide

  7. Luminescence and scintillation properties of LuPO4-Ce nanoparticles

    International Nuclear Information System (INIS)

    Vistovskyy, V.; Malyy, T.; Pushak, A.; Vas’kiv, A.; Shapoval, A.; Mitina, N.; Gektin, A.; Zaichenko, A.; Voloshinovskii, A.

    2014-01-01

    Study of the spectral-luminescence parameters of LuPO 4 -Ce nanoparticles upon the excitation by X-ray quanta and synchrotron radiation with photon energies of 4–25 eV was performed. Nanoparticles with mean size about a=35 nm and nanoparticles with size less than 12 nm reveal the different structures of cerium centers. Luminescence efficiency of LuPO 4 -Ce nanoparticles of a 4 -Ce nanoparticles studied using synchrotron and X-ray excitation. • Different structure of Ce 3+ -centers has been revealed for LuPO 4 -Ce nanoparticles. • Luminescence of LuPO 4 -Ce with size less than 12 nm is strongly quenched upon the X-ray excitation

  8. Gamma radiation exposure of accompanying persons due to Lu-177 patients

    Directory of Open Access Journals (Sweden)

    Kovan Bilal

    2015-01-01

    Full Text Available Neuroendocrine tumours (NET are cancers usually observed and arisen in the stomach, intestine, pancreas and breathing system. Recently, radionuclide therapy applications with Lu-177 peptide compound are rapidly growing; especially effective clinical results are obtained in the treatment of well-differentiated and metastatic NET. In this treatment, Lu-177-DOTA, a beta emitter radioisotope in the radiopharmaceutical form, is given to the patient by intravenous way. Lu-177 has also gamma rays apart from beta rays. Gamma rays have 175 keV average energy and these gamma rays should be under the control in terms of radiation protection. In this study, we measured the exposure dose from the Lu-177 patient.

  9. Mixed Messages from Garnet Lu-Hf and Sm-Nd Geochronology

    Science.gov (United States)

    Vervoort, J. D.; Wang, D.; Johnson, T. A.

    2017-12-01

    Garnet geochronology provides important information on the timing and conditions of metamorphism. As a major indicator mineral formed during metamorphism, its direct dating can not only help establish the timing of metamorphism, provide the "t" for P-T-t paths, but also, if the dated garnet can be placed in a textural context, can provide information on the timing of deformational features. With advances in chemistry and mass spectrometry, garnet Lu-Hf and Sm-Nd geochronology has become an important geochronological tool and we can now reliably (if not routinely) date a wide variety of garnet compositions formed under diverse conditions. In the course of dating a variety of lithologies using both Lu-Hf and Sm-Nd isotope systems, however, some intriguing results have emerged. Although there are many examples where the Lu-Hf and Sm-Nd systems give the same date within uncertainty, there are also many cases where these systems yield significantly different dates, and the differences between these dates can be considerable—many 10's of Ma of and even 100's of Ma. For example, in garnet-bearing Mesoproterozoic gneisses from across the Blue Ridge Province in Virginia, both Lu-Hf and Sm-Nd analyses (determined on the same solutions) define narrow time spans, but with the Sm-Nd dates systematically younger (for orthogneisses Lu-Hf dates are 1032 to 1019 Ma whereas Sm-Nd dates are 965 to 949 Ma—a difference of 67 to 80 Ma). There are many other examples of systematically younger Sm-Nd garnet dates in both the literature and with our ongoing research. Potential explanations for these differences include: 1) strong partitioning of Lu into garnet during growth yielding ages weighted toward the beginning of growth; 2) faster Lu diffusion from high Lu regions after garnet formation, potentially leading to isochron rotation and anomalously old Lu-Hf dates; and 3) differences in closure temperatures of the two isotope systems. We will review several examples of divergent Lu

  10. The impact of repeated cycles of radioligand therapy using [{sup 177}Lu]Lu-PSMA-617 on renal function in patients with hormone refractory metastatic prostate cancer

    Energy Technology Data Exchange (ETDEWEB)

    Yordanova, Anna; Becker, Anja; Eppard, Elisabeth; Kuerpig, Stefan; Essler, Markus; Ahmadzadehfar, Hojjat [University Hospital Bonn, Department of Nuclear Medicine, Bonn (Germany); Fisang, Christian [University Hospital Bonn, Department of Urology, Bonn (Germany); Feldmann, Georg [University Hospital Bonn, Department of Internal Medicine, MED3, Bonn (Germany)

    2017-08-15

    [{sup 177}Lu]Lu-PSMA-617 is a well-tolerated therapy for the treatment of metastatic prostate cancer. However, because of the mainly renal excretion of the tracer, the kidneys are one of the most limiting organs. The purpose of this study was to examine the post-therapeutic changes in renal function over time and to identify risk factors for developing renal toxicity. We also tested the reliability of markers for renal function monitoring. Fifty-five patients with castrate-resistant metastatic prostate cancer treated with at least three cycles of [{sup 177}Lu]Lu-PSMA-617 were investigated. Renal function was assessed through laboratory tests (creatinine, GFR, cystatin C) and Tc-99 m-MAG3 measurements. Adverse events were classified according to the Common Terminology Criteria for Adverse Events (CTCAE) v4.0. To identify risk factors for renal toxicity, we used Pearson's correlation coefficient and the corresponding p values. None of the 55 patients experienced severe nephrotoxicity (grade 3/4). In 14 patients (25%), we observed increased creatinine levels of CTC 1 or 2 . There were 16 cases of increased GFR (grade 1/2). At the baseline, only 14 patients had elevated cystatin C. However, post-therapeutic cystatin C was elevated in 32 patients (58%). A significant effect on renal function was found for age (p = 0.049), hypertension (p = 0.001) and pre-existing kidney disease (p = 0.001). The most reliable predictive markers of nephrotoxicity were TER-MAG3 and cystatin C. Renal toxicity in patients treated with [{sup 177}Lu]Lu-PSMA-617 was low. There was no (sub)acute grade 3 or 4 nephrotoxicity. (orig.)

  11. In Vivo Measurement and Characterization of a Novel Formulation of [177Lu]-DOTA-Octreotate

    Directory of Open Access Journals (Sweden)

    Dale Bailey

    2016-01-01

    Full Text Available Objective(s:Lutetium-177 can be made with high specific activity and with no other isotopes of lutetium present, referred to as “No Carrier Added” (NCA 177Lu. We have radiolabelled DOTA-conjugated peptide DOTA‐(Tyr3‐octreotate with NCA 177Lu (“NCA-LuTATE” and used it in nearly 40 therapeutic administrations for subjects with neuroendocrine tumours or meningiomas. In this paper, we report on our initial studies on aspects of the biodistribution and dosimetry of NCA-LuTATE from gamma camera 2D whole body (WB and quantitative 3D SPECT (qSPECT 177Lu imaging. Methods: Thirteen patients received 39 NCA-LuTATE injections. Extensive WB planar and qSPECT imaging was acquired at approximately 0.5, 4, 24 and 96 h to permit estimates of clearance and radiation dose estimation using MIRD-based methodology (OLINDA-EXM. Results:The average amount of NCA-Lutate administered per cycle was 7839±520 MBq. Bi-exponential modelling of whole body clearance showed half lives for the fast & slow components of t½=2.1±0.6 h and t½=58.1±6.6 h respectively. The average effective dose to kidneys was 3.1±1.0 Gy per cycle. In eight patients completing all treatment cycles the average total dose to kidneys was 11.7±3.6 Gy. Conclusions: We have shown that NCA-LuTATE has an acceptable radiation safety profile and is a suitable alternative to Carrier-Added 177Lu formulations. The fast component of the radiopharmaceutical clearance was closely correlated with baseline renal glomerular filtration rate, and this had an impact on radiation dose to the kidneys. In addition, it has less radioactive waste issues and requires less peptide per treatment.

  12. Yrast bands and signature inversion in double odd 162,164Lu

    International Nuclear Information System (INIS)

    Cardona, M.A.; Hojman, D.; Kreiner, A.J.; Somacal, H.; Davidson, J.; Davidson, M.; Acuna, D. de; Napoli, D.R.; Rico, J.; Burch, R.; Bazzacco, D.; Lenzi, S.M.; Rossi Alvarez, C.; Blasi, N.; Lo Bianco, G.

    1996-01-01

    High spin rotational bands in 162 Lu and 164 Lu have been studied by means of the 139 La( 28 Si,5n) and 139 La( 29(30) Si,4(5)n) reactions respectively. For both nuclei the yrast sequence which is associated with the πh 11/2 x νi 13/2 configuration shows the signature inversion feature. (orig.)

  13. Natural radioactive nuclides 138La and 176Lu in rare earth ore samples

    International Nuclear Information System (INIS)

    Zhang Weiping; Shen Jianfeng; Lu Zhaolun; Jiang Rangrong

    1993-01-01

    The contents of 1 '3 8 La and 176 Lu in some rare earth mines have been measured with a HPGE γ spectrometer. The measurements show that the contents of 138 La and 176 Lu in one rare earth mine are remarkably different from those in the other and they do not display a proportional relation, and that the contents of 40 K in this mine are very low

  14. Linear thermal expansivity and Cp measurements for LuHx and LuDx (x=0.005 and 0.053) single crystals

    International Nuclear Information System (INIS)

    Swenson, C.A.

    1996-01-01

    Linear thermal expansivity (α) measurements from 1 to 300 K and heat capacity (C p ) measurements from 1 to 110 K are reported for single crystals of the α-Lu hexagonal alloys LuH x and LuD x (x=0.005 and 0.053). The C p data confirm and extend to 110 K earlier 1 to 20 K measurements on LuH x alloys, and show that isotope effects, if any, are small. The small x dependences of the C p close-quote s above 8 K can be associated with small increases in the Debye temperature Θ 0 . This latter interpretation, which is consistent with ultrasonic and other results for these alloys, is valid only if C p is expressed as mJ/gmolK (essentially, per mole of Lu ions). Results are in agreement with the previous conclusion from more extensive polycrystalline LuH x data that the shape of the low-temperature C p vs T relation for x≤0.015 is qualitatively different from that for x≥0.032. The linear thermal expansivities of the c-axis alloys, even for x=0.005, are significantly smaller (by from 3% to 20%) than those for the pure crystals, with large isotope effects and a large, nonlinear x dependence for the low-temperature expansivity data. Other types of data have shown a feature near 170 K which is associated with the completion of pairing of the hydrogens along the c axis in next-nearest-neighbor tetrahedral sites. A distinct (approximately 15 K wide) change in α which is observed near this temperature for each alloy, except for a-axis LuD 0.005 , provides the most direct evidence of such a transition. The temperature of the c-axis discontinuity is slightly isotope and x dependent, and scales approximately with x [+24% on warming for LuH(or D) 0.053 ]. (Abstract Truncated)

  15. The coordination number of Lu(III) in a mixed system of methanol and water

    International Nuclear Information System (INIS)

    Arisaka, M.; Takuwa, N.; Suganuma, H.

    2000-01-01

    The stability constants (β 1(F) ) of the monofluoro complex of Lu(III) and those (β 1(Cl) ) of the monochloride solvent-shared ion-pair of Lu(III) have been determined in mixed solvents of methanol and water at 0.10 and 1.00 mol x dm -3 ionic strengths, respectively. The variation in lnβ 1(F) with an increase in the mole fraction of methanol (X s ) in the mixed solvent system showed an acute-angled convex inflection point at X s ∼ 0.12, an acute-angled concave inflection point at X s ∼ 0.22, and another acute-angled convex inflection point at X s ∼ 0.27. It was concluded that the first and the second convex inflection points denoted the CN of Lu 3+ from CN = 8 to a mixture of CN = 8 and 7 and from CN = 8 and 7 to a mixture containing CN = 6, respectively. The concave point is the starting point of a change in the CN of Lu(III) in LuF 2+ from CN = 8 to a mixture of CN = 8 and 7. The values at two inflection points of the CN around Lu 3+ are consistent with the inflection points of the variation in the values of lnβ 1(Cl ) versus the dielectric constant of the mixed solvent. (author)

  16. Overview of Development and Formulation of ¹⁷⁷Lu-DOTA-TATE for PRRT.

    Science.gov (United States)

    Breeman, Wouter A P; Chan, Ho Sze; de Zanger, Rory M S; Konijnenberg, Mark K; de Blois, Erik

    2016-01-01

    Peptide receptor radionuclide therapy (PRRT) using radiolabeled somatostatin analogs has become an established procedure for the treatment of patients suffering from inoperable neuroendocrine cancers over-expressing somatostatin receptors. Success of PRRT depends on the availability of the radiolabeled peptide with adequately high specific activity, so that required therapeutic efficacy can be achieved without saturating the limited number of receptors available on the target lesions. Specific activity of the radionuclide and the radiolabeled somatostatin analog are therefore an important parameters. Although these analogs have been investigated and improved, and successfully applied for PRRT for more than 15 years, there are still many possibilities for further improvements that fully exploit PRRT with 177Lu-DOTA-TATE. The here summarized data presented herein on increased knowledge of the components of 177Lu-DOTA-TATE (especially the purity of 177Lu and specific activity of 177Lu) and the reaction kinetics during labeling 177Lu-DOTA-TATE clearly show that the peptide dose and dose in GBq can be varied. Here we present an overview of the development, formulation and optimisation of 177Lu-DOTA-TATE, mainly addressing radiochemical parameters.

  17. Study on the eγ coincidences in the 169Lu decay

    International Nuclear Information System (INIS)

    Batsev, S.; Bonch-Osmolovskaya, N.A.; Budzyak, A.; Kuznetsov, V.V.; Usmanov, R.R.

    1979-01-01

    The 169 Lu→ 169 Yb decay scheme was analyzed on the basis of measurements of eγ coincidence. The 169 Lu sources were obtained by irradiating a tantalum target by 660 MeV protons. The eγ-coincidence spectra were measured by an ironless β-spectrometer with a toroidal magnetic field and a detector. The γ-ray and eγ-coincidence spectra were processed by a computer. The results of processing the 169 Lu coincidence spectra are tabulated. No excited states of 169 Yb not confirmed by γγ and eγ coincidences (except for the head level of the 3/2 + (651) 720 keV band) remain in the 169 Lu decay scheme proposed. Weak transitions with the total intensity of no more than 3.3% per a 169 Lu decay have remained unarranged, they should discharge weakly excited levels of 169 Yb. Probabilities of the 169 Yb level population per a 169 Lu decay and the corresponding values of probabilities of transitions in them are presented. As a whole, the 169 Lu decay scheme involves 60 levels, 31 states of them are new

  18. Progress in the development of LuAlO$_{3}$ based scintillators

    CERN Document Server

    Belsky, A; Lecoq, P; Dujardin, C; Garnier, N; Canibano, H; Pédrini, C; Petrosian, A

    2000-01-01

    LuAlO/sub 3/:Ce/sup 3+/ (LuAP) and Lu/sub x/Y/sub 1/-xAlO/sub 3/:Ce /sup 3+/ (LuYAP) crystals are used as scintillation materials for positron emission tomography. The actual study of these scintillators develops in three directions: (i) growth of large size LuAP crystals with stable properties, (ii) the relationship between the composition of LuYAP crystals and scintillation properties, and (iii) scintillation mechanisms in lutetium compounds. After improving of growth conditions a large size samples (length >40 mm) have been prepared. Crystals show a good correlation between growth parameters, light yield and transmission spectra. We studied a series of samples with calibrated size (2*2*10 mm3) and compare the light yield with standard BGO and LSO samples. Mixed crystals with composition of 0.6

  19. Comparative vectorial efficiency of Lutzomyia evansi and Lu. longipalpis for transmitting Leishmania chagasi.

    Science.gov (United States)

    Montoya-Lerma, J; Cadena, H; Oviedo, M; Ready, P D; Barazarte, R; Travi, B L; Lane, R P

    2003-01-01

    The infection rates and development of Leishmania chagasi in two sandfly species, Lutzomyia evansi and Lutzomyia longipalpis, were evaluated under natural and experimental conditions. Natural infection rates of Lu. evansi in San Andrés de Sotavento (Colombia) and Montañas de Peraza (Venezuela) (0.05 and 0.2%, respectively) were similar to those previously recorded for this species in Colombia and Venezuela and for Lu. longipalpis in many foci of American Visceral Leishmaniasis (AVL). Both sand fly species were able to support the development of two Colombian strains of L. chagasi experimentally acquired from dogs, hamsters or membrane feeders. However, the experimental infection rates and the sequence of parasite development in the guts of these sand flies revealed that parasite colonisation, differentiation, migration and attachment were more frequent and uniform in Lu. longipalpis than in Lu. evansi. This is consistent with a more recent association between L. chagasi and Lu. evansi, and these results might help to explain the irregularity of AVL outbreaks in foci where Lu. evansi has been reported as the sole vector. Copyright 2002 Elsevier Science B.V.

  20. Sparse modeling of spatial environmental variables associated with asthma.

    Science.gov (United States)

    Chang, Timothy S; Gangnon, Ronald E; David Page, C; Buckingham, William R; Tandias, Aman; Cowan, Kelly J; Tomasallo, Carrie D; Arndt, Brian G; Hanrahan, Lawrence P; Guilbert, Theresa W

    2015-02-01

    Geographically distributed environmental factors influence the burden of diseases such as asthma. Our objective was to identify sparse environmental variables associated with asthma diagnosis gathered from a large electronic health record (EHR) dataset while controlling for spatial variation. An EHR dataset from the University of Wisconsin's Family Medicine, Internal Medicine and Pediatrics Departments was obtained for 199,220 patients aged 5-50years over a three-year period. Each patient's home address was geocoded to one of 3456 geographic census block groups. Over one thousand block group variables were obtained from a commercial database. We developed a Sparse Spatial Environmental Analysis (SASEA). Using this method, the environmental variables were first dimensionally reduced with sparse principal component analysis. Logistic thin plate regression spline modeling was then used to identify block group variables associated with asthma from sparse principal components. The addresses of patients from the EHR dataset were distributed throughout the majority of Wisconsin's geography. Logistic thin plate regression spline modeling captured spatial variation of asthma. Four sparse principal components identified via model selection consisted of food at home, dog ownership, household size, and disposable income variables. In rural areas, dog ownership and renter occupied housing units from significant sparse principal components were associated with asthma. Our main contribution is the incorporation of sparsity in spatial modeling. SASEA sequentially added sparse principal components to Logistic thin plate regression spline modeling. This method allowed association of geographically distributed environmental factors with asthma using EHR and environmental datasets. SASEA can be applied to other diseases with environmental risk factors. Copyright © 2014 Elsevier Inc. All rights reserved.

  1. Occupational doses in neuroendocrine tumors by using 177Lu DOTATATE

    International Nuclear Information System (INIS)

    Costa, Gustavo Coelho Alves; Sa, Lidia Vasconcellos de

    2011-01-01

    This paper investigated the treatment of neuroendocrine tumors (abdominal tumors) using of 177 Lu DOTATATE radiopharmaceutical which is a type of treatment presently used in the experimental form in Brazil and, therefore, not contemplated in norms or specific use. This research studied the occupational doses of this treatment and suggested guidelines or rules of procedures viewing the radiological protection of workers involved and the public. The treatment were followed up by using two types of radiation detection, one a scintillator and a Geiger-Muller, and the measurements were performed in a public hospital at Rio de Janeiro and the other in a private hospital at Sao Paulo. It was observed that the equivalent occupational doses can variate from 160 μSv to 450 μSv, in function of operator, of stage of manipulation, and of the administration method, which can be through the use of infusion pump or manual injection. The use of infusion pump is highly recommended and the hospitalization of the patient until the dose rate measured at 1 m does not surpass 20 μSv/h

  2. Image fusion via nonlocal sparse K-SVD dictionary learning.

    Science.gov (United States)

    Li, Ying; Li, Fangyi; Bai, Bendu; Shen, Qiang

    2016-03-01

    Image fusion aims to merge two or more images captured via various sensors of the same scene to construct a more informative image by integrating their details. Generally, such integration is achieved through the manipulation of the representations of the images concerned. Sparse representation plays an important role in the effective description of images, offering a great potential in a variety of image processing tasks, including image fusion. Supported by sparse representation, in this paper, an approach for image fusion by the use of a novel dictionary learning scheme is proposed. The nonlocal self-similarity property of the images is exploited, not only at the stage of learning the underlying description dictionary but during the process of image fusion. In particular, the property of nonlocal self-similarity is combined with the traditional sparse dictionary. This results in an improved learned dictionary, hereafter referred to as the nonlocal sparse K-SVD dictionary (where K-SVD stands for the K times singular value decomposition that is commonly used in the literature), and abbreviated to NL_SK_SVD. The performance of the NL_SK_SVD dictionary is applied for image fusion using simultaneous orthogonal matching pursuit. The proposed approach is evaluated with different types of images, and compared with a number of alternative image fusion techniques. The resultant superior fused images using the present approach demonstrates the efficacy of the NL_SK_SVD dictionary in sparse image representation.

  3. Sparse dictionary for synthetic transmit aperture medical ultrasound imaging.

    Science.gov (United States)

    Wang, Ping; Jiang, Jin-Yang; Li, Na; Luo, Han-Wu; Li, Fang; Cui, Shi-Gang

    2017-07-01

    It is possible to recover a signal below the Nyquist sampling limit using a compressive sensing technique in ultrasound imaging. However, the reconstruction enabled by common sparse transform approaches does not achieve satisfactory results. Considering the ultrasound echo signal's features of attenuation, repetition, and superposition, a sparse dictionary with the emission pulse signal is proposed. Sparse coefficients in the proposed dictionary have high sparsity. Images reconstructed with this dictionary were compared with those obtained with the three other common transforms, namely, discrete Fourier transform, discrete cosine transform, and discrete wavelet transform. The performance of the proposed dictionary was analyzed via a simulation and experimental data. The mean absolute error (MAE) was used to quantify the quality of the reconstructions. Experimental results indicate that the MAE associated with the proposed dictionary was always the smallest, the reconstruction time required was the shortest, and the lateral resolution and contrast of the reconstructed images were also the closest to the original images. The proposed sparse dictionary performed better than the other three sparse transforms. With the same sampling rate, the proposed dictionary achieved excellent reconstruction quality.

  4. A sparse matrix based full-configuration interaction algorithm

    International Nuclear Information System (INIS)

    Rolik, Zoltan; Szabados, Agnes; Surjan, Peter R.

    2008-01-01

    We present an algorithm related to the full-configuration interaction (FCI) method that makes complete use of the sparse nature of the coefficient vector representing the many-electron wave function in a determinantal basis. Main achievements of the presented sparse FCI (SFCI) algorithm are (i) development of an iteration procedure that avoids the storage of FCI size vectors; (ii) development of an efficient algorithm to evaluate the effect of the Hamiltonian when both the initial and the product vectors are sparse. As a result of point (i) large disk operations can be skipped which otherwise may be a bottleneck of the procedure. At point (ii) we progress by adopting the implementation of the linear transformation by Olsen et al. [J. Chem Phys. 89, 2185 (1988)] for the sparse case, getting the algorithm applicable to larger systems and faster at the same time. The error of a SFCI calculation depends only on the dropout thresholds for the sparse vectors, and can be tuned by controlling the amount of system memory passed to the procedure. The algorithm permits to perform FCI calculations on single node workstations for systems previously accessible only by supercomputers

  5. X-ray computed tomography using curvelet sparse regularization.

    Science.gov (United States)

    Wieczorek, Matthias; Frikel, Jürgen; Vogel, Jakob; Eggl, Elena; Kopp, Felix; Noël, Peter B; Pfeiffer, Franz; Demaret, Laurent; Lasser, Tobias

    2015-04-01

    Reconstruction of x-ray computed tomography (CT) data remains a mathematically challenging problem in medical imaging. Complementing the standard analytical reconstruction methods, sparse regularization is growing in importance, as it allows inclusion of prior knowledge. The paper presents a method for sparse regularization based on the curvelet frame for the application to iterative reconstruction in x-ray computed tomography. In this work, the authors present an iterative reconstruction approach based on the alternating direction method of multipliers using curvelet sparse regularization. Evaluation of the method is performed on a specifically crafted numerical phantom dataset to highlight the method's strengths. Additional evaluation is performed on two real datasets from commercial scanners with different noise characteristics, a clinical bone sample acquired in a micro-CT and a human abdomen scanned in a diagnostic CT. The results clearly illustrate that curvelet sparse regularization has characteristic strengths. In particular, it improves the restoration and resolution of highly directional, high contrast features with smooth contrast variations. The authors also compare this approach to the popular technique of total variation and to traditional filtered backprojection. The authors conclude that curvelet sparse regularization is able to improve reconstruction quality by reducing noise while preserving highly directional features.

  6. Selectivity and sparseness in randomly connected balanced networks.

    Directory of Open Access Journals (Sweden)

    Cengiz Pehlevan

    Full Text Available Neurons in sensory cortex show stimulus selectivity and sparse population response, even in cases where no strong functionally specific structure in connectivity can be detected. This raises the question whether selectivity and sparseness can be generated and maintained in randomly connected networks. We consider a recurrent network of excitatory and inhibitory spiking neurons with random connectivity, driven by random projections from an input layer of stimulus selective neurons. In this architecture, the stimulus-to-stimulus and neuron-to-neuron modulation of total synaptic input is weak compared to the mean input. Surprisingly, we show that in the balanced state the network can still support high stimulus selectivity and sparse population response. In the balanced state, strong synapses amplify the variation in synaptic input and recurrent inhibition cancels the mean. Functional specificity in connectivity emerges due to the inhomogeneity caused by the generative statistical rule used to build the network. We further elucidate the mechanism behind and evaluate the effects of model parameters on population sparseness and stimulus selectivity. Network response to mixtures of stimuli is investigated. It is shown that a balanced state with unselective inhibition can be achieved with densely connected input to inhibitory population. Balanced networks exhibit the "paradoxical" effect: an increase in excitatory drive to inhibition leads to decreased inhibitory population firing rate. We compare and contrast selectivity and sparseness generated by the balanced network to randomly connected unbalanced networks. Finally, we discuss our results in light of experiments.

  7. Low-count PET image restoration using sparse representation

    Science.gov (United States)

    Li, Tao; Jiang, Changhui; Gao, Juan; Yang, Yongfeng; Liang, Dong; Liu, Xin; Zheng, Hairong; Hu, Zhanli

    2018-04-01

    In the field of positron emission tomography (PET), reconstructed images are often blurry and contain noise. These problems are primarily caused by the low resolution of projection data. Solving this problem by improving hardware is an expensive solution, and therefore, we attempted to develop a solution based on optimizing several related algorithms in both the reconstruction and image post-processing domains. As sparse technology is widely used, sparse prediction is increasingly applied to solve this problem. In this paper, we propose a new sparse method to process low-resolution PET images. Two dictionaries (D1 for low-resolution PET images and D2 for high-resolution PET images) are learned from a group real PET image data sets. Among these two dictionaries, D1 is used to obtain a sparse representation for each patch of the input PET image. Then, a high-resolution PET image is generated from this sparse representation using D2. Experimental results indicate that the proposed method exhibits a stable and superior ability to enhance image resolution and recover image details. Quantitatively, this method achieves better performance than traditional methods. This proposed strategy is a new and efficient approach for improving the quality of PET images.

  8. Sparse BLIP: BLind Iterative Parallel imaging reconstruction using compressed sensing.

    Science.gov (United States)

    She, Huajun; Chen, Rong-Rong; Liang, Dong; DiBella, Edward V R; Ying, Leslie

    2014-02-01

    To develop a sensitivity-based parallel imaging reconstruction method to reconstruct iteratively both the coil sensitivities and MR image simultaneously based on their prior information. Parallel magnetic resonance imaging reconstruction problem can be formulated as a multichannel sampling problem where solutions are sought analytically. However, the channel functions given by the coil sensitivities in parallel imaging are not known exactly and the estimation error usually leads to artifacts. In this study, we propose a new reconstruction algorithm, termed Sparse BLind Iterative Parallel, for blind iterative parallel imaging reconstruction using compressed sensing. The proposed algorithm reconstructs both the sensitivity functions and the image simultaneously from undersampled data. It enforces the sparseness constraint in the image as done in compressed sensing, but is different from compressed sensing in that the sensing matrix is unknown and additional constraint is enforced on the sensitivities as well. Both phantom and in vivo imaging experiments were carried out with retrospective undersampling to evaluate the performance of the proposed method. Experiments show improvement in Sparse BLind Iterative Parallel reconstruction when compared with Sparse SENSE, JSENSE, IRGN-TV, and L1-SPIRiT reconstructions with the same number of measurements. The proposed Sparse BLind Iterative Parallel algorithm reduces the reconstruction errors when compared to the state-of-the-art parallel imaging methods. Copyright © 2013 Wiley Periodicals, Inc.

  9. Factorising the 3D topologically twisted index

    Energy Technology Data Exchange (ETDEWEB)

    Cabo-Bizet, Alejandro [Instituto de Astronomía y Física del Espacio (CONICET-UBA),Ciudad Universitaria, C.P. 1428, Buenos Aires (Argentina)

    2017-04-20

    We explore the path integration — upon the contour of hermitian (non-auxliary) field configurations — of topologically twisted N=2 Chern-Simons-matter theory (TTCSM) on S{sub 2} times a segment. In this way, we obtain the formula for the 3D topologically twisted index, first as a convolution of TTCSM on S{sub 2} times halves of S{sub 1}, second as TTCSM on S{sub 2} times S{sub 1} — with a puncture, — and third as TTCSM on S{sub 2}×S{sub 1}. In contradistinction to the first two cases, in the third case, the vector multiplet auxiliary field D is constrained to be anti-hermitian.

  10. Factorised steady states and condensation transitions in ...

    Indian Academy of Sciences (India)

    As illustrated in figure 1 there exists an exact mapping from a ZRP to an asym .... internal structure, for example further degrees of freedom, but all this is integrated ..... A: Math. Gen. 32, L99 (1999). [10] M R Evans and R A Blythe, Physica A313, ...

  11. Factorising the 3D topologically twisted index

    Science.gov (United States)

    Cabo-Bizet, Alejandro

    2017-04-01

    We explore the path integration — upon the contour of hermitian (non-auxliary) field configurations — of topologically twisted N=2 Chern-Simons-matter theory (TTCSM) on {S}_2 times a segment. In this way, we obtain the formula for the 3D topologically twisted index, first as a convolution of TTCSM on {S}_2 times halves of {S}_1 , second as TTCSM on {S}_2 times {S}_1 — with a puncture, — and third as TTCSM on {S}_2× {S}_1 . In contradistinction to the first two cases, in the third case, the vector multiplet auxiliary field D is constrained to be anti-hermitian.

  12. On the Automatic Parallelization of Sparse and Irregular Fortran Programs

    Directory of Open Access Journals (Sweden)

    Yuan Lin

    1999-01-01

    Full Text Available Automatic parallelization is usually believed to be less effective at exploiting implicit parallelism in sparse/irregular programs than in their dense/regular counterparts. However, not much is really known because there have been few research reports on this topic. In this work, we have studied the possibility of using an automatic parallelizing compiler to detect the parallelism in sparse/irregular programs. The study with a collection of sparse/irregular programs led us to some common loop patterns. Based on these patterns new techniques were derived that produced good speedups when manually applied to our benchmark codes. More importantly, these parallelization methods can be implemented in a parallelizing compiler and can be applied automatically.

  13. Joint sparse representation for robust multimodal biometrics recognition.

    Science.gov (United States)

    Shekhar, Sumit; Patel, Vishal M; Nasrabadi, Nasser M; Chellappa, Rama

    2014-01-01

    Traditional biometric recognition systems rely on a single biometric signature for authentication. While the advantage of using multiple sources of information for establishing the identity has been widely recognized, computational models for multimodal biometrics recognition have only recently received attention. We propose a multimodal sparse representation method, which represents the test data by a sparse linear combination of training data, while constraining the observations from different modalities of the test subject to share their sparse representations. Thus, we simultaneously take into account correlations as well as coupling information among biometric modalities. A multimodal quality measure is also proposed to weigh each modality as it gets fused. Furthermore, we also kernelize the algorithm to handle nonlinearity in data. The optimization problem is solved using an efficient alternative direction method. Various experiments show that the proposed method compares favorably with competing fusion-based methods.

  14. Sparse Representation Denoising for Radar High Resolution Range Profiling

    Directory of Open Access Journals (Sweden)

    Min Li

    2014-01-01

    Full Text Available Radar high resolution range profile has attracted considerable attention in radar automatic target recognition. In practice, radar return is usually contaminated by noise, which results in profile distortion and recognition performance degradation. To deal with this problem, in this paper, a novel denoising method based on sparse representation is proposed to remove the Gaussian white additive noise. The return is sparsely described in the Fourier redundant dictionary and the denoising problem is described as a sparse representation model. Noise level of the return, which is crucial to the denoising performance but often unknown, is estimated by performing subspace method on the sliding subsequence correlation matrix. Sliding window process enables noise level estimation using only one observation sequence, not only guaranteeing estimation efficiency but also avoiding the influence of profile time-shift sensitivity. Experimental results show that the proposed method can effectively improve the signal-to-noise ratio of the return, leading to a high-quality profile.

  15. A Projected Conjugate Gradient Method for Sparse Minimax Problems

    DEFF Research Database (Denmark)

    Madsen, Kaj; Jonasson, Kristjan

    1993-01-01

    A new method for nonlinear minimax problems is presented. The method is of the trust region type and based on sequential linear programming. It is a first order method that only uses first derivatives and does not approximate Hessians. The new method is well suited for large sparse problems...... as it only requires that software for sparse linear programming and a sparse symmetric positive definite equation solver are available. On each iteration a special linear/quadratic model of the function is minimized, but contrary to the usual practice in trust region methods the quadratic model is only...... with the method are presented. In fact, we find that the number of iterations required is comparable to that of state-of-the-art quasi-Newton codes....

  16. A Multiobjective Sparse Feature Learning Model for Deep Neural Networks.

    Science.gov (United States)

    Gong, Maoguo; Liu, Jia; Li, Hao; Cai, Qing; Su, Linzhi

    2015-12-01

    Hierarchical deep neural networks are currently popular learning models for imitating the hierarchical architecture of human brain. Single-layer feature extractors are the bricks to build deep networks. Sparse feature learning models are popular models that can learn useful representations. But most of those models need a user-defined constant to control the sparsity of representations. In this paper, we propose a multiobjective sparse feature learning model based on the autoencoder. The parameters of the model are learnt by optimizing two objectives, reconstruction error and the sparsity of hidden units simultaneously to find a reasonable compromise between them automatically. We design a multiobjective induced learning procedure for this model based on a multiobjective evolutionary algorithm. In the experiments, we demonstrate that the learning procedure is effective, and the proposed multiobjective model can learn useful sparse features.

  17. Massively parallel sparse matrix function calculations with NTPoly

    Science.gov (United States)

    Dawson, William; Nakajima, Takahito

    2018-04-01

    We present NTPoly, a massively parallel library for computing the functions of sparse, symmetric matrices. The theory of matrix functions is a well developed framework with a wide range of applications including differential equations, graph theory, and electronic structure calculations. One particularly important application area is diagonalization free methods in quantum chemistry. When the input and output of the matrix function are sparse, methods based on polynomial expansions can be used to compute matrix functions in linear time. We present a library based on these methods that can compute a variety of matrix functions. Distributed memory parallelization is based on a communication avoiding sparse matrix multiplication algorithm. OpenMP task parallellization is utilized to implement hybrid parallelization. We describe NTPoly's interface and show how it can be integrated with programs written in many different programming languages. We demonstrate the merits of NTPoly by performing large scale calculations on the K computer.

  18. Preconditioned Inexact Newton for Nonlinear Sparse Electromagnetic Imaging

    KAUST Repository

    Desmal, Abdulla; Bagci, Hakan

    2014-01-01

    Newton-type algorithms have been extensively studied in nonlinear microwave imaging due to their quadratic convergence rate and ability to recover images with high contrast values. In the past, Newton methods have been implemented in conjunction with smoothness promoting optimization/regularization schemes. However, this type of regularization schemes are known to perform poorly when applied in imagining domains with sparse content or sharp variations. In this work, an inexact Newton algorithm is formulated and implemented in conjunction with a linear sparse optimization scheme. A novel preconditioning technique is proposed to increase the convergence rate of the optimization problem. Numerical results demonstrate that the proposed framework produces sharper and more accurate images when applied in sparse/sparsified domains.

  19. Preconditioned Inexact Newton for Nonlinear Sparse Electromagnetic Imaging

    KAUST Repository

    Desmal, Abdulla

    2014-05-04

    Newton-type algorithms have been extensively studied in nonlinear microwave imaging due to their quadratic convergence rate and ability to recover images with high contrast values. In the past, Newton methods have been implemented in conjunction with smoothness promoting optimization/regularization schemes. However, this type of regularization schemes are known to perform poorly when applied in imagining domains with sparse content or sharp variations. In this work, an inexact Newton algorithm is formulated and implemented in conjunction with a linear sparse optimization scheme. A novel preconditioning technique is proposed to increase the convergence rate of the optimization problem. Numerical results demonstrate that the proposed framework produces sharper and more accurate images when applied in sparse/sparsified domains.

  20. Preconditioned Inexact Newton for Nonlinear Sparse Electromagnetic Imaging

    KAUST Repository

    Desmal, Abdulla

    2014-01-06

    Newton-type algorithms have been extensively studied in nonlinear microwave imaging due to their quadratic convergence rate and ability to recover images with high contrast values. In the past, Newton methods have been implemented in conjunction with smoothness promoting optimization/regularization schemes. However, this type of regularization schemes are known to perform poorly when applied in imagining domains with sparse content or sharp variations. In this work, an inexact Newton algorithm is formulated and implemented in conjunction with a linear sparse optimization scheme. A novel preconditioning technique is proposed to increase the convergence rate of the optimization problem. Numerical results demonstrate that the proposed framework produces sharper and more accurate images when applied in sparse/sparsified domains.

  1. Identification of MIMO systems with sparse transfer function coefficients

    Science.gov (United States)

    Qiu, Wanzhi; Saleem, Syed Khusro; Skafidas, Efstratios

    2012-12-01

    We study the problem of estimating transfer functions of multivariable (multiple-input multiple-output--MIMO) systems with sparse coefficients. We note that subspace identification methods are powerful and convenient tools in dealing with MIMO systems since they neither require nonlinear optimization nor impose any canonical form on the systems. However, subspace-based methods are inefficient for systems with sparse transfer function coefficients since they work on state space models. We propose a two-step algorithm where the first step identifies the system order using the subspace principle in a state space format, while the second step estimates coefficients of the transfer functions via L1-norm convex optimization. The proposed algorithm retains good features of subspace methods with improved noise-robustness for sparse systems.

  2. A General Sparse Tensor Framework for Electronic Structure Theory.

    Science.gov (United States)

    Manzer, Samuel; Epifanovsky, Evgeny; Krylov, Anna I; Head-Gordon, Martin

    2017-03-14

    Linear-scaling algorithms must be developed in order to extend the domain of applicability of electronic structure theory to molecules of any desired size. However, the increasing complexity of modern linear-scaling methods makes code development and maintenance a significant challenge. A major contributor to this difficulty is the lack of robust software abstractions for handling block-sparse tensor operations. We therefore report the development of a highly efficient symbolic block-sparse tensor library in order to provide access to high-level software constructs to treat such problems. Our implementation supports arbitrary multi-dimensional sparsity in all input and output tensors. We avoid cumbersome machine-generated code by implementing all functionality as a high-level symbolic C++ language library and demonstrate that our implementation attains very high performance for linear-scaling sparse tensor contractions.

  3. Sparse dictionary learning of resting state fMRI networks.

    Science.gov (United States)

    Eavani, Harini; Filipovych, Roman; Davatzikos, Christos; Satterthwaite, Theodore D; Gur, Raquel E; Gur, Ruben C

    2012-07-02

    Research in resting state fMRI (rsfMRI) has revealed the presence of stable, anti-correlated functional subnetworks in the brain. Task-positive networks are active during a cognitive process and are anti-correlated with task-negative networks, which are active during rest. In this paper, based on the assumption that the structure of the resting state functional brain connectivity is sparse, we utilize sparse dictionary modeling to identify distinct functional sub-networks. We propose two ways of formulating the sparse functional network learning problem that characterize the underlying functional connectivity from different perspectives. Our results show that the whole-brain functional connectivity can be concisely represented with highly modular, overlapping task-positive/negative pairs of sub-networks.

  4. Uncovering Transcriptional Regulatory Networks by Sparse Bayesian Factor Model

    Directory of Open Access Journals (Sweden)

    Qi Yuan(Alan

    2010-01-01

    Full Text Available Abstract The problem of uncovering transcriptional regulation by transcription factors (TFs based on microarray data is considered. A novel Bayesian sparse correlated rectified factor model (BSCRFM is proposed that models the unknown TF protein level activity, the correlated regulations between TFs, and the sparse nature of TF-regulated genes. The model admits prior knowledge from existing database regarding TF-regulated target genes based on a sparse prior and through a developed Gibbs sampling algorithm, a context-specific transcriptional regulatory network specific to the experimental condition of the microarray data can be obtained. The proposed model and the Gibbs sampling algorithm were evaluated on the simulated systems, and results demonstrated the validity and effectiveness of the proposed approach. The proposed model was then applied to the breast cancer microarray data of patients with Estrogen Receptor positive ( status and Estrogen Receptor negative ( status, respectively.

  5. P-SPARSLIB: A parallel sparse iterative solution package

    Energy Technology Data Exchange (ETDEWEB)

    Saad, Y. [Univ. of Minnesota, Minneapolis, MN (United States)

    1994-12-31

    Iterative methods are gaining popularity in engineering and sciences at a time where the computational environment is changing rapidly. P-SPARSLIB is a project to build a software library for sparse matrix computations on parallel computers. The emphasis is on iterative methods and the use of distributed sparse matrices, an extension of the domain decomposition approach to general sparse matrices. One of the goals of this project is to develop a software package geared towards specific applications. For example, the author will test the performance and usefulness of P-SPARSLIB modules on linear systems arising from CFD applications. Equally important is the goal of portability. In the long run, the author wishes to ensure that this package is portable on a variety of platforms, including SIMD environments and shared memory environments.

  6. MULTISCALE SPARSE APPEARANCE MODELING AND SIMULATION OF PATHOLOGICAL DEFORMATIONS

    Directory of Open Access Journals (Sweden)

    Rami Zewail

    2017-08-01

    Full Text Available Machine learning and statistical modeling techniques has drawn much interest within the medical imaging research community. However, clinically-relevant modeling of anatomical structures continues to be a challenging task. This paper presents a novel method for multiscale sparse appearance modeling in medical images with application to simulation of pathological deformations in X-ray images of human spine. The proposed appearance model benefits from the non-linear approximation power of Contourlets and its ability to capture higher order singularities to achieve a sparse representation while preserving the accuracy of the statistical model. Independent Component Analysis is used to extract statistical independent modes of variations from the sparse Contourlet-based domain. The new model is then used to simulate clinically-relevant pathological deformations in radiographic images.

  7. Single-crystal study of the charge density wave metal LuNiC2

    Science.gov (United States)

    Steiner, S.; Michor, H.; Sologub, O.; Hinterleitner, B.; Höfenstock, F.; Waas, M.; Bauer, E.; Stöger, B.; Babizhetskyy, V.; Levytskyy, V.; Kotur, B.

    2018-05-01

    We report on single-crystal growth, single-crystal x-ray diffraction, physical properties, and density functional theory (DFT) electronic structure as well as Fermi surface calculations for two ternary carbides, LuCoC2 and LuNiC2. Electrical resistivity measurements reveal for LuNiC2 a charge density wave (CDW) transition at TCDW≃450 K and, for T >TCDW , a significant anisotropy of the electrical resistivity, which is lowest along the orthorhombic a axis. The analysis of x-ray superstructure reflections suggest a commensurate CDW state with a Peierls-type distortion of the Ni atom periodicity along the orthorhombic a axis. DFT calculations based on the CDW modulated monoclinic structure model of LuNiC2 as compared to results of the orthorhombic parent type reveal the formation of a partial CDW gap at the Fermi level which reduces the electronic density of states from N (EF)=1.03 states/eV f.u. without CDW to N (EF)=0.46 states/eV f.u. in the CDW state. The corresponding bare DFT Sommerfeld value of the latter, γDFTCDW=0.90 mJ/mol K2, reaches reasonable agreement with the experimental value γ =0.83 (5 ) mJ/mol K2 of LuNiC2. LuCoC2 displays a simple metallic behavior with neither CDW ordering nor superconductivity above 0.4 K. Its experimental Sommerfeld coefficient, γ =5.9 (1) mJ/mol K2, is in realistic correspondence with the calculated, bare Sommerfeld coefficient, γDFT=3.82 mJ/mol K2, of orthorhombic LuCoC2.

  8. Effective lattice stabilization of gadolinium aluminate garnet (GdAG via Lu3+ doping and development of highly efficient (Gd,LuAG:Eu3+ red phosphors

    Directory of Open Access Journals (Sweden)

    Jinkai Li, Ji-Guang Li, Zhongjie Zhang, Xiaoli Wu, Shaohong Liu, Xiaodong Li, Xudong Sun and Yoshio Sakka

    2012-01-01

    Full Text Available The metastable garnet lattice of Gd3Al5O12 is stabilized by doping with smaller Lu3+, which then allows an effective incorporation of larger Eu3+ activators. The [(Gd1−xLux1−yEuy]3Al5O12 (x = 0.1–0.5, y = 0.01–0.09 garnet solid solutions, calcined from their precursors synthesized via carbonate coprecipitation, exhibit strong luminescence at 591 nm (the 5D0 → 7F1 magnetic dipole transition of Eu3+ upon UV excitation into the charge transfer band (CTB at ~239 nm, with CIE chromaticity coordinates of x = 0.620 and y = 0.380 (orange-red. The quenching concentration of Eu3+ was estimated at ~5 at.% (y = 0.05, and the quenching was attributed to exchange interactions. Partial replacement of Gd3+ with Lu3+ up to 50 at.% (x = 0.5 while keeping Eu3+ at the optimal content of 5 at.% does not significantly alter the peak positions of the CTB and 5D0 → 7F1 emission bands but slightly weakens both bands owing to the higher electronegativity of Lu3+. The effects of processing temperature (1000–1500 °C and Lu/Eu contents on the intensity, quantum efficiency, lifetime and asymmetry factor of luminescence were thoroughly investigated. The [(Gd0.7Lu0.30.95Eu0.05]3Al5O12 phosphor processed at 1500 °C exhibits a high internal quantum efficiency of ~83.2% under 239 nm excitation, which, in combination with the high theoretical density, favors its use as a new type of photoluminescent and scintillation material.

  9. Preparation of 177Lu-DOTA/DTPA-Bz-Cys-RGD dimer and biodistribution evaluation in normal mice

    International Nuclear Information System (INIS)

    Sheng Feng; Jia Bing; Wang Fan; He Weiwei; Liu Zhaofei; Zhao Huiyun

    2008-01-01

    177 Lu-DOTA-Bz-Cys-RGD dimer and 177 Lu-DTPA-Bz-Cys-RGD dimer were prepared, and the in vitro and in vivo properties were compared. TLC and HPLC show that the labeling yields of two radiolabeled compounds are more than 95% under optimal conditions (pH=5.0, reacting at 100 degree C for 15-20 min), and the two radiolabeled compounds show pretty good in vitro stability. HPLC analyses and lg P values reveal that lipophilicity of 177 Lu-DOTA-Bz-Cys- RGD dimer is higher than 177 Lu-DTPA-Bz-Cys-RGD dimer. The uptake of 177 Lu-DTPA-Bz-Cys- RGD dimer in other tissues is significantly higher than that of 177 Lu-DOTA-Bz-Cys-RGD dimer at 4 h postinjection, except for blood and spleen. The in vivo stability of 177 Lu-DOTA-Bz-Cys-RGD dimer is much better than 177 Lu-DTPA-Bz-Cys-RGD dimer. Bz-DOTA is an ideal bifunctional chelator for 177 Lu labeling of RGD dimer. (authors)

  10. Preparation of LuAG Powders with Single Phase and Good Dispersion for Transparent Ceramics Using Co-Precipitation Method

    Science.gov (United States)

    Pan, Liangjie; Jiang, Benxue; Fan, Jintai; Yang, Qiuhong; Zhou, Chunlin; Zhang, Pande; Mao, Xiaojian; Zhang, Long

    2015-01-01

    The synthesis of pure and well dispersed lutetium aluminum garnet (LuAG) powder is crucial and important for the preparation of LuAG transparent ceramics. In this paper, high purity and well dispersed LuAG powders have been synthesized via co-precipitation method with lutetium nitrate and aluminum nitrate as raw materials. Ammonium hydrogen carbonate (AHC) was used as the precipitant. The influence of aging time, pH value, and dripping speed on the prepared LuAG powders were investigated. It showed that long aging duration (>15 h) with high terminal pH value (>7.80) resulted in segregation of rhombus Lu precipitate and Al precipitate. By decreasing the initial pH value or accelerating the dripping speed, rhombus Lu precipitate was eliminated and pure LuAG nano powders were synthesized. High quality LuAG transparent ceramics with transmission >75% at 1064 nm were fabricated using these well dispersed nano LuAG powders. PMID:28793510

  11. Preparation of LuAG Powders with Single Phase and Good Dispersion for Transparent Ceramics Using Co-Precipitation Method

    Directory of Open Access Journals (Sweden)

    Liangjie Pan

    2015-08-01

    Full Text Available The synthesis of pure and well dispersed lutetium aluminum garnet (LuAG powder is crucial and important for the preparation of LuAG transparent ceramics. In this paper, high purity and well dispersed LuAG powders have been synthesized via co-precipitation method with lutetium nitrate and aluminum nitrate as raw materials. Ammonium hydrogen carbonate (AHC was used as the precipitant. The influence of aging time, pH value, and dripping speed on the prepared LuAG powders were investigated. It showed that long aging duration (>15 h with high terminal pH value (>7.80 resulted in segregation of rhombus Lu precipitate and Al precipitate. By decreasing the initial pH value or accelerating the dripping speed, rhombus Lu precipitate was eliminated and pure LuAG nano powders were synthesized. High quality LuAG transparent ceramics with transmission >75% at 1064 nm were fabricated using these well dispersed nano LuAG powders.

  12. Universal Regularizers For Robust Sparse Coding and Modeling

    OpenAIRE

    Ramirez, Ignacio; Sapiro, Guillermo

    2010-01-01

    Sparse data models, where data is assumed to be well represented as a linear combination of a few elements from a dictionary, have gained considerable attention in recent years, and their use has led to state-of-the-art results in many signal and image processing tasks. It is now well understood that the choice of the sparsity regularization term is critical in the success of such models. Based on a codelength minimization interpretation of sparse coding, and using tools from universal coding...

  13. Uniform sparse bounds for discrete quadratic phase Hilbert transforms

    Science.gov (United States)

    Kesler, Robert; Arias, Darío Mena

    2017-09-01

    For each α \\in T consider the discrete quadratic phase Hilbert transform acting on finitely supported functions f : Z → C according to H^{α }f(n):= \\sum _{m ≠ 0} e^{iα m^2} f(n - m)/m. We prove that, uniformly in α \\in T , there is a sparse bound for the bilinear form for every pair of finitely supported functions f,g : Z→ C . The sparse bound implies several mapping properties such as weighted inequalities in an intersection of Muckenhoupt and reverse Hölder classes.

  14. Sparse reconstruction by means of the standard Tikhonov regularization

    International Nuclear Information System (INIS)

    Lu Shuai; Pereverzev, Sergei V

    2008-01-01

    It is a common belief that Tikhonov scheme with || · ||L 2 -penalty fails in sparse reconstruction. We are going to show, however, that this standard regularization can help if the stability measured in L 1 -norm will be properly taken into account in the choice of the regularization parameter. The crucial point is that now a stability bound may depend on the bases with respect to which the solution of the problem is assumed to be sparse. We discuss how such a stability can be estimated numerically and present the results of computational experiments giving the evidence of the reliability of our approach.

  15. Sparse electromagnetic imaging using nonlinear iterative shrinkage thresholding

    KAUST Repository

    Desmal, Abdulla; Bagci, Hakan

    2015-01-01

    A sparse nonlinear electromagnetic imaging scheme is proposed for reconstructing dielectric contrast of investigation domains from measured fields. The proposed approach constructs the optimization problem by introducing the sparsity constraint to the data misfit between the scattered fields expressed as a nonlinear function of the contrast and the measured fields and solves it using the nonlinear iterative shrinkage thresholding algorithm. The thresholding is applied to the result of every nonlinear Landweber iteration to enforce the sparsity constraint. Numerical results demonstrate the accuracy and efficiency of the proposed method in reconstructing sparse dielectric profiles.

  16. Sparse electromagnetic imaging using nonlinear iterative shrinkage thresholding

    KAUST Repository

    Desmal, Abdulla

    2015-04-13

    A sparse nonlinear electromagnetic imaging scheme is proposed for reconstructing dielectric contrast of investigation domains from measured fields. The proposed approach constructs the optimization problem by introducing the sparsity constraint to the data misfit between the scattered fields expressed as a nonlinear function of the contrast and the measured fields and solves it using the nonlinear iterative shrinkage thresholding algorithm. The thresholding is applied to the result of every nonlinear Landweber iteration to enforce the sparsity constraint. Numerical results demonstrate the accuracy and efficiency of the proposed method in reconstructing sparse dielectric profiles.

  17. Sparse grid techniques for particle-in-cell schemes

    Science.gov (United States)

    Ricketson, L. F.; Cerfon, A. J.

    2017-02-01

    We propose the use of sparse grids to accelerate particle-in-cell (PIC) schemes. By using the so-called ‘combination technique’ from the sparse grids literature, we are able to dramatically increase the size of the spatial cells in multi-dimensional PIC schemes while paying only a slight penalty in grid-based error. The resulting increase in cell size allows us to reduce the statistical noise in the simulation without increasing total particle number. We present initial proof-of-principle results from test cases in two and three dimensions that demonstrate the new scheme’s efficiency, both in terms of computation time and memory usage.

  18. Ordering sparse matrices for cache-based systems

    International Nuclear Information System (INIS)

    Biswas, Rupak; Oliker, Leonid

    2001-01-01

    The Conjugate Gradient (CG) algorithm is the oldest and best-known Krylov subspace method used to solve sparse linear systems. Most of the coating-point operations within each CG iteration is spent performing sparse matrix-vector multiplication (SPMV). We examine how various ordering and partitioning strategies affect the performance of CG and SPMV when different programming paradigms are used on current commercial cache-based computers. However, a multithreaded implementation on the cacheless Cray MTA demonstrates high efficiency and scalability without any special ordering or partitioning

  19. Sparse Matrix for ECG Identification with Two-Lead Features

    Directory of Open Access Journals (Sweden)

    Kuo-Kun Tseng

    2015-01-01

    Full Text Available Electrocardiograph (ECG human identification has the potential to improve biometric security. However, improvements in ECG identification and feature extraction are required. Previous work has focused on single lead ECG signals. Our work proposes a new algorithm for human identification by mapping two-lead ECG signals onto a two-dimensional matrix then employing a sparse matrix method to process the matrix. And that is the first application of sparse matrix techniques for ECG identification. Moreover, the results of our experiments demonstrate the benefits of our approach over existing methods.

  20. Low-rank and sparse modeling for visual analysis

    CERN Document Server

    Fu, Yun

    2014-01-01

    This book provides a view of low-rank and sparse computing, especially approximation, recovery, representation, scaling, coding, embedding and learning among unconstrained visual data. The book includes chapters covering multiple emerging topics in this new field. It links multiple popular research fields in Human-Centered Computing, Social Media, Image Classification, Pattern Recognition, Computer Vision, Big Data, and Human-Computer Interaction. Contains an overview of the low-rank and sparse modeling techniques for visual analysis by examining both theoretical analysis and real-world applic

  1. Radiolabeling parameters of {sup 177}Lu-DOTA-RITUXIMAB

    Energy Technology Data Exchange (ETDEWEB)

    Massicano, Adriana V.F.; Alcarde, Lais F.; Oliveira, Ricardo S.; Mengatti, Jair; Araujo, Elaine B. de, E-mail: adriana.avfernandes@gmail.com [Instituto de Pesquisas Energeticas e Nucleares (IPEN/CNEN-SP), Sao Paulo, SP (Brazil)

    2013-07-01

    Cancer treatment using radioimmunotherapy (RIT) has been the focus of much research in the last two decades. In RIT, a radioisotope is coupled to a monoclonal antibody (mAb) to form a tumor-specific target agent to improve the cytocidal effect of the mAbs. RIT allows the systemic delivery of radiation to disease target by mAbs while sparing normal tissues. Rituximab® (Mabthera - Roche) is a chimeric mouse-human monoclonal antibody; it selectively binds with high affinity to the CD20 antigen, a hydrophobic transmembrane protein, which is expressed on B-lymphocytes and in more than 90% of B cell non-Hodgkin's lymphomas (NHL). The conjugation and radiolabeling process involve special conditions of pH and temperature, long processes of manipulation and mixing. All this process can damage the antibody structure and compromise its clinical application. Therefore, these parameters must be largely studied. The aim of this work was to evaluate the best radiolabeling conditions of DOTA-rituximab. Briefly, 10 mg of antibody previously purified by ultrafiltration device was conjugated with DOTA-NHS-ester (Macrocyclics) in 50 fold molar excess. The reaction was conducted for 1 hour in phosphate buffer pH 8.0 and gently mixing at room temperature, remaining for 24 hours under refrigeration. The immunoconjugated was purified by size exclusion column and ultrafiltration device. The radiolabeled parameters studied were: immunoconjugated mass, activity of {sup 177}LuCl{sub 3}, reaction time, temperature and pH. The radiochemical purity of the preparations was determined using analysis by thin layer chromatography (TLC-SG plates). The best studied condition presented radiochemical purity above 95% and the integrity of antibody was preserved. (author)

  2. Radiolabeling parameters of 177Lu-DOTA-RITUXIMAB

    International Nuclear Information System (INIS)

    Massicano, Adriana V.F.; Alcarde, Lais F.; Oliveira, Ricardo S.; Mengatti, Jair; Araujo, Elaine B. de

    2013-01-01

    Cancer treatment using radioimmunotherapy (RIT) has been the focus of much research in the last two decades. In RIT, a radioisotope is coupled to a monoclonal antibody (mAb) to form a tumor-specific target agent to improve the cytocidal effect of the mAbs. RIT allows the systemic delivery of radiation to disease target by mAbs while sparing normal tissues. Rituximab® (Mabthera - Roche) is a chimeric mouse-human monoclonal antibody; it selectively binds with high affinity to the CD20 antigen, a hydrophobic transmembrane protein, which is expressed on B-lymphocytes and in more than 90% of B cell non-Hodgkin's lymphomas (NHL). The conjugation and radiolabeling process involve special conditions of pH and temperature, long processes of manipulation and mixing. All this process can damage the antibody structure and compromise its clinical application. Therefore, these parameters must be largely studied. The aim of this work was to evaluate the best radiolabeling conditions of DOTA-rituximab. Briefly, 10 mg of antibody previously purified by ultrafiltration device was conjugated with DOTA-NHS-ester (Macrocyclics) in 50 fold molar excess. The reaction was conducted for 1 hour in phosphate buffer pH 8.0 and gently mixing at room temperature, remaining for 24 hours under refrigeration. The immunoconjugated was purified by size exclusion column and ultrafiltration device. The radiolabeled parameters studied were: immunoconjugated mass, activity of 177 LuCl 3 , reaction time, temperature and pH. The radiochemical purity of the preparations was determined using analysis by thin layer chromatography (TLC-SG plates). The best studied condition presented radiochemical purity above 95% and the integrity of antibody was preserved. (author)

  3. Targeting angiogenesis for radioimmunotherapy with a {sup 177}Lu-labeled antibody

    Energy Technology Data Exchange (ETDEWEB)

    Ehlerding, Emily B.; Hernandez, Reinier [University of Wisconsin - Madison, Department of Medical Physics, Madison, WI (United States); Lacognata, Saige; Jiang, Dawei [University of Wisconsin - Madison, Department of Radiology, Madison, WI (United States); Ferreira, Carolina A. [University of Wisconsin - Madison, Department of Biomedical Engineering, Madison, WI (United States); Goel, Shreya [University of Wisconsin - Madison, Department of Materials Science and Engineering, Madison, WI (United States); Jeffery, Justin J. [University of Wisconsin - Madison, Small Animal Imaging Facility, Madison, WI (United States); Theuer, Charles P. [TRACON Pharmaceuticals, Inc., San Diego, CA (United States); Cai, Weibo [University of Wisconsin - Madison, Department of Medical Physics, Madison, WI (United States); University of Wisconsin - Madison, Department of Radiology, Madison, WI (United States); University of Wisconsin - Madison, Department of Biomedical Engineering, Madison, WI (United States); University of Wisconsin - Madison, Department of Materials Science and Engineering, Madison, WI (United States)

    2018-01-15

    Increased angiogenesis is a marker of aggressiveness in many cancers. Targeted radionuclide therapy of these cancers with angiogenesis-targeting agents may curtail this increased blood vessel formation and slow the growth of tumors, both primary and metastatic. CD105, or endoglin, has a primary role in angiogenesis in a number of cancers, making this a widely applicable target for targeted radioimmunotherapy. The anti-CD105 antibody, TRC105 (TRACON Pharmaceuticals), was conjugated with DTPA for radiolabeling with {sup 177}Lu (t{sub 1/2} 6.65 days). Balb/c mice were implanted with 4T1 mammary carcinoma cells, and five study groups were used: {sup 177}Lu only, TRC105 only, {sup 177}Lu-DTPA-IgG (a nonspecific antibody), {sup 177}Lu-DTPA-TRC105 low-dose, and {sup 177}Lu-DTPA-TRC105 high-dose. Toxicity of the agent was monitored by body weight measurements and analysis of blood markers. Biodistribution studies of {sup 177}Lu-DTPA-TRC105 were also performed at 1 and 7 days after injection. Ex vivo histology studies of various tissues were conducted at 1, 7, and 30 days after injection of high-dose {sup 177}Lu-DTPA-TRC105. Biodistribution studies indicated steady uptake of {sup 177}Lu-DTPA-TRC105 in 4T1 tumors between 1 and 7 days after injection (14.3 ± 2.3%ID/g and 11.6 ± 6.1%ID/g, respectively; n = 3) and gradual clearance from other organs. Significant inhibition of tumor growth was observed in the high-dose group, with a corresponding significant increase in survival (p < 0.001, all groups). In most study groups (all except the nonspecific IgG group), the body weights of the mice did not decrease by more than 10%, indicating the safety of the injected agents. Serum alanine transaminase levels remained nearly constant indicating no damage to the liver (a primary clearance organ of the agent), and this was confirmed by ex vivo histological analyses. {sup 177}Lu-DTPA-TRC105, when administered at a sufficient dose, is able to curtail tumor growth and provide a

  4. Emergence and present status of Lu-177 in targeted radiotherapy. The Indian scenario

    Energy Technology Data Exchange (ETDEWEB)

    Banerjee, S.; Das, T.; Chakraborty, S.; Venkatesh, M. [Bhabha Atomic Reseach Centre, Trombay, Mumbai (India). Radiopharmaceuticals Div.

    2012-07-01

    {sup 177}Lu is presently considered to be a potential radionuclide for the development of agents for radionuclide therapy owing to its favorable nuclear decay characteristics [T{sub 1/2} = 6.65 d, E{sub {beta}}{sub (max)} = 0.497 MeV, E{sub {gamma}} = 113 KeV (6.4%) and 208 KeV (11%)]. While the long half-life of this promising radioisotope offers distinct logistic advantage, particularly, in countries having limited reactor facilities, the feasibility of its large-scale production with adequate specific activity and excellent radionuclidic purity in medium flux research reactors constitute yet another desirable feature. Extensive studies have been carried out to optimize the production of this isotope, with high specific activity and radionuclidic purity by the (n,{gamma}) route using the highest available flux and the optimum irradiation time. The gradual evolution of clin ical grade {sup 177}LuCl{sub 3} as a new radiochemical, ready for commercial deployment by Radiopharmaceuticals Division, Bhabha Atomic Research Centre, to nuclear medicine centers all over India was accomplished in 2010 in a stepwise manner with the commencement of the production of high specific activity {sup 177}Lu from enriched target in 2001. Research on {sup 177}Lu has demonstrated its immense potential in radiotherapeutic applications, a direct outcome of which has resulted in indigenous development of two agents viz. {sup 177}Lu-EDTMP and {sup 177}Lu-DOTA-TATE presently being evaluated in human patients for palliative care of bone pain due to skeletal metastases and treatment of malignancies of neuroendocrine origin, respectively. Using locally produced {sup 177}Lu, the radiolabeling of a plethora of other molecules with potential applicability in radiation synovectomy and targeted therapy of malignant tumors have been successfully demonstrated. A few of these agent such as a novel {sup 177}Lu-labeled porphyrin has shown considerable promise in initial studies and is presently evaluated

  5. Absence of justice : Lu Chengming's struggle for compensation

    Energy Technology Data Exchange (ETDEWEB)

    Bai, L.

    2008-03-10

    This article described the efforts of Chinese citizen Lu Chengming to claim compensation from the Chinese government after being forcibly re-located during the building of the Three Gorges hydroelectric project. Research conducted by the author revealed that many households were not compensated for being resettled, and that many people who had lived in the region became refugees. Lu Chengming's family became unemployed after his hotel was demolished in 2002. The family of 11 was then divided into 4 in order to further reduce the amount of subsidies owed to them. Appeals to higher authorities began in 1993. Since then, Lu Chengming has only received the most basic welfare assistance. This article provided a translation of Lu Chengming's testimony as well as his account of the resettlement procedures. It was concluded that while the Chinese government consistently refuses his claims, Lu Chengming continues to live in hope that the government will award him his settlement. 4 refs., 3 figs.

  6. 2-micron lasing in Tm:Lu2O3 ceramic: initial operation

    Science.gov (United States)

    Vetrovec, John; Filgas, David M.; Smith, Carey A.; Copeland, Drew A.; Litt, Amardeep S.; Briscoe, Eldridge; Schirmer, Ernestina

    2018-03-01

    We report on initial lasing of Tm:Lu2O3 ceramic laser with tunable output in the vicinity of 2 μm. Tm:Lu2O3 ceramic gain materials offer a much lower saturation fluence than the traditionally used Tm:YLF and Tm:YAG materials. The gain element is pumped by 796 nm diodes via a "2-for-1" crossrelaxation energy transfer mechanism, which enables high efficiency. The high thermal conductivity of the Lu2O3 host ( 18% higher than YAG) in combination with low quantum defect of 20% supports operation at high-average power. Konoshima's ceramic fabrication process overcomes the scalability limits of single crystal sesquioxides. Tm:Lu2O3 offers wide-bandwidth amplification of ultrashort pulses in a chirped-pulse amplification (CPA) system. A laser oscillator was continuously tuned over a 230 nm range from 1890 to 2120 nm while delivering up to 43W QCW output with up to 37% efficiency. This device is intended for initial testing and later seeding of a multi-pass edge-pumped disk amplifier now being developed by Aqwest which uses composite Tm:Lu2O3 disk gain elements.

  7. Progress in the development of LuAlO3 based scintillators

    CERN Document Server

    Belsky, A; Lecoq, P; Dujardin, C; Garnier, N; Canibano, H; Pédrini, C; Petrosian, A

    2000-01-01

    LuAlO3:Ce3+ (LuAP) and LuxY1-xAlO3:Ce3+ (LuYAP) crystals are the promote scintillation materials for Positron Emission Tomography. Actual study of these scintillators develops in the tree directions: (i) growth of large size LuAP crystals with stable properties, (ii) relationship between composition of LuYAP crystals and scintillation properties, and (iii) scintillation mechanisms in lutetium compounds. After improving of growth conditions a large size samples (length greater than 40 mm) have been prepared. Crystals show a good correlation between growth parameters, light yield and transmission spectra. We performed a series of samples with calibrated size (2x2x10 mm3) and compare the light yield with a standard BGO and LSO samples. Mixed crystals with composition of 0.6 less than x less than 0.8 show a significant increase of light yield. We suggest that the short order clusterisation in mixed crystals may by playing an important role in governing the scintillation efficiency. In order to clarify the scintil...

  8. Crystal growth and luminescence properties of Pr-doped LuLiF4 single crystal

    International Nuclear Information System (INIS)

    Sugiyama, Makoto; Yanagida, Takayuki; Yokota, Yuui; Kurosawa, Shunsuke; Fujimoto, Yutaka; Yoshikawa, Akira

    2013-01-01

    0.1, 1, and 3% Pr (with respect to Lu) doped LuLiF 4 (Pr:LuLiF 4 ) single crystals were grown by the micro-pulling-down (μ-PD) method. Transparency of the grown crystals was higher than 70% in the visible wavelength region with some absorption bands due to Pr 3+ 4f-4f transitions. Intense absorption bands related with the Pr 3+ 4f-5d transitions were observed at 190 and 215 nm. In radioluminescence spectra, Pr 3+ 5d-4f emissions were observed at 220, 240, 340, and 405 nm. In the pulse height spectra recorded under 137 Cs γ-ray excitation, the Pr 3% doped sample showed the highest light yield of 2050 photons/MeV and the scintillation decay time of it exhibited 23 and 72 ns also excited by 137 Cs γ-ray. -- Highlights: ► 0.1, 1, and 3% Pr-doped LuLiF 4 single crystals were grown by the μ-PD method. ► Pr 3+ 5d-4f emission peaks appeared at 220, 240, 340, and 405 nm ► The Pr 3%:LuLiF 4 crystal showed the highest light yield of 2050 photons/MeV

  9. Study on preparation of 17'7Lu, labeling with DOTATATE for using in diagnosis and treatment neuroendocrine tumors

    International Nuclear Information System (INIS)

    Duong Van Dong; Bui Van Cuong; Pham Ngoc Dien; Chu Van Khoa; Mai Phuoc Tho; Nguyen Thi Thu; Vo Thi Cam Hoa

    2014-01-01

    Due to its physical and chemical characteristics, 177 Lu is a very attractive radionuclide for use in nuclear medicine. Its main usage is in the treatment of neuroendocrine tumours but its applicability in the treatment of colon cancer, metastatic bone cancer, non-Hodgkin lymphoma, lung, ovarian, and prostate cancer, has also been studied. Two alternative production routes are generally applied to obtain 177 Lu, namely the direct route based on neutron irradiation of lutetium targets and the indirect route based on neutron irradiation of ytterbium targets followed by radiochemical separation of 177 Lu from ytterbium isotopes. The comparison of theoretically calculated and experimentally determined yield for 176 Lu(n,γ) 177 Lu reaction is presented. 177 Lu could be produced with a specific activity of 42 mCi/mg by neutron activation using enriched 176 Lu (2.59%) target when irradiation was carried out at Dalat Nuclear Research Reactor with thermal neutron flux of 2x10 13 n.cm -2 .s -1 for 100 hours. The indirect production route as an alternative production route, 177 Lu could be obtained as carrier-free from beta decay of 177 Yb produced by neutron activation of 176 Yb. In this way, enriched target material was used but it may be the neutron capture cross section is only 2.4 barn so resulting in low activity just enough to study the separation process of 177 Lu from 177 Yb. In the other hand the study on labeling 177 Lu with DOTATATE is also described the optimization of the reaction conditions to obtain the complex 177 Lu-DOTATATE with a radiochemical purity > 99%, even so the studies of stability in vitro to the dilution in saline solution during 72 hours. The bio-distribution studies of this product in mice and rabbit are also investigated. (author)

  10. Efficient coordinated recovery of sparse channels in massive MIMO

    KAUST Repository

    Masood, Mudassir

    2015-01-01

    This paper addresses the problem of estimating sparse channels in massive MIMO-OFDM systems. Most wireless channels are sparse in nature with large delay spread. In addition, these channels as observed by multiple antennas in a neighborhood have approximately common support. The sparsity and common support properties are attractive when it comes to the efficient estimation of large number of channels in massive MIMO systems. Moreover, to avoid pilot contamination and to achieve better spectral efficiency, it is important to use a small number of pilots. We present a novel channel estimation approach which utilizes the sparsity and common support properties to estimate sparse channels and requires a small number of pilots. Two algorithms based on this approach have been developed that perform Bayesian estimates of sparse channels even when the prior is non-Gaussian or unknown. Neighboring antennas share among each other their beliefs about the locations of active channel taps to perform estimation. The coordinated approach improves channel estimates and also reduces the required number of pilots. Further improvement is achieved by the data-aided version of the algorithm. Extensive simulation results are provided to demonstrate the performance of the proposed algorithms.

  11. Sparse Generalized Fourier Series via Collocation-based Optimization

    Science.gov (United States)

    2014-11-01

    Theory 51, 12 (2005) 4203– 4215. [6] P. CONSTANTINE , M. ELDRED AND E. PHIPPS, Sparse pseu- dospectral approximation method. Comput. Methods Appl. Mech...Visition XVI: Algorithms, Techniques, Active Vision , and Materials Handling, 224 (1997). [15] J. SHEN AND L. WANG, Some recent advances on spectral methods

  12. A Sparse Bayesian Learning Algorithm With Dictionary Parameter Estimation

    DEFF Research Database (Denmark)

    Hansen, Thomas Lundgaard; Badiu, Mihai Alin; Fleury, Bernard Henri

    2014-01-01

    This paper concerns sparse decomposition of a noisy signal into atoms which are specified by unknown continuous-valued parameters. An example could be estimation of the model order, frequencies and amplitudes of a superposition of complex sinusoids. The common approach is to reduce the continuous...

  13. Robust visual tracking via structured multi-task sparse learning

    KAUST Repository

    Zhang, Tianzhu; Ghanem, Bernard; Liu, Si; Ahuja, Narendra

    2012-01-01

    In this paper, we formulate object tracking in a particle filter framework as a structured multi-task sparse learning problem, which we denote as Structured Multi-Task Tracking (S-MTT). Since we model particles as linear combinations of dictionary

  14. Behavior of greedy sparse representation algorithms on nested supports

    DEFF Research Database (Denmark)

    Mailhé, Boris; Sturm, Bob L.; Plumbley, Mark

    2013-01-01

    is not locally nested: there is a dictionary and supports Γ ⊃ Γ′ such that OMP can recover all signals with support Γ, but not all signals with support Γ′. We also show that the support recovery optimality of OMP is globally nested: if OMP can recover all s-sparse signals, then it can recover all s...

  15. Sparse linear models: Variational approximate inference and Bayesian experimental design

    International Nuclear Information System (INIS)

    Seeger, Matthias W

    2009-01-01

    A wide range of problems such as signal reconstruction, denoising, source separation, feature selection, and graphical model search are addressed today by posterior maximization for linear models with sparsity-favouring prior distributions. The Bayesian posterior contains useful information far beyond its mode, which can be used to drive methods for sampling optimization (active learning), feature relevance ranking, or hyperparameter estimation, if only this representation of uncertainty can be approximated in a tractable manner. In this paper, we review recent results for variational sparse inference, and show that they share underlying computational primitives. We discuss how sampling optimization can be implemented as sequential Bayesian experimental design. While there has been tremendous recent activity to develop sparse estimation, little attendance has been given to sparse approximate inference. In this paper, we argue that many problems in practice, such as compressive sensing for real-world image reconstruction, are served much better by proper uncertainty approximations than by ever more aggressive sparse estimation algorithms. Moreover, since some variational inference methods have been given strong convex optimization characterizations recently, theoretical analysis may become possible, promising new insights into nonlinear experimental design.

  16. Inference algorithms and learning theory for Bayesian sparse factor analysis

    International Nuclear Information System (INIS)

    Rattray, Magnus; Sharp, Kevin; Stegle, Oliver; Winn, John

    2009-01-01

    Bayesian sparse factor analysis has many applications; for example, it has been applied to the problem of inferring a sparse regulatory network from gene expression data. We describe a number of inference algorithms for Bayesian sparse factor analysis using a slab and spike mixture prior. These include well-established Markov chain Monte Carlo (MCMC) and variational Bayes (VB) algorithms as well as a novel hybrid of VB and Expectation Propagation (EP). For the case of a single latent factor we derive a theory for learning performance using the replica method. We compare the MCMC and VB/EP algorithm results with simulated data to the theoretical prediction. The results for MCMC agree closely with the theory as expected. Results for VB/EP are slightly sub-optimal but show that the new algorithm is effective for sparse inference. In large-scale problems MCMC is infeasible due to computational limitations and the VB/EP algorithm then provides a very useful computationally efficient alternative.

  17. Sparse linear models: Variational approximate inference and Bayesian experimental design

    Energy Technology Data Exchange (ETDEWEB)

    Seeger, Matthias W [Saarland University and Max Planck Institute for Informatics, Campus E1.4, 66123 Saarbruecken (Germany)

    2009-12-01

    A wide range of problems such as signal reconstruction, denoising, source separation, feature selection, and graphical model search are addressed today by posterior maximization for linear models with sparsity-favouring prior distributions. The Bayesian posterior contains useful information far beyond its mode, which can be used to drive methods for sampling optimization (active learning), feature relevance ranking, or hyperparameter estimation, if only this representation of uncertainty can be approximated in a tractable manner. In this paper, we review recent results for variational sparse inference, and show that they share underlying computational primitives. We discuss how sampling optimization can be implemented as sequential Bayesian experimental design. While there has been tremendous recent activity to develop sparse estimation, little attendance has been given to sparse approximate inference. In this paper, we argue that many problems in practice, such as compressive sensing for real-world image reconstruction, are served much better by proper uncertainty approximations than by ever more aggressive sparse estimation algorithms. Moreover, since some variational inference methods have been given strong convex optimization characterizations recently, theoretical analysis may become possible, promising new insights into nonlinear experimental design.

  18. Inference algorithms and learning theory for Bayesian sparse factor analysis

    Energy Technology Data Exchange (ETDEWEB)

    Rattray, Magnus; Sharp, Kevin [School of Computer Science, University of Manchester, Manchester M13 9PL (United Kingdom); Stegle, Oliver [Max-Planck-Institute for Biological Cybernetics, Tuebingen (Germany); Winn, John, E-mail: magnus.rattray@manchester.ac.u [Microsoft Research Cambridge, Roger Needham Building, Cambridge, CB3 0FB (United Kingdom)

    2009-12-01

    Bayesian sparse factor analysis has many applications; for example, it has been applied to the problem of inferring a sparse regulatory network from gene expression data. We describe a number of inference algorithms for Bayesian sparse factor analysis using a slab and spike mixture prior. These include well-established Markov chain Monte Carlo (MCMC) and variational Bayes (VB) algorithms as well as a novel hybrid of VB and Expectation Propagation (EP). For the case of a single latent factor we derive a theory for learning performance using the replica method. We compare the MCMC and VB/EP algorithm results with simulated data to the theoretical prediction. The results for MCMC agree closely with the theory as expected. Results for VB/EP are slightly sub-optimal but show that the new algorithm is effective for sparse inference. In large-scale problems MCMC is infeasible due to computational limitations and the VB/EP algorithm then provides a very useful computationally efficient alternative.

  19. Efficient coordinated recovery of sparse channels in massive MIMO

    KAUST Repository

    Masood, Mudassir; Afify, Laila H.; Al-Naffouri, Tareq Y.

    2015-01-01

    on this approach have been developed that perform Bayesian estimates of sparse channels even when the prior is non-Gaussian or unknown. Neighboring antennas share among each other their beliefs about the locations of active channel taps to perform estimation

  20. Low-rank sparse learning for robust visual tracking

    KAUST Repository

    Zhang, Tianzhu

    2012-01-01

    In this paper, we propose a new particle-filter based tracking algorithm that exploits the relationship between particles (candidate targets). By representing particles as sparse linear combinations of dictionary templates, this algorithm capitalizes on the inherent low-rank structure of particle representations that are learned jointly. As such, it casts the tracking problem as a low-rank matrix learning problem. This low-rank sparse tracker (LRST) has a number of attractive properties. (1) Since LRST adaptively updates dictionary templates, it can handle significant changes in appearance due to variations in illumination, pose, scale, etc. (2) The linear representation in LRST explicitly incorporates background templates in the dictionary and a sparse error term, which enables LRST to address the tracking drift problem and to be robust against occlusion respectively. (3) LRST is computationally attractive, since the low-rank learning problem can be efficiently solved as a sequence of closed form update operations, which yield a time complexity that is linear in the number of particles and the template size. We evaluate the performance of LRST by applying it to a set of challenging video sequences and comparing it to 6 popular tracking methods. Our experiments show that by representing particles jointly, LRST not only outperforms the state-of-the-art in tracking accuracy but also significantly improves the time complexity of methods that use a similar sparse linear representation model for particles [1]. © 2012 Springer-Verlag.

  1. Structure-aware Local Sparse Coding for Visual Tracking

    KAUST Repository

    Qi, Yuankai; Qin, Lei; Zhang, Jian; Zhang, Shengping; Huang, Qingming; Yang, Ming-Hsuan

    2018-01-01

    with the corresponding local regions of the target templates that are the most similar from the global view. Thus, a more precise and discriminative sparse representation is obtained to account for appearance changes. To alleviate the issues with tracking drifts, we

  2. A Practical View on Tunable Sparse Network Coding

    DEFF Research Database (Denmark)

    Sørensen, Chres Wiant; Shahbaz Badr, Arash; Cabrera Guerrero, Juan Alberto

    2015-01-01

    Tunable sparse network coding (TSNC) constitutes a promising concept for trading off computational complexity and delay performance. This paper advocates for the use of judicious feedback as a key not only to make TSNC practical, but also to deliver a highly consistent and controlled delay perfor...

  3. Parallel and Scalable Sparse Basic Linear Algebra Subprograms

    DEFF Research Database (Denmark)

    Liu, Weifeng

    and heterogeneous processors. The thesis compares the proposed methods with state-of-the-art approaches on six homogeneous and five heterogeneous processors from Intel, AMD and nVidia. Using in total 38 sparse matrices as a benchmark suite, the experimental results show that the proposed methods obtain significant...

  4. SparseBeads data: benchmarking sparsity-regularized computed tomography

    DEFF Research Database (Denmark)

    Jørgensen, Jakob Sauer; Coban, Sophia B.; Lionheart, William R. B.

    2017-01-01

    -regularized reconstruction. A collection of 48 x-ray CT datasets called SparseBeads was designed for benchmarking SR reconstruction algorithms. Beadpacks comprising glass beads of five different sizes as well as mixtures were scanned in a micro-CT scanner to provide structured datasets with variable image sparsity levels...

  5. Hierarchical Bayesian sparse image reconstruction with application to MRFM.

    Science.gov (United States)

    Dobigeon, Nicolas; Hero, Alfred O; Tourneret, Jean-Yves

    2009-09-01

    This paper presents a hierarchical Bayesian model to reconstruct sparse images when the observations are obtained from linear transformations and corrupted by an additive white Gaussian noise. Our hierarchical Bayes model is well suited to such naturally sparse image applications as it seamlessly accounts for properties such as sparsity and positivity of the image via appropriate Bayes priors. We propose a prior that is based on a weighted mixture of a positive exponential distribution and a mass at zero. The prior has hyperparameters that are tuned automatically by marginalization over the hierarchical Bayesian model. To overcome the complexity of the posterior distribution, a Gibbs sampling strategy is proposed. The Gibbs samples can be used to estimate the image to be recovered, e.g., by maximizing the estimated posterior distribution. In our fully Bayesian approach, the posteriors of all the parameters are available. Thus, our algorithm provides more information than other previously proposed sparse reconstruction methods that only give a point estimate. The performance of the proposed hierarchical Bayesian sparse reconstruction method is illustrated on synthetic data and real data collected from a tobacco virus sample using a prototype MRFM instrument.

  6. Multiple instance learning tracking method with local sparse representation

    KAUST Repository

    Xie, Chengjun

    2013-10-01

    When objects undergo large pose change, illumination variation or partial occlusion, most existed visual tracking algorithms tend to drift away from targets and even fail in tracking them. To address this issue, in this study, the authors propose an online algorithm by combining multiple instance learning (MIL) and local sparse representation for tracking an object in a video system. The key idea in our method is to model the appearance of an object by local sparse codes that can be formed as training data for the MIL framework. First, local image patches of a target object are represented as sparse codes with an overcomplete dictionary, where the adaptive representation can be helpful in overcoming partial occlusion in object tracking. Then MIL learns the sparse codes by a classifier to discriminate the target from the background. Finally, results from the trained classifier are input into a particle filter framework to sequentially estimate the target state over time in visual tracking. In addition, to decrease the visual drift because of the accumulative errors when updating the dictionary and classifier, a two-step object tracking method combining a static MIL classifier with a dynamical MIL classifier is proposed. Experiments on some publicly available benchmarks of video sequences show that our proposed tracker is more robust and effective than others. © The Institution of Engineering and Technology 2013.

  7. Fast sparse matrix-vector multiplication by partitioning and reordering

    NARCIS (Netherlands)

    Yzelman, A.N.

    2011-01-01

    The thesis introduces a cache-oblivious method for the sparse matrix-vector (SpMV) multiplication, which is an important computational kernel in many applications. The method works by permuting rows and columns of the input matrix so that the resulting reordered matrix induces cache-friendly

  8. Sobol indices for dimension adaptivity in sparse grids

    NARCIS (Netherlands)

    Dwight, R.P.; Desmedt, S.G.L.; Shoeibi Omrani, P.

    2016-01-01

    Propagation of random variables through computer codes of many inputs is primarily limited by computational expense. The use of sparse grids mitigates these costs somewhat; here we show how Sobol indices can be used to perform dimension adaptivity to mitigate them further. The method is compared to

  9. Discriminative object tracking via sparse representation and online dictionary learning.

    Science.gov (United States)

    Xie, Yuan; Zhang, Wensheng; Li, Cuihua; Lin, Shuyang; Qu, Yanyun; Zhang, Yinghua

    2014-04-01

    We propose a robust tracking algorithm based on local sparse coding with discriminative dictionary learning and new keypoint matching schema. This algorithm consists of two parts: the local sparse coding with online updated discriminative dictionary for tracking (SOD part), and the keypoint matching refinement for enhancing the tracking performance (KP part). In the SOD part, the local image patches of the target object and background are represented by their sparse codes using an over-complete discriminative dictionary. Such discriminative dictionary, which encodes the information of both the foreground and the background, may provide more discriminative power. Furthermore, in order to adapt the dictionary to the variation of the foreground and background during the tracking, an online learning method is employed to update the dictionary. The KP part utilizes refined keypoint matching schema to improve the performance of the SOD. With the help of sparse representation and online updated discriminative dictionary, the KP part are more robust than the traditional method to reject the incorrect matches and eliminate the outliers. The proposed method is embedded into a Bayesian inference framework for visual tracking. Experimental results on several challenging video sequences demonstrate the effectiveness and robustness of our approach.

  10. Fast Estimation of Optimal Sparseness of Music Signals

    DEFF Research Database (Denmark)

    la Cour-Harbo, Anders

    2006-01-01

    We want to use a variety of sparseness measured applied to ‘the minimal L1 norm representation' of a music signal in an overcomplete dictionary as features for automatic classification of music. Unfortunately, the process of computing the optimal L1 norm representation is rather slow, and we...

  11. Sparse principal component analysis in medical shape modeling

    Science.gov (United States)

    Sjöstrand, Karl; Stegmann, Mikkel B.; Larsen, Rasmus

    2006-03-01

    Principal component analysis (PCA) is a widely used tool in medical image analysis for data reduction, model building, and data understanding and exploration. While PCA is a holistic approach where each new variable is a linear combination of all original variables, sparse PCA (SPCA) aims at producing easily interpreted models through sparse loadings, i.e. each new variable is a linear combination of a subset of the original variables. One of the aims of using SPCA is the possible separation of the results into isolated and easily identifiable effects. This article introduces SPCA for shape analysis in medicine. Results for three different data sets are given in relation to standard PCA and sparse PCA by simple thresholding of small loadings. Focus is on a recent algorithm for computing sparse principal components, but a review of other approaches is supplied as well. The SPCA algorithm has been implemented using Matlab and is available for download. The general behavior of the algorithm is investigated, and strengths and weaknesses are discussed. The original report on the SPCA algorithm argues that the ordering of modes is not an issue. We disagree on this point and propose several approaches to establish sensible orderings. A method that orders modes by decreasing variance and maximizes the sum of variances for all modes is presented and investigated in detail.

  12. Robust Visual Tracking Via Consistent Low-Rank Sparse Learning

    KAUST Repository

    Zhang, Tianzhu; Liu, Si; Ahuja, Narendra; Yang, Ming-Hsuan; Ghanem, Bernard

    2014-01-01

    and the low-rank minimization problem for learning joint sparse representations can be efficiently solved by a sequence of closed form update operations. We evaluate the proposed CLRST algorithm against 14 state-of-the-art tracking methods on a set of 25

  13. Non-Cartesian MRI scan time reduction through sparse sampling

    NARCIS (Netherlands)

    Wajer, F.T.A.W.

    2001-01-01

    Non-Cartesian MRI Scan-Time Reduction through Sparse Sampling Magnetic resonance imaging (MRI) signals are measured in the Fourier domain, also called k-space. Samples of the MRI signal can not be taken at will, but lie along k-space trajectories determined by the magnetic field gradients. MRI

  14. Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit

    DEFF Research Database (Denmark)

    Nagahara, Masaaki; Quevedo, Daniel; Østergaard, Jan

    2012-01-01

    We study packetized predictive control, known to be robust against packet dropouts in networked systems. To obtain sparse packets for rate-limited networks, we design control packets via an ℓ0 optimization, which can be eectively solved by orthogonal matching pursuit. Our formulation ensures...

  15. Proportionate Minimum Error Entropy Algorithm for Sparse System Identification

    Directory of Open Access Journals (Sweden)

    Zongze Wu

    2015-08-01

    Full Text Available Sparse system identification has received a great deal of attention due to its broad applicability. The proportionate normalized least mean square (PNLMS algorithm, as a popular tool, achieves excellent performance for sparse system identification. In previous studies, most of the cost functions used in proportionate-type sparse adaptive algorithms are based on the mean square error (MSE criterion, which is optimal only when the measurement noise is Gaussian. However, this condition does not hold in most real-world environments. In this work, we use the minimum error entropy (MEE criterion, an alternative to the conventional MSE criterion, to develop the proportionate minimum error entropy (PMEE algorithm for sparse system identification, which may achieve much better performance than the MSE based methods especially in heavy-tailed non-Gaussian situations. Moreover, we analyze the convergence of the proposed algorithm and derive a sufficient condition that ensures the mean square convergence. Simulation results confirm the excellent performance of the new algorithm.

  16. Robust Visual Tracking Via Consistent Low-Rank Sparse Learning

    KAUST Repository

    Zhang, Tianzhu

    2014-06-19

    Object tracking is the process of determining the states of a target in consecutive video frames based on properties of motion and appearance consistency. In this paper, we propose a consistent low-rank sparse tracker (CLRST) that builds upon the particle filter framework for tracking. By exploiting temporal consistency, the proposed CLRST algorithm adaptively prunes and selects candidate particles. By using linear sparse combinations of dictionary templates, the proposed method learns the sparse representations of image regions corresponding to candidate particles jointly by exploiting the underlying low-rank constraints. In addition, the proposed CLRST algorithm is computationally attractive since temporal consistency property helps prune particles and the low-rank minimization problem for learning joint sparse representations can be efficiently solved by a sequence of closed form update operations. We evaluate the proposed CLRST algorithm against 14 state-of-the-art tracking methods on a set of 25 challenging image sequences. Experimental results show that the CLRST algorithm performs favorably against state-of-the-art tracking methods in terms of accuracy and execution time.

  17. Sparse PDF Volumes for Consistent Multi-Resolution Volume Rendering

    KAUST Repository

    Sicat, Ronell Barrera

    2014-12-31

    This paper presents a new multi-resolution volume representation called sparse pdf volumes, which enables consistent multi-resolution volume rendering based on probability density functions (pdfs) of voxel neighborhoods. These pdfs are defined in the 4D domain jointly comprising the 3D volume and its 1D intensity range. Crucially, the computation of sparse pdf volumes exploits data coherence in 4D, resulting in a sparse representation with surprisingly low storage requirements. At run time, we dynamically apply transfer functions to the pdfs using simple and fast convolutions. Whereas standard low-pass filtering and down-sampling incur visible differences between resolution levels, the use of pdfs facilitates consistent results independent of the resolution level used. We describe the efficient out-of-core computation of large-scale sparse pdf volumes, using a novel iterative simplification procedure of a mixture of 4D Gaussians. Finally, our data structure is optimized to facilitate interactive multi-resolution volume rendering on GPUs.

  18. EEG Source Reconstruction using Sparse Basis Function Representations

    DEFF Research Database (Denmark)

    Hansen, Sofie Therese; Hansen, Lars Kai

    2014-01-01

    -validation this approach is more automated than competing approaches such as Multiple Sparse Priors (Friston et al., 2008) or Champagne (Wipf et al., 2010) that require manual selection of noise level and auxiliary signal free data, respectively. Finally, we propose an unbiased estimator of the reproducibility...

  19. Aliasing-free wideband beamforming using sparse signal representation

    NARCIS (Netherlands)

    Tang, Z.; Blacquière, G.; Leus, G.

    2011-01-01

    Sparse signal representation (SSR) is considered to be an appealing alternative to classical beamforming for direction-of-arrival (DOA) estimation. For wideband signals, the SSR-based approach constructs steering matrices, referred to as dictionaries in this paper, corresponding to different

  20. Analysis of the spectrum of four-times-ionized lutetium (Lu V)

    International Nuclear Information System (INIS)

    Kaufman, V.; Sugar, J.

    1978-01-01

    Spectra of Lu obtained with a sliding spark discharge at peak currents of 50--500 A were recorded with a 10.7 m normal incidence spectrograph in the range of 500--2100 A. Intercomparison of spectra revealed a distinct separation of Lu III, IV, and V, the first two of which have already been anlayzed. The present work contains an interpretation of Lu V in which 419 lines are classified as transitions among 136 energy levels of the 4f 13 , 4f 12 5d, 4f 12 6s, and 4f 12 6p configurations. Calculated energy levels and eigenvectors, obtained with fitted values for the radial integrals, are given

  1. High speed corner and gap-seal computations using an LU-SGS scheme

    Science.gov (United States)

    Coirier, William J.

    1989-01-01

    The hybrid Lower-Upper Symmetric Gauss-Seidel (LU-SGS) algorithm was added to a widely used series of 2D/3D Euler/Navier-Stokes solvers and was demonstrated for a particular class of high-speed flows. A limited study was conducted to compare the hybrid LU-SGS for approximate Newton iteration and diagonalized Beam-Warming (DBW) schemes on a work and convergence history basis. The hybrid LU-SGS algorithm is more efficient and easier to implement than the DBW scheme originally present in the code for the cases considered. The code was validated for the hypersonic flow through two mutually perpendicular flat plates and then used to investigate the flow field in and around a simplified scramjet module gap seal configuration. Due to the similarities, the gap seal flow was compared to hypersonic corner flow at the same freestream conditions and Reynolds number.

  2. Toxicity of trastuzumab labeled {sup 177}Lu on MCF7 and SKBr3 cell lines

    Energy Technology Data Exchange (ETDEWEB)

    Rasaneh, Samira [Department of Medical Physics, Faculty of Medical Sciences, Tarbiat Modares University, P.O. Box 14115-331, Tehran (Iran, Islamic Republic of); Rajabi, Hossein, E-mail: hrajabi@modares.ac.i [Department of Medical Physics, Faculty of Medical Sciences, Tarbiat Modares University, P.O. Box 14115-331, Tehran (Iran, Islamic Republic of); Hossein Babaei, Mohammad; Johari Daha, Fariba [Department of Radioisotope, Nuclear Science and Technology Research Institute, Tehran (Iran, Islamic Republic of)

    2010-10-15

    In this study, we labeled trastuzumab with {sup 177}Lu to synthesize a new radiopharmaceutical for therapy of breast cancer and at the first stage investigated its therapeutic effects on SKBr3 and MCF7 breast cancer cell lines. Trastuzumab-{sup 177}Lu showed very good in-vitro characteristics such as high radiochemical purity (91{+-}0.9%), good stability in PBS buffer (86{+-}2.3%) and blood serum (81{+-}2.7%) up to 96 h, appropriate immunoreactivity (85.4{+-}1.1%) and high cytotoxicity in HER2 expression cells. 5 fold increase in toxicity of trastuzumab-{sup 177}Lu was observed when compared with unlabeled trastuzumab on SKBr3 cells.

  3. Scintillation properties of a La, Lu-admix gadolinium pyrosilicate crystal

    Energy Technology Data Exchange (ETDEWEB)

    Kurosawa, Shunsuke, E-mail: kurosawa@imr.tohoku.ac.jp [Institute for Materials Research (IMR), Tohoku University 2-1-1 Katahira, Aoba-ku, Sendai, Miyagi 980-8577 (Japan); New Industry Creation Hatchery Center (NICHe) 6-6-10 Aoba, Aramaki, Aoba-ku, Sendai, Miyagi 980-8579 (Japan); Shishido, Toetsu; Suzuki, Akira; Sugawara, Takamasa; Nomura, Akiko; Yubuta, Kunio [Institute for Materials Research (IMR), Tohoku University 2-1-1 Katahira, Aoba-ku, Sendai, Miyagi 980-8577 (Japan); Shoji, Yasuhiro [Institute for Materials Research (IMR), Tohoku University 2-1-1 Katahira, Aoba-ku, Sendai, Miyagi 980-8577 (Japan); C& A Corporation, 6-6-40 Aoba, Aramaki, Aoba-ku, Sendai, Miyagi 980-8577 (Japan); Yokota, Yuui [New Industry Creation Hatchery Center (NICHe) 6-6-10 Aoba, Aramaki, Aoba-ku, Sendai, Miyagi 980-8579 (Japan); Pejchal, Jan [New Industry Creation Hatchery Center (NICHe) 6-6-10 Aoba, Aramaki, Aoba-ku, Sendai, Miyagi 980-8579 (Japan); Institute of Physics, AS CR, Cukrovarnická 10, 162 53 Prague (Czech Republic); Ohashi, Yuji [Institute for Materials Research (IMR), Tohoku University 2-1-1 Katahira, Aoba-ku, Sendai, Miyagi 980-8577 (Japan); Kamada, Kei [New Industry Creation Hatchery Center (NICHe) 6-6-10 Aoba, Aramaki, Aoba-ku, Sendai, Miyagi 980-8579 (Japan); C& A Corporation, 6-6-40 Aoba, Aramaki, Aoba-ku, Sendai, Miyagi 980-8577 (Japan); Yoshikawa, Akira [Institute for Materials Research (IMR), Tohoku University 2-1-1 Katahira, Aoba-ku, Sendai, Miyagi 980-8577 (Japan); New Industry Creation Hatchery Center (NICHe) 6-6-10 Aoba, Aramaki, Aoba-ku, Sendai, Miyagi 980-8579 (Japan); C& A Corporation, 6-6-40 Aoba, Aramaki, Aoba-ku, Sendai, Miyagi 980-8577 (Japan)

    2015-06-01

    In order to obtain new scintillator with higher effective atomic number, a pyrosilicate crystal with a composition (Ce{sub 0.01}, Gd{sub 0.54}, La{sub 0.25}, Lu{sub 0.20}){sub 2}Si{sub 2}O{sub 7} (Ce:LaLu-GPS) was grown by the floating zone method. Emission wavelengths of this material were at 370 and 390 nm. Gamma-ray-excited pulse height and scintillation decay measurement showed that Ce:LaLu-GPS had a light output of 34,000±2000 photons/MeV, an FWHM energy resolution of 6.9±0.2%, and the decay time components of 59±1 ns (13%) and 570±20 ns (87%)

  4. Deformable segmentation via sparse representation and dictionary learning.

    Science.gov (United States)

    Zhang, Shaoting; Zhan, Yiqiang; Metaxas, Dimitris N

    2012-10-01

    "Shape" and "appearance", the two pillars of a deformable model, complement each other in object segmentation. In many medical imaging applications, while the low-level appearance information is weak or mis-leading, shape priors play a more important role to guide a correct segmentation, thanks to the strong shape characteristics of biological structures. Recently a novel shape prior modeling method has been proposed based on sparse learning theory. Instead of learning a generative shape model, shape priors are incorporated on-the-fly through the sparse shape composition (SSC). SSC is robust to non-Gaussian errors and still preserves individual shape characteristics even when such characteristics is not statistically significant. Although it seems straightforward to incorporate SSC into a deformable segmentation framework as shape priors, the large-scale sparse optimization of SSC has low runtime efficiency, which cannot satisfy clinical requirements. In this paper, we design two strategies to decrease the computational complexity of SSC, making a robust, accurate and efficient deformable segmentation system. (1) When the shape repository contains a large number of instances, which is often the case in 2D problems, K-SVD is used to learn a more compact but still informative shape dictionary. (2) If the derived shape instance has a large number of vertices, which often appears in 3D problems, an affinity propagation method is used to partition the surface into small sub-regions, on which the sparse shape composition is performed locally. Both strategies dramatically decrease the scale of the sparse optimization problem and hence speed up the algorithm. Our method is applied on a diverse set of biomedical image analysis problems. Compared to the original SSC, these two newly-proposed modules not only significant reduce the computational complexity, but also improve the overall accuracy. Copyright © 2012 Elsevier B.V. All rights reserved.

  5. Lu{sub 2}O{sub 3}:Tb,Hf storage phosphor

    Energy Technology Data Exchange (ETDEWEB)

    Kulesza, Dagmara; Trojan-Piegza, Joanna [Faculty of Chemistry, University of Wroclaw, 14 F. Joliot-Curie Street, 50-383 Wroclaw (Poland); Zych, Eugeniusz, E-mail: zych@wchuwr.p [Faculty of Chemistry, University of Wroclaw, 14 F. Joliot-Curie Street, 50-383 Wroclaw (Poland)

    2010-03-15

    Lu{sub 2}O{sub 3}:Tb,Hf ceramics containing 0.1% of Tb and 0-1.5% of Hf were prepared in reducing atmosphere at 1700 {sup o}C and their thermoluminescence properties were systematically studied. For comparison Tb,Ca co-doped specimen was also fabricated and investigated. The Tb,Hf ceramics shows basically a single TL band located around 180 {sup o}C as found with heating rate of 15 {sup o}C/min. Ceramics singly doped with Tb show complex TL glow curves indicating the presence of traps of very different depths. On the other hand Tb,Ca co-doping is beneficial for the development of shallow traps with the main TL band around 70 {sup o}C. Hence, the aliovalent impurities, Ca{sup 2+} and Hf{sup 4+}, strongly influenced the traps structure in Lu{sub 2}O{sub 3}:Tb ceramics, each of them in its own specific way. Isothermal decay of Lu{sub 2}O{sub 3}:Tb,Hf at 185 {sup o}C was recorded and its shape suggest that multiple hole trapping occurs in the Lu{sub 2}O{sub 3}:Tb,Hf ceramics. Due to the different traps depths the Lu{sub 2}O{sub 3}:Tb,Hf ceramics possess properties typical for storage phosphors, while Lu{sub 2}O{sub 3}:Tb,Ca is a persistent luminescent material rather.

  6. Effects of Lu and Tm Doping on Thermoelectric Properties of Bi2Te3 Compound

    Science.gov (United States)

    Yaprintsev, Maxim; Lyubushkin, Roman; Soklakova, Oxana; Ivanov, Oleg

    2018-02-01

    The Bi2Te3, Bi1.9Lu0.1Te3 and Bi1.9Tm0.1Te3 thermoelectrics of n-type conductivity have been prepared by the microwave-solvothermal method and spark plasma sintering. These compounds behave as degenerate semiconductors from room temperature up to temperature T d ≈ 470 K. Within this temperature range the temperature behavior of the specific electrical resistivity is due to the temperature changes of electron mobility determined by acoustic and optical phonon scattering. Above T d, an onset of intrinsic conductivity takes place when electrons and holes are present. At the Lu and Tm doping, the Seebeck coefficient increases, while the specific electrical resistivity and total thermal conductivity decrease within the temperature 290-630 K range. The increase of the electrical resistivity is related to the increase of electron concentration since the Tm and Lu atoms are donor centres in the Bi2Te3 lattice. The increase of the density-of-state effective mass for conduction band can be responsible for the increase of the Seebeck coefficient. The decrease of the total thermal conductivity in doped Bi2Te3 is attributed to point defects like the antisite defects and Lu or Tm atoms substituting for the Bi sites. In addition, reducing the electron thermal conductivity due to forming a narrow impurity (Lu or Tm) band having high and sharp density-of-states near the Fermi level can effectively decrease the total thermal conductivity. The thermoelectric figure-of-merit is enhanced from ˜ 0.4 for undoped Bi2Te3 up to ˜ 0.7 for Bi1.9Tm0.1Te3 and ˜ 0.9 for Bi1.9Lu0.1Te3.

  7. Water-stable NaLuF4-based upconversion nanophosphors with long-term validity for multimodal lymphatic imaging.

    Science.gov (United States)

    Zhou, Jing; Zhu, Xingjun; Chen, Min; Sun, Yun; Li, Fuyou

    2012-09-01

    Multimodal imaging is rapidly becoming an important tool for biomedical applications because it can compensate for the deficiencies of individual imaging modalities. Herein, multifunctional NaLuF(4)-based upconversion nanoparticles (Lu-UCNPs) were synthesized though a facile one-step microemulsion method under ambient condition. The doping of lanthanide ions (Gd(3+), Yb(3+) and Er(3+)/Tm(3+)) endows the Lu-UCNPs with high T(1)-enhancement, bright upconversion luminescence (UCL) emissions, and excellent X-ray absorption coefficient. Moreover, the as-prepared Lu-UCNPs are stable in water for more than six months, due to the protection of sodium glutamate and diethylene triamine pentacetate acid (DTPA) coordinating ligands on the surface. Lu-UCNPs have been successfully applied to the trimodal CT/MR/UCL lymphatic imaging on the modal of small animals. It is worth noting that Lu-UCNPs could be used for imaging even after preserving for over six months. In vitro transmission electron microscope (TEM), methyl thiazolyl tetrazolium (MTT) assay and histological analysis demonstrated that Lu-UCNPs exhibited low toxicity on living systems. Therefore, Lu-UCNPs could be multimodal agents for CT/MR/UCL imaging, and the concept can be served as a platform technology for the next-generation of probes for multimodal imaging. Copyright © 2012 Elsevier Ltd. All rights reserved.

  8. The regulation of prostitution in Beyoğlu (1875-1915).

    Science.gov (United States)

    özbek, Müge

    2010-01-01

    This study examines the development and nature of the regulation of prostitution in Beyoğlu during the late Ottoman Empire with special emphasis on the way the regulationist regime reinforced existing patterns of class and gender domination. The regulation of prostitution became a matter of urgency in the last decades of the nineteenth century in Istanbul, particularly in Beyoğlu, the cosmopolitan centre of the city. Through this process, the protests of the local residents of the area objecting to the proliferation of prostitution in their neighbourhoods played a crucial role in prompting the governmental authorities to tighten the regulations.

  9. Production of non carrier added (n.c.a.) {sup 177}Lu for radiopharmaceutical applications

    Energy Technology Data Exchange (ETDEWEB)

    Barkhausen, Christoph

    2011-09-06

    The goal of this dissertation was the development of a process to produce non carrier added {sup 177}Lu at the FRM II. For this purpose, preparative chromatographic methods were evaluated and applied. The highest quality of the nuclide which could only be achieved through a complex chemical process, has been already been proven by clinical studies to be very advantageous. The process has been built up in a hot cell as a semi-automated process and is now being adapted to the requirements of the 'Arzneimittelgesetz' in order to establish n.c.a. {sup 177}Lu as a pharmaceutical product.

  10. Isomeric ratio measurements for the radiative neutron capture 176Lu(n,γ at DANCE

    Directory of Open Access Journals (Sweden)

    Denis-Petit D.

    2017-01-01

    Full Text Available The isomeric ratios for the neutron capture reaction 176Lu(n,γ to the Jπ = 5/2−, 761.7 keV, T1/2 = 32.8 ns and the Jπ = 15/2+, 1356.9 keV, T1/2 = 11.1 ns levels of 177Lu, have been measured for the first time with the Detector for Advanced Neutron Capture Experiments (DANCE at the Los Alamos National Laboratory. These measured isomeric ratios are compared with TALYS calculations.

  11. L'U. Una història de família

    OpenAIRE

    Montserrat i Torrents, Josep

    1994-01-01

    El fals problema de l'U. Les nocions connexes d'ordre i d'unitat es troben presents ja en el pensament quodidià. Un moble tan familiar com un armari ofereix un feix de suggerències metafísiques sobre les coses, el lloc de les coses i els noms dels llocs de les coses. Agustí pensava probablement en l'armari de la seva mare quan proposà la seva bella definició d'ordre: ordo est parium disparium que rerum suo cuique loco tribuens dispositio. Filosòficament, l'U comparegué amb agressivitat ...

  12. Development of the therapeutic radiopharmaceutical 117Lu-DOTA-Minigastrin for potential use in PRRT

    International Nuclear Information System (INIS)

    Lopez Bularte, Ana C.; Nevares, Noemi; Zapata, Miguel; Perez, Juan; Crudo, Jose L.

    2009-01-01

    Objective: The main objectives of this work were to obtain 177 Lu-DOTA-Minigastrin with high radiochemical purity (RP) and specific activity (SA) as high as possible, using locally produced medium SA 177 LuCl3 (range 6,36-9,73 Ci/mg of 176 Lu), and to carry out in vitro and in vivo stability tests. Materials and methods: For a typical labelling, 20 or 15 μg of DOTA-MG (pi Chem, Austria) dissolved in ammonium acetate buffer pH 6 were mixed with 1mCi of 177 LuCl3 (SA = 6,36, 7,52 y 9,73 Ci/mg). The solution was incubated for 30 min. at 80 C degrees (pH 5,5). The stability assays in saline (SS) were carried out by incubation of the radiopharmaceutical with SA of 0.05 mCi/ μg of peptide in 80 μ of SS for 24 and 48 h at room temperature. The stability assays in human serum (HS) were carried out by incubation of 2.5 μ of 177 Lu-DOTA-MG with SA of 0.05 mCi/ μg of peptide in 500 μl of HS for 15 min. and 2 h at 37 C degrees. The samples were centrifuged at 3000 xg for 5 min. The supernatant (SN) was taken and acetonitrile (ACN) was added in a ratio 2:3 (SP:ACN). The solution was centrifuged at 3000 xg for 5 min. and the resulting supernatant was concentrated by ultra-filtration (Vivaspin 500, Sartorius). The concentrated SN was analyzed by Reverse Phase High Performance Liquid Chromatography (RP-HPLC) in order to determine the radiochemical purity. The serum protein binding was calculated taking into account the relation between the pellets activity in respect to the total activity. Bio distributions of 177 Lu-DOTA-MG in normal mice were done at 15 and 30 min., 1 and 4 h p.i. The results were expressed as percentage of injected activity per gram of tissue (%IAgr). Results: 20 μg of peptide were labelled with different SA 177 LuCl3 (6,36, 7,52 and 9,73 Ci/mg of 176 Lu) resulting in high radiochemical purities 96,31 %, 98,95 % and 97.57 %, respectively (SA 0.05 mCi/μg of peptide). 15 ug of peptide were labelled with 177 LuCl3 (SA 7,52 Ci/mg of 176 Lu) obtaining a

  13. Optimization of LSO/LuYAP phoswich detector for small animal PET

    International Nuclear Information System (INIS)

    Jung, Jin Ho; Choi, Yong; Chung, Yong Hyun; Devroede, Olivier; Krieguer, Magalie; Bruyndonckx, Peter; Tavernier, Stefaan

    2007-01-01

    LSO/LuYAP phoswich detectors for small animal PET were developed to measure the depth of interaction (DOI), and to improve the spatial resolution at the edge of the field of view (FOV). The aim of this study was to optimize the optical coupling conditions between the crystal and photomultiplier tube (PMT) to maximize the light-collection efficiency, and to develop a method for rejecting scatter events by applying an equal energy window in each crystal layer. The light yields of the phoswich detector were estimated by changing the refractive index of the optical coupling material using a DETECT simulation. The accuracy of the DOI measurement on the phoswich detector, using an optical coupling material with the optimal light yield, were evaluated experimentally and compared with the air condition. The energy window for the photopeak events cannot be applied properly because the light outputs of LSO and LuYAP are different. The LSO/LuYAP photopeaks need to be superposed in order to effectively discriminate the scattered events by applying an equal energy window. The photopeaks of the LSO and LuYAP can be superposed by inserting a reflecting material between the crystals. The optimal coverage ratio of the inserting material was derived from a DETECT simulation, and its performance was investigated. In the simulation result, optimal refractive index of the optical coupling material was 1.7. The average DOI measurement errors of the LSO/LuYAP were 0.6%/3.4% and 4.9%/41.4% in the phoswich detector with and without an optical coupling material, respectively. The photopeaks of the LSO and LuYAP were superposed by covering 75% of the contact surface between the crystals with white Teflon. The DOI measurement errors of the LSO/LuYAP were 0.2%/2.4%. In this study, the optimal condition of the optical coupling material inserted between the crystal and PMT was derived to improve the accuracy of DOI measurement, and a photopeak superposition method of the LSO and LuYAP was

  14. Improving quantitative dosimetry in (177)Lu-DOTATATE SPECT by energy window-based scatter corrections

    DEFF Research Database (Denmark)

    de Nijs, Robin; Lagerburg, Vera; Klausen, Thomas L

    2014-01-01

    and the activity, which depends on the collimator type, the utilized energy windows and the applied scatter correction techniques. In this study, energy window subtraction-based scatter correction methods are compared experimentally and quantitatively. MATERIALS AND METHODS: (177)Lu SPECT images of a phantom...... technique, the measured ratio was close to the real ratio, and the differences between spheres were small. CONCLUSION: For quantitative (177)Lu imaging MEGP collimators are advised. Both energy peaks can be utilized when the ESSE correction technique is applied. The difference between the calculated...

  15. Double ferromagnetism in single-crystal Gd-Y-Lu alloys

    International Nuclear Information System (INIS)

    Ito, T.; Oka, M.; Legvold, S.; Beaudry, B.J.

    1984-01-01

    Magnetization, electrical resistivity, specific-heat and thermal-expansion measurements have been made on Gd-Y-Lu single crystals. Low isofield magnetization data for the a-axis sample of Gd 75 Y/sub 17.5/ Lu/sub 7.5/ exhibit two different Curie-Weiss regimes, which suggests double ferromagnetism. Electrical resistivity, specific-heat, and thermal-expansion data show two anomalies at the transition temperatures. The anomaly at 231.5 K shows a lambda-type second-order phase transition and the anomaly at 223 K shows a sharp spike first-order phase transition

  16. Tl response of KMgF{sub 3}: Lu + PTFE at ultraviolet radiation; Respuesta Tl de KMgF{sub 3}: Lu + PTFE a radiacion ultravioleta

    Energy Technology Data Exchange (ETDEWEB)

    Gonzalez, P R [Instituto Nacional de Investigaciones Nucleares, A.P. 18 -1027, 11801 Mexico D.F. (Mexico); Alarcon, N G [Facultad de Quimica, Universidad Autonoma del Estado de Mexico. Paseo Tollocan, Esq. con Jesus Carranza, 50180 Toluca, Estado de Mexico (Mexico); Furetta, C; Azorin, J [Universidad Autonoma Metropolitana- Iztapalapa, San Rafael Atlixco 186, 09340 Mexico. D.F. (Mexico)

    2003-07-01

    Ionizing radiation has different types of interaction with a crystalline solid. However, only few effects are interesting to optimize some thermoluminescent (Tl) properties of certain Tl materials. This paper presents results obtained by irradiating KMgF{sub 3}: Lu + Ptfe Tl dosimeters with ultraviolet (UV) radiation previously exposed to gamma radiation. These results showed that those dosimeters not exposed previously to gamma radiation did not presented any Tl signal. Meanwhile, those previously submitted to gamma irradiation showed that their sensitivity was increased as the gamma dose increased. The glow curve of sensitized KMgF{sub 3}: Lu + Ptfe exposed to UV radiation, presented the dosimetric pea at 212 C. This makes this material to be promissory for measuring UV radiation. (Author)

  17. Tumoral fibrosis effect on the radiation absorbed dose of 177Lu-Tyr3-octreotate-gold nanoparticles and 177Lu-Tyr3-octreotate radiopharmaceuticals

    International Nuclear Information System (INIS)

    Zambrano R, O. D.

    2015-01-01

    In this work was comparatively evaluated the effect of tumoral fibrosis in the radiation absorbed dose of the radiopharmaceutical 177 Lu-Tyr 3 -octreotate with and without gold nanoparticles. For this, was used an experimental array of tumoral fibrosis and computer models based on Monte Carlo calculations to simulate tumoral micro environments without fibrosis and with fibrosis. The computer simulation code Penelope (Penetration Energy Loss of Positron and Electrons) and MCNP (Monte Carlo N-particle Transport Code System) which are based on the Monte Carlo methodology were used to create the computer models for the simulation of the transport of particles (emitted by 177 Lu) in the micro environments (without fibrosis and with fibrosis) with the purpose of calculating the radiation absorbed dose in the interstitial space and in the nucleus of cancer cells. The first computational model consisted of multiple concentric spheres (as onion shells) with the radioactive source homogeneously distributed in the shell between 5 and 10 μm in diameter which represents the internalization of the radioactive source into the cell cytoplasm as it occurs in target specific radiotherapy. The concentric spheres were useful to calculate the radiation absorbed dose in depth in the models without fibrosis and with fibrosis. Furthermore, there were constructed other computer models using two different codes that simulate the transport of radiation (Penelope and MCNP). These models consist of seven spheres that represent cancer cells (HeLa cells) of 10 μm in diameter and each one of them contain another smaller sphere in the center that represents the cell nucleus. A comparison was done of the radiation absorbed dose in the nucleus of the cells, calculated with both codes, Penelope and MCNP. The radioactive source ( 177 Lu) used for the simulations was given to the codes by means of a convoluted spectrum of the most important beta particles (high percentage emission). To this spectrum

  18. Overall survival and response pattern of castration-resistant metastatic prostate cancer to multiple cycles of radioligand therapy using [{sup 177}Lu]Lu-PSMA-617

    Energy Technology Data Exchange (ETDEWEB)

    Ahmadzadehfar, Hojjat; Wegen, Simone; Yordanova, Anna; Kuerpig, Stefan; Eppard, Elisabeth; Wei, Xiao; Schlenkhoff, Carl; Essler, Markus [University Hospital Bonn, Department of Nuclear Medicine, Bonn (Germany); Fimmers, Rolf [University of Bonn, Institute for Medical Biometry, Informatics and Epidemiology, Bonn (Germany); Hauser, Stefan [University Hospital Bonn, Department of Urology, Bonn (Germany)

    2017-08-15

    Up to 30% of patients with castration-resistant prostate cancer (CRPC) do not show any response to the first cycle of radioligand therapy (RLT) with [{sup 177}Lu]Lu-PSMA-617 (Lu-PSMA). We evaluated patient response to the second and third cycles of RLT in patients that underwent at least three cycles. The second aim of this study was to calculate the median overall survival (OS) of responders and non-responders after the first cycle and after all three cycles of RLT. CRPC patients were treated with Lu-PSMA, with a median interval of 8 weeks between each cycle. The tumour marker prostate-specific antigen (PSA) was used as the marker for response evaluation. Fifty-two patients underwent a total of 190 cycles of RLT (3-6 cycles per patient). Of these, 80.8% showed a decline in PSA 2 months after the first cycle, with 44.2% showing a PSA decline of ≥50%. When compared to baseline PSA, 73.1% showed a PSA decline after the third cycle. 50% of patients that did not show any response to the first cycle also did not respond to the second and third cycles. The median OS was 60 weeks in all patients. The median OS was significantly longer for patients that showed any PSA decline after the first cycle compared to patients without PSA decline (68 vs. 33 weeks). There was a significant difference in median OS between responders and non-responders for a change in PSA after the third cycle compared to baseline PSA. Patients with a positive response to RLT, regardless of the rate of decline, had a significantly longer median OS. Of the patients that did not show any response to the first cycle, 50% responded to the second or third cycles. (orig.)

  19. Overall survival and response pattern of castration-resistant metastatic prostate cancer to multiple cycles of radioligand therapy using [177Lu]Lu-PSMA-617.

    Science.gov (United States)

    Ahmadzadehfar, Hojjat; Wegen, Simone; Yordanova, Anna; Fimmers, Rolf; Kürpig, Stefan; Eppard, Elisabeth; Wei, Xiao; Schlenkhoff, Carl; Hauser, Stefan; Essler, Markus

    2017-08-01

    Up to 30% of patients with castration-resistant prostate cancer (CRPC) do not show any response to the first cycle of radioligand therapy (RLT) with [ 177 Lu]Lu-PSMA-617 (Lu-PSMA). We evaluated patient response to the second and third cycles of RLT in patients that underwent at least three cycles. The second aim of this study was to calculate the median overall survival (OS) of responders and non-responders after the first cycle and after all three cycles of RLT. CRPC patients were treated with Lu-PSMA, with a median interval of 8 weeks between each cycle. The tumour marker prostate-specific antigen (PSA) was used as the marker for response evaluation. Fifty-two patients underwent a total of 190 cycles of RLT (3-6 cycles per patient). Of these, 80.8% showed a decline in PSA 2 months after the first cycle, with 44.2% showing a PSA decline of ≥50%. When compared to baseline PSA, 73.1% showed a PSA decline after the third cycle. 50% of patients that did not show any response to the first cycle also did not respond to the second and third cycles. The median OS was 60 weeks in all patients. The median OS was significantly longer for patients that showed any PSA decline after the first cycle compared to patients without PSA decline (68 vs. 33 weeks). There was a significant difference in median OS between responders and non-responders for a change in PSA after the third cycle compared to baseline PSA. Patients with a positive response to RLT, regardless of the rate of decline, had a significantly longer median OS. Of the patients that did not show any response to the first cycle, 50% responded to the second or third cycles.

  20. Luminescent properties of LuAG:Yb and YAG:Yb single crystalline films grown by Liquid Phase Epitaxy method

    International Nuclear Information System (INIS)

    Zorenko, Yu; Zorenko, T.; Gorbenko, V.; Voznyak, T.; Popielarski, P.; Batentschuk, M.; Osvet, A.; Brabec, Ch; Kolobanov, V.; Spasky, D.; Fedorov, A.

    2016-01-01

    In this work, investigation of the spectroscopic parameters of the luminescence of Yb"3"+ ions in single crystalline films of Lu_3Al_5O_1_2 and Y_3Al_5O_1_2 garnets was performed using the synchrotron radiation excitation with the energy in the range of Yb"3"+ charge transitions (CT), exciton range and the onset of interband transitions of these garnets. The basic spectroscopic parameters of the Yb"3"+ CT luminescence in LuAG and YAG hosts were determined and summarized with taking into account the differences in the band gap structure of these garnets. - Highlights: • Single crystalline films of Yb doped LuAG and YAG garnets were grown by LPE method. • Yb"3"+ luminescence of LuAG:Yb and YAG:Yb film were studied using synchrotron radiation. • Basic parameters of Yb"3"+ charge transfer luminescence in LuAG and YAG were determined.

  1. Feature selection and multi-kernel learning for sparse representation on a manifold

    KAUST Repository

    Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

    2014-01-01

    combination of some basic items in a dictionary. Gao etal. (2013) recently proposed Laplacian sparse coding by regularizing the sparse codes with an affinity graph. However, due to the noisy features and nonlinear distribution of the data samples, the affinity

  2. Building Input Adaptive Parallel Applications: A Case Study of Sparse Grid Interpolation

    KAUST Repository

    Murarasu, Alin; Weidendorfer, Josef

    2012-01-01

    bring a substantial contribution to the speedup. By identifying common patterns in the input data, we propose new algorithms for sparse grid interpolation that accelerate the state-of-the-art non-specialized version. Sparse grid interpolation

  3. A Non-static Data Layout Enhancing Parallelism and Vectorization in Sparse Grid Algorithms

    KAUST Repository

    Buse, Gerrit; Pfluger, Dirk; Murarasu, Alin; Jacob, Riko

    2012-01-01

    performance and facilitate the use of vector registers for our sparse grid benchmark problem hierarchization. Based on the compact data structure proposed for regular sparse grids in [2], we developed a new algorithm that outperforms existing implementations

  4. Group sparse canonical correlation analysis for genomic data integration.

    Science.gov (United States)

    Lin, Dongdong; Zhang, Jigang; Li, Jingyao; Calhoun, Vince D; Deng, Hong-Wen; Wang, Yu-Ping

    2013-08-12

    The emergence of high-throughput genomic datasets from different sources and platforms (e.g., gene expression, single nucleotide polymorphisms (SNP), and copy number variation (CNV)) has greatly enhanced our understandings of the interplay of these genomic factors as well as their influences on the complex diseases. It is challenging to explore the relationship between these different types of genomic data sets. In this paper, we focus on a multivariate statistical method, canonical correlation analysis (CCA) method for this problem. Conventional CCA method does not work effectively if the number of data samples is significantly less than that of biomarkers, which is a typical case for genomic data (e.g., SNPs). Sparse CCA (sCCA) methods were introduced to overcome such difficulty, mostly using penalizations with l-1 norm (CCA-l1) or the combination of l-1and l-2 norm (CCA-elastic net). However, they overlook the structural or group effect within genomic data in the analysis, which often exist and are important (e.g., SNPs spanning a gene interact and work together as a group). We propose a new group sparse CCA method (CCA-sparse group) along with an effective numerical algorithm to study the mutual relationship between two different types of genomic data (i.e., SNP and gene expression). We then extend the model to a more general formulation that can include the existing sCCA models. We apply the model to feature/variable selection from two data sets and compare our group sparse CCA method with existing sCCA methods on both simulation and two real datasets (human gliomas data and NCI60 data). We use a graphical representation of the samples with a pair of canonical variates to demonstrate the discriminating characteristic of the selected features. Pathway analysis is further performed for biological interpretation of those features. The CCA-sparse group method incorporates group effects of features into the correlation analysis while performs individual feature

  5. Lu-Hf isotope systematics of fossil biogenic apatite and their effects on geochronology

    Science.gov (United States)

    Herwartz, Daniel; Münker, Carsten; Tütken, Thomas; Hoffmann, J. Elis; Wittke, Andreas; Barbier, Bruno

    2013-01-01

    Reliable methods for direct dating of biogenic apatite from pre-Pleistocene fossils are currently not available, and recent attempts using the Lu-Hf decay system yielded highly inaccurate ages for both bones and teeth. The geological processes accounting for this poor accuracy of Lu-Hf chronometry are not yet understood. Here we explore Lu-Hf systematics in fossil bones and teeth in detail, by applying five different sample digestion techniques that are tested on bones and composites of bone and sediment. Our current dataset implies that dissolution methods only slightly affect the resulting Lu-Hf ages, while clear differences between the individual digestion techniques became apparent for element concentrations. By analysing the insoluble leftovers from incomplete sample dissolution, four main reservoirs of Hf in fossil bones were identified: (1) a radiogenic end-member associated with apatite; (2) an unradiogenic end-member represented by the authigenic minerals or the embedding sediment; (3) a highly unradiogenic end-member that can be attributed to detrital zircon; and (4) a moderately soluble phase (probably a Zr(Hf)-phosphate) that yielded very low Lu/Hf but a highly radiogenic Hf isotope composition at the same time. This Zr(Hf)-phase must have been precipitated within the fossil bone sample at a late stage of burial history, thereby incorporating radiogenic 176Hf released from apatite surfaces over geological timescales. A second focus of our study is the effect of different sediment matrices and of crystal size on the preservation of pristine Lu-Hf isotope compositions in bioapatite. Because near-depositional Lu-Hf ages of phosphate fossils have previously been reported for the London Clay (England) and a calcareous marl from Tendaguru (Tanzania), we herein investigate specimens fossilised in carbonate matrices (calcareous marl from Oker, Germany; carbonate concretions from the Santana Formation, Brazil; carbonate from the Eifel, Germany) and argillaceous

  6. An electro-amalgamation approach to isolate no-carrier-added 177Lu from neutron irradiated Yb for biomedical applications

    International Nuclear Information System (INIS)

    Chakravarty, Rubel; Das, Tapas; Dash, Ashutosh; Venkatesh, Meera

    2010-01-01

    Introduction: A novel two-step separation process for the production of no-carrier-added (NCA) 177 Lu from neutron irradiated Yb target through an electrochemical pathway employing mercury-pool cathode has been developed. Methods: A two-cycle electrolysis procedure was adopted for separation of 177 Lu from 177 Lu/Yb mixture in lithium citrate medium. The influence of different experimental parameters on the separation process was investigated and optimized for the quantitative deposition of Yb in presence of 177 Lu. The first electrolysis was performed for 50 min in the 177 Lu/Yb feed solution at pH 6 applying a potential of 8 V using platinum electrode as anode and mercury as the cathode. The second electrolysis was performed under the same conditions using fresh electrodes. The radionuclidic and chemical purity of 177 Lu was determined by using gamma ray spectrometry and atomic absorption spectrometry. The suitability of 177 Lu for biomedical applications was ascertained by labeling 1,4,7,10-tetraazacyclododecane-1,4,7,10-tetraacetic acid D-Phe 1 -Tyr 3 -octreotate(DOTA-TATE) with 177 Lu. Results: This process could provide NCA 177 Lu with >99.99% radionuclidic purity and an overall separation yield of ∼99% was achieved within 3-4 h. The Hg content in the product was determined to be 98% was obtained with DOTA-TATE under the optimized reaction conditions. Conclusions: An efficient strategy for the separation of NCA 177 Lu, suitable for biomedical applications, has been developed.

  7. An electro-amalgamation approach to isolate no-carrier-added 177Lu from neutron irradiated Yb for biomedical applications.

    Science.gov (United States)

    Chakravarty, Rubel; Das, Tapas; Dash, Ashutosh; Venkatesh, Meera

    2010-10-01

    A novel two-step separation process for the production of no-carrier-added (NCA) (177)Lu from neutron irradiated Yb target through an electrochemical pathway employing mercury-pool cathode has been developed. A two-cycle electrolysis procedure was adopted for separation of (177)Lu from (177)Lu/Yb mixture in lithium citrate medium. The influence of different experimental parameters on the separation process was investigated and optimized for the quantitative deposition of Yb in presence of (177)Lu. The first electrolysis was performed for 50 min in the (177)Lu/Yb feed solution at pH 6 applying a potential of 8 V using platinum electrode as anode and mercury as the cathode. The second electrolysis was performed under the same conditions using fresh electrodes. The radionuclidic and chemical purity of (177)Lu was determined by using gamma ray spectrometry and atomic absorption spectrometry. The suitability of (177)Lu for biomedical applications was ascertained by labeling 1,4,7,10-tetraazacyclododecane-1,4,7,10-tetraacetic acid D-Phe(1)-Tyr(3)-octreotate(DOTA-TATE) with (177)Lu. This process could provide NCA (177)Lu with >99.99% radionuclidic purity and an overall separation yield of ∼99% was achieved within 3-4 h. The Hg content in the product was determined to be 98% was obtained with DOTA-TATE under the optimized reaction conditions. An efficient strategy for the separation of NCA (177)Lu, suitable for biomedical applications, has been developed. Copyright © 2010 Elsevier Inc. All rights reserved.

  8. Facile controlled synthesis different morphologies of LuBO3:Ln3+ (Ln = Eu, Tb) phosphors and tunable luminescent properties

    International Nuclear Information System (INIS)

    Leng, Zhihua; Xiong, Hailong; Li, Linlin; Zhang, Nannan; Liu, Yali; Gan, Shucai

    2015-01-01

    Sphere-like and cauliflower-like hexagonal-vaterite LuBO 3 have been successfully synthesized for the first time via a chemical conversion route using Lu(OH)CO 3 colloid spheres as sacrificial precursor and H 3 BO 3 as boron source without any additional surfactant. FTIR analysis provides an additional evidence of the formation of vaterite-type LuBO 3 in this method. It was found that, an appropriate amount ethanol in the hydrothermal process has a great effect on the products' morphology and crystallinity. Time-dependent experiments indicate that the formation of LuBO 3 crystals went through a two-stage growth process, which involves a fast nucleation of primary particles followed by a slow aggregation and crystallization of primary particles. An investigation on the photoluminescence (PL) properties of LuBO 3 :Eu 3+ phosphors with different morphologies indicates that their PL intensity are dependent on their crystallinity. The effect of Eu 3+ and Tb 3+ doping concentration on PL intensity were also investigated and the quenching concentration of LuBO 3 :Eu 3+ and LuBO 3 :Tb 3+ is 0.25 and 0.20, respectively. Moreover, for Eu 3+ /Tb 3+ doped LuBO 3 phosphors, the color tones can be tuned from green, through green–yellow and yellow, and then to red by simply adjusting the relative doping concentrations of the Tb 3+ and Eu 3+ ions. - Highlights: • Sphere-like and cauliflower-like LuBO 3 were obtained by a conversion route. • This method used Lu(OH)CO 3 and H 3 BO 3 as the precursors for the first time. • Ethanol can control the products' morphology, crystallinity and PL intensity. • The emitting color tones vary with Tb 3+ /Eu 3+ doped concentration

  9. An in-depth study of sparse codes on abnormality detection

    DEFF Research Database (Denmark)

    Ren, Huamin; Pan, Hong; Olsen, Søren Ingvor

    2016-01-01

    Sparse representation has been applied successfully in abnormal event detection, in which the baseline is to learn a dictionary accompanied by sparse codes. While much emphasis is put on discriminative dictionary construction, there are no comparative studies of sparse codes regarding abnormality...... are carried out from various angles to better understand the applicability of sparse codes, including computation time, reconstruction error, sparsity, detection accuracy, and their performance combining various detection methods. The experiment results show that combining OMP codes with maximum coordinate...

  10. Sparse representation, modeling and learning in visual recognition theory, algorithms and applications

    CERN Document Server

    Cheng, Hong

    2015-01-01

    This unique text/reference presents a comprehensive review of the state of the art in sparse representations, modeling and learning. The book examines both the theoretical foundations and details of algorithm implementation, highlighting the practical application of compressed sensing research in visual recognition and computer vision. Topics and features: provides a thorough introduction to the fundamentals of sparse representation, modeling and learning, and the application of these techniques in visual recognition; describes sparse recovery approaches, robust and efficient sparse represen

  11. Porting of the DBCSR library for Sparse Matrix-Matrix Multiplications to Intel Xeon Phi systems

    OpenAIRE

    Bethune, Iain; Gloess, Andeas; Hutter, Juerg; Lazzaro, Alfio; Pabst, Hans; Reid, Fiona

    2017-01-01

    Multiplication of two sparse matrices is a key operation in the simulation of the electronic structure of systems containing thousands of atoms and electrons. The highly optimized sparse linear algebra library DBCSR (Distributed Block Compressed Sparse Row) has been specifically designed to efficiently perform such sparse matrix-matrix multiplications. This library is the basic building block for linear scaling electronic structure theory and low scaling correlated methods in CP2K. It is para...

  12. High-Order Sparse Linear Predictors for Audio Processing

    DEFF Research Database (Denmark)

    Giacobello, Daniele; van Waterschoot, Toon; Christensen, Mads Græsbøll

    2010-01-01

    Linear prediction has generally failed to make a breakthrough in audio processing, as it has done in speech processing. This is mostly due to its poor modeling performance, since an audio signal is usually an ensemble of different sources. Nevertheless, linear prediction comes with a whole set...... of interesting features that make the idea of using it in audio processing not far fetched, e.g., the strong ability of modeling the spectral peaks that play a dominant role in perception. In this paper, we provide some preliminary conjectures and experiments on the use of high-order sparse linear predictors...... in audio processing. These predictors, successfully implemented in modeling the short-term and long-term redundancies present in speech signals, will be used to model tonal audio signals, both monophonic and polyphonic. We will show how the sparse predictors are able to model efficiently the different...

  13. Sparse Covariance Matrix Estimation by DCA-Based Algorithms.

    Science.gov (United States)

    Phan, Duy Nhat; Le Thi, Hoai An; Dinh, Tao Pham

    2017-11-01

    This letter proposes a novel approach using the [Formula: see text]-norm regularization for the sparse covariance matrix estimation (SCME) problem. The objective function of SCME problem is composed of a nonconvex part and the [Formula: see text] term, which is discontinuous and difficult to tackle. Appropriate DC (difference of convex functions) approximations of [Formula: see text]-norm are used that result in approximation SCME problems that are still nonconvex. DC programming and DCA (DC algorithm), powerful tools in nonconvex programming framework, are investigated. Two DC formulations are proposed and corresponding DCA schemes developed. Two applications of the SCME problem that are considered are classification via sparse quadratic discriminant analysis and portfolio optimization. A careful empirical experiment is performed through simulated and real data sets to study the performance of the proposed algorithms. Numerical results showed their efficiency and their superiority compared with seven state-of-the-art methods.

  14. Sample size reduction in groundwater surveys via sparse data assimilation

    KAUST Repository

    Hussain, Z.

    2013-04-01

    In this paper, we focus on sparse signal recovery methods for data assimilation in groundwater models. The objective of this work is to exploit the commonly understood spatial sparsity in hydrodynamic models and thereby reduce the number of measurements to image a dynamic groundwater profile. To achieve this we employ a Bayesian compressive sensing framework that lets us adaptively select the next measurement to reduce the estimation error. An extension to the Bayesian compressive sensing framework is also proposed which incorporates the additional model information to estimate system states from even lesser measurements. Instead of using cumulative imaging-like measurements, such as those used in standard compressive sensing, we use sparse binary matrices. This choice of measurements can be interpreted as randomly sampling only a small subset of dug wells at each time step, instead of sampling the entire grid. Therefore, this framework offers groundwater surveyors a significant reduction in surveying effort without compromising the quality of the survey. © 2013 IEEE.

  15. High Order Tensor Formulation for Convolutional Sparse Coding

    KAUST Repository

    Bibi, Adel Aamer

    2017-12-25

    Convolutional sparse coding (CSC) has gained attention for its successful role as a reconstruction and a classification tool in the computer vision and machine learning community. Current CSC methods can only reconstruct singlefeature 2D images independently. However, learning multidimensional dictionaries and sparse codes for the reconstruction of multi-dimensional data is very important, as it examines correlations among all the data jointly. This provides more capacity for the learned dictionaries to better reconstruct data. In this paper, we propose a generic and novel formulation for the CSC problem that can handle an arbitrary order tensor of data. Backed with experimental results, our proposed formulation can not only tackle applications that are not possible with standard CSC solvers, including colored video reconstruction (5D- tensors), but it also performs favorably in reconstruction with much fewer parameters as compared to naive extensions of standard CSC to multiple features/channels.

  16. Sample size reduction in groundwater surveys via sparse data assimilation

    KAUST Repository

    Hussain, Z.; Muhammad, A.

    2013-01-01

    In this paper, we focus on sparse signal recovery methods for data assimilation in groundwater models. The objective of this work is to exploit the commonly understood spatial sparsity in hydrodynamic models and thereby reduce the number of measurements to image a dynamic groundwater profile. To achieve this we employ a Bayesian compressive sensing framework that lets us adaptively select the next measurement to reduce the estimation error. An extension to the Bayesian compressive sensing framework is also proposed which incorporates the additional model information to estimate system states from even lesser measurements. Instead of using cumulative imaging-like measurements, such as those used in standard compressive sensing, we use sparse binary matrices. This choice of measurements can be interpreted as randomly sampling only a small subset of dug wells at each time step, instead of sampling the entire grid. Therefore, this framework offers groundwater surveyors a significant reduction in surveying effort without compromising the quality of the survey. © 2013 IEEE.

  17. Sparse logistic principal components analysis for binary data

    KAUST Repository

    Lee, Seokho

    2010-09-01

    We develop a new principal components analysis (PCA) type dimension reduction method for binary data. Different from the standard PCA which is defined on the observed data, the proposed PCA is defined on the logit transform of the success probabilities of the binary observations. Sparsity is introduced to the principal component (PC) loading vectors for enhanced interpretability and more stable extraction of the principal components. Our sparse PCA is formulated as solving an optimization problem with a criterion function motivated from a penalized Bernoulli likelihood. A Majorization-Minimization algorithm is developed to efficiently solve the optimization problem. The effectiveness of the proposed sparse logistic PCA method is illustrated by application to a single nucleotide polymorphism data set and a simulation study. © Institute ol Mathematical Statistics, 2010.

  18. Statistical mechanics of semi-supervised clustering in sparse graphs

    International Nuclear Information System (INIS)

    Ver Steeg, Greg; Galstyan, Aram; Allahverdyan, Armen E

    2011-01-01

    We theoretically study semi-supervised clustering in sparse graphs in the presence of pair-wise constraints on the cluster assignments of nodes. We focus on bi-cluster graphs and study the impact of semi-supervision for varying constraint density and overlap between the clusters. Recent results for unsupervised clustering in sparse graphs indicate that there is a critical ratio of within-cluster and between-cluster connectivities below which clusters cannot be recovered with better than random accuracy. The goal of this paper is to examine the impact of pair-wise constraints on the clustering accuracy. Our results suggest that the addition of constraints does not provide automatic improvement over the unsupervised case. When the density of the constraints is sufficiently small, their only impact is to shift the detection threshold while preserving the criticality. Conversely, if the density of (hard) constraints is above the percolation threshold, the criticality is suppressed and the detection threshold disappears

  19. A sparse electromagnetic imaging scheme using nonlinear landweber iterations

    KAUST Repository

    Desmal, Abdulla

    2015-10-26

    Development and use of electromagnetic inverse scattering techniques for imagining sparse domains have been on the rise following the recent advancements in solving sparse optimization problems. Existing techniques rely on iteratively converting the nonlinear forward scattering operator into a sequence of linear ill-posed operations (for example using the Born iterative method) and applying sparsity constraints to the linear minimization problem of each iteration through the use of L0/L1-norm penalty term (A. Desmal and H. Bagci, IEEE Trans. Antennas Propag, 7, 3878–3884, 2014, and IEEE Trans. Geosci. Remote Sens., 3, 532–536, 2015). It has been shown that these techniques produce more accurate and sharper images than their counterparts which solve a minimization problem constrained with smoothness promoting L2-norm penalty term. But these existing techniques are only applicable to investigation domains involving weak scatterers because the linearization process breaks down for high values of dielectric permittivity.

  20. Semi-blind sparse image reconstruction with application to MRFM.

    Science.gov (United States)

    Park, Se Un; Dobigeon, Nicolas; Hero, Alfred O

    2012-09-01

    We propose a solution to the image deconvolution problem where the convolution kernel or point spread function (PSF) is assumed to be only partially known. Small perturbations generated from the model are exploited to produce a few principal components explaining the PSF uncertainty in a high-dimensional space. Unlike recent developments on blind deconvolution of natural images, we assume the image is sparse in the pixel basis, a natural sparsity arising in magnetic resonance force microscopy (MRFM). Our approach adopts a Bayesian Metropolis-within-Gibbs sampling framework. The performance of our Bayesian semi-blind algorithm for sparse images is superior to previously proposed semi-blind algorithms such as the alternating minimization algorithm and blind algorithms developed for natural images. We illustrate our myopic algorithm on real MRFM tobacco virus data.

  1. Sparse data structure design for wavelet-based methods

    Directory of Open Access Journals (Sweden)

    Latu Guillaume

    2011-12-01

    Full Text Available This course gives an introduction to the design of efficient datatypes for adaptive wavelet-based applications. It presents some code fragments and benchmark technics useful to learn about the design of sparse data structures and adaptive algorithms. Material and practical examples are given, and they provide good introduction for anyone involved in the development of adaptive applications. An answer will be given to the question: how to implement and efficiently use the discrete wavelet transform in computer applications? A focus will be made on time-evolution problems, and use of wavelet-based scheme for adaptively solving partial differential equations (PDE. One crucial issue is that the benefits of the adaptive method in term of algorithmic cost reduction can not be wasted by overheads associated to sparse data management.

  2. Split-Bregman-based sparse-view CT reconstruction

    Energy Technology Data Exchange (ETDEWEB)

    Vandeghinste, Bert; Vandenberghe, Stefaan [Ghent Univ. (Belgium). Medical Image and Signal Processing (MEDISIP); Goossens, Bart; Pizurica, Aleksandra; Philips, Wilfried [Ghent Univ. (Belgium). Image Processing and Interpretation Research Group (IPI); Beenhouwer, Jan de [Ghent Univ. (Belgium). Medical Image and Signal Processing (MEDISIP); Antwerp Univ., Wilrijk (Belgium). The Vision Lab; Staelens, Steven [Ghent Univ. (Belgium). Medical Image and Signal Processing (MEDISIP); Antwerp Univ., Edegem (Belgium). Molecular Imaging Centre Antwerp

    2011-07-01

    Total variation minimization has been extensively researched for image denoising and sparse view reconstruction. These methods show superior denoising performance for simple images with little texture, but result in texture information loss when applied to more complex images. It could thus be beneficial to use other regularizers within medical imaging. We propose a general regularization method, based on a split-Bregman approach. We show results for this framework combined with a total variation denoising operator, in comparison to ASD-POCS. We show that sparse-view reconstruction and noise regularization is possible. This general method will allow us to investigate other regularizers in the context of regularized CT reconstruction, and decrease the acquisition times in {mu}CT. (orig.)

  3. Sparse canonical correlation analysis: new formulation and algorithm.

    Science.gov (United States)

    Chu, Delin; Liao, Li-Zhi; Ng, Michael K; Zhang, Xiaowei

    2013-12-01

    In this paper, we study canonical correlation analysis (CCA), which is a powerful tool in multivariate data analysis for finding the correlation between two sets of multidimensional variables. The main contributions of the paper are: 1) to reveal the equivalent relationship between a recursive formula and a trace formula for the multiple CCA problem, 2) to obtain the explicit characterization for all solutions of the multiple CCA problem even when the corresponding covariance matrices are singular, 3) to develop a new sparse CCA algorithm, and 4) to establish the equivalent relationship between the uncorrelated linear discriminant analysis and the CCA problem. We test several simulated and real-world datasets in gene classification and cross-language document retrieval to demonstrate the effectiveness of the proposed algorithm. The performance of the proposed method is competitive with the state-of-the-art sparse CCA algorithms.

  4. Sparse Nonlinear Electromagnetic Imaging Accelerated With Projected Steepest Descent Algorithm

    KAUST Repository

    Desmal, Abdulla

    2017-04-03

    An efficient electromagnetic inversion scheme for imaging sparse 3-D domains is proposed. The scheme achieves its efficiency and accuracy by integrating two concepts. First, the nonlinear optimization problem is constrained using L₀ or L₁-norm of the solution as the penalty term to alleviate the ill-posedness of the inverse problem. The resulting Tikhonov minimization problem is solved using nonlinear Landweber iterations (NLW). Second, the efficiency of the NLW is significantly increased using a steepest descent algorithm. The algorithm uses a projection operator to enforce the sparsity constraint by thresholding the solution at every iteration. Thresholding level and iteration step are selected carefully to increase the efficiency without sacrificing the convergence of the algorithm. Numerical results demonstrate the efficiency and accuracy of the proposed imaging scheme in reconstructing sparse 3-D dielectric profiles.

  5. Multi scales based sparse matrix spectral clustering image segmentation

    Science.gov (United States)

    Liu, Zhongmin; Chen, Zhicai; Li, Zhanming; Hu, Wenjin

    2018-04-01

    In image segmentation, spectral clustering algorithms have to adopt the appropriate scaling parameter to calculate the similarity matrix between the pixels, which may have a great impact on the clustering result. Moreover, when the number of data instance is large, computational complexity and memory use of the algorithm will greatly increase. To solve these two problems, we proposed a new spectral clustering image segmentation algorithm based on multi scales and sparse matrix. We devised a new feature extraction method at first, then extracted the features of image on different scales, at last, using the feature information to construct sparse similarity matrix which can improve the operation efficiency. Compared with traditional spectral clustering algorithm, image segmentation experimental results show our algorithm have better degree of accuracy and robustness.

  6. Nonredundant sparse feature extraction using autoencoders with receptive fields clustering.

    Science.gov (United States)

    Ayinde, Babajide O; Zurada, Jacek M

    2017-09-01

    This paper proposes new techniques for data representation in the context of deep learning using agglomerative clustering. Existing autoencoder-based data representation techniques tend to produce a number of encoding and decoding receptive fields of layered autoencoders that are duplicative, thereby leading to extraction of similar features, thus resulting in filtering redundancy. We propose a way to address this problem and show that such redundancy can be eliminated. This yields smaller networks and produces unique receptive fields that extract distinct features. It is also shown that autoencoders with nonnegativity constraints on weights are capable of extracting fewer redundant features than conventional sparse autoencoders. The concept is illustrated using conventional sparse autoencoder and nonnegativity-constrained autoencoders with MNIST digits recognition, NORB normalized-uniform object data and Yale face dataset. Copyright © 2017 Elsevier Ltd. All rights reserved.

  7. Greedy Algorithms for Nonnegativity-Constrained Simultaneous Sparse Recovery

    Science.gov (United States)

    Kim, Daeun; Haldar, Justin P.

    2016-01-01

    This work proposes a family of greedy algorithms to jointly reconstruct a set of vectors that are (i) nonnegative and (ii) simultaneously sparse with a shared support set. The proposed algorithms generalize previous approaches that were designed to impose these constraints individually. Similar to previous greedy algorithms for sparse recovery, the proposed algorithms iteratively identify promising support indices. In contrast to previous approaches, the support index selection procedure has been adapted to prioritize indices that are consistent with both the nonnegativity and shared support constraints. Empirical results demonstrate for the first time that the combined use of simultaneous sparsity and nonnegativity constraints can substantially improve recovery performance relative to existing greedy algorithms that impose less signal structure. PMID:26973368

  8. Limited-memory trust-region methods for sparse relaxation

    Science.gov (United States)

    Adhikari, Lasith; DeGuchy, Omar; Erway, Jennifer B.; Lockhart, Shelby; Marcia, Roummel F.

    2017-08-01

    In this paper, we solve the l2-l1 sparse recovery problem by transforming the objective function of this problem into an unconstrained differentiable function and applying a limited-memory trust-region method. Unlike gradient projection-type methods, which uses only the current gradient, our approach uses gradients from previous iterations to obtain a more accurate Hessian approximation. Numerical experiments show that our proposed approach eliminates spurious solutions more effectively while improving computational time.

  9. Obtaining sparse distributions in 2D inverse problems

    OpenAIRE

    Reci, A; Sederman, Andrew John; Gladden, Lynn Faith

    2017-01-01

    The mathematics of inverse problems has relevance across numerous estimation problems in science and engineering. L1 regularization has attracted recent attention in reconstructing the system properties in the case of sparse inverse problems; i.e., when the true property sought is not adequately described by a continuous distribution, in particular in Compressed Sensing image reconstruction. In this work, we focus on the application of L1 regularization to a class of inverse problems; relaxat...

  10. Sparse optimization for inverse problems in atmospheric modelling

    Czech Academy of Sciences Publication Activity Database

    Adam, Lukáš; Branda, Martin

    2016-01-01

    Roč. 79, č. 3 (2016), s. 256-266 ISSN 1364-8152 R&D Projects: GA MŠk(CZ) 7F14287 Institutional support: RVO:67985556 Keywords : Inverse modelling * Sparse optimization * Integer optimization * Least squares * European tracer experiment * Free Matlab codes Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 4.404, year: 2016 http://library.utia.cas.cz/separaty/2016/MTR/adam-0457037.pdf

  11. Example-Based Image Colorization Using Locality Consistent Sparse Representation.

    Science.gov (United States)

    Bo Li; Fuchen Zhao; Zhuo Su; Xiangguo Liang; Yu-Kun Lai; Rosin, Paul L

    2017-11-01

    Image colorization aims to produce a natural looking color image from a given gray-scale image, which remains a challenging problem. In this paper, we propose a novel example-based image colorization method exploiting a new locality consistent sparse representation. Given a single reference color image, our method automatically colorizes the target gray-scale image by sparse pursuit. For efficiency and robustness, our method operates at the superpixel level. We extract low-level intensity features, mid-level texture features, and high-level semantic features for each superpixel, which are then concatenated to form its descriptor. The collection of feature vectors for all the superpixels from the reference image composes the dictionary. We formulate colorization of target superpixels as a dictionary-based sparse reconstruction problem. Inspired by the observation that superpixels with similar spatial location and/or feature representation are likely to match spatially close regions from the reference image, we further introduce a locality promoting regularization term into the energy formulation, which substantially improves the matching consistency and subsequent colorization results. Target superpixels are colorized based on the chrominance information from the dominant reference superpixels. Finally, to further improve coherence while preserving sharpness, we develop a new edge-preserving filter for chrominance channels with the guidance from the target gray-scale image. To the best of our knowledge, this is the first work on sparse pursuit image colorization from single reference images. Experimental results demonstrate that our colorization method outperforms the state-of-the-art methods, both visually and quantitatively using a user study.

  12. Reliability of Broadcast Communications Under Sparse Random Linear Network Coding

    OpenAIRE

    Brown, Suzie; Johnson, Oliver; Tassi, Andrea

    2018-01-01

    Ultra-reliable Point-to-Multipoint (PtM) communications are expected to become pivotal in networks offering future dependable services for smart cities. In this regard, sparse Random Linear Network Coding (RLNC) techniques have been widely employed to provide an efficient way to improve the reliability of broadcast and multicast data streams. This paper addresses the pressing concern of providing a tight approximation to the probability of a user recovering a data stream protected by this kin...

  13. Efficient Pseudorecursive Evaluation Schemes for Non-adaptive Sparse Grids

    KAUST Repository

    Buse, Gerrit

    2014-01-01

    In this work we propose novel algorithms for storing and evaluating sparse grid functions, operating on regular (not spatially adaptive), yet potentially dimensionally adaptive grid types. Besides regular sparse grids our approach includes truncated grids, both with and without boundary grid points. Similar to the implicit data structures proposed in Feuersänger (Dünngitterverfahren für hochdimensionale elliptische partielle Differntialgleichungen. Diploma Thesis, Institut für Numerische Simulation, Universität Bonn, 2005) and Murarasu et al. (Proceedings of the 16th ACM Symposium on Principles and Practice of Parallel Programming. Cambridge University Press, New York, 2011, pp. 25–34) we also define a bijective mapping from the multi-dimensional space of grid points to a contiguous index, such that the grid data can be stored in a simple array without overhead. Our approach is especially well-suited to exploit all levels of current commodity hardware, including cache-levels and vector extensions. Furthermore, this kind of data structure is extremely attractive for today’s real-time applications, as it gives direct access to the hierarchical structure of the grids, while outperforming other common sparse grid structures (hash maps, etc.) which do not match with modern compute platforms that well. For dimensionality d ≤ 10 we achieve good speedups on a 12 core Intel Westmere-EP NUMA platform compared to the results presented in Murarasu et al. (Proceedings of the International Conference on Computational Science—ICCS 2012. Procedia Computer Science, 2012). As we show, this also holds for the results obtained on Nvidia Fermi GPUs, for which we observe speedups over our own CPU implementation of up to 4.5 when dealing with moderate dimensionality. In high-dimensional settings, in the order of tens to hundreds of dimensions, our sparse grid evaluation kernels on the CPU outperform any other known implementation.

  14. Iterative algorithms for large sparse linear systems on parallel computers

    Science.gov (United States)

    Adams, L. M.

    1982-01-01

    Algorithms for assembling in parallel the sparse system of linear equations that result from finite difference or finite element discretizations of elliptic partial differential equations, such as those that arise in structural engineering are developed. Parallel linear stationary iterative algorithms and parallel preconditioned conjugate gradient algorithms are developed for solving these systems. In addition, a model for comparing parallel algorithms on array architectures is developed and results of this model for the algorithms are given.

  15. Distributed coding of multiview sparse sources with joint recovery

    DEFF Research Database (Denmark)

    Luong, Huynh Van; Deligiannis, Nikos; Forchhammer, Søren

    2016-01-01

    In support of applications involving multiview sources in distributed object recognition using lightweight cameras, we propose a new method for the distributed coding of sparse sources as visual descriptor histograms extracted from multiview images. The problem is challenging due to the computati...... transform (SIFT) descriptors extracted from multiview images shows that our method leads to bit-rate saving of up to 43% compared to the state-of-the-art distributed compressed sensing method with independent encoding of the sources....

  16. Optimal deep neural networks for sparse recovery via Laplace techniques

    OpenAIRE

    Limmer, Steffen; Stanczak, Slawomir

    2017-01-01

    This paper introduces Laplace techniques for designing a neural network, with the goal of estimating simplex-constraint sparse vectors from compressed measurements. To this end, we recast the problem of MMSE estimation (w.r.t. a pre-defined uniform input distribution) as the problem of computing the centroid of some polytope that results from the intersection of the simplex and an affine subspace determined by the measurements. Owing to the specific structure, it is shown that the centroid ca...

  17. Shape prior modeling using sparse representation and online dictionary learning.

    Science.gov (United States)

    Zhang, Shaoting; Zhan, Yiqiang; Zhou, Yan; Uzunbas, Mustafa; Metaxas, Dimitris N

    2012-01-01

    The recently proposed sparse shape composition (SSC) opens a new avenue for shape prior modeling. Instead of assuming any parametric model of shape statistics, SSC incorporates shape priors on-the-fly by approximating a shape instance (usually derived from appearance cues) by a sparse combination of shapes in a training repository. Theoretically, one can increase the modeling capability of SSC by including as many training shapes in the repository. However, this strategy confronts two limitations in practice. First, since SSC involves an iterative sparse optimization at run-time, the more shape instances contained in the repository, the less run-time efficiency SSC has. Therefore, a compact and informative shape dictionary is preferred to a large shape repository. Second, in medical imaging applications, training shapes seldom come in one batch. It is very time consuming and sometimes infeasible to reconstruct the shape dictionary every time new training shapes appear. In this paper, we propose an online learning method to address these two limitations. Our method starts from constructing an initial shape dictionary using the K-SVD algorithm. When new training shapes come, instead of re-constructing the dictionary from the ground up, we update the existing one using a block-coordinates descent approach. Using the dynamically updated dictionary, sparse shape composition can be gracefully scaled up to model shape priors from a large number of training shapes without sacrificing run-time efficiency. Our method is validated on lung localization in X-Ray and cardiac segmentation in MRI time series. Compared to the original SSC, it shows comparable performance while being significantly more efficient.

  18. Color normalization of histology slides using graph regularized sparse NMF

    Science.gov (United States)

    Sha, Lingdao; Schonfeld, Dan; Sethi, Amit

    2017-03-01

    Computer based automatic medical image processing and quantification are becoming popular in digital pathology. However, preparation of histology slides can vary widely due to differences in staining equipment, procedures and reagents, which can reduce the accuracy of algorithms that analyze their color and texture information. To re- duce the unwanted color variations, various supervised and unsupervised color normalization methods have been proposed. Compared with supervised color normalization methods, unsupervised color normalization methods have advantages of time and cost efficient and universal applicability. Most of the unsupervised color normaliza- tion methods for histology are based on stain separation. Based on the fact that stain concentration cannot be negative and different parts of the tissue absorb different stains, nonnegative matrix factorization (NMF), and particular its sparse version (SNMF), are good candidates for stain separation. However, most of the existing unsupervised color normalization method like PCA, ICA, NMF and SNMF fail to consider important information about sparse manifolds that its pixels occupy, which could potentially result in loss of texture information during color normalization. Manifold learning methods like Graph Laplacian have proven to be very effective in interpreting high-dimensional data. In this paper, we propose a novel unsupervised stain separation method called graph regularized sparse nonnegative matrix factorization (GSNMF). By considering the sparse prior of stain concentration together with manifold information from high-dimensional image data, our method shows better performance in stain color deconvolution than existing unsupervised color deconvolution methods, especially in keeping connected texture information. To utilized the texture information, we construct a nearest neighbor graph between pixels within a spatial area of an image based on their distances using heat kernal in lαβ space. The

  19. Reducing renal uptake of 9Y- and 177Lu-labeled alpha-melanocyte stimulating hormone peptide analogues

    International Nuclear Information System (INIS)

    Miao Yubin; Fisher, Darrell R.; Quinn, Thomas P.

    2006-01-01

    Objective: The purpose of this study was to improve the tumor-to-kidney uptake ratios of 9 Y- and 177 Lu-[1,4,7,10-tetraazacyclododecane-1,4,7,10-tetraacetic acid-Re-Cys 3,4,1 , D-Phe 7 , Arg 11 ]α-melanocyte stimulating hormone 3-13 {DOTA-Re(Arg 11 )CCMSH} through coupling a negatively charged glutamic acid (Glu) to the peptide sequence. Methods: A new peptide of DOTA-Re(Glu 2 , Arg 11 )CCMSH was designed, synthesized and labeled with 9 Y and 177 Lu. Pharmacokinetics of 9 Y- and 177 Lu-DOTA-Re(Glu 2 , Arg 11 )CCMSH was determined in B16/F1 murine melanoma-bearing C57 mice. Results: 9 Y- and 177 Lu-DOTA-Re(Glu 2 , Arg 11 )CCMSH exhibited significantly (P 9 Y- and 177 Lu-DOTA-Re(Arg 11 )CCMSH at 30 min and at 2, 4 and 24 h after dose administration. The renal uptake values of 9 Y- and 177 Lu-DOTA-Re(Glu 2 , Arg 11 )CCMSH were 28.16% and 28.81% of those of 9 Y- and 177 Lu-DOTA-Re(Arg 11 )CCMSH, respectively, at 4 h postinjection. 9 Y- and 177 Lu-DOTA-Re(Glu 2 , Arg 11 )CCMSH displayed higher tumor-to-kidney uptake ratios than 9 Y- and 177 Lu-DOTA-Re(Arg 11 )CCMSH at 30 min and at 2, 4 and 24 h after dose administration. The tumor-to-kidney uptake ratio of 9 Y- and 177 Lu-DOTA-Re(Glu 2 , Arg 11 )CCMSH was 2.28 and 1.69 times of 9 Y- and 177 Lu-DOTA-Re(Arg 11 )CCMSH, respectively, at 4 h postinjection. The 9 Y- and 177 Lu-DOTA-Re(Glu 2 , Arg 11 )CCMSH activity accumulation was low in normal organs except for kidney. Conclusions: Coupling a negatively charged amino acid (Glu) to the CCMSH peptide sequence dramatically reduced the renal uptake values and increased the tumor-to-kidney uptake ratios of 9 Y- and 177 Lu-DOTA-Re(Glu 2 , Arg 11 )CCMSH, facilitating their potential applications as radiopharmaceuticals for targeted radionuclide therapy of melanoma

  20. Friction induced hunting limit cycles : a comparison between the LuGre and switch friction model

    NARCIS (Netherlands)

    Hensen, R.H.A.; Molengraft, van de M.J.G.; Steinbuch, M.

    2003-01-01

    In this paper, friction induced limit cycles are predicted for a simple motion system consisting of a motor-driven inertia subjected to friction and a PID-controlled regulator task. The two friction models used, i.e., (i) the dynamic LuGre friction model and (ii) the static switch friction model,

  1. Weak antilocalization effect and noncentrosymmetric superconductivity in a topologically nontrivial semimetal LuPdBi

    KAUST Repository

    Xu, Guizhou; Wang, Wenhong; Zhang, Xiaoming; Du, Yin; Liu, Enke; Wang, Shouguo; Wu, Guangheng; Liu, Zhongyuan; Zhang, Xixiang

    2014-01-01

    A large number of half-Heusler compounds have been recently proposed as three-dimensional (3D) topological insulators (TIs) with tunable physical properties. However, no transport measurements associated with the topological surface states have been observed in these half-Heusler candidates due to the dominating contribution from bulk electrical conductance. Here we show that, by reducing the mobility of bulk carriers, a two-dimensional (2D) weak antilocalization (WAL) effect, one of the hallmarks of topological surface states, was experimentally revealed from the tilted magnetic field dependence of magnetoconductance in a topologically nontrivial semimetal LuPdBi. Besides the observation of a 2D WAL effect, a superconducting transition was revealed at T c ∼ 1.7â.K in the same bulk LuPdBi. Quantitative analysis within the framework of a generalized BCS theory leads to the conclusion that the noncentrosymmetric superconductivity of LuPdBi is fully gapped with a possibly unconventional pairing character. The co-existence of superconductivity and the transport signature of topological surface states in the same bulk alloy suggests that LuPdBi represents a very promising candidate as a topological superconductor.

  2. High performance matrix inversion based on LU factorization for multicore architectures

    KAUST Repository

    Dongarra, Jack; Faverge, Mathieu; Ltaief, Hatem; Luszczek, Piotr R.

    2011-01-01

    on the available processing units. The reported results from our LU-based matrix inversion implementation significantly outperform the state-of-the-art numerical libraries such as LAPACK (5x), MKL (5x) and ScaLAPACK (2.5x) on a contemporary AMD platform with four

  3. Preparation and preclinical evaluation of (177)Lu-nimotuzumab targeting epidermal growth factor receptor overexpressing tumors

    Czech Academy of Sciences Publication Activity Database

    Beckford, Denis R.; Eigner, Sebastian; Eigner-Henke, Kateřina; Lebeda, Ondřej; Melichar, František; Beran, Miloš

    2012-01-01

    Roč. 39, č. 1 (2012), s. 3-13 ISSN 0969-8051 R&D Projects: GA MŠk 2B06165 Institutional research plan: CEZ:AV0Z10480505 Keywords : Radioimmunotherapy * Nimotuzumab * (177)Lu * Monoclonal antibody Subject RIV: FR - Pharmacology ; Medidal Chemistry Impact factor: 2.517, year: 2012

  4. Hüsteeria, seks ja selektiivne mälu / Anneli Porri

    Index Scriptorium Estoniae

    Porri, Anneli, 1980-

    2006-01-01

    Marge Monko näitus "Uurimusi kodanlusest" (Charcot' klassifitseeritud krambiasendeid esitab tantsija Krõõt Juurak) Hobusepea galeriis 17.-22. V; Jane Suviste ja Piibe Piirma näitus "Editeeritud mälu" Tallinna Linnagaleriis kuni 28. V; Andres Lõo kureeritud noortenäitus "Sex" Vaal-galeriis 2.-20. V

  5. Lu2O3-based storage phosphors. An (in)harmonious family

    NARCIS (Netherlands)

    Kulesza, Dagmara; Bolek, Paulina; Bos, A.J.J.; Zych, E

    2016-01-01

    Ceramics of Lu2O3 activated with either Tb3+ or Pr3+ and co-doped with one of the transition metal ions – Ti, Hf or Nb – were investigated for their energy storage properties. Photoluminescence, thermoluminescence (TL) and optically stimulated luminescence spectra were recorded and discussed

  6. Scintillation properties of YAlO3 doped with Lu and Nd perovskite single crystals

    Science.gov (United States)

    Akatsuka, Masaki; Usui, Yuki; Nakauchi, Daisuke; Kato, Takumi; Kawano, Naoki; Okada, Go; Kawaguchi, Noriaki; Yanagida, Takayuki

    2018-05-01

    YAlO3 (YAP) single crystals doped with Lu and Nd were grown by the Floating Zone (FZ) method to evaluate their scintillation properties particularly emissions in the near-infrared (NIR) range. The Nd concentration was fixed to 0 or 1 mol% while the Lu concentration was varied from 0 to 30%. When X-ray was irradiated, the scintillation of Nd-doped samples was observed predominantly at 1064 nm due to 4F3/2 → 4I11/2 transition of Nd3+. In contrast, a weak emission around 700 nm appeared in the samples doped with only Lu, and the emission origin was attributed to defect centers. In the Nd3+-doped samples, the decay time was 94-157 μs due to the 4f-4f transitions of Nd3+ whereas the Lu-doped samples showed signal with the decay time of 1.45-1.54 ms. The emission origin of the latter signal was attributed to the perovskite lattice defect.

  7. lu pole ainult meil, vaid ka meie haigustel / Tiina Sarv

    Index Scriptorium Estoniae

    Sarv, Tiina, 1949-

    2007-01-01

    Pärnus toimunud Eesti arstide Astra Zeneca ABC-konverentsi märksõna oli mälu. Konverentsil esinesid professorid Endel Tulving, Alan Altraja ja Anto Raukas, dotsendid Tiina Ristimäe ja Ursel Soomets, kirjandusteadlane Rutt Hinrikus, zooloog Aleksei Turovski ning arstid Anu Ambos ja Riina Kütner

  8. Specific heat and magnetism of LuFe.sub.6./sub.Al.sub.6./sub..

    Czech Academy of Sciences Publication Activity Database

    Svoboda, P.; Andreev, Alexander V.; Šantavá, Eva; Šebek, Josef

    2008-01-01

    Roč. 113, č. 1 (2008), s. 307-310 ISSN 0587-4246. [CSMAG'07. Košice, 09.07.2007-12.07.2007] Institutional research plan: CEZ:AV0Z10100520 Keywords : specific heat * LuFe 6 Al 6 Subject RIV: BM - Solid Matter Physics ; Magnetism Impact factor: 0.321, year: 2008

  9. Direct measurement of the inelastic neutron acceleration by 177mLu

    Directory of Open Access Journals (Sweden)

    Menelle A.

    2010-03-01

    Full Text Available The inelastic neutron acceleration (INNA cross section on the long-lived isomer state of 177mLu has been measured from a new isomeric target using a direct method. The detection of high energy neutrons has been performed using a specially designed setup and a cold neutron beam at the ORPHEE reactor facility in Saclay.

  10. Vene uut kunsti ühendab mälu / Teet Veispak

    Index Scriptorium Estoniae

    Veispak, Teet, 1955-

    2007-01-01

    Näitusest "Mälu tagasitulek" Kumu Kunstimuuseumis, kuraator Viktor Misiano. Lähemalt David Ter-Oganjani (sünd. 1981) tööst "Vanad loosungid", Dmitri Prigovi (sünd. 1940) videost, Juri Leidermani installatsioonist "Isa jutustus", Jevgeni Fiksi tööst "Song of Russia"

  11. Scintillation properties of a La,Lu-admix gadolinium pyrosilicate crystal

    Czech Academy of Sciences Publication Activity Database

    Kurosawa, S.; Shishido, T.; Suzuki, A.; Sugawara, T.; Nomura, A.; Yubuta, K.; Shoji, Y.; Yokota, Y.; Pejchal, Jan; Ohashi, Y.; Kamada, K.; Yoshikawa, A.

    2015-01-01

    Roč. 784, Jun (2015), s. 115-118 ISSN 0168-9002 Institutional support: RVO:68378271 Keywords : scintillator * pyrosilicate crystal * Ce-doped (La, Lu, Gd) Subject RIV: BM - Solid Matter Physics ; Magnetism Impact factor: 1.200, year: 2015

  12. Crystal fields at light rare-earth ions in Y and Lu

    DEFF Research Database (Denmark)

    Touborg, P.; Nevald, Rolf; Johansson, Torben

    1978-01-01

    Crystal-field parameters have been deduced for the light rare-earth solutes Ce, Pr, and Nd in Y or Lu hosts from measurements of the paramagnetic susceptibilities. In the analysis all multiplets in the lowest LS term were included. For a given host, crystal-field parameters divided by Stevens fac...

  13. Photoionization and photofragmentation of multiply charged Lu3N@C80 ions

    International Nuclear Information System (INIS)

    Hellhund, J; Borovik, A Jr; Holste, K; Ricz, S; Schippers, S; Müller, A; Klumpp, S; Martins, M

    2015-01-01

    Relative cross sections for photoionization and photofragmentation of endohedral fullerene Lu 3 N@C 80 q+ (q=1,2,3) ions have been measured employing the new photon-ion spectrometer PIPE at PETRA III. Prominent structures related to the carbon K-shell ionization threshold were observed in the energy range 280 to 330 eV. (paper)

  14. Wobbling phonon excitations, coexisting with normal deformed structures in 163Lu

    International Nuclear Information System (INIS)

    Jensen, D.R.; Hagemann, G.B.; Hamamoto, I.; Oedegard, S.W.; Bergstroem, M.; Herskind, B.; Sletten, G.; Toermaenen, S.; Wilson, J.N.; Tjoem, P.O.; Spohr, K.; Huebel, H.; Goergen, A.; Schoenwasser, G.; Bracco, A.; Leoni, S.; Maj, A.; Petrache, C.M.; Bednarczyk, P.; Curien, D.

    2002-01-01

    Wobbling is a rotational mode unique to a triaxial body. The Lu-Hf isotopes with N∼94 at high spin provide a possible region of nuclei with pronounced triaxiality. We have investigated 163 Lu through the fusion-evaporation reaction 139 La( 29 Si,5n) 163 Lu with a beam energy of 152 MeV. Three excited bands decaying into the known, presumably triaxial, superdeformed (TSD) band built on the i 13/2 proton orbital are observed. The electromagnetic properties of the connecting transitions from the two strongest populated excited TSD bands have been investigated. New particle-rotor calculations in which one i 13/2 quasiproton is coupled to the core of triaxial shape produce a variety of bands, whose properties can clearly be interpreted either as 'wobbling' or 'cranking' motion of the core. Evidence for the assignment of the excited TSD bands as one, and possibly even two wobbling phonon modes built on the yrast TSD band in 163 Lu is given. These triaxial bands coexist with bands built on quasiparticle excitations in the normal deformed (ND) minimum for which new data are also presented

  15. Weak antilocalization effect and noncentrosymmetric superconductivity in a topologically nontrivial semimetal LuPdBi

    KAUST Repository

    Xu, Guizhou

    2014-07-21

    A large number of half-Heusler compounds have been recently proposed as three-dimensional (3D) topological insulators (TIs) with tunable physical properties. However, no transport measurements associated with the topological surface states have been observed in these half-Heusler candidates due to the dominating contribution from bulk electrical conductance. Here we show that, by reducing the mobility of bulk carriers, a two-dimensional (2D) weak antilocalization (WAL) effect, one of the hallmarks of topological surface states, was experimentally revealed from the tilted magnetic field dependence of magnetoconductance in a topologically nontrivial semimetal LuPdBi. Besides the observation of a 2D WAL effect, a superconducting transition was revealed at T c ∼ 1.7â.K in the same bulk LuPdBi. Quantitative analysis within the framework of a generalized BCS theory leads to the conclusion that the noncentrosymmetric superconductivity of LuPdBi is fully gapped with a possibly unconventional pairing character. The co-existence of superconductivity and the transport signature of topological surface states in the same bulk alloy suggests that LuPdBi represents a very promising candidate as a topological superconductor.

  16. Lanthanide 4f-level location in AVO4:Ln3+ (A = La, Gd, Lu) crystals

    NARCIS (Netherlands)

    Krumpel, A.H.; Van der Kolk, E.; Cavalli, E.; Boutinaud, P.; Bettinelli, M.; Dorenbos, P.

    2009-01-01

    The spectral properties of LaVO4, GdVO4 and LuVO4 crystals doped with Ce3+, Pr3+, Eu3+ or Tb3+ have been investigated in order to determine the position of the energy levels relative to the valence and conduction bands of the hosts along the trivalent and divalent lanthanide series. Pr3+ and Tb3+

  17. Charge Carrier Trapping Processes in RE2O2S (RE = La, Gd, Y, and Lu)

    NARCIS (Netherlands)

    Luo, H.; Bos, A.J.J.; Dorenbos, P.

    2017-01-01

    Two different charge carrier trapping processes have been investigated in RE2O2S:Ln3+ (RE = La, Gd, Y, and Lu; Ln = Ce, Pr, and Tb) and RE2O2S:M (M = Ti4+ and Eu3+). Cerium, praseodymium and terbium act as recombination centers and hole trapping centers while host intrinsic defects provide the

  18. Problem of unstable pivots in the incomplete LU-conjugate gradient method

    International Nuclear Information System (INIS)

    Kershaw, D.S.

    1978-01-01

    Incomplete LU and incomplete-Cholesky conjugate gradient methods are becoming widely used in both laser and magnetic fusion research. In my original presentation of these methods, the problem of what to do if a pivot [L/sub ii/U/sub ii/) becomes very small or zero was raised and only partially answered by the suggestion that it be arbitrarily set to some non-zero value. In what follows it will be shown precisely how small the pivot can become before it must be fixed and precisely what value it should be set to in order to minimize the error in LU. Numerical examples will be given to show that not only does this prescription improve incomplete LU-conjugate gradient methods , but exact LU decomposition carried out with this prescription for handling small pivots and followed by a few linear or conjugate gradient iterations can be much faster than the permutations of rows and columns usually employed to circumvent small pivot problems

  19. New system for production of reactor medical radionuclides tested with Lu-176

    Czech Academy of Sciences Publication Activity Database

    Seifert, Daniel; Kropáček, Martin; Tomeš, Marek; Kučera, Jan; Lebeda, Ondřej

    2015-01-01

    Roč. 42, S (2015), s. 857-857 ISSN 1619-7070. [28th Annual congress of the European-Association-of-Nuclear-Medicine (EANM). 10.10.2015-14.10.2015, Hamburg] R&D Projects: GA MŠk(CZ) LM2011019 Institutional support: RVO:61389005 Keywords : Lu-177 * radionuclides * reactor Subject RIV: BG - Nuclear, Atomic and Molecular Physics, Colliders

  20. Unustagem kõvaketas, kasutagem operatiivmälu! / Katrin Ruus

    Index Scriptorium Estoniae

    Ruus, Katrin

    2008-01-01

    Valik Mart Viljuse, Katrin Teesi, Piret Räni, Reimo Võsa-Tangsoo, Merle ja Erki Kannuse ning rühmituste Puhas Rõõm ja Infotankistid viimaste aastate töödest näituseprojektina "Operatiivmälu" Pärnu Kunstnike Maja galeriis ja Pärnu Linnagaleriis. 11 ill

  1. Effects of therapy with [177Lu-DOTA0,Tyr3]octreotate on endocrine function

    International Nuclear Information System (INIS)

    Teunissen, Jaap J.M.; Kwekkeboom, Dik J.; Krenning, Eric P.; Jong, Frank H. de; Feelders, Richard A.; Aken, Maarten O. van; Herder, Wouter W. de; Rijke, Yolanda B. de

    2009-01-01

    Peptide receptor radionuclide therapy (PRRT) with radiolabelled somatostatin analogues is a novel therapy for patients with somatostatin receptor-positive tumours. We determined the effects of PRRT with [ 177 Lu-DOTA 0 ,Tyr 3 ]octreotate ( 177 Lu-octreotate) on glucose homeostasis and the pituitary-gonadal, pituitary-thyroid and pituitary-adrenal axes. Hormone levels were measured and adrenal function assessed at baseline and up to 24 months of follow-up. In 35 men, mean serum inhibin B levels were decreased at 3 months post-therapy (205 ± 16 to 25 ± 4 ng/l, p 4 ) levels decreased (17.7 ± 0.4 to 15.6 ± 0.6 pmol/l, p 3 ) levels did not change. Reverse triiodothyronine (rT 3 ) levels decreased (0.38 ± 0.03 to 0.30 ± 0.01 nmol/l, p 550 nmol/l, n = 18). Five patients developed elevated HbA 1c levels (> 6.5%). In men 177 Lu-octreotate therapy induced transient inhibitory effects on spermatogenesis, but non-SHBG-bound T levels remained unaffected. In the long term, gonadotropin levels decreased significantly in postmenopausal women. Only a few patients developed hypothyroidism or elevated levels of HbA 1c . Therefore, PRRT with 177 Lu-octreotate can be regarded as a safe treatment modality with respect to short- and long-term endocrine function. (orig.)

  2. High efficiency laser action in mildly doped Yb:LuYAG ceramics

    Czech Academy of Sciences Publication Activity Database

    Pirri, A.; Toci, G.; Li, J.; Xie, T.; Pan, Y.; Babin, Vladimir; Beitlerová, Alena; Nikl, Martin; Vannini, M.

    2017-01-01

    Roč. 73, Nov (2017), s. 312-318 ISSN 0925-3467 Institutional support: RVO:68378271 Keywords : laser ceramic s * Yb laser * mixed garnets * LuYAG Subject RIV: BM - Solid Matter Physics ; Magnetism OBOR OECD: Condensed matter physics (including formerly solid state physics, supercond.) Impact factor: 2.238, year: 2016

  3. Optical, luminescence and scintillation characteristics of non-stoichiometric LuAG:Ce ceramics

    Czech Academy of Sciences Publication Activity Database

    Liu, S.; Feng, X.; Mareš, Jiří A.; Babin, Vladimir; Nikl, Martin; Beitlerová, Alena; Shi, Y.; Zeng, Y.; Pan, Y.; D'Ambrosio, C.; Huang, Y.

    2016-01-01

    Roč. 169, Jan (2016), s. 72-77 ISSN 0022-2313 R&D Projects: GA ČR GAP204/12/0805 Institutional support: RVO:68378271 Keywords : non-stoichimetric LuAG:Ce ceramic s * radioluminescence * scintillation response * anti-site defects Subject RIV: BM - Solid Matter Physics ; Magnetism Impact factor: 2.686, year: 2016

  4. Dentate Gyrus circuitry features improve performance of sparse approximation algorithms.

    Directory of Open Access Journals (Sweden)

    Panagiotis C Petrantonakis

    Full Text Available Memory-related activity in the Dentate Gyrus (DG is characterized by sparsity. Memory representations are seen as activated neuronal populations of granule cells, the main encoding cells in DG, which are estimated to engage 2-4% of the total population. This sparsity is assumed to enhance the ability of DG to perform pattern separation, one of the most valuable contributions of DG during memory formation. In this work, we investigate how features of the DG such as its excitatory and inhibitory connectivity diagram can be used to develop theoretical algorithms performing Sparse Approximation, a widely used strategy in the Signal Processing field. Sparse approximation stands for the algorithmic identification of few components from a dictionary that approximate a certain signal. The ability of DG to achieve pattern separation by sparsifing its representations is exploited here to improve the performance of the state of the art sparse approximation algorithm "Iterative Soft Thresholding" (IST by adding new algorithmic features inspired by the DG circuitry. Lateral inhibition of granule cells, either direct or indirect, via mossy cells, is shown to enhance the performance of the IST. Apart from revealing the potential of DG-inspired theoretical algorithms, this work presents new insights regarding the function of particular cell types in the pattern separation task of the DG.

  5. Superresolving Black Hole Images with Full-Closure Sparse Modeling

    Science.gov (United States)

    Crowley, Chelsea; Akiyama, Kazunori; Fish, Vincent

    2018-01-01

    It is believed that almost all galaxies have black holes at their centers. Imaging a black hole is a primary objective to answer scientific questions relating to relativistic accretion and jet formation. The Event Horizon Telescope (EHT) is set to capture images of two nearby black holes, Sagittarius A* at the center of the Milky Way galaxy roughly 26,000 light years away and the other M87 which is in Virgo A, a large elliptical galaxy that is 50 million light years away. Sparse imaging techniques have shown great promise for reconstructing high-fidelity superresolved images of black holes from simulated data. Previous work has included the effects of atmospheric phase errors and thermal noise, but not systematic amplitude errors that arise due to miscalibration. We explore a full-closure imaging technique with sparse modeling that uses closure amplitudes and closure phases to improve the imaging process. This new technique can successfully handle data with systematic amplitude errors. Applying our technique to synthetic EHT data of M87, we find that full-closure sparse modeling can reconstruct images better than traditional methods and recover key structural information on the source, such as the shape and size of the predicted photon ring. These results suggest that our new approach will provide superior imaging performance for data from the EHT and other interferometric arrays.

  6. Robust visual tracking via multiscale deep sparse networks

    Science.gov (United States)

    Wang, Xin; Hou, Zhiqiang; Yu, Wangsheng; Xue, Yang; Jin, Zefenfen; Dai, Bo

    2017-04-01

    In visual tracking, deep learning with offline pretraining can extract more intrinsic and robust features. It has significant success solving the tracking drift in a complicated environment. However, offline pretraining requires numerous auxiliary training datasets and is considerably time-consuming for tracking tasks. To solve these problems, a multiscale sparse networks-based tracker (MSNT) under the particle filter framework is proposed. Based on the stacked sparse autoencoders and rectifier linear unit, the tracker has a flexible and adjustable architecture without the offline pretraining process and exploits the robust and powerful features effectively only through online training of limited labeled data. Meanwhile, the tracker builds four deep sparse networks of different scales, according to the target's profile type. During tracking, the tracker selects the matched tracking network adaptively in accordance with the initial target's profile type. It preserves the inherent structural information more efficiently than the single-scale networks. Additionally, a corresponding update strategy is proposed to improve the robustness of the tracker. Extensive experimental results on a large scale benchmark dataset show that the proposed method performs favorably against state-of-the-art methods in challenging environments.

  7. An Improved Information Hiding Method Based on Sparse Representation

    Directory of Open Access Journals (Sweden)

    Minghai Yao

    2015-01-01

    Full Text Available A novel biometric authentication information hiding method based on the sparse representation is proposed for enhancing the security of biometric information transmitted in the network. In order to make good use of abundant information of the cover image, the sparse representation method is adopted to exploit the correlation between the cover and biometric images. Thus, the biometric image is divided into two parts. The first part is the reconstructed image, and the other part is the residual image. The biometric authentication image cannot be restored by any one part. The residual image and sparse representation coefficients are embedded into the cover image. Then, for the sake of causing much less attention of attackers, the visual attention mechanism is employed to select embedding location and embedding sequence of secret information. Finally, the reversible watermarking algorithm based on histogram is utilized for embedding the secret information. For verifying the validity of the algorithm, the PolyU multispectral palmprint and the CASIA iris databases are used as biometric information. The experimental results show that the proposed method exhibits good security, invisibility, and high capacity.

  8. Two-dimensional sparse wavenumber recovery for guided wavefields

    Science.gov (United States)

    Sabeti, Soroosh; Harley, Joel B.

    2018-04-01

    The multi-modal and dispersive behavior of guided waves is often characterized by their dispersion curves, which describe their frequency-wavenumber behavior. In prior work, compressive sensing based techniques, such as sparse wavenumber analysis (SWA), have been capable of recovering dispersion curves from limited data samples. A major limitation of SWA, however, is the assumption that the structure is isotropic. As a result, SWA fails when applied to composites and other anisotropic structures. There have been efforts to address this issue in the literature, but they either are not easily generalizable or do not sufficiently express the data. In this paper, we enhance the existing approaches by employing a two-dimensional wavenumber model to account for direction-dependent velocities in anisotropic media. We integrate this model with tools from compressive sensing to reconstruct a wavefield from incomplete data. Specifically, we create a modified two-dimensional orthogonal matching pursuit algorithm that takes an undersampled wavefield image, with specified unknown elements, and determines its sparse wavenumber characteristics. We then recover the entire wavefield from the sparse representations obtained with our small number of data samples.

  9. Low-Rank Sparse Coding for Image Classification

    KAUST Repository

    Zhang, Tianzhu; Ghanem, Bernard; Liu, Si; Xu, Changsheng; Ahuja, Narendra

    2013-01-01

    In this paper, we propose a low-rank sparse coding (LRSC) method that exploits local structure information among features in an image for the purpose of image-level classification. LRSC represents densely sampled SIFT descriptors, in a spatial neighborhood, collectively as low-rank, sparse linear combinations of code words. As such, it casts the feature coding problem as a low-rank matrix learning problem, which is different from previous methods that encode features independently. This LRSC has a number of attractive properties. (1) It encourages sparsity in feature codes, locality in codebook construction, and low-rankness for spatial consistency. (2) LRSC encodes local features jointly by considering their low-rank structure information, and is computationally attractive. We evaluate the LRSC by comparing its performance on a set of challenging benchmarks with that of 7 popular coding and other state-of-the-art methods. Our experiments show that by representing local features jointly, LRSC not only outperforms the state-of-the-art in classification accuracy but also improves the time complexity of methods that use a similar sparse linear representation model for feature coding.

  10. On A Nonlinear Generalization of Sparse Coding and Dictionary Learning.

    Science.gov (United States)

    Xie, Yuchen; Ho, Jeffrey; Vemuri, Baba

    2013-01-01

    Existing dictionary learning algorithms are based on the assumption that the data are vectors in an Euclidean vector space ℝ d , and the dictionary is learned from the training data using the vector space structure of ℝ d and its Euclidean L 2 -metric. However, in many applications, features and data often originated from a Riemannian manifold that does not support a global linear (vector space) structure. Furthermore, the extrinsic viewpoint of existing dictionary learning algorithms becomes inappropriate for modeling and incorporating the intrinsic geometry of the manifold that is potentially important and critical to the application. This paper proposes a novel framework for sparse coding and dictionary learning for data on a Riemannian manifold, and it shows that the existing sparse coding and dictionary learning methods can be considered as special (Euclidean) cases of the more general framework proposed here. We show that both the dictionary and sparse coding can be effectively computed for several important classes of Riemannian manifolds, and we validate the proposed method using two well-known classification problems in computer vision and medical imaging analysis.

  11. Low-Rank Sparse Coding for Image Classification

    KAUST Repository

    Zhang, Tianzhu

    2013-12-01

    In this paper, we propose a low-rank sparse coding (LRSC) method that exploits local structure information among features in an image for the purpose of image-level classification. LRSC represents densely sampled SIFT descriptors, in a spatial neighborhood, collectively as low-rank, sparse linear combinations of code words. As such, it casts the feature coding problem as a low-rank matrix learning problem, which is different from previous methods that encode features independently. This LRSC has a number of attractive properties. (1) It encourages sparsity in feature codes, locality in codebook construction, and low-rankness for spatial consistency. (2) LRSC encodes local features jointly by considering their low-rank structure information, and is computationally attractive. We evaluate the LRSC by comparing its performance on a set of challenging benchmarks with that of 7 popular coding and other state-of-the-art methods. Our experiments show that by representing local features jointly, LRSC not only outperforms the state-of-the-art in classification accuracy but also improves the time complexity of methods that use a similar sparse linear representation model for feature coding.

  12. Efficient MATLAB computations with sparse and factored tensors.

    Energy Technology Data Exchange (ETDEWEB)

    Bader, Brett William; Kolda, Tamara Gibson (Sandia National Lab, Livermore, CA)

    2006-12-01

    In this paper, the term tensor refers simply to a multidimensional or N-way array, and we consider how specially structured tensors allow for efficient storage and computation. First, we study sparse tensors, which have the property that the vast majority of the elements are zero. We propose storing sparse tensors using coordinate format and describe the computational efficiency of this scheme for various mathematical operations, including those typical to tensor decomposition algorithms. Second, we study factored tensors, which have the property that they can be assembled from more basic components. We consider two specific types: a Tucker tensor can be expressed as the product of a core tensor (which itself may be dense, sparse, or factored) and a matrix along each mode, and a Kruskal tensor can be expressed as the sum of rank-1 tensors. We are interested in the case where the storage of the components is less than the storage of the full tensor, and we demonstrate that many elementary operations can be computed using only the components. All of the efficiencies described in this paper are implemented in the Tensor Toolbox for MATLAB.

  13. Potential renal toxicity bio-markers indicating radiation injury after 177Lu-octreotate treatment

    International Nuclear Information System (INIS)

    Dalmo, J.; Forssell-Aronsson, E.; Westberg, E.; Toernqvist, M.; Svedborn, L.; Barregaerd, L.

    2015-01-01

    Full text of publication follows. The kidneys are one of the most exposed non-tumor tissues and regarded as one of the main dose-limiting organs in peptide receptor radionuclide therapy (PRRT). [ 177 Lu-DOTA0, Tyr3]-octreotate ( 177 Lu-octreotate) has shown promising results in the treatment of somatostatin receptor over-expressing neuroendocrine tumors, but optimization is still needed. The ability to give each patient as much 177 Lu-octreotate as possible without inducing nephrotoxicity is necessary for an efficient treatment. However, due to large inter-individual differences in uptake and retention in the kidneys, there is a need for efficient methods that can indicate renal injury early. A possible way is to identify bio-markers for high risk of radiation nephrotoxicity. The aim of this study was to investigate the potential of using urinary retinol binding protein (RBP), and blood valinhydantoin (VH) as bio-markers of nephrotoxicity on adult mice after 177 Lu-octreotate treatment. BALB/c nude mice (n=6/group) were i.v. injected with 60 MBq or 120 MBq of 177 Lu-octreotate. The control group was mock treated with saline. Spot urine samples were collected before injection, and 14, 30, 60 and 90 days after injection. Analysis of RBP4 and creatinine was performed using Mouse RBP4 ELISA kit and Creatinine kit from R/D Systems, respectively. Erythrocytes were separated from whole blood samples collected 90 days after injection, and analysed for VH by LC-MS/MS. The ratio between VH and a volumetric standard was calculated. The RBP/creatinine level increased with time in both groups given 177 Lu-octreotate, with earlier and higher response for the 120 MBq group. No clear change in VH level between the different groups was observed. The results show that RBP may be a promising new bio-marker for radiation induced kidney toxicity. The presently used method based on VH was not sensitive enough to be used as kidney toxicity marker. Further studies on mice are ongoing to

  14. In Vitro comparison of 213Bi- and 177Lu-radiation for peptide receptor radionuclide therapy.

    Science.gov (United States)

    Chan, Ho Sze; de Blois, Erik; Morgenstern, Alfred; Bruchertseifer, Frank; de Jong, Marion; Breeman, Wouter; Konijnenberg, Mark

    2017-01-01

    Absorbed doses for α-emitters are different from those for β-emitters, as the high linear energy transfer (LET) nature of α-particles results in a very dense energy deposition over a relatively short path length near the point of emission. This highly localized and therefore high energy deposition can lead to enhanced cell-killing effects at absorbed doses that are non-lethal in low-LET type of exposure. Affinities of DOTA-DPhe1-Tyr3-octreotate (DOTATATE), 115In-DOTATATE, 175Lu-DOTATATE and 209Bi-DOTATATE were determined in the K562-SST2 cell line. Two other cell lines were used for radiation response assessment; BON and CA20948, with a low and high expression of somatostatin receptors, respectively. Cellular uptake kinetics of 111In-DOTATATE were determined in CA20948 cells. CA20948 and BON were irradiated with 137Cs, 177Lu-DTPA, 177Lu-DOTATATE, 213Bi-DTPA and 213Bi-DOTATATE. Absorbed doses were calculated using the MIRDcell dosimetry method for the specific binding and a Monte Carlo model of a cylindrical 6-well plate geometry for the exposure by the radioactive incubation medium. Absorbed doses were compared to conventional irradiation of cells with 137Cs and the relative biological effect (RBE) at 10% survival was calculated. IC50 of (labelled) DOTATATE was in the nM range. Absorbed doses up to 7 Gy were obtained by 5.2 MBq 213Bi-DOTATATE, in majority the dose was caused by α-particle radiation. Cellular internalization determined with 111In-DOTATATE showed a linear relation with incubation time. Cell survival after exposure of 213Bi-DTPA and 213Bi-DOTATATE to BON or CA20948 cells showed a linear-exponential relation with the absorbed dose, confirming the high LET character of 213Bi. The survival of CA20948 after exposure to 177Lu-DOTATATE and the reference 137Cs irradiation showed the typical curvature of the linear-quadratic model. 10% Cell survival of CA20948 was reached at 3 Gy with 213Bi-DOTATATE, a factor 6 lower than the 18 Gy found for 177Lu

  15. In Vitro comparison of 213Bi- and 177Lu-radiation for peptide receptor radionuclide therapy.

    Directory of Open Access Journals (Sweden)

    Ho Sze Chan

    Full Text Available Absorbed doses for α-emitters are different from those for β-emitters, as the high linear energy transfer (LET nature of α-particles results in a very dense energy deposition over a relatively short path length near the point of emission. This highly localized and therefore high energy deposition can lead to enhanced cell-killing effects at absorbed doses that are non-lethal in low-LET type of exposure. Affinities of DOTA-DPhe1-Tyr3-octreotate (DOTATATE, 115In-DOTATATE, 175Lu-DOTATATE and 209Bi-DOTATATE were determined in the K562-SST2 cell line. Two other cell lines were used for radiation response assessment; BON and CA20948, with a low and high expression of somatostatin receptors, respectively. Cellular uptake kinetics of 111In-DOTATATE were determined in CA20948 cells. CA20948 and BON were irradiated with 137Cs, 177Lu-DTPA, 177Lu-DOTATATE, 213Bi-DTPA and 213Bi-DOTATATE. Absorbed doses were calculated using the MIRDcell dosimetry method for the specific binding and a Monte Carlo model of a cylindrical 6-well plate geometry for the exposure by the radioactive incubation medium. Absorbed doses were compared to conventional irradiation of cells with 137Cs and the relative biological effect (RBE at 10% survival was calculated.IC50 of (labelled DOTATATE was in the nM range. Absorbed doses up to 7 Gy were obtained by 5.2 MBq 213Bi-DOTATATE, in majority the dose was caused by α-particle radiation. Cellular internalization determined with 111In-DOTATATE showed a linear relation with incubation time. Cell survival after exposure of 213Bi-DTPA and 213Bi-DOTATATE to BON or CA20948 cells showed a linear-exponential relation with the absorbed dose, confirming the high LET character of 213Bi. The survival of CA20948 after exposure to 177Lu-DOTATATE and the reference 137Cs irradiation showed the typical curvature of the linear-quadratic model. 10% Cell survival of CA20948 was reached at 3 Gy with 213Bi-DOTATATE, a factor 6 lower than the 18 Gy found

  16. Cation sorption at the smectite edges: From transition metals to Y and Lu

    International Nuclear Information System (INIS)

    Schlegel, M.L.

    2007-01-01

    Complete text of publication follows: Introduction: Clay minerals can adsorb trace elements in soils and weathering formations, a sorption property which is also a key-point for the use of clay materials in nuclear waste repositories. Retention can occur either by adsorption on the clay basal plane or at the layer edges, depending on physicochemical conditions. Building on previous identification of sorption sites of transition metals [1-3], this study shows how the geometry of Y and Lu surface complexes on layer edges of clay minerals can be identified. Materials and methods: Suspensions of purified clay minerals (hectorite or Al-montmorillonite, 2 and 1 g/L, respectively) were reacted in 0.5 M NaCl at pH 6 (Al-montmorillonite) and 7 (hectorite) with sorbates at concentrations of 50 μM (Y) and 100 μM (Lu). Self-supporting films of reacted clay minerals were obtained by slowly filtering suspension aliquots on cellulose nitrate filters. Yttrium K-edge and Lu L3-edge polarized EXAFS (PEXAFS) spectra of the self-supporting films were collected in fluorescence mode on the FAME beamline (ESRF, France). PEXAFS data were reduced, and analyzed using standard procedures. Results and interpretation: Small but significant angular dependences were observed for all P-EXAFS data, meaning that the Y and Lu binding environments are anisotropic. Coordination spheres of 7 O at 2.36 Angstroms and 8 O at 2.27 Angstroms, were observed for Y and Lu, respectively, comparable with d(Ln-O) distances measured by EXAFS spectroscopy [4]. Lutetium sorbed on Al-montmorillonite was surrounded by an Al-shell at 3.35 Angstroms, consistent with Lu sharing edges with Al octahedra and partially incorporated in a gibbsite-like interlayer. Both Y and Lu sorbed on hectorite were surrounded by cationic shells. Modelling of these cationic contributions yielded one out-of-plane Si/Mg shell at 3.16 Angstroms (Y) or 3.04 Angstroms (Lu), and two in-plane (Mg/Si) shells at 3.50, and 3.97 Angstroms for Y, or

  17. Cation sorption at the smectite edges: From transition metals to Y and Lu

    Energy Technology Data Exchange (ETDEWEB)

    Schlegel, M.L. [CEA/DANS/DPC/SCP Lab React Surfaces and Interfaces, F-91191 Gif Sur Yvette (France)

    2007-07-01

    Complete text of publication follows: Introduction: Clay minerals can adsorb trace elements in soils and weathering formations, a sorption property which is also a key-point for the use of clay materials in nuclear waste repositories. Retention can occur either by adsorption on the clay basal plane or at the layer edges, depending on physicochemical conditions. Building on previous identification of sorption sites of transition metals [1-3], this study shows how the geometry of Y and Lu surface complexes on layer edges of clay minerals can be identified. Materials and methods: Suspensions of purified clay minerals (hectorite or Al-montmorillonite, 2 and 1 g/L, respectively) were reacted in 0.5 M NaCl at pH 6 (Al-montmorillonite) and 7 (hectorite) with sorbates at concentrations of 50 {mu}M (Y) and 100 {mu}M (Lu). Self-supporting films of reacted clay minerals were obtained by slowly filtering suspension aliquots on cellulose nitrate filters. Yttrium K-edge and Lu L3-edge polarized EXAFS (PEXAFS) spectra of the self-supporting films were collected in fluorescence mode on the FAME beamline (ESRF, France). PEXAFS data were reduced, and analyzed using standard procedures. Results and interpretation: Small but significant angular dependences were observed for all P-EXAFS data, meaning that the Y and Lu binding environments are anisotropic. Coordination spheres of 7 O at 2.36 Angstroms and 8 O at 2.27 Angstroms, were observed for Y and Lu, respectively, comparable with d(Ln-O) distances measured by EXAFS spectroscopy [4]. Lutetium sorbed on Al-montmorillonite was surrounded by an Al-shell at 3.35 Angstroms, consistent with Lu sharing edges with Al octahedra and partially incorporated in a gibbsite-like interlayer. Both Y and Lu sorbed on hectorite were surrounded by cationic shells. Modelling of these cationic contributions yielded one out-of-plane Si/Mg shell at 3.16 Angstroms (Y) or 3.04 Angstroms (Lu), and two in-plane (Mg/Si) shells at 3.50, and 3.97 Angstroms for Y

  18. Phase stabilization in transparent Lu2O3:Eu ceramics by lattice expansion

    Science.gov (United States)

    Seeley, Z. M.; Dai, Z. R.; Kuntz, J. D.; Cherepy, N. J.; Payne, S. A.

    2012-11-01

    Gadolinium lutetium oxide transparent ceramics doped with europium (Gd,Lu)2O3:Eu were fabricated via vacuum sintering and hot isostatic pressing (HIP). Nano-scale starting powder with the composition GdxLu1.9-xEu0.1O3 (x = 0, 0.3, 0.6, 0.9, 1.0, and 1.1) were uniaxially pressed and sintered under high vacuum at 1625 °C to obtain ˜97% dense structures with closed porosity. Sintered compacts were then subjected to 200 MPa argon gas at temperatures between 1750 and 1900 °C to reach full density. It was observed that a small portion of the Eu3+ ions were exsolved from the Lu2O3 cubic crystal lattice and concentrated at the grain boundaries, where they precipitated into a secondary monoclinic phase creating optical scattering defects. Addition of Gd3+ ions into the Lu2O3 cubic lattice formed the solid solution (Gd,Lu)2O3:Eu and stretched the lattice parameter allowing the larger Eu3+ ions to stay in solid solution, reducing the secondary phase and improving the transparency of the ceramics. Excess gadolinium, however, resulted in a complete phase transformation to monoclinic at pressures and temperatures sufficient for densification. Light yield performance was measured and all samples show equal amounts of the characteristic Eu3+ luminescence, indicating gadolinium addition had no adverse effect. This material has potential to improve the performance of high energy radiography devices.

  19. Fast Solution in Sparse LDA for Binary Classification

    Science.gov (United States)

    Moghaddam, Baback

    2010-01-01

    An algorithm that performs sparse linear discriminant analysis (Sparse-LDA) finds near-optimal solutions in far less time than the prior art when specialized to binary classification (of 2 classes). Sparse-LDA is a type of feature- or variable- selection problem with numerous applications in statistics, machine learning, computer vision, computational finance, operations research, and bio-informatics. Because of its combinatorial nature, feature- or variable-selection problems are NP-hard or computationally intractable in cases involving more than 30 variables or features. Therefore, one typically seeks approximate solutions by means of greedy search algorithms. The prior Sparse-LDA algorithm was a greedy algorithm that considered the best variable or feature to add/ delete to/ from its subsets in order to maximally discriminate between multiple classes of data. The present algorithm is designed for the special but prevalent case of 2-class or binary classification (e.g. 1 vs. 0, functioning vs. malfunctioning, or change versus no change). The present algorithm provides near-optimal solutions on large real-world datasets having hundreds or even thousands of variables or features (e.g. selecting the fewest wavelength bands in a hyperspectral sensor to do terrain classification) and does so in typical computation times of minutes as compared to days or weeks as taken by the prior art. Sparse LDA requires solving generalized eigenvalue problems for a large number of variable subsets (represented by the submatrices of the input within-class and between-class covariance matrices). In the general (fullrank) case, the amount of computation scales at least cubically with the number of variables and thus the size of the problems that can be solved is limited accordingly. However, in binary classification, the principal eigenvalues can be found using a special analytic formula, without resorting to costly iterative techniques. The present algorithm exploits this analytic

  20. Crystal growth, spectroscopic and CW laser properties of Nd0.03Lu2.871Gd0.099Al5O12 crystal

    Science.gov (United States)

    Di, J. Q.; Xu, X. D.; Cheng, S. S.; Li, D. Z.; Zhou, D. H.; Wu, F.; Zhao, Z. W.; Xu, J.

    2011-11-01

    Nd0.03Lu2.871Gd0.099Al5O12 (Nd:LuGdAG) crystal was grown by the Czochralski method. The absorption, fluorescence spectra and fluorescence lifetime of Nd:LuGdAG crystal at room temperature were investigated for the first time. We reported the continuous-wave (CW) Nd:LuGdAG laser operation under diode pumping. Output power of 1.43 W at 1064 nm was achieved with a slope efficiency of 34.1%. All the results show that Nd:LuGdAG crystal is a promising laser material.