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.     

Curvature investigation in tapered fibers and its application to sensing and mode conversion

Non-adiabatic tapered fibers are basic photonic components used in a wide range of applications. Here we investigate a way to increase their utility through the controllable bending of one of their tapered sections. The experiments carried out explain, for the first time, the mechanics of this approach showing how these tapers can be used to build more sensitive sensors. Their use as highly efficient mode converters is also discussed.     

Recent advances and challenges in the recovery and purification of cellular exosomes

Exosomes are nanovesicles secreted by most cellular types that carry important biochemical compounds throughout the body with different purposes, playing a preponderant role in cellular communication. Because of their structure, physicochemical properties and stability, recent studies are focusing in their use as nanocarriers for different therapeutic compounds for the treatment of different diseases ranging from cancer to Parkinson's disease. However, current bioseparation protocols and methodologies are selected based on the final exosome application or intended use and present both advantages and disadvantages when compared among them. In this context, this review aims to present the most important technologies available for exosome isolation while discussing their advantages and disadvantages and the possibilities of being combined with other strategies. This is critical since the development of novel exosome‐based therapeutic strategies will be constrained to the effectiveness and yield of the selected downstream purification methodologies for which a thorough understanding of the available technological resources is needed.     

紫色球杆菌视紫红质光谱特性的机器学习研究

近年来，机器学习等人工智能技术被应用于蛋白质工程，其在蛋白质结构、功能预测、催化活性等研究中具有独特优势。在未知蛋白质结构的情况下，将蛋白质序列和功能特性与机器学习相结合，基于序列-活性关系（innovative sequence-activity relationship，ISAR）算法，将蛋白质氨基酸序列数字化，用快速傅里叶变换（fast four transform，FFT）进行预处理，再进行偏最小二乘回归建模，可在数据集较少情况下拟合得到最佳模型。通过机器学习对紫色球杆菌视紫红质（gloeobacter violaceus rhodopsin，GR）的突变体蛋白质氨基酸序列与光谱最大吸收波长进行建模，获得了最佳模型。用最佳索引LEVM760106建模得到的确定系数R² 为0.944，均方误差E为11.64。用小波变换进行的预处理，其R² 虽也约为0.944，但E大于11.64，不及FFT进行的预处理。方法较好地解决了蛋白质序列与功能特性之间的数学建模问题，在蛋白质工程中可为预测更优的突变体提供支持。     

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.     

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的逆问题，并用搜索法来解．而本文根据所证的定理，对每个问题一般只要解二、三个线性规划问题就能得到答案．