Search

In this paper, we proved a local arithmetic Siegel-Weil formula for a $U(1, 1)$-Shimura variety at a ramified prime, a.k.a. a Kudla-Rapoport conjecture at a ramified case. The formula needs to be modified from the original Kudla-Rapoport conjecture. In the process, we also gives an explicit decomposition of the special divisors of the Rapoport-Zink space of unitary type $(1, 1)$ (Kr\"amer model). A key ingredient is to relate the Rapoport-Zink space to the Drinfeld upper plane., Comment: 34pp, final version, published in Transactions of the AMS

The real challenge in drone-logistics is to develop an economically-feasible Unmanned Aerial Mobility Network (UAMN). In this paper, we propose an integrated airport location (strategic decision) and routes planning (operational decision) optimization framework to minimize the total cost of the network, while guaranteeing flow constraints, capacity constraints, and electricity constraints. To facility expensive long-term infrastructure planning facing demand uncertainty, we develop a data-driven risk-averse two-stage stochastic optimization model based on the Wasserstein distance. We develop a reformulation technique which simplifies the worst-case expectation term in the original model, and obtain a fractable Min-Max solution procedure correspondingly. Using Lagrange multipliers, we successfully decompose decision variables and reduce the complexity of computation. To provide managerial insights, we design specific numerical examples. For example, we find that the optimal network configuration is affected by the "pooling effects" in channel capacities. A nice feature of our DRO framework is that the optimal network design is relatively robust under demand uncertainty. Interestingly, a candidate node without historical demand records can be chosen to locate an airport. We demonstrate the application of our model for a real medical resources transportation problem with our industry partner, collecting donated blood to a blood bank in Hangzhou, China., Comment: 31pages

In this article, we will derive the differential equations considering the concentration polarization (\textsc{cp}) in membrane separations and purifications, which involve convective-diffusive equations of the concentration polarization layer and the Spiegler-Kedem-Katchalsky (\textsc{skk}) model of the membrane layer. Analytical solutions of these differential equations are straightforward and given. The film theory coupled \textsc{skk} model can be used to evaluate the degree of concentration polarization, and predict flux and rejection rates., Comment: There is an error in Eq. (8) on the page 8

Prominent features of simulated moving bed (SMB) chromatography processes in the downstream processing is based on the determination of operating conditions. However, effects of different types of uncertainties have to be studied and analysed whenever the triangle theory or numerical optimization approaches are applied. In this study, a Bayesian inference based method is introduced to consider the uncertainty of operating conditions on the performance assessment, of a glucose-fructose SMB unit under linear condition. A multiple chain Markov Chain Monte Carlo (MCMC) algorithm (i.e., Metropolis algorithm with delayed rejection and adjusted Metropolis) is applied to generate samples. The proposed method renders versatile information by constructing from the MCMC samples, e.g., posterior distributions, uncertainties, credible intervals of the operating conditions, and posterior predictive check and Pareto fronts between each pair of the performance indicators. Additionally, the MCMC samples can be mapped onto the $(m_\text{II}, m_\text{III})$ and $(m_\text{IV}, m_\text{I})$ plains to show the actually complete separation region under uncertainties. The proposed method is a convenient tool to find both optimal values and uncertainties of the operating conditions. Moreover, it is not limited to SMB processes under the linear isotherm; and it should be more powerful in the nonlinear scenarios., Comment: 32 pages, 8 figures, 4 tables

Model-based process design of ion-exchange simulated moving bed (IEX-SMB) chromatography for center-cut separation of proteins is studied. Use of nonlinear binding models that describe more accurate adsorption behaviours of macro-molecules could make it impossible to utilize triangle theory to obtain operating parameters. Moreover, triangle theory provides no rules to design salt profiles in IEX-SMB. In the modelling study here, proteins (i.e., ribonuclease, cytochrome and lysozyme) on the chromatographic columns packed with strong cation-exchanger SP Sepharose FF is used as an example system. The general rate model with steric mass-action kinetics was used; two closed-loop IEX-SMB network schemes were investigated (i.e., cascade and eight-zone schemes). Performance of the IEX-SMB schemes was examined with respect to multi-objective indicators (i.e., purity and yield) and productivity, and compared to a single column batch system with the same amount of resin utilized. A multi-objective sampling algorithm, Markov Chain Monte Carlo (MCMC), was used to generate samples for constructing the Pareto optimal fronts. MCMC serves on the sampling purpose, which is interested in sampling the Pareto optimal points as well as those near Pareto optimal. Pareto fronts of the three schemes provide the full information of trade-off between the conflicting indicators of purity and yield. The results indicate the cascade IEX-SMB scheme and the integrated eight-zone IEX-SMB scheme have the similar performance that both outperforms the single column batch system., Comment: 26 pages, 14 figures, 7 tables

Many statistical estimators for high-dimensional linear regression are M-estimators, formed through minimizing a data-dependent square loss function plus a regularizer. This work considers a new class of estimators implicitly defined through a discretized gradient dynamic system under overparameterization. We show that under suitable restricted isometry conditions, overparameterization leads to implicit regularization: if we directly apply gradient descent to the residual sum of squares with sufficiently small initial values, then under some proper early stopping rule, the iterates converge to a nearly sparse rate-optimal solution that improves over explicitly regularized approaches. In particular, the resulting estimator does not suffer from extra bias due to explicit penalties, and can achieve the parametric root-n rate when the signal-to-noise ratio is sufficiently high. We also perform simulations to compare our methods with high dimensional linear regression with explicit regularization. Our results illustrate the advantages of using implicit regularization via gradient descent after overparameterization in sparse vector estimation., Comment: Accepted by Biometrika

In this paper, we investigate the energy system design problems with the multi-generation technologies, i.e., simultaneous generation of multiple types of energy. We propose a long-term planning model which integrates macro-level strategic decisions such as facility location and multi-generation technology investment, and micro-level operational decisions such as production planning and energy transportation. Our results illustrate the economic value of multi-generation technologies in lieu of the spatio-temporal demand uncertainty for energy. In particular, we show that the multi-generation technologies can reduce demand uncertainty by risk pooling both within and across different facilities.