Logit models for identifying the factors that influence the uptake of new 'no-tillage' technologies by farmers in the rice-wheat and the cotton-wheat farming systems of Pakistan's Punjab

In the 'rice-wheat' and the 'cotton-wheat' farming systems of Pakistan's Punjab, late planting of wheat is a perennial problem due to often delayed harvesting of the previously planted and late maturing rice and cotton crops. This leaves very limited time for land preparation for 'on-time' planting of wheat. 'No-tillage' technologies that reduce the turn-round time for wheat cultivation after rice and cotton have been developed, but their uptake has not been as expected.-This paper attempts to determine the farm and farmer characteristics and other socio-economic factors that influence the adoption of 'no-tillage' technologies'. Logit models were developed for the analysis undertaken. In the 'cotton-wheat' system personal characteristics like education, tenancy status, attitude towards risk implied in the use of new technologies and contact with extension agents are the main factors that affect adoption. As regards the 'rice-wheat' system, resource endowments such as farm size, access to a 'no-tillage' drill, clayey soils and the area sown to the rice-wheat sequence along with tenancy and contact with extension agents were dominant in explaining adoption. (C) 2002 Elsevier Science Ltd. All rights reserved.

Alternative syntheses of linear polyurethanes using masked isocyanate monomers

A range of linear polyurethanes featuring aliphatic, aromatic and ether residues have been prepared by co-polymerisation of novel 'masked' isocyanate A(2)-type monomers and diols. The reactive isocyanate monomers were generated in situ via the triphenylphosphine mediated decomposition of the heterocyclic disulfide, 1,2,4-dithiazolidine-3,5-dione. Two different synthetic approaches were examined and assessed for the construction of the novel A(2)-type monomers, which involved either coupling two 1,2,4-dithiazolidine-3,5-diones together through a spacer group or construction of 1,2,4-dithiazolidine-3,5-diones directly from diamines. The resulting polyurethanes were purified via solvent extraction and analysed using GPC, NMR and IR spectroscopic analyses. Molecular weight data were obtained and compared from both GPC and H-1 NMR (via end-group analysis) spectroscopic analysis. The thermal properties of the polyurethanes were determined using DSC and their solubility in common aprotic organic solvents was also assessed and related to their structural composition. (c) 2006 Elsevier B.V. All rights reserved.

Alkene-arene meta photocycloadditions with a four-carbon-atom tether: efficient approach toward the polycyclic ring systems of aphidicolin and stemodinone

At the end of its tether! The fusion of a six-membered ring onto the four-carbon-atom tether of substrate 1 provides an efficient approach toward the polycyclic ring systems of the natural products aphidicolin and stemodinone. The reaction represents a unique example of a preference for product formation from an endo exciplex in an intramolecular system (exo:endo 2:3=1.0:1.2).

Facile strategies for the synthesis and crystallization of linear trinuclear nickel(II)-Schiff base, complexes with carboxylate bridges: Tuning of coordination geometry and magnetic properties

Three new linear trinuclear nickel(II) complexes, [Ni-3(salpen)(2)(OAc)(2)(H2O)(2)]center dot 4H(2)O (1) (OAc = acetate, CH3COO-), [Ni-3(salpen)(2)(OBz)(2)] (2) (OBz=benzoate, PhCOO-) and [Ni-3(salpen)(2)(OCn)(2)(CH3CN)(2)] (4) (OCn = cinnamate, PhCH=CHCOO-), H(2)salpen = tetradentate ligand, N,N'-bis(salicylidene)-1,3-pentanediamine have been synthesized and characterized structurally and magnetically. The choice of solvent for growing single crystal was made by inspecting the morphology of the initially obtained solids with the help of SEM study. The magnetic properties of a closely related complex, [Ni-3(salpen)(2)(OPh)(2)(EtOH)] (3) (OPh = phenyl acetate, PhCH2COO-) whose structure and solution properties have been reported recently, has also been studied here. The structural analyses reveal that both phenoxo and carboxylate bridging are present in all the complexes and the three Ni(II) atoms remain in linear disposition. Although the Schiff base ligand and the syn-syn bridging bidentate mode of the carboxylate group remain the same in complexes 1-4, the change of alkyl/aryl group of the carboxylates brings about systematic variations between six- and five-coordination in the geometry of the terminal Ni(II) centres of the trinuclear units. The steric demand as well as hydrophobic nature of the alkyl/aryl group of the carboxylate is found to play a crucial role in the tuning of the geometry. Variable-temperature (2-300 K) magnetic susceptibility measurements show that complexes 1-4 are antiferromagnetically coupled (J = -3.2(1), -4.6(1). -3.2(1) and -2.8(1) cm(-1) in 1-4, respectively). Calculations of the zero-field splitting parameter indicate that the values of D for complexes 1-4 are in the high range (D = +9.1(2), +14.2(2), +9.8(2) and +8.6(1) cm(-1) for 1-4, respectively). The highest D value of +14.2(2) and +9.8(2) cm(-1) for complexes 2 and 3, respectively, are consistent with the pentacoordinated geometry of the two terminal nickel(II) ions in 2 and one terminal nickel(II) ion in 3. (C) 2009 Elsevier Ltd. All rights reserved.

Monte Carlo methods for matrix computations on the grid

Many scientific and engineering applications involve inverting large matrices or solving systems of linear algebraic equations. Solving these problems with proven algorithms for direct methods can take very long to compute, as they depend on the size of the matrix. The computational complexity of the stochastic Monte Carlo methods depends only on the number of chains and the length of those chains. The computing power needed by inherently parallel Monte Carlo methods can be satisfied very efficiently by distributed computing technologies such as Grid computing. In this paper we show how a load balanced Monte Carlo method for computing the inverse of a dense matrix can be constructed, show how the method can be implemented on the Grid, and demonstrate how efficiently the method scales on multiple processors. (C) 2007 Elsevier B.V. All rights reserved.

A sparse parallel hybrid Monte Carlo algorithm for matrix computations

In this paper we introduce a new algorithm, based on the successful work of Fathi and Alexandrov, on hybrid Monte Carlo algorithms for matrix inversion and solving systems of linear algebraic equations. This algorithm consists of two parts, approximate inversion by Monte Carlo and iterative refinement using a deterministic method. Here we present a parallel hybrid Monte Carlo algorithm, which uses Monte Carlo to generate an approximate inverse and that improves the accuracy of the inverse with an iterative refinement. The new algorithm is applied efficiently to sparse non-singular matrices. When we are solving a system of linear algebraic equations, Bx = b, the inverse matrix is used to compute the solution vector x = B(-1)b. We present results that show the efficiency of the parallel hybrid Monte Carlo algorithm in the case of sparse matrices.

Complexity of Monte Carlo algorithms for a class of integral equations

In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the integral equation by a system of algebraic equations. Then the Markov chain iterative Monte Carlo is used to solve the system. The assumption here is that the corresponding Neumann series for the iterative matrix does not necessarily converge or converges slowly. We use a special technique to accelerate the convergence. An estimate of the computational complexity of Monte Carlo algorithm using the considered approach is obtained. The estimate of the complexity is compared with the corresponding quantity for the complexity of the grid-free Monte Carlo algorithm. The conditions under which the class of grid Monte Carlo algorithms is more efficient are given.

Constraint release in entangled binary blends of linear polymers: a molecular dynamics study

We present extensive molecular dynamics simulations of the dynamics of diluted long probe chains entangled with a matrix of shorter chains. The chain lengths of both components are above the entanglement strand length, and the ratio of their lengths is varied over a wide range to cover the crossover from the chain reptation regime to tube Rouse motion regime of the long probe chains. Reducing the matrix chain length results in a faster decay of the dynamic structure factor of the probe chains, in good agreement with recent neutron spin echo experiments. The diffusion of the long chains, measured by the mean square displacements of the monomers and the centers of mass of the chains, demonstrates a systematic speed-up relative to the pure reptation behavior expected for monodisperse melts of sufficiently long polymers. On the other hand, the diffusion of the matrix chains is only weakly perturbed by the diluted long probe chains. The simulation results are qualitatively consistent with the theoretical predictions based on constraint release Rouse model, but a detailed comparison reveals the existence of a broad distribution of the disentanglement rates, which is partly confirmed by an analysis of the packing and diffusion of the matrix chains in the tube region of the probe chains. A coarse-grained simulation model based on the tube Rouse motion model with incorporation of the probability distribution of the tube segment jump rates is developed and shows results qualitatively consistent with the fine scale molecular dynamics simulations. However, we observe a breakdown in the tube Rouse model when the short chain length is decreased to around N-S = 80, which is roughly 3.5 times the entanglement spacing N-e(P) = 23. The location of this transition may be sensitive to the chain bending potential used in our simulations.

Structure adaptation of linear MMSE adaptive filters

The tap-length, or the number of the taps, is an important structural parameter of the linear MMSE adaptive filter. Although the optimum tap-length that balances performance and complexity varies with scenarios, most current adaptive filters fix the tap-length at some compromise value, making them inefficient to implement especially in time-varying scenarios. A novel gradient search based variable tap-length algorithm is proposed, using the concept of the pseudo-fractional tap-length, and it is shown that the new algorithm can converge to the optimum tap-length in the mean. Results of computer simulations are also provided to verify the analysis.