Approximation of spirals by piecewise curves of fewest circular arc segments

The approximation of plane curves by smooth piecewise circular arc curves in Tchebycheff norm is analysed. The algorithm of approximation is proposed. It is proved that algorithm presented generates for curves of some class, called spirals, the minimal number of circular arcs. Results are used to evaluate the published methods of piecewise circular approximation.     

传感网络中误差有界的分段逼近数据压缩算法

无线传感器网络通常能量、带宽有限.一个关键而实用的需求是,在保证数据质量的情况下,对持续到达的采样数据进行在线式压缩.主要贡献:①利用传感器节点内置的缓冲区,提出了单传感器节点上基于分段常量逼近的准在线式数据压缩算法(PCADC-sensor),并给出了在无穷范数误差度量下的实现;②提出了单传感器节点上基于分段线性逼近的在线式数据压缩算法(PLADC-sensor).分别在无穷范数和2范数误差度量的情况下给出了计算PLA的两种简单快速算法,推导了分段线性一致逼近的充要条件;③簇头或基站无需接收原始采样数据,提出了基于原始数据的分段线性表示的压缩算法(PLRDC-cluster),推导了同一节点不同时段、不同节点相同时段两种情况下的计算公式.实验结果表明,这些算法较好地匹配了传感器数据流模型,显著减少了冗余数据传输.     

Further results on the L1 analysis of sampled-data systems via kernel approximation approach

This paper gives two methods for the L₁ analysis of sampled-data systems, by which we mean computing the L_∞-induced norm of sampled-data systems. This is achieved by developing what we call the kernel approximation approach in the setting of sampled-data systems. We first consider the lifting treatment of sampled-data systems and give an operator theoretic representation of their input/output relation. We further apply the fast-lifting technique by which the sampling interval [0, h) is divided into M subintervals with an equal width, and provide methods for computing the L_∞-induced norm. In contrast to a similar approach developed earlier called the input approximation approach, we use an idea of kernel approximation, in which the kernel function of an input operator and the hold function of an output operator are approximated by piecewise constant or piecewise linear functions. Furthermore, it is shown that the approximation errors in the piecewise constant approximation or piecewise linear approximation scheme converge to 0 at the rate of 1/M or 1/M², respectively. In comparison with the existing input approximation approach, in which the input function (rather than the kernel function) of the input operator is approximated by piecewise constant or piecewise linear functions, we show that the kernel approximation approach gives improved computation results. More precisely, even though the convergence rates in the kernel approximation approach remain qualitatively the same as those in the input approximation approach, the newly developed former approach could lead to quantitatively improved approximation errors than the latter approach particularly when the piecewise linear approximation scheme is taken. Finally, a numerical example is given to demonstrate the effectiveness of the kernel approximation approach with this scheme.     

Numerical solution of a calculus of variations problem using the feedforward neural network architecture

It is demonstrated, through theory and numerical example, how it is possible to construct directly and noniteratively a feedforward neural network to solve a calculus of variations problem. The method, using the piecewise linear and cubic sigmoid transfer functions, is linear in storage and processing time. The L₂ norm of the network approximation error decreases quadratically with the piecewise linear transfer function and quartically with the piecewise cubic sigmoid as the number of hidden layer neurons increases. The construction requires imposing certain constraints on the values of the input, bias, and output weights, and the attribution of certain roles to each of these parameters.

All results presented used the piecewise linear and cubic sigmoid transfer functions. However, the noniterative approach should also be applicable to the use of hyperbolic tangents and radial basis functions.     

A Posteriori Error Estimates for Parabolic Variational Inequalities

We study a posteriori error estimates in the energy norm for some parabolic obstacle problems discretized with a Euler implicit time scheme combined with a finite element spatial approximation. We discuss the reliability and efficiency of the error indicators, as well as their localization properties. Apart from the obstacle resolution, the error indicators vanish in the so-called full contact set. The case when the obstacle is piecewise affine is studied before the general case. Numerical examples are given.     

Smooth approximation of data on the sphere with splines

A computable function, defined over the sphere, is constructed, which is of classC ¹ at least and which approximates a given set of data. The construction is based upon tensor product spline basisfunctions, while at the poles of the spherical system of coordinates modified basisfunctions, suggested by the spherical harmonics expansion, are introduced to recover the continuity order at these points. Convergence experiments, refining the grid, are performed and results are compared with similar results available in literature. The approximation accuracy is compared with that of the expansion in terms of spherical harmonics. The use of piecewise approximation, with locally supported basisfunctions, versus approximation with spherical harmonics is discussed.     

Smoothing transforms for wavelet approximation of piecewise smooth functions

Multi-resolution analysis with high vanishing moment wavelets provides a framework to efficiently approximate smooth functions. However, it is a well-known fact that wavelet approximation usually cannot achieve the same order of approximation in the vicinity of discontinuous points of functions as that in the smooth regions. Ringing artefacts in the reconstructed functions inevitably appear around discontinuous points. To reduce these artefacts, the authors propose to locally smooth piecewise smooth functions at the discontinuous points, prior to applying the wavelet transform, via a smoothing transform. The numerical experiments for one- and two-dimensional signals show the effectiveness of the proposed strategy.     

Function Approximation With XCS: Hyperellipsoidal Conditions, Recursive Least Squares, and Compaction

An important strength of learning classifier systems (LCSs) lies in the combination of genetic optimization techniques with gradient-based approximation techniques. The chosen approximation technique develops locally optimal approximations, such as accurate classification estimates, Q-value predictions, or linear function approximations. The genetic optimization technique is designed to distribute these local approximations efficiently over the problem space. Together, the two components develop a distributed, locally optimized problem solution in the form of a population of expert rules, often called classifiers. In function approximation problems, the XCSF classifier system develops a problem solution in the form of overlapping, piecewise linear approximations. This paper shows that XCSF performance on function approximation problems additively benefits from: 1) improved representations; 2) improved genetic operators; and 3) improved approximation techniques. Additionally, this paper introduces a novel closest classifier matching mechanism for the efficient compaction of XCS's final problem solution. The resulting compaction mechanism can boil the population size down by 90% on average, while decreasing prediction accuracy only marginally. Performance evaluations show that the additional mechanisms enable XCSF to reliably, accurately, and compactly approximate even seven dimensional functions. Performance comparisons with other, heuristic function approximation techniques show that XCSF yields competitive or even superior noise-robust performance.     

Piecewise constant level set method for topology optimization of unilateral contact problems

The paper deals with the structural optimization of the elastic body in unilateral contact with a rigid foundation using the level set approach. A piecewise constant level set method is used to represent the evolution of interfaces rather than the standard method. The piecewise constant level set function takes distinct constant values in each subdomain of a whole design domain. Using a two-phase approximation the original structural optimization problem is reformulated as an equivalent constrained optimization problem in terms of the piecewise constant level set function. Necessary optimality condition is formulated. Finite difference and finite element methods are applied as the approximation methods. Numerical examples are provided and discussed.     

基于分片线性函数的图象压缩方法

使用了一种新分片线性逼近算法,算法首先对极大极小友谊赛一分片线性函数的紧凑表示形式做了改进,然后发挥了分片线性逼近的优势。在此基础上,提出了一种基于分片线性逼近的图象压缩编码方法。这种方法具有解压缩速度快的优点,与其它的图象压缩方法（例如DCT）相结合,能够提高图象的压缩效率。     

Guaranteed and robust a posteriori error estimates and balancing discretization and linearization errors for monotone nonlinear problems

We derive a posteriori error estimates for a class of second-order monotone quasi-linear diffusion-type problems approximated by piecewise affine, continuous finite elements. Our estimates yield a guaranteed and fully computable upper bound on the error measured by the dual norm of the residual, as well as a global error lower bound, up to a generic constant independent of the nonlinear operator. They are thus fully robust with respect to the nonlinearity, thanks to the choice of the error measure. They are also locally efficient, albeit in a different norm, and hence suitable for adaptive mesh refinement. Moreover, they allow to distinguish, estimate separately, and compare the discretization and linearization errors. Hence, the iterative (Newton–Raphson, fixed point) linearization can be stopped whenever the linearization error drops to the level at which it does not affect significantly the overall error. This can lead to important computational savings, as performing an excessive number of unnecessary linearization iterations can be avoided. A strategy combining the linearization stopping criterion and adaptive mesh refinement is proposed and numerically tested for the p-Laplacian.     

Realistic computable error bounds for three dimensional finite element analyses in linear elasticity

We obtain a computable estimator for the energy norm of the error in piecewise affine and piecewise quadratic finite element approximations of linear elasticity in three dimensions. We show that the estimator provides guaranteed upper bounds on the energy norm of the error as well as (up to a constant and data oscillation terms) local lower bounds.     

Approximation of the critical buckling factor for composite panels

This article is concerned with the approximation of the critical buckling factor for thin composite plates. A new method to improve the approximation of this critical factor is applied based on its behavior with respect to lamination parameters and loading conditions. This method allows accurate approximation of the critical buckling factor for non-orthotropic laminates under complex combined loadings (including shear loading). The influence of the stacking sequence and loading conditions is extensively studied as well as properties of the critical buckling factor behavior (e.g concavity over tensor D or out-of-plane lamination parameters). Moreover, the critical buckling factor is numerically shown to be piecewise linear for orthotropic laminates under combined loading whenever shear remains low and it is also shown to be piecewise continuous in the general case. Based on the numerically observed behavior, a new scheme for the approximation is applied that separates each buckling mode and builds linear, polynomial or rational regressions for each mode. Results of this approach and applications to structural optimization are presented.     

广义Mamdani模糊系统依K-积分模的泛逼近及其实现过程

首先,通过引入拟减法算子给出K-积分模定义,并针对广义Mamdani模糊系统实施等距剖分其输入空间. 其次,应用分片线性函数（Piecewise linear function,PLF）的性质构造性地证明了广义Mamdani模糊系统在K-积分模意义下具有泛逼近性,从而将该模糊系统对连续函数空间的逼近能力扩展到一类可积函数类空间上. 最后,通过模拟实例给出该广义Mamdani模糊系统对给定可积函数的泛逼近及实现过程.     

分片线性规划及应用

提出通过分片线性逼近和分片线性规划,将非线性优化问题转化为一系列的线性规划进行求解的方法。讨论了分片线性规划的性质,证明了分片线性规划问题可以通过有限次线性规划得到求解,同时,给出了分片线性规划问题局部最优解的充要条件,并基于此构造了求解分片线性规划问题的下降算法。该算法与自适应链接超平面模型相结合,成功地对离心式冷水机组的工作点进行了优化。通过优化,机组的能耗比之当前工作点有了明显的下降,表明通过分片线性规划求解非线性优化问题的有效性。     

Nonlinear adaptive control using networks of piecewise linearapproximators

Presents a stable nonparametric adaptive control approach using a piecewise local linear approximator. The continuous piecewise linear approximator is developed and its universal approximation capability is proved. The controller architecture is based on adaptive feedback linearization plus sliding mode control. A time varying activation region is introduced for efficient self-organization of the approximator during operation. We modify the adaptive control approach for piecewise linear approximation and self-organizing structures. In addition, we provide analyses of asymptotic stability of the tracking error and parameter convergence for the proposed adaptive control scheme with the online self-organizing structure. The method with a deadzone is also discussed to prevent a high-frequency input which might excite the unmodeled dynamics in practical applications. The application of the piecewise linear adaptive control method is demonstrated by a computational simulation.     

Inverse Laplace transform by piecewise linear polynomial functions

A new approximation method with piecewise linear polynomial functions based on the application of the operational matrix for integration is presented. It is shown that this approximation is more satisfactory than the block-pulse approximation. Two illustrative examples are given.     

A linear-time algorithm for linearL1 approximation of points

In this paper we present a linear-time algorithm for approximating a set ofn points by a linear function, or a line, that minimizes theL ₁ norm. The algorithmic complexity of this problem appears not to have been investigated, although anO(n ³) naive algorithm can be easily obtained based on some simple characteristics of an optimumL ₁ solution. Our linear-time algorithm is optimal within a constant factor and enables us to use linearL ₁ approximation of many points in practice. The complexity ofL ₁ linear approximation of a piecewise linear function is also touched upon.     

A linear-time algorithm for linearL 1 approximation of points

In this paper we present a linear-time algorithm for approximating a set ofn points by a linear function, or a line, that minimizes theL ₁ norm. The algorithmic complexity of this problem appears not to have been investigated, although anO(n ³) naive algorithm can be easily obtained based on some simple characteristics of an optimumL ₁ solution. Our linear-time algorithm is optimal within a constant factor and enables us to use linearL ₁ approximation of many points in practice. The complexity ofL ₁ linear approximation of a piecewise linear function is also touched upon.     

Synchronization and desynchronization in a network of locallycoupled Wilson-Cowan oscillators

A network of Wilson-Cowan (WC) oscillators is constructed, and its emergent properties of synchronization and desynchronization are investigated by both computer simulation and formal analysis. The network is a 2D matrix, where each oscillator is coupled only to its neighbors. We show analytically that a chain of locally coupled oscillators (the piecewise linear approximation to the WC oscillator) synchronizes, and we present a technique to rapidly entrain finite numbers of oscillators. The coupling strengths change on a fast time scale based on a Hebbian rule. A global separator is introduced which receives input from and sends feedback to each oscillator in the matrix. The global separator is used to desynchronize different oscillator groups. Unlike many other models, the properties of this network emerge from local connections that preserve spatial relationships among components and are critical for encoding Gestalt principles of feature grouping. The ability to synchronize and desynchronize oscillator groups within this network offers a promising approach for pattern segmentation and figure/ground segregation based on oscillatory correlation.