9 research outputs found

    Low-field magnetoresistance in La<inf>0.7</inf>Ca<inf>0.3</inf>MnO <inf>3</inf> manganite compounds prepared by the spray drying technique

    No full text
    Calcium-substituted lanthanum manganite compounds were synthesized by the spray drying technique. This method - whose main advantages are versatility, high reproducibility and scalability - yields small grain materials of high homogeneity and displaying low-field magnetoresistance effects. We report about the physical and chemical characterizations of these samples in order to investigate the potential interest of spray drying for the production of materials for low-field magnetoresistance applications. We have studied the dependence of the low-field magnetoresistance on the temperature and duration of the thermal treatment applied to the pelletized powders. The issue of the shape anisotropy (demagnetisation effects) influence on the magnetoresistance properties has also been dealt with. © 2005 Springer Science + Business Media, Inc

    Graph Partitioning Algorithms With Applications To Scientific Computing

    No full text
    Identifying the parallelism in a problem by partitioning its data and tasks among the processors of a parallel computer is a fundamental issue in parallel computing. This problem can be modeled as a graph partitioning problem in which the vertices of a graph are divided into a specified number of subsets such that few edges join two vertices in different subsets. Several new graph partitioning algorithms have been developed in the past few years, and we survey some of this activity. We describe the terminology associated with graph partitioning, the complexity of computing good separators, and graphs that have good separators. We then discuss early algorithms for graph partitioning, followed by three new algorithms based on geometric, algebraic, and multilevel ideas. The algebraic algorithm relies on an eigenvector of a Laplacian matrix associated with the graph to compute the partition. The algebraic algorithm is justified by formulating graph partitioning as a quadratic assignment p..
    corecore