Electrical, photoelectrical and morphological properties of ZnO nanowire networks grown on SiO2 and on Si

ZnO nanofibre networks (NFNs) were grown by vapour transport method on Si-based substrates. One type of substrate was SiO2 thermally grown on Si and another consisted of a Si wafer onto which Si nanowires (NWs) had been grown having Au nanoparticles catalysts. The ZnO-NFN morphology was observed by scanning electron microscopy on samples grown at 600 °C and 720 °C substrate temperature, while an focused ion beam was used to study the ZnO NFN/Si NWs/Si and ZnO NFN/SiO2 interfaces. Photoluminescence, electrical conductance and photoconductance of ZnO-NFN was studied for the sample grown on SiO2. The photoluminescence spectra show strong peaks due to exciton recombination and lattice defects. The ZnO-NFN presents quasi-persistent photoconductivity effects and ohmic I-V characteristics which become nonlinear and hysteretic as the applied voltage is increased. The electrical conductance as a function of temperature can be described by a modified three dimensional variable hopping model with nanometer-ranged typical hopping distances.

An abstract machine for restricted and-parallel execution of logic programs

Although the sequential execution speed of logic programs has been greatly improved by the concepts introduced in the Warren Abstract Machine (WAM), parallel execution represents the only way to increase this speed beyond the natural limits of sequential systems. However, most proposed parallel logic programming execution models lack the performance optimizations and storage efficiency of sequential systems. This paper presents a parallel abstract machine which is an extension of the WAM and is thus capable of supporting ANDParallelism without giving up the optimizations present in sequential implementations. A suitable instruction set, which can be used as a target by a variety of logic programming languages, is also included. Special instructions are provided to support a generalized version of "Restricted AND-Parallelism" (RAP), a technique which reduces the overhead traditionally associated with the run-time management of variable binding conflicts to a series of simple run-time checks, which select one out of a series of compiled execution graphs.