Observation of Peierls transition in nanowires (diameter similar to 130 nm) of the charge transfer molecule TTF-TCNQ synthesized by electric-field-directed growth

We report the growth of nanowires of the charge transfer complex tetrathiafulvalene-tetracyanoquinodimethane (TTF-TCNQ) with diameters as low as 130 nm and show that such nanowires can show Peierls transitions at low temperatures. The wires of sub-micron length were grown between two prefabricated electrodes (with sub-micron gap) by vapor phase growth from a single source by applying an electric field between the electrodes during the growth process. The nanowires so grown show a charge transfer ratio similar to 0.57, which is close to that seen in bulk crystals. Below the transition the transport is strongly nonlinear and can be interpreted as originating from de-pinning of CDW that forms at the Peierls transition.

Use of structure-directed DNA ligands to probe the binding of recA protein to narrow and wide grooves of DNA and on its ability to promote homologous pairing

We have used circular dichroism and structure-directed drugs to identify the role of structural features, wide and narrow grooves in particular, required for the cooperative polymerization, recognition of homologous sequences, and the formation of joint molecules promoted by recA protein. The path of cooperative polymerization of recA protein was deduced by its ability to cause quantitative displacement of distamycin from the narrow groove of duplex DNA. By contrast, methyl green bound to the wide groove was retained by the nucleoprotein filaments comprised of recA protein-DNA. Further, the mode of binding of these ligands and recA protein to DNA was confirmed by DNaseI digestion. More importantly, the formation of joint molecules was prevented by distamycin in the narrow groove while methyl green in the wide groove had no adverse effect. Intriguingly, distamycin interfered with the production of coaggregates between nucleoprotein filaments of recA protein-M13 ssDNA and naked linear M13 duplex DNA, but not with linear phi X174 duplex DNA. Thus, these data, in conjunction with molecular modeling, suggest that the narrow grooves of duplex DNA provide the fundamental framework required for the cooperative polymerization of recA protein and alignment of homologous sequences. These findings and their significance are discussed in relation to models of homologous pairing between two intertwined DNA molecules.

Anion directed template synthesis of Cu(II) complexes of a N,N,O donor mono-condensed Schiff base ligand: A molecular scaffold forming highly ordered H-bonded rectangular grids

Anion directed, template syntheses of two dinuclear copper(II) complexes of mono-condensed Schiff base ligand Hdipn (4-[(3-aminopentylimino)-methyl]-benzene-1,3-diol) involving 2,4- dihydroxybenzaldehyde and 1,3-diaminopentane were realized in the presence of bridging azide and acetate anions. Both complexes, [Cu-2(dipn)(2)(N-3)(2)] (1) and [Cu-2(dip(n))(2)(OAc)(2)] (2) have been characterized by X-ray crystallography. The two mononuclear units are joined together by basal-apical, double end-on azido bridges in complex 1 and by basal-apical, double mono-atomic acetate oxygen-bridges in 2. Both complexes form rectangular grid-like supramolecular structures via H-bonds connecting the azide or acetate anion and the p-hydroxy group of 2,4- dihydroxybenzaldehyde. Variable-temperature (300-2 K) magnetic susceptibility measurements reveal that complex 1 has antiferromagnetic coupling (J = -2.10 cm (1)) through the azide bridge while 2 has intra-dimer ferromagnetic coupling through the acetate bridge and inter-dimer antiferromagnetic coupling through H-bonds (J = 2.85 cm (1), J' = -1.08 cm (1)). (C) 2009 Elsevier B. V. All rights reserved.

Bond graph model of doubly fed three phase induction motor using the Axis Rotator element for frame transformation

Induction motor is a typical member of a multi-domain, non-linear, high order dynamic system. For speed control a three phase induction motor is modelled as a d–q model where linearity is assumed and non-idealities are ignored. Approximation of the physical characteristic gives a simulated behaviour away from the natural behaviour. This paper proposes a bond graph model of an induction motor that can incorporate the non-linearities and non-idealities thereby resembling the physical system more closely. The model is validated by applying the linearity and idealities constraints which shows that the conventional ‘abc’ model is a special case of the proposed generalised model.

New approximation algorithms for minimum cycle bases of graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Conditional Probability-Based Significance Tests for Sequential Patterns in Multineuronal Spike Trains

We consider the problem of detecting statistically significant sequential patterns in multineuronal spike trains. These patterns are characterized by ordered sequences of spikes from different neurons with specific delays between spikes. We have previously proposed a data-mining scheme to efficiently discover such patterns, which occur often enough in the data. Here we propose a method to determine the statistical significance of such repeating patterns. The novelty of our approach is that we use a compound null hypothesis that not only includes models of independent neurons but also models where neurons have weak dependencies. The strength of interaction among the neurons is represented in terms of certain pair-wise conditional probabilities. We specify our null hypothesis by putting an upper bound on all such conditional probabilities. We construct a probabilistic model that captures the counting process and use this to derive a test of significance for rejecting such a compound null hypothesis. The structure of our null hypothesis also allows us to rank-order different significant patterns. We illustrate the effectiveness of our approach using spike trains generated with a simulator.

Role of histidine residues in EcoP15I DNA methyltransferase activity as probed by chemical modification and site-directed mutagenesis

Towards understanding the catalytic mechanism of M.EcoP15I [EcoP15I MTase (DNA methyltransferase); an adenine methyltransferase], we investigated the role of histidine residues in catalysis. M.EcoP15I, when incubated with DEPC (diethyl pyrocarbonate), a histidine-specific reagent, shows a time- and concentration-dependent inactivation of methylation of DNA containing its recognition sequence of 5'-CAGCAG-3'. The loss of enzyme activity was accompanied by an increase in absorbance at 240 nm. A difference spectrum of modified versus native enzyme shows the formation of N-carbethoxyhistidine that is diminished by hydroxylamine. This, along with other experiments, strongly suggests that the inactivation of the enzyme by DEPC was specific for histidine residues. Substrate protection experiments show that pre-incubating the methylase with DNA was able to protect the enzyme from DEPC inactivation. Site-directed mutagenesis experiments in which the 15 histidine residues in the enzyme were replaced individually with alanine corroborated the chemical modification studies and established the importance of His-335 in the methylase activity. No gross structural differences were detected between the native and H335A mutant MTases, as evident from CD spectra, native PAGE pattern or on gel filtration chromatography. Replacement of histidine with alanine residue at position 335 results in a mutant enzyme that is catalytically inactive and binds to DNA more tightly than the wild-type enzyme. Thus we have shown in the present study, through a combination of chemical modification and site-directed mutagenesis experiments, that His-335 plays an essential role in DNA methylation catalysed by M.EcoP15I.

Topological properties of the one dimensional exponential random geometric graph

In this article we study the one-dimensional random geometric (random interval) graph when the location of the nodes are independent and exponentially distributed. We derive exact results and limit theorems for the connectivity and other properties associated with this random graph. We show that the asymptotic properties of a graph with a truncated exponential distribution can be obtained using the exponential random geometric graph. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008.

Deeper and wider fully convolutional network coupled with conditional random fields for scene labeling

Deep convolutional neural networks (DCNNs) have been employed in many computer vision tasks with great success due to their robustness in feature learning. One of the advantages of DCNNs is their representation robustness to object locations, which is useful for object recognition tasks. However, this also discards spatial information, which is useful when dealing with topological information of the image (e.g. scene labeling, face recognition). In this paper, we propose a deeper and wider network architecture to tackle the scene labeling task. The depth is achieved by incorporating predictions from multiple early layers of the DCNN. The width is achieved by combining multiple outputs of the network. We then further refine the parsing task by adopting graphical models (GMs) as a post-processing step to incorporate spatial and contextual information into the network. The new strategy for a deeper, wider convolutional network coupled with graphical models has shown promising results on the PASCAL-Context dataset.

Optimal multicommodity flow through the complete graph with random edge capacities

We consider a multicommodity flow problem on a complete graph whose edges have random, independent, and identically distributed capacities. We show that, as the number of nodes tends to infinity, the maximumutility, given by the average of a concave function of each commodity How, has an almost-sure limit. Furthermore, the asymptotically optimal flow uses only direct and two-hop paths, and can be obtained in a distributed manner.

Sequential split vector quantization of LSF parameters using conditional PDF

A better performing product code vector quantization (VQ) method is proposed for coding the line spectrum frequency (LSF) parameters; the method is referred to as sequential split vector quantization (SeSVQ). The split sub-vectors of the full LSF vector are quantized in sequence and thus uses conditional distribution derived from the previous quantized sub-vectors. Unlike the traditional split vector quantization (SVQ) method, SeSVQ exploits the inter sub-vector correlation and thus provides improved rate-distortion performance, but at the expense of higher memory. We investigate the quantization performance of SeSVQ over traditional SVQ and transform domain split VQ (TrSVQ) methods. Compared to SVQ, SeSVQ saves 1 bit and nearly 3 bits, for telephone-band and wide-band speech coding applications respectively.

Conditional Moments in Asset Pricing

A better understanding of stock price changes is important in guiding many economic activities. Since prices often do not change without good reasons, searching for related explanatory variables has involved many enthusiasts. This book seeks answers from prices per se by relating price changes to their conditional moments. This is based on the belief that prices are the products of a complex psychological and economic process and their conditional moments derive ultimately from these psychological and economic shocks. Utilizing information about conditional moments hence makes it an attractive alternative to using other selective financial variables in explaining price changes. The first paper examines the relation between the conditional mean and the conditional variance using information about moments in three types of conditional distributions; it finds that the significance of the estimated mean and variance ratio can be affected by the assumed distributions and the time variations in skewness. The second paper decomposes the conditional industry volatility into a concurrent market component and an industry specific component; it finds that market volatility is on average responsible for a rather small share of total industry volatility — 6 to 9 percent in UK and 2 to 3 percent in Germany. The third paper looks at the heteroskedasticity in stock returns through an ARCH process supplemented with a set of conditioning information variables; it finds that the heteroskedasticity in stock returns allows for several forms of heteroskedasticity that include deterministic changes in variances due to seasonal factors, random adjustments in variances due to market and macro factors, and ARCH processes with past information. The fourth paper examines the role of higher moments — especially skewness and kurtosis — in determining the expected returns; it finds that total skewness and total kurtosis are more relevant non-beta risk measures and that they are costly to be diversified due either to the possible eliminations of their desirable parts or to the unsustainability of diversification strategies based on them.

Structural aspects of semantic-directed clusters

Knowledge-based clusters are studied from the structural point of view. Generalized descriptions for such clusters are stated and illustrated. Peculiarities of certain knowledge-based cluster configurations are highlighted. The adequacy of the connectives logical and (“and”) logical or (“exclusive-or”) in describing such clusters is justified. The definition of “concept” is elaborated from the clustering point of view and used to establish the equivalence between, descriptions of clusters and concepts. The order-independence of semantic-directed clustering approach is established formally based on axiomatic considerations.