Study of the growth of capped ZnO nanocrystals: A route to rational synthesis

We report the study of complex and unexpected dependencies of nanocrystal size as well as nanocrystalsize distribution on various reaction parameters in the synthesis of ZnO nanocrystals using poly(vinyl pyrollidone) (PVP) as a capping agent. This method establishes a qualitatively different growth mechanism to the anticipated Ostwald ripening behavior. The study of size-distribution kinetics and an understanding of the observed non-monotonic behaviors provides a route to rational synthesis. We used a simple, but accurate, approach to estimate the size-distribution function of nanocrystals from the UV-absorption spectrum. Our results demonstrate the accuracy and generality of this approach, and we also illustrate its application to various semiconducting nanocrystals, such as ZnO, ZnS, and CdSe, over a wide size range (1.8-5.3 nm).

Efficient algorithms for domination and Hamilton circuit problems on permutation graphs

The domination and Hamilton circuit problems are of interest both in algorithm design and complexity theory. The domination problem has applications in facility location and the Hamilton circuit problem has applications in routing problems in communications and operations research.The problem of deciding if G has a dominating set of cardinality at most k, and the problem of determining if G has a Hamilton circuit are NP-Complete. Polynomial time algorithms are, however, available for a large number of restricted classes. A motivation for the study of these algorithms is that they not only give insight into the characterization of these classes but also require a variety of algorithmic techniques and data structures. So the search for efficient algorithms, for these problems in many classes still continues.A class of perfect graphs which is practically important and mathematically interesting is the class of permutation graphs. The domination problem is polynomial time solvable on permutation graphs. Algorithms that are already available are of time complexity O(n2) or more, and space complexity O(n2) on these graphs. The Hamilton circuit problem is open for this class.We present a simple O(n) time and O(n) space algorithm for the domination problem on permutation graphs. Unlike the existing algorithms, we use the concept of geometric representation of permutation graphs. Further, exploiting this geometric notion, we develop an O(n2) time and O(n) space algorithm for the Hamilton circuit problem.

An efficient reduction algorithm for computation of interconnect delay variability for statistical timing analysis in clock tree planning

In this paper, we propose a novel and efficient algorithm for modelling sub-65 nm clock interconnect-networks in the presence of process variation. We develop a method for delay analysis of interconnects considering the impact of Gaussian metal process variations. The resistance and capacitance of a distributed RC line are expressed as correlated Gaussian random variables which are then used to compute the standard deviation of delay Probability Distribution Function (PDF) at all nodes in the interconnect network. Main objective is to find delay PDF at a cheaper cost. Convergence of this approach is in probability distribution but not in mean of delay. We validate our approach against SPICE based Monte Carlo simulations while the current method entails significantly lower computational cost.

A Computationally Efficient PWM Algorithm for Multilevel Inverters

Centred space vector PWM (CSVPWM) technique is popularly used for three level voltage source inverters. The reference voltage vector is synthesized by time-averaging of the three nearest voltage vectors produced by the inverter. Identifying the three voltage vectors, and calculation of the dwelling time for each vector are both computationally intensive. This paper analyses the process of PWM generation in CSVPWM. This analysis breaks up a three-level inverter into six different conceptual two level inverters in different regions of the fundamental cycle. Control of 3-level inverter is viewed as the control of the appropriate 2-level inverter. The analysis leads to a systematic simplification of the computations involved, finally resulting in a computationally efficient PWM algorithm. This algorithm exploits the equivalence between triangle comparison and space vector approaches to PWM generation. This algorithm does not involve any 3-phase/2-phase or 2-phase/3-phase transformation. This also does not involve any transformation from rectangular to polar coordinates, and vice versa. Further no evaluation of trigonometric functions is necessary. This algorithm also provides for the mitigation of DC neutral point unbalance, and is well suited to digital implementation. Simulation and experimental results are presented.

Pd Supported on Titanium Nitride for Efficient Ethanol Oxidation

The excellent metal support interaction between palladium (Pd) and titanium nitride (TiN) is exploited in designing an efficient anode material. Pd-TN, that could be useful for direct ethanol fuel cell in alkaline media. The physicochemical and electrochemical characterization of the Pd-TiN/electrolyte interface reveals an efficient oxidation of ethanol coupled with excellent stability of the catalyst under electrochemical conditions. Characterization of the interface using in situ Fourier transform infrared spectroscopy (in situ FITR) shows the production CO2 at low overvoltages revealing an efficient cleaving of the C-C bond. The performance comparison of Pd supported on TiN (Pd-TiN) with that supported on carbon (Pd-C) clearly demonstrates the advantages of TiN support over carbon. A positive chemical shift of Pd (3d) binding energy confirms the existence of metal support interaction between pd and TiN, which in turn helps weaken the Pd-CO synergetic bonding interaction. The remarkable ability of TiN to accumulate -OH species on its surface coupled with the strong adhesion of Pd makes TiN an active support material for electrocatalysts.

A regio and stereospecific radical annulation route to chiral tricyclo[4.3.1.o3,7]decane (isotwistane) system1 synthesis of (+)-10-α-Naphthyl-5-epi-Pupukean-9-one

Contrary to that of phenyl derivative 1 the radical 4 adds to radicophiles in an inter- followed by intra-molecular radical Michael addition (radical annulation), furnishing a novel route to chiral isotwistanes 5.

Synthetic studies in aromatic hemiterpenes of natural origin, Part 5: Synthesis of 6-acetyl-2,2-dimethyl-8-methoxychromene via benzylic oxidation route

The synthesis of 6-acetyl-2,2-dimethyl-8-methoxychromene (lc), a naturally occurring isomer of encecalin (la)h~s been described startilag from 2,2,6- trimethyl-8-methoxyclaromene (2e) which was obtained from creosol (4) in two steps involving condensation of the phenol with malic acid to the coumarin (3), followed by Grignard reaction with CHaMgI. The transformation of (2e) to the natural product (lc) was effeeted by oxidative dehydrogenation by DDQ of the 6-meth~r function to the formyl group (2f), Grignard reaction to the carbinol (2g) and finally its oxidation to the acetyl moiety (lc), the sequence of the essential steps schematically summarised as : Ar-CHs --* Ar-CHO --* Ar-CH (OH) CHs --* Ar---COCHs.

Extended colored Petri net: An efficient tool for analyzing concurrent systems

This paper proposes a novel and simple definition of general colored Petri nets. This definition is coherent with that of (uncolored) Petri nets, preserves the reflexivity of the original net and is extended to represent inhibitors. Also suggested are systematic and formal merging rules to obtain a well-formed structure of the extended colored Petri net by folding a given uncolored net. Finally, we present a technique to compute colored invariants by selecting colored RP-subnets. On the average, the proposed technique performs better than the existing ones. The analysis procedure is explained through an illustrative example of a three-level interrupt-priority-handler scheme.

A Novel, Balanced, and Energy-Efficient Training Method for Receive Antenna Selection

In receive antenna selection (AS), only signals from a subset of the antennas are processed at any time by the limited number of radio frequency (RF) chains available at the receiver. Hence, the transmitter needs to send pilots multiple times to enable the receiver to estimate the channel state of all the antennas and select the best subset. Conventionally, the sensitivity of coherent reception to channel estimation errors has been tackled by boosting the energy allocated to all pilots to ensure accurate channel estimates for all antennas. Energy for pilots received by unselected antennas is mostly wasted, especially since the selection process is robust to estimation errors. In this paper, we propose a novel training method uniquely tailored for AS that transmits one extra pilot symbol that generates accurate channel estimates for the antenna subset that actually receives data. Consequently, the transmitter can selectively boost the energy allocated to the extra pilot. We derive closed-form expressions for the proposed scheme's symbol error probability for MPSK and MQAM, and optimize the energy allocated to pilot and data symbols. Through an insightful asymptotic analysis, we show that the optimal solution achieves full diversity and is better than the conventional method.

Studies of phosphazenes. Part 33. Thermal rearrangement of alkoxy(p-methylphenoxy)cyclophosphazenes: a synthetic route to oxocyclophosphazanes, phosphazadienes and phosphaz-1-enes

The aryloxy(alkoxy)cyclotriphosphazenes N3P3(OR)6�m(OC6H4Me-p)n(R = Me, n= 1�3; R = Et or CH2Ph, n= 3) rearrange on heating to give trioxocyclotriphosphazanes; the di- and mono-methoxy derivatives, N3P3(OMe)6�n(OC6H4Me-p)n(n= 4 or 5), yield dioxophosphaz-1-enes and an oxophosphazadiene respectively. The 1H, 13C and 31P NMR data for the starting materials and the products are presented. No evidence has been found for partially rearranged products. The geometrical disposition of the aryloxy groups in the starting material is retained in the rearranged products. Some aspects of the mechanism of the thermal rearrangement are discussed.

Energy efficient asymmetric binary search switching technique for SAR ADC

An asymmetric binary search switching technique for a successive approximation register (SAR) ADC is presented, and trade-off between switching energy and conversion cycles is discussed. Without using any additional switches, the proposed technique consumes 46% less switching energy, for a small input swing (0.5 V-ref (P-P)), as compared to the last reported efficient switching technique in literature for an 8-bit SAR ADC. For a full input swing (2 V-ref (P-P)), the proposed technique consumes 16.5% less switching energy.

Platinum particles supported on titanium nitride: an efficient electrode material for the oxidation of methanol in alkaline media

In the present study, titanium nitride which shows exceptional stability, extreme corrosion resistance, good electronic conductivity and adhesion behaviour is used to support platinum particles and then used for methanol oxidation in an alkaline medium. The catalyst shows very good CO tolerance for the electrochemical oxidation of methanol. In situ infrared spectroelectrochemical data show the remarkable ability of TiN to decompose water at low over potentials leading to -OH type functional groups on its surface which in turn help in alleviating the carbon monoxide poisoning associated with methanol oxidation. TiN supported catalysts are found to be very good in terms of long term stability, exchange current density and stable currents at low over voltages. Supporting evidence from X-ray photoelectron spectroscopic data and cyclic voltammetry clearly demonstrates the usefulness of TiN supported Pt catalysts for efficient methanol oxidation in alkaline media.

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.