An adaptive cascade compensator for a wide class of stable minimum or nonminimum phase plants through time moment estimation

Model Reference Adaptive Control (MRAC) of a wide repertoire of stable Linear Time Invariant (LTI) systems is addressed here. Even an upper bound on the order of the finite-dimensional system is unavailable. Further, the unknown plant is permitted to have both minimum phase and nonminimum phase zeros. Model following with reference to a completely specified reference model excited by a class of piecewise continuous bounded signals is the goal. The problem is approached by taking recourse to the time moments representation of an LTI system. The treatment here is confined to Single-Input Single-Output (SISO) systems. The adaptive controller is built upon an on-line scheme for time moment estimation of a system given no more than its input and output. As a first step, a cascade compensator is devised. The primary contribution lies in developing a unified framework to eventually address with more finesse the problem of adaptive control of a large family of plants allowed to be minimum or nonminimum phase. Thus, the scheme presented in this paper is confined to lay the basis for more refined compensators-cascade, feedback and both-initially for SISO systems and progressively for Multi-Input Multi-Output (MIMO) systems. Simulations are presented.

ON POLYTOPAL UPPER BOUND SPHERES

Generalizing a result (the case k = 1) due to M. A. Perles, we show that any polytopal upper bound sphere of odd dimension 2k + 1 belongs to the generalized Walkup class K-k(2k + 1), i.e., all its vertex links are k-stacked spheres. This is surprising since it is far from obvious that the vertex links of polytopal upper bound spheres should have any special combinatorial structure. It has been conjectured that for d not equal 2k + 1, all (k + 1)-neighborly members of the class K-k(d) are tight. The result of this paper shows that the hypothesis d not equal 2k + 1 is essential for every value of k >= 1.

A New Class Of Photo-Cross-Linkable Side-Chain Liquid Crystalline Polymers Containing Bis(Benzylidene)Cyclohexanone Units

This paper reports a new class of photo-cross-linkable side chain liquid crystalline polymers (PSCLCPs) based on the bis(benzylidene)cyclohexanone unit, which functions as both a mesogen and a photoactive center. Polymers with the bis(benzylidene)cyclohexanone unit and varying spacer length have been synthesized. Copolymers of bis(benzylidene)cyclohexanone containing monomer and cholesterol benzoate containing monomer with different compositions have also been prepared. All these polymers have been structurally characterized by spectroscopic techniques. Thermal transitions were studied by DSC, and mesophases were identified by polarized light optical microscopy (POM). The intermediate compounds OH-x, the monomers SCLCM-x, and the corresponding polymers PSCLCP-x, which are essentially based on bis(benzylidene)cyclohexanone, all show a nematic mesophase. Transition temperatures were observed to decrease with increasing spacer length. The copolymers with varying compositions exhibit a cholesteric mesophase, and the transition temperatures increase with the cholesteric benzoate units in the copolymer. Photolysis of the low molecular weight liquid crystalline bis(benzylidene)-cyclohexanone compound reveals that there are two kinds of photoreactions in these systems: the EZ photoisomerization and 2 pi + 2 pi addition. The EZ photoisomerization in the LC phase disrupts the parallel stacking of the mesogens, resulting in the transition from the LC phase to the isotropic phase. The photoreaction involving the 2 pi + 2 pi addition of the bis(benzylidene)cyclohexanone units in the polymer results in the cross-linking of the chains. The liquid crystalline induced circular dichroism (LCICD) studies of the cholesterol benzoate copolymers revealed that the cholesteric supramolecular order remains even after the photo-cross-linking.

Gamma-ray luminosity function of gamma-ray bright AGNs

Detection of gamma-ray emissions from a class of active galactic nuclei (viz blazars), has been one of the important findings from the Compton Gamma-Ray Observatory (CGRO). However, their gamma-ray luminosity function has not-been well determined. Few attempts have been made in earlier works, where BL Lacs and Flat Spectrum Radio Quasars (FSRQs) have been considered as a single source class. In this paper, we investigated the evolution and gamma-ray luminosity function of FSRQs and BL Lacs separately. Our investigation indicates no evolution for BL Lacs, however FSRQs show significant evolution. Pure luminosity evolution is assumed for FSRQs and exponential and power law evolution models are examined. Due to the small number of sources, the low luminosity end index of the luminosity function for FSRQs is constrained with an upper limit. BL Lac luminosity function shows no signature of break. As a consistency check, the model source distributions derived from these luminosity functions show no significant departure from the observed source distributions.

Novel Functionalised Troger's Bases: Synthesis of a New Class of Troger's Base Analogues Containing Dicarboxyl Functionality

The synthesis of three new Troger's base analogues, each functionalized with two carboxyl groups, is described. Copyright.

An upper bound for Cubicity in terms of Boxicity

An axis-parallel b-dimensional box is a Cartesian product R-1 x R-2 x ... x R-b where each R-i (for 1 <= i <= b) is a closed interval of the form [a(i), b(i)] on the real line. The boxicity of any graph G, box(G) is the minimum positive integer b such that G can be represented as the intersection graph of axis-parallel b-dimensional boxes. A b-dimensional cube is a Cartesian product R-1 x R-2 x ... x R-b, where each R-i (for 1 <= i <= b) is a closed interval of the form [a(i), a(i) + 1] on the real line. When the boxes are restricted to be axis-parallel cubes in b-dimension, the minimum dimension b required to represent the graph is called the cubicity of the graph (denoted by cub(G)). In this paper we prove that cub(G) <= inverted right perpendicularlog(2) ninverted left perpendicular box(G), where n is the number of vertices in the graph. We also show that this upper bound is tight.Some immediate consequences of the above result are listed below: 1. Planar graphs have cubicity at most 3inverted right perpendicularlog(2) ninvereted left perpendicular.2. Outer planar graphs have cubicity at most 2inverted right perpendicularlog(2) ninverted left perpendicular.3. Any graph of treewidth tw has cubicity at most (tw + 2) inverted right perpendicularlog(2) ninverted left perpendicular. Thus, chordal graphs have cubicity at most (omega + 1) inverted right erpendicularlog(2) ninverted left perpendicular and circular arc graphs have cubicity at most (2 omega + 1)inverted right perpendicularlog(2) ninverted left perpendicular, where omega is the clique number.

A pseudo-dynamical systems approach to a class of inverse problems in engineering

A pseudo-dynamical approach for a class of inverse problems involving static measurements is proposed and explored. Following linearization of the minimizing functional associated with the underlying optimization problem, the new strategy results in a system of linearized ordinary differential equations (ODEs) whose steady-state solutions yield the desired reconstruction. We consider some explicit and implicit schemes for integrating the ODEs and thus establish a deterministic reconstruction strategy without an explicit use of regularization. A stochastic reconstruction strategy is then developed making use of an ensemble Kalman filter wherein these ODEs serve as the measurement model. Finally, we assess the numerical efficacy of the developed tools against a few linear and nonlinear inverse problems of engineering interest.

A Classification of Homogeneous Operators in the Cowen-Douglas Class

A complete list of homogeneous operators in the Cowen-Douglas class B-n(D) is given. This classification is obtained from an explicit realization of all the homogeneous Hermitian holomorphic vector bundles on the unit disc under the action of the universal covering group of the bi-holomorphic automorphism group of the unit disc.

On optimum stratification with proportional allocation for a class of pareto distributions

Cum ./LSTA_A_8828879_O_XML_IMAGES/LSTA_A_8828879_O_ILM0001.gif rule [Singh (1975)] has been suggested in the literature for finding approximately optimum strata boundaries for proportional allocation, when the stratification is done on the study variable. This paper shows that for the class of density functions arising from the Wang and Aggarwal (1984) representation of the Lorenz Curve (or DBV curves in case of inventory theory), the cum ./LSTA_A_8828879_O_XML_IMAGES/LSTA_A_8828879_O_ILM0002.gif rule in place of giving approximately optimum strata boundaries, yields exactly optimum boundaries. It is also shown that the conjecture of Mahalanobis (1952) “. . .an optimum or nearly optimum solutions will be obtained when the expected contribution of each stratum to the total aggregate value of Y is made equal for all strata” yields exactly optimum strata boundaries for the case considered in the paper.

A class of exact solutions for the flow of a micropolar fluid

The flow of a micropolar fluid in an orthogonal rheometer is considered. It is shown that an infinite number of exact solutions characterizing asymmetric motions are possible. The expressions for pressure in the fluid, the components of the forces and couples acting on the plates are obtained. The effect of microrotation on the flow is brought out by considering numerical results for the case of coaxially rotating disks.

D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols

Cooperative relay communication in a fading channel environment under the orthogonal amplify-and-forward (OAF), nonorthogonal and orthogonal selection decode-and-forward (NSDF and OSDF) protocols is considered here. The diversity-multiplexing gain tradeoff (DMT) of the three protocols is determined and DMT-optimal distributed space-time (ST) code constructions are provided. The codes constructed are sphere decodable and in some instances incur minimum possible delay. Included in our results is the perhaps surprising finding that the orthogonal and the nonorthogonal amplify-and-forward (NAF) protocols have identical DMT when the time durations of the broadcast and cooperative phases are optimally chosen to suit the respective protocol. Moreover our code construction for the OAF protocol incurs less delay. Two variants of the NSDF protocol are considered: fixed-NSDF and variable-NSDF protocol. In the variable-NSDF protocol, the fraction of time occupied by the broadcast phase is allowed to vary with multiplexing gain. The variable-NSDF protocol is shown to improve on the DMT of the best previously known static protocol when the number of relays is greater than two. Also included is a DMT optimal code construction for the NAF protocol.

Vertical uplift capacity of two interfering horizontal anchors in sand using an upper bound limit analysis

The vertical uplift resistance of two interfering rigid rough strip anchors embedded horizontally in sand at shallow depths has been examined. The analysis is performed by using an upper bound theorem o limit analysis in combination with finite elements and linear programming. It is specified that both the anchors are loaded to failure simultaneously at the same magnitude of the failure load. For different clear spacing (S) between the anchors, the magnitude of the efficiency factor (xi(gamma)) is determined. On account of interference, the magnitude of xi(gamma) is found to reduce continuously with a decrease in the spacing between the anchors. The results from the numerical analysis were found to compare reasonably well with the available theoretical data from the literature.

Tripartite Entanglement versus Tripartite Nonlocality in Three-Qubit Greenberger-Horne-Zeilinger-Class States

We analyze the relationship between tripartite entanglement and genuine tripartite nonlocality for three-qubit pure states in the Greenberger-Horne-Zeilinger class. We consider a family of states known as the generalized Greenberger-Horne-Zeilinger states and derive an analytical expression relating the three-tangle, which quantifies tripartite entanglement, to the Svetlichny inequality, which is a Bell-type inequality that is violated only when all three qubits are nonlocally correlated. We show that states with three-tangle less than 1/2 do not violate the Svetlichny inequality. On the other hand, a set of states known as the maximal slice states does violate the Svetlichny inequality, and exactly analogous to the two-qubit case, the amount of violation is directly related to the degree of tripartite entanglement. We discuss further interesting properties of the generalized Greenberger-Horne-Zeilinger and maximal slice states.

Universality class of the reversible-irreversible transition in sheared suspensions

Collections of non-Brownian particles suspended in a viscous fluid and subjected to oscillatory shear at very low Reynolds number have recently been shown to exhibit a remarkable dynamical phase transition separating reversible from irreversible behavior as the strain amplitude or volume fraction are increased. We present a simple model for this phenomenon, based on which we argue that this transition lies in the universality class of the conserved directed percolation models. This leads to predictions for the scaling behavior of a large number of experimental observables. Non-Brownian suspensions under oscillatory shear may thus constitute the first experimental realization of an inactive-active phase transition which is not in the universality class of conventional directed percolation.

Improvement On Brooks Chromatic Bound For A Class Of Graphs

Brooks' Theorem says that if for a graph G,Δ(G)=n, then G is n-colourable, unless (1) n=2 and G has an odd cycle as a component, or (2) n>2 and Kn+1 is a component of G. In this paper we prove that if a graph G has none of some three graphs (K1,3;K5−e and H) as an induced subgraph and if Δ(G)greater-or-equal, slanted6 and d(G)<Δ(G), then χ(G)<Δ(G). Also we give examples to show that the hypothesis Δ(G)greater-or-equal, slanted6 can not be non-trivially relaxed and the graph K5−e can not be removed from the hypothesis. Moreover, for a graph G with none of K1,3;K5−e and H as an induced subgraph, we verify Borodin and Kostochka's conjecture that if for a graph G,Δ(G)greater-or-equal, slanted9 and d(G)<Δ(G), then χ(G)<Δ(G).