Master‐slave synchronization for delayed Lur'e systems using time‐delay feedback control

This paper deals with the problem of designing delayed feedback controllers of master‐slave synchronization for Lur'e systems with time‐variant delay (0≤τ₀≤τ(t)≤τ_m). Through partitioning the intervals [0, τ₀] and [τ₀, τ_m], respectively, and choosing two augmented Lyapunov‐Krasovskii functionals(LKFs), two delay‐dependent synchronization criteria are formulated in the form of linear matrix inequalities (LMIs), in which the conservatism can be greatly reduced by thinning the partitioning of delay intervals and employing convex combination. Thus the sufficient conditions can be derived for the existence of delayed feedback controllers, and the controller gain matrices can be achieved by solving the established LMIs. Finally, three numerical examples are given to illustrate the presented synchronization schemes. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

??????????????????

If using the traditional algorithms of background extraction and update on the fixed-point DSP, which is memory-limited and weak at floating-point operation, the detection speed is slow and the real-time ability is poor. The algorithm initializes the background reference frame according to the hypothesis that the background pixel intensity appears in video sequence with maximum probability and the temporal relativity between two neighboring frames. In the session of background update, the algorithm updates the background reference frame by assigning different weights to the original background and the current frame and calculating the result based on shifting operation. It is successfully implemented on TMS320DM642 and results show that the algorithm can meet the real-time constraint in 25 FPS.     

一种支持XML文档更新的编码方案

目前现有的前缀编码、区间编码等编码方案均不能很好地支持XML文档的更新计算。为此,提出一种新的前缀编码方案TDE。将实数映射为二维元组,利用任意2个实数间存在无限个实数的特点,对XML文档进行插入节点操作而无需对其他节点进行二次编码,并采用压缩存储减小编码的存储空间。实验结果表明,该方案能有效支持XML文档的更新计算。     

Dynamic harmonic fields for surface processing

Harmonic fields have been shown to provide effective guidance for a number of geometry processing problems. In this paper, we propose a method for fast updating of harmonic fields defined on polygonal meshes, enabling real-time insertion and deletion of constraints. Our approach utilizes the penalty method to enforce constraints in harmonic field computation. It maintains the symmetry of the Laplacian system and takes advantage of fast multi-rank updating and downdating of Cholesky factorization, achieving both speed and numerical stability. We demonstrate how the interactivity induced by fast harmonic field update can be utilized in several applications, including harmonic-guided quadrilateral remeshing, vector field design, interactive geometric detail modeling, and handle-driven shape editing and animation transfer with a dynamic handle set.     

Updating Epistemic Logic Programs

We consider the problem of updating non-monotonic knowledgebases represented by epistemic logic programs where disjunctiveinformation and notions of knowledge and belief can be explicitlyexpressed. We propose a formulation for epistemic logic programupdate based on a principle called minimal change and maximalcoherence. The central feature of our approach is that duringan update or a sequence of updates, contradictory informationis removed on a basis of minimal change under the semanticsof epistemic logic programs and then coherent information ismaximally retained in the update result. Through various updatescenarios, we show that our approach provides both semanticand syntactic characterizations for an update problem. We alsoinvestigate essential semantic properties of epistemic logicprogram update.     

负关联规则增量更新算法

讨论负关联规则的更新问题。与正关联规则增量更新不同,负关联规则不仅存在于频繁项集中,更多存在于非频繁项集中。针对该问题提出一种负关联规则增量更新算法NIUA,利用改进的Apriori算法以及集合的性质挖掘出频繁、非频繁项集和负关联规则。实验结果表明,该算法是可取的。     

XML文档访问控制研究

针对XML文档访问控制过程中,更新操作引起的重复DTD验证以及DOM树解析、标记问题,提出操作类型的概念。根据操作类型区分不同的更新访问请求,过滤掉不具权限的请求,以节省验证以及标记过程所耗费的内存等系统资源。通过实例证明该方法在更新请求频繁的情况下,性能优于现有的访问控制技术。     

基于多元线性回归的雾霾预测方法研究

提出了一种在线样本更新的多元线性回归分析的雾霾预测方法。首先搜集了北京市天气状况,包括平均气温、湿度、风级等气象数据以及PM2.5、CO、NO₂、SO₂等大气成分浓度数据,然后通过散点图对这些因素进行主要影响因素分析,筛选出对雾霾影响比较明显的因素作为雾霾预测的依据。通过在线样本更新的多元线性回归建立了PM2.5含量预测模型,并将气象要素作为雾霾的判断标准。最后给出实际例子,利用多元线性回归对北京未来一天、三天及一周的PM2.5含量进行较为精确的预测。     

移动端融合通信中企业通讯录增量更新的研究

近年来,随着移动互联网的快速发展,通信行业也进入了移动时代,企业的通信业务可以借助移动互联网结合融合通信拓展到移动领域.企业通讯录作为企业通信的入口起着至关重要的作用.传统的企业通讯录更新技术未考虑到移动互联网资源有限的特点已经不适合用于目前的融合通信中.因此本文提出了基于LDAP目录服务实现增量更新的方法,以此来降低移动端和服务器端的资源消耗.最后通过将传统的企业通讯录中全量更新技术与本文提出的增量更新技术作实验对比分析,验证增量更新在移动互联网方面优于全量更新.     

事务控制的面向服务系统的动态更新协调

就面向服务的分布式系统中多服务动态更新的协调问题,提出基于事务控制的更新协调策略,包括安全更新时机的选择策略、使用2PC(two-phase-commit)协调多服务更新的控制策略.根据更新实施的各步操作时间开销,提出分别采用更新短事务控制基本更新操作(包括创建服务实例、顺序实施运行时状态转换、重定向服务请求和新服务的...