一种刻线浮雕生成算法

刻线浮雕是一类将特征线条雕刻在基面上的浅浮雕,在产品铭牌、包装品、建筑装饰等领域有广泛应用.以物体的三维几何模型为输入,提出一种刻线浮雕的生成算法.首先提取三维模型在给定视线方向上可见部分和不可见部分交界处的轮廓点;然后计算各点与视线方向相关的曲率值大小,并通过阈值设定对模型上的可用于浮雕效果的凹陷部分的特征点集进行提取;将膨胀和腐蚀这两种形态学操作运用在三角网格上,实现特征点集的优化,并对已有的腐蚀操作结构进行改进,避免孔洞的产生;最后给定特征点集的雕刻深度,就可获得刻线浮雕效果.实例证明,本文算法生成的浮雕具有很好的视觉效果.     

降低协同设计虚拟机启动开销的译码后指令缓存技术

协同设计虚拟机采用动态二进制翻译实现不同体系结构间的二进制兼容,对源指令的翻译和处理影响了协同设计虚拟机的启动性能.研究发现,在一个采用解释执行和翻译相结合的协同设计虚拟机中,处理非热点代码的解释执行是虚拟机启动开销的主要来源.发现了协同设计虚拟机中的解释例程局部性,并提出了一种硬件译码后指令缓存结构DICache(d...     

一种使用分量组合的彩色图像压缩方法

为了适应图像的存储和传输,需要对图像进行压缩以减少数据量。对于彩色图像而言,其色彩模式和数据组合直接影响了压缩效率,压缩时通常采用每个分量单独压缩后再统一编码,未考虑分量之间的组合关系。根据彩色图像的数据结构将图像的RGB分量排列组合成新的灰度图像,将其中一个分量作为基准实行粗细分层操作,汇同该分量与其他两个分量的差值图像分别按JPEG压缩标准进行压缩编码。实验表明,该算法得到的压缩图像在与JPEG同等质量的条件下,数据量要小于JPEG压缩的数据量,耗时短,同时可为快速的彩色图像搜索和预览提供技术参考。     

基于电流镜的电化学CMOS恒电位仪的设计

设计了一种基于电流镜的三电极电化学传感器CMOS恒电位仪电路,由控制运放、电流镜和单端输出的跨导放大器构成.与传统的恒电位仪相比,该电路结构简单,减少了读出电路的功耗和版图面积,具有较宽的动态范围.在CSMC 0.5μm 2PTM CMOS工艺下,用Spectre仿真器对电路进行了模拟,仿真结果表明:传感电流范围为20...     

A novel hybrid immune algorithm for global optimization in design and manufacturing

This paper presents a new hybrid optimization approach based on immune algorithm and hill climbing local search algorithm. The purpose of the present research is to develop a new optimization approach for solving design and manufacturing optimization problems. This research is the first application of immune algorithm to the optimization of machining parameters in the literature. In order to evaluate the proposed optimization approach, single objective test problem, multi-objective I-beam and machine-tool optimization problems taken from the literature are solved. Finally, the hybrid approach is applied to a case study for milling operations to show its effectiveness in machining operations. The results of the hybrid approach for the case study are compared with those of genetic algorithm, the feasible direction method and handbook recommendation.     

Fast problem-size-independent parallel prefix circuits

A family of parallel algorithms solving the prefix problem on the combinational circuit model is presented. These prefix circuits are waist-size optimal with waist 1 (WSO-1). They are not only building blocks for constructing fast depth-size optimal prefix circuits, but also themselves fast problem-size-independent prefix circuits. When the problem size is greater than the circuit width, the presented prefix circuits may very much faster than any other prefix circuits of the same width, especially when the problem size is greater than or equal to twice the circuit width. The new prefix circuits are compared analytically with other representative prefix circuits to show how fast they are. They have the minimum depth and are the fastest among all WSO-1 prefix circuits of the same width and fan-out. Thus, they are better building blocks than other WSO-1 circuits for constructing fast depth-size optimal prefix circuits with the same fan-out.     

Grid resource management policies for load-balancing and energy-saving by vacation queuing theory

The resource management is the central component of grid system. The analysis of the workload log file of LCG including the job arrival and the resource utilization daily cycle shows that the idle sites in the Grid are the source of load imbalance and energy waste. Here we focus on these two issues: balancing the workload by transferring jobs to idle sites at prime time to minimize the response time and maximize the resource utilization; power management by switch the idle sites to sleeping mode at non-prime time to minimize the energy consume. We form the M/G/1 queue model with server vacations, startup and closedown to analysis the performance metrics to instruct the design of load-balancing and energy-saving policies. We provide our Adaptive Receiver Initiated (ARI) load-balancing strategy and power-management policy for energy-saving. The simulation experiments prove the accuracy of our analysis and the comparisons results indicate our policies are largely suitable for large-scale heterogeneous grid environment.     

在Mathematica环境下实现交互式矩阵初等变换

在Mathematica7.0环境下,实现了交互式矩阵初等变换。使用时只需选择矩阵初等变换的类型,并输入相应的变换参数,即可完成相应的初等变换并以可视化的方式显示矩阵初等变换的步骤及结果。在线性代数的教学中采用此交互式矩阵初等变换,可以在课堂中随时改变实例并进行演示来提高多媒体教学内容的灵活性。     

紧密衔接工序组联动的综合调度算法

由于现有的工序间存在紧密衔接条件的复杂产品综合调度问题, 采用的移动交换算法不易于软件实现且没有考虑移动工序后产生的连锁反应引起较高算法复杂度的问题, 提出将具有紧密衔接约束条件的工序组进行统一联动的综合调度算法.该算法利用将具有紧密衔接约束条件的工序分组的扩展加工工艺树模型, 按路径上属于工序组的工序个数多少确定所在路径工序组调度的次序, 通过降低对工序组的限制要求降低算法复杂度; 对于被调度工序组中各工序的前序工序, 按工序组中工序的加工顺序确定调度次序, 对某个工序的前序工序采用复杂度较低的拟关键路径法确定工序的调度次序; 调度完所有紧密衔接工序组后, 剩余的标准工序按拟关键路径法确定调度顺序; 采取工序首次适应调度算法调度标准工序和工序组, 由于工序组中工序采取按序紧密衔接的联动调度方式确定工序组的开始时间, 避免了二次调整, 进一步降低了算法复杂度. 分析和实例表明, 所提出的综合算法比以往算法复杂度更低, 调度结果更优且更易于实现.     

基于实时操作系统的嵌入式软PLC运行系统的研究和实现

在分析了几种常见软PLC控制方案后,提出了一种基于μC/OS-Ⅱ实时操作系统的软PLC运行系统的体系结构,给出了软PLC梯形图解释程序的实现过程,并且对运行系统的任务划分及任务间调度原理进行了分析研究.最后,基于ARM7嵌入式处理器实现了软PLC的基本功能.