Mechanical performances of track-shaped rebar stiffened concrete-filled steel tubular (SCFRT) stub columns under axial compression

This paper presents a combined experimental, numerical, and theoretical study on the mechanical behaviors of track-shaped concrete-filled steel tubular (SCFRT) stub columns stiffened by rebars under compressive load. A total of 18 track-shaped concrete-filled steel tubular specimens including 12 specimens stiffened by rebars and 6 non-stiffened counterparts are tested, with consideration of parameters including flakiness ratio, concrete strength, and stiffeners. Failure pattern, bearing capacity, and ductility are all analyzed and discussed based on the experimental results. The numerical simulation by finite element (FE) software ABAQUS is also conducted. Based on both experimental and numerical results, theoretical formula to predict the load-bearing capacity of SCFRT stub columns subjected to axial compression loading is established according to the superposition principle of ultimate load-bearing capacity with rational simplification. The proposed theoretical method provides accurate predictions on the load bearing capacity by comparing with experimental results from 18 groups of specimens.

Unitary Processes with Independent Increments and Representations of Hilbert Tensor Algebras

The aim of this article is to characterize unitary increment process by a quantum stochastic integral representation on symmetric Fock space. Under certain assumptions we have proved its unitary equivalence to a Hudson-Parthasarathy flow.

A numerical study of the effect of loading conditions on tubular hydroforming

In this work, the mechanics of tubular hydroforming under various types of loading conditions is investigated. The main objective is to contrast the effects of prescribing fluid pressure or volume flow rate, in conjunction with axial displacement, on the stress and strain histories experienced by the tube and the process of bulging. To this end, axisymmetric finite element simulations of free hydroforming (without external die contact) of aluminium alloy tubes are carried out. Hill’s normally anisotropic yield theory along with material properties determined in a previous experimental study [A. Kulkarni, P. Biswas, R. Narasimhan, A. Luo, T. Stoughton, R. Mishra, A.K. Sachdev, An experimental and numerical study of necking initiation in aluminium alloy tubes during hydroforming, Int. J. Mech. Sci. 46 (2004) 1727–1746] are employed in the computations. It is found that while prescribed fluid pressure leads to highly non-proportional strain paths, specified fluid volume flow rate may result in almost proportional ones for the predominant portion of loading. The peak pressure increases with axial compression for the former, while the reverse trend applies under the latter. The implication of these results on failure by localized necking of the tube wall is addressed in a subsequent investigation.

STBC's from representation of extended Clifford Algebras

A set of sufficient conditions to construct lambda-real symbol Maximum Likelihood (ML) decodable STBCs have recently been provided by Karmakar et al. STBCs satisfying these sufficient conditions were named as Clifford Unitary Weight (CUW) codes. In this paper, the maximal rate (as measured in complex symbols per channel use) of CUW codes for lambda = 2(a), a is an element of N is obtained using tools from representation theory. Two algebraic constructions of codes achieving this maximal rate are also provided. One of the constructions is obtained using linear representation of finite groups whereas the other construction is based on the concept of right module algebra over non-commutative rings. To the knowledge of the authors, this is the first paper in which matrices over non-commutative rings is used to construct STBCs. An algebraic explanation is provided for the 'ABBA' construction first proposed by Tirkkonen et al and the tensor product construction proposed by Karmakar et al. Furthermore, it is established that the 4 transmit antenna STBC originally proposed by Tirkkonen et al based on the ABBA construction is actually a single complex symbol ML decodable code if the design variables are permuted and signal sets of appropriate dimensions are chosen.

Minimum-Decoding-Complexity, maximum-rate Space-Time Block Codes from Clifford algebras

It is well known that Alamouti code and, in general, Space-Time Block Codes (STBCs) from complex orthogonal designs (CODs) are single-symbol decodable/symbolby-symbol decodable (SSD) and are obtainable from unitary matrix representations of Clifford algebras. However, SSD codes are obtainable from designs that are not CODs. Recently, two such classes of SSD codes have been studied: (i) Coordinate Interleaved Orthogonal Designs (CIODs) and (ii) Minimum-Decoding-Complexity (MDC) STBCs from Quasi-ODs (QODs). In this paper, we obtain SSD codes with unitary weight matrices (but not CON) from matrix representations of Clifford algebras. Moreover, we derive an upper bound on the rate of SSD codes with unitary weight matrices and show that our codes meet this bound. Also, we present conditions on the signal sets which ensure full-diversity and give expressions for the coding gain.

Aspects of coherent states of nonlinear algebras

Various aspects of coherent states of nonlinear su(2) and su(1,1) algebras are studied. It is shown that the nonlinear su(1,1) Barut-Girardello and Perelomov coherent states are related by a Laplace transform. We then concentrate on the derivation and analysis of the statistical and geometrical properties of these states. The Berry's phase for the nonlinear coherent states is also derived. (C) 2010 American Institute of Physics. doi:10.1063/1.3514118]

High-rate, Double-Symbol-Decodable STBCs from Clifford Algebras

For the number of transmit antennas N = 2(a) the maximum rate (in complex symbols per channel use) of all the Quasi-Orthogonal Designs (QODs) reported in the literature is a/2(a)-1. In this paper, we report double-symbol-decodable Space-Time Block Codes with rate a-1/2(a)-2 for N = 2(a) transmit antennas. In particular, our code for 8 and 16 transmit antennas offer rates 1 and 3/4 respectively, the known QODs offer only 3/4 and 1/2 respectively. Our construction is based on the representations of Clifford algebras and applicable for any number of transmit antennas. We study the diversity sum and diversity product of our codes. We show that our diversity sum is larger than that of all known QODs and hence our codes perform better than the comparable QODs at low SNRs for identical spectral efficiency. We provide simulation results for various spectral efficiencies.

Uniform algebras generated by holomorphic and close-to-harmonic functions

The initial motivation for this paper is to discuss a more concrete approach to an approximation theorem of Axler and Shields, which says that the uniform algebra on the closed unit disc (D) over bar generated by z and h, where h is a nowhere-holomorphic harmonic function on D that is continuous up to partial derivative D, equals C((D) over bar). The abstract tools used by Axler and Shields make harmonicity of h an essential condition for their result. We use the concepts of plurisubharmonicity and polynomial convexity to show that, in fact, the same conclusion is reached if h is replaced by h + R, where R is a non-harmonic perturbation whose Laplacian is ``small'' in a certain sense.

Multigroup-Decodable STBCs from Clifford Algebras

A Space-Time Block Code (STBC) in K symbols (variables) is called g-group decodable STBC if its maximum-likelihood decoding metric can be written as a sum of g terms such that each term is a function of a subset of the K variables and each variable appears in only one term. In this paper we provide a general structure of the weight matrices of multi-group decodable codes using Clifford algebras. Without assuming that the number of variables in each group to be the same, a method of explicitly constructing the weight matrices of full-diversity, delay-optimal g-group decodable codes is presented for arbitrary number of antennas. For the special case of Nt=2a we construct two subclass of codes: (i) A class of 2a-group decodable codes with rate a2(a−1), which is, equivalently, a class of Single-Symbol Decodable codes, (ii) A class of (2a−2)-group decodable with rate (a−1)2(a−2), i.e., a class of Double-Symbol Decodable codes. Simulation results show that the DSD codes of this paper perform better than previously known Quasi-Orthogonal Designs.

Efficient space-time codes from cyclic division algebras

An overview of space-time code construction based on cyclic division algebras (CDA) is presented. Applications of such space-time codes to the construction of codes optimal under the diversity-multiplexing gain (D-MG) tradeoff, to the construction of the so-called perfect space-time codes, to the construction of optimal space-time codes for the ARQ channel as well as to the construction of codes optimal for the cooperative relay network channel are discussed. We also present a construction of optimal codes based on CDA for a class of orthogonal amplify and forward (OAF) protocols for the cooperative relay network

Discrete control algorithms for a tubular ammonia reactor

The specific objective of this paper is to develop direct digital control strategies for an ammonia reactor using quadratic regulator theory and compare the performance of the resultant control system with that under conventional PID regulators. The controller design studies are based on a ninth order state-space model obtained from the exact nonlinear distributed model using linearization and lumping approximations. The evaluation of these controllers with reference to their disturbance rejection capabilities and transient response characteristics, is carried out using hybrid computer simulation.