Neural network based optimal routing algorithm for communication networks

This paper presents the capability of the neural networks as a computational tool for solving constrained optimization problem, arising in routing algorithms for the present day communication networks. The application of neural networks in the optimum routing problem, in case of packet switched computer networks, where the goal is to minimize the average delays in the communication have been addressed. The effectiveness of neural network is shown by the results of simulation of a neural design to solve the shortest path problem. Simulation model of neural network is shown to be utilized in an optimum routing algorithm known as flow deviation algorithm. It is also shown that the model will enable the routing algorithm to be implemented in real time and also to be adaptive to changes in link costs and network topology. (C) 2002 Elsevier Science Ltd. All rights reserved.

On the importance of backbone loop and peptide flip in the Walker sequence in F-1-ATPase action

The Walker sequence, GXXXXGKT, present in all the six subunits of F-1-ATPase exists in a folded form, known as phosphate-binding loop (P-loop). Analysis of the Ramachandran angles showed only small RMS deviation between the nucleotide-bound and nucleotide-free forms. This indicated a good overlap of the backbone loops. The catalytic beta-subunits (chains D, E and F) showed significant changes in the Ramachandran angles and the side chain torsion angles, but not the structural alpha-subunits (chains A, B and C). Most striking among these are the changes associated with Val160 and Gly161 corresponding to a flip in the peptide unit between them when a nucleotide is bound (chains D or F compared to nucleotide-free chain E). The conformational analysis further revealed a hitherto unnoticed hydrogen bond between amide-N of the flipped Gly161 and terminal phosphate-O of the nucleotide. This assigns a role for this conserved amino acid, otherwise ignored, of making an unusual direct interaction between the peptide backbone of the enzyme protein and the incoming nucleotide substrate. Significance of this interaction is enhanced, as it is limited only to the catalytic subunits, and also likely to involve a mechanical rotation of bonds of the peptide unit. Hopefully this is part of the overall events that link the chemical hydrolysis of ATP with the mechanical rotation of this molecule, now famous as tiny molecular motor.

Organically templated linear and layered cadmium sulfates

By reacting cadmium salts with H2SO4 in the presence of organic amines or directly with amine sulfates under hydrothermal conditions, it has been possible to prepare three linear cadmium sulfates of linarite topology, with the compositions [H3N(CH2)(2)NH3](2)[CdCl2(SO4)][SO4].H2O, I, [HN(CH2)(6)NH][CdBr2(SO4)], II, [HN(CH2)(6)NH][CdCl2-(SO4)], III. A layered cadmium sulfate of composition [H3N(CH2)(3)NH3][Cd-2(H2O)(2)(SO4)(3)], IV, has also been obtained. These sulfates are the first examples of a family of organically templated metal sulfates with interesting structural features. In the linarite chains, the CdX4O2 (X = Cl, Br) octahedron shares two trans-edges to form an [Mphi(4)] (phi = anionic ligand) chain decorated by the SO4 tetrahedron that adopts a staggered arrangement on either side of the chain. IV is constructed by the fusion of four-membered ring ladders involving edge sharing between the sulfate tetrahedron and metal octahedron. IV appears to be the first member of a family of organically templated metal sulfates containing an octahedral-tetrahedral 2D net wherein the sulfate tetrahedron is connected at all four corners.

An asymmetric cascaded H-Bridge inverters for generating 12-sided polygonal space vector diagrams for Motor drives

A new topology of asymmetric cascaded H-Bridge inverter is presented in this paper It consists of two cascaded H-bridge cells per phase. They are fed from isolated dc sources having a dc bus ratio of 1:0.366. Out of many space vectors possible from this circuit, only those are chosen that lie on 12-sided polygons. Thus, the overall space vector diagram produced by this circuit consists of multiple numbers of 12-sided polygons. With a proper PWM timing calculations based on these selected space vectors, it is possible to eliminate all the 6n +/- 1, (n = odd) harmonics from the phase voltage under all operating conditions. The switching frequency of individual H-Bridge cells is also substantially low. Extensive experimental results have been presented in this paper to validate the proposed concept.

A Compliant Mechanism Kit with Flexible Beams and Connectors

We present the concept, prototypes, and an optimal design method for a compliant mechanism kit as a parallel to the kits available for rigid-body mechanisms. The kit consists of flexible beams and connectors that can be easily hand-assembled using snap fits. It enables users, using their creativity and mechanics intuition, to quickly realize a compliant mechanism. The mechanisms assembled in this manner accurately capture the essential behavior of the topology, shape, size and material aspects and thereby can lead the way for a real compliant mechanism for practical use. Also described in this paper are the design of the connector to which flexible beams can be added in eight different directions; and prototyping of the spring steel connectors as well as beams using wire-cut electro discharge machining. It is noted in this paper that the concept of the kit also resolves a discrepancy in the finite element (FE) modeling of beam-based compliant mechanisms. The discrepancy arises when two or more beams are joining at one point and thus leading to increased stiffness. After resolving this discrepancy, this work extends the topology optimization to automatically generate designs that can be assembled with the kit. Thus, the kit and the accompanying analysis and optimal synthesis procedures comprise a self-contained educational as well as a research and pragmatic toolset for compliant mechanisms. The paper also illustrates how human creativity finds new ways of using the kit beyond the original intended use and how it is useful even for a novice to design compliant mechanisms.

Performance Evaluation of Distance-Hop Proportionality on Geometric Graph Models of Dense Sensor Networks

Wireless sensor networks can often be viewed in terms of a uniform deployment of a large number of nodes on a region in Euclidean space, e.g., the unit square. After deployment, the nodes self-organise into a mesh topology. In a dense, homogeneous deployment, a frequently used approximation is to take the hop distance between nodes to be proportional to the Euclidean distance between them. In this paper, we analyse the performance of this approximation. We show that nodes with a certain hop distance from a fixed anchor node lie within a certain annulus with probability approach- ing unity as the number of nodes n → ∞. We take a uniform, i.i.d. deployment of n nodes on a unit square, and consider the geometric graph on these nodes with radius r(n) = c q ln n n . We show that, for a given hop distance h of a node from a fixed anchor on the unit square,the Euclidean distance lies within [(1−ǫ)(h−1)r(n), hr(n)],for ǫ > 0, with probability approaching unity as n → ∞.This result shows that it is more likely to expect a node, with hop distance h from the anchor, to lie within this an- nulus centred at the anchor location, and of width roughly r(n), rather than close to a circle whose radius is exactly proportional to h. We show that if the radius r of the ge- ometric graph is fixed, the convergence of the probability is exponentially fast. Similar results hold for a randomised lattice deployment. We provide simulation results that il- lustrate the theory, and serve to show how large n needs to be for the asymptotics to be useful.

Network Coding for TCP Throughput Enhancement over a Multi-Hop wireless Network

The poor performance of TCP over multi-hop wireless networks is well known. In this paper we explore to what extent network coding can help to improve the throughput performance of TCP controlled bulk transfers over a chain topology multi-hop wireless network. The nodes use a CSMA/ CA mechanism, such as IEEE 802.11’s DCF, to perform distributed packet scheduling. The reverse flowing TCP ACKs are sought to be X-ORed with forward flowing TCP data packets. We find that, without any modification to theMAC protocol, the gain from network coding is negligible. The inherent coordination problem of carrier sensing based random access in multi-hop wireless networks dominates the performance. We provide a theoretical analysis that yields a throughput bound with network coding. We then propose a distributed modification of the IEEE 802.11 DCF, based on tuning the back-off mechanism using a feedback approach. Simulation studies show that the proposed mechanism when combined with network coding, improves the performance of a TCP session by more than 100%.

Design and Characterization of Stabilized Derivatives of Human CD4D12 and CD4D1

CD4 is present on the surface of T-lymphocytes and is the primary cellular receptor for HIV-1. CD4 consists of a cytoplasmic tail, one transmembrane region, and four extracellular domains, D1-D4. A construct consisting of the first two domains of CD4 (CD4D12) is folded and binds gp120 with similar affinity as soluble 4-domain CD4 (sCD4). However, the first domain alone (CD4D1) was previously shown to be largely unfolded and had 3-fold weaker affinity for gp120 when compared to sCD4 [Sharma, D.; et al. (2005) Biochemistry 44, 16192-16202]. We now report the design and characterization of three single-site mutants of CD4D12 (G6A, L51I, and V86L) and one multisite mutant of CD4D1 (G6A/L511/L5K/F98T). G6A, L51I, and V86L are cavity-filling mutations while L5K and F98T are surface mutations which were introduced to minimize the aggregation of CD4D1 upon removal of the second domain. Two mutations, G6A and V86L in CD4D12 increased the stability and yield of the protein relative to the wild-type protein. The mutant CD4D1 (CD4D1a) with the 4 mutations was folded and more stable compared to the original CD4D1, but both bound gp120 with comparable affinity. In in vitro neutralization assays, both CD4D1a and G6A-CD4D12 were able to neutralize diverse HIV-1 viruses with similar IC(50)s as 4-domain CD4. These stabilized derivatives of human CD4 can be useful starting points for the design of other more complex viral entry inhibitors.

(1S*,3S*,8S*,10S*)-10-Fluoro-15-oxatetracyclo[6.6.1.0(1,10).0( 3,8)]pentadeca-5,12-dien-3-ol

The title compound, C(14)H(17)FO(2), was obtained from anti-4a, 9a:8a,10a-diepoxy-1,4,4a,5,8,8a, 9,9a, 10,10a-decahydroanthracene via tandem hydrogen-fluoride-mediated epoxide ring-opening and transannular oxacyclization. With the two cyclohexene rings folded towards the oxygen bridge, the title tetracyclic fluoroalcohol molecule displays a conformation reminiscent of a pagoda. The crystal packing is effected via intermolecular O-H center dot center dot center dot O hydrogen bonds, which link the molecules into a zigzag chain along the b axis.

Displacement Amplifying Compliant Mechanisms for Two-axis High-resolution Monolithic Inertial Sensors

Novel designs for two-axis, high-resolution, monolithic inertial sensors are presented in this paper. Monolithic, i.e., joint-less single-piece compliant designs are already common in micromachined inertial sensors such as accelerometers and gyroscopes. Here, compliant mechanisms are used not only to achieve de-coupling between motions along two orthogonal axes but also to amplify the displacements of the proof-mass. Sensitivity and resolution capabilities are enhanced because the amplified motion is used for sensing the measurand. A particular symmetric arrangement of displacement-amplifying compliant mechanisms (DaCMs) leads to de-coupled and amplified motion. An existing DaCM and a new topology-optimized DaCM are presented as a building block in the new arrangement. A spring-mass-lever model is presented as a lumped abstraction of the new arrangement. This model is useful for arriving at the optimal parameters of the DaCM and for performing system-level simulation. The new designs improved the performance by a factor of two or more.

Regenerative Dynamometer with Vector Controlled Drive

This paper presents the topology selection, design steps, simulation studies, design verification, system fabrication and performance evaluation on an induction motor based dynamometer system. The control algorithm used the application is well known field oriented control or vector control. Position sensorless scheme is adopted to eliminate the encoder requirement. The dynamometer is rated for 3.7kW. It can be used to determine the speed–torque characteristics of any rotating system. The rotating system is to be coupled with the vector controlled drive and the required torque command is given from the latter. The experimental verification is carried out for an open loop v/f drive as a test rotating system and important test results are presented.

Efficient Key Management and Distribution for MANET

Ad hoc networks are being used in applications ranging from disaster recovery to distributed collaborative entertainment applications. Ad hoc networks have become one of the most attractive solution for rapid deployment of interconnecting large number of mobile personal devices. The user community of mobile personal devices are demanding a variety of value added multimedia entertainment services. The popularity of peer group is increasing and one or some members of the peer group need to send data to some or all members of the peer group. The increasing demand for group oriented value added services is driving for efficient multicast service over ad hoc networks. Access control mechanisms need to be deployed to provide guarantee that the unauthorized users cannot access the multicast content. In this paper, we present a topology aware key management and distribution scheme for secure overlay multicast over MANET to address node mobility related issues for multicast key management. We use overlay approach for key distribution and our objective is to keep communication overhead low for key management and distribution. We also incorporate reliability using explicit acknowledgments with the key distribution scheme. Through simulations we show that the proposed key management scheme has low communication overhead for rekeying and improves the reliability of key distribution.

Multilevel inverters for low-power application

Multilevel inverters are an attractive solution in the medium-voltage and high-power applications. However in the low-power range also it can be a better solution compared to two-level inverters, if MOSFETs are used as devices switching in the order of 100 kHz. The effect of clamping diodes in the diode-clamped multilevel inverters play an important role in determining its efficiency. Power loss introduced by the reverse recovery of MOSFET body diode prohibits the use of MOSFET in hard-switched inverter legs. A technique of avoiding reverse recovery loss of MOSFET body diode in a three-level neutral point clamped inverter is suggested. The use of multilevel inverters topology enables operation at high switching frequency without sacrificing efficiency. High switching frequency of operation reduces the output filter requirement, which in turn helps in reducing the size of the inverter. This study elaborates the trade-off analysis to quantify the suitability of multilevel inverters in the low-power applications. Advantages of using a MOSFET-based three-level diode-clamped inverter for a PM motor drive and UPS systems are discussed.

Output-Sensitive Construction of Reeb Graphs

The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the Reeb graph of scalar functions defined over manifolds or non-manifolds in any dimension. Key to the simplicity and efficiency of the algorithm is an alternate definition of the Reeb graph that considers equivalence classes of level sets instead of individual level sets. The algorithm works in two steps. The first step locates all critical points of the function in the domain. Critical points correspond to nodes in the Reeb graph. Arcs connecting the nodes are computed in the second step by a simple search procedure that works on a small subset of the domain that corresponds to a pair of critical points. The paper also describes a scheme for controlled simplification of the Reeb graph and two different graph layout schemes that help in the effective presentation of Reeb graphs for visual analysis of scalar fields. Finally, the Reeb graph is employed in four different applications-surface segmentation, spatially-aware transfer function design, visualization of interval volumes, and interactive exploration of time-varying data.

Trapped fermions in a synthetic non-Abelian gauge field

On increasing the coupling strength (lambda) of a non-Abelian gauge field that induces a generalized Rashba spin-orbit interaction, the topology of the Fermi surface of a homogeneous gas of noninteracting fermions of density rho similar to k(F)(3) undergoes a change at a critical value, lambda(T) approximate to k(F) [Phys. Rev. B 84, 014512 ( 2011)]. In this paper we analyze how this phenomenon affects the size and shape of a cloud of spin-1/2 fermions trapped in a harmonic potential such as those used in cold atom experiments. We develop an adiabatic formulation, including the concomitant Pancharatnam-Berry phase effects, for the one-particle states in the presence of a trapping potential and the gauge field, obtaining approximate analytical formulas for the energy levels for some high symmetry gauge field configurations of interest. An analysis based on the local density approximation reveals that, for a given number of particles, the cloud shrinks in a characteristic fashion with increasing.. We explain the physical origins of this effect by a study of the stress tensor of the system. For an isotropic harmonic trap, the local density approximation predicts a spherical cloud even for anisotropic gauge field configurations. We show, via a calculation of the cloud shape using exact eigenstates, that for certain gauge field configurations there is a systematic and observable anisotropy in the cloud shape that increases with increasing gauge coupling lambda. The reasons for this anisotropy are explained using the analytical energy levels obtained via the adiabatic approximation. These results should be useful in the design of cold atom experiments with fermions in non-Abelian gauge fields. An important spin-off of our adiabatic formulation is that it reveals exciting possibilities for the cold-atom realization of interesting condensed matter Hamiltonians by using a non-Abelian gauge field in conjunction with another potential. In particular, we show that the use of a spherical non-Abelian gauge field with a harmonic trapping potential produces a monopole field giving rise to a spherical geometry quantum Hall-like Hamiltonian in the momentum representation.