Adaptive text mining: inferring structure from sequences

Text mining is about inferring structure from sequences representing natural language text, and may be defined as the process of analyzing text to extract information that is useful for particular purposes. Although hand-crafted heuristics are a common practical approach for extracting information from text, a general, and generalizable, approach requires adaptive techniques. This paper studies the way in which the adaptive techniques used in text compression can be applied to text mining. It develops several examples: extraction of hierarchical phrase structures from text, identification of keyphrases in documents, locating proper names and quantities of interest in a piece of text, text categorization, word segmentation, acronym extraction, and structure recognition. We conclude that compression forms a sound unifying principle that allows many text mining problems to be tacked adaptively.     

Locking-free adaptive discontinuous Galerkin FEM for linear elasticity problems

An adaptive discontinuous Galerkin finite element method for linear elasticity problems is presented. We develop an a posteriori error estimate and prove its robustness with respect to nearly incompressible materials (absence of volume locking). Furthermore, we present some numerical experiments which illustrate the performance of the scheme on adaptively refined meshes.

     

Adaptive multiquadric collocation for boundary layer problems

An adaptive collocation method based upon radial basis functions is presented for the solution of singularly perturbed two-point boundary value problems. Using a multiquadric integral formulation, the second derivative of the solution is approximated by multiquadric radial basis functions. This approach is combined with a coordinate stretching technique. The required variable transformation is accomplished by a conformal mapping, an iterated sine-transformation. A new error indicator function accurately captures the regions of the interval with insufficient resolution. This indicator is used to adaptively add data centres and collocation points. The method resolves extremely thin layers accurately with fairly few basis functions. The proposed adaptive scheme is very robust, and reaches high accuracy even when parameters in our coordinate stretching technique are not chosen optimally. The effectiveness of our new method is demonstrated on two examples with boundary layers, and one example featuring an interior layer. It is shown in detail how the adaptive method refines the resolution.     

An adaptive algorithm for solving stochastic multi-point boundary value problems

In this paper, we present an adaptive multiple-shooting method to solve stochastic multi-point boundary value problems. We first analyze the strong order of convergence of the underlying multiple shooting method. We then proceed to describe the proposed strategy to adaptively choose the location of shooting points. We analyze the effect of method parameters on the performance of the overall scheme using a benchmark linear two-point stochastic boundary value problem. We illustrate the effectiveness of this approach on several (one and two dimensional) test problems by comparing our results with other non-adaptive alternative techniques proposed in the literature.     

An adaptive trust region method and its convergence

In this paper, a new trust region subproblem is proposed. The trust radius in the new subproblem adjusts itself adaptively. As a result, an adaptive trust region method is constructed based on the new trust region subproblem. The local and global convergence results of the adaptive trust region method are proved. Numerical results indicate that the new method is very efficient.     

类Hartree-Fock方程的数值方法

本文的主要目的是介绍近年来大基组下的类Hartree-Fock方程数值求解的一些进展.类Hartree-Fock方程出现在Hartree-Fock理论和含杂化泛函的Kohn-Sham密度泛函理论中,是电子结构理论中一类重要的方程.该方程在复杂的化学和材料体系的电子结构计算中有广泛地应用.由于计算代价的原因,类Hartree-Fock方程一般只被用在较小规模的量子体系（含几十到几百个电子）的计算.从数学角度上讲,类Hartree-Fock方程是一个非线性积分-微分方程组,其计算代价主要来自于积分算子的部分,也就是Fock交换算子.通过发展和结合自适应压缩交换算子方法（ACE）,投影的C-DⅡS方法（PC-DⅡS）方法,以及插值可分密度近似方法（ISDF）,我们大大降低了杂化泛函密度泛函理论的计算代价.以含1000个硅原子的体系为例,我们将平面波基组下的杂化泛函的计算代价降至接近不含Fock交换算子的半局域泛函计算的水平.同时,我们发现类Hartree-Fock方程的数学结构也为一类特征值问题的迭代求解提供了新的思路.     

Online adaptive local multiscale model reduction for heterogeneous problems in perforated domains

In this paper, we develop and analyze an adaptive multiscale approach for heterogeneous problems in perforated domains. We consider commonly used model problems including the Laplace equation, the elasticity equation, and the Stokes system in perforated regions. In many applications, these problems have a multiscale nature arising because of the perforations, their geometries, the sizes of the perforations, and configurations. Typical modeling approaches extract average properties in each coarse region, that encapsulate many perforations, and formulate a coarse-grid problem. In some applications, the coarse-grid problem can have a different form from the fine-scale problem, e.g. the coarse-grid system corresponding to a Stokes system in perforated domains leads to Darcy equations on a coarse grid. In this paper, we present a general offline/online procedure, which can adequately and adaptively represent the local degrees of freedom and derive appropriate coarse-grid equations. Our approaches start with the offline procedure, which constructs multiscale basis functions in each coarse region and formulates coarse-grid equations. We presented the offline simulations without the analysis and adaptive procedures, which are needed for accurate and efficient simulations. The main contributions of this paper are (1) the rigorous analysis of the offline approach, (2) the development of the online procedures and their analysis, and (3) the development of adaptive strategies. We present an online procedure, which allows adaptively incorporating global information and is important for a fast convergence when combined with the adaptivity. We present online adaptive enrichment algorithms for the three model problems mentioned above. Our methodology allows adding and guides constructing new online multiscale basis functions adaptively in appropriate regions. We present the convergence analysis of the online adaptive enrichment algorithm for the Stokes system. In particular, we show that the online procedure has a rapid convergence with a rate related to the number of offline basis functions, and one can obtain fast convergence by a sufficient number of offline basis functions, which are computed in the offline stage. The convergence theory can also be applied to the Laplace equation and the elasticity equation. To illustrate the performance of our method, we present numerical results with both small and large perforations. We see that only a few (1 or 2) online iterations can significantly improve the offline solution.     

An adaptive LSMFE method for Burgers equations

An adaptive least-squares mixed finite element method for Burgers equations is proposed and analyzed. A posteriori error estimates are obtained that are used to adaptively improve the algorithm. The least-squares functional is locally computed and is used as an effectively calculated a posteriori error estimate. The article is published in the original.     

Comparison of two Eulerian solvers for the four-dimensional Vlasov equation: Part II

In this second part, we carry out a numerical comparison between two Vlasov solvers, which solve directly the Vlasov equation on a grid of the phase space. The two methods are based on the semi-Lagrangian method as presented in Part I: the first one (LOSS, local splines simulator) uses a uniform mesh of the phase space whereas the second one (OBI, ondelets based interpolation) is an adaptive method. The numerical comparisons are performed by solving the four-dimensional Vlasov equation for some classical problems of plasma and beam physics. We shall also investigate the speedup and the CPU time as well as the compression rate of the adaptive method which are important features because of the size of the problems.     

用自适应MG法,FMG法求解Helmholtz方程

本文针对Ｖ循环、Ｗ循环和多重网格法中最优光滑次数及循环体个数难以确定的缺点，以Ｈｅｌｍｈｏｌｔｚ方程为例给出自适应的多重网格算法和自适应的完全多重网格算法。     

A multilevel finite volume method with multiscale-based grid adaptation for steady compressible flows

An implicit multilevel finite volume solver on adaptively refined quadtree meshes is presented for the solution of steady state flow problems. The nonlinear problem arising from the implicit time discretization is solved by an adaptive FAS multigrid method. Local grid adaptation is performed by means of a multiscale-based strategy. For this purpose data of the flow field are decomposed into coarse grid information and a sequence of detail coefficients that describe the difference between two refinement levels and reveal insight into the local regularity behavior of the solution. Here wavelet techniques are employed for the multiscale analysis. The key idea of the present work is to use the transfer operators of the multiscale analysis for the prolongation and restriction operator in the FAS cycle. The efficiency of the solver is investigated by means of an inviscid 2D flow over a bump.     

杆件轴向受迫振动的Galerkin有限元EEP法自适应求解

基于单元能量投影(element energy projection,EEP)法自适应分析在杆件静力问题以及离散系统运动方程组中所取得的成果,以直杆轴向受迫振动为例,研究并建立了一种在时间域和一维空间域同时实现自适应分析的方法.该方法在时间和空间两个维度都采用连续的Galerkin有限元法(finite element method,FEM)进行求解,根据半离散的思想,由空间有限元离散将模型问题的偏微分控制方程转化为离散系统运动方程组,对该方程组进行时域有限元自适应求解;然后再基于空间域超收敛计算的EEP解对空间域进行自适应,直至最终的时空网格下动位移解答的精度逐点均满足给定误差限要求.文中对其基本思想、关键技术和实施策略进行了阐述,并给出了包括地震波输入下的典型算例以展示该法有效可靠.     

A new adaptive Barzilai and Borwein method for unconstrained optimization

In this paper we view the Barzilai and Borwein (BB) method from a new angle, and present a new adaptive Barzilai and Borwein (NABB) method with a nonmonotone line search for general unconstrained optimization. In the proposed method, the scalar approximation to the Hessian matrix is updated by the Broyden class formula to generate an adaptive stepsize. It is remarkable that the new stepsize is chosen adaptively in the interval which contains the two well-known BB stepsizes. Moreover, for the negative curvature direction, a strategy for the choice of the stepsize is designed to accelerate the convergence rate of the NABB method. Furthermore, we apply the NABB method without any line search to strictly convex quadratic minimization. The numerical experiments show the NABB method is very promising.     

Adaptive Interpolation by Scaled Multiquadrics

We present an adaptive method to extract shape-preserving information from a univariate data sample. The behavior of the signal is obtained by interpolating at adaptively selected few data points by a linear combination of multiquadrics with variable scaling parameters. On the theoretical side, we give a sufficient condition for existence of the scaled multiquadric interpolant. On the practical side, we give various examples to show the applicability of the method.     

Adaptive fuzzy sliding-mode control for multi-input multi-output chaotic systems

This paper describes an adaptive fuzzy sliding-mode control algorithm for controlling unknown or uncertain, multi-input multi-output (MIMO), possibly chaotic, dynamical systems. The control approach encompasses a fuzzy system and a robust controller. The fuzzy system is designed to mimic an ideal sliding-mode controller, and the robust controller compensates the difference between the fuzzy controller and the ideal one. The parameters of the fuzzy system, as well as the uncertainty bound of the robust controller, are tuned adaptively. The adaptive laws are derived in the Lyapunov sense to guarantee the asymptotic stability and tracking of the controlled system. The effectiveness of the proposed method is shown by applying it to some well-known chaotic systems.     

Change point oriented multiscale analysis using the lifting scheme

We discuss a non-linear, change point driven multiscale decomposition, known as normal offsets or normal meshes (in 2-D). Unlike a wavelet transform, the proposed decomposition runs from coarse to fine scales. The coarse-to-fine approach can be seen as an adaptive sampler with theoretical and practical benefits in compression. It is, however, also a source of potential stability problems. Stability is crucial in applications as de-noising, or simultaneous de-noising and compression. As the normal offset transform is based on the lifting scheme, we investigate lifting steps that both contribute to stability and allow usage in a change point adaptive normal offset scheme. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Adaptive Stabilization of Nonlinear Stochastic Systems

The purpose of this paper is to study the problem of asymptotic stabilization in probability of nonlinear stochastic differential systems with unknown parameters. With this aim, we introduce the concept of an adaptive control Lyapunov function for stochastic systems and we use the stochastic version of Artstein's theorem to design an adaptive stabilizer. In this framework the problem of adaptive stabilization of a nonlinear stochastic system is reduced to the problem of asymptotic stabilization in probability of a modified system. The design of an adaptive control Lyapunov function is illustrated by the example of adaptively quadratically stabilizable in probability stochastic differential systems. Accepted 9 December 1996     

求解带线性约束的凸优化的一类自适应不定线性化增广拉格朗日方法

增广拉格朗日方法是求解带线性约束的凸优化问题的有效算法.线性化增广拉格朗日方法通过线性化增广拉格朗日函数的二次罚项并加上一个临近正则项,使得子问题容易求解,其中正则项系数的恰当选取对算法的收敛性和收敛速度至关重要.较大的系数可保证算法收敛性,但容易导致小步长.较小的系数允许迭代步长增大,但容易导致算法不收敛.本文考虑求解带线性等式或不等式约束的凸优化问题.我们利用自适应技术设计了一类不定线性化增广拉格朗日方法,即利用当前迭代点的信息自适应选取合适的正则项系数,在保证收敛性的前提下尽量使得子问题步长选择范围更大,从而提高算法收敛速度.我们从理论上证明了算法的全局收敛性,并利用数值实验说明了算法的有效性.     

A shift‐adaptive meshfree method for solving a class of initial‐boundary value problems with moving boundaries in one‐dimensional domain

A new shift‐adaptive meshfree method for solving a class of time‐dependent partial differential equations (PDEs) in a bounded domain (one‐dimensional domain) with moving boundaries and nonhomogeneous boundary conditions is introduced. The radial basis function (RBF) collocation method is combined with the finite difference scheme, because, unlike with Kansa's method, nonlinear PDEs can be converted to a system of linear equations. The grid‐free property of the RBF method is exploited, and a new adaptive algorithm is used to choose the location of the collocation points in the first time step only. In fact, instead of applying the adaptive algorithm on the entire domain of the problem (like with other existing adaptive algorithms), the new adaptive algorithm can be applied only on time steps. Furthermore, because of the radial property of the RBFs, the new adaptive strategy is applied only on the first time step; in the other time steps, the adaptive nodes (obtained in the first time step) are shifted. Thus, only one small system of linear equations must be solved (by LU decomposition method) rather than a large linear or nonlinear system of equations as in Kansa's method (adaptive strategy applied to entire domain), or a large number of small linear systems of equations in the adaptive strategy on each time step. This saves a lot in time and memory usage. Also, Stability analysis is obtained for our scheme, using Von Neumann stability analysis method. Results show that the new method is capable of reducing the number of nodes in the grid without compromising the accuracy of the solution, and the adaptive grading scheme is effective in localizing oscillations due to sharp gradients or discontinuities in the solution. The efficiency and effectiveness of the proposed procedure is examined by adaptively solving two difficult benchmark problems, including a regularized long‐wave equation and a Korteweg‐de Vries problem. © 2016Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 32: 1622–1646, 2016     

Adaptive control of discrete-time chaotic systems: a fuzzy control approach

This paper discusses adaptive control of a class of discrete-time chaotic systems from a fuzzy control approach. Using the T–S model of discrete-time chaotic systems, an adaptive control algorithm is developed based on some conventional adaptive control techniques. The resulting adaptively controlled chaotic system is shown to be globally stable, and its robustness is discussed. A simulation example of the chaotic Henon map control is finally presented, to illustrate an application and the performance of the proposed control algorithm.