12 April 2022 in Frontiers in Physics
Particulate matter (PM2.5 and PM10) and ozone (O3) are the two major air pollutants in China in recent years. The fluctuations of PM2.5, PM10 and O3 strongly depend on the weather processes and anthropogenic emission. These processes may lead to the existence of short- and long-term memory behaviors in air pollutants. Hence, here we use the autoregressive parameter a of the first-order autoregressive process [AR (1)] to characterize the short-term memory effects of pollutants. We estimate the scaling exponent α using detrended fluctuation analysis (DFA) for the long-term memory effects of air pollutants (PM2.5, PM10, and O3) in summer and winter for different cities in China. Our results show that PM2.5, PM10, and O3 have strong short-term and long-term memory characteristics both in summer and winter. Furthermore, both the short- and long-term memory effects are stronger in winter than summer for most cities associated with stronger and longer persistent weather systems in winter. In general, the scaling exponent α of PM2.5 and PM10 are smaller for northern cities than those of southern cities in China. The long-term memory patterns of O3 are stronger in northern cities and weaker in southern cities in relative to those of PM2.5 and PM10 in winter. Our results show that the short- and long-term memory behaviors of air pollutions are dominated by the weather systems with different time scales.
10 April 2026 in ACM Transactions on Design Automation of Electronic Systems
Timing-driven placement is very important to achieve timing closure especially as designs become increasingly complex. This article presents a novel Timing-Driven Placement (TDP) framework that integrates a graph convolutional network (GCN), Dirichlet boundary conditions, and a nonlinear placement engine to optimize placement quality with timing awareness throughout the flow. The proposed methodology begins by clustering components based on their interconnection topology, while Dirichlet boundary conditions are applied to handle fixed components such as IOs and macros. This yields a reduced graph with minimized inter-cluster connectivity, simplifying timing optimization. A GCN is then trained to learn a generalized and optimized mapping from circuit connectivity to physical wirelength. To improve early-stage timing estimation, virtual buffers are inserted prior to Static Timing Analysis (STA) to eliminate maximum capacitance violations. With this improved timing fidelity, STA provides pin-level slack, which is then used to dynamically adjust interconnection weights, guiding the placement of timing-critical components toward improved timing closure. Experimental results on ICCAD2015 contest benchmarks demonstrate that our algorithm can improve worse negative slack and total negative slack by 6% compared to the state-of-the-art method.