智能机器人路径规划及算法研究

路径规划技术是机器人控制技术研究中的一个重要问题,目前的研究主要分为全局规划方法和局部规划方法两大类。在对一些较有代表性的研究思想及其相关算法分析的基础上,比较各种方法的优缺点,提出了机器人路径规划今后的研究重点。     

Power savings and enhancement of gray‐scale capability of LCD TVs with an adaptive dimming technique

Abstract— The luminance of a backlight unit for an LCD TV is adaptively and locally dimmed along with the input video signal in order to reduce the power consumption and also to improve the picture quality. By adopting the zero‐dimensional (0D), 1D, and 2D adaptive dimming techniques, a sample movie having 8.0% post‐gamma average picture levels (APL) could be displayed using 83%, 71%, and 50% of the original backlight power, respectively. For an adoption of the 2D dimming, an LED backlight is preferable. The adaptive‐dimming technique also allows the differential aging characteristics between the LED components and temperature dependence of color and luminance to be overcome. From simulations of a reduction in power consumption, it was found that 40 × 40 pixels is a unit of the local dimming, 30 frames for the sampling period, 24 dimming steps, and an equal‐signal‐step method for determining the dimming factor have been found to be appropriate. The gray‐scale capability of low‐luminance images can also be improved by dimming the backlight luminance and expanding the input signal. By using an LCD TV having an 8‐bit capability, an 11‐bit‐equivalent gray‐scale expression was experimentally proven.     

局域网防火墙的设计与实现

本文设计与实现了局域网防火墙。首先阐述了防火墙的原理,然后分析防火墙系统总体设计,最后论述防火墙的设计与实现,并详述其具体实现的各个模块。     

Adaptive Edge Detectors for Piecewise Smooth Data Based on the minmod Limiter

We are concerned with the detection of edges—the location and amplitudes of jump discontinuities of piecewise smooth data realized in terms of its discrete grid values. We discuss the interplay between two approaches. One approach, realized in the physical space, is based on local differences and is typically limited to low-order of accuracy. An alternative approach developed in our previous work [Gelb and Tadmor, Appl. Comp. Harmonic Anal., 7, 101–135 (1999)] and realized in the dual Fourier space, is based on concentration factors; with a proper choice of concentration factors one can achieve higher-orders—in fact in [Gelb and Tadmor, SIAM J. Numer. Anal., 38, 1389–1408 (2001)] we constructed exponentially accurate edge detectors. Since the stencil of these highly-accurate detectors is global, an outside threshold parameter is required to avoid oscillations in the immediate neighborhood of discontinuities. In this paper we introduce an adaptive edge detection procedure based on a cross-breading between the local and global detectors. This is achieved by using the minmod limiter to suppress spurious oscillations near discontinuities while retaining high-order accuracy away from the jumps. The resulting method provides a family of robust, parameter-free edge-detectors for piecewise smooth data. We conclude with a series of one- and two-dimensional simulations.To David Gottlieb, on his 60th birthday, with friendship and appreciation.     

Asymptotic Fourier Coefficients for a C∞ Bell (Smoothed-“Top-Hat”) & the Fourier Extension Problem

In constructing local Fourier bases and in solving differential equations with nonperiodic solutions through Fourier spectral algorithms, it is necessary to solve the Fourier Extension Problem. This is the task of extending a nonperiodic function, defined on an interval , to a function which is periodic on the larger interval . We derive the asymptotic Fourier coefficients for an infinitely differentiable function which is one on an interval , identically zero for , and varies smoothly in between. Such smoothed “top-hat” functions are “bells” in wavelet theory. Our bell is (for x ≥ 0) where where . By applying steepest descents to approximate the coefficient integrals in the limit of large degree j, we show that when the width L is fixed, the Fourier cosine coefficients a _j of on are proportional to where Λ(j) is an oscillatory factor of degree given in the text. We also show that to minimize error in a Fourier series truncated after the Nth term, the width should be chosen to increase with N as . We derive similar asymptotics for the function f(x)=x as extended by a more sophisticated scheme with overlapping bells; this gives an even faster rate of Fourier convergence     

局部搜索的音频数据检索

根据多媒体音频数据的特点,提出一种适用于快速音频数据检索的局部搜索数据结构,即局部搜索树(local search tree,LS-tree).在局部搜索树中,分别以音频数据小波变换系数的过零率和平均幅度作为主、次关键码,基于局部范围对作为索引的其他系数进行组织.其次,基于局部搜索树,提出采用小波包最好基小波塔型算法实现音频数据检索.最后,把采用局部搜索树的小波包最好基—小波塔型算法的搜索和基于小波不同级系数的检索方法相比较,结果表明,这种方法对音频数据检索的快速和有效性.     

局部随机搜索扰动的粒子群优化算法

在粒子群优化（PSO）算法中,gBest粒子的行为对算法的收敛性能有较大的影响。提出一种新的改进粒子群优化算法——SLS-PSO算法。该算法以基本PSO算法为框架,融合随机局部搜索算法（SLS）对进化中的gBest粒子进行局部寻优计算,以改善PSO算法在进化中特别是进化后期的收敛性能。通过典型测试函数的计算表明,该算法在收敛速度和精度上都有不同程度的改善。     

多库系统的两阶段局部代理失败恢复策略

从保证全局事务的ACID性及实际的可操作性出发，提出了一种较为可靠的两阶段局部代理的工作流程，使用局部代理作为全局事务管理系统与局部数据库的中间层，模拟出符合2PC协议的状态，从而在多数据库的事务处理中使用2PC协议，在最大限度保证异构数据库自治的前提下，从一定程度上解决了全局事务的原子性保证问题和局部站点失败恢复的问题     

Optimal design of shells against buckling by means of the simulated annealing method

In this paper, the problem of optimal design of shells against instability under combined state of loadings is considered. We look for the shape of a meridian as well as the thickness of a shell, which ensures the maximal critical value of the loading parameter. The equality constraining the volume of material and the capacity of a shell are considered. The concept of a shell of uniform stability is applied.     

Construction and implementation of general linear methods for ordinary differential equations: A review

It it the purpose of this paper to review the results on the construction and implementation of diagonally implicit multistage integration methods for ordinary differential equations. The systematic approach to the construction of these methods with Runge-Kutta stability is described. The estimation of local discretization error for both explicit and implicit methods is discussed. The other implementations issues such as the construction of continuous extensions, stepsize and order changing strategy, and solving the systems of nonlinear equations which arise in implicit schemes are also addressed. The performance of experimental codes based on these methods is briefly discussed and compared with codes from Matlab ordinary differential equation (ODE) suite. The recent work on general linear methods with inherent Runge-Kutta stability is also briefly discussed.