Hydrogen-Bond-Directed Nonlinear-Optical Organic Materials - Evidence For The Control Of 2nd-Harmonic Generation Activities From The X-Ray Crystal-Structures Of The Complexes Of L-Tartaric Acid With M-Anisidine and P-Toluidine

Several substituted anilines were converted to binary salts with L-tartaric acid. Second harmonic generation (SHG) activities of these salts were determined. The crystal packing in two structures, (i) m-anisidinium-L-tartrate monohydrate (i) and (ii) p-toluidinium-L-tartrate (2), studied using X-ray diffraction demonstrates that extensive hydrogen bonding steers the components into a framework which has a direct bearing on the SHG activity

A polynomial bound on the number of light cycles in an undirected graph

Let G be an undirected graph with a positive real weight on each edge. It is shown that the number of minimum-weight cycles of G is bounded above by a polynomial in the number of edges of G. A similar bound holds if we wish to count the number of cycles with weight at most a constant multiple of the minimum weight of a cycle of G.

Model studies directed towards the synthesis of functionalised chiral A-ring derivatives of taxanes

Model studies, starting from the monoterpene R-carvone, directed towards the synthesis of chiral A-ring derivatives of taxanes with oxygen functionalities at C-2, 9 and 13 carbon atoms as in taxol is described.

Combinatorial logic synthesis using technology directed decomposition

The aim of logic synthesis is to produce circuits which satisfy the given boolean function while meeting timing constraints and requiring the minimum silicon area. Logic synthesis involves two steps namely logic decomposition and technology mapping. Existing methods treat the two as separate operation. The traditional approach is to minimize the number of literals without considering the target technology during the decomposition phase. The decomposed expressions are then mapped on to the target technology to optimize the area, Timing optimization is carried out subsequently, A new approach which treats logic decomposition and technology maping as a single operation is presented. The logic decomposition is based on the parameters of the target technology. The area and timing optimization is carried out during logic decomposition phase itself. Results using MCNC circuits are presented to show that this method produces circuits which are 38% faster while requiring 14% increase in area.

Synthetic studies directed towards the potent cytotoxic natural product ottelione A: stereoselective construction of the complete framework

A stereoselective strategy for the rapid acquisition of the complete framework (dideoxyottelione A) of the promising cytotoxic agent ottelione A, with four contiguous stereogenic centres on a hydrindane skeleton and a sensitive 4-methylenecyclohex-2-enone functionality, from the readily available Diels-Alder adduct of 1,2,3,4-tetrachloro-5,5-dimethoxycyclopentadiene and norbornadiene, is delineated.

Assessment of conditional moment closure models of turbulent autoignition using DNS data

A systematic assessment of the submodels of conditional moment closure (CMC) formalism for the autoignition problem is carried out using direct numerical simulation (DNS) data. An initially non-premixed, n-heptane/air system, subjected to a three-dimensional, homogeneous, isotropic, and decaying turbulence, is considered. Two kinetic schemes, (1) a one-step and (2) a reduced four-step reaction mechanism, are considered for chemistry An alternative formulation is developed for closure of the mean chemical source term , based on the condition that the instantaneous fluctuation of excess temperature is small. With this model, it is shown that the CMC equations describe the autoignition process all the way up to near the equilibrium limit. The effect of second-order terms (namely, conditional variance of temperature excess sigma(2) and conditional correlations of species q(ij)) in modeling is examined. Comparison with DNS data shows that sigma(2) has little effect on the predicted conditional mean temperature evolution, if the average conditional scalar dissipation rate is properly modeled. Using DNS data, a correction factor is introduced in the modeling of nonlinear terms to include the effect of species fluctuations. Computations including such a correction factor show that the species conditional correlations q(ij) have little effect on model predictions with a one-step reaction, but those q(ij) involving intermediate species are found to be crucial when four-step reduced kinetics is considered. The "most reactive mixture fraction" is found to vary with time when a four-step kinetics is considered. First-order CMC results are found to be qualitatively wrong if the conditional mean scalar dissipation rate is not modeled properly. The autoignition delay time predicted by the CMC model compares excellently with DNS results and shows a trend similar to experimental data over a range of initial temperatures.

Analysing Message Sequence Graph Specifications

We give a detailed construction of a finite-state transition system for a com-connected Message Sequence Graph. Though this result is well-known in the literature and forms the basis for the solution to several analysis and verification problems concerning MSG specifications, the constructions given in the literature are either not amenable to implementation, or imprecise, or simply incorrect. In contrast we give a detailed construction along with a proof of its correctness. Our transition system is amenable to implementation, and can also be used for a bounded analysis of general (not necessarily com-connected) MSG specifications.

Implementation of conditional phase-shift gate for quantum information processing by NMR, using transition-selective pulses

Experimental realization of quantum information processing in the field of nuclear magnetic resonance (NMR) has been well established. Implementation of conditional phase-shift gate has been a significant step, which has lead to realization of important algorithms such as Grover's search algorithm and quantum Fourier transform. This gate has so far been implemented in NMR by using coupling evolution method. We demonstrate here the implementation of the conditional phase-shift gate using transition selective pulses. As an application of the gate, we demonstrate Grover's search algorithm and quantum Fourier transform by simulations and experiments using transition selective pulses. (C) 2002 Elsevier Science (USA). All rights reserved.

A gradient PCR-based screen for use in site-directed mutagenesis

Site-directed mutagenesis is widely used to study protein and nucleic acid structure and function. Despite recent advancements in the efficiency of procedures for site-directed mutagenesis, the fraction of site-directed mutants by most procedures rarely exceeds 50% on a routine basis and is never 100%. Hence it is typically necessary to sequence two or three clones each time a site-directed mutant is constructed. We describe a simple and robust gradient-PCR-based screen for distinguishing site-directed mutants from the starting, unmutated plasmid. The procedure can use either purified plasmid DNA or colony PCR, starting from a single colony. The screen utilizes the primer used for mutagenesis and a common outside primer that can be used for all other mutants constructed with the same template. Over 30 site-specific mutants in a variety of templates were successfully screened and all of the mutations detected were subsequently confirmed by DNA sequencing. A single base pair mismatch could be detected in an oligonucleotide of 36 bases. Detection efficiency was relatively independent of starting template concentration and the nature of the outside primer used. (C) 2003 Elsevier Science (USA). All rights reserved.

Electric Field Directed Growth of Molecular Wires of Charge Transfer Molecules on Prefabricated Metal Electrodes

Molecular wires of charge transfer molecules were formed by co-evaporating the 7 7 8 8-Tetracyanoquinodimethane [TCNQ] (acceptor) and Tetrathiafulvalene [TTF] (donor) molecules across prefabricated metal electrodes. Molecular wires of TTF TCNQ were also formed by evaporating single complex of TTF:TCNQ across prefabricated metal electrodes The prefabricated metal electrodes were made using electron beam lithography on SiO2 and glass cover slip substrates. Even though TTF: TCNQ wires grown from both co-evaporation and evaporation techniques show semiconductor like behavior in temperature dependence of resistance they show different activation energies due the difference in stoichiometry of TTF and TCNQ.

Performance Evaluation of Distance-Hop Proportionality on Geometric Graph Models of Dense Sensor Networks

Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes on a region in Euclidean space, e.g., the unit square. After deployment, the nodes self-organise into a mesh topology. In a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this paper, we analyse the performance of this approximation. We show that nodes with a certain hop distance from a fixed anchor node lie within a certain annulus with probability approach- ing unity as the number of nodes n → ∞. We take a uniform, i.i.d. deployment of n nodes on a unit square, and consider the geometric graph on these nodes with radius r(n) = c q ln n n . We show that, for a given hop distance h of a node from a fixed anchor on the unit square,the Euclidean distance lies within [(1−ǫ)(h−1)r(n), hr(n)],for ǫ > 0, with probability approaching unity as n → ∞.This result shows that it is more likely to expect a node, with hop distance h from the anchor, to lie within this an- nulus centred at the anchor location, and of width roughly r(n), rather than close to a circle whose radius is exactly proportional to h. We show that if the radius r of the ge- ometric graph is fixed, the convergence of the probability is exponentially fast. Similar results hold for a randomised lattice deployment. We provide simulation results that il- lustrate the theory, and serve to show how large n needs to be for the asymptotics to be useful.

Compiler-Directed Frequency and Voltage Scaling for a Multiple Clock Domain

Multiple Clock Domain processors provide an attractive solution to the increasingly challenging problems of clock distribution and power dissipation. They allow their chips to be partitioned into different clock domains, and each domain’s frequency (voltage) to be independently configured. This flexibility adds new dimensions to the Dynamic Voltage and Frequency Scaling problem, while providing better scope for saving energy and meeting performance demands. In this paper, we propose a compiler directed approach for MCD-DVFS. We build a formal petri net based program performance model, parameterized by settings of microarchitectural components and resource configurations, and integrate it with our compiler passes for frequency selection.Our model estimates the performance impact of a frequency setting, unlike the existing best techniques which rely on weaker indicators of domain performance such as queue occupancies(used by online methods) and slack manifestation for a particular frequency setting (software based methods).We evaluate our method with subsets of SPECFP2000,Mediabench and Mibench benchmarks. Our mean energy savings is 60.39% (versus 33.91% of the best software technique)in a memory constrained system for cache miss dominated benchmarks, and we meet the performance demands.Our ED2 improves by 22.11% (versus 18.34%) for other benchmarks. For a CPU with restricted frequency settings, our energy consumption is within 4.69% of the optimal.

Finding a Box Representation for a Graph in $O(n^2\Delta^2\ln n)$ time

An axis-parallel box in $b$-dimensional space is a Cartesian product $R_1 \times R_2 \times \cdots \times R_b$ where $R_i$ (for $1 \leq i \leq b$) is a closed interval of the form $[a_i, b_i]$ on the real line. For a graph $G$, its boxicity is the minimum dimension $b$, such that $G$ is representable as the intersection graph of (axis-parallel) boxes in $b$-dimensional space. The concept of boxicity finds application in various areas of research like ecology, operation research etc. Chandran, Francis and Sivadasan gave an $O(\Delta n^2 \ln^2 n)$ randomized algorithm to construct a box representation for any graph $G$ on $n$ vertices in $\lceil (\Delta + 2)\ln n \rceil$ dimensions, where $\Delta$ is the maximum degree of the graph. They also came up with a deterministic algorithm that runs in $O(n^4 \Delta )$ time. Here, we present an $O(n^2 \Delta^2 \ln n)$ deterministic algorithm that constructs the box representation for any graph in $\lceil (\Delta + 2)\ln n \rceil$ dimensions.