Identification of Hammerstein systems with asymmetric dead-zone nonlinearities using canonical parameterized model

A non-iterative identification method with parameterization of the unknown dead-zone is proposed for Hammerstein systems in presence of asymmetric dead-zone nonlinearities.The canonical parameterized model which is a single expression without segmentation is utilized to describe the dead-zone,based on which a universal-type parametric model can be established to approximate the entire system.This model can be established without separating the nonlinear part from the linear part.The dead-zone parameters and the coefficients in the linear transfer function can be estimated simultaneously according to the proposed algorithm.Numerical experiments are presented to illustrate the effectiveness of the proposed scheme.     

基于C#语言的图片插入方法比较

图片是传递与表达信息的重要形式,由于图片数据特殊编码方式,它的存储和显示显得比较复杂。C#功能强大,使用方便,已经成为一种主流的计算机软件编程语言。文章介绍了使用C#向数据库中插入图片的方法,并加以比较。     

一种保护标价的多属性反向拍卖模型

多属性反向拍卖作为一种电子采购方式已被广泛应用于电子商务中.在大多数拍卖模型中,投标者的标价信息对于拍卖者来说完全公开,在拍卖者和个别投标者共谋情况下,会造成投标者之间的地位不平等,给其他投标者造成经济损失.文中在逼近理想解评标方法和安全多方计算基础上,提出一种保护标价的多属性反向拍卖模型,该模型采用了安全逼近理想解协议,实现标价保密和投标者地位公平,抵御拍卖者与个别投标者的共谋.     

基于共同好友数的在线社会网络社区发现算法

为了快速准确地找到在线社会网络的社区结构,提出了一种基于共同好友数和节点邻居信息的社区结构发现算法。该算法以共同好友数最多的两个节点为初始社区,不断寻找与社区连接性最强的节点,并以节点Q值为衡量标准,判断是否将该节点加入到初始社区中,最后根据节点邻居所在初始社区信息确定最终的社区划分。针对两个经典社会网络和人工生成网络数据的实验划分结果表明,该算法是可行和有效的。     

CS3000顺控表的组态和应用

介绍CS3000系统顺控表的结构、参数定义和功能块组态,以聚丙烯加氢控制为例,描述顺控表的组态方法、顺控动作和操作步骤等。     

Achieving fair service with a hybrid scheduling scheme for CICQ switches

Providing performance guarantees for arriving traffic flows has become an important measure for today’s routing and switching systems. However, none of current scheduling algorithms built on CICQ (combined input and cross-point buffered) switches can provide flow level performance guarantees. Aiming at meeting this requirement, the feasibility of implementing flow level scheduling is discussed thoroughly. Then, based on the discussion, it comes up with a hybrid and stratified fair scheduling (HSFS) scheme, which is hierarchical and hybrid, for CICQ switches. With HSFS, each input port and output port can schedule variable length packets independently with a complexity of O(1). Theoretical analysis show that HSFS can provide delay bound, service rate and fair performance guarantees without speedup. Finally, we implement HSFS in SPES (switch performance evaluation system) to verify the analytical results.     

Localized relaxation theory of circuits and its applications in electro-thermal analyses

In the high-performance IC design with increasing design complexity,it is a very important design content to efficiently analyze IC parameters.Thus,the electro-thermal (ET) analyses including power/ground (P/G) analysis and thermal analysis are hot topics in today’s IC research.Since ET analysis equation has a sparse,positive definite and strictly diagonally dominant coefficient-matrix,we prove that the ET analysis has the advantage of locality.Owing to this advantage,localized relaxation method is formally proposed,which has the same accuracy as the global relaxation done with the constraint of the same truncation error limitation.Based on the localized relaxation theory,an efficient and practical localized successive over-relaxation algorithm (LSOR2) is introduced and applied to solve the following three ET analysis problems.(1) Single-node statistical voltage analysis for over-IR-drop nodes in P/G networks;(2) single-node statistical temperature analysis for hot spots in 3D thermal analysis;(3) fast single open-defect analysis for P/G networks.A large amount of experimental data demonstrates that compared with the global successive over-relaxation (SOR) algorithm,LSOR2 can speed up 1-2 orders of magnitudes with the same accuracy in ET analyses.     

Organisation and management of shared documents in super-peer networks based semantic hierarchical cluster trees

A super-peer semantic network defines the semantic groups that client peers and their super peers use to connect with each other according to the semantic similarity of shared documents in peers. This will result in a query that can be evaluated locally thus reducing query process time and the amount of communication required to obtain related data. In this study, new algorithms are proposed to arrange shared documents in peers into hierarchical cluster tree structures, and links will be set up to connect semantically related super peers. During query evaluation, only related peers will be searched thus the complexity of computing is significantly reduced. Consideration is also given to automatically deciding the threshold for clustering and the construction and other essential operations for hierarchical cluster trees. The experiment results illustrate the features of the approach developed in this study.     

基于跨层快速邻居感知的OLSR协议

提出了一种基于跨层快速邻居感知的OLSR协议——FS-OLSR,协议在采用hello消息进行链路感知和邻居探测的基础上,结合链路层反馈的信息对网络层邻居表进行更新,以增强节点的邻居感知能力;并将邻居节点的新鲜度作为MPR计算的依据,以提高拓扑消息中广播邻居节点的新鲜度,使之更加适合于快速移动场景。仿真结果表明,在快速移动场景中,FS-OLSR能够在增加少量路由开销的情况下,显著降低丢包率。