Selective potentiometric determination of uric acid with uricase immobilized on ZnO nanowires

In this study, a potentiometric uric acid biosensor was fabricated by immobilization of uricase onto zinc oxide (ZnO) nanowires. Zinc oxide nanowires with 80-150 nm in diameter and 900 nm to 1.5 μm in lengths were grown on the surface of a gold coated flexible plastic substrate. Uricase was electrostatically immobilized on the surface of well aligned ZnO nanowires resulting in a sensitive, selective, stable and reproducible uric acid biosensor. The potentiometric response of the ZnO sensor vs Ag/AgCl reference electrode was found to be linear over a relatively wide logarithmic concentration range (1-650 μM) suitable for human blood serum. By applying a Nafion^® membrane on the sensor the linear range could be extended to 1-1000 μM at the expense of an increased response time from 6.25 s to less than 9 s. On the other hand the membrane increased the sensor durability considerably. The sensor response was unaffected by normal concentrations of common interferents such as ascorbic acid, glucose, and urea.     

Selective determination of urea using urease immobilized on ZnO nanowires

Well-aligned zinc oxide (ZnO) nanowire arrays were fabricated on gold-coated plastic substrates using a low-temperature aqueous chemical growth (ACG) method. The ZnO nanowire arrays with 50–130 nm diameters and ∼1 μm in lengths were used in an enzyme-based urea sensor through immobilization of the enzyme urease that was found to be sensitive to urea concentrations from 0.1 mM to 100 mM. Two linear sensitivity regions were observed when the electrochemical responses (EMF) of the sensors were plotted vs. the logarithmic concentration range of urea from 0.1 mM to 100 mM. The proposed sensor showed a sensitivity of 52.8 mV/decade for 0.1–40 mM urea and a fast response time less than 4 s was achieved with good selectivity, reproducibility and negligible response to common interferents such as ascorbic acid and uric acid, glucose, K⁺ and Na⁺ ions.     

Modelling of interstitials in the bcc phase

There are several widespread thermodynamic datasets which produce a spurious bcc interstitial solution at high temperature and high X content (X is an interstitally dissolved element). The reason for this is the standard model for bcc interstitial solutions (M(V a,X)₃), which requires careful selection of optimising parameters to minimise spurious appearances of the bcc phase. In this work the model M(V a,X)₁ is suggested as an alternative. This model is much easier to handle and its parameters can be directly compared with those of the fcc phase. The two models are compared for the Fe–C and Nb–N systems. In the Fe–C system almost identical results are achieved. In Nb–N there are some differences for high N content, but there is no experimental data to clearly support any model.     

Active learning for extended finite state machines

We present a black-box active learning algorithm for inferring extended finite state machines (EFSM)s by dynamic black-box analysis. EFSMs can be used to model both data flow and control behavior of software and hardware components. Different dialects of EFSMs are widely used in tools for model-based software development, verification, and testing. Our algorithm infers a class of EFSMs called register automata. Register automata have a finite control structure, extended with variables (registers), assignments, and guards. Our algorithm is parameterized on a particular theory, i.e., a set of operations and tests on the data domain that can be used in guards.Key to our learning technique is a novel learning model based on so-called tree queries. The learning algorithm uses tree queries to infer symbolic data constraints on parameters, e.g., sequence numbers, time stamps, identifiers, or even simple arithmetic. We describe sufficient conditions for the properties that the symbolic constraints provided by a tree query in general must have to be usable in our learning model. We also show that, under these conditions, our framework induces a generalization of the classical Nerode equivalence and canonical automata construction to the symbolic setting. We have evaluated our algorithm in a black-box scenario, where tree queries are realized through (black-box) testing. Our case studies include connection establishment in TCP and a priority queue from the Java Class Library.     

A novel TFT‐OLED integration for OLED‐independent pixel programming in amorphous‐Si AMOLED pixels

Abstract— The direct voltage programming of active‐matrix organic light‐emitting‐diode (AMOLED) pixels with n‐channel amorphous‐Si (a‐Si) TFTs requires a contact between the driving TFT and the OLED cathode. Current processing constraints only permit connecting the driving TFT to the OLED anode. Here, a new “inverted” integration technique which makes the direct programming possible by connecting the driver n‐channel a‐Si TFT to the OLED cathode is demonstrated. As a result, the pixel drive current increases by an order of magnitude for the same data voltages and the pixel data voltage for turn‐on drops by several volts. In addition, the pixel drive current becomes independent of the OLED characteristics so that OLED aging does not affect the pixel current. Furthermore, the new integration technique is modified to allow substrate rotation during OLED evaporation to improve the pixel yield and uniformity. The new integration technique is important for realizing active‐matrix OLED displays with a‐Si technology and conventional bottom‐anode OLEDs.     

Outflow Boundary Conditions for the Fourier Transformed One-Dimensional Vlasov–Poisson System

In order to facilitate numerical simulations of plasma phenomena where kinetic processes are important, we have studied the technique of Fourier transforming the Vlasov equation analytically in the velocity space, and solving the resulting equation numerically. Special attention has been paid to the boundary conditions of the Fourier transformed system. By using outgoing wave boundary conditions in the Fourier transformed space, small-scale information in velocity space is carried outside the computational domain and is lost. Thereby the so-called recurrence phenomenon is reduced. This method is an alternative to using numerical dissipation or smoothing operators in velocity space. Different high-order methods are used for computing derivatives as well as for the time-stepping, leading to an over-all fourth-order method.     

Competitive exploration of rectilinear polygons

Exploring a polygon with robots when the robots do not have knowledge of the surroundings can be viewed as an online problem. Typical for online problems is that decisions must be made based on past events without complete information about the future. In our case the robots do not have complete information about the environment. Competitive analysis can be used to measure the performance of methods solving online problems. The competitive ratio of such a method is the ratio between the method's performance and the performance of the best method having full knowledge of the future. We prove constant competitive strategies and lower bounds for exploring a simple rectilinear polygon in the _L1$L_1$ metric.     

Key principles for user-centred systems design

The concept of user-centred systems design (UCSD) has no agreed upon definition. Consequently, there is a great variety in the ways it is applied, which may lead to poor quality and poor usability in the resulting systems, as well as misconceptions about the effectiveness of UCSD. The purpose of this paper is to propose a definition of UCSD. We have identified 12 key principles for the adoption of a user-centred development process, principles that are based on existing theory, as well as research in and experiences from a large number of software development projects. The initial set of principles were applied and evaluated in a case study and modified accordingly. These principles can be used to communicate the nature of UCSD, evaluate a development process or develop systems development processes that support a user-centred approach. We also suggest activity lists and some tools for applying UCSD.