An efficient edge based data structure for the compressible Reynolds-averaged Navier–Stokes equations on hybrid unstructured meshes

An efficient edge based data structure has been developed in order to implement an unstructured vertex based finite volume algorithm for the Reynolds-averaged Navier–Stokes equations on hybrid meshes. In the present approach, the data structure is tailored to meet the requirements of the vertex based algorithm by considering data access patterns and cache efficiency. The required data are packed and allocated in a way that they are close to each other in the physical memory. Therefore, the proposed data structure increases cache performance and improves computation time. As a result, the explicit flow solver indicates a significant speed up compared to other open-source solvers in terms of CPU time. A fully implicit version has also been implemented based on the PETSc library in order to improve the robustness of the algorithm. The resulting algebraic equations due to the compressible Navier–Stokes and the one equation Spalart–Allmaras turbulence equations are solved in a monolithic manner using the restricted additive Schwarz preconditioner combined with the FGMRES Krylov subspace algorithm. In order to further improve the computational accuracy, the multiscale metric based anisotropic mesh refinement library PyAMG is used for mesh adaptation. The numerical algorithm is validated for the classical benchmark problems such as the transonic turbulent flow around a supercritical RAE2822 airfoil and DLR-F6 wing-body-nacelle-pylon configuration. The efficiency of the data structure is demonstrated by achieving up to an order of magnitude speed up in CPU times.     

Definition and detection of data-based uniqueness in evaluating bilinear (two-way) chemical measurements

Multivariate curve resolution methods, frequently used in analyzing bilinear data sets, result in ambiguous decomposition in general. Implementing the adequate constraints may lead to reduce the so-called rotational ambiguity drastically, and in the most favorable cases to the unique solution. However, in some special cases, non-negativity constraint as minimal information of the system is a sufficient condition to resolve profiles uniquely. Although, several studies on exploring the uniqueness of the bilinear non-negatively constrained multivariate curve resolution methods have been made in the literature, it has still remained a mysterious question. In 1995, Manne published his profile-based theorems giving the necessary and sufficient conditions of the unique resolution. In this study, a new term, i.e., data-based uniqueness is defined and investigated in details, and a general procedure is suggested for detection of uniquely recovered profile(s) on the basis of data set structure in the abstract space. Close inspection of Borgen plots of these data sets leads to realize the comprehensive information of local rank, and these argumentations furnish a basis for data-based uniqueness theorem. The reported phenomenon and its exploration is a new stage (it can be said fundament) in understanding and describing the bilinear (matrix-type) chemical data in general.     

Semilinear wave models with friction and viscoelastic damping

In this paper, we study the global (in time) existence of small data solutions to the Cauchy problem for the semilinear wave equation with friction, viscoelastic damping, and a power nonlinearity. We are interested in the connection between regularity assumptions for the data and the admissible range of exponents p in the power nonlinearity.     

Photo-Controlled Macroscopic Self-Assembly Based on Photo-Switchable Hetero-Complementary Quadruple Hydrogen Bonds

A photo-switchable hetero-complementary quadruple H-bonding array, which consists of an azobenzene-derived ureidopyrimidinone (UPy) module ( Azo-UPy ) and a nonphotoactive diamidonaphthyridine (DAN) derivative ( Napy-1 ), is constructed based on a reversible photo-locking approach. Upon UV (390 nm)/Vis (460 nm) light irradiations, photo-switchable quadruple H-bonded dimerization between Azo-UPy and Napy-1 can be achieved with exhibiting 4.8×10⁴-fold differences in binding strength (ON/OFF ratios). Furthermore, smart polymeric gels with unique photo-controlled macroscopic self-assembly behavior can be fabricated by introducing such quadruple H-bonding array as photo-regulable noncovalent interfacial connections.     

Spectral estimates for saddle point matrices arising in weak constraint four‐dimensional variational data assimilation

We consider the large sparse symmetric linear systems of equations that arise in the solution of weak constraint four‐dimensional variational data assimilation, a method of high interest for numerical weather prediction. These systems can be written as saddle point systems with a 3 × 3 block structure but block eliminations can be performed to reduce them to saddle point systems with a 2 × 2 block structure, or further to symmetric positive definite systems. In this article, we analyse how sensitive the spectra of these matrices are to the number of observations of the underlying dynamical system. We also obtain bounds on the eigenvalues of the matrices. Numerical experiments are used to confirm the theoretical analysis and bounds.     

Enhancing signal-to-noise ratio and resolution in low-field NMR relaxation measurements using post-acquisition digital filters

The traditional way to enhance signal-to-noise ratio (SNR) of nuclear magnetic resonance (NMR) signals is to increase the number of scans. However, this procedure increases the measuring time that can be prohibitive for some applications. Therefore, we have tested the use of several post-acquisition digital filters to enhance SNR up to one order of magnitude in time domain NMR (TD-NMR) relaxation measurements. The procedures were studied using continuous wave free precession (CWFP-T₁) signals, acquired with very low flip angles that contain six times more noise than the Carr–Purcell–Meiboom–Gill (CPMG) signal of the same sample and experimental time. Linear (LI) and logarithmic (LO) data compression, low-pass infinity impulse response (LP), Savitzky–Golay (SG), and wavelet transform (WA) post-acquisition filters enhanced the SNR of the CWFP-T₁ signals by at least six times. The best filters were LO, SG, and WA that have high enhancement in SNR without significant distortions in the ILT relaxation distribution data. Therefore, it was demonstrated that these post-acquisition digital filters could be a useful way to denoise CWFP-T₁, as well as CPMG noisy signals, and consequently reducing the experimental time. It was also demonstrated that filtered CWFP-T₁ method has the potential to be a rapid and nondestructive method to measure fat content in beef and certainly in other meat samples.     

两个DEA的逆问题的解法的探讨

文[1]提出了两个DEA的逆问题，并用搜索法来解．而本文根据所证的定理，对每个问题一般只要解二、三个线性规划问题就能得到答案．     

关于一类二次哈密尔顿系统在二次扰动下的极限环个数问题

本文研究了一类具有两个鞍点和一个中心的通用二次哈密尔顿向量场在二次扰动下的三参数开折，证明极限环的最小上界为２。     

Recursive partition and amalgamation with the exponential family: Theory and applications

The theory of tree-growing (RECPAM approach) is developed for outcome variables which are distributed as the canonical exponential family. The general RECPAM approach (consisting of three steps: recursive partition, pruning and amalgamation), is reviewed. This is seen as constructing a partition with maximal information content about a parameter to be predicted, followed by simplification by the elimination of ‘negligible’ information. The measure of information is defined for an exponential family outcome as a deviance difference, and appropriate modifications of pruning and amalgamation rules are discussed. It is further shown how the proposed approach makes it possible to develop tree-growing for situations usually treated by generalized linear models (GLIM). In particular, Poisson and logistic regression can be tree-structured. Moreover, censored survival data can be treated, as in GLIM, by observing a formal equivalence of the likelihood under random censoring and an appropriate Poisson model. Three examples are given of application to Poisson, binary and censored survival data.     

VRPTW的扰动恢复及其TABU SEARCH算法

本文对带时间窗的车辆路线安排扰动恢复问题进行了讨论,分析了各种可能的扰动:增加减少客户,时间窗、客户需求及路线可行性的扰动,构造了扰动模型.利用禁忌搜索算法对问题进行求解,同时通过对模型参数重新设置,得到了多个满足要求的不同的解,这样使解更具有实际可行性和有效性.