Equivalent Circuit Analysis of Serpentine Folded-waveguide Slow-wave Structures for Millimeter-wave Traveling-wave Tubes

A simple equivalent circuit model for the analysis of dispersion and interaction impedance characteristics of serpentine folded-waveguide slow-wave structure was developed by considering the straight and curved portions of structure supporting the dominant TE10-mode of the rectangular waveguide. Expressions for the lumped capacitance and inductance per period of the slow-wave structure were derived in terms of the physical dimensions of the structure, incorporating the effects of the beam-hole in the lumped parameters. The lumped parameters were subsequently interpreted for obtaining the dispersion and interaction impedance characteristics of the structure. The analysis was simple yet accurate in predicting the dispersion and interaction impedance behaviour at millimeter-wave frequencies. The analysis was benchmarked against measurement as well as with 3D electromagnetic modeling using MAFIA for two typical slow-wave structures (one at the Ka-band and the other at the W-band) and close agreement observed.

Analysis of Rectangular Folded-Waveguide Millimeter-Wave Slow-wave Structures using Conformal Transformations

An analysis of rectangular folded-waveguide slow-wave structure was developed using conformal mapping technique through Schwarz's polygon transformation and closed form expressions for the lumped capacitance and inductance per period of the slow-wave structure were derived in terms of the physical dimensions of the structure, incorporating the effects of the beam hole in the lumped parameters. The lumped parameters were subsequently interpreted for obtaining the dispersion and interaction impedance characteristics of the structure. The analysis was benchmarked for two typical millimeter-wave structures, one operating in Ka-band and the other operating in Q-band, against measurement and 3D electromagnetic modeling using MAFIA.

PocketMatch: A new algorithm to compare binding sites in protein structures

Recognizing similarities and deriving relationships among protein molecules is a fundamental requirement in present-day biology. Similarities can be present at various levels which can be detected through comparison of protein sequences or their structural folds. In some cases similarities obscure at these levels could be present merely in the substructures at their binding sites. Inferring functional similarities between protein molecules by comparing their binding sites is still largely exploratory and not as yet a routine protocol. One of the main reasons for this is the limitation in the choice of appropriate analytical tools that can compare binding sites with high sensitivity. To benefit from the enormous amount of structural data that is being rapidly accumulated, it is essential to have high throughput tools that enable large scale binding site comparison. Results: Here we present a new algorithm PocketMatch for comparison of binding sites in a frame invariant manner. Each binding site is represented by 90 lists of sorted distances capturing shape and chemical nature of the site. The sorted arrays are then aligned using an incremental alignment method and scored to obtain PMScores for pairs of sites. A comprehensive sensitivity analysis and an extensive validation of the algorithm have been carried out. A comparison with other site matching algorithms is also presented. Perturbation studies where the geometry of a given site was retained but the residue types were changed randomly, indicated that chance similarities were virtually non-existent. Our analysis also demonstrates that shape information alone is insufficient to discriminate between diverse binding sites, unless combined with chemical nature of amino acids. Conclusion: A new algorithm has been developed to compare binding sites in accurate, efficient and high-throughput manner. Though the representation used is conceptually simplistic, we demonstrate that along with the new alignment strategy used, it is sufficient to enable binding comparison with high sensitivity. Novel methodology has also been presented for validating the algorithm for accuracy and sensitivity with respect to geometry and chemical nature of the site. The method is also fast and takes about 1/250(th) second for one comparison on a single processor. A parallel version on BlueGene has also been implemented.

A comparative study of the energetics, structures, and mechanisms of the HCN H HNC and LiCN <-> LiNC isomerizations

The potential energy surfaces of the HCN<->HNC and LiCN<->LiNC isomerization processes were determined by ab initio theory using fully optimized triple-zeta double polarization types of basis sets. Both the MP2 corrections and the QCISD level of calculations were performed to correct for the electron correlation. Results show that electron correlation has a considerable influence on the energetics and structures. Analysis of the intramolecular bond rearrangement processes reveals that, in both cases, H (or Li+) migrates in an almost elliptic path in the plane of the molecule. In HCN<->HNC, the migrating hydrogen interacts with the in-plane pi,pi* orbitals of CN, leading to a decrease in the C-N bond order. In LiCN<->LiNC, Li+ does not interact with the corresponding pi,pi* orbitals of CN.

Hybrid structural control using magnetorheological dampers for base isolated structures

In this paper two nonlinear model based control algorithms have been developed to monitor the magnetorheological (MR) damper voltage. The main advantage of the proposed algorithms is that it is possible to directly monitor the voltage required to control the structural vibration considering the effect of the supplied and commanded voltage dynamics of the damper. The efficiency of the proposed techniques has been shown and compared taking an example of a base isolated three-storey building under a set of seismic excitations. Comparison of the performances with a fuzzy based intelligent control algorithm and a widely used clipped optimal strategy has also been shown.

Synthesis, crystal structures and protease activity of amino acid Schiff base iron(III) complexes

Iron(III) complexes, (NHEt3)[Fe(III)(sal-met)(2)] and (NHEt3)[Fe(III)(sal-phe)(2)], of amino acid Schiffbase ligands, viz., N-salicylidene-L-methionine and N-salicylidene L-phenylalanine, have been prepared and their binding to bovine serum albumin (BSA) and photo-induced BSA cleavage activity have been investigated. The complexes are structurally characterized by single crystal X-ray crystallography. The crystal Structures of the discrete mononuclear rnonoanionic complexes show FeN2O4 octahedral coordination geometry in which the tridentate dianionic amino acid Schiff base ligand binds through phenolate and carboxylate oxygen and imine nitrogen atoms. The imine nitrogen atoms are trans to each other. The Fe-O and Fe-N bond distances range between 1.9 and 2.1 angstrom. The sal-met complex has two pendant thiomethyl groups. The high-spin iron(III) complexes (mu(eff) similar to 5.9 mu(B)) exhibit quasi-reversible Fe(III)/Fe(II) redox process near -0.6 V vs. SCE in water. These complexes display a visible electronic hand near 480 nm in tris-HCl buffer assignable to the phenolate-to-iron(III) charge transfer transition. The water soluble complexes bind to BSA giving binding constant values of similar to 10(5) M-1. The Complexes show non-specific oxidative cleavage of BSA protein on photo-irradiation with UV-A light of 365 nm.

A thermal molecular migration in the solid-state - structures of isomeric 5-amino-4-(2,6-dichlorophenyl)-1-(2-nitrophenyl)-1h-1,2,3-triazole (yellow form i) and 4-(2,6-dichlorophenyl)-5-(2-nitroanilino)-2h-1,2,3-triazole (red form-ii), c14h9cl2n5o2

Yellow form (I): Mr= 350.09, monoclinic, P2Jn, Z--4, a=9.525(1), b=14.762(1), c= 11.268(1),/t, fl= 107.82 (1) o , V= 1508.3 A 3 , Din(flotation in aqueous KI)= 1.539 (2), D x= 1.541 (2) g cm -3, #(Cu Ka, 2 = 1.5418 A) = 40.58 cm -~, F(000) = 712, T= 293 K, R = 8.8% for 2054 significant refections. Red form (II): Mr= 350.09, triclinic, Pi, Z=2, a=9.796(2), b= 10.750 (2), c= 7.421 (1)A, a= 95.29 (2), fl= 0108-2701/84/111901-05501.50 70.18 (1), y = 92-.76 (2) °, V= 731.9 A 3, Din(flotation in KI) = 1.585 (3), D x = 1.588 (3) g cm -3, ~t(Cu Ka, 2 = 1.5418/~) = 40.58 cm -1, F(000) = 356, T=293 K, R = 5.8% for 1866 significant reflections. There are no unusual bond distances or angles. The triazole and two phenyl rings are planar. On the basis of packing considerations the possibility of intermolecular interactions playing a role in the reactivity of the starting material is ruled out.

Acid-catalysed cyclisations: structures of novel products isolated in the reaction of 2-[3-(2,6-dimethoxyphenyl)but-2-enyl]-2-methylcyclopentane-1,3-dione with MeOH-HCl

Reaction of the title compound (1a) with anhydrous MeOH-HCl gave 2-endo-(2,6-dimethoxyphenyl)-2-exo-methyl-5-methylbicyclo[3.2.1]octane-6,8-dione (3a), 1,5,14-timethoxy-5,8-seco-6,7-dinorestra-1,3,5(10),9(11)-tetraen-17-one (4), 1,5-dimethoxy-5,8-seco-6,7-dinorestra-1,3,5(10),8,14-pentaen-17-one (5), and 3,4,5,6-tetrahydro-2,7-dimethoxy-3,6-dimethyl-3,2,6-(13-oxopropan[1]yI[3]ylidene)-2H-1-benzoxocin (6). Structures assigned to compounds (3a), (4), and (6) are based on spectral data. The exo-tricyclic acetal structure (6) was further confirmed by the analysis of the 1H n.m.r. spectra of the isomeric alcohols (11) and (12), obtained by sodium borohydride reduction of (6).

Secondary attribute retrieval using tree data structures

Several techniques are known for searching an ordered collection of data. The techniques and analyses of retrieval methods based on primary attributes are straightforward. Retrieval using secondary attributes depends on several factors. For secondary attribute retrieval, the linear structures—inverted lists, multilists, doubly linked lists—and the recently proposed nonlinear tree structures—multiple attribute tree (MAT), K-d tree (kdT)—have their individual merits. It is shown in this paper that, of the two tree structures, MAT possesses several features of a systematic data structure for external file organisation which make it superior to kdT. Analytic estimates for the complexity of node searchers, in MAT and kdT for several types of queries, are developed and compared.

Relative Stabilities of Layered Perovskite and Pyrochlore Structures in Transition Metal-Oxides Containing Trivalent Bismuth

In order to investigate the factors determining the relative stabilities of layered perovskite and pyrochlore structures of transition metal oxides containing trivalent bismuth, several ternary and quaternary oxides have been investigated. While d0 cations stabilize the layered perovskite structure, cations containing partially-filled d orbitals (which suppress ferroelectric distortion of MO6 octahedra) seem to favor pyrochlore-related structures. Thus, the vanadium analogue of the layered perovskite Bi4Ti3O12 cannot be prepared; instead the composition consists of a mixture of pyrochlore-type Bi1.33V2O6, Bi2O3, and Bi metal. The distortion of Bi1.33V2O6 to orthorhombic symmetry is probably due to an ordering of anion vacancies in the pyrochlore structure. None of the other pyrochlores investigated, Bi2NbCrO7, Bi2NbFeO7, TlBiM2O7 (M = Nb, Ta), shows evidence for cation ordering in the X-Ray diffraction patterns, as indeed established by structure refinement of TlBiNb2O7.

Crystal structures of 1,4-diaza bicyclo[2.2.2.]octane and N,N-dimethyl formamide adducts of copper acetate

The crystal structures of copper acetate adducts with 1,4-diaza bicyclo [2.2.2.]octane and N,N-dimethyl formamide are shown to be dimeric with Cu---Cu distances of 2.633 Å and 2.616 Å respectively.

A comparative study of multiple attribute tree and inverted file structures for large bibliographic files

A variety of data structures such as inverted file, multi-lists, quad tree, k-d tree, range tree, polygon tree, quintary tree, multidimensional tries, segment tree, doubly chained tree, the grid file, d-fold tree. super B-tree, Multiple Attribute Tree (MAT), etc. have been studied for multidimensional searching and related problems. Physical data base organization, which is an important application of multidimensional searching, is traditionally and mostly handled by employing inverted file. This study proposes MAT data structure for bibliographic file systems, by illustrating the superiority of MAT data structure over inverted file. Both the methods are compared in terms of preprocessing, storage and query costs. Worst-case complexity analysis of both the methods, for a partial match query, is carried out in two cases: (a) when directory resides in main memory, (b) when directory resides in secondary memory. In both cases, MAT data structure is shown to be more efficient than the inverted file method. Arguments are given to illustrate the superiority of MAT data structure in an average case also. An efficient adaptation of MAT data structure, that exploits the special features of MAT structure and bibliographic files, is proposed for bibliographic file systems. In this adaptation, suitable techniques for fixing and ranking of the attributes for MAT data structure are proposed. Conclusions and proposals for future research are presented.

Electronic-structures of h2o.bf3 and related n-v addition-compounds - a combined eels-ups study in vapor-phase

The detailed electronic structure of the n-v addition compound H2O·BF3 has been investigated for the first time by a combined use of electron energy loss spectroscopy (EELS) and UV photoelectron spectroscopy (UPS) augmented by MO calculations. The calculated molecular orbital energies of H2O·BF3 agree well with the UPS results and have been used to assign the electronic transitions obtained from EELS and to construct an orbital correlation diagram. The Journal of Chemical Physics is copyrighted by The American Institute of Physics.

On the direct parallel solution of systems of linear equations: New algorithms and systolic structures

The paper presents two new algorithms for the direct parallel solution of systems of linear equations. The algorithms employ a novel recursive doubling technique to obtain solutions to an nth-order system in n steps with no more than 2n(n −1) processors. Comparing their performance with the Gaussian elimination algorithm (GE), we show that they are almost 100% faster than the latter. This speedup is achieved by dispensing with all the computation involved in the back-substitution phase of GE. It is also shown that the new algorithms exhibit error characteristics which are superior to GE. An n(n + 1) systolic array structure is proposed for the implementation of the new algorithms. We show that complete solutions can be obtained, through these single-phase solution methods, in 5n−log2n−4 computational steps, without the need for intermediate I/O operations.