MWCNTs/nano-CeO_2/PANI修饰的H_2O_2传感器

采用循环伏安和滴涂的方法在玻碳电极上制备出一种均匀且具有高电活性聚苯胺(PANI)/多壁碳纳米管(MWCNTs)/纳米氧化铈(nano-CeO2)复合膜。从膜的厚度、pH值、碳纳米管(CNTs)与nanoCeO2的质量比等方面系统地研究了复合膜探测H2O2浓度的各影响因素。结果表明:循环伏安聚合25圈的聚苯胺分散和固定CNTs,nano-CeO2,以及辣根H2O2酶的能力较好,且以CNTs与nano-CeO2的质量比为15∶1的复合膜在pH=6.4的缓冲溶液中具有较高的电活性。该复合膜修饰的电极对H2O2具有良好的响应电流,较快的响应时间(5 s),较宽的检测范围为5.0×10-6~3.95×10-4mol/L,较低的检出极限7.6×10-7mol/L(S/N=3 dB)。     

基于DNA-Hb修饰的聚合二氧化锆/金电极过氧化氢生物传感器的研究

以聚合二氧化锆(ZrO2)薄膜修饰的金电极为基底,通过在二氧化锆修饰电极表面滴涂DNA和血红蛋白(Hb)溶液制备了性能优良的DNA-Hb/ZrO2/Au过氧化氢传感器.该传感器对H2O2的还原显示出较好的电催化响应,固定在电极表面的Hb在0.1 mol/L(pH5.0)PBS中对过氧化氢响应灵敏度高,检测范围宽(1.7×10-7～3.0×10-3～mol/L),检测下限低(8.0×10-8～tool/L),并且表现出良好的热稳定性和高选择性.     

基于Au NPs-CeO2@PANI纳米复合材料固定化酶的葡萄糖生物传感器

制备了一种基于金纳米粒子(Au NPs)、氧化铈纳米颗粒(CeO2)和导电聚苯胺(PANI)的具有核壳结构的纳米复合材料(Au NPs-CeO2@PANI),利用该纳米复合材料和壳聚糖形成的复合膜成功实现了对葡萄糖氧化酶(GOD)的固定.采用透射电镜和X射线衍射对Au NPs-CeO2@PANI材料进行了表征.电化学方法研究了传感器性能,结果表明基于Au NPs-CeO2@PANI纳米复合材料修饰的葡萄糖生物传感器线性范围为6.2×10-6 mol/L～2.8×10-3 mol/L,响应时间为5 s,检测下限为1.0×10-6 mol/L;相同条件下Au NPs-CeO2@PANI纳米复合材料修饰的电极也显示出了比单一或二者复合的纳米材料修饰电极更优越的性能.     

电聚合二氧化锆固载辣根过氧化物酶的第三代生物传感器的研制

利用生物相容性良好的无机材料二氧化锆(ZrO2)对辣根过氧化物酶(HRP)进行直接固定,用交流阻抗法对修饰电极进行了表征,并用循环伏安法和计时电流法对过氧化氢(H2O2)生物传感器的性能进行了研究.结果表明,该法成功的制备了以电聚合ZrO2为载体的无介体第三代电流型生物传感器.其线性范围为1.00×10-6～1.87×10-3mol/L,线性回归方程为:ip(μA)=0.002 3 c(μmol/L)+2.9324,相关系数r为0.996 8,检测限为2.86×10-7 mol/L.     

基于碳纳米管／壳聚糖／纳米金活性界面的辣根过氧化物酶传感器研制

利用壳聚糖(Chitosan)的成膜性能以及碳纳米管在其中良好的分散性,在玻碳电极表面首先形成碳纳米管/壳聚糖膜,通过膜表面丰富的氨基与纳米金的强静电吸附,在玻碳电极表面获得稳定的纳米Au修饰层,吸附固定辣根过氧化物酶(HRP),制得无需电子媒介的H2O2生物传感器.循环伏安曲线显示,当加入H2O2溶液后,阴极峰电流增大,而阳极电流相应减少,表明通过碳纳米管/壳聚糖/纳米金活性界面固定在玻碳电极表面的HRP与电极之间有良好的直接电子传导能力,对H2O2的还原具有良好的电催化活性,H2O2的测定线性范围为5×10-5～2.7×10-3mol/L.     

壳聚糖修饰的过氧化氢生物传感器的研究

用壳聚糖固定辣根过氧化物酶(HRP),采用硫堇作为电子媒介,戊二醛作为交联剂,制备了HRP/壳聚糖/硫堇/GC电极.讨论了硫堇的固定方法,考察了该传感器在优化的实验条件下对H2O2的响应特性,实验结果表明,该传感器对H2O2表现出良好的响应特性,如响应快、稳定性好和抗干扰性能强等优点,检测范围为5.0 ×10-6～3.0×10-3mol/L.检出限为1.0×10-6mol/L.电极在用于实际试样回收率的测定中,结果良好.     

辣根过氧化物酶修饰电极的直接电化学行为研究

采用预混合自组装方法将辣根过氧化物酶修饰到玻碳电极表面,运用循环伏安法(CV)、电化学阻抗法(EIS)等方法研究了该电极的电化学行为.讨论了H2O2在GC/PDDA/PSS-HRP/PDDA修饰电极上的响应.在最佳实验条件下,修饰电极对H2O2在1.66×10-6～1.14×10-4 mol/L浓度范围内与电流呈线性关系,检测极限为9.76×10-7 mol/L.     

聚苯胺及其氧化锡复合材料的气敏特性研究

以溶胶-凝胶法制备了SnO2纳米粒子,以原位聚合沉积法在陶瓷基底叉指金电极上制备了PANI及PANI/SnO2复合薄膜,形成气敏元件。室温下测试了元件对氨气及水果释放气体的敏感特性。结果表明,PANI和PANI/SnO2复合膜对氨气具有选择性好,线性度好的特点,PANI比PANI/SnO2复合膜的灵敏度高,更适合在较宽浓度范围内测试氨气;另外,这两种传感器对存放的水果（香蕉、苹果）释放气体具有响应恢复快,重复性好等特性,PANI/SnO2复合膜对水果释放的气体比PANI具备更高的灵敏度,有望在水果仓储运输方面得以应用。     

碳纳米管-表面活性剂修饰的H2O2酶电极

酶在电极上的固定是酶传感器制备中的重要环节,它直接影响酶传感器的检测性能.该文利用静电吸附的自组装法以碳纳米管为载体将酶固定在电极上来制备酶传感器,该酶传感器制备过程简单、稳定性好、组装到电极表面的酶的量多并可保持其生物活性,可检测浓度在1.0×10-6～5.4×10-5mol/L范围内的H2O2,最低检测限为5.3×10-7mol/L.这种制备方法为检测农药残留生物传感器的制备提供了一种新的方法.     

基于番红花红聚合膜的生物传感器的应用研究

研究了尿酸(UA)在番红花红(SFR)聚合膜修饰的玻碳电极上的电化学行为,发现SFR聚合膜电极对UA的氧化能够起到明显的电催化作用.分别利用循环伏安法(CV)、差分脉冲法(DPV)、计时电流法研究了UA在pH4.4的磷酸缓冲溶液中的线性关系,发现其浓度分别在2.0×10-5～9.0×10-4 mol/L(CV).6.0×10-6～1.0×10-4 mol/L、2.0×10-4～8.0×10-4 mol/L(DPV),4.0×10-6～1.0×10-4 mol/L(计时电流法)范围内呈良好的线性关系.该电极用于实际样品的测定,结果满意.     

M/G/c/K blocking probability models and system performance

An exact solution for the M/G/c/K model is only possible for special cases, such as exponential service, a single server, or no waiting room at all. Instead of basing the approximation on an infinite capacity queue as is often the case, an approximation based on a closed-form expression derivable from the finite capacity exponential queue is presented. Properties of the closed-form expression along with its use in approximating the blocking probability of M/G/c/K systems are discussed. Extensive experiments are provided to test and verify the efficacy of our approximate results.     

设计模式变体的描述与验证*

为解决标准设计模式演化后难以检测的问题,引入设计模式变体思想,以Bridge模式为例,给出了八种常用的变体实现,并以人工形式挖掘了四种开源系统中Bridge模式变体的基准数,接着在Apache Ant1.6.2与JHotDraw5.1开源系统中通过六种主流设计模式检测工具进行了变体检测实验。试验结果表明,FCA-CBR方法简单有效,对2种开源系统中Bridge模式变体检测的精确率达到60%与48.1%,与先前方法相比有了较大的提高。     

(r∞, n12, s12) measurements on the 2-CPU CRAY X-MP

We report performance measurements made on the 2-CPU CRAY X-MP at ECMWF, Reading. Vector (SIMD) performance on one CPU is interpreted by the two parameters ($\text{r}{}_{\mathrm{\infty }}\text{, n}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$), and we find for dyadic operations using FORTRAN $\text{r}{}_{\mathrm{\infty }}\text{= 70}\text{Mflop/s}\text{, n}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{= 53}\text{flop}$. All vector triadic operations produce $\text{r}{}_{\mathrm{\infty }}\text{= 107}\text{Mflop/s}\text{, n}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{= 45}\text{flop}$; and a triadic operation with two vectors and one scalar gives r_∞ = 148 Mflop/s and $\text{n}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{= 60}\text{flop}$. MIMD performance using both CPUs on one job is interpreted with the two parameters ($\text{r}{}_{\mathrm{\infty }}\text{, s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$), where $\text{s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ is the amount of arithmetic that could have been done during the time taken to synchronize the two CPUs. We find, for dyadic operations using the TSKSTART and TSKWAIT synchronization primitives, that r_∞ = 130 Mflop/s and $\text{s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{= 5700}\text{flop}$. This means that a job must contain more than ～ 6000 floating-point operations if it is to run at more than 50% of the maximum performance when split between both CPUs by this method. Less expensive synchronization methods using LOCKS and EVENTS reduces $\text{s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ to 4000 flop and 2000 flop respectively. A simplified form of LOCK synchronization written in CAL code further reduces $\text{s}{}_{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ to 220 flop. This is probably the minimum possible value for synchronization overhead on the CRAY X-MP.     

Complex random sample scheduling and its application to an N/M/F/Fmax problem

“Complex Random Sample Scheduling(CRSS)” was proposed in this paper as an efficient heuristic method for solving any permutation scheduling problems. To show the effectiveness of the proposed CRSS, it was applied to an N-job, M-machine, permutation flowshop scheduling problem to minimize makespan, N/M/F/F_max. Numerical experiments made it clear that the proposed CRSS provides a schedule very close to the near-optimal schedule obtained by the existing promising heuristic methods such as taboo search and simulated annealing, within less computation time than these heuristic methods.     

On the M/Ck/1 queue

We obtain the exact analytic expression of the probability distribution of the number of units in a single server queue with Poisson arrivals and Coxian service time distribution (notated as M/C_k/1). A recursive procedure for calculating this probability distribution is given. The well-known queues M/E_k/1 and M/D/1 are re-derived as special cases of the M/C_k/1 queue. Finally, the cases of M/C₂/1 and M/C₃/1 are fully worked out.     

Geom/G/1/n system with LIFO discipline without interrupts and constrained total amount of customers

Consideration was given to the discrete-time queuing system with inversive servicing without interrupts, second-order geometrical arrivals, arbitrary (discrete) distribution of the customer length, and finite buffer. Each arriving customer has length and random volume. The total volume of the customers sojourning in the system is bounded by some value. Formulas of the stationary state probabilities and stationary distribution of the time of customer sojourn in the system were established.     

Properties and performance modelling of finite buffer M/G/1/K networks

Finite buffer, single-server queueing systems and networks are difficult to analyze since the length of time a customer spends in the system does not follow the Markovian property. A two-moment approximation schema is developed for the probability distribution of M/G/1/K systems and extended to the analysis of M/G/1/K   queueing networks. The general purpose of this paper is to develop a flexible and practical transform-free approach for computing the probability distribution and performance measures of the system as well as identify the underlying properties of these systems. It is shown that for most performance measures, a sigmoid or S-shaped curve with an inflection point at ρ=1$\rho =1$ appears as K→∞$K\to \infty$. This has direct implications for the analysis and optimization of such systems. The performance modelling of the M/G/1/K queueing networks of general topologies along with extensive numerical results accompany the paper along with the linear concave performance measures for these systems.     

Efficient implementation of Johnson''s rule for the n/2/F/Fmax scheduling problem

Several efficient algorithms of O(n log n) computational complexity, for the Johnson's rule to schedule a set of simultaneously available jobs on two machines in a flowship to minimize the maximum job flowtime have appeared in the literature. A modified version of one of these algorithms is presented which not only simplifies the programming effort for implementation but is also able to generate all possible optimal sequences obtainable from Johnson's rule.     

Intuitionistic fuzzy Hv-submodules

After the introduction of fuzzy sets by Zadeh, there have been a number of generalizations of this fundamental concept. The notion of intuitionistic fuzzy sets introduced by Atanassov is one among them. In this paper, we apply the concept of an intuitionistic fuzzy set to H_v-modules. The notion of an intuitionistic fuzzy H_v-submodule of an H_v-module is introduced, and some related properties are investigated. Characterizations of intuitionistic fuzzy H_v-submodules are given.