Negative Fukui functions: new insights based on electronegativity equalization

The occurrence of negative values for Fukui functions was studied through the electronegativity equalization method. Using algebraic relations between Fukui functions and different other conceptual DFT quantities on the one hand and the hardness matrix on the other hand, expressions were obtained for Fukui functions for several archetypical small molecules. Based on EEM calculations for large molecular sets, no negative Fukui functions were found

A comparative analysis of two methods for the calculation of electric-field-induced perturbations to molecular vibration

Two common methods of accounting for electric-field-induced perturbations to molecular vibration are analyzed and compared. The first method is based on a perturbation-theoretic treatment and the second on a finite-field treatment. The relationship between the two, which is not immediately apparent, is made by developing an algebraic formalism for the latter. Some of the higher-order terms in this development are documented here for the first time. As well as considering vibrational dipole polarizabilities and hyperpolarizabilities, we also make mention of the vibrational Stark effec

Reducció de vibracions residuals en moviments transitoris. Definició de lleis de moviment per mitjà de corbes B-spline

Molts sistemes mecànics existents tenen un comportament vibratori funcionalment perceptible, que es posa de manifest enfront d'excitacions transitòries. Normalment, les vibracions generades segueixen presents després del transitori (vibracions residuals), i poden provocar efectes negatius en la funció de disseny del mecanisme. El mètode que es proposa en aquesta tesi té com a objectiu principal la síntesi de lleis de moviment per reduir les vibracions residuals. Addicionalment, els senyals generats permeten complir dues condicions definides per l'usuari (anomenats requeriments funcionals). El mètode es fonamenta en la relació existent entre el contingut freqüencial d'un senyal transitori, i la vibració residual generada, segons sigui l'esmorteïment del sistema. Basat en aquesta relació, i aprofitant les propietats de la transformada de Fourier, es proposa la generació de lleis de moviment per convolució temporal de polsos. Aquestes resulten formades per trams concatenats de polinomis algebraics, cosa que facilita la seva implementació en entorns numèrics per mitjà de corbes B-spline.

Hydrogen spillover on carbon-supported metal catalysts studied by inelastic neutron scattering. Surface vibrational states and hydrogen riding modes

Hydrogen spillover on carbon-supported precious metal catalysts has been investigated with inelastic neutron scattering (INS) spectroscopy. The aim, which was fully realized, was to identify spillover hydrogen on the carbon support. The inelastic neutron scattering spectra of Pt/C, Ru/C, and PtRu/C fuel cell catalysts dosed with hydrogen were determined in two sets of experiments: with the catalyst in the neutron beam and, using an annular cell, with carbon in the beam and catalyst pellets at the edge of the cell excluded from the beam. The vibrational modes observed in the INS spectra were assigned with reference to the INS of a polycyclic aromatic hydrocarbon, coronene, taken as a molecular model of a graphite layer, and with the aid of computational modeling. Two forms of spillover hydrogen were identified: H at edge sites of a graphite layer (formed after ambient dissociative chemisorption of H-2), and a weakly bound layer of mobile H atoms (formed by surface diffusion of H atoms after dissociative chernisorption of H-2 at 500 K). The INS spectra exhibited characteristic riding modes of H on carbon and on Pt or Ru. In these riding modes H atoms move in phase with vibrations of the carbon and metal lattices. The lattice modes are amplified by neutron scattering from the H atoms attached to lattice atoms. Uptake of hydrogen, and spillover, was greater for the Ru containing catalysts than for the Pt/C catalyst. The INS experiments have thus directly demonstrated H spillover to the carbon support of these metal catalysts.

Conformational and hydration effects of site-selective sodium, calcium and strontium ion binding to the DNA Holliday junction structure d(TCGGTACCGA)(4)

The role of metal ions in determining the solution conformation of the Holliday junction is well established, but to date the picture of metal ion binding from structural studies of the four-way DNA junction is very incomplete. Here we present two refined structures of the Holliday junction formed by the sequence d(TCGGTACCGA) in the presence of Na+ and Ca2+, and separately with Sr2+ to resolutions of 1.85 Angstrom and 1.65 Angstrom, respectively. This sequence includes the ACC core found to promote spontaneous junction formation, but its structure has not previously been reported. Almost complete hydration spheres can be defined for each metal cation. The Na+ sites, the most convincing observation of such sites in junctions to date, are one on either face of the junction crossover region, and stabilise the ordered hydration inside the junction arms. The four Ca2+ sites in the same structure are at the CG/CG steps in the minor groove. The Sr2+ ions occupy the TC/AG, GG/CC, and TA/TA sites in the minor groove, giving ten positions forming two spines of ions, spiralling through the minor grooves within each arm of the stacked-X structure. The two structures were solved in the two different C2 lattices previously observed, with the Sr2+ derivative crystallising in the more highly symmetrical form with two-fold symmetry at its centre. Both structures show an opening of the minor groove face of the junction of 8.4degrees in the Ca2+ and Na+ containing structure, and 13.4degrees in the Sr2+ containing structure. The crossover angles at the junction are 39.3degrees and 43.3degrees, respectively. In addition to this, a relative shift in the base pair stack alignment of the arms of 2.3 Angstrom is observed for the Sr2+ containing structure only. Overall these results provide an insight into the so-far elusive stabilising ion structure for the DNA Holliday junction. (C) 2003 Elsevier Science Ltd. All rights reserved.

Toughness & oblique metalcutting

The implications of whether new surfaces in cutting are formed just by plastic flow past the tool or by some fracturelike separation process involving significant surface work, are discussed. Oblique metalcutting is investigated using the ideas contained in a new algebraic model for the orthogonal machining of metals (Atkins, A. G., 2003, "Modeling Metalcutting Using Modern Ductile Fracture Mechanics: Quantitative Explanations for Some Longstanding Problems," Int. J. Mech. Sci., 45, pp. 373–396) in which significant surface work (ductile fracture toughnesses) is incorporated. The model is able to predict explicit material-dependent primary shear plane angles and provides explanations for a variety of well-known effects in cutting, such as the reduction of at small uncut chip thicknesses; the quasilinear plots of cutting force versus depth of cut; the existence of a positive force intercept in such plots; why, in the size-effect regime of machining, anomalously high values of yield stress are determined; and why finite element method simulations of cutting have to employ a "separation criterion" at the tool tip. Predictions from the new analysis for oblique cutting (including an investigation of Stabler's rule for the relation between the chip flow velocity angle C and the angle of blade inclination i) compare consistently and favorably with experimental results.

Perspex machine VII: The universal perspex machine

The perspex machine arose from the unification of projective geometry with the Turing machine. It uses a total arithmetic, called transreal arithmetic, that contains real arithmetic and allows division by zero. Transreal arithmetic is redefined here. The new arithmetic has both a positive and a negative infinity which lie at the extremes of the number line, and a number nullity that lies off the number line. We prove that nullity, 0/0, is a number. Hence a number may have one of four signs: negative, zero, positive, or nullity. It is, therefore, impossible to encode the sign of a number in one bit, as floating-, point arithmetic attempts to do, resulting in the difficulty of having both positive and negative zeros and NaNs. Transrational arithmetic is consistent with Cantor arithmetic. In an extension to real arithmetic, the product of zero, an infinity, or nullity with its reciprocal is nullity, not unity. This avoids the usual contradictions that follow from allowing division by zero. Transreal arithmetic has a fixed algebraic structure and does not admit options as IEEE, floating-point arithmetic does. Most significantly, nullity has a simple semantics that is related to zero. Zero means "no value" and nullity means "no information." We argue that nullity is as useful to a manufactured computer as zero is to a human computer. The perspex machine is intended to offer one solution to the mind-body problem by showing how the computable aspects of mind and. perhaps, the whole of mind relates to the geometrical aspects of body and, perhaps, the whole of body. We review some of Turing's writings and show that he held the view that his machine has spatial properties. In particular, that it has the property of being a 7D lattice of compact spaces. Thus, we read Turing as believing that his machine relates computation to geometrical bodies. We simplify the perspex machine by substituting an augmented Euclidean geometry for projective geometry. This leads to a general-linear perspex-machine which is very much easier to pro-ram than the original perspex-machine. We then show how to map the whole of perspex space into a unit cube. This allows us to construct a fractal of perspex machines with the cardinality of a real-numbered line or space. This fractal is the universal perspex machine. It can solve, in unit time, the halting problem for itself and for all perspex machines instantiated in real-numbered space, including all Turing machines. We cite an experiment that has been proposed to test the physical reality of the perspex machine's model of time, but we make no claim that the physical universe works this way or that it has the cardinality of the perspex machine. We leave it that the perspex machine provides an upper bound on the computational properties of physical things, including manufactured computers and biological organisms, that have a cardinality no greater than the real-number line.

Perspex machine VIII: axioms of transreal arithmetic

Transreal arithmetic is a total arithmetic that contains real arithmetic, but which has no arithmetical exceptions. It allows the specification of the Universal Perspex Machine which unifies geometry with the Turing Machine. Here we axiomatise the algebraic structure of transreal arithmetic so that it provides a total arithmetic on any appropriate set of numbers. This opens up the possibility of specifying a version of floating-point arithmetic that does not have any arithmetical exceptions and in which every number is a first-class citizen. We find that literal numbers in the axioms are distinct. In other words, the axiomatisation does not require special axioms to force non-triviality. It follows that transreal arithmetic must be defined on a set of numbers that contains{-8,-1,0,1,8,&pphi;} as a proper subset. We note that the axioms have been shown to be consistent by machine proof.

A policy model for secure information flow

When a computer program requires legitimate access to confidential data, the question arises whether such a program may illegally reveal sensitive information. This paper proposes a policy model to specify what information flow is permitted in a computational system. The security definition, which is based on a general notion of information lattices, allows various representations of information to be used in the enforcement of secure information flow in deterministic or nondeterministic systems. A flexible semantics-based analysis technique is presented, which uses the input-output relational model induced by an attacker's observational power, to compute the information released by the computational system. An illustrative attacker model demonstrates the use of the technique to develop a termination-sensitive analysis. The technique allows the development of various information flow analyses, parametrised by the attacker's observational power, which can be used to enforce what declassification policies.

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.

Comparison of the computational cost of a Monte Carlo and deterministic algorithm for computing bilinear forms of matrix powers

In this paper we consider bilinear forms of matrix polynomials and show that these polynomials can be used to construct solutions for the problems of solving systems of linear algebraic equations, matrix inversion and finding extremal eigenvalues. An almost Optimal Monte Carlo (MAO) algorithm for computing bilinear forms of matrix polynomials is presented. Results for the computational costs of a balanced algorithm for computing the bilinear form of a matrix power is presented, i.e., an algorithm for which probability and systematic errors are of the same order, and this is compared with the computational cost for a corresponding deterministic method.

Global and local expression of chirality in serine on the Cu{110} surface

Establishing a molecular-level understanding of enantioselectivity and chiral resolution at the organic−inorganic interfaces is a key challenge in the field of heterogeneous catalysis. As a model system, we investigate the adsorption geometry of serine on Cu{110} using a combination of low-energy electron diffraction (LEED), scanning tunneling microscopy (STM), X-ray photoelectron spectroscopy (XPS), and near-edge X-ray absorption fine structure (NEXAFS) spectroscopy. The chirality of enantiopure chemisorbed layers, where serine is in its deprotonated (anionic) state, is expressed at three levels: (i) the molecules form dimers whose orientation with respect to the substrate depends on the molecular chirality, (ii) dimers of l- and d-enantiomers aggregate into superstructures with chiral (−1 2; 4 0) lattices, respectively, which are mirror images of each other, and (iii) small islands have elongated shapes with the dominant direction depending on the chirality of the molecules. Dimer and superlattice formation can be explained in terms of intra- and interdimer bonds involving carboxylate, amino, and β−OH groups. The stability of the layers increases with the size of ordered islands. In racemic mixtures, we observe chiral resolution into small ordered enantiopure islands, which appears to be driven by the formation of homochiral dimer subunits and the directionality of interdimer hydrogen bonds. These islands show the same enantiospecific elongated shapes those as in low-coverage enantiopure layers.

Optimal observers for ARMA models

A polynomial-based ARMA model, when posed in a state-space framework can be regarded in many different ways. In this paper two particular state-space forms of the ARMA model are considered, and although both are canonical in structure they differ in respect of the mode in which disturbances are fed into the state and output equations. For both forms a solution is found to the optimal discrete-time observer problem and algebraic connections between the two optimal observers are shown. The purpose of the paper is to highlight the fact that the optimal observer obtained from the first state-space form, commonly known as the innovations form, is not that employed in an optimal controller, in the minimum-output variance sense, whereas the optimal observer obtained from the second form is. Hence the second form is a much more appropriate state-space description to use for controller design, particularly when employed in self-tuning control schemes.