基于二阶Newton插值的莫尔条纹消除算法

数码相机拍摄容易受到颜色滤波阵列(CFA)采样频率的规则性图案干扰,导致输出图像带有莫尔条纹。为解决该问题,提出一种基于二阶Newton插值近似的数码图像莫尔条纹消除算法。利用小波变换提取G分量在水平和垂直方向的高频信息,通过对高频信息做频域变换模拟CFA混叠过程,进而对图像中莫尔区域及其潜在区域进行检测。针对莫尔条纹区域,利用二阶Newton插值获取G分量各方向的估计值,并对所得估计值加权平均取得丢失的G分量,再采用色差空间模型插值恢复R和B分量,最终得到消除莫尔条纹且包含完整RGB信息的图像。实验结果表明,该算法在不影响图像色彩质量的同时能有效去除莫尔条纹,且相比双线性插值、Hibbard等算法恢复图像的峰值信噪比更高、主观视觉效果更好。     

列车智能止轮器在线监测系统的设计与实现

介绍了基于GPRS的列车止轮器在线监测系统,并对系统结构、工作原理、硬件构成及软件设计进行了比较详尽的论述。该系统实时在线监测列车止轮器的水平位移、水平倾角与表面垂直压力大小及变化趋势等信息,将监测到的信息通过GPRS及Internet网络平台传送至远程监控中心,得出列车止轮器实际工作状态,进一步对列车停靠状态做出判断对存在异常隐患的列车止轮器实施报警预案,自动生成排查检修工作表,从而实现其远程在线运行参数的监控与异常诊断与维护。实践证明该系统运行稳定、可靠。     

一种Java程序Chopping方法

程序Chopping对于程序理解、分析、调试、测试等具有重要的意义。已有的Chopping方法主要基于相互连接的系统依赖图(SDG),对于大程序这种SDG描述通常非常复杂,易导致程序Chopping结果不准确。针对这一问题,基于带标签的Java程序描述方法,提出一种Java程序Chopping方法。该方法利用这种描述附带的程序依赖信息,分析参数依赖关系,并在此基础上给出Chopping算法。此程序Chopping方法能把Java程序方法间的程序Chopping问题转换到Java程序方法内进行分析,程序依赖图具有结点少、可重用、可并发构造等优点。最后通过实例和实验给出程序Chopping方法的实施过程及有效性。     

Reading vertical text from a computer screen

In Western languages, text is traditionally presented in horizontal lines. However, reading of vertically arranged text might be more efficient because of the elimination of horizontal eye movements. We investigated the effect of vertical arrangement upon reading text presented on a computer screen. Even though vertically aligned text was read at a slower rate than horizontally aligned text, the difference was smaller than in previous studies. Analysis of eye-movement data revealed that there were no differences in fixation numbers and numbers of regressions between vertical formats and the standard-text format. But fixation durations were shorter for the standard-text format than for the vertical formats. Taken together, the results indicate that reading vertically presented text from a display device may be nearly as efficient as reading normal horizontal text. Therefore, the fact that text is normally vertically arranged in small-screen devices is not a usability problem.     

Reading vertical text from a computer screen

In Western languages, text is traditionally presented in horizontal lines. However, reading of vertically arranged text might be more efficient because of the elimination of horizontal eye movements. We investigated the effect of vertical arrangement upon reading text presented on a computer screen. Even though vertically aligned text was read at a slower rate than horizontally aligned text, the difference was smaller than in previous studies. Analysis of eye-movement data revealed that there were no differences in fixation numbers and numbers of regressions between vertical formats and the standard-text format. But fixation durations were shorter for the standard-text format than for the vertical formats. Taken together, the results indicate that reading vertically presented text from a display device may be nearly as efficient as reading normal horizontal text. Therefore, the fact that text is normally vertically arranged in small-screen devices is not a usability problem.     

基于食肉植物算法的状态序列搜索

从有限自动机中生成简短、可读性强的正则表达式是计算机理论研究中的一个重大课题.在经典的正则表达式生成算法中,状态序列是影响正则表达式质量的关键因素.为了能够快速高效地找到较优的状态序列,本文以食肉植物算法的理论为核心,并结合其他启发式算法的思想进行设计与优化,提出了一种基于食肉植物算法的状态序列搜索方法.通过实验将此方法与已有的一些使用启发式规则的搜索算法进行了对比,实验结果表明,基于食肉植物算法的状态序列搜索方法优于其他启发式算法,生成的正则表达式长度比起其他启发式算法明显缩短,如跟DM算法相比,长度的缩短幅度可以随着自动机阶数的增加达到20%以上,跟随机序列算法相比,可以把长度缩短多个数量级.     

More concise representation of regular languages by automata and regular expressions

We consider two formalisms for representing regular languages: constant height pushdown automata and straight line programs for regular expressions. We constructively prove that their sizes are polynomially related. Comparing them with the sizes of finite state automata and regular expressions, we obtain optimal exponential and double exponential gaps, i.e., a more concise representation of regular languages.     

一组提高存储效率的深度包检测算法

随着深度包检测规则数目的剧烈增长,为了适应网络处理的需求,必须对表示正则表达式的DFA(deterministic finite automata,确定的有限自动机)进行高效的存储.一方面,对DFA的状态点数目进行压缩,提出了一种复合的FSM(有限自动机)的构造方法,通过对正则表达转化成DFA的状态点数目复杂度的分析,将不同复杂度的正则表达式采用不同的方式构建DFA,使得所有平方级和指数级复杂度的状态点数目降低到了线性级.另一方面,对DFA的状态转移数目进行压缩,给出了一种高效的压缩算法,即WD2FA(weighted delayed input DFA,带权延迟DFA)算法,对于任意复杂度的正则表达式都可以将状态转移数目压缩为原来的5%左右,相对于D2FA(delayed input DFA,延迟的DFA)有更好的压缩能力,并且使得D2FA是WD2FA在权值为0情况下的特例.实验结果表明,有限自动机的状态点数目能够控制在线性级,并且在状态点压缩的基础上将状态转移数目压缩为原来的7%.     

Hysteretic upscaled constitutive relationships for vertically integrated porous media flow

Subsurface two-phase flow in porous media often takes place in reservoirs with a high ratio between the associated lateral and vertical extent and the lateral and vertical flow time scales. This allows for a two-scale approach with effective quantities for two-dimensional horizontal flow equations obtained from reconstructed hydrostatic vertical pressure and saturation distributions. Here, we derive explicit expressions for the two dimensional constitutive relationships for a play-type hysteretic Brooks–Corey capillary pressure function with a pore-size distribution index of 2 and quadratic relative permeabilities. We obtain an explicit hysteretic parametrization for the upscaled capillary pressure function and the upscaled relative permeabilities. The size of the hysteresis loop depends on the ratio between buoyancy and the entry pressure, i.e. it scales with the reservoir height and the ratio between drainage and imbibition capillary pressure. We find that the scaling for the relative permeability is non-monotonic and hysteresis vanishes for both small and large reservoirs.     

N状态二进制一致性算法设计及其优化

针对二进制一致性算法扩展性差、经验依赖性强的缺点,提出了一种N状态分布式二进制一致性算法。首先,基于Gossip算法的平均一致性思想和轮盘赌思想,更新无线传感器网络状态均值和当前状态均值的偏差程度,计算所有可能更新状态的初始概率分布;然后,利用遗传算法优化初始概率分布,得到准确率较高的最优概率分布。仿真结果表明,在相同状态个数条件下,本文所设计的算法具有更好的准确率和收敛时间。     

基于膨胀系数的正则表达式分组算法

确定性有限自动机(Det­erministic Finite Automata, DFA)匹配速度远快于非确定性有限状态自动机(Non-deterministic Finite state Autom­ata, NFA),但大量正则表达式转换为DFA时会引起状态爆炸而占用巨大的存储空间。首先定义膨胀系数(Expansion Coefficient, EC)来描述正则表达式的膨胀特性,然后在膨胀系数这一概念基础上,提出一种高效的分组算法--IGA(Improved Grouping Algorithm)算法对正则表达式进行有效分组,将容易引起状态爆炸的正则表达式相互隔离,从而节省存储空间。实验结果表明,与原有算法相比,在相同分组数目时IGA算法平均能够减少25%的状态数。     

Singular Perturbations and Lindblad-Kossakowski Differential Equations

We consider an ensemble of quantum systems described by a density matrix, solution of a Lindblad-Kossakowski differential equation. We focus on the special case where the decoherence is only due to a highly unstable excited state and where the spontaneously emitted photons are measured by a photo-detector. We propose a systematic method to eliminate the fast and asymptotically stable dynamics associated with the excited state in order to obtain another differential equation for the slow part. We show that this slow differential equation is still of Lindblad-Kossakowski type, that the decoherence terms and the measured output depend explicitly on the amplitudes of quasi-resonant applied field, i.e., the control. Beside a rigorous proof of the slow/fast (adiabatic) reduction based on singular perturbation theory, we also provide a physical interpretation of the result in the context of coherence population trapping via dark states and decoherence-free subspaces. Numerical simulations illustrate the accuracy of the proposed approximation for a 5-level systems.      

Lagrangian simulation of oil droplets transport due to regular waves

Dispersed oils (i.e., oil droplets) at sea are transported by convection due to waves and buoyancy and by turbulent diffusion. This work follows the common approach in the oil community of using a Lagrangian approach instead of the Eulerian approach. Our focus was on small scale simulation of oil plumes subjected to regular waves. Stokes' theory was used to obtain analytical expressions for wave kinematics. The velocity above the Mean Water Level was obtained using a second order Taylor's expansion of the velocity at the MWL. Five hundred droplets were used to simulate the plume for a duration of 60 wave periods. A Monte Carlo framework (300 simulations) was used to compute theoretical mean and variance of plumes. In addition, we introduced a novel dimensionless formulation, whose main advantage was to allow one to report distances in terms of the wave length and times in terms of the wave period. We found that the Stokes' drift was the major mechanism for horizontal transport. We also found that lighter oils propagate faster but spread less than heavier oils. Increasing turbulent diffusion caused the plume to disperse deeper in the water column and to propagate less forward. The spreading in both vertical and horizontal directions increased with an increase in turbulent diffusion. The increase in wave slope (or wave steepness) caused, in general, an increase in the downward and horizontal transport. In the context of mixing in the water column, the dimensionless formulation showed that small steepness waves with a large turbulent diffusion coefficient could result in essentially the same spreading as large steepness waves with a small turbulent diffusion coefficient.     

不确定线性系统有限时间状态估计与故障重构

针对具有外部干扰和执行器故障的不确定线性系统,给出了一种有限时间内估计系统状态及重构执行器故障的方法．首先,通过状态和输出等价变换,得到不受执行器故障和建模不确定信息干扰的降维解耦系统．在此基础上设计有限时间状态估计器,并设置任意小的时延参数,实现对降维系统状态的有限时间估计,从而达到对原系统状态有限时间估计的目的;其次,考虑高增益滑模微分器对系统输出微分进行有限时间估计;之后,在原系统状态和系统输出微分有限时间估计的基础上,提出一种对系统不确定信息和执行器故障同时估计的方法;最后,通过对具有执行器故障的F-16飞行器纵向系统模型进行仿真,验证所提方法的有效性．     

基于主导边界Radon变换的SAR目标方位角估计方法

针对仅利用主导边界估计带来的目标垂直与水平方位的模糊问题,提出一种基于主导边界Radon变换的合成孔径雷达(SAR)图像目标方位角估计方法。该方法基于分割图像中目标主导边界长度的判别准则进行解模糊,同时引入目标主导边界Radon变换的估计算法,解决了传统主导边界算法中长、短主导边界不易分离的问题。MSTAR实测数据的实验结果表明提出的算法具有良好的精确度和适应性。     

From regular expressions to smaller NFAs

Several methods have been developed to construct λ-free automata that represent a regular expression. Among the most widely known are the position automaton (Glushkov), the partial derivatives automaton (Antimirov) and the follow automaton (Ilie and Yu). All these automata can be obtained with quadratic time complexity, thus, the comparison criterion is usually the size of the resulting automaton. The methods that obtain the smallest automata (although, for general expressions, they are not comparable), are the follow and the partial derivatives methods. In this paper, we propose another method to obtain a λ-free automaton from a regular expression. The number of states of the automata we obtain is bounded above by the size of both the partial derivatives automaton and of the follow automaton. Our algorithm also runs with the same time complexity of these methods.     

Study on directional eye movements in non‐frontal face images for eye‐controlled interaction

Directional eye movements based eye‐controlled interaction focuses on interpreting the horizontal, vertical, and diagonal eye movements or their combinations as inputs to design user interfaces for people who suffer with severe mobility disabilities. In this paper, we take into consideration the inherent eye jitter and evaluate the accuracy of dynamic tracking of horizontal, vertical, diagonal, and rectangular eye movements prior to using them. We observe that the rectangular eye gesture composed of short horizontal and vertical eye movements has the best tracking accuracy in the presence of jitter. Finally, we present methods for identifying horizontal and vertical eye movements based on the trajectory of eye pupil centers from non‐frontal face images. We find that the methods are robust and effective within ±20°deflective azimuths of non‐frontal faces. This effectiveness is demonstrated by using the rectangular eye gesture as an interface to perform a painting task.     

大数据访问中信息传输冗余量消除仿真

针对传统的大数据访问中信息传输冗余量消除方法存在查全率、信息传输冗余量消除效率以及速率较低等问题,提出了基于Hamming距离值的大数据访问中信息传输冗余量消除方法。利用滑动以及滚动相结合的窗口移动模式减少窗口计算量,将Rsync滚动校验算法以及MD5算法相结合,在文件任意位置开始计算滚动校验值,通过递进关系,获取连续数据块的校验值,根据不同数据块的校验值进行数据匹配。将经过匹配后的数据块利用CDC分块检测算法进行检测,根据余弦相似度计算公式以及Hamm距离值计算相似度,实现大数据访问中信息传输冗余量消除。实验结果表明,所提方法有效提高了冗余信息查全率、信息传输冗余量消除效率以及速率,能够快速、准确地消除多余的信息。     

Checking determinism of XML Schema content models in optimal time

We consider the determinism checking of XML Schema content models, as required by the W3C Recommendation. We argue that currently applied solutions have flaws and make processors vulnerable to exponential resource needs by pathological schemas, and we help to eliminate this potential vulnerability of XML Schema based systems. XML Schema content models are essentially regular expressions extended with numeric occurrence indicators. A previously published polynomial-time solution to check the determinism of such expressions is improved to run in linear time, and the improved algorithm is implemented and evaluated experimentally. When compared to the corresponding method of a popular production-quality XML Schema processor, the new implementation runs orders of magnitude faster. Enhancing the solution to take further extensions of XML Schema into account without compromising its linear scalability is also discussed.