Chemiluminescence microfluidic system sensor on a chip for determination of glucose in human serum with immobilized reagents

A chemiluminescence (CL) biosensor on a chip coupled to microfluidic system is described in this paper. The CL biosensor measured 25×45×5 mm in dimension, was readily produced in analytical laboratory. Glucose oxidase (GOD) was immobilized onto controlled-pore glass (CPG) via glutaraldehyde activation and packed into a reservoir. The analytical reagents, including luminol and ferricyanide, were electrostatically co-immobilized on an anion-exchange resin. The most characteristic of the biosensor was to introduce the air as the carrier flow in stead of the common solution carrier for the first. The glucose was sensed by the CL reaction between hydrogen peroxide produced from the enzymatic reaction and CL reagents, which were released from the anion-exchange resin. The proposed method has been successfully applied to the determination of glucose in human serum. The linear range of the glucose concentration was 1.1-110 mM and the detection limit was 0.1 mM (3σ).     

High order accurate,one-sided finite-difference approximations to concentration gradients at the boundaries,for the simulation of electrochemical reaction-diffusion problems in one-dimensional space geometry

Accurate calculation of concentration gradients at the boundaries is crucial in electrochemical kinetic simulations, owing to the frequent occurrence of gradient-dependent boundary conditions, and the importance of the gradient-dependent electric current. By using the information about higher spatial derivatives of the concentrations, contained in the time-dependent, kinetic reaction-diffusion partial differential equation(s) in one-dimensional space geometry, under appropriate assumptions it is possible to increase the accuracy orders of the conventional, one-sided n-point finite-difference formulae for the concentration gradients at the boundaries, without increasing n. In this way a new class of high order accurate gradient approximations is derived, and tested in simulations of potential-step chronoamperometric and current-step chronopotentiometric transients for the Reinert-Berg system. The new formulae possess advantages over the conventional gradient approximations. For example, they allow one to obtain a third order accuracy by using two space points only, or fourth order accuracy by using three points, and yet they yield smaller errors than the conventional four-point, or five-point formulae, respectively. Needing fewer points, for approximating the gradients with a given accuracy, simplifies also the solution of the linear algebraic equations arising from the application of implicit time integration schemes.     

Impact Oscillator with Hertz's Model of Contact

Dynamic properties of simple mechanical 1 DOF system containing soft stop is described and analyzed. The proposed general dynamical impact model respects the nonlinearity of the restoring contact force between solid bodies as function of deformation and velocity. It describes the real behavior of impacting system more exact than the piecewise linear model or the Kelvin–Voigt model and even model based on application of constant coefficient of restitution. Free and forced vibrations of system with Hertz's contact are investigated and domains of various types of impact motion, response curves and phase-plane trajectories are presented.     

劳动和社会保障办公系统的开发与应用

采用Lotus Domino/Notes文档数据库 Oracle关系数据库的独特结构模式,集成了Microsoft Office Outlook系统软件,主要功能通过浏览器/服务器(B/S)方式实现,系统设计采用了组件化、模块化的思想,为工作流程的定制和公文流转过程的控制提供了强大功能.     

Standard Envelopes of Commutative Triple Systems

Under certain constraints on the characteristic of a field , the commutative standard enveloping q-algebra >B of a commutative triple system A over is defined. It is proved that(1) if the algebra B is simple, then the system A is simple;(2) if the system A is simple, then B either is simple or decomposes into the direct sum of two isomorphic simple subalgebras (as of ideals).     

Shift-tolerance Property of Optical Security System using Phase-based Virtual Image

The shift-tolerance property of the encrypted image or the Fourier decrypting key in the Fourier space is proposed based on a phase-encoded virtual image. The encrypted data is obtained by the Fourier transform of the product of a phase-encoded virtual image to camouflage the original one and a random phase image. Therefore, even if unauthorized users analyze the encrypted image, they cannot reconstruct the required image. This virtual image protects the original one from being counterfeited and from unauthorized access. We demonstrate the robustness to data loss and shift of the encrypted data or the Fourier decrypting key in the proposed decryption technique using an interferometer.     

Unconventional Hamilton-type variational principle in phase space and symplectic algorithm

By a novel approach proposed by Luo, the unconventional Hamilton-type variational principle in phase space for elastodynamics of multidegree-of-freedom system is established in this paper. It not only can fully characterize the initial-value problem of this dynamic, but also has a natural symplectic structure. Based on this variational principle, a symplectic algorithm which is called a symplectic time-subdomain method is proposed. A non-difference scheme is constructed by applying Lagrange interpolation polynomial to the time subdomain. Furthermore, it is also proved that the presented symplectic algorithm is an unconditionally stable one. From the results of the two numerical examples of different types, it can be seen that the accuracy and the computational efficiency of the new method excel obviously those of widely used Wilson-θ and Newmark-β methods. Therefore, this new algorithm is a highly efficient one with better computational performance.     

On positive radial entire solutions of second-order quasilinear elliptic systems

We study positive radial entire solutions of second-order quasilinear elliptic systems of the form

(∗)     

Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices

A result of Balas and Yu (1989) states that the number of maximal independent sets of a graph G is at most ^p+1, where is the number of pairs of vertices in G at distance 2, and p is the cardinality of a maximum induced matching in G. In this paper, we give an analogue of this result for hypergraphs and, more generally, for subsets of vectors in the product of n lattices =₁××_n, where the notion of an induced matching in G is replaced by a certain binary tree each internal node of which is mapped into . We show that our bounds may be nearly sharp for arbitrarily large hypergraphs and lattices. As an application, we prove that the number of maximal infeasible vectors x=₁××_n for a system of polymatroid inequalities does not exceed max{Q,^logt/c(2Q,)}, where is the number of minimal feasible vectors for the system, , , and c(,) is the unique positive root of the equation 2^c(^c/log–1)=1. This bound is nearly sharp for the Boolean case ={0,1}ⁿ, and it allows for the efficient generation of all minimal feasible sets to a given system of polymatroid inequalities with quasi-polynomially bounded right-hand sides . This research was supported by the National Science Foundation (Grant IIS-0118635), and by the Office of Naval Research (Grant N00014-92-J-1375). The second and third authors are also grateful for the partial support by DIMACS, the National Science Foundation's Center for Discrete Mathematics and Theoretical Computer Science.Mathematics Subject Classification (2000):20E28, 20G40, 20C20     

Periodic Solution of a Nonautonomous Diffusive Food Chain System of Three Species with Time Delays

Abstract By using the continuation theorem of coincidence degree theory,the existence of a positive periodicsolution for a nonautonomous diffusive food chain system of three species. dx_1(t)/dt=x_1(t)[r_1(t)-a_(11)(t)x_1(t)-a_(12)(t)x_2(t)]+D_1(t)[y(t)-x_1(t)], dx_2(t)/dt=x_2(t)[-r_2(t)+a_(21)(t)x_1(t-r_1)-a_(22)(t)x_2(t)-a_(23)(t)x_3(t)], dx_3(t)/dt=x_3(t)[-r_3(t)+a_(32)(t)x_2(t-r_2)-a_(33)(t)x_3(t)], dy(t)/dt=y(t)[r_4(t)-a_(44)(t)y(t)]+D_2(t)[x_1(t)-y(t)]+D_2(t)[x_1(t)-y(t)],is established,where,r_i(t),a_(ii)(t)(i=1,2,3,4),D_i(t)(i=1,2),a_(12)(t),a_(21)(t),a_(23)(t)and a_(32)(t) are all positiveperiodic continuous functions with period w>0,T_i(i=1,2)are positive constants.