Partial Integrated Guidance and Control of Surface-to-Air Interceptors for High Speed Targets

An important limitation of the existing IGC algorithms, is that they do not explicitly exploit the inherent time scale separation that exist in aerospace vehicles between rotational and translational motions and hence can be ineffective. To address this issue, a two-loop partial integrated guidance and control (PIGC) scheme has been proposed in this paper. In this design, the outer loop uses a recently developed, computationally efficient, optimal control formulation named as model predictive static programming. It gives the commanded pitch and yaw rates whereas necessary roll-rate command is generated from a roll-stabilization loop. The inner loop tracks the outer loop commands using the Dynamic inversion philosophy. Uncommonly, Six-Degree of freedom (Six-DOF) model is used directly in both the loops. This intelligent manipulation preserves the inherent time scale separation property between the translational and rotational dynamics, and hence overcomes the deficiency of current IGC designs, while preserving its benefits. Comparative studies of PIGC with one loop IGC and conventional three loop design were carried out for engaging incoming high speed target. Simulation studies demonstrate the usefulness of this method.

Effect of oxygen partial pressure on the growth of zinc micro and nanostructures

Zinc micro and nanostructures were synthesized in vacuum by condensing evaporated zinc on Si substrate at different gas pressures. The morphology of the grown Zn structures was found to be dependent on the oxygen partial pressure. Depending on oxygen partial pressure it varied from two-dimensional microdisks to one-dimensional nanowire. The morphology and structural properties of the grown micro and nanostructures were studied by scanning electron microscopy (SEM) and X-ray diffraction (XRD). Transmission electron microscopy (TEM) studies on the grown Zn nanowires have shown that they exhibit core/shell-like structures, where a thin ZnO layer forms the shell. A possible growth mechanism behind the formation of different micro and nanostructures has been proposed. In addition, we have synthesized ZnO nanocanal-like structures by annealing Zn nanowires in vacuum at 350 °C for 30 min.

Effect of oxygen partial pressure on the structural and optical properties of dc reactive magnetron sputtered molybdenum oxide films

Molybdenum oxide films (MoO3) were deposited on glass and crystalline silicon substrates by sputtering of molybdenum target under various oxygen partial pressures in the range 8 × 10−5–8 × 10−4 mbar and at a fixed substrate temperature of 473 K employing dc magnetron sputtering technique. The influence of oxygen partial pressure on the composition stoichiometry, chemical binding configuration, crystallographic structure and electrical and optical properties was systematically studied. X-ray photoelectron spectra of the films formed at 8 × 10−5 mbar showed the presence of Mo6+ and Mo5+ oxidation states of MoO3 and MoO3−x. The films deposited at oxygen partial pressure of 2 × 10−4 mbar showed Mo6+ oxidation state indicating the films were nearly stoichiometric. It was also confirmed by the Fourier transform infrared spectroscopic studies. X-ray diffraction studies revealed that the films formed at oxygen partial pressure of 2 × 10−4 mbar showed the presence of (0 k 0) reflections indicated the layered structure of α-phase MoO3. The electrical conductivity of the films decreased from 3.6 × 10−5 to 1.6 × 10−6 Ω−1 cm−1, the optical band gap of the films increased from 2.93 to 3.26 eV and the refractive index increased from 2.02 to 2.13 with the increase of oxygen partial pressure from 8 × 10−5 to 8 × 10−4 mbar, respectively.

On the Structure of Contractible Edges in k-connected Partial k-trees

Contraction of an edge e merges its end points into a new single vertex, and each neighbor of one of the end points of e is a neighbor of the new vertex. An edge in a k-connected graph is contractible if its contraction does not result in a graph with lesser connectivity; otherwise the edge is called non-contractible. In this paper, we present results on the structure of contractible edges in k-trees and k-connected partial k-trees. Firstly, we show that an edge e in a k-tree is contractible if and only if e belongs to exactly one (k + 1) clique. We use this characterization to show that the graph formed by contractible edges is a 2-connected graph. We also show that there are at least |V(G)| + k - 2 contractible edges in a k-tree. Secondly, we show that if an edge e in a partial k-tree is contractible then e is contractible in any k-tree which contains the partial k-tree as an edge subgraph. We also construct a class of contraction critical 2k-connected partial 2k-trees.

An update on the thermodynamics of Ta2O5

Using a solid-state electrochemical cell incorporating yttria-doped thoria (YDT) as the electrolyte and a mixture of (Mn + MnO) as the reference electrode, standard Gibbs free energy of formation of beta-Ta2O5 has been determined as a function of temperature in the range (1000 to 1300) K. The solid-state electrochemical cell used can be represented as (-)Pt,Ta +Ta2O5//(Y2O3)ThO2//Mn + MnO, Pt(+) Combining the reversible e.m.f. of the cell with recent data on the free energy of formation of MnO, standard Gibbs free energy of formation of Ta2O5 from Ta metal and diatomic oxygen gas (O-2) in the temperature range (1000 to 1300) K is obtained: Delta fG degrees +/- 0.35/(kJ.mol(-1)) = -2004.376 + 0.40445(T/K). Because of the significant solid solubility of oxygen in tantalum, a small correction for the activity of Ta in the metal phase in equilibrium with Ta2O5 is applied. An analysis of the results obtained in this study and other free energy data reported in the literature by the "third law" method suggests the need for refining data for Ta2O5 reported in thermodynamic compilations. Used in the analysis is a revised value for standard entropy of Ta2O5 based on more recent low-temperature heat capacity measurements. An improved set of thermodynamic properties of ditantalum pentoxide (Ta2O5) are presented in the temperature range (298.15 to 2200) K. (C) 2008 Elsevier Ltd. All rights reserved.

Distributed space-time codes for cooperative networks with partial CSI

Design criteria and full-diversity Distributed Space Time Codes (DSTCs) for the two phase transmission based cooperative diversity protocol of Jing-Hassibi and the Generalized Nonorthogonal Amplify and Forward (GNAF) protocol are reported, when the relay nodes are assumed to have knowledge of the phase component of the source to relay channel gains. It is shown that this under this partial channel state information (CSI), several well known space time codes for the colocated MIMO (Multiple Input Multiple Output) channel become amenable for use as DSTCs. In particular, the well known complex orthogonal designs, generalized coordinate interleaved orthogonal designs (GCIODs) and unitary weight single symbol decodable (UW-SSD) codes are shown to satisfy the required design constraints for DSTCs. Exploiting the relaxed code design constraints, we propose DSTCs obtained from Clifford Algebras which have low ML decoding complexity.

Low PAPR STBCs from Complex Partial-Orthogonal Designs (CPODs)

Space-time codes from complex orthogonal designs (CODs) with no zero entries offer low Peak to Average power ratio (PAPR) and avoid the problem of turning off antennas. But CODs for 2(a) antennas with a + 1 complex variables, with no zero entries are not known in the literature for a >= 4. In this paper, a method of obtaining no zero entry (NZE) codes, called Complex Partial-Orthogonal Designs (CPODs), for 2(a+1) antennas whenever a certain type of NZE code exists for 2(a) antennas is presented. This is achieved with slight increase in the ML decoding complexity for regular QAM constellations and no increase for other complex constellations. Since NZE CODs have been constructed recently for 8 antennas our method leads to NZE CPODs for 16 antennas. Moreover, starting from certain NZE CPODs for n antennas, a construction procedure is given to obtain NZE CPODs for 2n antennas. The class of CPODs do not offer full-diversity for all complex constellations. For the NZE CPODs presented in the paper, conditions on the signal sets which will guarantee full-diversity are identified. Simulations results show that bit error performance of our codes under average power constraint is same as that of the CODs and superior to CODs under peak power constraint.

Nucleotidases in plants : I. Partial purification and properties of the enzyme hydrolyzing flavine adenine dinucleotide from mung bean seedlings (Phaseolus radiatus)

The occurrence of an enzyme hydrolyzing flavine adenine dinucleotide (FAD) was demonstrated in a number of seed extracts. The enzyme from Phaseolus radiatus was purified 104-fold by fractionation with ammonium sulfate and ethanol and by negative adsorption on alumina Cγ gel. The enzyme cleaves the POP bond of FAD to yield flavine mononucleotide and adenosine monophosphate. When reduced glutathione is added to the enzyme, it cleaves FAD at the COP bond to yield riboflavine, adenosine, and pyrophosphate, Both the activities are optimal at a pH of 7.2 and at a temperature of 37 . The Km for both the activities is 1.65 × 10−5 M. The stoichiometry and the identity of the products of both the treated and untreated enzyme were established. The untreated enzyme was not inhibited by pCMB or arsenite, but the treated enzyme was sensitive to both these inhibitors. The inhibition by pCMB could be reversed by monothiols and the inhibition by arsenite by dithiols.

Self-regularized pseudo time-marching schemes for structural system identification with static measurements

We explore the application of pseudo time marching schemes, involving either deterministic integration or stochastic filtering, to solve the inverse problem of parameter identification of large dimensional structural systems from partial and noisy measurements of strictly static response. Solutions of such non-linear inverse problems could provide useful local stiffness variations and do not have to confront modeling uncertainties in damping, an important, yet inadequately understood, aspect in dynamic system identification problems. The usual method of least-square solution is through a regularized Gauss-Newton method (GNM) whose results are known to be sensitively dependent on the regularization parameter and data noise intensity. Finite time,recursive integration of the pseudo-dynamical GNM (PD-GNM) update equation addresses the major numerical difficulty associated with the near-zero singular values of the linearized operator and gives results that are not sensitive to the time step of integration. Therefore, we also propose a pseudo-dynamic stochastic filtering approach for the same problem using a parsimonious representation of states and specifically solve the linearized filtering equations through a pseudo-dynamic ensemble Kalman filter (PD-EnKF). For multiple sets of measurements involving various load cases, we expedite the speed of thePD-EnKF by proposing an inner iteration within every time step. Results using the pseudo-dynamic strategy obtained through PD-EnKF and recursive integration are compared with those from the conventional GNM, which prove that the PD-EnKF is the best performer showing little sensitivity to process noise covariance and yielding reconstructions with less artifacts even when the ensemble size is small.

Self-regularized pseudo time-marching schemes for structural system identification with static measurements

We explore the application of pseudo time marching schemes, involving either deterministic integration or stochastic filtering, to solve the inverse problem of parameter identification of large dimensional structural systems from partial and noisy measurements of strictly static response. Solutions of such non-linear inverse problems could provide useful local stiffness variations and do not have to confront modeling uncertainties in damping, an important, yet inadequately understood, aspect in dynamic system identification problems. The usual method of least-square solution is through a regularized Gauss-Newton method (GNM) whose results are known to be sensitively dependent on the regularization parameter and data noise intensity. Finite time, recursive integration of the pseudo-dynamical GNM (PD-GNM) update equation addresses the major numerical difficulty associated with the near-zero singular values of the linearized operator and gives results that are not sensitive to the time step of integration. Therefore, we also propose a pseudo-dynamic stochastic filtering approach for the same problem using a parsimonious representation of states and specifically solve the linearized filtering equations through apseudo-dynamic ensemble Kalman filter (PD-EnKF). For multiple sets ofmeasurements involving various load cases, we expedite the speed of the PD-EnKF by proposing an inner iteration within every time step. Results using the pseudo-dynamic strategy obtained through PD-EnKF and recursive integration are compared with those from the conventional GNM, which prove that the PD-EnKF is the best performer showing little sensitivity to process noise covariance and yielding reconstructions with less artifacts even when the ensemble size is small. Copyright (C) 2009 John Wiley & Sons, Ltd.

Studies on the enzyme hydrolysing flavin mononucleotide in plants: I. Partial purification and properties of the enzyme from Phaseolus radiatus

The partial purification of the enzyme hydrolysing FMN from extracts of greengram seeds (Phaseolus radiatus) is described. The procedures, which entailed precipitation of inert material by manganous sulfate and protamine sulfate treatment, fractional precipitation with alcohol and chromatography on CM-cellulose, afforded preparations whose specific activity was 200 times that of the initial crude extract. The preparation was comparatively specific for FMN. It also hydrolysed, to a much smaller extent, β-glycerophosphate, p-nitrophenyl phosphate and 5′-nucleotides. The differential effects of ions on the FMN and β-glycerophosphate hydrolysing activities are discussed.

Studies on the enzyme hydrolysing flavin mononucleotide in plants. I. Partial purification and properties of the enzyme from Phaseolus radiatus

The partial purification of the enzyme hydrolysing FMN from extracts of greengram seeds (Phaseolus radiatus) is described. The procedures, which entailed precipitation of inert material by manganous sulfate and protamine sulfate treatment, fractional precipitation with alcohol and chromatography on CM-cellulose, afforded preparations whose specific activity was 200 times that of the initial crude extract. The preparation was comparatively specific for FMN. It also hydrolysed, to a much smaller extent, β-glycerophosphate, p-nitrophenyl phosphate and 5′-nucleotides. The differential effects of ions on the FMN and β-glycerophosphate hydrolysing activities are discussed.

Isolation and partial characterization of sheep plasma α1-mucoprotein

1. 1. Sheep plasma α1-mucoprotein was isolated in an electrophoretically homogeneous state by a combination of ammonium sulphate saturation, isoelectric precipitation and preparative agar electrophoresis in a yield of approx. 150 mg/l of plasma. 2. 2. The mucoprotein was water-soluble, non-coagulable on heating at 100°, not precipitable by 1.8 M perchloric acid, 10% trichloroacetic acid but precipitable by saturated ammonium sulphate solution, 0.6 M sulfosalicylic acid and 5% phosphotungstic acid in 2 N HCl. It had E1 cm1 % value of 9.57 at 278 mμ in water, refractive-index index increment 1.9·10-4 (g/l) in water, isoelectric point at pH 4.45 (sodium acetate-acetic acid buffer) and was homogeneous in pH range 4.0-11.5 but at pH values 2.6 and 3.5 showed some dissociation. 3. 3. The mucoprotein had the following chemical composition: Nitrogen, 12.4%; polypeptide, 77.4%; total hexose (only mannose and galactose), 7.1%; fucose, 1.0%; glucosamine, 4.9% and sialic acid, 4.8%. It had no N-terminal amino acid.

Studies on nucleotide pyrophosphatase I. Partial purification and properties of a sheep liver enzyme that catalyzes the hydrolysis of dinucleotides

A partially purified sheep liver enzyme that hydrolyzed dinucleotides at the pyrophosphate bond was obtained by solubilizing the 18,000g sediment with n-butanol and fractionating the solubilized enzyme with acetone. The enzyme activity when measured using FAD as substrate, (FAD → FMN + AMP), was optimal at pH 9.7 and temperatures between 30 °–36 ° and at 60 °. The rate of release of FMN with time occurred with an initial lag of 30 sec, a linear increase for 1 min, and a subsequent irregular rate. In the presence of orthophosphate (Pi; 10 μImage ), FMN was released at an uniformly continuous and enhanced rate. 32Pi was not incorporated into the substrate or products. Sodium arsenate counteracted the effects of Pi. The apparent Km and Vmax were 0.133 mImage and 100 units; and 0.133 mImage and 200 units, in the absence and presence of Pi, respectively. The temperature optimum was 42 ° in the presence of Pi.Negative cooperative interactions observed at low concentrations of FAD were abolished by the addition of Pi. The inhibition by AMP was sigmoid and Pi abolished this sigmoidal response. The enzyme hydrolyzed in addition to FAD, NAD+ and NADP+. Nucleoside triphosphates were potent inhibitors of the enzyme activity. The partial inhibition of the enzyme by o-phenanthroline and by p-hydroxymercuribenzoate could be reversed by Fe2+ ions and by reduced glutathione, respectively.

Voting Paths

We consider a variant of the popular matching problem here. The input instance is a bipartite graph $G=(\mathcal{A}\cup\mathcal{P},E)$, where vertices in $\mathcal{A}$ are called applicants and vertices in $\mathcal{P}$ are called posts. Each applicant ranks a subset of posts in an order of preference, possibly involving ties. A matching $M$ is popular if there is no other matching $M'$ such that the number of applicants who prefer their partners in $M'$ to $M$ exceeds the number of applicants who prefer their partners in $M$ to $M'$. However, the “more popular than” relation is not transitive; hence this relation is not a partial order, and thus there need not be a maximal element here. Indeed, there are simple instances that do not admit popular matchings. The questions of whether an input instance $G$ admits a popular matching and how to compute one if it exists were studied earlier by Abraham et al. Here we study reachability questions among matchings in $G$, assuming that $G=(\mathcal{A}\cup\mathcal{P},E)$ admits a popular matching. A matching $M_k$ is reachable from $M_0$ if there is a sequence of matchings $\langle M_0,M_1,\dots,M_k\rangle$ such that each matching is more popular than its predecessor. Such a sequence is called a length-$k$ voting path from $M_0$ to $M_k$. We show an interesting property of reachability among matchings in $G$: there is always a voting path of length at most 2 from any matching to some popular matching. Given a bipartite graph $G=(\mathcal{A}\cup\mathcal{P},E)$ with $n$ vertices and $m$ edges and any matching $M_0$ in $G$, we give an $O(m\sqrt{n})$ algorithm to compute a shortest-length voting path from $M_0$ to a popular matching; when preference lists are strictly ordered, we have an $O(m+n)$ algorithm. This problem has applications in dynamic matching markets, where applicants and posts can enter and leave the market, and applicants can also change their preferences arbitrarily. After any change, the current matching may no longer be popular, in which case we are required to update it. However, our model demands that we switch from one matching to another only if there is consensus among the applicants to agree to the switch. Hence we need to update via a voting path that ends in a popular matching. Thus our algorithm has applications here.