Reduced Order Suboptimal Control Design for a Class of Nonlinear Distributed Parameter Systems Using POD and /spl thetas/-D Techniques

A new computational tool is presented in this paper for suboptimal control design of a class of nonlinear distributed parameter systems. First proper orthogonal decomposition based problem-oriented basis functions are designed, which are then used in a Galerkin projection to come up with a low-order lumped parameter approximation. Next, a suboptimal controller is designed using the emerging /spl thetas/-D technique for lumped parameter systems. This time domain sub-optimal control solution is then mapped back to the distributed domain using the same basis functions, which essentially leads to a closed form solution for the controller in a state feedback form. Numerical results for a real-life nonlinear temperature control problem indicate that the proposed method holds promise as a good suboptimal control design technique for distributed parameter systems.

Minimal triangulation, complementarity and projective planes

Brehm and Kuhnel proved that if M-d is a combinatorial d-manifold with 3d/2 + 3 vertices and \ M-d \ is not homeomorphic to Sd then the combinatorial Morse number of M-d is three and hence d is an element of {0, 2, 4, 8, 16} and \ M-d \ is a manifold like a projective plane in the sense of Eells and Kuiper. We discuss the existence and uniqueness of such combinatorial manifolds. We also present the following result: ''Let M-n(d) be a combinatorial d-manifold with n vertices. M-n(d) satisfies complementarity if and only if d is an element of {0, 2, 4, 8, 16} with n = 3d/2 + 3 and \ M-n(d) \ is a manifold like a projective plane''.

1-D hydrogen-bonded organization of hexanuclear {3d-4f-5d} complexes: evidence for slow relaxation of the magnetization for [{LMe2Ni(H2O)Ln(H2O)4.5}2{W(CN)8}2] with Ln = Tb and Dy

Heterometallic {3d-4f-5d} aggregates with formula [{LMe2Ni(H2O)Ln(H2O)4.5}2{W(CN)8}2]·15H2O, (LMe2 stands for N,N-2,2-dimethylpropylenedi(3-methoxysalicylideneiminato) Schiff-base ligand) with Ln = Gd, Tb, Dy, have been obtained by reacting bimetallic [LMe2Ni(H2O)2Ln(NO3)3] and Cs3{W(CN)8} in H2O. The hexanuclear complexes are organized in 1-D arrays by means of hydrogen bonds established between the solvent molecules coordinated to Ln and the CN ligands of an octacyanometallate moiety. The X-ray structure was solved for the Tb derivative. Magnetic behavior indicates ferromagnetic {W–Ni} and {Ni–Ln} interactions (JNiW = 18.5 cm-1, JNiGd = 1.85 cm-1) as well as ferromagnetic intermolecular interactions mediated by the H-bonds. Dynamic magnetic susceptibility studies reveal slow magnetic relaxation processes for the Tb and Dy derivatives, suggesting SMM type behavior for these compounds.

Three-dimensional 3d-4f heterometallic polymers containing both azide and carboxylate as co-ligands

The hydrothermal reaction of Ln(NO3)(3), Ni(NO3)(2), NaN3, and isonicotinic acid (L) yielded two novel 3-D coordination frameworks (1 and 2) of general formula [Ni(2)Ln(L)(5)(N-3)(2)(H2O)(3)] center dot 2H(2)O (Ln = Pr(III) for 1 and Nd(III) for 2), containing Ni-Pr or Ni-Nd hybrid extended three-dimensional networks containing both azido and carboxylate as co-ligands. Both the compounds are found to be isostructural and crystallize in monoclinic system having P2(1)/n space group. Here the lanthanide ions are found to be nonacoordinated. Both bidentate and monodentate modes of binding of the carboxylate with the lanthanides have been observed in the above complexes. Variable temperature magnetic studies of the above two complexes have been investigated in the temperature range 2-300 K which showed dominant antiferromagnetic interaction in both the cases and these experimental results are analyzed with the theoretical models. (c) 2008 Elsevier B.V. All rights reserved.

A method of fraud & intrusion detection for e-payment systems in mobile

The need for paying with mobile devices has urged the development of payment systems for mobile electronic commerce. In this paper we have considered two important abuses in electronic payments systems for detection. The fraud, which is an intentional deception accomplished to secure an unfair gain, and an intrusion which are any set of actions that attempt to compromise the integrity, confidentiality or availability of a resource. Most of the available fraud and intrusion detection systems for e-payments are specific to the systems where they have been incorporated. This paper proposes a generic model called as Activity-Event-Symptoms(AES) model for detecting fraud and intrusion attacks which appears during payment process in the mobile commerce environment. The AES model is designed to identify the symptoms of fraud and intrusions by observing various events/transactions occurs during mobile commerce activity. The symptoms identification is followed by computing the suspicion factors for event attributes, and the certainty factor for a fraud and intrusion is generated using these suspicion factors. We have tested the proposed system by conducting various case studies, on the in-house established mobile commerce environment over wired and wire-less networks test bed.

Jointly optimal power control and routing for a single cell, dense, ad hoc wireless network

We consider a dense, ad hoc wireless network confined to a small region, such that direct communication is possible between any pair of nodes. The physical communication model is that a receiver decodes the signal from a single transmitter, while treating all other signals as interference. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organise into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first argue that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc network (described above) as a single cell, we study the optimal hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Theta(opt) bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form d(opt)((P) over bar (t)) x Theta(opt) with d(opt) scaling as (P) over bar (1/eta)(t), where (P) over bar (t) is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then provide a simple characterisation of the optimal operating point.

ICI-ISI mitigation in cooperative SFBC-OFDM with carrier frequency offset

Synchronization issues pose a big challenge in cooperative communications. The benefits of cooperative diversity could be easily undone by improper synchronization. The problem arises because it would be difficult, from a complexity perspective, for multiple transmitting nodes to synchronize to a single receiver. For OFDM based systems, loss of performance due to imperfect carrier synchronization is severe, since it results in inter-carrier interference (ICI). The use of space-time/space-frequency codes from orthogonal designs are attractive for cooperative encoding. But orthogonal designs suffer from inter-symbol interference (ISI) due to the violation of quasi-static assumption, which can arise due to frequency- or time-selectivity of the channel. In this paper, we are concerned with combating the effects of i) ICI induced by carrier frequency offsets (CFO), and ii) ISI induced by frequency selectivity of the channel, in a cooperative communication scheme using space-frequency block coded (SFBC) OFDM. Specifically, we present an iterative interference cancellation (IC) algorithm to combat the ISI and ICI effects. The proposed algorithm could be applied to any orthogonal or quasi-orthogonal designs in cooperative SFBC OFDM schemes.

OFDM-MAC algorithms and their impact on TCP performance in next generation mobile networks

Next generation wireless systems employ Orthogonal frequency division multiplexing (OFDM) physical layer owing to the high data rate transmissions that are possible without increase in bandwidth. While TCP performance has been extensively studied for interaction with link layer ARQ, little attention has been given to the interaction of TCP with MAC layer. In this work, we explore cross-layer interactions in an OFDM based wireless system, specifically focusing on channel-aware resource allocation strategies at the MAC layer and its impact on TCP congestion control. Both efficiency and fairness oriented MAC resource allocation strategies were designed for evaluating the performance of TCP. The former schemes try to exploit the channel diversity to maximize the system throughput, while the latter schemes try to provide a fair resource allocation over sufficiently long time duration. From a TCP goodput standpoint, we show that the class of MAC algorithms that incorporate a fairness metric and consider the backlog outperform the channel diversity exploiting schemes.

Quality of support for multicasting over mobile ad-hoc networks

An ad hoc network is composed of mobile nodes without any infrastructure. Recent trends in applications of mobile ad hoc networks rely on increased group oriented services. Hence multicast support is critical for ad hoc networks. We also need to provide service differentiation schemes for different group of users. An efficient application layer multicast (APPMULTICAST) solution suitable for low mobility applications in MANET environment has been proposed in [10]. In this paper, we present an improved application layer multicast solution suitable for medium mobility applications in MANET environment. We define multicast groups with low priority and high priority and incorporate a two level service differentiation scheme. We use network layer support to build the overlay topology closer to the actual network topology. We try to maximize Packet Delivery Ratio. Through simulations we show that the control overhead for our algorithm is within acceptable limit and it achieves acceptable Packet Delivery Ratio for medium mobility applications.

Detection of multiple source locations using a glowworm metaphor with applications to collective robotics

This paper presents a glowworm swarm based algorithm that finds solutions to optimization of multiple optima continuous functions. The algorithm is a variant of a well known ant-colony optimization (ACO) technique, but with several significant modifications. Similar to how each moving region in the ACO technique is associated with a pheromone value, the agents in our algorithm carry a luminescence quantity along with them. Agents are thought of as glowworms that emit a light whose intensity is proportional to the associated luminescence and have a circular sensor range. The glowworms depend on a local-decision domain to compute their movements. Simulations demonstrate the efficacy of the proposed glowworm based algorithm in capturing multiple optima of a multimodal function. The above optimization scenario solves problems where a collection of autonomous robots is used to form a mobile sensor network. In particular, we address the problem of detecting multiple sources of a general nutrient profile that is distributed spatially on a two dimensional workspace using multiple robots.

Parallelization of an unstructured data based cell centre finite volume code, HIFUN-3D

This work describes the parallelization of High Resolution flow solver on unstructured meshes, HIFUN-3D, an unstructured data based finite volume solver for 3-D Euler equations. For mesh partitioning, we use METIS, a software based on multilevel graph partitioning. The unstructured graph used for partitioning is associated with weights both on its vertices and edges. The data residing on every processor is split into four layers. Such a novel procedure of handling data helps in maintaining the effectiveness of the serial code. The communication of data across the processors is achieved by explicit message passing using the standard blocking mode feature of Message Passing Interface (MPI). The parallel code is tested on PACE++128 available in CFD Center

New phase unwrapping strategy for rapid and dense 3D data acquisition in structured light approach

Sinusoidal structured light projection (SSLP) technique, specifically-phase stepping method, is in widespread use to obtain accurate, dense 3-D data. But, if the object under investigation possesses surface discontinuities, phase unwrapping (an intermediate step in SSLP) stage mandatorily require several additional images, of the object with projected fringes (of different spatial frequencies), as input to generate a reliable 3D shape. On the other hand, Color-coded structured light projection (CSLP) technique is known to require a single image as in put, but generates sparse 3D data. Thus we propose the use of CSLP in conjunction with SSLP to obtain dense 3D data with minimum number of images as input. This approach is shown to be significantly faster and reliable than temporal phase unwrapping procedure that uses a complete exponential sequence. For example, if a measurement with the accuracy obtained by interrogating the object with 32 fringes in the projected pattern is carried out with both the methods, new strategy proposed requires only 5 frames as compared to 24 frames required by the later method.

Solution structure of Am2766: A highly hydrophobic d-conotoxin from Conus amadis that inhibits inactivation of brain voltage gated sodium channels

The three-dimensional (3D) NMR solution structure (MeOH) of the highly hydrophobic δ-conotoxin δ-Am2766 from the molluscivorous snail Conus amadis has been determined. Fifteen converged structures were obtained on the basis of 262 distance constraints, 25 torsion-angle constraints, and ten constraints based on disulfide linkages and H-bonds. The root-mean-square deviations (rmsd) about the averaged coordinates of the backbone (N, Cα, C) and (all) heavy atoms were 0.62±0.20 and 1.12±0.23 Å, respectively. The structures determined are of good stereochemical quality, as evidenced by the high percentage (100%) of backbone dihedral angles that occupy favorable and additionally allowed regions of the Ramachandran map. The structure of δ-Am2766 consists of a triple-stranded antiparallel β-sheet, and of four turns. The three disulfides form the classical ‘inhibitory cysteine knot’ motif. So far, only one tertiary structure of a δ-conotoxin has been reported; thus, the tertiary structure of δ-Am2766 is the second such example.Another Conus peptide, Am2735 from C. amadis, has also been purified and sequenced. Am2735 shares 96% sequence identity with δ-Am2766. Unlike δ-Am2766, Am2735 does not inhibit the fast inactivation of Na+ currents in rat brain Nav1.2 Na+ channels at concentrations up to 200 nM.

A nanosecond molecular dynamics study of antiparallel d(G)(7) quadruplex structures: Effect of the coordinated cations

Nanosecond scale molecular dynamics simulations have been performed on antiparallel Greek key type d(G(7)) quadruplex structures with different coordinated ions, namely Na+ and K+ ion, water and Na+ counter ions, using the AMBER force field and Particle Mesh Ewald technique for electrostatic interactions. Antiparallel structures are stable during the simulation, with root mean square deviation values of similar to1.5 Angstrom from the initial structures. Hydrogen bonding patterns within the G-tetrads depend on the nature of the coordinated ion, with the G-tetrad undergoing local structural variation to accommodate different cations. However, alternating syn-anti arrangement of bases along a chain as well as in a quartet is maintained through out the MD simulation. Coordinated Na+ ions, within the quadruplex cavity are quite mobile within the central channel and can even enter or exit from the quadruplex core, whereas coordinated K+ ions are quite immobile. MD studies at 400 K indicate that K+ ion cannot come out from the quadruplex core without breaking the terminal G-tetrads. Smaller grooves in antiparallel structures are better binding sites for hydrated counter ions, while a string of hydrogen bonded water molecules are observed within both the small and large grooves. The hydration free energy for the K+ ion coordinated structure is more favourable than that for the Na+ ion coordinated antiparallel quadruplex structure.

The Reproducing Kernel DMS-FEM: 3D Shape Functions and Applications to Linear Solid Mechanics

We propose a family of 3D versions of a smooth finite element method (Sunilkumar and Roy 2010), wherein the globally smooth shape functions are derivable through the condition of polynomial reproduction with the tetrahedral B-splines (DMS-splines) or tensor-product forms of triangular B-splines and ID NURBS bases acting as the kernel functions. While the domain decomposition is accomplished through tetrahedral or triangular prism elements, an additional requirement here is an appropriate generation of knotclouds around the element vertices or corners. The possibility of sensitive dependence of numerical solutions to the placements of knotclouds is largely arrested by enforcing the condition of polynomial reproduction whilst deriving the shape functions. Nevertheless, given the higher complexity in forming the knotclouds for tetrahedral elements especially when higher demand is placed on the order of continuity of the shape functions across inter-element boundaries, we presently emphasize an exploration of the triangular prism based formulation in the context of several benchmark problems of interest in linear solid mechanics. In the absence of a more rigorous study on the convergence analyses, the numerical exercise, reported herein, helps establish the method as one of remarkable accuracy and robust performance against numerical ill-conditioning (such as locking of different kinds) vis-a-vis the conventional FEM.