Accelerating filtering techniques for numeric CSPs

Search algorithms for solving Numeric CSPs (Constraint Satisfaction Problems) make an extensive use of filtering techniques. In this paper¹ we show how those filtering techniques can be accelerated by discovering and exploiting some regularities during the filtering process. Two kinds of regularities are discussed, cyclic phenomena in the propagation queue and numeric regularities of the domains of the variables. We also present in this paper an attempt to unify numeric CSPs solving methods from two distinct communities, that of CSP in artificial intelligence, and that of interval analysis.     

A Dynamic Dictionary for Priced Information with Application

In this paper we design a dynamic dictionary for the priced information model initiated by Charikar et al. Assume that a set S consisting of n elements is given such that each element has an associated price, a positive real number. The cost of performing an operation on elements of S is a function of their prices. The cost of an algorithm is the sum of the costs of all operations it performs. The objective is to design algorithms which incur low cost. In this model we propose a dynamic dictionary, supporting search, insert and delete, for keys drawn from a linearly ordered set. As an application we show that the dictionary can be used in computing the trapezoidal map of a set of line segments, a fundamental problem in computational geometry.     

Ergodicity of filtering process by vanishing discount approach

A new approach to study ergodicity of filtering processes is presented. It is based on the vanishing discount approach to discounted functional of filtering process. We show that limit superior of the Cesaro averages of the functionals is the same for all initial conditions from which the uniqueness of invariant measures of filtering processes follows. The approach is based on certain assumption for which we provide a sufficient condition using concavity arguments. In addition we show the existence of solutions to the Poisson equation corresponding to filtering process with concave functional. The assumptions are then extended to the controlled case and using similar concave arguments we obtain the existence of solutions to the Bellman equation corresponding to partially observed average cost per unit time problem.     

Accurate Depth of Field Simulation in Real Time

We present a new post processing method of simulating depth of field based on accurate calculations of circles of confusion. Compared to previous work, our method derives actual scene depth information directly from the existing depth buffer, requires no specialized rendering passes, and allows easy integration into existing rendering applications. Our implementation uses an adaptive, two‐pass filter, producing a high quality depth of field effect that can be executed entirely on the GPU, taking advantage of the parallelism of modern graphics cards and permitting real time performance when applied to large numbers of pixels.     

应用代理系统在信息披露中的应用

提出了一种用开源软件对Web网站进行应用保护的方式,并通过研究,提出了修改程序的思路和方法,使得该程序可以更好地为应用系统服务,同时也使得代理程序不会成为应用程序和客户端之间额外的负担。     

电子设备机箱电磁屏蔽分析和设计

在分析了电子设备工作环境的基础上,明确了电子设备外部的主要干扰源,并进行了屏蔽效能分析。为提高电子设备抗干扰性能,针对外部干扰源提出了屏蔽、滤波和接地等抗干扰设计方案,确保电子设备能在复杂恶劣的环境下正常工作。     

纱线烘干系统的PLC改造与应用

介绍了烘房烘干的工艺过程，及应用PLC在该系统中进行电气控制系统改造，使系统烘干质量高，工作可靠，设置、操作简单，提高了生产效率。     

A data porting tool for coupling models with different discretization needs

The presented work is part of a larger research program dealing with developing tools for coupling biogeochemical models in contaminated landscapes. The specific objective of this article is to provide researchers with a data porting tool to build hexagonal raster using information from a rectangular raster data (e.g. GIS format). This tool involves a computational algorithm and an open source software (written in C). The method of extending the reticulated functions defined on 2D networks is an essential key of this algorithm and can also be used for other purposes than data porting. The algorithm allows one to build the hexagonal raster with a cell size independent from the geometry of the rectangular raster. The extended function is a bi-cubic spline which can exactly reconstruct polynomials up to degree three in each variable. We validate the method by analyzing errors in some theoretical case studies followed by other studies with real terrain elevation data. We also introduce and briefly present an iterative water routing method and use it for validation on a case with concrete terrain data.     

一种基于动态阈值的自适应中值滤波方法

针对图像受到电磁干扰带来的脉冲噪声,对自适应中值滤波方法进行改进。在去除噪声的过程中为了更好地将信号和噪声进行区分开,引入噪声点的预判机制。为满足改进算法对自适应中值滤波半径和窗口的变化的适应．采用自适应动态阈值。通过与SMF、RAMF等方法的比较实验表明,该算法具有较高的峰值信噪比和边缘保持性能。