基于Kronecker型替换的黑盒多项式稀疏插值

本文基于新的Kronecker型替换,给出两个由黑盒表示的稀疏多项式的新确定性插值算法.令f∈R[x1,……,xn]是一个稀疏黑盒多项式,其次数上界为D.当R是C或者是有限域时,相对于已有算法,新算法具有更好的计算复杂度或者关于D的复杂度更低.特别地,对于一般黑盒模型,D是复杂度中的主要因素,而在所有的确定性算法中,本文的第二个算法的复杂度关于D是最低的.     

内插法在相关干涉仪测向体制中的应用

测向误差的减小一直以来都是无线电测向精度提高的一个难点,对于不同的测向体制所采用的减小测向误差的方法都不尽相同。本文主要介绍的是相关干涉仪测向体制的基本原理以及通过内插法的应用来减小测向误差的方法。     

Arbitrage‐free call option surface construction using regression splines

In this work, we suggest a novel quadratic programming‐based algorithm to generate an arbitrage‐free call option surface. The empirical performance of the proposed method is evaluated using S&P 500 Index call options. Our results indicate that the proposed method provides a more precise fit to observed option prices than other alternative methodologies. Copyright © 2014 John Wiley & Sons, Ltd.     

Impulsive Noise Suppression from Highly Distorted Images with Triangular Interpolants

In this paper a new filter, Triangular Interpolant Based Impulsive Noise Suppression Filter (SF), is proposed to restore images corrupted by fixed valued impulsive noise (IN). The proposed filter comprises two main stages: detection of noise and restoration of corrupted pixels. The SF achieves the restoration of the detected noisy pixels by using one of the Triangular Interpolant techniques and leaves the other pixels unaltered. Simulation results reveal that the proposed filter shows better performance than the highly approved IN suppression filters across a wide noise density ranging from 10% to 90%. The proposed filter also perfectly achieves the robustness anddetail preservation with reduced computational complexity.     

粒子-转子模型和推转壳模型中的能谱统计分析

用粒子–转子模型和推转壳模型研究了6个粒子分别填充在单j壳和双j壳上的混沌行为.分析了单j壳和双j壳情况下能谱的最近邻能级间距分布和谱刚度随自旋及推转频率的变化,结果表明,当组态空间大小不变时,系统在双j壳(g_7/2+d_5/2)情况下比在单j壳(i_13/2)情况下更规则,而当组态空间从单j壳(i_13/2)扩大到双j壳(i_13/2+g_9/2)时,系统的混沌程度变化不大.同时比较了将6个粒子的两体相互作用分别取为δ力和对力时的系统的混沌行为     

加权二次有理Bézier插值曲线

在本文中,给定一组有序空间数据点列及每个数据点的切矢向量,利用加权二次有理Bézier曲线对数据点作插值曲线,使该曲线具有C1连续性,并且权因子只是对相应顶点曲线附近产生影响,同调整两个相邻的权因子可以调整这两个相邻顶点之间的曲线和它的控制多边形.     

The Iyengar Type Inequalities with Exact Estimations and the Chebyshev Central Algorithms of Integrals

In this paper, both low order and high order extensions of the Iyengar type inequality are obtained. Such extensions are the best possible in the same sense as that of the Iyengar inequality. hzrthermore, the Chebyshev central algorithms of integrals for some function classes and some related problems are also considered and investigated.     

软件无线电中采样率转换技术的实现及在3G中的应用

目前移动通信标准繁多,且新旧体制混杂,很难做到统一.为了实现互连互通,目前比较可行的方法是采用软件无线电.采样率转换技术是实现互连互通的关键.文中针对第三代移动通信系统(3G)中不同通信体制的带宽、速率要求,根据分级变换的思想,对3G中的CDMA2000和TDSCDMA的采样率转换方案进行了设计,并对3G中的5种制式的采样率转换方案进行了分析比较.实验表明,这一方案可以在采样率变换的高效网络结构基础上进一步降低滤波运算量和存储量.     

Multiple Window and Cluster Size Scan Procedures

Researchers apply scan statistics to test for unusually large clusters of events within a time window of specified length w, or alternatively an unusually small window w that contains a specified number of events. In some cases, the researcher is interested in testing for a range of specified window lengths, or a set of several specified number of events k (cluster sizes). In this paper, we derive accurate approximations for the joint distributions of scan statistics for a range of values of w, or of k, that can be used to set an experiment-wide level of significance that takes into account the multiple comparisons involved. We use these methods to compare different ways of choosing the window sizes for the different cluster sizes. One special case is a multiple comparison procedure based on a generalized likelihood ratio test (GLRT) for a range of window sizes. We compare the power of the GLRT with another method for allocating the window sizes. We find that the GLRT is sensitive for very small window sizes at the expense of moderate and larger window sizes. We illustrate these results on two examples, one involving clustering of translocation breakpoints in DNA, and the other involving disease clusters.     

Error estimates for Hermite interpolation on spheres

In this paper, we prove convergence rates for spherical spline Hermite interpolation on the sphere S^d−1 via an error estimate given in a technical report by Luo and Levesley. The functionals in the Hermite interpolation are either point evaluations of pseudodifferential operators or rotational differential operators, the desirable feature of these operators being that they map polynomials to polynomials. Convergence rates for certain derivatives are given in terms of maximum point separation.