Preparation and characterization of nanocrystalline α-Fe2O3 by a sol-gel process

α-Fe₂O₃ ultra-fine powder with an average particle size of 6–26nm has been prepared by a sol-gel process. Thermal analysis, X-ray diffraction and transmission electron microscope were used to study its formation process and micro-structure. The temperature dependence of the electric conductance of the elements made of nanocrystalline α-Fe₂O₃ shows that the gas-sensing properties are strongly related to its surface. The elements exhibited good sensitivity and selectivity to ethyl alcohol, indicating it is a promising alcohol-sensing material.     

The Navier–Stokes-αβ equations as a platform for a spectral multigrid method to solve the Navier–Stokes equations

This paper describes a spectral multigrid method for spatially periodic homogeneous and isotropic turbulent flows. The method uses the Navier–Stokes-αβ equations to accelerate convergence toward solutions of the Navier–Stokes equations. The Navier–Stokes-αβ equations are solved on coarse grids at various levels and the Navier–Stokes equations are solved on the “nest grid”. The method uses Crank–Nicolson time-stepping for the viscous terms, explicit time-stepping for the remaining terms, and Richardson iteration to solve linear systems encountered at each time step and on each grid level. To explore the computational efficiency of the method, comparisons are made with results obtained from an analogous spectral multigrid method for the Navier–Stokes equations. These comparisons are based on computing work units and residuals for multigrid cycles. Most importantly, we examine how choosing different values of the length scales α and β entering the Navier–Stokes-αβ equations influence the efficiency and accuracy of these multigrid schemes.     

Controlled synthesis and gas-sensing properties of hollow sea urchin-like α-Fe2O3 nanostructures and α-Fe2O3 nanocubes

Hollow sea urchin-like α-Fe₂O₃ nanostructures were successfully synthesized by a hydrothermal approach using FeCl₃ and Na₂SO₄ as raw materials, and subsequent annealing in air at 600 °C for 2 h. The hollow sea urchin-like α-Fe₂O₃ nanostructures with the diameters of 2–4.5 μm consist of well-aligned α-Fe₂O₃ nanorods with an average length of about 1 μm growing radially from the centers of the nanostructures, have a hollow interior with a diameter of about 2 μm. α-Fe₂O₃ nanocubes with a diameter of 700–900 nm were directly obtained by a hydrothermal reaction of FeCl₃ at 140 °C for 12 h. The response S_r (S_r = R_a/R_g) of the hollow sea urchin-like α-Fe₂O₃ nanostructures reached 2.4, 7.5, 5.9, 14.0 and 7.5 to 56 ppm ammonia, 32 ppm formaldehyde, 18 ppm triethylamine, 34 ppm acetone, and 42 ppm ethanol, respectively, which was excess twice that of the α-Fe₂O₃ nanocubes and the nanoparticle aggregations. Our results demonstrated that the hollow sea urchin-like α-Fe₂O₃ nanostructures were very promising for gas sensors for the detection of flammable and/or toxic gases with good-sensing characteristics.     

Gas sensitivity of Zn doped α-Fe2O3(SO4, Sn, Zn) to carbon monoxide

It is shown that the doping of Zn and Sn can improve the gas sensitivity of α-Fe₂O₃-based sensing material to CO. X-ray photo-electron spectroscopy analysis suggests that this is mainly due to the fact that the simultaneous doping of Zn and Sn can increase the S and hence SO₄²⁻ contents in the α-Fe₂O₃(SO₄²⁻, Sn, Zn) sensing material. The results also suggest that under a given condition, the gas sensitivity of α-Fe₂O₃(SO₄²⁻, Sn, Zn) to CO can be optimised by properly adjusting the doped Zn content.     

Divide and Congruence Applied to η-Bisimulation

We present congruence formats for η- and rooted η-bisimulation equivalence. These formats are derived using a method for decomposing modal formulas in process algebra. To decide whether a process algebra term satisfies a modal formula, one can check whether its subterms satisfy formulas that are obtained by decomposing the original formula. The decomposition uses the structural operational semantics that underlies the process algebra.     

Fresh O'Caml: Nominal Abstract Syntax for the Masses

Nominal abstract syntax, as pioneered by the 'FreshML' series of metalanguages, provides first-order tools for the representation and manipulation of syntax involving bound names, binding operations and α-equivalence. Fresh O'Caml fuses nominal abstract syntax with the full Objective Caml language to yield a functional programming language with powerful facilities for representing and manipulating syntax. In this paper, we first provide an examples-driven overview of the language and its functionality. Then we proceed to comment on some of the difficult issues involved in implementing nominal abstract syntax and explain how they have been addressed in the latest version of the compiler.     

Comparative study on TeO2 and TeO3 thin film for γ-ray sensor application

Tellurium trioxide (TeO₃) and tellurium dioxide (TeO₂) thin film has been deposited by rf sputtering. The influence of γ-radiation doses (in the range 10–50 Gy) on the optical and electrical properties of as-deposited films were studied. Optical band gap values were found to decrease with increasing radiation dose whereas electrical conductivity was increased by about five orders in magnitude. Monotonic decrease in the values of dielectric constant for the deposited TeO₃ films with increase in radiation dose was observed. The γ-ray response behavior of TeO₃ and TeO₂ thin films are compared, and TeO₃ thin film is found to be more suitable in amorphous form for γ-ray detection.     

μ-Bases and singularities of rational planar curves

We provide a technique to detect the singularities of rational planar curves and to compute the correct order of each singularity including the infinitely near singularities without resorting to blow ups. Our approach employs the given parametrization of the curve and uses a μ-basis for the parametrization to construct two planar algebraic curves whose intersection points correspond to the parameters of the singularities including infinitely near singularities with proper multiplicity. This approach extends Abhyankar's method of t-resultants from planar polynomial curves to rational planar curves. We also derive the classical result that for a rational planar curve of degree n the sum of all the singularities with proper multiplicity is (n−1)(n−2)/2. Examples are provided to flesh out our results.     

Optical CO2 sensor with the combination of colorimetric change of α-naphtholphthalein and internal reference fluorescent porphyrin dye

A new optical CO₂ sensor based on the overlay of the CO₂ induced absorbance change of pH indicator dye α-naphtholphthalein with the fluorescence of tetraphenylporphyrin (TPP) was developed. The observed luminescence intensity from TPP at 655 nm increased with increasing the CO₂ concentration. The ratio I₁₀₀/I₀ values of the sensing films consisting of α-naphtholphthalein in ethyl cellulose layer and TPP in polystyrene layer, where I₀ and I₁₀₀ represent the detected luminescence intensities from a layer exposed to 100% nitrogen and 100% CO₂, respectively, that the sensitivity of the sensor, are more than 53.9. The response and recovery times of the sensing films consisting of α-naphtholphthalein in ethyl cellulose layer and TPP in polystyrene layer were less than 5 s for switching from nitrogen to CO₂, and for switching from CO₂ to nitrogen. The signal changes were fully reversible and no hysterisis was observed during the measurements. The highly sensitive optical CO₂ sensor based on fluorescence intensity changes of TPP due to the absorption change of α-naphtholphthalein with CO₂ was achieved.     

A Behavioural Pseudometric based on λ–Bisimilarity

In order to describe approximate equivalence among processes, the notions of λ–bisimilarity and behavioural pseudometric have been introduced by Ying and van Breugel respectively. Van Breugel provides a distance function induced by λ–bisimilarity, and conjectures that his behavioural pseudometric coincides with this function. This paper is inspired by this conjecture. We give a negative answer for van Breugel's conjecture first. Moreover, we show that the distance function induced by λ–bisimilarity is a pseudometric on states, and provide a fixed point characterization of this pseudometric.     

Handling Liveness Properties in (ω-)Regular Model Checking

Since the topic emerged several years ago, work on regular model checking has mostly been devoted to the verification of state reachability and safety properties. Though it was known that liveness properties could also be checked within this framework, little has been done about working out the corresponding details, and experimentally evaluating the approach. This paper addresses these issues in the context of regular model checking based on the encoding of states by finite or infinite words. It works out the exact constructions to be used in both cases, and solves the problem resulting from the fact that infinite computations of unbounded configurations might never contain the same configuration twice, thus making cycle detection problematic. Several experiments showing the applicability of the approach were successfully conducted.     

Probabilistic π-Calculus and Event Structures

This paper proposes two semantics of a probabilistic variant of the π-calculus: an interleaving semantics in terms of Segala automata and a true concurrent semantics, in terms of probabilistic event structures. The key technical point is a use of types to identify a good class of non-deterministic probabilistic behaviours which can preserve a compositionality of the parallel operator in the event structures and the calculus. We show an operational correspondence between the two semantics. This allows us to prove a “probabilistic confluence” result, which generalises the confluence of the linearly typed π-calculus.     

On the ω-language Expressive Power of Extended Petri Nets

In this paper, we study the expressive power of several monotonic extensions of Petri nets. We compare the expressive power of Petri nets, Petri nets extended with non-blocking arcs and Petri nets extended with transfer arcs, in terms of ω-languages. We show that the hierarchy of expressive powers of those models is strict. To prove these results, we propose original techniques that rely on well-quasi orderings and monotonicity properties.     

UppDMC: A Distributed Model Checker for Fragments of the μ-Calculus

We present UppDMC, a distributed model-checking tool. It is tailored for checking finite-state systems and μ-calculus specifications with at most one alternation of minimal and maximal fixed-point operators. This fragment is also known as . Recently, efficient game-based algorithms for this logic have been outlined.We describe the implementation of these algorithms within UppDMC and study their performance on practical examples. Running UppDMC on a simple workstation cluster, we were able to check liveness properties of the largest examples given in the VLTS Benchmark Suite, for which no answers were previously known.     

A Proof Search Specification of the π-Calculus

We present a meta-logic that contains a new quantifier (for encoding “generic judgments”) and inference rules for reasoning within fixed points of a given specification. We then specify the operational semantics and bisimulation relations for the finite π-calculus within this meta-logic. Since we restrict to the finite case, the ability of the meta-logic to reason within fixed points becomes a powerful and complete tool since simple proof search can compute this one fixed point. The quantifier helps with the delicate issues surrounding the scope of variables within π-calculus expressions and their executions (proofs). We shall illustrate several merits of the logical specifications we write: they are natural and declarative; they contain no side conditions concerning names of variables while maintaining a completely formal treatment of such variables; differences between late and open bisimulation relations are easy to see declaratively; and proof search involving the application of inference rules, unification, and backtracking can provide complete proof systems for both one-step transitions and for bisimulation.     

A Model in κ for DNA Addition

DNA computing is a hot research topic in recent years. Formalization and verification using theories(π-calculus, bioambients, κ-calculus and etc.) in Computer Science attract attention because it can help prove and predict to a certian degree various kinds of biological processes. Combining these two aspects, formal methods can be used to verify algorithms in DNA computing, including basic arithmetic operations if they are to be included in a DNA chip. In this paper, we first introduce a newly-designed algorithm for solving binary addition with DNA, which contributes to a unit in DNA computer processor, and then formalize the algorithm in κ-calculus(a formal method well suited for describing protein interactions) to show the correctness of it in a sense, and a sensible example is provided. Finally, some discussion on the described model is made, in addition to a few possible future improvement directions.     

Investigation of a fibre optic copper sensor based on immobilised α-benzoinoxime (cupron)

α-Benzoinoxime, a highly selective reagent used for the gravimetric and colorimetric determination of copper, was successfully immobilised on XAD-2 and coupled with optical fibres to investigate a sensor-based approach for determining copper. Reflectance measurements were used to quantify sensor response. Optimum response was obtained at a wavelength of 560 nm and at a solution pH of 7. Using a kinetic approach in which the rate of change of reflectance is measured over a 4-min period, the response was found to be linear in the range 5–127 ppm. After measurement, the sensor can be regenerated for reuse by immersing the probe in 0.1 M HCl. With continuous use, the sensing layer was found to be stable for at least 3 days. The advantages of using α-benzoinoxime in this way are compared with its use in the traditional gravimetric and colorimetric way.     

An alternative solution to the H∞-optimal control problem

In this paper we present an alternative solution to the problem min _{X ε H^n×n∞} |A + BXC|_∞ where A, B, rmand C are rational matrices in H^n×n_∞. The solution circumvents the need to extract the matrix inner factors of B and C, providing a multivariable extension of Sarason's H^∞-interpolation theory [1] to the case of matrix-valued B(s) and C(s). The result has application to the diagonally-scaled optimization problem int |D(A + BXC)D⁻¹|_∞, where the infimum is over D, X εH^n×n_∞, D diagonal.