Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed algorithm”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,639 records · Page 91

Lung dosimetry in a linac-MRI radiotherapy unit with a longitudinal magnetic field

Purpose: There is interest in developing linac-MR systems for MRI-guided radiation therapy. To date, the designs for such linac-MR devices have been restricted to a transverse geometry where the static magnetic field is oriented perpendicular to the direction of the incident photon beam. This work extends possibilities in this field by proposing and examining by Monte Carlo simulations, a probable longitudinal configuration where the magnetic field is oriented in the same direction as the photon beam. Methods: The EGSnrc Monte Carlo (MC) radiation transport codes with algorithms implemented to account for the magnetic field deflection of charged particles were used to compare dose distributions for linac-MR systems in transverse and longitudinal geometries. Specifically, the responses to a 6 MV pencil photon beam incident on water and lung slabs were investigated for 1.5 and 3.0 T magnetic fields. Further a five field lung plan was simulated in the longitudinal and transverse geometries across a range of magnetic field strengths from 0.2 through 3.0 T. Results: In a longitudinal geometry, the magnetic field is shown to restrict the radial spread of secondary electrons to a small degree in water, but significantly in low density tissues such as lung in contrast to the lateral shift in dose distribution seen in the transverse geometry. These effects extend to the patient case, where the longitudinal configuration demonstrated dose distributions more tightly confined to the primary photon fields, which increased dose to the planning target volume (PTV), bettered dose homogeneity within a heterogeneous (in density) PTV, and reduced the tissue interface effects associated with the transverse geometry. Conclusions: Dosimetry issues observed in a transverse linac-MR geometry such as changes to the depth dose distribution and tissue interface effects were significantly reduced or eliminated in a longitudinal geometry on a representative lung plan. Further, an increase in dose to the PTV, resulting from the magnetic field confining electrons to the forward direction, shows potential for a reduction in dose to the surrounding tissues.

61 RADIATION PROTECTION AND DOSIMETRY↗

Fast Generation of Ensembles of Cosmological N-Body Simulations via Mode-Resampling

We present an algorithm for quickly generating multiple realizations of N-body simulations to be used, for example, for cosmological parameter estimation from surveys of large-scale structure. Our algorithm uses a new method to resample the large-scale (Gaussian-distributed) Fourier modes in a periodic N-body simulation box in a manner that properly accounts for the nonlinear mode-coupling between large and small scales. We find that our method for adding new large-scale mode realizations recovers the nonlinear power spectrum to sub-percent accuracy on scales larger than about half the Nyquist frequency of the simulation box. Using 20 N-body simulations, we obtain a power spectrum covariance matrix estimate that matches the estimator from Takahashi et al. (from 5000 simulations) with < 20% errors in all matrix elements. Comparing the rates of convergence, we determine that our algorithm requires {approx}8 times fewer simulations to achieve a given error tolerance in estimates of the power spectrum covariance matrix. The degree of success of our algorithm indicates that we understand the main physical processes that give rise to the correlations in the matter power spectrum. Namely, the large-scale Fourier modes modulate both the degree of structure growth through the variation in the effective local matter density and also the spatial frequency of small-scale perturbations through large-scale displacements. We expect our algorithm to be useful for noise modeling when constraining cosmological parameters from weak lensing (cosmic shear) and galaxy surveys, rescaling summary statistics of N-body simulations for new cosmological parameter values, and any applications where the influence of Fourier modes larger than the simulation size must be accounted for.

79 ASTRONOMY AND ASTROPHYSICS↗

Simulation and Estimation of Extreme Quantiles and Extreme Probabilities

Let X be a random vector with distribution {mu} on Double-Struck-Capital-R {sup d} and {Phi} be a mapping from Double-Struck-Capital-R {sup d} to Double-Struck-Capital-R . That mapping acts as a black box, e.g., the result from some computer experiments for which no analytical expression is available. This paper presents an efficient algorithm to estimate a tail probability given a quantile or a quantile given a tail probability. The algorithm improves upon existing multilevel splitting methods and can be analyzed using Poisson process tools that lead to exact description of the distribution of the estimated probabilities and quantiles. The performance of the algorithm is demonstrated in a problem related to digital watermarking.

97 MATHEMATICS AND COMPUTING↗

Scalla: Structured Cluster Architecture for Low Latency Access

Scalla is a distributed low-latency file access system that incorporates novel techniques that minimize latency and maximize scalability over a large distributed system with a distributed namespace. Scalla's techniques have shown to be effective in nearly a decade of service for the high-energy physics community using commodity hardware and interconnects. We describe the two components used in Scalla that are instrumental in its ability to provide low-latency, fault-tolerant name resolution and load distribution, and enable its use as a high-throughput, low-latency communication layer in the Qserv system, the Large Synoptic Survey Telescope's (LSST's) prototype astronomical query system. Scalla arguably exceeded its three main design objectives: low latency, scaling, and recoverability. In retrospect, these objectives were met using a simple but effective design. Low latency was met by uniformly using linear or constant time algorithms in all high-use paths, avoiding locks whenever possible, and using compact data structures to maximize the memory caching efficiency. Scaling was achieved by architecting the system as a 64-ary tree. Nodes can be added easily and as the number of nodes increases, search performance increases at an exponential rate. Recoverability is inherent in that no permanent state information is maintained and whatever state information is needed it can be quickly constructed or reconstructed in real time. This allows dynamic changes in a cluster of servers with little impact on over-all performance or usability. Today, Scalla is being deployed in environments and for uses that were never conceived in 2001. This speaks well for the systems adaptability but the underlying reason is that the system can meet its three fundamental objectives at the same time.

99 GENERAL AND MISCELLANEOUS↗

Paradeisos: A perfect hashing algorithm for many-body eigenvalue problems

Here, we describe an essentially perfect hashing algorithm for calculating the position of an element in an ordered list, appropriate for the construction and manipulation of many-body Hamiltonian, sparse matrices. Each element of the list corresponds to an integer value whose binary representation reflects the occupation of single-particle basis states for each element in the many-body Hilbert space. The algorithm replaces conventional methods, such as binary search, for locating the elements of the ordered list, eliminating the need to store the integer representation for each element, without increasing the computational complexity. Combined with the “checkerboard” decomposition of the Hamiltonian matrix for distribution over parallel computing environments, this leads to a substantial savings in aggregate memory. While the algorithm can be applied broadly to many-body, correlated problems, we demonstrate its utility in reducing total memory consumption for a series of fermionic single-band Hubbard model calculations on small clusters with progressively larger Hilbert space dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A SPITZER SURVEY OF YOUNG STELLAR CLUSTERS WITHIN ONE KILOPARSEC OF THE SUN: CLUSTER CORE EXTRACTION AND BASIC STRUCTURAL ANALYSIS

We present a uniform mid-infrared imaging and photometric survey of 36 young, nearby, star-forming clusters and groups using Spitzer IRAC and MIPS. We have confidently identified and classified 2548 young stellar objects (YSOs) using recently established mid-infrared color-based methods. We have devised and applied a new algorithm for the isolation of local surface density enhancements from point source distributions, enabling us to extract the overdense cores of the observed star-forming regions for further analysis. We have compiled several basic structural measurements of these cluster cores from the data, such as mean surface densities of sources, cluster core radii, and aspect ratios, in order to characterize the ranges for these quantities. We find that a typical cluster core is 0.39 pc in radius, has 26 members with infrared excess in a ratio of Class II to Class I sources of 3.7, is embedded in a A{sub K} = 0.8 mag cloud clump, and has a surface density of 60 pc{sup -2}. We examine the nearest neighbor distances among the YSOs in several ways, demonstrating similarity in the spacings between Class II and Class I sources but large member clusters appear more dense than smaller clusters. We demonstrate that near-uniform source spacings in cluster cores are common, suggesting that simple Jeans fragmentation of parsec-scale cloud clumps may be the dominant process governing star formation in nearby clusters and groups. Finally, we compare our results to other similar surveys in the literature and discuss potential biases in the data to guide further interpretation.

79 ASTRONOMY AND ASTROPHYSICS↗

3-D Deep Penetration Neutron Imaging of Thick Absorgin and Diffusive Objects Using Transport Theory

A current area of research interest in national security is to effectively and efficiently determine the contents of the many shipping containers that enter ports in the United States. This interest comes as a result of the 9/11 Commission Act passed by Congress in 2007 that requires 100% of inbound cargo to be scanned by 2012. It appears that this requirement will be achieved by 2012, but as of February of 2009 eighty percent of the 11.5 million inbound cargo containers were being scanned. The systems used today in all major U.S. ports to determine the presence of radioactive material within cargo containers are Radiation Portal Monitors (RPM). These devices generally exist in the form of a gate or series of gates that the containers can be driven through and scanned. The monitors are effective for determining the presence of radiation, but offer little more information about the particular source. This simple pass-fail system leads to many false alarms as many everyday items emit radiation including smoke detectors due to the Americium-241 source contained inside, bananas, milk, cocoa powder and lean beef due to the trace amounts of Potassium-40, and fire brick and kitty litter due to their high clay content which often contains traces of uranium and thorium. In addition, if an illuminating source is imposed on the boundary of the container, the contents of the container may become activated. These materials include steel, aluminum and many agricultural products. Current portal monitors also have not proven to be that effective at identifying natural or highly enriched uranium (HEU). In fact, the best available Advanced Spectroscopic Portal Monitors (ASP) are only capable of identifying bare HEU 70-88% of the time and masked HEU and depleted uranium (DU) only 53 percent of the time. Therefore, a better algorithm that uses more information collected from better detectors about the specific material distribution within the container is desired. The work reported here explores the inverse problem of optical tomography applied to heterogeneous domains. The neutral particle transport equation was used as the forward model for how neutral particles stream through and interact within these heterogeneous domains. A constrained optimization technique that uses Newtons method served as the basis of the inverse problem. Optical tomography aims at reconstructing the material properties using (a) illuminating sources and (b) detector readings. However, accurate simulations for radiation transport require that the particle (gamma and/or neutron) energy be appropriate discretize in the multigroup approximation. This, in turns, yields optical tomography problems where the number of unknowns grows (1) about quadratically with respect to the number of energy groups, G, (notably to reconstruct the scattering matrix) and (2) linearly with respect to the number of unknown material regions. As pointed out, a promising approach could rely on algorithms to appropriately select a material type per material zone rather than G2 values. This approach, though promising, still requires further investigation: (a) when switching from cross-section values unknowns to material type indices (discrete integer unknowns), integer programming techniques are needed since derivative information is no longer available; and (b) the issue of selecting the initial material zoning remains. The work reported here proposes an approach to solve the latter item, whereby a material zoning is proposed using one-group or few-groups transport approximations. The capabilities and limitations of the presented method were explored; they are briefly summarized next and later described in fuller details in the Appendices. The major factors that influenced the ability of the optimization method to reconstruct the cross sections of these domains included the locations of the sources used to illuminate the domains, the number of separate experiments used in the reconstruction, the locations where measurements were collected, the optical thickness of the domain, the amount of signal noise and signal bias applied to the measurements and the initial guess for the cross section distribution. All of these factors were explored for problems with and without scattering. Increasing the number of source and measurement locations and experiments generally was more successful at reconstructing optically thicker domains while producing less error in the image. The maximum optical thickness that could be reconstructed with this method was ten mean free paths for pure absorber and two mean free paths for scattering problems. Applying signal noise and signal bias to the measured fluxes produced more error in the produced image. Generally, Newtons method was more successful at reconstructing domains from an initial guess for the cross sections that was greater in magnitude than their true values than from an initial guess that was lower in magnitude.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Reconstructing Spatial Distributions from Anonymized Locations

Devices such as mobile phones, tablets, and sensors are often equipped with GPS that accurately report a person's location. Combined with wireless communication, these devices enable a wide range of new social tools and applications. These same qualities, however, leave location-aware applications vulnerable to privacy violations. This paper introduces the Negative Quad Tree, a privacy protection method for location aware applications. The method is broadly applicable to applications that use spatial density information, such as social applications that measure the popularity of social venues. The method employs a simple anonymization algorithm running on mobile devices, and a more complex reconstruction algorithm on a central server. This strategy is well suited to low-powered mobile devices. The paper analyzes the accuracy of the reconstruction method in a variety of simulated and real-world settings and demonstrates that the method is accurate enough to be used in many real-world scenarios.

99 GENERAL AND MISCELLANEOUS↗

Hierarchical fractional-step approximations and parallel kinetic Monte Carlo algorithms

We present a mathematical framework for constructing and analyzing parallel algorithms for lattice kinetic Monte Carlo (KMC) simulations. The resulting algorithms have the capacity to simulate a wide range of spatio-temporal scales in spatially distributed, non-equilibrium physiochemical processes with complex chemistry and transport micro-mechanisms. Rather than focusing on constructing exactly the stochastic trajectories, our approach relies on approximating the evolution of observables, such as density, coverage, correlations and so on. More specifically, we develop a spatial domain decomposition of the Markov operator (generator) that describes the evolution of all observables according to the kinetic Monte Carlo algorithm. This domain decomposition corresponds to a decomposition of the Markov generator into a hierarchy of operators and can be tailored to specific hierarchical parallel architectures such as multi-core processors or clusters of Graphical Processing Units (GPUs). Based on this operator decomposition, we formulate parallel Fractional step kinetic Monte Carlo algorithms by employing the Trotter Theorem and its randomized variants; these schemes, (a) are partially asynchronous on each fractional step time-window, and (b) are characterized by their communication schedule between processors. The proposed mathematical framework allows us to rigorously justify the numerical and statistical consistency of the proposed algorithms, showing the convergence of our approximating schemes to the original serial KMC. The approach also provides a systematic evaluation of different processor communicating schedules. We carry out a detailed benchmarking of the parallel KMC schemes using available exact solutions, for example, in Ising-type systems and we demonstrate the capabilities of the method to simulate complex spatially distributed reactions at very large scales on GPUs. Finally, we discuss work load balancing between processors and propose a re-balancing scheme based on probabilistic mass transport methods.

97 MATHEMATICS AND COMPUTING↗

Data-driven Distributed Learning of Multi-agent Systems: A Koopman Operator Approach

Koopman operator theory provides a model-free technique for studying nonlinear dynamical systems purely from data. Since the Koopman operator is infinite-dimensional, researchers have developed several methods that provide a finite-dimensional approximation of the Koopman operator so that it can be applied for practical use cases. One common thing with most of the methods is that their solutions are obtained by solving a centralized minimization problem. In this work, we treat the dynamical system to be a multi-agent system and propose an algorithm to compute the finite-dimensional approximation of the Koopman operator in a distributed manner using the knowledge of the topology of the underlying multi-agent system. The proposed distributed approach is shown to be equivalent to the centralized learning problem and results in a sparse Koopman whose block structure mimics the Laplacian of the multi-agent system. Extensive simulation studies illustrate the proposed framework on the network of oscillators and the IEEE 68 bus system.

Nandanoori, Sai Pushpak↗

CGSim: A Simulation Framework for Large Scale Distributed Computing Environment

Large-scale distributed computing infrastructures such as the Worldwide LHC Computing Grid (WLCG) require comprehensive simulation tools for evaluating performance, testing new algorithms, and optimizing resource allocation strategies. However, existing simulators suffer from limited scalability, hardwired algorithms, lack of real-time monitoring, and inability to generate datasets suitable for modern machine learning approaches. We present CGSim, a simulation framework for large-scale distributed computing environments that addresses these limitations. Built upon the validated SimGrid simulation framework, CGSim provides high-level abstractions for modeling heterogeneous grid environments while maintaining accuracy and scalability. Key features include a modular plugin mechanism for testing custom workflow scheduling and data movement policies, interactive real-time visualization dashboards, and automatic generation of event-level datasets suitable for AI-assisted performance modeling. We demonstrate CGSim’s capabilities through a comprehensive evaluation using production ATLAS PanDA workloads, showing significant calibration accuracy improvements across WLCG computing sites. Scalability experiments show near-linear scaling for multi-site simulations, with distributed workloads achieving 6 × better performance compared to single-site execution. The framework enables researchers to simulate WLCG-scale infrastructures with hundreds of sites and thousands of concurrent jobs within practical time budget constraints on commodity hardware.

Vatsavai, Sairam Sri [Brookhaven National Laborato↗

An Enhanced Method for Scheduling Observations of Large Sky Error Regions for Finding Optical Counterparts to Transients

The discovery and subsequent study of optical counterparts to transient sources is crucial for their complete astrophysical understanding. Various gamma-ray burst (GRB) detectors, and more notably the ground-based gravitational wave detectors, typically have large uncertainties in the sky positions of detected sources. Searching these large sky regions spanning hundreds of square degrees is a formidable challenge for most ground-based optical telescopes, which can usually image less than tens of square degrees of the sky in a single night. We present algorithms for better scheduling of such follow-up observations in order to maximize the probability of imaging the optical counterpart, based on the all-sky probability distribution of the source position. We incorporate realistic observing constraints such as the diurnal cycle, telescope pointing limitations, available observing time, and the rising/setting of the target at the observatory’s location. We use simulations to demonstrate that our proposed algorithms outperform the default greedy observing schedule used by many observatories. Our algorithms are applicable for follow-up of other transient sources with large positional uncertainties, such as Fermi -detected GRBs, and can easily be adapted for scheduling radio or space-based X-ray follow-up.

79 ASTRONOMY AND ASTROPHYSICS↗

A Decentralized Approach for Modeling Organized Convection Based on Thermal Populations on Microgrids

Abstract In this study, a spectral model for convective transport is coupled to a thermal population model on a two‐dimensional horizontal “microgrid,” covering the typical gridbox size of general circulation models. The goal is to explore new ways of representing impacts of spatial organization in cumulus cloud fields. The thermals are considered the smallest building block of convection, with thermal life cycle and movement represented through binomial functions. Thermals interact through two simple rules, reflecting pulsating growth and environmental deformation. Long‐lived thermal clusters thus form on the microgrid, exhibiting scale growth and spacing that represent simple forms of spatial organization and memory. Size distributions of cluster number are diagnosed from the microgrid through an online clustering algorithm, and provided as input to a spectral multiplume eddy‐diffusivity mass flux scheme. This yields a decentralized transport system, in that the thermal clusters acting as independent but interacting nodes that carry information about spatial structure. The main objectives of this study are (a) to seek proof of concept of this approach, and (b) to gain insight into impacts of spatial organization on convective transport. Single‐column model experiments demonstrate satisfactory skill in reproducing two observed cases of continental shallow convection. Metrics expressing self‐organization and spatial organization match well with large‐eddy simulation results. We find that in this coupled system, spatial organization impacts convective transport primarily through the scale break in the size distribution of cluster number. The rooting of saturated plumes in the subcloud mixed layer plays a key role in this process.

54 ENVIRONMENTAL SCIENCES↗

A model-based scatter artifacts correction for cone beam CT

Purpose: Due to the increased axial coverage of multislice computed tomography (CT) and the introduction of flat detectors, the size of x-ray illumination fields has grown dramatically, causing an increase in scatter radiation. For CT imaging, scatter is a significant issue that introduces shading artifact, streaks, as well as reduced contrast and Hounsfield Units (HU) accuracy. The purpose of this work is to provide a fast and accurate scatter artifacts correction algorithm for cone beam CT (CBCT) imaging. Methods: The method starts with an estimation of coarse scatter profiles for a set of CBCT data in either image domain or projection domain. A denoising algorithm designed specifically for Poisson signals is then applied to derive the final scatter distribution. Qualitative and quantitative evaluations using thorax and abdomen phantoms with Monte Carlo (MC) simulations, experimental Catphan phantom data, and in vivo human data acquired for a clinical image guided radiation therapy were performed. Scatter correction in both projection domain and image domain was conducted and the influences of segmentation method, mismatched attenuation coefficients, and spectrum model as well as parameter selection were also investigated. Results: Results show that the proposed algorithm can significantly reduce scatter artifacts and recover the correct HU in either projection domain or image domain. For the MC thorax phantom study, four-components segmentation yields the best results, while the results of three-components segmentation are still acceptable. The parameters (iteration number K and weight β) affect the accuracy of the scatter correction and the results get improved as K and β increase. It was found that variations in attenuation coefficient accuracies only slightly impact the performance of the proposed processing. For the Catphan phantom data, the mean value over all pixels in the residual image is reduced from −21.8 to −0.2 HU and 0.7 HU for projection domain and image domain, respectively. The contrast of the in vivo human images is greatly improved after correction. Conclusions: The software-based technique has a number of advantages, such as high computational efficiency and accuracy, and the capability of performing scatter correction without modifying the clinical workflow (i.e., no extra scan/measurement data are needed) or modifying the imaging hardware. When implemented practically, this should improve the accuracy of CBCT image quantitation and significantly impact CBCT-based interventional procedures and adaptive radiation therapy.

60 APPLIED LIFE SCIENCES↗

Algorithm for Search and Recovery of the Vertex of Decay in the Hypernuclear Experiment NIS-GIBS at Dubna Nuclotron

Search of the decay vertex is an important part of the hypernuclear experiment, carried out of the Dubna nuclotron accelerator. The decay vertex is reconstructed from data from two sets of proportional chambers. The distribution of the vertex of decay of the hypernucleus allows to measure the lifetime of the hypernuclei. Algorithm for searches and automatically calculates the decay vertex has been written.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Evaluation of normalized metal artifact reduction (NMAR) in kVCT using MVCT prior images for radiotherapy treatment planning

Purpose: To evaluate the metal artifacts in kilovoltage computed tomography (kVCT) images that are corrected using a normalized metal artifact reduction (NMAR) method with megavoltage CT (MVCT) prior images.Methods: Tissue characterization phantoms containing bilateral steel inserts are used in all experiments. Two MVCT images, one without any metal artifact corrections and the other corrected using a modified iterative maximum likelihood polychromatic algorithm for CT (IMPACT) are translated to pseudo-kVCT images. These are then used as prior images without tissue classification in an NMAR technique for correcting the experimental kVCT image. The IMPACT method in MVCT included an additional model for the pair/triplet production process and the energy dependent response of the MVCT detectors. An experimental kVCT image, without the metal inserts and reconstructed using the filtered back projection (FBP) method, is artificially patched with the known steel inserts to get a reference image. The regular NMAR image containing the steel inserts that uses tissue classified kVCT prior and the NMAR images reconstructed using MVCT priors are compared with the reference image for metal artifact reduction. The Eclipse treatment planning system is used to calculate radiotherapy dose distributions on the corrected images and on the reference image using the Anisotropic Analytical Algorithm with 6 MV parallel opposed 5 × 10 cm{sup 2} fields passing through the bilateral steel inserts, and the results are compared. Gafchromic film is used to measure the actual dose delivered in a plane perpendicular to the beams at the isocenter.Results: The streaking and shading in the NMAR image using tissue classifications are significantly reduced. However, the structures, including metal, are deformed. Some uniform regions appear to have eroded from one side. There is a large variation of attenuation values inside the metal inserts. Similar results are seen in commercially corrected image. Use of MVCT prior images without tissue classification in NMAR significantly reduces these problems. The radiation dose calculated on the reference image is close to the dose measured using the film. Compared to the reference image, the calculated dose difference in the conventional NMAR image, the corrected images using uncorrected MVCT image, and IMPACT corrected MVCT image as priors is ∼15.5%, ∼5%, and ∼2.7%, respectively, at the isocenter.Conclusions: The deformation and erosion of the structures present in regular NMAR corrected images can be largely reduced by using MVCT priors without tissue segmentation. The attenuation value of metal being incorrect, large dose differences relative to the true value can result when using the conventional NMAR image. This difference can be significantly reduced if MVCT images are used as priors. Reduced tissue deformation, better tissue visualization, and correct information about the electron density of the tissues and metals in the artifact corrected images could help delineate the structures better, as well as calculate radiation dose more correctly, thus enhancing the quality of the radiotherapy treatment planning.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Unmixing hyperspectral images using Markov random fields

This paper proposes a new spectral unmixing strategy based on the normal compositional model that exploits the spatial correlations between the image pixels. The pure materials (referred to as endmembers) contained in the image are assumed to be available (they can be obtained by using an appropriate endmember extraction algorithm), while the corresponding fractions (referred to as abundances) are estimated by the proposed algorithm. Due to physical constraints, the abundances have to satisfy positivity and sum-to-one constraints. The image is divided into homogeneous distinct regions having the same statistical properties for the abundance coefficients. The spatial dependencies within each class are modeled thanks to Potts-Markov random fields. Within a Bayesian framework, prior distributions for the abundances and the associated hyperparameters are introduced. A reparametrization of the abundance coefficients is proposed to handle the physical constraints (positivity and sum-to-one) inherent to hyperspectral imagery. The parameters (abundances), hyperparameters (abundance mean and variance for each class) and the classification map indicating the classes of all pixels in the image are inferred from the resulting joint posterior distribution. To overcome the complexity of the joint posterior distribution, Markov chain Monte Carlo methods are used to generate samples asymptotically distributed according to the joint posterior of interest. Simulations conducted on synthetic and real data are presented to illustrate the performance of the proposed algorithm.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

THE GALAXY CONTENT OF SDSS CLUSTERS AND GROUPS

Imaging data from the Sloan Digital Sky Survey are used to characterize the population of galaxies in groups and clusters detected with the MaxBCG algorithm. We investigate the dependence of brightest cluster galaxy (BCG) luminosity, and the distributions of satellite galaxy luminosity and satellite color, on cluster properties over the redshift range 0.1 {<=} z {<=} 0.3. The size of the data set allows us to make measurements in many bins of cluster richness, radius and redshift. We find that, within r {sub 200} of clusters with mass above 3 x 10{sup 13} h {sup -1} M {sub sun}, the luminosity function (LF) of both red and blue satellites is only weakly dependent on richness. We further find that the shape of the satellite LF does not depend on cluster-centric distance for magnitudes brighter than {sup 0.25} M{sub i} - 5log{sub 10} h =-19. However, the mix of faint red and blue galaxies changes dramatically. The satellite red fraction is dependent on cluster-centric distance, galaxy luminosity, and cluster mass, and also increases by {approx}5% between redshifts 0.28 and 0.2, independent of richness. We find that BCG luminosity is tightly correlated with cluster richness, scaling as L {sub BCG} {approx} M {sup 0.3} {sub 200}, and has a Gaussian distribution at fixed richness, with {sigma}{sub logL} {approx} 0.17 for massive clusters. The ratios of BCG luminosity to total cluster luminosity and characteristic satellite luminosity scale strongly with cluster richness: in richer systems, BCGs contribute a smaller fraction of the total light, but are brighter compared to typical satellites. This study demonstrates the power of cross-correlation techniques for measuring galaxy populations in purely photometric data.

79 ASTRONOMY AND ASTROPHYSICS↗