Nucleosomes on linear duplex DNA allow homologous pairing but prevent strand exchange promoted by RecA protein

To understand the molecular basis of gene targeting, we have studied interactions of nucleoprotein filaments comprised of single-stranded DNA and RecA protein with chromatin templates reconstituted from linear duplex DNA and histones. We observed that for the chromatin templates with histone/DNA mass ratios of 0.8 and 1.6, the efficiency of homologous pairing was indistinguishable from that of naked duplex DNA but strand exchange was repressed. In contrast, the chromatin templates with a histone/DNA mass ratio of 9.0 supported neither homologous pairing nor strand exchange. The addition of histone H1, in stoichiometric amounts, to chromatin templates quells homologous pairing. The pairing of chromatin templates with nucleoprotein filaments of RecA protein-single-stranded DNA proceeded without the production of detectable networks of DNA, suggesting that coaggregates are unlikely to be the intermediates in homologous pairing. The application of these observations to strategies for gene targeting and their implications for models of genetic recombination are discussed.

A formate bridged Ni(II) sheet and its 3D analogue in presence of a linear organic linker: Synthesis, crystal structure and magnetic properties

Reaction of formamide with Ni(NO3)(2)center dot 6H(2)O under hydrothermal condition in a mixture of MeOH/H2O forms a two-dimensional formate bridged sheet Ni(HCOO)(2)(MeOH)(2) (1). X-ray structure analysis reveals the conversion of formamide to formate which acts as a bridging ligand in complex 1 where the axial sites of Ni(II) are occupied by methanol used as a solvent. An analogous reaction in presence of 4,4'-bipyridyl (4,4'-bipy) yielded a three-dimensional structure Ni(HCOO)(2)(4,4'-bpy) (2). DC magnetic measurements as a function of temperature and field established the presence of spontaneous magnetization with T-c (Curie temperature) = 17 and 20.8 K in 1 and 2, respectively, which can be attributed due to spin-canting. DFT calculations were performed to corroborate the magnetic results of 1 and 2. (C) 2010 Elsevier Ltd. All rights reserved.

Epoch extraction from linear prediction residual for identification of closed glottis interval

In voiced speech analysis epochal information is useful in accurate estimation of pitch periods and the frequency response of the vocal tract system. Ideally, linear prediction (LP) residual should give impulses at epochs. However, there are often ambiguities in the direct use of LP residual since samples of either polarity occur around epochs. Further, since the digital inverse filter does not compensate the phase response of the vocal tract system exactly, there is an uncertainty in the estimated epoch position. In this paper we present an interpretation of LP residual by considering the effect of the following factors: 1) the shape of glottal pulses, 2) inaccurate estimation of formants and bandwidths, 3) phase angles of formants at the instants of excitation, and 4) zeros in the vocal tract system. A method for the unambiguous identification of epochs from LP residual is then presented. The accuracy of the method is tested by comparing the results with the epochs obtained from the estimated glottal pulse shapes for several vowel segments. The method is used to identify the closed glottis interval for the estimation of the true frequency response of the vocal tract system.

On duality in linear fractional programming

In this paper, a dual of a given linear fractional program is defined and the weak, direct and converse duality theorems are proved. Both the primal and the dual are linear fractional programs. This duality theory leads to necessary and sufficient conditions for the optimality of a given feasible solution. A unmerical example is presented to illustrate the theory in this connection. The equivalence of Charnes and Cooper dual and Dinkelbach’s parametric dual of a linear fractional program is also established.

Nonnegative integral solution of linear equations

A method to obtain a nonnegative integral solution of a system of linear equations, if such a solution exists is given. The method writes linear equations as an integer programming problem and then solves the problem using a combination of artificial basis technique and a method of integer forms.

An efficient algorithm for linear programming

A simple but efficient algorithm is presented for linear programming. The algorithm computes the projection matrix exactly once throughout the computation unlike that of Karmarkar’s algorithm where in the projection matrix is computed at each and every iteration. The algorithm is best suitable to be implemented on a parallel architecture. Complexity of the algorithm is being studied.

An optimal parallel algorithm for sparse matrix bandwidth reduction on a linear array

A simple and efficient algorithm for the bandwidth reduction of sparse symmetric matrices is proposed. It involves column-row permutations and is well-suited to map onto the linear array topology of the SIMD architectures. The efficiency of the algorithm is compared with the other existing algorithms. The interconnectivity and the memory requirement of the linear array are discussed and the complexity of its layout area is derived. The parallel version of the algorithm mapped onto the linear array is then introduced and is explained with the help of an example. The optimality of the parallel algorithm is proved by deriving the time complexities of the algorithm on a single processor and the linear array.

2-Dimensional Linear-Stability of Premixed Laminar Flames Under Zero-Gravity

This paper reports on the numerical study of the linear stability of laminar premixed flames under zero gravity. The study specifically addresses the dependence of stability on finite rate chemistry with low activation energy and variable thermodynamic and transport properties. The calculations show that activation energy and details of chemistry play a minor role in altering the linear neutral stability results from asymptotic analysis. Variable specific heat makes a marginal change to the stability. Variable transport properties on the other hand tend to substantially enhance the stability from critical wave number of about 0.5 to 0.20. Also, it appears that the effects of variable properties tend to nullify the effects of non-unity Lewis number. When the Lewis number of a single species is different from unity, as will happen in a hydrogen-air premixed flame, the stability results remain close to that of unity Lewis number.

A note on resolving infeasibility in linear programs by constraint relaxation

We study the problem of finding a set of constraints of minimum cardinality which when relaxed in an infeasible linear program, make it feasible. We show the problem is NP-hard even when the constraint matrix is totally unimodular and prove polynomial-time solvability when the constraint matrix and the right-hand-side together form a totally unimodular matrix.

Field-dependent changeover from current-to voltage-limiting characteristics by non-linear n-type BaTiO3 ceramics

Non-linear resistors having current-limiting capabilities at lower field strengths, and voltage-limiting characteristics (varistors) at higher field strengths, were prepared from sintered polycrystalline ceramics of (Ba0.6Sr0.4)(Ti0.97Zr0.03)O3+0.3 at % La, and reannealed after painting with low-melting mixtures of Bi2O3 + PbO +B2O3. These types of non-linear characteristics were found to depend upon the non-uniform diffusion of lead and the consequent distribution of Curie points (T c) in these perovskites, resulting in diffuse phase transitions. Tunnelling of electrons across the asymmetric barrier at tetragonak-cubic interfaces changes to tunnelling across the symmetric barrier as the cubic phase is fully stabilized through Joule heating at high field strengths. Therefore the current-limiting characteristics switch over to voltage-limiting behaviour because tunnelling to acceptor-type mid-bandgap states gives way to band-to-band tunnelling.

The Reproducing Kernel DMS-FEM: 3D Shape Functions and Applications to Linear Solid Mechanics

We propose a family of 3D versions of a smooth finite element method (Sunilkumar and Roy 2010), wherein the globally smooth shape functions are derivable through the condition of polynomial reproduction with the tetrahedral B-splines (DMS-splines) or tensor-product forms of triangular B-splines and ID NURBS bases acting as the kernel functions. While the domain decomposition is accomplished through tetrahedral or triangular prism elements, an additional requirement here is an appropriate generation of knotclouds around the element vertices or corners. The possibility of sensitive dependence of numerical solutions to the placements of knotclouds is largely arrested by enforcing the condition of polynomial reproduction whilst deriving the shape functions. Nevertheless, given the higher complexity in forming the knotclouds for tetrahedral elements especially when higher demand is placed on the order of continuity of the shape functions across inter-element boundaries, we presently emphasize an exploration of the triangular prism based formulation in the context of several benchmark problems of interest in linear solid mechanics. In the absence of a more rigorous study on the convergence analyses, the numerical exercise, reported herein, helps establish the method as one of remarkable accuracy and robust performance against numerical ill-conditioning (such as locking of different kinds) vis-a-vis the conventional FEM.

Points-to Analysis as a System of Linear Equations

We propose a novel formulation of the points-to analysis as a system of linear equations. With this, the efficiency of the points-to analysis can be significantly improved by leveraging the advances in solution procedures for solving the systems of linear equations. However, such a formulation is non-trivial and becomes challenging due to various facts, namely, multiple pointer indirections, address-of operators and multiple assignments to the same variable. Further, the problem is exacerbated by the need to keep the transformed equations linear. Despite this, we successfully model all the pointer operations. We propose a novel inclusion-based context-sensitive points-to analysis algorithm based on prime factorization, which can model all the pointer operations. Experimental evaluation on SPEC 2000 benchmarks and two large open source programs reveals that our approach is competitive to the state-of-the-art algorithms. With an average memory requirement of mere 21MB, our context-sensitive points-to analysis algorithm analyzes each benchmark in 55 seconds on an average.

Exact-Solutions Of Linear Partial-Differential Equations With Variable-Coefficients

Backlund transformations relating the solutions of linear PDE with variable coefficients to those of PDE with constant coefficients are found, generalizing the study of Varley and Seymour [2]. Auto-Backlund transformations are also determined. To facilitate the generation of new solutions via Backlund transformation, explicit solutions of both classes of the PDE just mentioned are found using invariance properties of these equations and other methods. Some of these solutions are new.