A New Generalized Riccati Equation Rational Expansion Method to Generalized Burgers-Fisher Equation with Nonlinear Terms of Any Order

In this paper, based on a new more general ansatz, a new algebraic method, named generalized Riccati equation rational expansion method, is devised for constructing travelling wave solutions for nonlinear evolution equations with nonlinear terms of any order. Compared with most existing tanh methods for finding travelling wave solutions, the proposed method not only recovers the results by most known algebraic methods, but also provides new and more general solutions. We choose the generalized Burgers-Fisher equation with nonlinear terms of any order to illustrate our method. As a result, we obtain several new kinds of exact solutions for the equation. This approach can also be applied to other nonlinear evolution equations with nonlinear terms of any order.     

Simple global minimization algorithm for one-variable rational functions

Sturm's chain technique for evaluation of a number of real roots of polynomials is applied to construct a simple algorithm for global optimization of polynomials or generally for rational functions of finite global minimal value. The method can be applied both to find the global minimum in an interval or without any constraints. It is shown how to use the method to minimize globally a truncated Fourier series. The results of numerical tests are presented and discussed. The cost of the method scales as the square of the degree of the polynomial.     

On a quadratic functional occurring in a bivariate scattered data interpolation problem

Sunto L’applicazione di noti metodi che utilizzano funzioni di tipo blending per la costruzione di funzioni bivariate C¹ per l’interpolazione di dati, richiede la conoscenza delle derivate parziali del primo ordine ai vertici di una triangolazione sottostante. In questo lavoro consideriamo il metodo proposto da Nielson, che consiste nel calcolare stime delle derivate parziali del primo ordine minimizzando un opportuno funzionale quadratico, caratterizzato da parametri di tensione non negativi. Scopo del lavoro è l’analisi di alcune proprietà particolari di questo funzionale per la costruzione di algoritmi efficienti e robusti per la determinazione delle stime suddette delle derivate quando si ha a che fare con insiemi di dati di grandi dimensioni. Abstract The application of widely known blending methods for constructingC ¹ bivariate functions interpolating scattered data requires the knowledge of the partial derivatives of first order at the vertices of an underlying triangulation. In this paper we consider the method proposed by Nielson that consists in computing estimates of the first order partial derivatives by minimizing an appropriate quadratic functional, characterized by nonnegative tension parameters. The aim of the paper is to analyse some peculiar properties of this functional in order to construct robust and efficient algorithms for determining the above estimates of the derivatives when we are concerned with extremely large data sets.      

Twisted cubics, bis

We consider the smooth compactification constructed in [12] for a space of varieties like twisted cubics. We show this compactification embeds naturally in a product of flag varieties.Partially supported by CNPq, Pronex (ALGA)     

An Extremal Problem Arising in the Dynamics of Two-Phase Materials That Directly Reveals Information about the Internal Geometry

In two-phase materials, each phase having a non-local response in time, it has been found that for some driving fields the response somehow untangles at specific times, and allows one to directly infer useful information about the geometry of the material, such as the volume fractions of the phases. Motivated by this, and to obtain an algorithm for designing appropriate driving fields, we find approximate, measure independent, linear relations between the values that Markov functions take at a given set of possibly complex points, not belonging to the interval [-1,1] where the measure is supported. The problem is reduced to simply one of polynomial approximation of a given function on the interval [-1,1] and, to simplify the analysis, Chebyshev approximation is used. This allows one to obtain explicit estimates of the error of the approximation, in terms of the number of points and the minimum distance of the points to the interval [-1,1]. Assuming this minimum distance is bounded below by a number greater than 1/2, the error converges exponentially to zero as the number of points is increased. Approximate linear relations are also obtained that incorporate a set of moments of the measure. In the context of the motivating problem, the analysis also yields bounds on the response at any particular time for any driving field, and allows one to estimate the response at a given frequency using an appropriately designed driving field that effectively is turned on only for a fixed interval of time. The approximation extends directly to Markov-type functions with a positive semidefinite operator valued measure, and this has applications to determining the shape of an inclusion in a body from boundary flux measurements at a specific time, when the time-dependent boundary potentials are suitably tailored. © 2022 Wiley Periodicals, Inc.     

Optimal Control for Multiscale Elliptic Equations with Rough Coefficients

This paper concerns the convex optimal control problem governed by multiscale elliptic equations with arbitrarily rough $L^\infty$ coefficients, which has not only complex coupling between nonseparable scales and nonlinearity, but also important applications in composite materials and geophysics. We use one of the recently developed numerical homogenization techniques, the so-called Rough Polyharmonic Splines (RPS) and its generalization (GRPS) for the efficient resolution of the elliptic operator on the coarse scale. Those methods have optimal convergence rate which do not rely on the regularity of the coefficients nor the concepts of scale-separation or periodicity. As the iterative solution of the nonlinearly coupled OCP-OPT formulation for the optimal control problem requires solving the corresponding (state and co-state) multiscale elliptic equations many times with different right hand sides, numerical homogenization approach only requires one-time pre-computation on the fine scale and the following iterations can be done with computational cost proportional to coarse degrees of freedom. Numerical experiments are presented to validate the theoretical analysis.     

Virtual screening of protein kinase C inhibitors from natural product library to modulate general anaesthetic effects

Protein kinase C (PKC) plays a key role in neurotransmission in the central nervous system, and targeting PKC domain is considered as a strategy to modulate the anaesthetic effects. In this study, we described a synthetic pipeline to perform high-throughput virtual screening against a large library of 3D structural natural products released recently in order to discover those potential PKC modulators. A total of 100 natural products with top scores were raised, from which 12 promising candidates were tested to determine their inhibitory potencies against PKC. As might be expected, the promiscuous kinase inhibitor staurosporine showed a high PKC inhibitory activity (IC₅₀ = 64 nM), and other two tested compounds, i.e. fisetin and tetrahydropapaverine, were also highly potent with their activities at nanomolar level (IC₅₀ = 370 and 190, respectively).     

色谱柱分类数据库用于指导天然药物化学对照品色谱纯度测定时色谱柱理性选择

由于中药化学对照品多数来源于动植物药材,很容易混有结构类似物,故有机杂质测定是可能影响其化学对照品赋值准确性的关键风险因素。中药化学对照品的有机杂质测定通常采用药典收载或文献报道的高效液相色谱法,这些方法通常仅规定“以十八烷基硅烷键合硅胶为填充剂”,无适宜色谱柱的品牌信息,或者实验室无文献所用的色谱柱品牌,而目前市场上已有800多种品牌的C₁₈柱,生产工艺的不同导致不同品牌C₁₈柱的选择性有差异,甚至差异显著。这很容易出现由于色谱柱选择不适宜而导致测定结果不准确的风险。该文采用国外色谱柱分类数据库指导对照品纯度考察时色谱柱的理性选择,尽可能减少色谱柱盲选可能导致的纯度结果不准确的风险。首先,用数据库挑选2根选择性差异显著的色谱柱（选择性因子F≥6）进行平行实验,以尽可能反映采用不同品牌色谱柱可能出现的分离效果差异。如果这2根色谱柱的分离效果及纯度测定结果无显著性差异,则可以交叉验证该对照品纯度测定的准确性。否则需要从数据库中选择另外1根与之前试验中分离效果更好、选择性相似的色谱柱进行纯度结果验证。在N-反式-p-对香豆酰基酪胺和表儿茶素没食子酸酯首批对照品的纯度考察中,使用了上述策略并验证了其有效性和科学性,计划推广应用至更多的中药化学对照品,特别当其可能含碱性或弱酸性化合物时,更应该尝试采用本文推荐的色谱柱选择策略交叉验证其纯度测定结果的准确性。     

半参数线性混合效应模型的联合变量选择

多数基于线性混合效应模型的变量选择方法分阶段对固定效应和随机效应进行选择,方法繁琐、易产生模型偏差,且大部分非参数和半参数的线性混合效应模型只涉及非参数部分的光滑度或者固定效应的选择,并未涉及非参变量或随机效应的选择。本文用B样条函数逼近非参数函数部分,从而把半参数线性混合效应模型转化为带逼近误差的线性混合效应模型。对随机效应的协方差矩阵采用改进的乔里斯基分解并重新参数化线性混合效应模型,接着对该模型的极大似然函数施加集群ALASSO惩罚和ALASSO惩罚两类惩罚,该法能实现非参数变量、固定效应和随机效应的联合变量选择,基于该法得出的估计量也满足相合性、稀疏性和Oracle性质。文章最后做了个数值模拟,模拟结果表明,本文提出的估计方法在变量选择的准确性、参数估计的精度两个方面均表现较好。     

Regularized Principal Component Analysis for Spatial Data

In many atmospheric and earth sciences, it is of interest to identify dominant spatial patterns of variation based on data observed at p locations and n time points with the possibility that p > n. While principal component analysis (PCA) is commonly applied to find the dominant patterns, the eigenimages produced from PCA may exhibit patterns that are too noisy to be physically meaningful when p is large relative to n. To obtain more precise estimates of eigenimages, we propose a regularization approach incorporating smoothness and sparseness of eigenimages, while accounting for their orthogonality. Our method allows data taken at irregularly spaced or sparse locations. In addition, the resulting optimization problem can be solved using the alternating direction method of multipliers, which is easy to implement, and applicable to a large spatial dataset. Furthermore, the estimated eigenfunctions provide a natural basis for representing the underlying spatial process in a spatial random-effects model, from which spatial covariance function estimation and spatial prediction can be efficiently performed using a regularized fixed-rank kriging method. Finally, the effectiveness of the proposed method is demonstrated by several numerical examples.