A study of structural, compositional and optical properties of spray-deposited non-stoichiometric (Zn,Fe)S thin films

Non-stoichiometric ternary chalcogenides (Zn,Fe)S were prepared in the film form by pyrolytic spray deposition technique, using air/nitrogen as the carrier gas. The precursor solution comprised of ZnCl₂, FeCl₂ and thiourea. The depositions were carried out under optimum conditions of experimental parameters viz. carrier gas (air/nitrogen) flow rate, concentration of precursor constituents, nozzle substrate distance and temperature of quartz substrate. The deposited thin films were later sintered in argon at 1073 K for 120 min.The structural, compositional and optical properties of the sintered thin films were studied. X-ray diffraction studies of the thin films indicated the presence of (Zn,Fe)S solid solution with prominent cubic sphalerite phase while surface morphology as determined by scanning electron microscopy (SEM) revealed a granular structure.The chemical composition of the resulting thin films as analyzed by energy dispersive X-ray analysis (EDAX) reflected the composition of the precursor solutions from which the depositions were carried out with Fe at% values ranging from 0.4 up to 33.SEM micrographs of thin films reveal that the grain sizes of the thin films prepared using air as carrier gas and N₂ as carrier gas are in the vicinity of 300 and 150 nm, respectively.The diffuse transmittance measurements for thin films, as a function of wavelength reveal the dependence of direct optical band gap on Fe content and type of phase.     

Generalizations of the Nikodym boundedness and Vitali–Hahn–Saks theorems

Generalizations of the Nikodym boundedness and Vitali–Hahn–Saks theorems for scalar-valued measures on rings of sets that are in general not σ-rings are presented. As a consequence, the rings of subsets of N with density zero and uniform density zero are shown to have the Nikodym property. In addition, vector measure generalizations of the Vitali–Hahn–Saks theorem are given.     

Synthesis of molecular imprinted organic-inorganic hybrid polymer binding caffeine

Random copolymers of poly{(methacrylamide)-co-(vinyl trimethoxysilane)} and poly{(methacrylic acid)-co-(vinyl trimethoxysilane)} were synthesized via a free radical polymerization reaction. Acid catalyzed sol-gel process of tetraethylorthosilicate (TEOS) with aforementioned polymers in the presence of methyl xanthine class of alkaloid like caffeine resulted in the formation of highly transparent monoliths. Solvent extraction of the template leaves behind the recognition sites intact with high selectivity towards the print molecule. The ionic and non-specific adsorptions, which are considered to be the main disadvantages of the molecularly imprinted polymers (MIP), are prevented to a considerable extent by the end capping of surface silanol groups. The template binding efficiencies of MIP were determined by HPLC analysis.     

The benefit of practice for sound localization without sight

An experiment was designed to determine whether normally sighted human subjects would be able to adapt to the handicapping effects of sudden deprivation of visual cues on horizontal plane sound localization. Two groups of sighted normal-hearing young adults participated. One group was allowed the benefit of sight. The other group was blindfolded. Measurements of accuracy and the time to respond were made daily over the course of five consecutive days, in a semi-reverberant sound proof booth that modeled listening in a small office. Sound localization was assessed using an array of eight speakers that surrounded the subject in space. Each day, one block of 120 trials was presented for each of three stimuli, two one-third octave noise bands, centred at 0.5 and 4 kHz, and broadband noise, to assess the utilization of interaural temporal difference cues, interaural level difference cues and binaural and spectral cues in combination. Blindfolded subjects were relatively less accurate than sighted subjects. Both groups showed gains with practice, the blindfolded group to a greater degree, largely due to improvements in the use of spectral cues. The blindfolded group took longer to respond than the sighted group, but showed greater decrements in response time with practice.     

Comparative behavior of polybutadiene and polynorbornene‐based latices prepared by dispersion ring‐opening metathesis polymerization with a poly(ethylene oxide) macromonomer

This study critically examines the similarities and differences between poly(ethylene oxide) (PEO) stabilized latices of polynorbornene and polybutadiene. Features such as the kinetics of copolymerization of norbornene and cyclooctadiene with a macromonomer of PEO, the particles' size and morphology, the type of copolymer formed, and the stability of these latices were investigated and the results obtained are considered. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 2705–2716, 2004     

The exponential power law: partial wetting kinetics and dynamic contact angles

An equation for the kinetics of partial drop spreading is proposed. This equation was empirically derived from experimental data for the spreading kinetics of partially wetting liquids in terms of the wet area versus time. The equation has the form of an exponential power law (EPL), and transforms into the well-known power law for complete wetting, when the equilibrium contact angle approaches zero. The EPL fits very well available experimental data. To lend additional support to the validity of this generalized equation, it will be demonstrated that when it is transformed to present the dynamic contact angle (DCA), it fits very well DCA experimental data for other wetting processes, such as capillary flow and tape coating.     

The diameter of randomly perturbed digraphs and some applications

The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻_n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s₁,…,s_k,t₁,…,t_k, the graph contains k vertex disjoint paths joining s_r to t_r for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

Corner spontaneous magnetization

Details are given of a new method allowing an exact calculation of the spontaneous magnetization in the corner as well as along the edge at an arbitrary distance of the corner for a rectangular planar Ising ferromagnet.     

A Note on an Input Control Model of a Predictive Regression Interval

A well-known problem of prediction in linear regression models is to find a confidence interval for the random value of the dependent variable when the values of the independent variables are given. Such a situation may arise in economic quality control models when the independent variables are costly inputs and the dependent variable is some measure of quality or production. In such a circumstance, an important control objective may be to find values for the inputs that will maximize the lower limit of the prediction confidence interval for a fixed budget, or alternatively, to minimize the cost of the inputs for a fixed lower limit of the confidence interval. In this paper, we shall show that global optima can be found using known algorithms. The special case of simple linear regression is discussed and an illustrative example is provided.