SEARCH · Search NASA

Results for “algorithmic structures”

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.

SourceResearch connectionFrom yearThrough year

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

At least 1,477 records · Page 82

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Physics in the Machine: Integrating Physical Knowledge in Autonomous Phase-Mapping

Application of artificial intelligence (AI), and more specifically machine learning, to the physical sciences has expanded significantly over the past decades. In particular, science-informed AI, also known as scientific AI or inductive bias AI, has grown from a focus on data analysis to now controlling experiment design, simulation, execution and analysis in closed-loop autonomous systems. The CAMEO (closed-loop autonomous materials exploration and optimization) algorithm employs scientific AI to address two tasks: learning a material system’s composition-structure relationship and identifying materials compositions with optimal functional properties. By integrating these, accelerated materials screening across compositional phase diagrams was demonstrated, resulting in the discovery of a best-in-class phase change memory material. Key to this success is the ability to guide subsequent measurements to maximize knowledge of the composition-structure relationship, or phase map. In this work we investigate the benefits of incorporating varying levels of prior physical knowledge into CAMEO’s autonomous phase-mapping. This includes the use of ab-initio phase boundary data from the AFLOW repositories, which has been shown to optimize CAMEO’s search when used as a prior.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Recognizing Blazars Using Radio Morphology from the VLA Sky Survey

Abstract Blazars are radio-loud active galactic nuclei whose jets have a very small angle to our line of sight. Observationally, the radio emissions are mostly compact or compact-core with a one-sided jet. With 2.″5 resolution at 3 GHz, the Very Large Array Sky Survey (VLASS) enables us to resolve the structure of some blazar candidates in the sky north of decl. −40°. We introduce an algorithm to classify radio sources as either blazar-like or non-blazar-like based on their morphology in the VLASS images. We apply our algorithm to three existing catalogs, including one of the known blazars (Roma-BzCAT) and two blazar candidates identified by Wide-field Infrared Survey Explorer colors and radio emission (WIBRaLS, KDEBLLACS). We show that in all three catalogs, there are objects with morphologies inconsistent with being blazars. Considering all the catalogs, more than 12% of the candidates are unlikely to be blazars, based on this analysis. Notably, we show that 3% of the Roma-BzCATconfirmedblazars could be a misclassification based on their VLASS morphology. The resulting table with all sources and their radio morphological classification is available online.

Astronomy & Astrophysics↗

DOE OSTI2014

ISMB Conference Funding to Support Attendance of Early Researchers and Students

ISMB Conference Funding for Students and Young Scientists Historical Description The Intelligent Systems for Molecular Biology (ISMB) conference has provided a general forum for disseminating the latest developments in bioinformatics on an annual basis for the past 22 years. ISMB is a multidisciplinary conference that brings together scientists from computer science, molecular biology, mathematics and statistics. The goal of the ISMB meeting is to bring together biologists and computational scientists in a focus on actual biological problems, i.e., not simply theoretical calculations. The combined focus on “intelligent systems” and actual biological data makes ISMB a unique and highly important meeting. 21 years of experience in holding the conference has resulted in a consistently well-organized, well attended, and highly respected annual conference. "Intelligent systems" include any software which goes beyond straightforward, closed-form algorithms or standard database technologies, and encompasses those that view data in a symbolic fashion, learn from examples, consolidate multiple levels of abstraction, or synthesize results to be cognitively tractable to a human, including the development and application of advanced computational methods for biological problems. Relevant computational techniques include, but are not limited to: machine learning, pattern recognition, knowledge representation, databases, combinatorics, stochastic modeling, string and graph algorithms, linguistic methods, robotics, constraint satisfaction, and parallel computation. Biological areas of interest include molecular structure, genomics, molecular sequence analysis, evolution and phylogenetics, molecular interactions, metabolic pathways, regulatory networks, developmental control, and molecular biology generally. Emphasis is placed on the validation of methods using real data sets, on practical applications in the biological sciences, and on development of novel computational techniques. The ISMB conferences are distinguished from many other conferences in computational biology or artificial intelligence by an insistence that the researchers work with real molecular biology data, not theoretical or toy examples; and from many other biological conferences by providing a forum for technical advances as they occur, which otherwise may be shunned until a firm experimental result is published. The resulting intellectual richness and cross-disciplinary diversity provides an important opportunity for both students and senior researchers. ISMB has become the premier conference series in this field with refereed, published proceedings, establishing an infrastructure to promote the growing body of research.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2017

Distributed-Memory Breadth-First Search on Massive Graphs. IN: Parallel Graph Algorithms

This chapter studies the problem of traversing large graphs using the breadth-first search order on distributed-memory supercomputers. We consider both the traditional level-synchronous top-down algorithm as well as the recently discovered direction optimizing algorithm. We analyze the performance and scalability trade-offs in using different local data structures such as CSR and DCSC, enabling in-node multithreading, and graph decompositions such as 1D and 2D decomposition.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

Microstructural characterization of random packings of cubic particles

Understanding the properties of random packings of solid objects is of critical importance to a wide variety of fundamental scientific and practical problems. The great majority of the previous works focused, however, on packings of spherical and sphere-like particles. We report the first detailed simulation and characterization of packings of non-overlapping cubic particles. Such packings arise in a variety of problems, ranging from biological materials, to colloids and fabrication of porous scaffolds using salt powders. In addition, packing of cubic salt crystals arise in various problems involving preservation of pavements, paintings, and historical monuments, mineral-fluid interactions, CO 2 sequestration in rock, and intrusion of groundwater aquifers by saline water. Not much is known, however, about the structure and statistical descriptors of such packings. We have developed a version of the random sequential addition algorithm to generate such packings, and have computed a variety of microstructural descriptors, including the radial distribution function, two-point probability function, orientational correlation function, specific surface, and mean chord length, and have studied the effect of finite system size and porosity on such characteristics. Here, the results indicate the existence of both spatial and orientational long-range order in the packing, which is more distinctive for higher packing densities.

36 MATERIALS SCIENCE↗

DOE OSTI2015

Enhancing Community Detection By Affinity-based Edge Weighting Scheme

Community detection refers to an important graph analytics problem of finding a set of densely-connected subgraphs in a graph and has gained a great deal of interest recently. The performance of current community detection algorithms is limited by an inherent constraint of unweighted graphs that offer very little information on their internal community structures. In this paper, we propose a new scheme to address this issue that weights the edges in a given graph based on recently proposed vertex affinity. The vertex affinity quantifies the proximity between two vertices in terms of their clustering strength, and therefore, it is ideal for graph analytics applications such as community detection. We also demonstrate that the affinity-based edge weighting scheme can improve the performance of community detection algorithms significantly.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2014

Diffusion-controlled reactions modeling in Geant4-DNA

Context Under irradiation, a biological system undergoes a cascade of chemical reactions that can lead to an alteration of its normal operation. There are different types of radiation and many competing reactions. As a result the kinetics of chemical species is extremely complex. The simulation becomes then a powerful tool which, by describing the basic principles of chemical reactions, can reveal the dynamics of the macroscopic system. To understand the dynamics of biological systems under radiation, since the 80s there have been on-going efforts carried out by several research groups to establish a mechanistic model that consists in describing all the physical, chemical and biological phenomena following the irradiation of single cells. This approach is generally divided into a succession of stages that follow each other in time: (1) the physical stage, where the ionizing particles interact directly with the biological material; (2) the physico-chemical stage, where the targeted molecules release their energy by dissociating, creating new chemical species; (3) the chemical stage, where the new chemical species interact with each other or with the biomolecules; (4) the biological stage, where the repairing mechanisms of the cell come into play. This article focuses on the modeling of the chemical stage. Method This article presents a general method of speeding-up chemical reaction simulations in fluids based on the Smoluchowski equation and Monte-Carlo methods, where all molecules are explicitly simulated and the solvent is treated as a continuum. The model describes diffusion-controlled reactions. This method has been implemented in Geant4-DNA. The keys to the new algorithm include: (1) the combination of a method to compute time steps dynamically with a Brownian bridge process to account for chemical reactions, which avoids costly fixed time step simulations; (2) a k–d tree data structure for quickly locating, for a given molecule, its closest reactants. The performance advantage is presented in terms of complexity, and the accuracy of the new algorithm is demonstrated by simulating radiation chemistry in the context of the Geant4-DNA project. Application The time-dependent radiolytic yields of the main chemical species formed after irradiation are computed for incident protons at different energies (from 50 MeV to 500 keV). Both the time-evolution and energy dependency of the yields are discussed. The evolution, at one microsecond, of the yields of hydroxyls and solvated electrons with respect to the linear energy transfer is compared to theoretical and experimental data. According to our results, at high linear energy transfer, modeling radiation chemistry in the trading compartment representation might be adopted.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2016

WE-H-BRA-08: A Monte Carlo Cell Nucleus Model for Assessing Cell Survival Probability Based On Particle Track Structure Analysis

Purpose: To correlate the damage produced by particles of different types and qualities to cell survival on the basis of nanodosimetric analysis and advanced DNA structures in the cell nucleus. Methods: A Monte Carlo code was developed to simulate subnuclear DNA chromatin fibers (CFs) of 30nm utilizing a mean-free-path approach common to radiation transport. The cell nucleus was modeled as a spherical region containing 6000 chromatin-dense domains (CDs) of 400nm diameter, with additional CFs modeled in a sparser interchromatin region. The Geant4-DNA code was utilized to produce a particle track database representing various particles at different energies and dose quantities. These tracks were used to stochastically position the DNA structures based on their mean free path to interaction with CFs. Excitation and ionization events intersecting CFs were analyzed using the DBSCAN clustering algorithm for assessment of the likelihood of producing DSBs. Simulated DSBs were then assessed based on their proximity to one another for a probability of inducing cell death. Results: Variations in energy deposition to chromatin fibers match expectations based on differences in particle track structure. The quality of damage to CFs based on different particle types indicate more severe damage by high-LET radiation than low-LET radiation of identical particles. In addition, the model indicates more severe damage by protons than of alpha particles of same LET, which is consistent with differences in their track structure. Cell survival curves have been produced showing the L-Q behavior of sparsely ionizing radiation. Conclusion: Initial results indicate the feasibility of producing cell survival curves based on the Monte Carlo cell nucleus method. Accurate correlation between simulated DNA damage to cell survival on the basis of nanodosimetric analysis can provide insight into the biological responses to various radiation types. Current efforts are directed at producing cell survival curves for high-LET radiation.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2018

A massively-parallel, unstructured overset method for mesh connectivity

Here we present a method that dynamically and efficiently performs connectivity calculations between many O(10 5 ) moving, unstructured overset meshes in parallel. In order to connect overset meshes, elements exterior to the solution domain must be removed from the simulation. In regions with many overlapping meshes, elements must be selectively removed to reduce redundancy while maintaining a solution over the entire domain. Around masked regions interpolation partner pairing is required between meshes to provide boundary conditions. For general unstructured meshes, these steps involve challenging computational geometry calculations which must be efficient and automatic. For many moving meshes each step must be massively parallelized and scalable to large numbers of computational cores. To establish communication patterns a parallelized master/slave algorithm is used which minimizes global communication and storage. To remove elements a parallel ‘Forest Fire’ flood-fill algorithm is used to set a masking variable. For interpolation partner pairing, and other necessary searches, k-dimensional tree data structures (k-d trees) are extensively used. Often in a calculation, the connectivity between overset meshes remains largely the same between time steps. The temporal coherence of the various objects in the connectivity calculation is directly used to only update necessary information with time, resulting in substantial cost savings. Details of the different algorithms are presented. Resulting connectivity and timings are shown for complex geometries. Parallel scaling is demonstrated for 100,000 spherical particles within a channel up to 492,000 processors.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2014

Cost-of-Service Segmentation of Energy Consumers

Uncertainty in consumption is a key challenge at energy utility companies, which are faced with balancing highly stochastic demand with increasingly volatile supply characterized by significant penetration rates of intermittent renewable sources. This paper proposes a methodology to quantify uncertainty in consumption that highlights the dependence of the cost-of-service with volatility in demand. We use a large and rich dataset of consumption time series to provide evidence that there is a substantial degree of high-level structure in the statistics of consumption across users which may be partially explained by certain characteristics of the users. To uncover this structure, we propose a new technique for extracting typical statistical signatures of consumption-energy demand distributions (EDDs)-that is based on clustering distributions using a fast, approximated algorithm. We next study the factors influencing the choice of consumption signature and identify certain types of appliances and behaviors related to appliance operation that are most predictive. Finally, we comment on how structure in consumption statistics may be used to target residential energy efficiency programs to achieve greatest impact in curtailing cost of service.

Albert, A↗

DOE OSTI2024

High throughput automated characterization of enamel microstructure using synchrotron tomography and optical flow imaging

The remarkable damage-tolerance of enamel has been attributed to its hierarchical microstructure and the organized bands of decussated rods. A thorough characterization of the microscale rod evolution within the enamel is needed to elucidate this complex structure. While prior efforts in this area have made use of single particle tracking to track a single rod evolution to various degrees of success, such a process can be both computationally and labor intensive, limited to the evolution path of a single rod, and is therefore prone to error from potentially tracking outliers. Particle image velocimetry (PIV) is a well-established algorithm to derive field information from image sequences for processes that are time-dependent, such as fluid flows and structural deformation. In this work, we demonstrate the use of PIV in extracting the full-field microstructural distribution of rods within the enamel. Further, enamel samples from a wild African lion were analyzed using high-energy synchrotron X-ray micro-tomography. Results from the PIV analysis provide sufficient full-field information to reconstruct the growth of individual rods that can potentially enable rapid analysis of complex microstructures from high resolution synchrotron datasets. Such information can serve as a template for designing damage-tolerant bioinspired structures for advanced manufacturing.

36 MATERIALS SCIENCE↗

DOE OSTI2020

Axion structure formation – II. The wrath of collapse

ABSTRACT The first paper in this series showed that quantum chromodynamic axion dark matter, as a highly correlated Bose fluid, contains extra-classical physics on cosmological scales. The source of the derived extra-classical physics is exchange–correlation interactions induced by the constraints of symmetric particle exchange and interaxion correlations from self-gravitation. The paper also showed that the impact of extra-classical physics on early structure formation is marginal, as the exchange–correlation interaction is inherently non-linear. This paper continues the study of axion structure formation into the non-linear regime, considering the case of full collapse and virialization. The N-body method is chosen to study the collapse, and its algorithms are derived for a condensed Bose fluid. Simulations of isolated gravitational collapse are performed for both Bose and cold dark matter fluids using a prototype N-body code. Unique Bose structures are found to survive even the most violent collapses. Bose post-collapse features include dynamical changes to global structures, creation of new broad sub-structures, violations of classical binding energy conditions, and new fine structures. Effective models of the novel structures are constructed and possibilities for their observation are discussed.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2019

ECP Milestone Memo WBS 2.3.4.13 ECP/VTK-m FY18Q4 [MS-18/09-10] Dynamic Types / Rendering Topologies STDA05-16

The STDA05-16 milestone comprises the following 3 distinct deliverables. OpenMP VTK-m currently supports three types of devices: serial CPU, TBB, and CUDA. To run algorithms on multicore CPU-type devices (such as Xeon and Xeon Phi), TBB is required. However, there are known issues with integrating a software product using TBB with another one using OpenMP. Therefore, we will add an OpenMP device to the VTK-m software. When engaged, this device will run parallel algorithms using OpenMP directives. This will mesh more nicely with other code also using OpenMP. Rendering Topological Entities VTK-m currently supports surface rendering by tessellation of data structures,and rendering the resulting triangles. We will extend current functionality to include face, edge, and point rendering. Better Dynamic Types Impl For the best efficiency across all platforms, VTK-m algorithms use static typing with C++ templates. However, many libraries like VTK, ParaView, and Visit use dynamic types with virtual functions because data types often cannot be determined at compile time. We have an interface in VTK-m to merge these two typing mechanisms by generating all possible combinations of static types when faced with a dynamic type. Although this mechanism works, it generates very large executables and takes a very long time to compile. As we move forward, it is clear that these problems will get worse and become infeasible at exascale. We will rectify the problem by introducing some level of virtual methods, which require only a single code path, within VTK-m algorithms. This first milestone produces a design document to propose an approach to the new system.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

FRET-based dynamic structural biology: Challenges, perspectives and an appeal for open-science practices

Single-molecule FRET (smFRET) has become a mainstream technique for studying biomolecular structural dynamics. The rapid and wide adoption of smFRET experiments by an ever-increasing number of groups has generated significant progress in sample preparation, measurement procedures, data analysis, algorithms and documentation. Several labs that employ smFRET approaches have joined forces to inform the smFRET community about streamlining how to perform experiments and analyze results for obtaining quantitative information on biomolecular structure and dynamics. The recent efforts include blind tests to assess the accuracy and the precision of smFRET experiments among different labs using various procedures. These multi-lab studies have led to the development of smFRET procedures and documentation, which are important when submitting entries into the archiving system for integrative structure models, PDB-Dev. This position paper describes the current ‘state of the art’ from different perspectives, points to unresolved methodological issues for quantitative structural studies, provides a set of ‘soft recommendations’ about which an emerging consensus exists, and lists openly available resources for newcomers and seasoned practitioners. To make further progress, we strongly encourage ‘open science’ practices.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2026

Hierarchical Gaussian Random Field Sampling for Multilevel Markov Chain Monte Carlo: Coupling Stochastic Partial Differential Equation and the Karhunen–Loève Decomposition

This work introduces structure preserving hierarchical decompositions for sampling Gaussian random fields (GRFs) within the context of multilevel Bayesian inference in high-dimensional space. Existing scalable hierarchical sampling methods, such as those based on stochastic partial differential equations (SPDEs), often reduce the dimensionality of the sample space at the cost of accuracy of inference. Other approaches, such that those based on Karhunen-Loève (KL) expansions, offer sample space dimensionality reduction but sacrifice GRF representation accuracy and ergodicity of the Markov chain Monte Carlo (MCMC) sampler and are computationally expensive for high-dimensional problems. The proposed method integrates the dimensionality reduction capabilities of KL expansions with the scalability of SPDE-based sampling, thereby providing a robust, unified framework for high-dimensional uncertainty quantification (UQ) that is scalable and accurate, preserves ergodicity, and offers dimensionality reduction of the sample space. The hierarchy in our multilevel algorithm is derived from the geometric multigrid hierarchy. By constructing a hierarchical decomposition that maintains the covariance structure across the levels in the hierarchy, the approach enables efficient coarse-to-fine sampling while ensuring that all samples are drawn from the desired distribution. The effectiveness of the proposed method is demonstrated on a benchmark subsurface flow problem, demonstrating its effectiveness in improving computational efficiency and statistical accuracy. Furthermore, our proposed technique is more efficient and accurate and displays better convergence properties than existing methods for high-dimensional Bayesian inference problems.

Gaussian random fields↗

DOE OSTI2016

SU-F-T-606: Monte Carlo Evaluation of Tissue Inhomogeneity Corrections in the Treatment of Liver Cancer Patients Using Stereotactic Body Radiotherapy

Purpose: To evaluate the dosimetric performance of X-ray Voxel Monte Carlo(XVMC) algorithm in effort to clinically validate Monte Carlo-approach in heterogeneous liver phantom and liver SBRT plans. Methods: An anthropomorphic RPC liver phantom incorporating a liver structure with two cylindrical targets and organs-at-risk (OARs) was used in phantom validation. Subsequently, five patients with metastatic liver cancer were treated using heterogeneity-corrected pencil-beam(PB-hete)algorithm were analyzed following RTOG-1112 criteria .ITV was delineated on MinIP and OARs were contoured on MeanIP images of 4D-CT. PTV was generated from ITV with 5-10mm uniform margin. Mean PTV was 81.3±46.4cc. Prescription was 30–45Gy in 5 fractions, with at least PTV(D95%)=100%. Hybrid SBRT plans were generated with noncoplanar/3D-conformal arcs plus static-beams at Novalis-TX consisting of HD-MLC and 6MV-SRS. SBRT plans were re-computed using XVMC algorithm utilizing identical beam-geometry, MLC-positions, and monitor units and subsequently compared to clinical PB-hete plans. Results: Our results using RPC liver motion phantom validation were all compliance with MD Anderson standards. However, compared to PB-hete, average target volume encompassed by the prescribed percent isodose (Vp) was 9.1% and 8.5% less for PTV1 and PTV2 with XVMC. For the clinical liver SBRT plans, PB-hete systematically overestimated PTV dose (D95, Dmean and D10) within ±2.0% (p<0.05) compared to XVMC. Mean value of Vp was about 3.8% less with XVMC compared to PB-hete (ranged 2.9–5.7% (p<0.003)). However, mean liver dose (MLD) was 3.2% higher (p<0.003), on average, with XVMC compared to clinical PB-hete (ranged −1.0to−3.9%). OARs doses were statistically insignificant. Conclusion: Results from our XVMC dose calculations and validation study for liver SBRT indicate small-to-moderate under-dosing of the tumor volume when compared to PB-hete. Results were consistent with phantom validation and patients plans. However, Vp was less by up to 5.7% for some liver SBRT patients with XVMC–suggesting under-dosing of the target volume and overdosing of MLD by up to 3.9% occurred with PB-hete plan. These differences between PB-hete and XVMC dose calculations may be of clinical interest.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2013

Hurricanes in an Aquaplanet World: Implications of the Impacts of External Forcing and Model Horizontal Resolution

High-resolution climate models have been shown to improve the statistics of tropical storms and hurricanes compared to low-resolution models. The impact of increasing horizontal resolution in the tropical storm simulation is investigated exclusively using a series of Atmospheric Global Climate Model (AGCM) runs with idealized aquaplanet steady-state boundary conditions and a fixed operational storm-tracking algorithm. The results show that increasing horizontal resolution helps to detect more hurricanes, simulate stronger extreme rainfall, and emulate better storm structures in the models. However, increasing model resolution does not necessarily produce stronger hurricanes in terms of maximum wind speed, minimum sea level pressure, and mean precipitation, as the increased number of storms simulated by high-resolution models is mainly associated with weaker storms. The spatial scale at which the analyses are conducted appears to have more important control on these meteorological statistics compared to horizontal resolution of the model grid. When the simulations are analyzed on common low-resolution grids, the statistics of the hurricanes, particularly the hurricane counts, show reduced sensitivity to the horizontal grid resolution and signs of scale invariant.

aquaplanet↗

DOE OSTI2018

A spherical aberration-free microscopy system for live brain imaging

Highlights: • Deep-C is an automatic spherical aberration compensation system for in vivo imaging. • Deep-C is composed of ZlinC and Peak-C. • ZlinC coordinates the correction collar rotation and the Z-position of an objective. • Peak-C is a scanning algorithm processor for calculation of image contrast. • Deep-C allows quantitative, reproducible analysis of fine GFP-labeled structures. The high-resolution in vivo imaging of mouse brain for quantitative analysis of fine structures, such as dendritic spines, requires objectives with high numerical apertures (NAs) and long working distances (WDs). However, this imaging approach is often hampered by spherical aberration (SA) that results from the mismatch of refractive indices in the optical path and becomes more severe with increasing depth of target from the brain surface. Whereas a revolving objective correction collar has been designed to compensate SA, its adjustment requires manual operation and is inevitably accompanied by considerable focal shift, making it difficult to acquire the best image of a given fluorescent object. To solve the problems, we have created an objective-attached device and formulated a fast iterative algorithm for the realization of an automatic SA compensation system. The device coordinates the collar rotation and the Z-position of an objective, enabling correction collar adjustment while stably focusing on a target. The algorithm provides the best adjustment on the basis of the calculated contrast of acquired images. Together, they enable the system to compensate SA at a given depth. As proof of concept, we applied the SA compensation system to in vivo two-photon imaging with a 25 × water-immersion objective (NA, 1.05; WD, 2 mm). It effectively reduced SA regardless of location, allowing quantitative and reproducible analysis of fine structures of YFP-labeled neurons in the mouse cerebral cortical layers. Interestingly, although the cortical structure was optically heterogeneous along the z-axis, the refractive index of each layer could be assessed on the basis of the compensation degree. It was also possible to make fully corrected three-dimensional reconstructions of YFP-labeled neurons in live brain samples. Our SA compensation system, called Deep-C, is expected to bring out the best in all correction-collar-equipped objectives for imaging deep regions of heterogeneous tissues.

60 APPLIED LIFE SCIENCES↗