Numerical calculation of digital curve length by using anchored discrete convolution

The paper presents a new method introducing an anchored discrete convolution for calculating the length of a digital curve. The method is based on discrete convolution by using convolution masks and point anchoring in the pixel. The use of ordinary convolution distorts the curve shape and gives large errors in length calculation. The advantage of anchoring is that it limits the point shifting into the pixel during the calculation of the curve length. The method is applied to an analytical arc and various calculations are performed. In addition different methods from the literature were compared and a real sample was tested.     

Exact methods and a heuristic for the optimization of an integrated replenishment-storage planning problem

In this paper we study the coordination of different activities in a supply chain issued from a real case. Multiple suppliers send raw materials (RMs) to a distribution center (DC) that delivers them to a unique plant where the storage of the RMs and the finished goods is not possible. Then, the finished goods are directly shipped to multiple customers having just‐in‐time (JIT) demands. Under these hypotheses, we show that the problem can be reduced to multiple suppliers and one DC. Afterwards, we analyze two cases; in the first, we consider an uncapacitated storage at DC, and in the second, we analyze the capacitated storage case. For the first case, we show that the problem is NP‐hard in the ordinary sense using the Knapsack decision problem. We then propose two exact methods: a mixed integer linear program (MILP) and a pseudopolynomial dynamic program. A classical dynamic program and an improved one using the idea of Shaw and Wagelmans are given. With numerical tests we show that the dynamic program gives the optimal solution in reasonable time for quite large instances compared with the MILP. For the second case, the capacity limitation in DC is assumed, which makes the problem solving more challenging. We propose an MILP and a dynamic programming‐based heuristic that provides solutions close to the optimal solution in very short times.     

一种安全增强的无线Ad Hoc网络门限签名方案

在椭圆曲线可验证门限签名的基础上,结合Feldman可验证秘密共享和一种新型的可验证密钥重分派算法,提出一种具有前摄安全性、参数可调节的椭圆曲线可验证门限签名方案。该方案通过周期地在不同的访问结构中重新分派密钥分片,增强了签名密钥的安全性,同时使签名方案中的门限和签名服务器个数都可动态调整,增强了灵活性和可伸缩性。     

基于嵌套网的JADE建模

良好的形式化建模方法是大规模开发和应用多Agent系统(MAS)的必要条件之一,使用多层的嵌套网对JADE进行层次化建模,给出面向对象的MAS与NP-nets之间的对照关系。指出通过引入层次结构,不仅能有效地控制状态空间的规模,而且能通过网托肯的嵌套方式克服Petri网结构演化的困难。     

基于CPLD的CCD信号发生器的研究

由于CCD(Charge Coupled Devices)芯片价格昂贵而且极易损坏,本文提出了一种利用CPLD和D/A转换器构成的信号发生器的原理方案和实现方法.通过对CPLD器件isp1032e和D/A转换器件DAC2900的配置,频率为11MHz的模拟CCD信号,同时通过改进PCB设计和滤波电路,提高了输出信号的精度,降低了噪声.本设计具有可编程、宽频、高精度和低硬件复杂度等特点.     

机械臂视觉伺服系统中的高精度实时特征提取

以机械臂视觉伺服系统为背景,立体视觉所需要的特征点为目标,提出一种基于颜色块的实时特征提取方法．特征点的定位分为粗定位和精定位两个过程,粗定位用来跟踪目标颜色块,精定位在粗定位的基础上,切出小图像并提取目标轮廓,利用犓犔变换对轮廓点进行分类,并通过最小二乘法对边缘点进行拟合．根据直线方程计算顶点的亚像素精度坐标,为下一步的目标位姿测量提供基础．实验结果验证了该方法的有效性．     

实时操作系统在多费率抄表计费系统中的应用

针对传统机械式抄表计费系统的缺陷,本文介绍一种基于实时操作系统μC/OS-II新一代抄表计费系统.通过把实时操作系统μC/OS-II移植到AT89C52单片机来实现多任务实时抄表计费.两者结合,既能充分发挥实时操作系统μC/OS-II的高实时性以及多任务调度的特点,又可以体现单片机的经济实惠的优势,具有实际市场推广意义.     

基于非局部算法的序列图像超分辨率重构

提出了一种基于非局部算法的多帧图像超分辨率重构算法,该方法无需进行图像校正。为克服传统图像复原算法基于图像局部点领域的影响,指出可以使用非局部去噪模型的优越边缘保持性和去噪性来重构高分辨率图像。实验证明,该算法在低信噪比情况下,可以取得较好结果,有效解决了低信噪比条件下图像复原的一个难点。     

Interpretation of MR images using self-organizing maps and knowledge-based expert systems

A new image segmentation system is presented to automatically segment and label brain magnetic resonance (MR) images to show normal and abnormal brain tissues using self-organizing maps (SOM) and knowledge-based expert systems. Elements of a feature vector are formed by image intensities, first-order features, texture features extracted from gray-level co-occurrence matrix and multiscale features. This feature vector is used as an input to the SOM. SOM is used to over segment images and a knowledge-based expert system is used to join and label the segments. Spatial distributions of segments extracted from the SOM are also considered as well as gray level properties. Segments are labeled as background, skull, white matter, gray matter, cerebrospinal fluid (CSF) and suspicious regions.