A transputer-based extended hypercube

The Extended Hypercube is a new approach in multiprocessor architectures, which reduces the communication burden on the processor elements. We propose a scheme for implementing such an architecture using INMOS transputers as the processor and controller elements to achieve a very high computation to communication ratio.

High selectivity miniaturized broadband filter

Design of a compact broadband filter using tightly coupled line sections in defected (A slot is cut in the ground) microstrip medium operating from 3 1-6 8 GHz has been repotted in this article Filter has been designed and analyzed using an equivalent circuit model based on even and odd mock parameters of coupled line sections The proposed filter has attenuation poles on either side of the pass band resulting in improved selectivity This filter features spurious free response up to third harmonic frequency Experimental results of the filter have been validated against the analytical and full wave simulations (C) 2010 Wiley Periodicals Inc Microwave Opt Technol Lett 53 184-187 2011 View this article online at wileyonlinelibrary com DOI 10.1002/mop.25676

Algorithms for Exact Structure Discovery in Bayesian Networks

Bayesian networks are compact, flexible, and interpretable representations of a joint distribution. When the network structure is unknown but there are observational data at hand, one can try to learn the network structure. This is called structure discovery. This thesis contributes to two areas of structure discovery in Bayesian networks: space--time tradeoffs and learning ancestor relations. The fastest exact algorithms for structure discovery in Bayesian networks are based on dynamic programming and use excessive amounts of space. Motivated by the space usage, several schemes for trading space against time are presented. These schemes are presented in a general setting for a class of computational problems called permutation problems; structure discovery in Bayesian networks is seen as a challenging variant of the permutation problems. The main contribution in the area of the space--time tradeoffs is the partial order approach, in which the standard dynamic programming algorithm is extended to run over partial orders. In particular, a certain family of partial orders called parallel bucket orders is considered. A partial order scheme that provably yields an optimal space--time tradeoff within parallel bucket orders is presented. Also practical issues concerning parallel bucket orders are discussed. Learning ancestor relations, that is, directed paths between nodes, is motivated by the need for robust summaries of the network structures when there are unobserved nodes at work. Ancestor relations are nonmodular features and hence learning them is more difficult than modular features. A dynamic programming algorithm is presented for computing posterior probabilities of ancestor relations exactly. Empirical tests suggest that ancestor relations can be learned from observational data almost as accurately as arcs even in the presence of unobserved nodes.

Exotic Physics in the Negative-U, Extended-Hubbard Model for Barium Bismuthates?

We point out possibilities for exotic physics in barium bismuthates, from a detailed study of the negative-U, extended-Hubbard model proposed for these systems. We emphasize the different consequences of electronic and phononic mechanisms for negative U. We show that, for an electronic mechanism, the semiconducting phases must be unique, with their transport properties dominated by charge ± 2e Cooperon bound states. This can explain the observed difference between the optical and transport gaps. We propose other experimental tests for this novel mechanism of charge transport.

Mean-field results of the multiple-band extended Hubbard model for the square-planar CuO2 lattice

We obtain metal-insulator phase diagrams at half-filling for the five-band extended Hubbard model of the square-planar CuO2 lattice treated within a Hartree-Fock mean-field approximation, allowing for spiral spin-density waves. We indicate the existence of an insulating phase (covalent insulator) characterized by strong covalency effects, not identified in the earlier Zaanen-Sawatzky-Allen phase diagram. While the insulating phase is always antiferromagnetic, we also obtain an antiferromagnetic metallic phase for a certain range of interaction parameters. Performing a nonperturbative calculation of J(eff), the in-plane antiferromagnetic interaction is presented as a function of the parameters in the model. We also calculate the band gap and magnetic moments at various sites and discuss critically the contrasting interpretation of the electronic structure of high-T(c) materials arising from photoemission and neutron-scattering experiments.

Lattice embedding and equilibrium geometry of metal-halogen chains in the two-band extended Hubbard model

Two-band extended Hubbard model studies show that the shift in optical gap of the metal-halogen (MX) chain upon embedding in a crystalline environment depends upon alternation in the site-diagonal electron-lattice interaction parameter (epsilon(M)) and the strength of electron-electron interactions at the metal site (U(M)). The equilibrium geometry studies on isolated chains show that the MX chains tend to distort for alternating epsilon(M) and small U(M) values.

Load balancing algorithms for an extended hypercube

Reduction of the execution time of a job through equitable distribution of work load among the processors in a distributed system is the goal of load balancing. Performance of static and dynamic load balancing algorithms for the extended hypercube, is discussed. Threshold algorithms are very well-known algorithms for dynamic load balancing in distributed systems. An extension of the threshold algorithm, called the multilevel threshold algorithm, has been proposed. The hierarchical interconnection network of the extended hypercube is suitable for implementing the proposed algorithm. The new algorithm has been implemented on a transputer-based system and the performance of the algorithm for an extended hypercube is compared with those for mesh and binary hypercube networks

Extended gravitational action and novel consequences

It is found that the inclusion of higher derivative terms in the gravitational action along with concepts of phase transition and spontaneous symmetry breaking leads to some novel consequence. The Ricci scalar plays the dual role, like a physical field as well as a geometrical field. One gets Klein-Gordon equation for the emerging field and the corresponding quanta of geometry are called Riccions. For the early universe the model removes singularity along with inflation. In higher dimensional gravity the Riccions can break into spin half particle and antiparticle along with breaking of left-right symmetry. Most tantalizing consequences is the emergence of the physical universe from the geometry in the extreme past. Riccions can Bose condense and may account for the dark matter.

Extended kac-akhiezer formulae and the fredholm determinant of finite section hilbert-schmidt kernels

This paper deals with some results (known as Kac-Akhiezer formulae) on generalized Fredholm determinants for Hilbert-Schmidt operators on L2-spaces, available in the literature for convolution kernels on intervals. The Kac-Akhiezer formulae have been obtained for kernels which are not necessarily of convolution nature and for domains in R(n).

Chance constrained uncertain classification via robust optimization

This paper studies the problem of constructing robust classifiers when the training is plagued with uncertainty. The problem is posed as a Chance-Constrained Program (CCP) which ensures that the uncertain data points are classified correctly with high probability. Unfortunately such a CCP turns out to be intractable. The key novelty is in employing Bernstein bounding schemes to relax the CCP as a convex second order cone program whose solution is guaranteed to satisfy the probabilistic constraint. Prior to this work, only the Chebyshev based relaxations were exploited in learning algorithms. Bernstein bounds employ richer partial information and hence can be far less conservative than Chebyshev bounds. Due to this efficient modeling of uncertainty, the resulting classifiers achieve higher classification margins and hence better generalization. Methodologies for classifying uncertain test data points and error measures for evaluating classifiers robust to uncertain data are discussed. Experimental results on synthetic and real-world datasets show that the proposed classifiers are better equipped to handle data uncertainty and outperform state-of-the-art in many cases.

Robust Semi-Blind Estimation for Beamforming Based MIMO Wireless Communication

In this paper, we present robust semi-blind (SB) algorithms for the estimation of beamforming vectors for multiple-input multiple-output wireless communication. The transmitted symbol block is assumed to comprise of a known sequence of training (pilot) symbols followed by information bearing blind (unknown) data symbols. Analytical expressions are derived for the robust SB estimators of the MIMO receive and transmit beamforming vectors. These robust SB estimators employ a preliminary estimate obtained from the pilot symbol sequence and leverage the second-order statistical information from the blind data symbols. We employ the theory of Lagrangian duality to derive the robust estimate of the receive beamforming vector by maximizing an inner product, while constraining the channel estimate to lie in a confidence sphere centered at the initial pilot estimate. Two different schemes are then proposed for computing the robust estimate of the MIMO transmit beamforming vector. Simulation results presented in the end illustrate the superior performance of the robust SB estimators.

Using Correlated Parameters for Improved Ranking of Protein-Protein Docking Decoys

A successful protein-protein docking study culminates in identification of decoys at top ranks with near-native quaternary structures. However, this task remains enigmatic because no generalized scoring functions exist that effectively infer decoys according to the similarity to near-native quaternary structures. Difficulties arise because of the highly irregular nature of the protein surface and the significant variation of the nonbonding and solvation energies based on the chemical composition of the protein-protein interface. In this work, we describe a novel method combining an interface-size filter, a regression model for geometric compatibility (based on two correlated surface and packing parameters), and normalized interaction energy (calculated from correlated nonbonded and solvation energies), to effectively rank decoys from a set of 10,000 decoys. Tests on 30 unbound binary protein-protein complexes show that in 16 cases we can identify at least one decoy in top three ranks having <= 10 angstrom backbone root mean square deviation from true binding geometry. Comparisons with other state-of-art methods confirm the improved ranking power of our method without the use of any experiment-guided restraints, evolutionary information, statistical propensities, or modified interaction energy equations. Tests on 118 less-difficult bound binary protein-protein complexes with <= 35% sequence redundancy at the interface showed that in 77% cases, at least 1 in 10,000 decoys were identified with <= 5 angstrom backbone root mean square deviation from true geometry at first rank. The work will promote the use of new concepts where correlations among parameters provide more robust scoring models. It will facilitate studies involving molecular interactions, including modeling of large macromolecular assemblies and protein structure prediction. (C) 2010 Wiley Periodicals, Inc. J Comput Chem 32: 787-796, 2011.

Robust/Optimal Temperature Profile Control of a High-Speed Aerospace Vehicle Using Neural Networks

An approximate dynamic programming (ADP)-based suboptimal neurocontroller to obtain desired temperature for a high-speed aerospace vehicle is synthesized in this paper. A I-D distributed parameter model of a fin is developed from basic thermal physics principles. "Snapshot" solutions of the dynamics are generated with a simple dynamic inversion-based feedback controller. Empirical basis functions are designed using the "proper orthogonal decomposition" (POD) technique and the snapshot solutions. A low-order nonlinear lumped parameter system to characterize the infinite dimensional system is obtained by carrying out a Galerkin projection. An ADP-based neurocontroller with a dual heuristic programming (DHP) formulation is obtained with a single-network-adaptive-critic (SNAC) controller for this approximate nonlinear model. Actual control in the original domain is calculated with the same POD basis functions through a reverse mapping. Further contribution of this paper includes development of an online robust neurocontroller to account for unmodeled dynamics and parametric uncertainties inherent in such a complex dynamic system. A neural network (NN) weight update rule that guarantees boundedness of the weights and relaxes the need for persistence of excitation (PE) condition is presented. Simulation studies show that in a fairly extensive but compact domain, any desired temperature profile can be achieved starting from any initial temperature profile. Therefore, the ADP and NN-based controllers appear to have the potential to become controller synthesis tools for nonlinear distributed parameter systems.

Supersolid Phase in One-Dimensional Bose-Hubbard Model With Extended Range Interactions: DMRG And Field Theoretic Study at Different Densities

We use the Density Matrix Renormalization Group and the Abelian bosonization method to study the effect of density on quantum phases of one-dimensional extended Bose-Hubbard model. We predict the existence of supersolid phase and also other quantum phases for this system. We have analyzed the role of extended range interaction parameters on solitonic phase near half-filling. We discuss the effects of dimerization in nearest neighbor hopping and interaction as well as next nearest neighbor interaction on the plateau phase at half-filling.