一种改进的数字散斑相关方法用于检测人的口型变化

提出了一种基于数字散斑相关测量技术的口型变化检测技术,该技术以白光数字散斑相关测量方法为基础,根据实际应用的需要,引入重心算法并进行了改进,可以实时地检测人说话时的口型变化。通过实验表明,提出的方法是一种实用的、快速、高精度的口型变化测试方法,可为今后的唇语识别技术奠定基础。     

风冷热泵冷热水机组动态过程仿真

本文给出了风冷热泵冷热水机组动态过程模型。系统的高、低压段被分成制冷剂侧、管壁、以及水或空气侧三个控制容积。针对每个控制容积建立了质量和能量平衡的微分方程。由于压缩机、热力膨胀阀阀体、以及四通换向阀具有较小的热惯性,因而采用稳态模型描述压缩过程、膨胀过程、以及内泄露过程。膨胀阀感温包中的制冷剂温度对于蒸发器出口温度的延迟用一阶惯性环节来描述。通过“预测-校正”和“自适应步长”方法实现系统仿真。仿真结果与测试数据吻合良好。     

高压沿面放电烟气脱硫技术动态实验研究

本文针对高压沿面放电活化气体的烟气脱硫技术,在静态实验研究的基础上进行了实验室冷态动态的实验研究。设计了便于反应和测量的动态实验装置。实验解释了电子束法脱硫技术中导致氨气泄漏的部分原因,验证了高压沿面放电脱硫技术可以在较低的运行电压下,达到提高脱硫效率,减少氨气泄漏的作用。     

数字全息技术的原理和应用

数字全息是随着现代计算机和CCD技术发展而产生的一种新的全息成像技术．文章主要介绍数字全息技术的基本原理，数字全息重建中的主要方法以及数字全息技术以其独特的优点在各个领域中的应用．     

Hille and Nehari type criteria for third-order dynamic equations

In this paper, we extend the oscillation criteria that have been established by Hille [E. Hille, Non-oscillation theorems, Trans. Amer. Math. Soc. 64 (1948) 234-252] and Nehari [Z. Nehari, Oscillation criteria for second-order linear differential equations, Trans. Amer. Math. Soc. 85 (1957) 428-445] for second-order differential equations to third-order dynamic equations on an arbitrary time scale T, which is unbounded above. Our results are essentially new even for third-order differential and difference equations, i.e., when T=R and T=N. We consider several examples to illustrate our results.     

On polynomial symbols for subdivision schemes

Given a dilation matrix A :ℤ^d→ℤ^d, and G a complete set of coset representatives of 2π(A ^−Tℤ^d/ℤ^d), we consider polynomial solutions M to the equation ∑ _g∈G M(ξ+g)=1 with the constraints that M≥0 and M(0)=1. We prove that the full class of such functions can be generated using polynomial convolution kernels. Trigonometric polynomials of this type play an important role as symbols for interpolatory subdivision schemes. For isotropic dilation matrices, we use the method introduced to construct symbols for interpolatory subdivision schemes satisfying Strang–Fix conditions of arbitrary order. Research partially supported by the Danish Technical Science Foundation, Grant No. 9701481, and by the Danish SNF-PDE network.     

数码相机原理与系统设计研究

介绍了数码相机的工作原理 ,分析了数码相机的系统结构 ,提出了设计数码相机的处理流程。典型的数码相机系统有镜头、闪光灯、光学取景器、LCD显示屏、图像数据存储扩展设备接口、图像数据传输接口、供电系统以及核心处理器等八个主要模块。数码相机的数据流向从图像传感器开始 ,止于图像数据的存储和传输。数据流的处理主要包括模数转换、光学黑电平钳位、针对镜头的边缘畸变的运算修正、坏像素处理、白平衡处理、伽马校正、色彩合成处理、边缘检测 (锐度检测 )和伪彩色检测 (伪彩色抑制 )、JPEG压缩和图像存储器等模块     

Dynamic fractal unifying interaction confirmed with magnetospheric behavior and orbital data

The solar wind makes the magnetosphere to expand and contract as indicated by the expansions and contractions of the auroral oval due to balancing of the dynamic pressure of the ambient space plasma at inner and outer magnetic lines. This self‐similar magnetospheric behavior elucidates the controversial magnetic storm‐substorm relationship and reveals the 3D‐spiral structure of magnetic interaction. The found self‐similarly evolving structure of one seen as fundamental interaction suggests dynamic fractal unifying interaction that builds a firework universe having 3D‐spiral code. The unifying interaction is described with equation drawn in new fundamental dynamic fractal framework. The equation of unifying interaction converges to the inverse square laws and the principle of uncertainty at laboratory scales. The dynamic fractal fundamental framework is made of one 3D‐spirally‐faster‐inward contracting and expanding, oscillating, basic matter. It simply accounts for observed constant speed of light and for the creation of bright and dark bands on a screen behind a tiny slit. The dynamic fractal framework is quantitatively confirmed with the orbital data for the Milky Way Galaxy, the Sun, the Earth, and the triple asteroid system 87 Sylvia. Many testable predictions are also made. The presented new fundamental dynamic fractal framework allows qualitative and quantitative modeling and simplification. © 2007 Wiley Periodicals, Inc. Complexity 12: 61–76, 2007     

On the departure process of a leaky bucket system with long-range dependent input traffic

Due to the strong experimental evidence that the traffic to be offered to future broadband networks will display long-range dependence, it is important to study the possible implications that such traffic may have for the design and performance of these networks. In particular, an important question is whether the offered traffic preserves its long-range dependent nature after passing through a policing mechanism at the interface of the network. One of the proposed solutions for flow control in the context of the emerging ATM standard is the so-called leaky bucket scheme. In this paper we consider a leaky bucket system with long-range dependent input traffic. We adopt the following popular model for long-range dependent traffic: Time is discrete. At each unit time a random number of sessions is initiated, having the distribution of a Poisson random variable with mean λ. Each of these sessions has a random duration τ, where the integer random variable τ has finite mean, infinite variance, and a regularly varying tail, i.e., P(τ >К) ~ К^-Lα L(К), where 1 < α < 2 L(·) is a slowly varying function. Once a session is initiated, it generates one cell at each unit of time until its termination. We examine the departure process of the leaky bucket policing mechanism driven by such an arrival process, and show that it too is long-range dependent for any token buffer size and any - finite or infinite - cell buffer size. Moreover, upper and lower bounds for the covariance sequence of the output process are established. The above results demonstrate that long-range dependence cannot be removed by the kinds of flow control schemes that are currently being envisioned for broadband networks. This revised version was published online in June 2006 with corrections to the Cover Date.     

GDDP: Generalized Dual Dynamic Programming Theory

This document presents theoretical considerations about the solution of dynamic optimization problems integrating the Benders Theory, the Dynamic Programming approach and the concepts of Control Theory. The so called Generalized Dual Dynamic Programming Theory (GDDP) can be considered as an extension of two previous approaches known as Dual Dynamic Programming (DDP): The first is the work developed by Pereira and Pinto [3–5], which was revised by Velásquez and others [8,9]. The second is the work developed by Read and others [2,6,7].