The x¿n-x Plane for Analysis of Certain Second-Order Nonlinear Systems

Analysis of certain second-order nonlinear systems, not easily amenable to the phase-plane methods, and described by either of the following differential equations xÿn-2ÿ+ f(x)xÿ2n+g(x)xÿn+h(x)=0 ÿ+f(x)xÿn+h(x)=0 n≫0 can be effected easily by drawing the entire portrait of trajectories on a new plane; that is, on one of the xÿnÿx planes. Simple equations are given to evaluate time from a trajectory on any of these n planes. Poincaré's fundamental phase plane xÿÿx is conceived of as the simplest case of the general xÿnÿx plane.

Crystal structure of a beta-prism II lectin from Remusatia vivipara

The crystal structure of a beta-prism II (BP2) fold lectin from Remusatia vivipara, a plant of traditional medicinal value, has been determined at a resolution of 2.4 A. This lectin (RVL, Remusatia vivipara lectin) is a dimer with each protomer having two distinct BP2 domains without a linker between them. It belongs to the ``monocot mannose-binding'' lectin family, which consists of proteins of high sequence and structural similarity. Though the overall tertiary structure is similar to that of lectins from snowdrop bulbs and garlic, crucial differences in the mannose-binding regions and oligomerization were observed. Unlike most of the other structurally known proteins in this family, only one of the three carbohydrate recognition sites (CRSs) per BP2 domain is found to be conserved. RVL does not recognize simple mannose moieties. RVL binds to only N-linked complex glycans like those present on the gp120 envelope glycoprotein of HIV and mannosylated blood proteins like fetuin, but not to simple mannose moieties. The molecular basis for these features and their possible functional implications to understand the different levels of carbohydrate affinities in this structural family have been investigated through structure analysis, modeling and binding studies. Apart from being the first structure of a lectin to be reported from the Araceae/Arum family, this protein also displays a novel mode of oligomerization among BP2 lectins.

Simple theoretical analysis of the Fowler-Nordheim field emission from microstructures and quantum wires of optoelectronic materials

We present a simplified theoretical formulation of the Fowler-Nordheim field emission (FNFE) under magnetic quantization and also in quantum wires of optoelectronic materials on the basis of a newly formulated electron dispersion law in the presence of strong electric field within the framework of k.p formalism taking InAs, InSb, GaAs, Hg(1-x)Cd(x)Te and In(1-x)Ga(x) As(y)P(1-y) lattice matched to InP as examples. The FNFE exhibits oscillations with inverse quantizing magnetic field and electron concentration due to SdH effect and increases with increasing electric field. For quantum wires the FNFE increases with increasing film thickness due to the existence van-Hove singularity and the magnitude of the quantum jumps are not of same height indicating the signature of the band structure of the material concerned. The appearance of the humps of the respective curves is due to the redistribution of the electrons among the quantized energy levels when the quantum numbers corresponding to the highest occupied level changes from one fixed value to the others. Although the field current varies in various manners with all the variables in all the limiting cases as evident from all the curves, the rates of variations are totally band-structure dependent. Under certain limiting conditions, all the results as derived in this paper get transformed in to well known Fowler-Nordheim formula. (C) 2011 Elsevier Ltd. All rights reserved.

Interaction of G-Quadruplexes with Nonintercalating Duplex-DNA Minor Groove Binding Ligands

The enzyme telomerase synthesizes the G-rich DNA strands of the telomere and its activity is often associated with cancer. The telomerase may be therefore responsible for the ability of a cancer cell-to escape apoptosis. The G-rich DNA sequences often adopt tetra-stranded structure, known as the G-quadruplex DNA (G4-DNA). The stabilization of the telomeric DNA into the G4-DNA structures by small molecules has been the focus of many researchers for the design and development of new anticancer agents. The compounds which stabilize the G-quadruplex in the telomere inhibit the telomerase activity. Besides telomeres, the G4-DNA forming sequences are present in the genomic regions of biological significance including the transcriptional regulatory and promoter regions of several oncogenes. Inducing a G-quadruplex structure within the G-rich promoter sequences is a potential way of achieving selective gene regulation. Several G-quadruplex stabilizing ligands are known. Minor groove binding ligands (MGBLs) interact with the double-helical DNA through the minor grooves sequence-specifically and interfere with several DNA associated processes. These MGBLs when suitably modified switch their preference sometimes from the duplex DNA to G4-DNA and stabilize the G4-DNA as well. Herein, we focus on the recent advances in understanding the G-quadruplex structures, particularly made by the human telomeric ends, and review the results of various investigations of the interaction of designed organic ligands with the G-quadruplex DNA while highlighting the importance of MGBL-G-quadruplex interactions.

Experimental and computational studies on a gasifier based stove

The work reported here is concerned with a detailed thermochemical evaluation of the flaming mode behaviour of a gasifier based stove. Determination of the gas composition over the fuel bed, surface and gas temperatures in the gasification process constitute principal experimental features. A simple atomic balance for the gasification reaction combined with the gas composition from the experiments is used to determine the CH(4) equivalent of higher hydrocarbons and the gasification efficiency (eta g). The components of utilization efficiency, namely, gasification-combustion and heat transfer are explored. Reactive flow computational studies using the measured gas composition over the fuel bed are used to simulate the thermochemical flow field and heat transfer to the vessel; hither-to-ignored vessel size effects in the extraction of heat from the stove are established clearly. The overall flaming mode efficiency of the stove is 50-54%; the convective and radiative components of heat transfer are established to be 45-47 and 5-7% respectively. The efficiency estimates from reacting computational fluid dynamics (RCFD) compare well with experiments. (C) 2011 Elsevier Ltd. All rights reserved.

Synthesis and characterization of self-assembled nanofiber-bundles of V(2)O(5): their electrochemical and field emission properties

High-quality self-assembled V(2)O(5) nanofiber-bundles (NBs) are synthesized by a simple and direct hydrothermal method using a vanadium(V) hydroxylamido complex as a vanadium source in the presence of HNO(3). The possible reaction pathway for the formation of V(2)O(5) NBs is discussed and demonstrated that HNO(3) functions both as an oxidizing and as an acidification agent. V(2)O(5) NBs are single-crystals of an orthorhombic phase that have grown along the [010] direction. A bundle is made of indefinite numbers of homogeneous V(2)O(5) nanofibers where nanofibers have lengths up to several micrometres and widths ranging between 20 and 50 nm. As-prepared V(2)O(5) NBs display a high electrochemical performance in a non-aqueous electrolyte as a cathode material for lithium ion batteries. Field emission properties are also investigated which shows that a low turn-on field of similar to 1.84 V mu m(-1) is required to draw the emission current density of 10 mu Lambda cm(-2).

An (O)over-bar(m(2)n) randomized algorithm to compute a minimum cycle basis of a directed graph

We consider the problem of computing a minimum cycle basis in a directed graph G. The input to this problem is a directed graph whose arcs have positive weights. In this problem a {- 1, 0, 1} incidence vector is associated with each cycle and the vector space over Q 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 weights of the cycles is minimum is called a minimum cycle basis of G. The current fastest algorithm for computing a minimum cycle basis in a directed graph with m arcs and n vertices runs in O(m(w+1)n) time (where w < 2.376 is the exponent of matrix multiplication). If one allows randomization, then an (O) over tilde (m(3)n) algorithm is known for this problem. In this paper we present a simple (O) over tilde (m(2)n) randomized algorithm for this problem. The problem of computing a minimum cycle basis in an undirected graph has been well-studied. 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 the graph. The fastest known algorithm for computing a minimum cycle basis in an undirected graph runs in O(m(2)n + mn(2) logn) time and our randomized algorithm for directed graphs almost matches this running time.

Simple theoretical analysis of the photoemission from quantum confined effective mass superlattices of optoelectronic materials

The photoemission from quantum wires and dots of effective mass superlattices of optoelectronic materials was investigated on the basis of newly formulated electron energy spectra, in the presence of external light waves, which controls the transport properties of ultra-small electronic devices under intense radiation. The effect of magnetic quantization on the photoemission from the aforementioned superlattices, together with quantum well superlattices under magnetic quantization, has also been investigated in this regard. It appears, taking HgTe/Hg1-xCdxTe and InxGa1-xAs/InP effective mass superlattices, that the photoemission from these quantized structures is enhanced with increasing photon energy in quantized steps and shows oscillatory dependences with the increasing carrier concentration. In addition, the photoemission decreases with increasing light intensity and wavelength as well as with increasing thickness exhibiting oscillatory spikes. The strong dependence of the photoemission on the light intensity reflects the direct signature of light waves on the carrier energy spectra. The content of this paper finds six different applications in the fields of low dimensional systems in general.

Prediction of extension test results of soft cemented clays with a simple constitutive model

In the present paper, the constitutive model is proposed for cemented soils, in which the cementation component and frictional component are treated separately and then added together to get overall response. The modified Cam clay is used to predict the frictional resistance and an elasto-plastic strain softening model is proposed for the cementation component. The rectangular isotropic yield curve proposed by Vatsala (1995) for the bond component has been modified in order to account for the anisotropy generally observed in the case of natural soft cemented soils. In this paper, the model proposed is used to predict the experimental results of extension tests on the soft cemented soils whereas compression test results are presented elsewhere. The model predictions compare quite satisfactorily with the observed response. A few input parameters are required which are well defined and easily determinable and the model uses associated flow rule.

A simple and fast scheme for code compression for VLIW processors

Summary form only given. A scheme for code compression that has a fast decompression algorithm, which can be implemented using simple hardware, is proposed. The effectiveness of the scheme on the TMS320C62x architecture that includes the overheads of a line address table (LAT) is evaluated and obtained compression rates ranging from 70% to 80%. Two schemes for decompression are proposed. The basic idea underlying the scheme is a simple clustering algorithm that partially maps a block of instructions into a set of clusters. The clustering algorithm is a greedy algorithm based on the frequency of occurrence of various instructions.

Representation of evidence: An approach to uncertainty handling in knowledge-based systems

Many knowledge based systems (KBS) transform a situation information into an appropriate decision using an in built knowledge base. As the knowledge in real world situation is often uncertain, the degree of truth of a proposition provides a measure of uncertainty in the underlying knowledge. This uncertainty can be evaluated by collecting `evidence' about the truth or falsehood of the proposition from multiple sources. In this paper we propose a simple framework for representing uncertainty in using the notion of an evidence space.

Boxicity and Poset Dimension

Let G be a simple, undirected, finite graph with vertex set V (G) and edge set E(G). A k-dimensional box is a Cartesian product of closed intervals [a(1), b(1)] x [a(2), b(2)] x ... x [a(k), b(k)]. The boxicity of G, box(G), is the minimum integer k such that G can be represented as the intersection graph of k-dimensional boxes; i.e., each vertex is mapped to a k-dimensional box and two vertices are adjacent in G if and only if their corresponding boxes intersect. Let P = (S, P) be a poset, where S is the ground set and P is a reflexive, antisymmetric and transitive binary relation on S. The dimension of P, dim(P), is the minimum integer t such that P can be expressed as the intersection of t total orders. Let G(P) be the underlying comparability graph of P; i.e., S is the vertex set and two vertices are adjacent if and only if they are comparable in P. It is a well-known fact that posets with the same underlying comparability graph have the same dimension. The first result of this paper links the dimension of a poset to the boxicity of its underlying comparability graph. In particular, we show that for any poset P, box(G(P))/(chi(G(P)) - 1) <= dim(P) <= 2box(G(P)), where chi(G(P)) is the chromatic number of G(P) and chi(G(P)) not equal 1. It immediately follows that if P is a height-2 poset, then box(G(P)) <= dim(P) <= 2box(G(P)) since the underlying comparability graph of a height-2 poset is a bipartite graph. The second result of the paper relates the boxicity of a graph G with a natural partial order associated with the extended double cover of G, denoted as G(c): Note that G(c) is a bipartite graph with partite sets A and B which are copies of V (G) such that, corresponding to every u is an element of V (G), there are two vertices u(A) is an element of A and u(B) is an element of B and {u(A), v(B)} is an edge in G(c) if and only if either u = v or u is adjacent to v in G. Let P(c) be the natural height-2 poset associated with G(c) by making A the set of minimal elements and B the set of maximal elements. We show that box(G)/2 <= dim(P(c)) <= 2box(G) + 4. These results have some immediate and significant consequences. The upper bound dim(P) <= 2box(G(P)) allows us to derive hitherto unknown upper bounds for poset dimension such as dim(P) = 2 tree width (G(P)) + 4, since boxicity of any graph is known to be at most its tree width + 2. In the other direction, using the already known bounds for partial order dimension we get the following: (1) The boxicity of any graph with maximum degree Delta is O(Delta log(2) Delta), which is an improvement over the best-known upper bound of Delta(2) + 2. (2) There exist graphs with boxicity Omega(Delta log Delta). This disproves a conjecture that the boxicity of a graph is O(Delta). (3) There exists no polynomial-time algorithm to approximate the boxicity of a bipartite graph on n vertices with a factor of O(n(0.5-is an element of)) for any is an element of > 0 unless NP = ZPP.