用Delphi实现快速删除TList的批连续结点算法的探讨

在编制遥测数据处理软件的过程中，面对大量的测试数据，经常需要编写高效率的数据过滤器。本文讨论了一种通过采用跨单元、跨类访问Delphi类的私有域的方法实现快速删除TList批连续结点的新算法，并通过测试结果得到验证。     

Location and calculation-free node-scheduling schemes in large wireless sensor networks

In wireless sensor networks that consist of a large number of low-power, short-lived, unreliable sensors, one of the main design challenges is to obtain long system lifetime without sacrificing system original performance (sensing coverage and sensing reliability). To solve this problem, one of the potential approaches is to identify redundant nodes at the sensing interface and then assign them an off-duty operation mode that has lower energy consumption than the normal on-duty mode. In our previous work [J. Wireless Commun. Mobile Comput. 3 (2003) 271; Processing of ACM Wireless Sensor Network and Application Workshop 2002, September 2002], we proposed a node-scheduling scheme, which can provide a 100% sensing coverage preservation capability. This, however, requires each node to be aware of its own and its neighbors’ location information. Also, in that scheme, each node has to do accurate geometrical calculation to determine whether to take an off-duty status. In this paper, we propose and study several alternative node-scheduling schemes, which cannot completely preserve the original system coverage, but are nonetheless light-weighted and flexible compared with the previous one. Our simulation results compare these schemes with the previous one and demonstrate their effectiveness.     

Strong asymptotics in Lagrange interpolation with equidistant nodes

In this paper we prove three conjectures of Revers on Lagrange interpolation for f_λ(t)=|t|^λ,λ>0, at equidistant nodes. In particular, we describe the rate of divergence of the Lagrange interpolants L_N( f_λ,t) for 0<|t|<1, and discuss their convergence at t=0. We also establish an asymptotic relation for max_|t|1| |t|^λ−L_N( f_λ,t)|. The proofs are based on strong asymptotics for |t|^λ−L_N( f_λ,t), 0|t|<1.     

基于C8051F040的CAN总线通讯系统设计

作为一种很有前途的现场总线,CAN总线通信相对于一般的串行通信总线,他的实时性、可靠性和灵活性的特点更加突出。介绍了C8051F040内部集成的CAN控制器的使用方法,给出了以此芯片为核心的CAN总线智能节点通讯接口的硬件和软件设计,实际的运行验证了设计的正确性。其设计通用性好、可靠性高、性价比高,具有广泛的应用前景。     

Markovian network processes: Congestion-dependent routing and processing

A Markovian network process describes the movement of discrete units among a set of nodes that process the units. There is considerable knowledge of such networks, often called queueing networks, in which the nodes operate independently and the routes of the units are independent. The focus of this study, in contrast, is on networks with dependent nodes and routings. Examples of dependencies are parallel processing across several nodes, blocking of transitions because of capacity constraints on nodes, alternate routing of units to avoid congestion, and accelerating or decelerating the processing rate at a node depending on downstream congestion. We introduce a general network process representing the numbers of units at the nodes and derive its equilibrium distribution. This distribution takes the form of a product of functions of vectors in which the arguments of the functions satisfy an interchangeability property. This new type of distribution may apply to other multi-variate processes as well. A basic idea in our approach is a linking of certain micro-level balance properties of the network routing to the processing rates at the nodes. The link is via routing-balance partitions of nodes that are inherent in any network. A byproduct of this approach is a general characterization of blocking of transitions without the restriction that the process is reversible, which had been a standard assumption. We also give necessary and sufficient conditions under which a unit moving in the network sees a time average for the unmoved units (called the MUSTA property). Finally, we discuss when certain flows between nodes in an open network are Poisson processes.This research was sponsored in part by Air Force Office of Scientific Research contract 84-0367.     

面向鲁棒频谱感知的模糊K-means++算法

恶意用户通过向数据融合中心发送伪造的频谱感知数据,解决自身频谱资源短缺问题,但会极大地降低频谱感知系统的检测概率。为了解决此问题,提出了基于模糊K means++的数据融合算法。该算法首先引入模糊处理机制处理样本的数据特征值,以此来增加样本间的差异性;然后将模糊处理后的数据发送到融合中心,融合中心采用离群点挖掘的方法排除恶意用户,并对保留下来的用户进行融合,使样本向量具有鲁棒性;最后运用K means++算法对样本向量进行聚类。该算法利用轮盘法选择聚类中心,可有效抵御恶意用户的攻击,提高系统感知性能;无需知晓信号与噪声的分布等一些先验信息,也避免了繁杂的门限推导。从仿真结果可以看出,该算法对抵御恶意用户攻击具有突出的效果,有效提升了协同频谱感知系统的稳定性和鲁棒性。     

基于极大权的最小连通支配集启发式算法

Ad hoc无线网络中基于最小连通支配集(MCDS)的路由是一个引人瞩目的方法,文中提出了一种基于极大权的MCDS的启发式算法,确保了性能强的主机担任网关节点的角色,能更好的协调管理网络中其他的节点,从而保持MCDS的相对稳固性并为全网中的广播和路由操作提供一个高效的通信基础.仿真结果表明,该算法能在保证生成权和极大的连通支配集的同时也确保它的极小性,因此能有效地用于基于MCDS的路由设计中.     

Evolutionary variational inequalities with a volterra term

The mathematical model of the injection molding process is characterized by evolutionary inequalities with an elliptic principal part and a Volterra term. Existence and uniqueness of the solution of these problems are derived by means of an argument based on the Banach fixed point theorem. Regularity results are obtained by using the penalty and Rothe method. The results can be considered as a starting point for the numerical treatment and for the application to injection molding.     

高效的基于段模式的恶意URL检测方法

提出一种高效的基于段模式的检测恶意URL的方法,该方法首先解析已标注的恶意URL中的域名、路径名和文件名3个语义段,然后通过建立以三元组为词项的倒排索引快速计算恶意URL每个语义段的模式,最后基于倒排索引查找到的段模式来判定给定的URL是否是恶意URL。不仅如此,该方法还支持基于Jaccard的随机域名识别技术来判定包含随机域名的恶意URL。实验结果表明,与当前先进的基准方法相比,该方法具有较好的性能和可扩展性。