Surface modification of polyetherurethaneureas and their antithrombogenicity

Polyetherurethaneurea (PU) films were treated by oxygen plasma discharge followed by acrylic acid (AA) grafting. The carboxyl groups of the AA-grafted PU (PU-AA) surface were coupled with bovine serum albumin and heparin via water soluble carbodiimide. Surface characterization of the modified PUs was carried out by attenuated total reflection Fourier transform infrared (ATR-FTIR) spectroscopy and electron spectroscopy for chemical analysis (ESCA). The amount of immobilized albumin and heparin on the PU surface was 1.8 and 1.5 g/cm², respectively, as determined by the dye interaction method. Interactions between the surface-modified PUs and blood components such as plasma proteins and platelets were investigated to evaluate the blood compatibility of the samples. Plasma recalcification time (PRT) and activated partial thromboplastin time (APTT) of the albumin-immobilized PU (PU-Al) were almost the same as those of PU, while platelets were less adhered on the PU-Al than on PU. On the other hand, PRT and APTT of the PU-He were significantly longer than those of the PU, PU-AA, and PU-Al. Moreover, adhesion of platelets was effectively suppressed on the PU-He, leading to good in vitro blood compatibility.     

智能型双电源开关控制器的设计

提出了一种以PIC16F884单片机为控制单元,以两台塑壳断路器双电源开关为控制对象的智能控制器的设计方案.介绍了控制器的工作原理和工作模式,并给出了硬件方案和软件设计思想以及抗干扰的方法.     

偏最小二乘方法在中药指纹图谱相似度研究中的应用

本文介绍了偏最小二乘作为1种新的方法应用于指纹图谱的相似度比较计算中.偏最小二乘方法通过从中药色谱或光谱数据中提取大量信息来预测出1个响应值.本文中利用偏最小二乘方法为基础来计算中药色谱指纹图谱的相似度.相比较于传统的相似度计算方法,上述方法得到的结果更加明确可靠,并且计算量少于其他算法.     

基于蚁群算法的网格资源发现模型研究

本文通过对传统的网格资源发现存在的问题进行分析,针对其不足,引入蚁群算法,提出基于蚁群算法的网格资源发现模型（AA_GRRM）,设计并分析AA_GRRM的体系结构,并对其关键模块分析设计,以提高网格资源发现效率。     

Modeling contaminant intrusion in water distribution networks: A new similarity-based DST method

Contaminant intrusion in a water distribution network is a complex but a commonly observed phenomenon, which depends on three elements – a pathway, a driving force and a contamination source. However, the data on these elements are generally incomplete, non-specific and uncertain. In an earlier work, Sadiq, Kleiner, and Rajani (2006) have successfully applied traditional Dempster–Shafer theory (DST) to estimate the “risk” of contaminant intrusion in a water distribution network based on limited uncertain information. However, the method used for generating basic probability assignment (BPA) was not very flexible, and did not handle and process uncertain information effectively. In this paper, a more pragmatic method is proposed that utilizes “soft” computing flexibility to generate BPAs from uncertain information. This paper compares these two methods through numerical examples, and demonstrates the efficiency and effectiveness of modified method.     

基于主成分分析的B2C客户分类方法研究

随着电子商务的发展,以"客户为中心"已成为电子商务企业的经营策略,而任何高效的客户关系管理都是以扎实的客户分类为基础。然而电子商务中所搜集到的客户信息往往具有海量、高维度和不完备等特点,如何对其正确、高效地分类是一个难题。根据电子商务客户信息的特点,构建B2C客户分类模型,提出了先对客户信息进行主成分分析以消除属性之间的依赖性,而后用朴素贝叶斯算法进行分类的新方法。实验表明了该方法的有效性。     

Multi‐Unit Bayesian Auction with Demand or Budget Constraints

We consider the problem of revenue maximization on multi‐unit auctions where items are distinguished by their relative values; any pair of items has the same ratio of values to all buyers. As is common in the study of revenue maximizing problems, we assume that buyers' valuations are drawn from public known distributions and they have additive valuations for multiple items. Our problem is well motivated by sponsored search auctions, which made money for Google and Yahoo! in practice. In this auction, each advertiser bids an amount b_i to compete for ad slots on a web page. The value of each ad slot corresponds to its click‐through‐rate, and each buyer has her own per‐click valuations, which is her private information. Obviously, a strategic bidder may bid an amount that is different with her true valuation to improve her utility. Our goal is to design truthful mechanisms avoiding this misreporting. We develop the optimal (with maximum revenue) truthful auction for a relaxed demand model (where each buyer i wants at most d_i items) and a sharp demand model (where buyer i wants exactly d_i items). We also find an auction that always guarantees at least half of the revenue of the optimal auction when the buyers are budget constrained. Moreover, all of the auctions we design can be computed efficiently, that is, in polynomial time.     

Image compression-encryption scheme combining 2D compressive sensing with discrete fractional random transform

Multimedia Tools and Applications - Most of the existing image encryption algorithms based on compressive sensing are too complex to operate. An image compression-encryption scheme with simple...