互连寄生电容器中屏蔽导体的快速判断

应用层次式Ｚ缓冲区可视性算法的思想,实现了一种互连寄生电容器中屏蔽导体的快速判断算法,能准确地确定对电容值影响较小的导体,并加以消除,当用边界元法提取甚多环境导体对关键路径产生的寄生电容时,可在满足计算精度的条件下,显著地提高计算速度。     

Priority-Based Routing Resource Assignment Considering Crosstalk

Crosstalk has become one of the most critical concerns in very deep sub-micron era. This paper deals with the problem of crosstalk mitigation at both methodological and algorithmic levels. Noting that intermediate operations between global routing and detailed routing are very effective in crosstalk estimation and reduction, the authors propose to incorporate several intermediate steps that are separated in traditional design flow into an integrated routing resource assignment stage, so that the operations could easily cooperate to fully exert their power on crosstalk reduction. An efficient priority-based heuristic algorithm is developed, which works slice by slice. Crosstalk avoidance, and many other aspects that are critical in routing practice including congestion, vias, layer preference, etc., are taken into account. A track reservation strategy is adopted in the algorithm framework to compensate the undesired effects caused by sequential routing. Experimental results on a series of ISPD98 and industrial benchmarks show that the proposed approach is able to reduce capacitive crosstalk by about 70% on average without compromising completion ratio compared with a previously reported graph based algorithm, demonstrating the advantages of the approach.     

Fast evaluation of Bounded Slice-line Grid

Bounded Slice-line Grid (BSG) is an elegant representation of block placement, because it is very intuitionistic and has the advantage of handling various placement constraints. However, BSG has attracted little attention because its evaluation is very time-consuming. This paper proposes a simple algorithm independent of the BSG size to evaluate the BSG representation in O(nloglogn) time, where n is the number of blocks. In the algorithm, the BSG-rooms are assigned with integral coordinates firstly, and then a linear sorting algorithm is applied on the BSG-rooms where blocks are assigned to compute two block sequences, from which the block placement can be obtained in O(n log logn) time. As a consequence, the evaluation of the BSG is completed in O(nloglogn) time, where n is the number of blocks. The proposed algorithm is much faster than the previous graph-based O(n^2) algorithm. The experimental results demonstrate the efficiency of the algorithm.     

和睦山矿区-200 m水平回采巷道支护与加固方案

通过对和睦山矿区的-50,-100,-150 m中段已施工的掘进工程进行测试,提出了和睦山矿区-200 m水平回采巷道支护与加固技术方案,施工实践中取得了较好的效果。     

食品过敏原生物传感检测技术研究进展

食品过敏原已成为全球性的食品安全隐患.应对食品过敏反应最直接、有效的方法就是避免食用和接触各种含有致敏成分的食品.因此,快速和灵敏地检测食品中过敏原对预防和控制食品过敏反应是十分重要的.食品过敏原检测主要可以分为基于核酸和蛋白质的两大类检测技术.与基于聚合酶链式反应技术、液相色谱-串联质谱法的传统检测手段相比,生物传感...     

马钢凹山选矿厂改善环水水质的试验研究

马钢南山矿凹山选厂因低品位高村矿石的大量入选,选分比及尾矿量的显著增加,导致浓缩大井环水水质严重恶化,为提高环水水质,公司采用7418V絮凝剂进行了工业试验。结果表明：加药量为0.15%时,环水水质可以得到明显改善,而且经济合理。     

在扫描电子显微镜中原位操纵、加工和测量纳米结构

在电子显微镜中对纳米材料和纳米结构进行原位测量是了解纳米材料的结构与性能关系的最重要手段,并且,在电子显微镜中操纵和加工纳米材料与纳米结构还可研究新结构和新器件.由于扫描电镜有大的样品室、可较容易地引入多个多种测量和操纵探针、并可配备多种探测器从多个角度对同一个样品进行表征,使得扫描电镜中的原位研究在纳米材料和纳米器件...     

Crosstalk-Aware Routing Resource Assignment

Crosstalk noise is one of the emerging issues in deep sub-micrometer technology which causes many undesired effects on the circuit performance. In this paper, a Crosstalk-Aware Routing Resource Assignment (CARRA) algorithm is proposed, which integrates the routing layers and tracks to address the crosstalk noise issue during the track/layer assignment stage. The CARRA problem is formulated as a weighted bipartite matching problem and solved using the linear assignment algorithm. The crosstalk risks between nets are represented by an undirected graph and the maximum number of the concurrent crosstalk risking nets is computed as the max clique of the graph. Then the nets in each max clique are assigned to disadjacent tracks. Thus the crosstalk noise can be avoided based on the clique concept. The algorithm is tested on IBM benchmarks and the experimental results show that it can improve the final routing layout a lot with little loss of the completion rate.