Abstract Computational studies revealed that dirhodium tetrakis(1,2,2‐triarylcyclopropanecarboxylate) (Rh2(TPCP)4) catalysts adopt distinctive high symmetry orientations, which are dependent on the nature of the aryl substitution pattern. The parent catalyst, Rh2(TPCP)4, and those with ap‐substituent at the C1 aryl, such as Rh2(p‐BrTPCP)4and Rh2(p‐PhTPCP)4, adopt aC2‐symmetric structure. Rh2(3,5‐di(p‐tBuC6H4)TPCP)4, 3,5‐disubstituted at the C1 aryl, adopts aD2‐symmetric structure, whereas catalysts with ano‐substituent at the C1 aryl, such as Rh2(o‐Cl‐5‐BrTPCP)4,adopt aC4‐symmetric structure. 
                        more » 
                        « less   
                    
                            
                            Ring-opening metathesis polymerization of norbornene–benzoladderene (macro)monomers
                        
                    
    
            We report highkp(macro)monomer structures for use in grafting-through ring-opening metathesis polymerization to make linear and bottlebrush polymers. 
        more » 
        « less   
        
    
    
                            - PAR ID:
- 10505398
- Publisher / Repository:
- Royal Society of Chemistry
- Date Published:
- Journal Name:
- Polymer Chemistry
- Volume:
- 14
- Issue:
- 41
- ISSN:
- 1759-9954
- Page Range / eLocation ID:
- 4726 to 4735
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
- 
            
- 
            Summary Grasses are exceptionally productive, yet their hydraulic adaptation is paradoxical. Among C3grasses, a high photosynthetic rate (Aarea) may depend on higher vein density (Dv) and hydraulic conductance (Kleaf). However, the higherDvof C4grasses suggests a hydraulic surplus, given their reduced need for highKleafresulting from lower stomatal conductance (gs).Combining hydraulic and photosynthetic physiological data for diverse common garden C3and C4species with data for 332 species from the published literature, and mechanistic modeling, we validated a framework for linkages of photosynthesis with hydraulic transport, anatomy, and adaptation to aridity.C3and C4grasses had similarKleafin our common garden, but C4grasses had higherKleafthan C3species in our meta‐analysis. Variation inKleafdepended on outside‐xylem pathways. C4grasses have highKleaf : gs, which modeling shows is essential to achieve their photosynthetic advantage.Across C3grasses, higherAareawas associated with higherKleaf, and adaptation to aridity, whereas for C4species, adaptation to aridity was associated with higherKleaf : gs. These associations are consistent with adaptation for stress avoidance.Hydraulic traits are a critical element of evolutionary and ecological success in C3and C4grasses and are crucial avenues for crop design and ecological forecasting.more » « less
- 
            Summary Leaf dark respiration (Rd) acclimates to environmental changes. However, the magnitude, controls and time scales of acclimation remain unclear and are inconsistently treated in ecosystem models.We hypothesized thatRdand Rubisco carboxylation capacity (Vcmax) at 25°C (Rd,25,Vcmax,25) are coordinated so thatRd,25variations supportVcmax,25at a level allowing full light use, withVcmax,25reflecting daytime conditions (for photosynthesis), andRd,25/Vcmax,25reflecting night‐time conditions (for starch degradation and sucrose export). We tested this hypothesis temporally using a 5‐yr warming experiment, and spatially using an extensive field‐measurement data set. We compared the results to three published alternatives:Rd,25declines linearly with daily average prior temperature;Rdat average prior night temperatures tends towards a constant value; andRd,25/Vcmax,25is constant.Our hypothesis accounted for more variation in observedRd,25over time (R2 = 0.74) and space (R2 = 0.68) than the alternatives. Night‐time temperature dominated the seasonal time‐course ofRd, with an apparent response time scale ofc.2 wk.Vcmaxdominated the spatial patterns.Our acclimation hypothesis results in a smaller increase in globalRdin response to rising CO2and warming than is projected by the two of three alternative hypotheses, and by current models.more » « less
- 
            Context. Carbon monoxide (CO) is a poor tracer of H2in the diffuse interstellar medium (ISM), where most of the carbon is not incorporated into CO molecules, unlike the situation at higher extinctions. Aims. We present a novel, indirect method for constraining H2column densities (NH2) without employing CO observations. We show that previously recognized nonlinearities in the relation between the extinction,AV(H2), derived from dust emission and the H Icolumn density (NH I) are due to the presence of molecular gas. Methods. We employed archival (NH2) data, obtained from the UV spectra of stars, and calculatedAV(H2) toward these sight lines using 3D extinction maps. The following relation fits the data: logNH2= 1.38742 (logAV(H2))3− 0.05359 (logAV(H2))2+ 0.25722 logAV(H2) + 20.67191. This relation is useful for constrainingNH2in the diffuse ISM as it requires onlyNH Iand dust extinction data, which are both easily accessible. In 95% of the cases, the estimates produced by the fitted equation have deviations of less than a factor of 3.5. We constructed aNH2map of our Galaxy and compared it to the CO integrated intensity (WCO) distribution. Results. We find that the average ratio (XCO) betweenNH2andWCOis approximately equal to 2 × 1020cm−2(K km s−1)−1, consistent with previous estimates. However, we find that theXCOfactor varies by orders of magnitude on arcminute scales between the outer and the central portions of molecular clouds. For regions withNH2≳ 1020cm−2, we estimate that the average H2fractional abundance,fH2= 2NH2/(2NH2+NH I), is 0.25. Multiple (distinct) largely atomic clouds are likely found along high-extinction sightlines (AV≥ 1 mag), hence limitingfH2in these directions. Conclusions. More than 50% of the lines of sight withNH2≥ 1020cm−2are untraceable by CO with aJ= 1−0 sensitivity limitWCO= 1 K km s−1.more » « less
- 
            Many program analyses need to reason about pairs of matching actions, such as call/return, lock/unlock, or set-field/get-field. The family of Dyck languages {Dk}, whereDkhaskkinds of parenthesis pairs, can be used to model matching actions as balanced parentheses. Consequently, many program-analysis problems can be formulated as Dyck-reachability problems on edge-labeled digraphs.Interleaved Dyck-reachability(InterDyck-reachability), denoted byDk⊙Dk-reachability, is a natural extension of Dyck-reachability that allows one to formulate program-analysis problems that involvemultiplekinds of matching-action pairs. Unfortunately, the general InterDyck-reachability problem is undecidable. In this paper, we study variants of InterDyck-reachability onbidirected graphs, where for each edge ⟨p,q⟩ labeled by an open parenthesis ”(a”, there is an edge ⟨q,p⟩ labeled by the corresponding close parenthesis ”)a”, andvice versa. Language-reachability on a bidirected graph has proven to be useful both (1) in its own right, as a way to formalize many program-analysis problems, such as pointer analysis, and (2) as arelaxationmethod that uses a fast algorithm to over-approximate language-reachability on a directed graph. However, unlike its directed counterpart, the complexity of bidirected InterDyck-reachability still remains open. We establish the first decidable variant (i.e.,D1⊙D1-reachability) of bidirected InterDyck-reachability. InD1⊙D1-reachability, each of the two Dyck languages is restricted to have only a single kind of parenthesis pair. In particular, we show that the bidirectedD1⊙D1problem is in PTIME. We also show that when one extends each Dyck language to involvekdifferent kinds of parentheses (i.e.,Dk⊙Dk-reachability withk≥ 2), the problem is NP-hard (and therefore much harder). We have implemented the polynomial-time algorithm for bidirectedD1⊙D1-reachability.Dk⊙Dk-reachability provides a new over-approximation method for bidirectedDk⊙Dk-reachability in the sense thatDk⊙Dk-reachability can first be relaxed to bidirectedD1⊙D1-reachability, and then the resulting bidirectedD1⊙D1-reachability problem is solved precisely. We compare thisD1⊙D1-reachability-based approach against another known over-approximatingDk⊙Dk-reachability algorithm. Surprisingly, we found that the over-approximation approach based on bidirectedD1⊙D1-reachability computesmore precisesolutions, even though theD1⊙D1formalism is inherently less expressive than theDk⊙Dkformalism.more » « less
 An official website of the United States government
An official website of the United States government 
				
			 
					 
					
 
                                    