聚丙烯结构壁管专用料的开发

阐述了塑料结构壁管的基本情况和国内外现状．重点就扬子石油化工股份有限公司研究院研制的聚丙烯结构壁管专用料的情况进行了介绍。     

15%田草灵高效液相色谱分析

采用Ｎｏｖａ－Ｐａｋ Ｃ１８不锈钢色谱柱进行反相液相色谱分析，以甲醇：水＝６５：３５（Ｖ／Ｖ）为注动相，以邻苯二甲醇二乙酯为内标物，用内标法测定田草灵除草剂中苄嘧黄隆和异丙甲草胺的含量，结果表明，各有效成分与内标物色谱峰分离完全，杂质无干扰，测定结果，苄嘧黄隆和异丙甲草胺的变异系数分别为０．７４％和１．０７％，回收率分别为９９．４％￣１００．８％和９９．１％￣１０１．３％。     

On the complexity of role updating feasibility problem in RBAC

In Role Based Access Control (RBAC) systems, it is necessary and important to update the role–permission assignments in order to reflect the evolutions of the system transactions. However, role updating is generally complex and challenging, especially for large-scale RBAC systems. This is because the resulting state is usually expected to meet various requirements and constraints. In this paper, we focus on a fundamental problem of role updating in RBAC, which determines whether there exists a valid role–permission assignment, i.e., whether it can satisfy all the requirements of the role updating and without violating any role–capacity or permission–capacity constraint. We formally define such a problem as the Role Updating Feasibility Problem (RUFP), and study the computational complexity of RUFP in different subcases. Our results show that although several subcases are solvable in linear time, this problem is NP-complete in the general case.     

Multi-label core vector machine with a zero label

Multi-label core vector machine (Rank-CVM) is an efficient and effective algorithm for multi-label classification. But there still exist two aspects to be improved: reducing training and testing computational costs further, and detecting relevant labels effectively. In this paper, we extend Rank-CVM via adding a zero label to construct its variant with a zero label, i.e., Rank-CVMz, which is formulated as the same quadratic programming form with a unit simplex constraint and non-negative ones as Rank-CVM, and then is solved by Frank–Wolfe method efficiently. Attractively, our Rank-CVMz has fewer variables to be solved than Rank-CVM, which speeds up training procedure dramatically. Further, the relevant labels are effectively detected by the zero label. Experimental results on 12 benchmark data sets demonstrate that our method achieves a competitive performance, compared with six existing multi-label algorithms according to six indicative instance-based measures. Moreover, on the average, our Rank-CVMz runs 83 times faster and has slightly fewer support vectors than its origin Rank-CVM.     

Efficient object detection based on selective attention

In this paper, we make use of biologically inspired selective attention to improve the efficiency and performance of object detection under clutter. At first, we propose a novel bottom-up attention model. We argue that heuristic feature selection based on bottom-up attention can stably select out invariant and discriminative features. With these selected features, performance of object detection can be improved apparently and stably. Then we propose a novel concept of saccade map based on bottom-up attention to simulate the saccade (eye movements) in vision. Sliding within saccade map to detect object can significantly reduce computational complexity and apparently improve performance because of the effective filtering for distracting information. With these ideas, we present a general framework for object detection through integrating bottom-up attention. Through evaluating on UIUC cars and Weizmann–Shotton horses we show state-of-the-art performance of our object detection model.     

Robust passive autofocus system for mobile phone camera applications

A robust autofocus system is a ubiquitous function in today’s mobile phone camera applications. However, due to the power consumption and size requirements, it is difficult for the autofocus function to be implemented into the design of mobile phone cameras. This paper presents a passive autofocus system with low computational complexity. This system uses a novel contrast measurement to determine degree of image sharpness, which can better reflect the information about image discontinuities. In order to gauge the performance of this measurement, a modified peak search strategy is used in the experiments. The experimental results from several typical image sequences validate the effectiveness of the proposed method.     

3D Shape Segmentation and Labeling via Extreme Learning Machine

We propose a fast method for 3D shape segmentation and labeling via Extreme Learning Machine (ELM). Given a set of example shapes with labeled segmentation, we train an ELM classifier and use it to produce initial segmentation for test shapes. Based on the initial segmentation, we compute the final smooth segmentation through a graph‐cut optimization constrained by the super‐face boundaries obtained by over‐segmentation and the active contours computed from ELM segmentation. Experimental results show that our method achieves comparable results against the state‐of‐the‐arts, but reduces the training time by approximately two orders of magnitude, both for face‐level and super‐face‐level, making it scale well for large datasets. Based on such notable improvement, we demonstrate the application of our method for fast online sequential learning for 3D shape segmentation at face level, as well as realtime sequential learning at super‐face level.     

Automatic 3D Indoor Scene Updating with RGBD Cameras

Since indoor scenes are frequently changed in daily life, such as re‐layout of furniture, the 3D reconstructions for them should be flexible and easy to update. We present an automatic 3D scene update algorithm to indoor scenes by capturing scene variation with RGBD cameras. We assume an initial scene has been reconstructed in advance in manual or other semi‐automatic way before the change, and automatically update the reconstruction according to the newly captured RGBD images of the real scene update. It starts with an automatic segmentation process without manual interaction, which benefits from accurate labeling training from the initial 3D scene. After the segmentation, objects captured by RGBD camera are extracted to form a local updated scene. We formulate an optimization problem to compare to the initial scene to locate moved objects. The moved objects are then integrated with static objects in the initial scene to generate a new 3D scene. We demonstrate the efficiency and robustness of our approach by updating the 3D scene of several real‐world scenes.