The construction industry is adopting a collaborative paradigm by combining Lean construction (LC) principles and BIM capabilities. Existing studies lack sufficient case studies and performance evaluations, especially for the disassembly and reconstruction stage, creating a gap in the practical application of BIM and Lean construction (BIM-LC) in China. To bridge this gap, this study quantitatively assessed the BIM-LC methodology in a relocation project in Dezhou, China. The project employed BIM-LC practices such as the Last-Planner System (LPS), Just-In-Time (JIT), Kanban, Value-Stream Mapping (VSM), and Continuous Improvement to enhance construction efficiency and minimize waste. Two main areas of the relocation process were investigated: (i) the identification of common barriers and on-site solutions to the implementation of BIM-LC; (ii) evaluation of the construction efficiency, construction and demolition waste (CDW), and carbon-emission performance. The results showed that the BIM-LC strategy improved labor efficiency and productivity by 3.4% and 12.9%, shortened the construction period by 11 days, reduced construction costs by 8.07% (i.e., USD 9093.8), and reduced transportation costs by 12.5% (i.e., USD 1875). The CDW generation rate ranged from 1–5%, which is comparable to the rates observed in residential construction across various countries. The total weight was 1903.8 kg (10.4 kg/m2). Moreover, the carbon emission during the relocation process was 15,288.4 kgCO2e, with a carbon intensity of 83.5 kg/m2. This study extends the knowledge systems on the application of the BIM-LC method in relocation projects and supports data-driven decision making. It also plays a crucial role in fostering new markets for recycled components, contributing to the realization of a sustainable built environment.
China is entering a new era characterized by carbon peaking and carbon neutrality, and the construction industry, which accounts for a high proportion of social carbon emissions, urgently needs a method to calculate and predict building carbon emissions in advance. This study proposes a method for calculating the life cycle carbon emissions (LCCEs) of buildings based on building information modeling (BIM) technology. The method uses a BIM universal data framework to establish a building carbon emission calculation model and a building carbon emission factor database instance. Taking prefabricated construction projects as an example, it is compared with the traditional calculation method. The results show that the method can more accurately predict building carbon emissions and provide methods and a basis for the construction industry to control carbon emissions in advance.
9 August 2022 in International Journal of Applied Electromagnetics and Mechanics
We revisit the classical problem of Fourier-sparse signal reconstruction -- a variant of the \emph{Set Query} problem -- which asks to efficiently reconstruct (a subset of) a $d$-dimensional Fourier-sparse signal ($\|\hat{x}(t)\|_0 \leq k$), from minimum \emph{noisy} samples of $x(t)$ in the time domain. We present a unified framework for this problem by developing a theory of sparse Fourier transforms (SFT) for frequencies lying on a \emph{lattice}, which can be viewed as a ``semi-continuous'' version of SFT in between discrete and continuous domains. Using this framework, we obtain the following results: $\bullet$ **Dimension-free Fourier sparse recovery** We present a sample-optimal discrete Fourier Set-Query algorithm with $O(k^{\omega+1})$ reconstruction time in one dimension, \emph{independent} of the signal's length ($n$) and $\ell_\infty$-norm. This complements the state-of-art algorithm of [Kapralov, STOC 2017], whose reconstruction time is $\tilde{O}(k \log^2 n \log R^*)$, where $R^* \approx \|\hat{x}\|_\infty$ is a signal-dependent parameter, and the algorithm is limited to low dimensions. By contrast, our algorithm works for arbitrary $d$ dimensions, mitigating the $\exp(d)$ blowup in decoding time to merely linear in $d$. A key component in our algorithm is fast spectral sparsification of the Fourier basis. $\bullet$ **High-accuracy Fourier interpolation** In one dimension, we design a poly-time $(3+ \sqrt{2} +\epsilon)$-approximation algorithm for continuous Fourier interpolation. This bypasses a barrier of all previous algorithms [Price and Song, FOCS 2015, Chen, Kane, Price and Song, FOCS 2016], which only achieve $c>100$ approximation for this basic problem. Our main contribution is a new analytic tool for hierarchical frequency decomposition based on \emph{noise cancellation}.
The \emph{Fast Gaussian Transform} (FGT) enables subquadratic-time multiplication of an $n\times n$ Gaussian kernel matrix $\mathsf{K}_{i,j}= \exp ( - \| x_i - x_j \|_2^2 ) $ with an arbitrary vector $h \in \mathbb{R}^n$, where $x_1,\dots, x_n \in \mathbb{R}^d$ are a set of \emph{fixed} source points. This kernel plays a central role in machine learning and random feature maps. Nevertheless, in most modern data analysis applications, datasets are dynamically changing (yet often have low rank), and recomputing the FGT from scratch in (kernel-based) algorithms incurs a major computational overhead ($\gtrsim n$ time for a single source update $\in \mathbb{R}^d$). These applications motivate a \emph{dynamic FGT} algorithm, which maintains a dynamic set of sources under \emph{kernel-density estimation} (KDE) queries in \emph{sublinear time} while retaining Mat-Vec multiplication accuracy and speed. Assuming the dynamic data-points $x_i$ lie in a (possibly changing) $k$-dimensional subspace ($k\leq d$), our main result is an efficient dynamic FGT algorithm, supporting the following operations in $\log^{O(k)}(n/\varepsilon)$ time: (1) Adding or deleting a source point, and (2) Estimating the ``kernel-density'' of a query point with respect to sources with $\varepsilon$ additive accuracy. The core of the algorithm is a dynamic data structure for maintaining the \emph{projected} ``interaction rank'' between source and target boxes, decoupled into finite truncation of Taylor and Hermite expansions.
We study the problem of interpolating a noisy Fourier-sparse signal in the time duration $[0, T]$ from noisy samples in the same range, where the ground truth signal can be any $k$-Fourier-sparse signal with band-limit $[-F, F]$. Our main result is an efficient Fourier Interpolation algorithm that improves the previous best algorithm by [Chen, Kane, Price, and Song, FOCS 2016] in the following three aspects: $\bullet$ The sample complexity is improved from $\widetilde{O}(k^{51})$ to $\widetilde{O}(k^{4})$. $\bullet$ The time complexity is improved from $ \widetilde{O}(k^{10\omega+40})$ to $\widetilde{O}(k^{4 \omega})$. $\bullet$ The output sparsity is improved from $\widetilde{O}(k^{10})$ to $\widetilde{O}(k^{4})$. Here, $\omega$ denotes the exponent of fast matrix multiplication. The state-of-the-art sample complexity of this problem is $\sim k^4$, but was only known to be achieved by an *exponential-time* algorithm. Our algorithm uses the same number of samples but has a polynomial runtime, laying the groundwork for an efficient Fourier Interpolation algorithm. The centerpiece of our algorithm is a new sufficient condition for the frequency estimation task -- a high signal-to-noise (SNR) band condition -- which allows for efficient and accurate signal reconstruction. Based on this condition together with a new structural decomposition of Fourier signals (Signal Equivalent Method), we design a cheap algorithm for estimating each "significant" frequency within a narrow range, which is then combined with a signal estimation algorithm into a new Fourier Interpolation framework to reconstruct the ground-truth signal.