机器视觉的零件轮廓尺寸测量系统设计

提出了一种新的基于机器视觉的零件轮廓尺寸精密测量系统,设计了系统的硬件和软件部分,并介绍了测量系统的关键技术.利用LabVIEW为平台开发系统软件,采用改进的Canny算法识别图像边缘,使得测量速度更快,零件轮廓信息提取效率更高.     

基于主元证据理论在车辆识别中的应用

车辆识别技术作为智能交通管理系统中的研究热点和难点;在车辆识别技术中,应用Dempster- Shafer证据组合规则融合冲突信息时会产生不合理的结果;基于修正证据源的思想,提出了一种新的权重系数确定方法,该方法从证据主元角度分析,确定各组证据主元,利用该主元求出证据相容度、可信度,进而确定证据权重系数;通过新的证据冲突衡量方法,确定冲突值,归一化权重,修正证据源,按ER规则融合各组证据对目标进行识别;仿真部分以实际路面车辆车型识别为算例,将该方法与其他方法对比,结果表明:该方法能更有效地融合高度冲突的证据,减小计算复杂度,目标识别的准确性提高20%。     

视觉P300脑机接口中的SOA扰动现象

异步操控性是脑机接口走向实际应用的关键技术之一.其关键点在于寻找一种可有效区分脑机接口工作状态和空闲状态的指标.建立了针对P300脑机接口的刺激起始异步(SOA)扰动模型,在仿真实验和实测数据中观察到SOA扰动谱线,并根据所提出的模型给出了合理解释.研究了SOA扰动的频域特性,结果表明,当SOA位于220 ms附近时,SOA扰动的强度最大,而当SOA低于150 ms时,SOA扰动强度将急剧减小.同时SOA扰动所具有的锁相性使得可以通过时域相干平均法进一步提高信噪比.SOA扰动可作为脑机接口处于工作状态的标志,为异步脑机接口的实现提供了一种新的研究思路.     

FTP条件下CSMA/CD协议信道访问公平性研究

在共享式局域网环境下,信道的惟一性与主机接入的随机性构成了一对矛盾,这必然导致从不同主机发送的数据帧在共享信道上发生碰撞,为了降低碰撞所引发冲突的机率,数据链路层采用了CSMA/CD协议,但是该协议能否保证信道分配的公平性是一个鲜有研究的课题。文章结合应用层FTP协议,在NS2仿真环境下搭建实验拓扑并仿真模拟,通过性能分析,证明CSMA/CD可以有效保障信道访问公平性并维持FTP性能。     

基于需求驱动的数字化校园数据架构研究与设计

近年来,在数字化校园建设中,以数据服务为核心,为不同角色提供人性化信息服务,以及为学校发展提供决策支持的需求应运而生.而单一的统一数据库在应用系统和业务规模扩大时其应用查询效率较低,为此设计出一种新的数字化校园数据架构,将数据交换库与共享数据库分离,使数据存放更为有效,从而提高查询效率.从理论上和技术上对新的数据架构进行了可行性分析.新的数据架构能够较好地满足数字化校园建设中的新需求.     

基于NS2的802.11效果异常现象仿真研究

在802.11 WLAN(Wireless Local Network)中,当一些无线节点的传输速率明显低于其他节点与AP(Access Point)间的传输速率时,将会使区域内所有节点的传输性能降低,这种现象称为效果异常(Performance Anomaly),Hyogon K等人在文献[6-7]中提出用改变封包容量和竞争窗口大小的方式来解决这个问题.文章通过在NS2网络仿真环境下,设计实验拓扑,编写性能分析脚本,对效果异常现象进行仿真并验证了上述两种方案能够有效缓解该现象并保持系统传输性能稳定.     

Curvature estimation for meshes based on vertex normal triangles

The estimation of surface curvature is essential for a variety of applications in computer graphics because of its invariance with respect to rigid transformations. In this article, we describe a curvature estimation method for meshes by converting each planar triangular facet into a curved patch using the vertex positions and the normals of three vertices of each triangle. Our method interpolates three end points and the corresponding normal vectors of each triangle to construct a curved patch. Then, we compute the per triangle curvature of the neighboring triangles of a mesh point of interest. Similar to estimating per vertex normal from the adjacent per triangle normal, we compute the per vertex curvature by taking a weighted average of per triangle curvature. Through some examples, we demonstrate that our method is efficient and its accuracy is comparable to that of the existing methods.     

Prediction of rank deficiency in partition of unity-based methods with plane triangular or quadrilateral meshes

In the partition of unity (PU)-based methods, the global approximation is built by multiplying a partition of unity by local approximations. Within this framework, high-order approximations are achieved by directly adopting high-order polynomials as local approximations, and therefore nodes along sides or inside elements, which are usually adopted in the conventional finite element methods, are no more required. However, the PU-based approximation constructed in this way may suffer from rank deficiency due to the linear dependence of the global degrees of freedom. In this paper, the origin of the rank deficiency in the PU-based approximation space is first dissected at an element level, and then an approach to predict the rank deficiency for a mesh is proposed together with the principle of the increase of rank deficiency. Finally, examples are investigated to validate the present approach. The current work indicates such a fact that the rank deficiency is an unrelated issue to the nullity of the global matrix. It can be resolved in its own manner.     

P2P soft security: On evolutionary dynamics of P2P incentive mechanism

This paper thoroughly investigates the evolutionary dynamics of soft security mechanism, namely, reciprocity-based incentive mechanism, in P2P systems based on Evolutionary Game Theory (EGT). By soft security mechanism, it means social control mechanisms to overcome peers’ selfish (rational) behaviors, and encourage cooperation in P2P systems. Specifically, there exist three strategies in P2P systems: always cooperative (ALLC), always defect (ALLD) and reciprocator (R). Instead of existing work which take it for granted that, like ALLC users, R users did not bear any information-seeking cost, we assume small reciprocation cost, and study generalized mutation-selection dynamics. Our contributions are threefold: firstly, we prove and illustrate that, in a well-mixed P2P structure, ALLD is the only strict Nash equilibrium; secondly, we infer the specific condition under which evolution dynamics exhibits rock-scissors-paper oscillation in a structured P2P population. That is, the population cycles from ALLD to R to ALLC and back to ALLD; finally, we theoretically illustrate that the intensity of selection plays an important role in the evolutionary dynamics of P2P incentive mechanism. That is, when the intensity of selection is relatively weak and reciprocation cost limits to zero, the time average can be mostly concentrated on reciprocator. In brief, considering the existence of reciprocation cost and the small mutation in P2P incentive mechanisms, unlike existing work, it is impossible to simply achieve the “absolute cooperative” in P2P incentive mechanisms. On the other hand, stochastic evolution in P2P incentive mechanism with finite population and network structure still favor reciprocation.     

Modified versions of the Bayesian Information Criterion for sparse Generalized Linear Models

The classical model selection criteria, such as the Bayesian Information Criterion (BIC) or Akaike information criterion (AIC), have a strong tendency to overestimate the number of regressors when the search is performed over a large number of potential explanatory variables. To handle the problem of the overestimation, several modifications of the BIC have been proposed. These versions rely on supplementing the original BIC with some prior distributions on the class of possible models. Three such modifications are presented and compared in the context of sparse Generalized Linear Models (GLMs). The related choices of priors are discussed and the conditions for the asymptotic equivalence of these criteria are provided. The performance of the modified versions of the BIC is illustrated with an extensive simulation study and a real data analysis. Also, simplified versions of the modified BIC, based on least squares regression, are investigated.