Computing the Map of Geometric Minimal Cuts

In this paper we consider the following problem of computing a map of geometric minimal cuts (called MGMC problem): Given a graph G=(V,E) and a planar rectilinear embedding of a subgraph H=(V _H ,E _H ) of G, compute the map of geometric minimal cuts induced by axis-aligned rectangles in the embedding plane. The MGMC problem is motivated by the critical area extraction problem in VLSI designs and finds applications in several other fields. In this paper, we propose a novel approach based on a mix of geometric and graph algorithm techniques for the MGMC problem. Our approach first shows that unlike the classic min-cut problem on graphs, the number of all rectilinear geometric minimal cuts is bounded by a low polynomial, O(n ³). Our algorithm for identifying geometric minimal cuts runs in O(n ³logn(loglogn)³) expected time which can be reduced to O(nlogn(loglogn)³) when the maximum size of the cut is bounded by a constant, where n=|V _H |. Once geometric minimal cuts are identified we show that the problem can be reduced to computing the L _∞ Hausdorff Voronoi diagram of axis aligned rectangles. We present the first output-sensitive algorithm to compute this diagram which runs in O((N+K)log² NloglogN) time and O(Nlog² N) space, where N is the number of rectangles and K is the complexity of the Hausdorff Voronoi diagram. Our approach settles several open problems regarding the MGMC problem.     

改性木粉/PVC复合材料的研究进展

概述了PVC木塑复合材料的发展和背景与性能。简述了木质材料的性质和木粉改性的方法,如物理方法和化学方法。介绍了木塑复合材料的生产流程、成型方法(模压成型、挤出成型、注射成型及其成型设备,讨论了对工艺参数的一些要求。指出目前国内PVC木塑复合材料发展存在的一些问题,并指明了PVC木塑复合材料的应用前景。     

阻垢缓蚀剂对不锈钢管缓蚀效果的评定方法

用点蚀电位法和失重法评价了七种阻垢缓蚀剂在不同冷却水样中对不锈钢的缓蚀效果。用腐蚀失重法评价阻垢缓蚀剂对不锈钢的缓蚀效果，既不合理也很难测准。点蚀电位法是评价阻垢缓蚀剂对不锈钢缓蚀效果的有效方法，但要选择合适的空白水样。     

核壳型聚苯乙烯/聚甲基丙烯酸甲酯复合乳液的制备

以过硫酸铵(APS)为引发剂,用种子乳液聚合方法,合成出以聚苯乙烯(PSt)为核, 聚甲基丙烯酸甲酯(PMMA)为壳的复合乳液。透射电子显微镜观察了核壳复合乳胶粒的形态,光散射粒径分布仪(PCS)测量胶乳粒径大小及其分布。最终成功地制得了核壳型PS/PMMA复合乳液,所得复合乳胶粒粒径大小在60～90nm左右,且单分散性较好。     

A heuristic biomarker selection approach based on professional tennis player ranking strategy

Extracting significant features from high-dimension and small sample size biological data is a challenging problem. Recently, Micha? Draminski proposed the Monte Carlo feature selection (MC) algorithm, which was able to search over large feature spaces and achieved better classification accuracies. However in MC the information of feature rank variations is not utilized and the ranks of features are not dynamically updated. Here, we propose a novel feature selection algorithm which integrates the ideas of the professional tennis players ranking, such as seed players and dynamic ranking, into Monte Carlo simulation. Seed players make the feature selection game more competitive and selective. The strategy of dynamic ranking ensures that it is always the current best players to take part in each competition. The proposed algorithm is tested on 8 biological datasets. Results demonstrate that the proposed method is computationally efficient, stable and has favorable performance in classification.     

高纯天然石膏水热法制备硫酸钙晶须研究

以高纯天然石膏为原料，加压水热法制备高品质硫酸钙晶须。采用常规分析方法、XRD和扫描电镜等手段分析和表征石膏原料和硫酸钙晶须产品。结果表明，制备硫酸钙晶须的最优条件为：料浆质量分数为6.0%，转晶剂氯化镁加入量为石膏质量的0.05%，硫酸加入量为水体积的1.0%，反应时间为4.0 h，快速过滤干燥即得硫酸钙晶须产品。分析结果表明：硫酸钙晶须长度最大为280.4 μm，最小为19.59 μm，平均长度为80 μm；硫酸钙晶须直径最大为5.86 μm，最小为0.20 μm，平均直径为2.67 μm；通过统计分析可知，长径比范围为10～80。     

一种基于ARM的集中器的硬件实现

介绍了一种以ARM9为核心,以Windows CE5.0为操作系统的集中器。它符合国家电网的Q/GDW 374.2-2009技术标准,可以在国家电网中使用。给出了集中器的系统框图,介绍了集中器的主要实现电路,论述了其主要工作原理。     

基于CY7C68013A的USB2.0高速接口设计

为了充分利用USB2.0的带宽,解决数据传输时存在的速度瓶颈问题,提出了一种基于CY7C68013A的USB2.0高速接口设计方法。采用CY7C68013A的SLAVE FIFO工作模式,芯片内部CPU不参与数据传输,FPGA设计的外部控制电路直接读写芯片内部FIFO,有效避免了内部CPU参与数据传输时带来的时间开销,从而提高了传输速度。     

强酸性阳离子交换树脂催化合成苯乙醛缩乙二醇

以强酸性阳离子交换树脂（D001）为催化剂，用苯乙醛和乙二醇合成苯乙醛缩乙二醇，该反应最佳的反应条件是：n（苯乙醛）：n（乙二醇）为1：1．6，D001用量为1．5g，环己烷10mL（苯乙醛为0．1mol时），反应温度为95℃左右，回流1．5小时，苯乙醛缩乙二醇的产率达90．2％。     

Multi-scale patch-based sparse appearance model for robust object tracking

When objects undergo large pose change, illumination variation or partial occlusion, most existing visual tracking algorithms tend to drift away from targets and even fail to track them. To address the issue, in this paper we propose a multi-scale patch-based appearance model with sparse representation and provide an efficient scheme involving the collaboration between multi-scale patches encoded by sparse coefficients. The key idea of our method is to model the appearance of an object by different scale patches, which are represented by sparse coefficients with different scale dictionaries. The model exploits both partial and spatial information of targets based on multi-scale patches. Afterwards, a similarity score of one candidate target is input into a particle filter framework to estimate the target state sequentially over time in visual tracking. Additionally, to decrease the visual drift caused by frequently updating model, we present a novel two-step object tracking method which exploits both the ground truth information of the target labeled in the first frame and the target obtained online with the multi-scale patch information. Experiments on some publicly available benchmarks of video sequences showed that the similarity involving complementary information can locate targets more accurately and the proposed tracker is more robust and effective than others.