Exact internal controllability for a hyperbolic problem in a domain with highly oscillating boundary

In this paper, by using the Hilbert Uniqueness Method (HUM), we study the exact controllability problem described by the wave equation in a three-dimensional horizontal domain bounded at the bottom by a smooth wall and at the top by a rough wall. The latter is assumed to consist in a plane wall covered with periodically distributed asperities whose size depends on a small parameter epsilon > 0, and with a fixed height. Our aim is to obtain the exact controllability for the homogenized equation. In the process, we study the asymptotic analysis of wave equation in two setups, namely solution by standard weak formulation and solution by transposition method.

Modelling and analysis of new coolstreaming for P2P IPTV

Peer to peer networks are being used extensively nowadays for file sharing, video on demand and live streaming. For IPTV, delay deadlines are more stringent compared to file sharing. Coolstreaming was the first P2P IPTV system. In this paper, we model New Coolstreaming (newer version of Coolstreaming) via a queueing network. We use two time scale decomposition of Markov chains to compute the stationary distribution of number of peers and the expected number of substreams in the overlay which are not being received at the required rate due to parent overloading. We also characterize the end-to-end delay encountered by a video packet received by a user and originated at the server. Three factors contribute towards the delay. The first factor is the mean shortest path length between any two overlay peers in terms of overlay hops of the partnership graph which is shown to be O (log n) where n is the number of peers in the overlay. The second factor is the mean number of routers between any two overlay neighbours which is seen to be at most O (log N-I) where N-I is the number of routers in the internet. Third factor is the mean delay at a router in the internet. We provide an approximation of this mean delay E W]. Thus, the mean end to end delay in New Coolstreaming is shown to be upper bounded by O (log E N]) (log N-I) E (W)] where E N] is the mean number of peers at a channel.

Characterization of Birkhoff-James orthogonality

The Birkhoff-James orthogonality is a generalization of Hilbert space orthogonality to Banach spaces. We investigate this notion of orthogonality when the Banach space has more structures. We start by doing so for the Banach space of square matrices moving gradually to all bounded operators on any Hilbert space, then to an arbitrary C*-algebra and finally a Hilbert C*-module.

Polynomial time and parameterized approximation algorithms for boxicity

The boxicity (cubicity) of a graph G, denoted by box(G) (respectively cub(G)), is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes (cubes) in ℝ k . The problem of computing boxicity (cubicity) is known to be inapproximable in polynomial time even for graph classes like bipartite, co-bipartite and split graphs, within an O(n 0.5 − ε ) factor for any ε > 0, unless NP = ZPP. We prove that if a graph G on n vertices has a clique on n − k vertices, then box(G) can be computed in time n22O(k2logk) . Using this fact, various FPT approximation algorithms for boxicity are derived. The parameter used is the vertex (or edge) edit distance of the input graph from certain graph families of bounded boxicity - like interval graphs and planar graphs. Using the same fact, we also derive an O(nloglogn√logn√) factor approximation algorithm for computing boxicity, which, to our knowledge, is the first o(n) factor approximation algorithm for the problem. We also present an FPT approximation algorithm for computing the cubicity of graphs, with vertex cover number as the parameter.

Condition R and proper holomorphic maps between equidimensional product domains

We consider proper holomorphic mappings of equidimensional pseudoconvex domains in complex Euclidean space, where both source and target can be represented as Cartesian products of smoothly bounded domains. It is shown that such mappings extend smoothly up to the closures of the domains, provided each factor of the source satisfies Condition R. It also shown that the number of smoothly bounded factors in the source and target must be the same, and the proper holomorphic map splits as a product of proper mappings between the factor domains. (C) 2013 Elsevier Inc. All rights reserved.

A Nearly Exact Reformulation of the Girsanov Linearization for Stochastically Driven Nonlinear Oscillators

The Girsanov linearization method (GLM), proposed earlier in Saha, N., and Roy, D., 2007, ``The Girsanov Linearisation Method for Stochastically Driven Nonlinear Oscillators,'' J. Appl. Mech., 74, pp. 885-897, is reformulated to arrive at a nearly exact, semianalytical, weak and explicit scheme for nonlinear mechanical oscillators under additive stochastic excitations. At the heart of the reformulated linearization is a temporally localized rejection sampling strategy that, combined with a resampling scheme, enables selecting from and appropriately modifying an ensemble of locally linearized trajectories while weakly applying the Girsanov correction (the Radon-Nikodym derivative) for the linearization errors. The semianalyticity is due to an explicit linearization of the nonlinear drift terms and it plays a crucial role in keeping the Radon-Nikodym derivative ``nearly bounded'' above by the inverse of the linearization time step (which means that only a subset of linearized trajectories with low, yet finite, probability exceeds this bound). Drift linearization is conveniently accomplished via the first few (lower order) terms in the associated stochastic (Ito) Taylor expansion to exclude (multiple) stochastic integrals from the numerical treatment. Similarly, the Radon-Nikodym derivative, which is a strictly positive, exponential (super-) martingale, is converted to a canonical form and evaluated over each time step without directly computing the stochastic integrals appearing in its argument. Through their numeric implementations for a few low-dimensional nonlinear oscillators, the proposed variants of the scheme, presently referred to as the Girsanov corrected linearization method (GCLM), are shown to exhibit remarkably higher numerical accuracy over a much larger range of the time step size than is possible with the local drift-linearization schemes on their own.

Correlated Conductance Fluctuations Close to the Berezinskii-Kosterlitz-Thouless Transition in Ultrathin NbN Films

We probe the presence of long-range correlations in phase fluctuations by analyzing the higher-order spectrum of resistance fluctuations in ultrathin NbN superconducting films. The non-Gaussian component of resistance fluctuations is found to be sensitive to film thickness close to the transition, which allows us to distinguish between mean field and Berezinskii-Kosterlitz-Thouless (BKT) type superconducting transitions. The extent of non-Gaussianity was found to be bounded by the BKT and mean field transition temperatures and depends strongly on the roughness and structural inhomogeneity of the superconducting films. Our experiment outlines a novel fluctuation-based kinetic probe in detecting the nature of superconductivity in disordered low-dimensional materials.

Solutions of a system of forced Burgers equation

In this article, we obtain explicit solutions of a system of forced Burgers equation subject to some classes of bounded and compactly supported initial data and also subject to certain unbounded initial data. In a series of papers, Rao and Yadav (2010) 1-3] obtained explicit solutions of a nonhomogeneous Burgers equation in one dimension subject to certain classes of bounded and unbounded initial data. Earlier Kloosterziel (1990) 4] represented the solution of an initial value problem for the heat equation, with initial data in L-2 (R-n, e(vertical bar x vertical bar 2/2)), as a series of self-similar solutions of the heat equation in R-n. Here we express the solutions of certain classes of Cauchy problems for a system of forced Burgers equation in terms of self-similar solutions of some linear partial differential equations. (C) 2013 Elsevier Inc. All rights reserved.

Infinitely divisible metrics and curvature inequalities for operators in the Cowen-Douglas class

The curvature (T)(w) of a contraction T in the Cowen-Douglas class B-1() is bounded above by the curvature (S*)(w) of the backward shift operator. However, in general, an operator satisfying the curvature inequality need not be contractive. In this paper, we characterize a slightly smaller class of contractions using a stronger form of the curvature inequality. Along the way, we find conditions on the metric of the holomorphic Hermitian vector bundle E-T corresponding to the operator T in the Cowen-Douglas class B-1() which ensures negative definiteness of the curvature function. We obtain a generalization for commuting tuples of operators in the class B-1() for a bounded domain in C-m.

Third order trace formula

In J. Funct. Anal. 257 (2009) 1092-1132, Dykema and Skripka showed the existence of higher order spectral shift functions when the unperturbed self-adjoint operator is bounded and the perturbation is Hilbert-Schmidt. In this article, we give a different proof for the existence of spectral shift function for the third order when the unperturbed operator is self-adjoint (bounded or unbounded, but bounded below).

Curvature based mobility analysis and form closure of smooth planar curves with multiple contacts

This paper presents a simple second-order, curvature based mobility analysis of planar curves in contact. The underlying theory deals with penetration and separation of curves with multiple contacts, based on relative configuration of osculating circles at points of contact for a second-order rotation about each point of the plane. Geometric and analytical treatment of mobility analysis is presented for generic as well as special contact geometries. For objects with a single contact, partitioning of the plane into four types of mobility regions has been shown. Using point based composition operations based on dual-number matrices, analysis has been extended to computationally handle multiple contacts scenario. A novel color coded directed line has been proposed to capture the contact scenario. Multiple contacts mobility is obtained through intersection of the mobility half-spaces. It is derived that mobility region comprises a pair of unbounded or a single bounded convex polygon. The theory has been used for analysis and synthesis of form closure configurations, revolute and prismatic kinematic pairs. (C) 2013 Elsevier Ltd. All rights reserved.

Discrete time second order sliding mode observer for uncertain linear multi-output system

This paper presents a second order sliding mode observer (SOSMO) design for discrete time uncertain linear multi-output system. The design procedure is effective for both matched and unmatched bounded uncertainties and/or disturbances. A second order sliding function and corresponding sliding manifold for discrete time system are defined similar to the lines of continuous time counterpart. A boundary layer concept is employed to avoid switching across the defined sliding manifold and the sliding trajectory is confined to a boundary layer once it converges to it. The condition for existence of convergent quasi-sliding mode (QSM) is derived. The observer estimation errors satisfying given stability conditions converge to an ultimate finite bound (within the specified boundary layer) with thickness O(T-2) where T is the sampling period. A relation between sliding mode gain and boundary layer is established for the existence of second order discrete sliding motion. The design strategy is very simple to apply and is demonstrated for three examples with different class of disturbances (matched and unmatched) to show the effectiveness of the design. Simulation results to show the robustness with respect to the measurement noise are given for SOSMO and the performance is compared with pseudo-linear Kalman filter (PLKF). (C) 2013 Published by Elsevier Ltd. on behalf of The Franklin Institute

Time-Optimal Convergence to a Rectilinear Path in the Presence of Wind

This paper considers the problem of determining the time-optimal path of a fixed-wing Miniature Air Vehicle (MAV), in the presence of wind. The MAV, which is subject to a bounded turn rate, is required to eventually converge to a straight line starting from a known initial position and orientation. Earlier work in the literature uses Pontryagin's Minimum Principle (PMP) to solve this problem only for the no-wind case. In contrast, the present work uses a geometric approach to solve the problem completely in the presence of wind. In addition, it also shows how PMP can be used to partially solve the problem. Using a 6-DOF model of a MAV the generated optimal path is tracked by an autopilot consisting of proportional-integral-derivative (PID) controllers. The simulation results show the path generation and tracking for cases with steady and time-varying wind. Some issues on real-time path planning are also addressed.

CHLORAL HYDRATE AS A WATER CARRIER FOR THE EFFICIENT DEPROTECTION OF ACETALS, DITHIOACETALS, AND TETRAHYDROPYRANYL ETHERS IN ORGANIC SOLVENTS

The efficient deprotection of several acetals, dithioacetals, and tetrahydropyranyl (THP) ethers under ambient conditions, using chloral hydrate in hexane, is described. Excellent yields were realized for a wide range of both aliphatic and aromatic substrates. The method is characterized by mild conditions (room temperatures or below), simple workup, and the ready availability of chloral hydrate. High chemoselectivity was also observed in the deprotection, acetonides, esters, and amides being unaffected under the reaction conditions. Products were generally purified chromatographically and identified spectrally. These results constitute a novel addition to current methodology involving a widely employed deprotection tactic in organic synthesis. It seems likely that the mechanism of the reaction involves adsorption of the substrate on the surface of the sparingly soluble chloral hydrate.

Optimal Trajectory Generation for Convergence to a Rectilinear Path

This paper presents a strategy to determine the shortest path of a fixed-wing Miniature Air Vehicle (MAV), constrained by a bounded turning rate, to eventually fly along a given straight line, starting from an arbitrary but known initial position and orientation. Unlike the work available in the literature that solves the problem using the Pontryagin's Minimum Principle (PMP) the trajectory generation algorithm presented here considers a geometrical approach which is intuitive and easy to understand. This also computes the explicit solution for the length of the optimal path as a function of the initial configuration. Further, using a 6-DOF model of a MAV the generated optimal path is tracked by an autopilot consisting of proportional-integral-derivative (PID) controllers. The simulation results show the path generation and tracking for different cases.