基于伪ID码的树型防碰撞算法

树型防碰撞算法在标签数目过多的情况下,由于树的深度过深导致标签识别效率低.为此,提出一种基于伪ID码的树型防碰撞算法.阅读器利用标签数量预测算法,检测出识别范围内未识别标签的大致数量并发给其标签.标签根据数量随机生成一个数字,作为自己的伪ID码.阅读器依次查询伪ID码,若发生碰撞,则利用碰撞跟踪树算法进行识别,在识别标签的过程中通过伪ID码降低查询树的深度,提高标签的识别效率.理论分析和仿真结果表明,与CTT算法和QT算法相比,该算法吞吐率分别提高了15%和74%,并且能够有效加快标签的识别速度,减少时隙总数.     

The performance of foliage mass and crown radius models in forming the input of a forest reflectance model: A test on forest growth sample plots and Landsat 7 ETM+ images

Several published foliage mass and crown radius regression models were tested on the preparation of the input for the reflectance model of Kuusk and Nilson [Kuusk, A. and Nilson, T. (2000), A directional multispectral forest reflectance model. Remote Sensing of Environment, 72(2):244–252.] for 246 forest growth sample plots in Estonia. In each test, foliage mass and crown radius for trees in the sample plots were predicted with a particular pair of allometric regression models. The forest reflectance model was then run using the estimated foliage mass and crown radius values. Reflectance factors were simulated and compared with the reflectance values obtained from three atmospherically corrected Landsat 7 Enhanced Thematic Mapper (ETM+) scenes. The statistics of linear regression between the simulated and measured reflectance factors were used to assess the performance of foliage and crown radius models. The hypothesis was that the best allometric regression models should provide the best fit in reflectance. The strongest correlation between the simulated and measured reflectance factors was found in the short-wave infrared band (ETM + 5) for all the images. The highest R² = 0.71 was observed in Picea abies dominated stands. No excellent combination of foliage mass and crown radius functions was found, but the ranking based on determination coefficients showed that some linear crown radius models are not applicable to our data. Processing of raster images, reflectance measurement for small sample plots, usage of tree-species-specific fixed parameters (specific leaf area, etc.), and the ignored influence of phenology introduced additional variation into the relationships between simulated and measured reflectance factors. Further studies are needed, but these preliminary results demonstrate that the proposed method could serve as an effective way of testing the performance of foliage mass and canopy cover regressions.     

Synthesizing trees by plantons

In this paper, we present a two-level statistical model for characterizing the stochastic and specific nature of trees. At the low level, we define plantons, which are a group of similar organs, to depict tree organ details statistically. At the high level, a set of transitions between plantons is provided to describe the stochastic distribution of organs.Based on such a tree model, we propose a novel tree modeling approach, synthesizing trees by plantons, which are extracted from tree samples. All tree samples are captured from the real world. We have designed a maximum likelihood estimation algorithm to acquire the two-level statistical tree model from single samples or multi- samples. Experimental results show that our new model is capable of synthesizing new trees with similar, yet visually different shapes. Electronic supplementary material Supplementary material is available in the online version of this article at and is accessible for authorized users.     

Dynamic Control with Indistinguishable Events

We consider the problem of synthesizing controllers for dicrete event systems with indistinguishable events. The specification for the supervised system as well as the constraints for the controllers are defined by an extension of the logic of the μ-calculus that generalize the framework introduced by Ramadge and Wonham. More precisely, in order to express that some events are indistinguishable, one can specify with this extension that, from a node of a graph, two edges reach the same node. As for the μ-calculus, the model cheking problem and also the emptiness problem for this extension amount to computing winning strategies in parity games. We show that the centralized control problem with indistinguishable events is decidable by reducing it to the satisfiability problem of a formula of this extension of the μ-calculus. We prove also that, unfortunately, the decentralized control problem is undecidable by a reduction of the halting problem of a Turing machine. Moreover, we exhibit a decidable case of decentralized control by restricting the specifications to those which we called here “conic”.     

模型决策树:一种决策树加速算法

决策树算法采用递归方法构建,训练效率较低,过度分类的决策树可能产生过拟合现象.因此,文中提出模型决策树算法.首先在训练数据集上采用基尼指数递归生成一棵不完全决策树,然后使用一个简单分类模型对其中的非纯伪叶结点(非叶结点且结点包含的样本不属于同一类)进行分类,生成最终的决策树.相比原始的决策树算法,这样产生的模型决策树能在算法精度不损失或损失很小的情况下,提高决策树的训练效率.在标准数据集上的实验表明,文中提出的模型决策树在速度上明显优于决策树算法,具备一定的抗过拟合能力.     

基于树语言逼近的安全协议形式化分析

利用形式化方法或工具自动化分析实用安全协议十分必要,定理证明技术因其可解决无限状态系统的验证备受关注,但扩展其验证规模和自动化实现时仍然存在一些局限性。以定理证明和重写逼近理论为基础,以项重写形式化定义协议模型,以树自动机模拟协议攻击者知识集,给出攻击者知识集可达项逼近求解的算法,并根据上述模型讨论秘密性和认证性的验证方法,最后以Needham-Schroeder公钥认证协议为例验证模型的有效性,并指出下一步研究方向。     

eGiST:一种改进的通用搜索树

新型应用领域的出现,要求数据库系统提供支持数据类型和查询谓词可扩展的索引结构。该文首先介绍了具有这种可扩展性的通用搜索树结构(GiST),分析了GiST在结点溢出处理策略上的不足,并提出了一种改进的通用搜索树结构eGiST,提高了空间利用率和系统效率。     

路径覆盖自动生成技术研究

路径覆盖是路径测试最重要的课题之一。文章给出了ddgraph图的支配树、蕴含树和非限制弧的构造方法,提出了一种基于最小路径测试子集的寻找单个测试路径算法,该算法可有效地生成从入口到出口且覆盖非限制弧的路径子集,并给出了具体的应用实例。     

Agent通信原型的设计与实现

Agent通信一直被认为是多Agent系统协作的核心。该文以人工智能领域中黑板模型结构和消息传送结构作为多Agent系统的基本通信结构,对树形拓扑的多Agent原型系统进行了研究与构造。为适应日益广泛的多Agent系统应用需求,在Agent通信报文设计中考虑了不同网络服务质量及安全参数。文章给出了不同类型的Agent通信实例及通信过程描述,并详述了Agent通信调度算法。最后,对多线程和动态负载平衡等实现原型系统的关键技术进行了分析。     

TTFS:一个倾向性文本过滤系统的设计与实现

以往文本过滤的研究主要集中于主题性过滤，然而随着网络的发展，倾向性文本过滤在网络信息安全方面的作用越来越大。论文阐述了一个倾向性文本过滤系统TTFS(Tenclency Text Filtering System)，能够对具有关于某个主题的特定倾向的文本进行过滤。该系统充分利用了领域知识，采用了语义模式分析等技术，实验表明其查全率和查准率高，速度较快。