Creating sustainable industrial building in China by lowering energy use and improving the working environment

Over 70% of energy in China is consumed by industrial buildings and related support activities. In order to reduce production costs, owners of factories tend to pay little attention to protecting the environment or workers’ health, causing many serious consequences. Poorly designed buildings require more energy to operate and are less energy efficient to maintain. A lack of natural lighting results in more energy consumption for interior illumination, and improper fenestration design requires more energy to keep buildings cool. An uncomfortable working environment will affect the working efficiency and physical health of the labor force. In this thesis, two simple, passive strategies—daylighting and passive cooling for factory buildings—are studied and tested separately, aiming to reduce energy consumption and improve the working environment. The study location selected is in the Shanghai suburban area. The object of the study is a typical, old manufacturing plant that is still in use, which represents the majority of industrial buildings in China. Instead of rebuilding the entire industrial building construction, renovating existing industrial buildings, by applying a passive strategy, has huge potential to save energy and improve the working environment. Whether and how much these passive strategies can reduce energy consumption of existing industrial buildings and improve the working environment will be explored by comparing existing data analysis to a renovated building data analysis

Representation Learning for Scale-free Networks

Network embedding aims to learn the low-dimensional representations of vertexes in a network, while structure and inherent properties of the network is preserved. Existing network embedding works primarily focus on preserving the microscopic structure, such as the first- and second-order proximity of vertexes, while the macroscopic scale-free property is largely ignored. Scale-free property depicts the fact that vertex degrees follow a heavy-tailed distribution (i.e., only a few vertexes have high degrees) and is a critical property of real-world networks, such as social networks. In this paper, we study the problem of learning representations for scale-free networks. We first theoretically analyze the difficulty of embedding and reconstructing a scale-free network in the Euclidean space, by converting our problem to the sphere packing problem. Then, we propose the "degree penalty" principle for designing scale-free property preserving network embedding algorithm: punishing the proximity between high-degree vertexes. We introduce two implementations of our principle by utilizing the spectral techniques and a skip-gram model respectively. Extensive experiments on six datasets show that our algorithms are able to not only reconstruct heavy-tailed distributed degree distribution, but also outperform state-of-the-art embedding models in various network mining tasks, such as vertex classification and link prediction.Comment: 8 figures; accepted by AAAI 201

Topological dimensions of attractors for partial functional differential equations in Banach spaces

The main objective of this paper is to obtain estimations of Hausdorff dimension as well as fractal dimension of global attractors and pullback attractors for both autonomous and nonautonomous functional differential equations (FDEs) in Banach spaces. New criterions for the finite Hausdorff dimension and fractal dimension of attractors in Banach spaces are firslty proposed by combining the squeezing property and the covering of finite subspace of Banach spaces, which generalize the method established in Hilbert spaces. In order to surmount the barrier caused by the lack of orthogonal projectors with finite rank, which is the key tool for proving the squeezing property of partial differential equations in Hilbert spaces, we adopt the state decomposition of phase space based on the exponential dichotomy of the studied FDEs to obtain similar squeezing property. The theoretical results are applied to a retarded nonlinear reaction-diffusion equation and a non-autonomous retarded functional differential equation in the natural phase space, for which explicit bounds of dimensions that do not depend on the entropy number but only depend on the spectrum of the linear parts and Lipschitz constants of the nonlinear parts are obtained

Capturing Evolution Genes for Time Series Data

The modeling of time series is becoming increasingly critical in a wide variety of applications. Overall, data evolves by following different patterns, which are generally caused by different user behaviors. Given a time series, we define the evolution gene to capture the latent user behaviors and to describe how the behaviors lead to the generation of time series. In particular, we propose a uniform framework that recognizes different evolution genes of segments by learning a classifier, and adopt an adversarial generator to implement the evolution gene by estimating the segments' distribution. Experimental results based on a synthetic dataset and five real-world datasets show that our approach can not only achieve a good prediction results (e.g., averagely +10.56% in terms of F1), but is also able to provide explanations of the results.Comment: a preprint version. arXiv admin note: text overlap with arXiv:1703.10155 by other author

Invariant manifolds for stochastic delayed partial differential equations of parabolic type

The aim of this paper is to prove the existence and smoothness of stable and unstable invariant manifolds for a stochastic delayed partial differential equation of parabolic type. The stochastic delayed partial differential equation is firstly transformed into a random delayed partial differential equation by a conjugation, which is then recast into a Hilbert space. For the auxiliary equation, the variation of constants formula holds and we show the existence of Lipschitz continuous stable and unstable manifolds by the Lyapunov-Perron method. Subsequently, we prove the smoothness of these invariant manifolds under appropriate spectral gap condition by carefully investigating the smoothness of auxiliary equation, after which, we obtain the invariant manifolds of the original equation by projection and inverse transformation. Eventually, we illustrate the obtained theoretical results by their application to a stochastic single-species population model

The semiannual cycle of sea surface and free air temperatures

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Earth, Atmospheric, and Planetary Sciences, 1995.Includes bibliographical references (leaves 55-57).by Wenjie Hu.M.S

Coresets for Wasserstein Distributionally Robust Optimization Problems

Wasserstein distributionally robust optimization (\textsf{WDRO}) is a popular model to enhance the robustness of machine learning with ambiguous data. However, the complexity of \textsf{WDRO} can be prohibitive in practice since solving its ``minimax'' formulation requires a great amount of computation. Recently, several fast \textsf{WDRO} training algorithms for some specific machine learning tasks (e.g., logistic regression) have been developed. However, the research on designing efficient algorithms for general large-scale \textsf{WDRO}s is still quite limited, to the best of our knowledge. \textit{Coreset} is an important tool for compressing large dataset, and thus it has been widely applied to reduce the computational complexities for many optimization problems. In this paper, we introduce a unified framework to construct the $\epsilon$-coreset for the general \textsf{WDRO} problems. Though it is challenging to obtain a conventional coreset for \textsf{WDRO} due to the uncertainty issue of ambiguous data, we show that we can compute a ``dual coreset'' by using the strong duality property of \textsf{WDRO}. Also, the error introduced by the dual coreset can be theoretically guaranteed for the original \textsf{WDRO} objective. To construct the dual coreset, we propose a novel grid sampling approach that is particularly suitable for the dual formulation of \textsf{WDRO}. Finally, we implement our coreset approach and illustrate its effectiveness for several \textsf{WDRO} problems in the experiments

Paradoxes and resolutions for semiparametric fusion of individual and summary data

Suppose we have available individual data from an internal study and various types of summary statistics from relevant external studies. External summary statistics have been used as constraints on the internal data distribution, which promised to improve the statistical inference in the internal data; however, the additional use of external summary data may lead to paradoxical results: efficiency loss may occur if the uncertainty of summary statistics is not negligible and large estimation bias can emerge even if the bias of external summary statistics is small. We investigate these paradoxical results in a semiparametric framework. We establish the semiparametric efficiency bound for estimating a general functional of the internal data distribution, which is shown to be no larger than that using only internal data. We propose a data-fused efficient estimator that achieves this bound so that the efficiency paradox is resolved. Besides, a debiased estimator is further proposed which has selection consistency property by employing adaptive lasso penalty so that the resultant estimator can achieve the same asymptotic distribution as the oracle one that uses only unbiased summary statistics, which resolves the bias paradox. Simulations and application to a Helicobacter pylori infection dataset are used to illustrate the proposed methods.Comment: 16 pages, 3 figure

Harnessing the Power of Many: Extensible Toolkit for Scalable Ensemble Applications

Many scientific problems require multiple distinct computational tasks to be executed in order to achieve a desired solution. We introduce the Ensemble Toolkit (EnTK) to address the challenges of scale, diversity and reliability they pose. We describe the design and implementation of EnTK, characterize its performance and integrate it with two distinct exemplar use cases: seismic inversion and adaptive analog ensembles. We perform nine experiments, characterizing EnTK overheads, strong and weak scalability, and the performance of two use case implementations, at scale and on production infrastructures. We show how EnTK meets the following general requirements: (i) implementing dedicated abstractions to support the description and execution of ensemble applications; (ii) support for execution on heterogeneous computing infrastructures; (iii) efficient scalability up to O(10^4) tasks; and (iv) fault tolerance. We discuss novel computational capabilities that EnTK enables and the scientific advantages arising thereof. We propose EnTK as an important addition to the suite of tools in support of production scientific computing

Adaptive Model Predictive Control for Engine-Driven Ducted Fan Lift Systems using an Associated Linear Parameter Varying Model

Ducted fan lift systems (DFLSs) powered by two-stroke aviation piston engines present a challenging control problem due to their complex multivariable dynamics. Current controllers for these systems typically rely on proportional-integral algorithms combined with data tables, which rely on accurate models and are not adaptive to handle time-varying dynamics or system uncertainties. This paper proposes a novel adaptive model predictive control (AMPC) strategy with an associated linear parameter varying (LPV) model for controlling the engine-driven DFLS. This LPV model is derived from a global network model, which is trained off-line with data obtained from a general mean value engine model for two-stroke aviation engines. Different network models, including multi-layer perceptron, Elman, and radial basis function (RBF), are evaluated and compared in this study. The results demonstrate that the RBF model exhibits higher prediction accuracy and robustness in the DFLS application. Based on the trained RBF model, the proposed AMPC approach constructs an associated network that directly outputs the LPV model parameters as an adaptive, robust, and efficient prediction model. The efficiency of the proposed approach is demonstrated through numerical simulations of a vertical take-off thrust preparation process for the DFLS. The simulation results indicate that the proposed AMPC method can effectively control the DFLS thrust with a relative error below 3.5%