A two-stage hardware scheduler combining greedy and optimal scheduling

Greedy scheduling heuristics provide a low complexity and scalable albeit particularly sub-optimal strategy for hardware-based crossbar schedulers. In contrast, the maximum matching algorithm for Bipartite graphs can be used to provide optimal scheduling for crossbar-based interconnection networks with a significant complexity and scalability cost. In this paper, we show how maximum matching can be reformulated in terms of Boolean operations rather than the more traditional formulations. By leveraging the inherent parallelism available in custom hardware design, we reformulate maximum matching in terms of Boolean operations rather than matrix computations and introduce three maximum matching implementations in hardware. Specifically, we examine a Pure Logic Scheduler with three dimensions of parallelism, a Matrix Scheduler with two dimensions of parallelism and a Vector Scheduler with one dimension of parallelism. These designs reduce the algorithmic complexity for an N×N$N\times N$ network from O(N³)$O\left(N^3\right)$ to O(1)$O\left(1\right)$, O(K)$O\left(K\right)$, and O(KN)$O\left(KN\right)$, respectively, where K$K$ is the number of optimization steps. While an optimal scheduling algorithm requires K=2N−1$K=2N-1$ steps, by starting with our hardware-based greedy strategy to generate an initial schedule, our simulation results show that the maximum matching scheduler can achieve 99% of the optimal schedule when K=9$K=9$. We examine hardware and time complexity of these architectures for crossbar sizes of up to N=1024$N=1024$. Using FPGA synthesis results, we show that a greedy schedule for crossbars, ranging from 8×8 to 256×256, can be optimized in less than 20 ns per optimization step. For crossbars reaching 1024×1024 the scheduling can be completed in approximately 10 μs with current technology and could reach under 90 ns with future technologies.     

Invariant and attracting sets of impulsive delay difference equations with continuous variables

The aim of this paper is to study the invariant and attracting sets of impulsive delay difference equations with continuous variables. Some criteria for the invariant and attracting sets are obtained by using the decomposition approach and delay difference inequalities with impulsive initial conditions.     

On conditional diagnosability and reliability of the BC networks

An n-dimensional bijective connection network (in brief, BC network), denoted by X _n , is an n-regular graph with 2 ⁿ nodes and n2 ^n?1 edges. Hypercubes, crossed cubes, twisted cubes, and Möbius cubes all belong to the class of BC networks (Fan and He in Chin. J. Comput. 26(1):84–90, [2003]). We prove that the super connectivity of X _n is 2n?2 for n≥3 and the conditional diagnosability of X _n is 4n?7 for n≥5. As a corollary of this result, we obtain the super connectivity and conditional diagnosability of the hypercubes, twisted cubes, crossed cubes, and Möbius cubes.     

基于极坐标区间运算的2D形状匹配

形状匹配是遥感图像目标识别、字符识别、手形识别和步态识别等任务中的关键步骤之一.针对刚体识别任务中形状匹配易受方向、尺度和位置等仿射变化量影响的情况,提出了一种新的基于极坐标区间运算的2D形状匹配算法.该算法首先以形状区域的中心点为极点,区域的最长轴方向为极轴,对形状区域进行归一化的极坐标变换;然后定义了同一角度对应的区域内点区间之间的运算;最后定义了两个区域归一化极坐标变换结果在区间运算下的相似度函数,用以表征两个区域之间的匹配度.从可见光遥感图像中提取的实物图像实验结果证明,该方法能够有效归类相似形状,并能区分各类不同的形状.     

身份认证协议的新安全属性

总结了针对身份认证协议的一类新型攻击的特征。对于攻击的分析,引入了两个新的安全属性定义,其一定义在单个证明者的环境中,另一个则定义在多个证明者的环境中。并可证明这两个安全属性本质上是等价的。因此,只要满足了其中单证明者环境下的安全要求,身份认证协议也能安全地运行在多个证明者的环境下。     

平均曲率运动的三种实现方案的比较研究

讨论了曲率运动演化方程的三种数值方案:离散中值滤波方案、显式水平集方案和半隐式水平集方案的原理与算法,并对它们的效率、精度以及旋转不变性等性能进行了对比实验研究.结果表明,半隐式加性算子分裂(AOS)算法相对于另两种方案性能上明显占优.     

一种结合结构化信息的富文本分类方法

随着文本表现形式越来越丰富,文本分类研究的对象正从平文本逐渐转变为富文本,传统的平文本分类方法不能满足实际需要.分析了富文本中的结构化信息和文本内容信息,把它们作为两个重要的因素,综合考虑了其在分类中的作用,提出并实现了标签组件法、结构组件法和综合法三种富文本分类的方法.实验表明,所提出的方法有较好的分类表现,能解决OpenDocument的分类问题.     

量子小波变换算法及线路实现

随着小波理论研究的深入,以及小波分析在信号分析和图像处理等领域的广泛应用,小波分析在量子计算领域中也越来越受到重视.应用置换矩阵、W-H变换矩阵和量子傅立叶变换矩阵来对Haar小波及D(4)小波变换矩阵进行分解,给出其算法,然后得出其完整的量子逻辑线路图,最后分析其复杂度.     

面向服务的化工行业能效管理系统研究

面向服务的架构（Service-Oriented Architecture,SOA）为现代企业信息系统快速适应变动的业务需求,提供了良好的理论支持和技术规范。该文为满足上海氯碱化工行业的发展需求,提出了一种基于SOA的化工行业能效管理系统平台。最后,结合项目实践,给出了该系统方案的应用实例。     

Proteus软件仿真与Keil的单片机系统设计

随着半导体技术的飞速发展,以及移动通信、网络技术、多媒体技术在嵌入式系统设计中的应用,单片机从4位、8位、16位到32位,其发展历程一直受到广大电子爱好者的极大关注。单片机功能越来越强大,价格却不断下降的优势无疑成为嵌入式系统方案设计的首选,同时单片机应用领域的扩大也使得更多人加入到基于单片机系统的开发行列中,推动着单片机技术的创新进步。