Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “patch”

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 199 records · Page 11

Enhancing Turbulent Mixing and Microphysical Uniformity in a Tall Convection‐Cloud Chamber Through Idealized Heterogeneity of Boundaries

A large convection cloud chamber has been proposed for exploring aerosol–cloud–drizzle interactions under well‐controlled turbulent conditions. Recent theoretical and numerical studies suggest that a convection cloud chamber with two heated and two cooled sidewalls can significantly enhance the liquid water content and thus benefit drizzle initiation. However, a chamber with such a sidewall configuration develops stable stratification and extremely weak turbulence therein. In this study, we conduct large‐eddy simulations of a tall convection chamber with five different sidewall configurations consisting of alternating warm and cold patches. For each configuration, the total surface area of warm patches equals that of cold patches, resulting in the same expected cloud‐free supersaturation based on a flux budget model. Results show that changing the sidewall configuration, while keeping all other factors constant, can substantially enhance turbulent mixing and improve the uniformity of thermodynamic and cloud microphysical properties in the bulk region of the chamber. In addition, turbulence strength is positively correlated with liquid water content and negatively correlated with cloud droplet number concentration, consistent with theoretical predictions. Our results highlight the advantage of building a large cloud chamber using modular patches with individually controllable temperature and humidity to achieve well‐mixed conditions.

54 ENVIRONMENTAL SCIENCES↗

Programming entropy production hotspots via interaction patterning

Dissipation in soft matter and living systems is highly heterogeneous, giving rise to complex local entropy production patterns. Recent work has identified the connection between local entropy production and locally extractable amount of work. This suggests that locally produced entropy can be recovered to power nanorobots and biological machines, prompting the need for efficient strategies to modulate and fine-tune local entropy production. In this work, we propose to program entropy production hotspots by leveraging local interaction patterns and test this approach in simulations of a fluid driven through a nanopore or past an obstacle. Here, the results show that patterning the surface of the pore with a repulsive patch gives rise to an entropy production hotspot around the patch, while an attractive patch leads to an entropy production cold spot. Varying the strength of the interaction and width of the patch enables modulating the hotness and extent of the hot spot. In flows past interaction patterned-obstacles, we show that the combined effects of steric hindrance and attraction allows to program a specific entropy production map, thereby opening the door to the precise powering of nanomachines.

Desgranges, Caroline [University of Massachusetts,↗

Chromatic patchy particles: Effects of specific interactions on liquid structure

We study the structural and thermodynamic properties of patchy particle liquids, with a special focus on the role of “color,” i.e., specific interactions between individual patches. A possible experimental realization of such “chromatic” interactions is by decorating the particle patches with single-stranded DNA linkers. The complementarity of the linkers can promote selective bond formation between predetermined pairs of patches. By using MD simulations, we compare the local connectivity, the bond orientation order, and other structural properties of the aggregates formed by the “colored” and “colorless” systems. The analysis is done for spherical particles with two different patch arrangements (tetrahedral and cubic). It is found that the aggregated (liquid) phase of the “colorless” patchy particles is better connected, denser and typically has stronger local order than the corresponding “colored” one. This, in turn, makes the colored liquid less stable thermodynamically. Specifically, we predict that in a typical case the chromatic interactions should increase the relative stability of the crystalline phase with respect to the disordered liquid, thus expanding its region in the phase diagram.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Attention-Augmented Parametric Kernel Graph Neural Network (APKGNN) for Node Classification

We present a new graph neural network, the Attention-based Parametric-Kernel augmented Graph Neural Network (APKGNN), developed for node classification tasks. Despite extensive work on modeling multi-faceted relationships between connected nodes of a graph, the effect of attention on edge features mapped to relationships has not yet been analyzed through learning representation. This study derives such an attention vector by first calculating node features corresponding to endpoints of an edge and then aggregating these with extracted local intrinsic patches of a given graph to generate augmented local patch vectors. This process uses a parametric kernel based on Gaussian mixture models (GMMs) to embed local neighborhoods of the graph in local patches. The patch vectors then convolve with the above node features to produce an updated node representation. We show that this new learning representation (APKGNN) achieves higher node classification accuracy on tasks - both standard benchmarks (Cora, PubMed, Citeseer) and new experimental short text corpora where nodes correspond to text documents and words. This implementation of the GNN convolution layer outperforms state-of-the-art (SOTA) algorithms, achieving higher training, validation, and test accuracy by a significant margin on three standard benchmark data sets under both SOTA experimental settings and those for new testbeds.

Bose, Avishek↗

SU-E-J-212: Identifying Bones From MRI: A Dictionary Learnign and Sparse Regression Approach

Purpose: To develop an efficient and robust scheme to identify bony anatomy based on MRI-only simulation images. Methods: MRI offers important soft tissue contrast and functional information, yet its lack of correlation to electron-density has placed it as an auxiliary modality to CT in radiotherapy simulation and adaptation. An effective scheme to identify bony anatomy is an important first step towards MR-only simulation/treatment paradigm and would satisfy most practical purposes. We utilize a UTE acquisition sequence to achieve visibility of the bone. By contrast to manual + bulk or registration-to identify bones, we propose a novel learning-based approach for improved robustness to MR artefacts and environmental changes. Specifically, local information is encoded with MR image patch, and the corresponding label is extracted (during training) from simulation CT aligned to the UTE. Within each class (bone vs. nonbone), an overcomplete dictionary is learned so that typical patches within the proper class can be represented as a sparse combination of the dictionary entries. For testing, an acquired UTE-MRI is divided to patches using a sliding scheme, where each patch is sparsely regressed against both bone and nonbone dictionaries, and subsequently claimed to be associated with the class with the smaller residual. Results: The proposed method has been applied to the pilot site of brain imaging and it has showed general good performance, with dice similarity coefficient of greater than 0.9 in a crossvalidation study using 4 datasets. Importantly, it is robust towards consistent foreign objects (e.g., headset) and the artefacts relates to Gibbs and field heterogeneity. Conclusion: A learning perspective has been developed for inferring bone structures based on UTE MRI. The imaging setting is subject to minimal motion effects and the post-processing is efficient. The improved efficiency and robustness enables a first translation to MR-only routine. The scheme generalizes to multiple tissue classes.

60 APPLIED LIFE SCIENCES↗

MO-DE-207A-05: Dictionary Learning Based Reconstruction with Low-Rank Constraint for Low-Dose Spectral CT

Purpose: Spectral CT enabled by an energy-resolved photon-counting detector outperforms conventional CT in terms of material discrimination, contrast resolution, etc. One reconstruction method for spectral CT is to generate a color image from a reconstructed component in each energy channel. However, given the radiation dose, the number of photons in each channel is limited, which will result in strong noise in each channel and affect the final color reconstruction. Here we propose a novel dictionary learning method for spectral CT that combines dictionary-based sparse representation method and the patch based low-rank constraint to simultaneously improve the reconstruction in each channel and to address the inter-channel correlations to further improve the reconstruction. Methods: The proposed method has two important features: (1) guarantee of the patch based sparsity in each energy channel, which is the result of the dictionary based sparse representation constraint; (2) the explicit consideration of the correlations among different energy channels, which is realized by patch-by-patch nuclear norm-based low-rank constraint. For each channel, the dictionary consists of two sub-dictionaries. One is learned from the average of the images in all energy channels, and the other is learned from the average of the images in all energy channels except the current channel. With average operation to reduce noise, these two dictionaries can effectively preserve the structural details and get rid of artifacts caused by noise. Combining them together can express all structural information in current channel. Results: Dictionary learning based methods can obtain better results than FBP and the TV-based method. With low-rank constraint, the image quality can be further improved in the channel with more noise. The final color result by the proposed method has the best visual quality. Conclusion: The proposed method can effectively improve the image quality of low-dose spectral CT. This work is partially supported by the National Natural Science Foundation of China (No. 61302136), and the Natural Science Basic Research Plan in Shaanxi Province of China (No. 2014JQ8317).

60 APPLIED LIFE SCIENCES↗

TU-AB-BRA-02: An Efficient Atlas-Based Synthetic CT Generation Method

Purpose: A major obstacle for MR-only radiotherapy is the need to generate an accurate synthetic CT (sCT) from MR image(s) of a patient for the purposes of dose calculation and DRR generation. We propose here an accurate and efficient atlas-based sCT generation method, which has a computation speed largely independent of the number of atlases used. Methods: Atlas-based sCT generation requires a set of atlases with co-registered CT and MR images. Unlike existing methods that align each atlas to the new patient independently, we first create an average atlas and pre-align every atlas to the average atlas space. When a new patient arrives, we compute only one deformable image registration to align the patient MR image to the average atlas, which indirectly aligns the patient to all pre-aligned atlases. A patch-based non-local weighted fusion is performed in the average atlas space to generate the sCT for the patient, which is then warped back to the original patient space. We further adapt a PatchMatch algorithm that can quickly find top matches between patches of the patient image and all atlas images, which makes the patch fusion step also independent of the number of atlases used. Results: Nineteen brain tumour patients with both CT and T1-weighted MR images are used as testing data and a leave-one-out validation is performed. Each sCT generated is compared against the original CT image of the same patient on a voxel-by-voxel basis. The proposed method produces a mean absolute error (MAE) of 98.6±26.9 HU overall. The accuracy is comparable with a conventional implementation scheme, but the computation time is reduced from over an hour to four minutes. Conclusion: An average atlas space patch fusion approach can produce highly accurate sCT estimations very efficiently. Further validation on dose computation accuracy and using a larger patient cohort is warranted. The author is a full time employee of Elekta, Inc.

60 APPLIED LIFE SCIENCES↗

TISCC: A Surface Code Compiler and Resource Estimator for Trapped-Ion Processors

We introduce the Trapped-Ion Surface Code Compiler (TISCC), a software tool that generates circuits for a universal set of surface code patch operations in terms of a native trapped-ion gate set. To accomplish this, TISCC manages an internal representation of a trapped-ion system where a repeating pattern of trapping zones and junctions is arranged in an arbitrarily large rectangular grid. Surface code operations are compiled by instantiating surface code patches on the grid and using methods to generate transversal operations over data qubits, rounds of error correction over stabilizer plaquettes, and/or lattice surgery operations between neighboring patches. Beyond the implementation of a basic surface code instruction set, TISCC contains corner movement functionality and a patch translation that is implemented using ion movement alone. Except in the latter case, all TISCC functionality is extensible to alternative grid-like hardware architectures. TISCC output has been verified using the Oak Ridge Quasi-Clifford Simulator (ORQCS).

LeBlond, Tyler↗

ORNL-QCI/TISCC

We introduce the Trapped-Ion Surface Code Compiler (TISCC), a software tool that generates circuits for a universal set of surface code patch operations in terms of a native trapped-ion gate set. To accomplish this, TISCC manages an internal representation of a trapped-ion system where a repeating pattern of trapping zones and junctions is arranged in an arbitrarily large rectangular grid. Surface code operations are compiled by instantiating surface code patches on the grid and using methods to generate transversal operations over data qubits, rounds of error correction over stabilizer plaquettes, and/or lattice surgery operations between neighboring patches. Beyond the implementation of a basic surface code instruction set, TISCC contains corner movement functionality and a patch translation that is implemented using ion movement alone. Except in the latter case, all TISCC functionality is extensible to alternative grid-like hardware architectures. TISCC output has been verified using the Oak Ridge Quasi-Clifford Simulator (ORQCS).

LeBlond, Tyler↗

Deep machine learning-assisted multiphoton microscopy to reduce light exposure and expedite imaging

Two-photon excitation fluorescence (2PEF) allows imaging of tissue up to about one millimeter in thickness. Typically, reducing fluorescence excitation exposure reduces the quality of the image. However, using deep learning super resolution techniques, these low-resolution images can be converted to high-resolution images. This work explores improving human tissue imaging by applying deep learning to maximize image quality while reducing fluorescence excitation exposure. We analyze two methods: a method based on U-Net, and a patch-based regression method. Both methods are evaluated on a skin dataset and an eye dataset. The eye dataset includes 1200 paired high power and low power images of retinal organoids. The skin dataset contains multiple frames of each sample of human skin. High-resolution images were formed by averaging 70 frames for each sample and low-resolution images were formed by averaging the first 7 and 15 frames for each sample. The skin dataset includes 550 images for each of the resolution levels. We track two measures of performance for the two methods: mean squared error (MSE) and structural similarity index measure (SSIM). For the eye dataset, the patches method achieves an average MSE of 27,611 compared to 146,855 for the U-Net method, and an average SSIM of 0.636 compared to 0.607 for the U-Net method. For the skin dataset, the patches method achieves an average MSE of 3.768 compared to 4.032 for the U-Net method, and an average SSIM of 0.824 compared to 0.783 for the U-Net method. Despite better performance on image quality, the patches method is worse than the U-Net method when comparing the speed of prediction, taking 303 seconds to predict one image compared to less than one second for the U-Net method.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

RiverPIXELS: paired Landsat images and expert-labeled sediment and water pixels for a selection of rivers v1.0

RiverPIXELS contains GeoTIFFs of hand-labeled water and sediment pixels from Landsat images containing rivers. Each of the 104 labeled patches contains 256 x 256 Landsat pixels (30 meter resolution). Our aim in releasing RiverPIXELS is to provide an "off-the-shelf" training and testing dataset for building machine-learned models to automatically identify rivers from multispectral imagery. While a number of trained models and/or surface water products already exist, RiverPIXELS aims for pixel-level accuracy in order to precisely identify river boundaries in particular. Our selection of rivers is heavily Arctic, but we include tropical and temperate rivers as well. Patches are provided for the Colville (7), Indigirka (6), Kolyma (4), Ucayali (54), Waitaki (21), and Yana (12) Rivers. For each patch, all surface water pixels are labeled (1) and all in-channel sediment pixels are labeled (2). Sediments not in-channel are considered part of the land (0) class. RiverPIXELS also includes paired surface water data from the Global Surface Water dataset that may be useful as additional features in machine learning models. Each patch therefore contains four aligned GeoTIFFs: labeled, landsat, gswmo, and gswocc.

54 ENVIRONMENTAL SCIENCES↗

Exe-Guard Project

The exe-Guard Project is an alliance between Dominion Virginia Power (DVP), Sandia National Laboratories (SNL), Dartmouth University, and Schweitzer Engineering Laboratories (SEL). SEL is primary recipient on this project. The exe-Guard project was selected for award under DE-FOA-0000359 with CFDA number 81.122 to address Topic Area of Interest 4: Hardened platforms and Systems. The exe-Guard project developed an antivirus solution for control system embedded devices to prevent the execution of unauthorized code and maintain settings and configuration integrity. This project created a white list antivirus solution for control systems capable of running on embedded Linux® operating systems. White list antivirus methods allow only credible programs to run through the use of digital signatures and hash functions. Once a system’s secure state is baselined, white list antivirus software denies deviations from that state because of the installation of malicious code as this changes hash results. Black list antivirus software has been effective in traditional IT environments but has negative implications for control systems. Black list antivirus uses pattern matching and behavioral analysis to identify system threats while relying on regular updates to the signature file and recurrent system scanning. Black list antivirus is vulnerable to zero day exploits which have not yet been incorporated into a signature file update. System scans hamper the performance of high availability applications, as revealed in NIST special publication 1058 which summarizes the impact of blacklist antivirus on control systems: Manual or “on-demand” scanning has a major effect on control processes in that they take CPU time needed by the control process (Sometimes close to 100% of CPU time). Minimizing the antivirus software throttle setting will reduce but not eliminate this effect. Signature updates can also take up to 100% of CPU time, but for a much shorter period than a typical manual scanning process. Control systems are vulnerable to performance losses if off-the-shelf blacklist antivirus solutions aren’t implemented with care. This investment in configuration in addition to constant decommissioning to perform manual signature file updates is unprecedented and impractical. Additionally, control systems are often disconnected or islanded from the network making the delivery of signature updates difficult. Exe-Guard project developed a white list antivirus solution that mitigated the above drawbacks and allows control systems to cost-effectively apply malware protection while maintaining high reliability. The application of security patches can also be minimized since white listing maintains constant defense against unauthorized code execution. Security patches can instead be applied in less frequent intervals where system decommissioning can be scheduled and planned for. Since control systems are less dynamic than IT environments, the feasibility of maintaining a secure baselined state is more practical. Because upgrades are performed in infrequent, calculated intervals, it allows a new security baseline to be established before the system is returned to service. Exe-Guard built on the efforts of SNL under the Code Seal project. SNL demonstrated prototype Trust Anchors on the project which are independent monitoring and control devices that can be integrated into untrustworthy components. The exe-Guard team started with the lessons learned under this project then designed commercial solution for white list malware protection. Malware is a real threat, even on islanded or un-networked installations, since operators can unintentionally install infected files, plug in infected mass storage devices, or infect a piece of equipment on the islanded local area network that can then spread to other connected equipment. Protection at the device level is one of the last layers of defense in a security-in-depth defense model before an asset becomes compromised. This project provided non-destructive intrusion, isolation and automated response solution, achieving a goal of the Department of Energy (DOE) Roadmap to Secure Control Systems. It also addressed CIP-007-R4 which requires asset owners to employ malicious software prevention tools on assets within the electronic security perimeter. In addition, the CIP-007-R3 requirement for security patch management is minimized because white listing narrows the impact of vulnerabilities and patch releases. The exe-Guard Project completed all tasks identified in the statement of project objective and identified additional tasks within scope that were performed and completed within the original budget. The cost share was met and all deliverables were successfully completed and submitted on time. Most importantly the technology developed and commercialized under this project has been adopted by the Energy sector and thousands of devices with exe-Guard technology integrated in them have now been deployed and are protecting our power systems today

24 POWER TRANSMISSION AND DISTRIBUTION↗

Harvest Intensity Effects on Carbon Stocks and Biodiversity Are Dependent on Regional Climate in Douglas-Fir Forests of British Columbia

Temperate forests provide crucial ecosystems services as living sinks for atmospheric carbon (C) and repositories of biodiversity. Applying harvesting at intensities that minimize losses offers one means for mitigating global change. However, little is known of overstory retention levels that best conserve ecosystem services in different regional climates, and likewise as climate changes. To quantify the effect of harvest intensity on C stocks and biodiversity, we compared five harvesting intensities (clearcutting, seedtree retention, 30% patch retention, 60% patch retention, and uncut controls) across a climatic aridity gradient that ranged from humid to semi-arid in the Douglas-fir (Pseudotsuga menziesii) forests of British Columbia. We found that increased harvesting intensity reduced total ecosystem, above ground, and live tree C stocks 1 year post-harvest, and the magnitude of these losses were negatively correlated with climatic aridity. In humid forests, total ecosystem C ranged from 50% loss following clearcut harvest, to 30% loss following large patch retention harvest. In arid forests this range was 60 to 8% loss, respectively. Where lower retention harvests are sought, the small patch retention treatment protected both C stocks and biodiversity in the arid forests, whereas the seedtree method performed as well or better in the humid forests. Below ground C stocks declined by an average of 29% after harvesting, with almost all of the loss from the forest floor and none from the mineral soil. Of the secondary pools, standing and coarse deadwood declined in all harvesting treatments regardless of cutting intensity or aridity, while C stocks in fine fuels and stumps increased. The understory plant C pool declined across all harvesting intensities in the humid forests, but increased in arid forests. Shannon’s diversity and richness of tree and bryoid species declined with harvesting intensity, where tree species losses were greatest in the humid forests and bryoid losses greatest in arid forests. Shrub and herb species were unaffected. This study showed that the highest retention level was best at reducing losses in C stocks and biodiversity, and clearcutting the poorest, and while partial retention of canopy trees can reduce losses in these ecosystem services, outcomes will vary with climatic aridity.

54 ENVIRONMENTAL SCIENCES↗

Conditional random fields for pattern recognition applied to structured data

Pattern recognition uses measurements from an input domain, X, to predict their labels from an output domain, Y. Image analysis is one setting where one might want to infer whether a pixel patch contains an object that is “manmade” (such as a building) or “natural” (such as a tree). Suppose the label for a pixel patch is “manmade”; if the label for a nearby pixel patch is then more likely to be “manmade” there is structure in the output domain that can be exploited to improve pattern recognition performance. Modeling P(X) is difficult because features between parts of the model are often correlated. Therefore, conditional random fields (CRFs) model structured data using the conditional distribution P(Y|X = x), without specifying a model for P(X), and are well suited for applications with dependent features. This paper has two parts. First, we overview CRFs and their application to pattern recognition in structured problems. Our primary examples are image analysis applications in which there is dependence among samples (pixel patches) in the output domain. Second, we identify research topics and present numerical examples.

97 MATHEMATICS AND COMPUTING↗

Contrasting Foraging Patterns: Testing Resource-Concentration and Dilution Effects with Pollinators and Seed Predators

Resource concentration effects occur when high resource density patches attract and support more foragers than low density patches. In contrast, resource dilution effects can occur if high density patches support fewer consumers. In this study, we examined the foraging rates of pollinators and seed predators on two perennial plant species (Rudbeckia triloba and Verbena stricta) as functions of resource density. Specifically, we examined whether resource-dense patches (densities of flower and seeds on individual plants) resulted in greater visitation and seed removal rates, respectively. We also examined whether foraging rates were context-dependent by conducting the study in two sites that varied in resource densities. For pollinators, we found negative relationships between the density of flowers per plant and visitation rates, suggesting dilution effects. For seed predators, we found positive relationships consistent with concentration effects. Saturation effects and differences in foraging behaviors might explain the opposite relationships; most of the seed predators were ants (recruitment-based foragers), and pollinators were mostly solitary foragers. We also found that foraging rates were site-dependent, possibly due to site-level differences in resource abundance and consumer densities. These results suggest that these two plant species may benefit from producing as many flowers as possible, given high levels of pollination and low seed predation.

54 ENVIRONMENTAL SCIENCES↗

An angularly refineable phase space finite element method with approximate sweeping procedure

An angularly refineable phase space finite element method is proposed to solve the neutron transport equation. The method combines the advantages of two recently published schemes. The angular domain is discretized into small patches and patch-wise discontinuous angular basis functions are restricted to these patches, i.e. there is no overlap between basis functions corresponding to different patches. This approach yields block diagonal Jacobians with small block size and retains the possibility for S{sub n}-like approximate sweeping of the spatially discontinuous elements in order to provide efficient preconditioners for the solution procedure. On the other hand, the preservation of the full FEM framework (as opposed to collocation into a high-order S{sub n} scheme) retains the possibility of the Galerkin interpolated connection between phase space elements at arbitrary levels of discretization. Since the basis vectors are not orthonormal, a generalization of the Riemann procedure is introduced to separate the incoming and outgoing contributions in case of unstructured meshes. However, due to the properties of the angular discretization, the Riemann procedure can be avoided at a large fraction of the faces and this fraction rapidly increases as the level of refinement increases, contributing to the computational efficiency. In this paper the properties of the discretization scheme are studied with uniform refinement using an iterative solver based on the S{sub 2} sweep order of the spatial elements. The fourth order convergence of the scalar flux is shown as anticipated from earlier schemes and the rapidly decreasing fraction of required Riemann faces is illustrated. (authors)

97 MATHEMATICS AND COMPUTING↗

Power laws and critical fragmentation in global forests

The replacement of forest areas with human-dominated landscapes usually leads to fragmentation, altering the structure and function of the forest. Here we studied the dynamics of forest patch sizes at a global level, examining signals of a critical transition from an unfragmented to a fragmented state, using the MODIS vegetation continuous field. We defined wide regions of connected forest across continents and big islands, and combined five criteria, including the distribution of patch sizes and the fluctuations of the largest patch over the last sixteen years, to evaluate the closeness of each region to a fragmentation threshold. Regions with the highest deforestation rates–South America, Southeast Asia, Africa–all met these criteria and may thus be near a critical fragmentation threshold. This implies that if current forest loss rates are maintained, wide continental areas could suddenly fragment, triggering extensive species loss and degradation of ecosystems services.

54 ENVIRONMENTAL SCIENCES↗

Two‐Dimensional (2D) or Quasi‐2D Superstructures from DNA‐Coated Colloidal Particles

Abstract This contribution describes the synthesis of colloidal di‐patch particles functionalized with DNA on the patches and their assembly into colloidal superstructures via cooperative depletion and DNA‐mediated interactions. The assembly into flower‐like Kagome, brick‐wall like monolayer, orthogonal packed single or double layers, wrinkled monolayer, and colloidal honeycomb superstructures can be controlled by tuning the particles’ patch sizes and assembly conditions. Based on these experimental results, we generate an empirical phase diagram. The principles revealed by the phase diagram provide guidance in the design of two‐dimensional (2D) materials with desired superstructures. Our strategy might be translatable to the assembly of three‐dimensional (3D) colloidal structures.

Liu, Mingzhu↗