Convergence of quadratures for Cauchy principal value integrals

Quadrature formulas based on the “practical” abscissasx _k=cos(k π/n),k=0(1)n, are obtained for the numerical evaluation of the weighted Cauchy principal value integrals $$\mathop {\rlap{--} \smallint }\limits_{ - 1}^1 (1 - x)^\alpha (1 + x)^\beta (f(x))/(x - a)){\rm E}dx,$$ where α,β>?1 andaε(?1, 1). An interesting problem concerning these quadrature formulas is their convergence for a suitable class of functions. We establish convergence of these quadrature formulas for the class of functions which are Hölder-continuous on [?1, 1].     

On quartic splines with application to quadratures

This paper presents a formulatioin and a study of an interpolatory quartic spline which interpolates the first and second derivatives of a given function. This formulation can be applied, in particular, to quadratures.     

Numerical quadratures for singular and hypersingular integrals

We present a procedure for the design of high-order quadrature rules for the numerical evaluation of singular and hypersingular integrals; such integrals are frequently encountered in solution of integral equations of potential theory in two dimensions. Unlike integrals of both smooth and weakly singular functions, hypersingular integrals are pseudo-differential operators, being limits of certain integrals; as a result, standard quadrature formulae fail for hypersingular integrals. On the other hand, such expressions are often encountered in mathematical physics (see, for example, [1]), and it is desirable to have simple and efficient “quadrature” formulae for them. The algorithm we present constructs high-order “quadratures” for the evaluation of hypersingular integrals. The additional advantage of the scheme is the fact that each of the quadratures it produces can be used simultaneously for the efficient evaluation of hypersingular integrals, Hilbert transforms, and integrals involving both smooth and logarithmically singular functions; this results in significantly simplified implementations. The performance of the procedure is illustrated with several numerical examples.     

Optimal quadratures with regard to the efficiency

In this paper first one studies the optimality problem with regard to the efficiency for some classes of numerical quadrature algorithms. Then one investigates the concordance between the «efficiency criteria» and the «?-complexity criteria».     

Gauss-Legendre and Chebyshev quadratures for singular integrals

Exact expressions are presented for efficient computation of the weights in Gauss-Legendre and Chebyshev quadratures for selected singular integrands. The singularities may be of Cauchy type, logarithmic type or algebraic-logarithmic end-point branching points. We provide Fortran 90 routines for computing the weights for both the Gauss-Legendre and the Chebyshev (Fejér-1) meshes whose size can be set by the user.

New program summary

Program title: SINGQUADCatalogue identifier: AEBR_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEBR_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 4128No. of bytes in distributed program, including test data, etc.: 25 815Distribution format: tar.gzProgramming language: Fortran 90Computer: Any with a Fortran 90 compilerOperating system: Linux, Windows, MacRAM: Depending on the complexity of the problemClassification: 4.11Nature of problem: Program provides Gauss-Legendre and Chebyshev (Fejér-1) weights for various singular integrands.Solution method: The weights are obtained from the condition that the quadrature of order N must be exact for a polynomial of degree?(N−1). The weights are expressed as moments of the singular kernels associated with Legendre or Chebyshev polynomials. These moments are obtained in analytic form amenable for computation.Additional comments: If the NAGWare f95 compiler is used, the option, “-kind = byte”, must be included in the compile command lines of the Makefile.Running time: The test run supplied with the distribution takes a couple of seconds to execute.     

面向群业务的移动互联网自适应资源分配机制

现有的移动互联网资源分配机制大多面向单一业务,无法高效支持群业务。针对这一问题,提出一种面向群业务的自适应资源分配机制。综合考虑动态变化的异构网络环境、群业务特征和用户需求,采用吸引子选择模型来计算备选网络的优先级;在此基础上,运用逼近理想接入网络法对备选网络进行多属性判决,为群业务选择适宜的接入网络。仿真结果表明,该机制显著提高了用户体验和网络资源的利用率。     

一种自适应概念变化的数据流分类器

多数分类方法基于数据服从静态分布的假设,然而真实世界中数据的采集通常跨越一段时间,如果忽略潜在概念的变化将会严重降低分类模式的预测性能.目前挖掘概念变化的数据流已经成为研究的热点,在入侵检测、系统性能保持等方面有重要应用.提出一种基于SPRINT的在线分类方法SSPRINT,可以动态调整训练窗口的尺寸和分类模型重建期间允许接受的新样本的个数,以自动适应当前概念变化发生的速度;在网络性能数据流上的测试验证了SSPRINT的性能.     

Adaptive scheduling for shared window joins over data streams

Recently a few Continuous Query systems have been developed to cope with applications involving continuous data streams. At the same time, numerous algorithms are proposed for better performance. A recent work on this subject was to define scheduling strategies on shared window joins over data streams from multiple query expressions. In these strategies, a tuple with the highest priority is selected to process from multiple candidates. However, the performance of these static strategies is deeply influenced when data are bursting, because the priority is determined only by static information, such as the query windows, arriving order, etc. In this paper, we propose a novel adaptive strategy where the priority of a tuple is integrated with realtime information. A thorough experimental evaluation has demonstrated that this new strategy can outperform the existing strategies.     

Adaptive end-to-end QoS for multimedia over heterogeneous wireless networks

There has been a surge of interest for multimedia applications over wireless networks in recent years. A colossal number of ways have been proposed to decrease delay, delay jitter and loss in wireless networks and good user-perceived quality in video over internet. This paper studies the multimedia over heterogeneous wireless networks, requirements and problems, and proposes a new scheme to overcome the obstacles. The proposed scheme, takes into account the effects of Application-Level Wireless Multilevel ECN marking (AWMECN), thus helps us overcome the congestion/loss mistake problems. For handoff, handover and lossy link problems, it is considered that a freezing mechanism is in use in application layer and assumed that the upper layers can be aware of disconnection periods to make the rate adaptation decisions. Also a new scheme has been added to receiver to gracefully degrade the quality when no other action is available to combat the long delays without data which is caused by handoffs and wireless temporary disconnections. The transport layer mechanism is chosen to be UDP for avoiding TCP regarding problems. We believe that obtaining a good quality of video depends on good performance of all layers and tried to use the best mechanism in each layer.     

Hermite and gauss type optimal quadratures for analytic functions

For integrals \(\int\limits_{ - 1}^\iota {w(x)f(x)dx} \) with a non-negative weight functionw(x) and analyticf, we develop Hermite and Gauss type optimal quadratures over the Hilbert spaceH ²(C_r) of functions analytic in a circle. Our development of these optimal quadratures in very similar to that of classical Hermite and Gauss quadratures; the role played by fundamental polynomials in the classical theory is replaced here by certain «fundamental rational functions». We then show, by arguments similar to those used in the classical case, that a Gauss type optimal quadrature has positive weights an abscissas lying in (?¹, 1).     

视频传输自适应网络带宽控制策略的研究

为有效利用网络资源,提高视频服务的实时性,视频的传输码率应根据网络可用带宽的变化进行调整;对视频传输自适应可用带宽相关技术展开了研究,探讨了自适应实现方法中需要解决的关键技术,通过分析视频种码率控制方法,提出了一种根据可用带宽自适应调节量化步长,优化视频输出码率的策略;实验结果表明,根据网络中链路的带宽状况,自适应改变视频量化步长可以有效地控制视频输出码率,并且能快速而平滑地将视频输出码率调整到一个与网络带宽相适应的值,保证视频网络传输的平稳性和实时性,提高视频服务质量.     

Control-Based Adaptive Middleware for Real-Time Image Transmission over Bandwidth-Constrained Networks

Real-time image transmission is crucial to an emerging class of distributed embedded systems operating in open network environments. Examples include avionics mission replanning over Link-16, security systems based on wireless camera networks, and online collaboration using camera phones. Meeting image transmission deadlines is a key challenge in such systems due to unpredictable network conditions. In this paper, we present CAMRIT, a Control-based Adaptive Middleware framework for Real-time Image Transmission in distributed real-time embedded systems. CAMRIT features a distributed feedback control loop that meets image transmission deadlines by dynamically adjusting the quality of image tiles. We derive an analytic model that captures the dynamics of a distributed middleware architecture. A control-theoretic methodology is applied to systematically design a control algorithm with analytic assurance of system stability and performance, despite uncertainties in network bandwidth. Experimental results demonstrate that CAMRIT can provide robust real-time guarantees for a representative application scenario.     

Adaptive multi-view video streaming using side information over peer-to-peer networks

Multimedia Tools and Applications - Multi-view plus-depth-map (MVD) video streaming with autostereoscopic displays provides multi-user immersive media experiences. In this context, delivery of MVD...     

一种自适应IP语音缓冲算法的研究与应用

当IP语音包的网络时延抖动较小时,一般的语音缓冲算法可以得到较好的语音质量．当网络中存在突发大时延时,就会出现极大丢包率或极大端到端时延,从而难以获得好的语音质量．为此,提出针对突发大时延下的自适应语音缓冲算法．通过估算网络平均时延和学习语音包经过的网络路径上的状态,来确定需要控制端到端时延大小和语音包的丢包率,动态调整Jitter Buffer队列的最小深度和最大深度,从而可以尽量减小语音裂缝（gap）的出现．通过基于听觉模型的客观音质评价（PESQ）仿真计算以及在实际语音网关设备中的应用表明算法对语音通信质量有一定的改善作用．     

Gauss-turán quadratures of chebyshev type and error formulae

This paper begins with an investigation of two special forms of the Gauss-Turán quadrature of Chebyshev-type of precision 6n?1. Then the remainder formulas of these quadratures are developed and sharp error bounds for the functions inC ^q [?1, 1] are shown, whereq is a positive integer. Most importantly this study proves that these reslts can be extended in order to yield sharp error estimates for all such quadratures of higher precision.     

The use of quadratures for solving convective and highly stiff transport problems

In this paper we introduce a method for the numerical solutions of initial value problems, that combines finite differences with Simpson’s rule. The effectiveness of the method is proved by solving, in one spatial dimension, a stiff and convection-dominated transport problem. To solve the same problem in two spatial dimensions, the proposed method was used successfully in combination with Strang’s operator decomposition method.     

Adaptive delivery of immersive 3D multi-view video over the Internet

The increase in Internet bandwidth and the developments in 3D video technology have paved the way for the delivery of 3D Multi-View Video (MVV) over the Internet. However, large amounts of data and dynamic network conditions result in frequent network congestion, which may prevent video packets from being delivered on time. As a consequence, the 3D video experience may well be degraded unless content-aware precautionary mechanisms and adaptation methods are deployed. In this work, a novel adaptive MVV streaming method is introduced which addresses the future generation 3D immersive MVV experiences with multi-view displays. When the user experiences network congestion, making it necessary to perform adaptation, the rate-distortion optimum set of views that are pre-determined by the server, are truncated from the delivered MVV streams. In order to maintain high Quality of Experience (QoE) service during the frequent network congestion, the proposed method involves the calculation of low-overhead additional metadata that is delivered to the client. The proposed adaptive 3D MVV streaming solution is tested using the MPEG Dynamic Adaptive Streaming over HTTP (MPEG-DASH) standard. Both extensive objective and subjective evaluations are presented, showing that the proposed method provides significant quality enhancement under the adverse network conditions.