A case of four-coordinate silver(I) adopting a high energy planar geometry. Experiment and theory

The ligands PhL and MeL are obtained by condensing 2-formylpyridine with benzil dihydrazone and diacetyl dihydrazone, respectively, in 2: 1 molar proportion. With silver( I), PhL yields a double-stranded dinuclear cationic helicate 1 in which the metal is tetrahedral but MeL gives a cationic one-dimensional polymeric complex 2 where silver( I) is distorted square planar and the ligand backbone is nearly planar. In both complexes, metal: ligand ratio is 1: 1. Ab initio calculations on the ligands at the HF/6-31+G* level reveal that while PhL strongly prefers a helical conformation, MeL has a natural inclination to remain in a planar conformation. Density functional theory calculations on model silver( I) complexes show that formation of the linear polymer in the case of MeL is also an important factor in imposing the planar geometry of Ag(I) in 2.

Surface geometry of Cu{531}

We present a combined quantitative low-energy electron diffraction (LEED) and density-functional theory (DFT) study of the chiral Cu{531} surface. The surface shows large inward relaxations with respect to the bulk interlayer distance of the first two layers and a large expansion of the distance between the fourth and fifth layers. (The latter is the first layer having the same coordination as the Cu atoms in the bulk.) Additional calculations have been performed to study the likelihood of faceting by comparing surface energies of possible facet terminations. No overall significant reduction in energy with respect to planar {531} could be found for any of the tested combinations of facets, which is in agreement with the experimental findings.

The local adsorption geometry and electronic structure of alanine on Cu{110}

The adsorption of alanine on Cu {110} was studied by a combination of near edge X-ray absorption fine structure (NEXAFS) spectroscopy, X-ray photoelectron spectroscopy (XPS) and density functional theory (DFT). Large chemical shifts in the C 1s, N 1s, and O 1s XP spectra were found between the alanine multilayer and the chemisorbed and pseudo-(3 x 2) alaninate layers. From C, N, and O K-shell NEXAFS spectra the tilt angles of the carboxylate group (approximate to 26 degrees in plane with respect to [1 (1) over bar0] and approximate to 45 degrees out of plane) and the C-N bond angle with respect to [1 (1) over bar0] could be determined for the pseudo-(3 x 2) overlayer. Using this information three adsorption geometries could be eliminated from five p(3 x 2) structures which lead to almost identical heats of adsorption in the DFT calculations between 1.40 and 1.47 eV/molecule. Due to the small energy difference between the remaining two structures it is not unlikely that these coexist on the surface at room temperature. (c) 2006 Elsevier B.V. All rights reserved.

The adsorption geometry of sulphur on Ir{100}: a quantitative LEED study

A quantitative low energy electron diffraction (LEED) analysis has been performed for the p(2 x 2)-S and c(2 x 2)-S surface structures formed by exposing the (1 x 1) phase of Ir{100} to H2S at 750 K. S is found to adsorb on the fourfold hollow sites in both structures leading to Pendry R-factor values of 0.17 for the p(2 x 2)-S and 0.16 for the c(2 x 2)-S structures. The distances between S and the nearest and next-nearest Ir atoms were found to be similar in both structures: 2.36 +/- 0.01 angstrom and 3.33 +/- 0.01 angstrom, respectively. The buckling in the second substrate layer is consistent with other structural studies for S adsorption on fcc{100} transition metal surfaces: 0.09 angstrom for p(2 x 2)-S and 0.02 angstrom for c(2 x 2)-S structures. The (1 x 5) reconstruction, which is the most stable phase for clean Ir{100}, is completely lifted and a c(2 x 2)-S overlayer is formed after exposure to H,S at 300 K followed by annealing to 520 K. CO temperature-programmed desorption (TPD) experiments indicate that the major factor in the poisoning of Ir by S is site blocking. (c) 2005 Elsevier B.V. All rights reserved.

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.

Chromatographic alignment of LC-MS and LC-MS/MS datasets by genetic algorithm feature extraction

Liquid chromatography-mass spectrometry (LC-MS) datasets can be compared or combined following chromatographic alignment. Here we describe a simple solution to the specific problem of aligning one LC-MS dataset and one LC-MS/MS dataset, acquired on separate instruments from an enzymatic digest of a protein mixture, using feature extraction and a genetic algorithm. First, the LC-MS dataset is searched within a few ppm of the calculated theoretical masses of peptides confidently identified by LC-MS/MS. A piecewise linear function is then fitted to these matched peptides using a genetic algorithm with a fitness function that is insensitive to incorrect matches but sufficiently flexible to adapt to the discrete shifts common when comparing LC datasets. We demonstrate the utility of this method by aligning ion trap LC-MS/MS data with accurate LC-MS data from an FTICR mass spectrometer and show how hybrid datasets can improve peptide and protein identification by combining the speed of the ion trap with the mass accuracy of the FTICR, similar to using a hybrid ion trap-FTICR instrument. We also show that the high resolving power of FTICR can improve precision and linear dynamic range in quantitative proteomics. The alignment software, msalign, is freely available as open source.

Variable step LMS algorithm using the accumulated instantaneous error concept

The convergence speed of the standard Least Mean Square adaptive array may be degraded in mobile communication environments. Different conventional variable step size LMS algorithms were proposed to enhance the convergence speed while maintaining low steady state error. In this paper, a new variable step LMS algorithm, using the accumulated instantaneous error concept is proposed. In the proposed algorithm, the accumulated instantaneous error is used to update the step size parameter of standard LMS is varied. Simulation results show that the proposed algorithm is simpler and yields better performance than conventional variable step LMS.

Unsupervised genetic algorithm deployed for intrusion detection

This paper represents the first step in an on-going work for designing an unsupervised method based on genetic algorithm for intrusion detection. Its main role in a broader system is to notify of an unusual traffic and in that way provide the possibility of detecting unknown attacks. Most of the machine-learning techniques deployed for intrusion detection are supervised as these techniques are generally more accurate, but this implies the need of labeling the data for training and testing which is time-consuming and error-prone. Hence, our goal is to devise an anomaly detector which would be unsupervised, but at the same time robust and accurate. Genetic algorithms are robust and able to avoid getting stuck in local optima, unlike the rest of clustering techniques. The model is verified on KDD99 benchmark dataset, generating a solution competitive with the solutions of the state-of-the-art which demonstrates high possibilities of the proposed method.

The geometry of optimal control solutions on some six dimensional lie groups

This paper examines optimal solutions of control systems with drift defined on the orthonormal frame bundle of particular Riemannian manifolds of constant curvature. The manifolds considered here are the space forms Euclidean space E-3, the spheres S-3 and the hyperboloids H-3 with the corresponding frame bundles equal to the Euclidean group of motions SE(3), the rotation group SO(4) and the Lorentz group SO(1,3). The optimal controls of these systems are solved explicitly in terms of elliptic functions. In this paper, a geometric interpretation of the extremal solutions is given with particular emphasis to a singularity in the explicit solutions. Using a reduced form of the Casimir functions the geometry of these solutions are illustrated.

A new algorithm for OFDM joint data detection and phase noise cancellation

This paper proposes a new iterative algorithm for OFDM joint data detection and phase noise (PHN) cancellation based on minimum mean square prediction error. We particularly highlight the problem of "overfitting" such that the iterative approach may converge to a trivial solution. Although it is essential for this joint approach, the overfitting problem was relatively less studied in existing algorithms. In this paper, specifically, we apply a hard decision procedure at every iterative step to overcome the overfitting. Moreover, compared with existing algorithms, a more accurate Pade approximation is used to represent the phase noise, and finally a more robust and compact fast process based on Givens rotation is proposed to reduce the complexity to a practical level. Numerical simulations are also given to verify the proposed algorithm.

A sparse kernel density estimation algorithm using forward constrained regression

Using the classical Parzen window (PW) estimate as the target function, the sparse kernel density estimator is constructed in a forward constrained regression manner. The leave-one-out (LOO) test score is used for kernel selection. The jackknife parameter estimator subject to positivity constraint check is used for the parameter estimation of a single parameter at each forward step. As such the proposed approach is simple to implement and the associated computational cost is very low. An illustrative example is employed to demonstrate that the proposed approach is effective in constructing sparse kernel density estimators with comparable accuracy to that of the classical Parzen window estimate.

An on-line algorithm of uncertain time delay estimation in a continuous system

In this paper, we present an on-line estimation algorithm for an uncertain time delay in a continuous system based on the observational input-output data, subject to observational noise. The first order Pade approximation is used to approximate the time delay. At each time step, the algorithm combines the well known Kalman filter algorithm and the recursive instrumental variable least squares (RIVLS) algorithm in cascade form. The instrumental variable least squares algorithm is used in order to achieve the consistency of the delay parameter estimate, since an error-in-the-variable model is involved. An illustrative example is utilized to demonstrate the efficacy of the proposed approach.

A relative path attenuation approximation algorithm for DVB-T systems

In the United Kingdom and in fact throughout Europe, the chosen standard for digital terrestrial television is the European Telecommunications Standards Institute (ETSI) ETN 300 744 also known as Digital Video Broadcasting - Terrestrial (DVB-T). The modulation method under this standard was chosen to be Orthogonal Frequency Division Multiplex (0FD4 because of the apparent inherent capability for withstanding the effects of multipath. Within the DVB-T standard, the addition of pilot tones was included that can be used for many applications such as channel impulse response estimation or local oscillator phase and frequency offset estimation. This paper demonstrates a technique for an estimation of the relative path attenuation of a single multipath signal that can be used as a simple firmware update for a commercial set-top box. This technique can be used to help eliminate the effects of multipath(1).

Investigation into the performance of an algorithm for deriving concise descriptions of optic flow fields for real-time control

This paper describes a region-based algorithm for deriving a concise description of a first order optical flow field. The algorithm described achieves performance improvements over existing algorithms without compromising the accuracy of the flow field values calculated. These improvements are brought about by not computing the entire flow field between two consecutive images, but by considering only the flow vectors of a selected subset of the images. The algorithm is presented in the context of a project to balance a bipedal robot using visual information.

Extending the friction cone algorithm for arbitrary polygon based haptic objects

Most haptic environments are based on single point interactions whereas in practice, object manipulation requires multiple contact points between the object, fingers, thumb and palm. The Friction Cone Algorithm was developed specifically to work well in a multi-finger haptic environment where object manipulation would occur. However, the Friction Cone Algorithm has two shortcomings when applied to polygon meshes: there is no means of transitioning polygon boundaries or feeling non-convex edges. In order to overcome these deficiencies, Face Directed Connection Graphs have been developed as well as a robust method for applying friction to non-convex edges. Both these extensions are described herein, as well as the implementation issues associated with them.