Redefinition of the kilogram, ampere, kelvin and mole: a proposed approach to implementing CIPM recommendation 1 (CI-2005)

The International System of Units (SI) is founded on seven base units, the metre, kilogram, second, ampere, kelvin, mole and candela corresponding to the seven base quantities of length, mass, time, electric current, thermodynamic temperature, amount of substance and luminous intensity. At its 94th meeting in October 2005, the International Committee for Weights and Measures (CIPM) adopted a recommendation on preparative steps towards redefining the kilogram, ampere, kelvin and mole so that these units are linked to exactly known values of fundamental constants. We propose here that these four base units should be given new definitions linking them to exactly defined values of the Planck constant h, elementary charge e, Boltzmann constant k and Avogadro constant NA, respectively. This would mean that six of the seven base units of the SI would be defined in terms of true invariants of nature. In addition, not only would these four fundamental constants have exactly defined values but also the uncertainties of many of the other fundamental constants of physics would be either eliminated or appreciably reduced. In this paper we present the background and discuss the merits of these proposed changes, and we also present possible wordings for the four new definitions. We also suggest a novel way to define the entire SI explicitly using such definitions without making any distinction between base units and derived units. We list a number of key points that should be addressed when the new definitions are adopted by the General Conference on Weights and Measures (CGPM), possibly by the 24th CGPM in 2011, and we discuss the implications of these changes for other aspects of metrology.

Preparation and properties of gallaborane, GaBH6: structure of the gaseous molecule H2Ga(μ-H)2BH2 as determined by vibrational, electron diffraction, and ab initio studies, and structure of the crystalline solid at 110 K as determined by x-ray diffraction``

Gallaborane (GaBH6, 1), synthesized by the metathesis of LiBH4 with [H2GaCl]n at ca. 250 K, has been characterized by chemical analysis and by its IR and 1H and 11B NMR spectra. The IR spectrum of the vapor at low pressure implies the presence of only one species, viz. H2Ga(μ-H)2BH2, with a diborane-like structure conforming to C2v symmetry. The structure of this molecule has been determined by gas-phase electron diffraction (GED) measurements afforced by the results of ab initio molecular orbital calculations. Hence the principal distances (rα in Å) and angles ( α in deg) are as follows: r(Ga•••B), 2.197(3); r(Ga−Ht), 1.555(6); r(Ga−Hb), 1.800(6); r(B−Ht), 1.189(7); r(B−Hb), 1.286(7); Hb−Ga−Hb, 71.6(4); and Hb−B−Hb, 110.0(5) (t = terminal, b = bridging). Aggregation of the molecules occurs in the condensed phases. X-ray crystallographic studies of a single crystal at 110 K reveal a polymeric network with helical chains made up of alternating pseudotetrahedral GaH4 and BH4 units linked through single hydrogen bridges; the average Ga•••B distance is now 2.473(7) Å. The compound decomposes in the condensed phases at temperatures exceeding ca. 240 K with the formation of elemental Ga and H2 and B2H6. The reactions with NH3, Me3N, and Me3P are also described.

Use of fibrolytic enzymes to improve the nutritive value of ruminant diets - A biochemical and in vitro rumen degradation assessment

Two commercial enzyme products, Depol 40 (D) and Liquicell 2500 (L), were characterised from a biochemical standpoint and their potential to improve rumen degradation of forages was evaluated in vitro. Enzyme activities were determined at pH 5.5 and 39 degreesC. Analysis of the enzyme activities indicated that L contained higher xylanase and endoglucanase, but lower exoglucanase, pectinase and alpha-amylase activities than D. The Reading Pressure Technique (RPT) was used to investigate the effect of enzyme addition on the in vitro gas production (GP) and organic matter degradation (OMD) of alfalfa (Medicago sativa L.) stems and leaves. A completely randomised design with factorial arrangement of treatments was used. Both alfalfa fractions were untreated or treated with each enzyme at four levels, 20 h before incubation with rumen fluid. Each level of enzyme provided similar amounts of filter paper (D1, L1), endoglucanase (D2, L2), alpha-L-arabinofuranosidase (D3, L3) and xylanase units (D4, L4) per gram forage DM. Enzymes increased the initial OMD in both fractions, with improvements of up to 15% in leaves (D4) and 8% in stems (L2) after 12 h incubation. All enzyme treatments increased the extent of degradation (96 h incubation) in the leaf fractions, but only L2 increased final OMD in the stems. Direct hydrolysis of forage fractions during the pre-treatment period did not fully account for the magnitude of the increases in OMD, suggesting that the increase in rate of degradation was achieved through a combined effect of direct enzyme hydrolysis and synergistic action between the exogenous (applied) and endogenous (rumen) enzymes. (C) 2003 Elsevier Science B.V. All rights reserved.

Anion-directed template synthesis and hydrolysis of mono-condensed Schiff base of 1,3-pentanediamine and o-hydroxyacetophenone in Ni-II and Cu-II complexes

Bis(o-hydroxyacetophenone)nickel(II) dihydrate, on reaction with 1,3-pentanediamine, yields a bis-chelate complex [NiL2]center dot 2H(2)O (1) of mono-condensed tridentate Schiff base ligand HL {2-[1-(3-aminopentylimino)ethyl]phenol}. The Schiff base has been freed from the complex by precipitating the Nil, as a dimethylglyoximato complex. HL reacts smoothly with Ni(SCN)(2)center dot 4H(2)O furnishing the complex [NiL(NCS)] (2) and with CuCl2 center dot 2H(2)O in the presence of NaN3 or NH4SCN producing [CuL(N-3)](2) (3) or [CuL(NCS)] (4). On the other hand, upon reaction with Cu(ClO4)(2)center dot 6H(2)O and Cu(NO3)(2)center dot 3H(2)O, the Schiff base undergoes hydrolysis to yield ternary complexes [Cu(hap)(pn)(H2O)]ClO4 (5) and [Cu(hap)(pn)(H2O)]NO3 (6), respectively (Hhap = o-hydroxyacetophenone and pn = 1,3-pentanediamine). The ligand HL undergoes hydrolysis also on reaction with Ni(ClO4)(2)center dot 6H(2)O or Ni(NO3)(2)center dot 6H(2)O to yield [Ni(hap)(2)] (7). The structures of the complexes 2, 3, 5, 6, and 7 have been confirmed by single-crystal X-ray analysis. In complex 2, Ni-II possesses square-planar geometry, being coordinated by the tridentate mono-negative Schiff base, L and the isothiocyanate group. The coordination environment around Cu-II in complex 3 is very similar to that in complex 2 but here two units are joined together by end-on, axial-equatorial azide bridges to result in a dimer in which the geometry around Cu-II is square pyramidal. In both 5 and 6, the Cu-II atoms display the square-pyramidal environment; the equatorial sites being coordinated by the two amine groups of 1,3-pentanediamine and two oxygen atoms of o-hydroxyacetophenone. The axial site is coordinated by a water molecule. Complex 7 is a square-planar complex with the Ni atom bonded to four oxygen atoms from two hap moieties. The mononuclear units of 2 and dinuclear units of 3 are linked by strong hydrogen bonds to form a one-dimensional network. The mononuclear units of 5 and 6 are joined together to form a dimer by very strong hydrogen bonds through the coordinated water molecule. These dimers are further involved in hydrogen bonding with the respective counteranions to form 2-D net-like open frameworks. ((C) Wiley-VCH Verlag GmbH & Co. KGaA, 69451 Weinheim, Germany, 2008).

Problems in the coupling of eye and hand in the sequential movements of children with developmental coordination disorder

Background: Shifting gaze and attention ahead of the hand is a natural component in the performance of skilled manual actions. Very few studies have examined the precise co-ordination between the eye and hand in children with Developmental Coordination Disorder (DCD). Methods This study directly assessed the maturity of eye-hand co-ordination in children with DCD. A double-step pointing task was used to investigate the coupling of the eye and hand in 7-year-old children with and without DCD. Sequential targets were presented on a computer screen, and eye and hand movements were recorded simultaneously. Results There were no differences between typically developing (TD) and DCD groups when completing fast single-target tasks. There were very few differences in the completion of the first movement in the double-step tasks, but differences did occur during the second sequential movement. One factor appeared to be the propensity for the DCD children to delay their hand movement until some period after the eye had landed on the target. This resulted in a marked increase in eye-hand lead during the second movement, disrupting the close coupling and leading to a slower and less accurate hand movement among children with DCD. Conclusions In contrast to skilled adults, both groups of children preferred to foveate the target prior to initiating a hand movement if time allowed. The TD children, however, were more able to reduce this foveation period and shift towards a feedforward mode of control for hand movements. The children with DCD persevered with a look-then-move strategy, which led to an increase in error. For the group of DCD children in this study, there was no evidence of a problem in speed or accuracy of simple movements, but there was a difficulty in concatenating the sequential shifts of gaze and hand required for the completion of everyday tasks or typical assessment items.

Verification and FPGA circuits of a block-2 fast path-based predictor

This paper formally derives a new path-based neural branch prediction algorithm (FPP) into blocks of size two for a lower hardware solution while maintaining similar input-output characteristic to the algorithm. The blocked solution, here referred to as B2P algorithm, is obtained using graph theory and retiming methods. Verification approaches were exercised to show that prediction performances obtained from the FPP and B2P algorithms differ within one mis-prediction per thousand instructions using a known framework for branch prediction evaluation. For a chosen FPGA device, circuits generated from the B2P algorithm showed average area savings of over 25% against circuits for the FPP algorithm with similar time performances thus making the proposed blocked predictor superior from a practical viewpoint.

Intelligent cores and intelligent agents: two approaches to achieve autonomy in swarm-array computing

How can a bridge be built between autonomic computing approaches and parallel computing systems? How can autonomic computing approaches be extended towards building reliable systems? How can existing technologies be merged to provide a solution for self-managing systems? The work reported in this paper aims to answer these questions by proposing Swarm-Array Computing, a novel technique inspired from swarm robotics and built on the foundations of autonomic and parallel computing paradigms. Two approaches based on intelligent cores and intelligent agents are proposed to achieve autonomy in parallel computing systems. The feasibility of the proposed approaches is validated on a multi-agent simulator.

Modeling and simulating a mathematical tool for multi-robot pattern transformation

The work reported in this paper is motivated by the need to investigate general methods for pattern transformation. A formal definition for pattern transformation is provided and four special cases namely, elementary and geometric transformation based on repositioning all and some agents in the pattern are introduced. The need for a mathematical tool and simulations for visualizing the behavior of a transformation method is highlighted. A mathematical method based on the Moebius transformation is proposed. The transformation method involves discretization of events for planning paths of individual robots in a pattern. Simulations on a particle physics simulator are used to validate the feasibility of the proposed method.

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.

Modeling and simulating a mathematical tool for multi-robot pattern transformation

The work reported in this paper is motivated by the need to investigate general methods for pattern transformation. A formal definition for pattern transformation is provided and four special cases namely, elementary and geometric transformation based on repositioning all and some agents in the pattern are introduced. The need for a mathematical tool and simulations for visualizing the behavior of a transformation method is highlighted. A mathematical method based on the Moebius transformation is proposed. The transformation method involves discretization of events for planning paths of individual robots in a pattern. Simulations on a particle physics simulator are used to validate the feasibility of the proposed method.

Visualizing a logic of dependability arguments

This paper offers general guidelines for the development of effective visual languages. That is, languages for constructing diagrams that can be easily and readily interpreted and manipulated by the human reader. We use these guidelines first to examine classical AND/OR trees as a representation of logical proofs, and second to design and evaluate a visual language for representing proofs in LofA: a Logic of Dependability Arguments, for which we provide a brief motivation and overview.

3D surface point and wireframe reconstruction from multiview photographic images

This paper describes a new method for reconstructing 3D surface points and a wireframe on the surface of a freeform object using a small number, e.g. 10, of 2D photographic images. The images are taken at different viewing directions by a perspective camera with full prior knowledge of the camera configurations. The reconstructed surface points are frontier points and the wireframe is a network of contour generators. Both of them are reconstructed by pairing apparent contours in the 2D images. Unlike previous works, we empirically demonstrate that if the viewing directions are uniformly distributed around the object's viewing sphere, then the reconstructed 3D points automatically cluster closely on a highly curved part of the surface and are widely spread on smooth or flat parts. The advantage of this property is that the reconstructed points along a surface or a contour generator are not under-sampled or under-represented because surfaces or contours should be sampled or represented with more densely points where their curvatures are high. The more complex the contour's shape, the greater is the number of points required, but the greater the number of points is automatically generated by the proposed method. Given that the viewing directions are uniformly distributed, the number and distribution of the reconstructed points depend on the shape or the curvature of the surface regardless of the size of the surface or the size of the object. The unique pattern of the reconstructed points and contours may be used in 31) object recognition and measurement without computationally intensive full surface reconstruction. The results are obtained from both computer-generated and real objects. (C) 2007 Elsevier B.V. All rights reserved.

Alignment of a model amyloid peptide fragment in bulk and at a solid surface

The alignment of model amyloid peptide YYKLVFFC is investigated in bulk and at a solid surface using a range of spectroscopic methods employing polarized radiation. The peptide is based on a core sequence of the amyloid beta (A beta) peptide, KLVFF. The attached tyrosine and cysteine units are exploited to yield information on alignment and possible formation of disulfide or dityrosine links. Polarized Raman spectroscopy on aligned stalks provides information on tyrosine orientation, which complements data from linear dichroism (LD) on aqueous solutions subjected to shear in a Couette cell. LD provides a detailed picture of alignment of peptide strands and aromatic residues and was also used to probe the kinetics of self-assembly. This suggests initial association of phenylalanine residues, followed by subsequent registry of strands and orientation of tyrosine residues. X-ray diffraction (XRD) data from aligned stalks is used to extract orientational order parameters from the 0.48 nm reflection in the cross-beta pattern, from which an orientational distribution function is obtained. X-ray diffraction on solutions subject to capillary flow confirmed orientation in situ at the level of the cross-beta pattern. The information on fibril and tyrosine orientation from polarized Raman spectroscopy is compared with results from NEXAFS experiments on samples prepared as films on silicon. This indicates fibrils are aligned parallel to the surface, with phenyl ring normals perpendicular to the surface. Possible disulfide bridging leading to peptide dimer formation was excluded by Raman spectroscopy, whereas dityrosine formation was probed by fluorescence experiments and was found not to occur except under alkaline conditions. Congo red binding was found not to influence the cross-beta XRD pattern.

Efficient on the fly calculation of time correlation functions in computer simulations

Time correlation functions yield profound information about the dynamics of a physical system and hence are frequently calculated in computer simulations. For systems whose dynamics span a wide range of time, currently used methods require significant computer time and memory. In this paper, we discuss the multiple-tau correlator method for the efficient calculation of accurate time correlation functions on the fly during computer simulations. The multiple-tau correlator is efficacious in terms of computational requirements and can be tuned to the desired level of accuracy. Further, we derive estimates for the error arising from the use of the multiple-tau correlator and extend it for use in the calculation of mean-square particle displacements and dynamic structure factors. The method described here, in hardware implementation, is routinely used in light scattering experiments but has not yet found widespread use in computer simulations.