On the uniformity of film thickness on rotating spherical substrates on a planar work holder

Curves for the uniformity in film thickness on spherical substrates are drawn for various geometries. The optimum source-to-substrate height for maximum uniformity of the film thickness is determined. These data are approximated to achieve uniform thickness on a large number of small planar substrates loaded on a large spherical substrate holder, the appropriate geometry being selected on the basis of the radius of curvature of the substrate holder.

A method for estimation of the radius of elastic-plastic boundary around cold-worked holes

The radius of an elastic-plastic boundary was measured by the strain gage method around the cold-worked region in L72-aluminum alloy. The relative radial expansion was varied from 2.5 to 6.5 percent during the cold-working process using mandrel and split sleeve. The existing theoretical studies in this area are reviewed. The experimental results are compared with existing experimental data of various investigators and with various theoretical formulations. A model is developed to predict the radius of elastic-plastic boundary, and the model is assessed by comparing with the present experiments.

HELANAL: A program to characterise helix geometry in proteins,

A detailed analysis of structural and position dependent characteristic features of helices will give a better understanding of the secondary structure formation in globular proteins. Here we describe an algorithm that quantifies the geometry of helices in proteins on the basis of their C-alpha atoms alone. The Fortran program HELANAL can extract the helices from the PDB files and then characterises the overall geometry of each helix as being linear, curved or kinked, in terms of its local structural features, viz. local helical twist and rise, virtual torsion angle, local helix origins and bending angles between successive local helix axes. Even helices with large radius of curvature are unambiguously identified as being linear or curved. The program can also be used to differentiate a kinked helix and other motifs, such as helix-loop-helix or a helix-turn-helix (with a single residue linker) with the help of local bending angles. In addition to these, the program can also be used to characterise the helix start and end as well as other types of secondary structures.

Photocatalytic inactivation of Escherischia coli and Pichia pastoris with combustion synthesized titanium dioxide

The photocatalytic inactivation of Escherischia coli and Pichia Pastoris was studied with combustion synthesized titanium dioxide photocatalysts Three different combustion synthesized (CS) catalysts were used viz CS-TiO2 1% Ag substituted in TiO2 and 1% Ag impregnated in TiO2 All the combustion synthesized catalysts showed higher activity as compared to the activity observed with commercial Degussa P-25 TiO2 The effect of various parameters like catalyst loading different catalysts and initial cell concentration was studied At the optimum loading 1% Ag impregnated TiO2 showed the maximum efficiency and complete inactivation of both the microorganisms was observed within an hour of irradiation The morphology of inactivated cells was studied by inverted microscope and SEM From the images obtained it was hypothesized that damage to the cell wall was the main cause of cell inactivation The initial cell concentration had a prominent effect on the inactivation At a low initial cell concentration the complete inactivation of E cob and P pastoris was observed within 10 and 20 min respectively This shows that P pastoris has a stronger resistance towards photocatalytic inactivation than E cols The inactivation reactions were modeled with power law kinetics The order of reaction in case of E colt and P pastoris were determined as 1 20 and 1 08 respectively (C) 2010 Elsevier B V All rights reserved

Nature of Cl center dot center dot center dot Cl Intermolecular Interactions via Experimental and Theoretical Charge Density Analysis:Correlation of Polar Flattening Effects with Geometry

The experimental charge density distribution in three compounds, 2-chloro-3-quinolinyl methanol, 2-chloro-3-hydroxypyridine, and 2-chloro-3-chloromethyl-8-methylquinoline, has been obtained using high-resolution X-ray diffraction data collected at 100 K based on the aspherical multipole modeling of electron density. These compounds represent type I (cis), type I (trans), and type II geometries, respectively, as defined for short Cl center dot center dot center dot Cl interactions. The experimental results are compared with the theoretical charge densities using theoretical structure factors obtained from a periodic quantum calculation at the B3LYP/6-31G** level. The topological features derived from the Bader's theory of atoms in molecules (AIM) approach unequivocally suggest that both cis and trans type I geometries show decreased repulsion, whereas type II geometry is attractive based on the nature of polar flattening of the electron density around the Cl atom.

A System-C based Micro architectural Exploration Framework for Latency, Power and Performance Trade-offs of On-Chip Interconnection

We describe a System-C based framework we are developing, to explore the impact of various architectural and microarchitectural level parameters of the on-chip interconnection network elements on its power and performance. The framework enables one to choose from a variety of architectural options like topology, routing policy, etc., as well as allows experimentation with various microarchitectural options for the individual links like length, wire width, pitch, pipelining, supply voltage and frequency. The framework also supports a flexible traffic generation and communication model. We provide preliminary results of using this framework to study the power, latency and throughput of a 4x4 multi-core processing array using mesh, torus and folded torus, for two different communication patterns of dense and sparse linear algebra. The traffic consists of both Request-Response messages (mimicing cache accesses)and One-Way messages. We find that the average latency can be reduced by increasing the pipeline depth, as it enables higher link frequencies. We also find that there exists an optimum degree of pipelining which minimizes energy-delay product.

Generalized distributive law for ML decoding of STBCs

The Generalized Distributive Law (GDL) is a message passing algorithm which can efficiently solve a certain class of computational problems, and includes as special cases the Viterbi's algorithm, the BCJR algorithm, the Fast-Fourier Transform, Turbo and LDPC decoding algorithms. In this paper GDL based maximum-likelihood (ML) decoding of Space-Time Block Codes (STBCs) is introduced and a sufficient condition for an STBC to admit low GDL decoding complexity is given. Fast-decoding and multigroup decoding are the two algorithms used in the literature to ML decode STBCs with low complexity. An algorithm which exploits the advantages of both these two is called Conditional ML (CML) decoding. It is shown in this paper that the GDL decoding complexity of any STBC is upper bounded by its CML decoding complexity, and that there exist codes for which the GDL complexity is strictly less than the CML complexity. Explicit examples of two such families of STBCs is given in this paper. Thus the CML is in general suboptimal in reducing the ML decoding complexity of a code, and one should design codes with low GDL complexity rather than low CML complexity.

A coupled VOF-IBM-enthalpy approach for modeling motion and growth of equiaxed dendrites in a solidifying melt

A coupled methodology for simulating the simultaneous growth and motion of equiaxed dendrites in solidifying melts is presented. The model uses the volume-averaging principles and combines the features of the enthalpy method for modeling growth, immersed boundary method for handling the rigid solid-liquid interfaces, and the volume of fluid method for tracking the advection of the dendrite. The algorithm also performs explicit-implicit coupling between the techniques used. A two-dimensional framework with incompressible and Newtonian fluid is considered. Validation with available literature is performed and dendrite growth in the presence of rotational and buoyancy driven flow fields is studied. It is seen that the flow fields significantly alter the position and morphology of the dendrites. (C) 2012 Elsevier Inc. All rights reserved.

Scaling analysis: Equivalence of convective and radiative heating of levitated droplet

This letter develops theoretical relationships for equilibrium timescale and temperature scale of a vaporizing droplet in a convective and a radiative environment. The transient temperature normalized by the respective scales exhibits a unified profile for both modes of heating. The analysis allows for the prediction of the required laser flux to show its equivalence in a corresponding heated gas stream. The theoretical equivalence shows good agreement with experiments across a range of droplet sizes. Simple experiments can be conducted in a levitator to extrapolate information in realistic convective environments like combustion and spray drying. (C) 2012 American Institute of Physics. http://dx.doi.org/10.1063/1.4720092]

Duty cycling and power management with a network of energy harvesting sensors

In this paper, we study duty cycling and power management in a network of energy harvesting sensor (EHS) nodes. We consider a one-hop network, where K EHS nodes send data to a destination over a wireless fading channel. The goal is to find the optimum duty cycling and power scheduling across the nodes that maximizes the average sum data rate, subject to energy neutrality at each node. We adopt a two-stage approach to simplify the problem. In the inner stage, we solve the problem of optimal duty cycling of the nodes, subject to the short-term power constraint set by the outer stage. The outer stage sets the short-term power constraints on the inner stage to maximize the long-term expected sum data rate, subject to long-term energy neutrality at each node. Albeit suboptimal, our solutions turn out to have a surprisingly simple form: the duty cycle allotted to each node by the inner stage is simply the fractional allotted power of that node relative to the total allotted power. The sum power allotted is a clipped version of the sum harvested power across all the nodes. The average sum throughput thus ultimately depends only on the sum harvested power and its statistics. We illustrate the performance improvement offered by the proposed solution compared to other naive schemes via Monte-Carlo simulations.

Proportional resonant controller based circulating power setup for thermal testing of multilevel inverter

A regenerative or circulating-power method is presented in this paper for heat run test on the legs of a three-level neutral point clamped (NPC) inverter. This test ensures that only losses are drawn from the dc supply, while rated power is circulated between the two legs, thus minimising wastage of energy. A proportional-resonant (PR) controller based current control scheme is proposed here for the circulating power test setup in NPC inverter. Simulation and experimental results are presented to validate the controller design at various operating conditions. Results of thermal test on the inverter legs are presented at two different operating conditions.

Generalized distributive law for ML decoding of space-time block codes

The problem of designing good space-time block codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well-known technique of decoding STBCs as conditional ML (CML) decoding. In this paper, we introduce a new framework to construct ML decoders for STBCs based on the generalized distributive law (GDL) and the factor-graph-based sum-product algorithm. We say that an STBC is fast GDL decodable if the order of GDL decoding complexity of the code, with respect to the constellation size, is strictly less than M-lambda, where lambda is the number of independent symbols in the STBC. We give sufficient conditions for an STBC to admit fast GDL decoding, and show that both multigroup and conditionally multigroup decodable codes are fast GDL decodable. For any STBC, whether fast GDL decodable or not, we show that the GDL decoding complexity is strictly less than the CML decoding complexity. For instance, for any STBC obtained from cyclic division algebras which is not multigroup or conditionally multigroup decodable, the GDL decoder provides about 12 times reduction in complexity compared to the CML decoder. Similarly, for the Golden code, which is conditionally multigroup decodable, the GDL decoder is only half as complex as the CML decoder.

Generalized distributive law for ML decoding of STBCs: further results

The problem of designing good Space-Time Block Codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well known technique of decoding STBCs as Conditional ML (CML) decoding. In [1], we introduced a framework to construct ML decoders for STBCs based on the Generalized Distributive Law (GDL) and the Factor-graph based Sum-Product Algorithm, and showed that for two specific families of STBCs, the Toepltiz codes and the Overlapped Alamouti Codes (OACs), the GDL based ML decoders have strictly less complexity than the CML decoders. In this paper, we introduce a `traceback' step to the GDL decoding algorithm of STBCs, which enables roughly 4 times reduction in the complexity of the GDL decoders proposed in [1]. Utilizing this complexity reduction from `traceback', we then show that for any STBC (not just the Toeplitz and Overlapped Alamouti Codes), the GDL decoding complexity is strictly less than the CML decoding complexity. For instance, for any STBC obtained from Cyclic Division Algebras that is not multigroup or conditionally multigroup decodable, the GDL decoder provides approximately 12 times reduction in complexity compared to the CML decoder. Similarly, for the Golden code, which is conditionally multigroup decodable, the GDL decoder is only about half as complex as the CML decoder.