Swing amplification of nonaxisymmetric perturbations in stars and gas in a sheared galactic disk

We present a study of the growth of local, nonaxisymmetric perturbations in gravitationally coupled stars and gas in a differentially rotating galactic disk. The stars and gas are treated as two isothermal fluids of different velocity dispersions, with the stellar velocity dispersion being greater than that for the gas. We examine the physical effects of inclusion of a low-velocity dispersion component (gas) on the growth of non-axisymmetric perturbations in both stars and gas, as done for the axisymmetric case by Jog & Solomon. The amplified perturbations in stars and gas constitute trailing, material, spiral features which may be identified with the local spiral features seen in all spiral galaxies. The formulation of the two-fluid equations closely follows the one-fluid treatment by Goldreich & Lynden-Bell. The local, linearized perturbation equations in the sheared frame are solved to obtain the results for a temporary growth via swing amplification. The problem is formulated in terms of five dimensionless parameters-namely, the Q-factors for stars and gas, respectively; the gas mass fraction; the shearing rate in the galactic disk; and the length scale of perturbation. By using the observed values of these parameters, we obtain the amplifications and the pitch angles for features in stars and gas for dynamically distinct cases, as applicable for different regions of spiral galaxies. A real galaxy consisting of stars and gas may display growth of nonaxisymmetric perturbations even when it is stable against axisymmetric perturbations and/or when either fluid by itself is stable against non-axisymmetric perturbations. Due to its lower velocity dispersion, the gas exhibits a higher amplification than do the stars, and the amplified gas features are slightly more tightly wound than the stellar features. When the gas contribution is high, the stellar amplification and the range of pitch angles over which it can occur are both increased, due to the gravitational coupling between the two fluids. Thus, the two-fluid scheme can explain the origin of the broad spiral arms in the underlying old stellar populations of galaxies, as observed by Schweizer and Elmegreen & Elmegreen. The arms are predicted to be broader in gas-rich galaxies, as is indeed seen for example in M33. In the linear regime studied here, the arm contrast is shown to increase with radius in the inner Galaxy, in agreement with observations of external galaxies by Schweizer. These results follow directly due to the inclusion of gas in the problem.

Fluctuation-dissipation relation for nonlinear Langevin equations

It is shown that the fluctuation-dissipation theorem is satisfied by the solutions of a general set of nonlinear Langevin equations with a quadratic free-energy functional (constant susceptibility) and field-dependent kinetic coefficients, provided the kinetic coefficients satisfy the Onsager reciprocal relations for the irreversible terms and the antisymmetry relations for the reversible terms. The analysis employs a perturbation expansion of the nonlinear terms, and a functional integral calculation of the correlation and response functions, and it is shown that the fluctuation-dissipation relation is satisfied at each order in the expansion.

Network approach for capturing ligand-induced subtle global changes in protein structures

Ligand-induced conformational changes in proteins are of immense functional relevance. It is a major challenge to elucidate the network of amino acids that are responsible for the percolation of ligand-induced conformational changes to distal regions in the protein from a global perspective. Functionally important subtle conformational changes (at the level of side-chain noncovalent interactions) upon ligand binding or as a result of environmental variations are also elusive in conventional studies such as those using root-mean-square deviations (r.m.s.d.s). In this article, the network representation of protein structures and their analyses provides an efficient tool to capture these variations (both drastic and subtle) in atomistic detail in a global milieu. A generalized graph theoretical metric, using network parameters such as cliques and/or communities, is used to determine similarities or differences between structures in a rigorous manner. The ligand-induced global rewiring in the protein structures is also quantified in terms of network parameters. Thus, a judicious use of graph theory in the context of protein structures can provide meaningful insights into global structural reorganizations upon perturbation and can also be helpful for rigorous structural comparison. Data sets for the present study include high-resolution crystal structures of serine proteases from the S1A family and are probed to quantify the ligand-induced subtle structural variations.

Some Algorithms for Eigensubspace Estimation

An important tool in signal processing is the use of eigenvalue and singular value decompositions for extracting information from time-series/sensor array data. These tools are used in the so-called subspace methods that underlie solutions to the harmonic retrieval problem in time series and the directions-of-arrival (DOA) estimation problem in array processing. The subspace methods require the knowledge of eigenvectors of the underlying covariance matrix to estimate the parameters of interest. Eigenstructure estimation in signal processing has two important classes: (i) estimating the eigenstructure of the given covariance matrix and (ii) updating the eigenstructure estimates given the current estimate and new data. In this paper, we survey some algorithms for both these classes useful for harmonic retrieval and DOA estimation problems. We begin by surveying key results in the literature and then describe, in some detail, energy function minimization approaches that underlie a class of feedback neural networks. Our approaches estimate some or all of the eigenvectors corresponding to the repeated minimum eigenvalue and also multiple orthogonal eigenvectors corresponding to the ordered eigenvalues of the covariance matrix. Our presentation includes some supporting analysis and simulation results. We may point out here that eigensubspace estimation is a vast area and all aspects of this cannot be fully covered in a single paper. (C) 1995 Academic Press, Inc.

Stability of spatially developing boundary layers in pressure gradients

A new formulation of the stability of boundary-layer flows in pressure gradients is presented, taking into account the spatial development of the flow and utilizing a special coordinate transformation. The formulation assumes that disturbance wavelength and eigenfunction vary downstream no more rapidly than the boundary-layer thickness, and includes all terms nominally of order R(-1) in the boundary-layer Reynolds number R. In Blasius flow, the present approach is consistent with that of Bertolotti et al. (1992) to O(R(-1)) but simpler (i.e. has fewer terms), and may best be seen as providing a parametric differential equation which can be solved without having to march in space. The computed neutral boundaries depend strongly on distance from the surface, but the one corresponding to the inner maximum of the streamwise velocity perturbation happens to be close to the parallel flow (Orr-Sommerfeld) boundary. For this quantity, solutions for the Falkner-Skan flows show the effects of spatial growth to be striking only in the presence of strong adverse pressure gradients. As a rational analysis to O(R(-1)) demands inclusion of higher-order corrections on the mean flow, an illustrative calculation of one such correction, due to the displacement effect of the boundary layer, is made, and shown to have a significant destabilizing influence on the stability boundary in strong adverse pressure gradients. The effect of non-parallelism on the growth of relatively high frequencies can be significant at low Reynolds numbers, but is marginal in other cases. As an extension of the present approach, a method of dealing with non-similar flows is also presented and illustrated. However, inherent in the transformation underlying the present approach is a lower-order non-parallel theory, which is obtained by dropping all terms of nominal order R(-1) except those required for obtaining the lowest-order solution in the critical and wall layers. It is shown that a reduced Orr-Sommerfeld equation (in transformed coordinates) already contains the major effects of non-parallelism.

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.

Learning the global maximum with parameterized learning automata

A feedforward network composed of units of teams of parameterized learning automata is considered as a model of a reinforcement teaming system. The internal state vector of each learning automaton is updated using an algorithm consisting of a gradient following term and a random perturbation term. It is shown that the algorithm weakly converges to a solution of the Langevin equation implying that the algorithm globally maximizes an appropriate function. The algorithm is decentralized, and the units do not have any information exchange during updating. Simulation results on common payoff games and pattern recognition problems show that reasonable rates of convergence can be obtained.

A two timescale stochastic approximation scheme for simulation-based parametric optimization

A two timescale stochastic approximation scheme which uses coupled iterations is used for simulation-based parametric optimization as an alternative to traditional "infinitesimal perturbation analysis" schemes, It avoids the aggregation of data present in many other schemes. Its convergence is analyzed, and a queueing example is presented.

MIMO Precoding With X- and Y- Codes

We consider a slow fading multiple-input multiple-output (MIMO) system with channel state information at both the transmitter and receiver. A well-known precoding scheme is based upon the singular value decomposition (SVD) of the channel matrix, which transforms the MIMO channel into parallel subchannels. Despite having low maximum likelihood decoding (MLD) complexity, this SVD precoding scheme provides a diversity gain which is limited by the diversity gain of the weakest subchannel. We therefore propose X- and Y-Codes, which improve the diversity gain of the SVD precoding scheme but maintain the low MLD complexity, by jointly coding information across a pair of subchannels. In particular, subchannels with high diversity gain are paired with those having low diversity gain. A pair of subchannels is jointly encoded using a 2 2 real matrix, which is fixed a priori and does not change with each channel realization. For X-Codes, these rotation matrices are parameterized by a single angle, while for Y-Codes, these matrices are left triangular matrices. Moreover, we propose X-, Y-Precoders with the same structure as X-, Y-Codes, but with encoding matrices adapted to each channel realization. We observed that X-Codes/Precoders are good for well-conditioned channels, while Y-Codes/Precoders are good for ill-conditioned channels.

Lopsidedness in WHISP galaxies I. Rotation curves and kinematic lopsidedness

The frequently observed lopsidedness of the distribution of stars and gas in disc galaxies is still considered as a major problem in galaxy dynamics. It is even discussed as an imprint of the formation history of discs and the evolution of baryons in dark matter haloes. Here, we analyse a selected sample of 70 galaxies from the Westerbork Hi Survey of Spiral and Irregular Galaxies. The Hi data allow us to follow the morphology and the kinematics out to very large radii. In the present paper, we present the rotation curves and study the kinematic asymmetry. We extract the rotation curves of the receding and approaching sides separately and show that the kinematic behaviour of disc galaxies can be classified into five different types: symmetric velocity fields where the rotation curves of the receding and approaching sides are almost identical; global distortions where the rotation velocities of the receding and approaching sides have an offset that is constant with radius; local distortions leading to large deviations in the inner and negligible deviations in the outer parts (and vice versa); and distortions that divide the galaxies into two kinematic systems that are visible in terms of the different behaviour of the rotation curves of the receding and approaching sides, which leads to a crossing and a change in side. The kinematic lopsidedness is measured from the maximum rotation velocities, averaged over the plateau of the rotation curves. This gives a good estimate of the global lopsidedness in the outer parts of the sample galaxies. We find that the mean value of the perturbation parameter denoting the lopsided potential as obtained from the kinematic data is 0.056. Altogether, 36% of the sample galaxies are globally lopsided, which can be interpreted as the disc responding to a halo that was distorted by a tidal encounter. In Paper II, we study the morphological lopsidedness of the same sample of galaxies.

Multiscale stochastic approximation for parametric optimization of hidden Markov models

A two-time scale stochastic approximation algorithm is proposed for simulation-based parametric optimization of hidden Markov models, as an alternative to the traditional approaches to ''infinitesimal perturbation analysis.'' Its convergence is analyzed, and a queueing example is presented.

Singularity structure of third-order dynamical systems .2

The singularity structure of the solutions of a general third-order system, with polynomial right-hand sides of degree less than or equal to two, is studied about a movable singular point, An algorithm for transforming the given third-order system to a third-order Briot-Bouquet system is presented, The dominant behavior of a solution of the given system near a movable singularity is used to construct a transformation that changes the given system directly to a third-order Briot-Bouquet system. The results of Horn for the third-order Briot-Bouquet system are exploited to give the complete form of the series solutions of the given third-order system; convergence of these series in a deleted neighborhood of the singularity is ensured, This algorithm is used to study the singularity structure of the solutions of the Lorenz system, the Rikitake system, the three-wave interaction problem, the Rabinovich system, the Lotka-Volterra system, and the May-Leonard system for different sets of parameter values. The proposed approach goes far beyond the ARS algorithm.

Precoding with X-codes to increase capacity with discrete input alphabets

We consider Gaussian multiple-input multiple-output (MIMO) channels with discrete input alphabets. We propose a non-diagonal precoder based on X-Codes in to increase the mutual information. The MIMO channel is transformed into a set of parallel subchannels using Singular Value Decomposition (SVD) and X-codes are then used to pair the subchannels. X-Codes are fully characterized by the pairings and the 2 × 2 real rotation matrices for each pair (parameterized with a single angle). This precoding structure enables to express the total mutual information as a sum of the mutual information of all the pairs. The problem of finding the optimal precoder with the above structure, which maximizes the total mutual information, is equivalent to i) optimizing the rotation angle and the power allocation within each pair and ii) finding the optimal pairing and power allocation among the pairs. It is shown that the mutual information achieved with the proposed pairing scheme is very close to that achieved with the optimal precoder by Cruz et al., and significantly better than mercury/waterfilling strategy by Lozano et al.. Our approach greatly simplifies both the precoder optimization and the detection complexity, making it suitable for practical applications.

X-Codes: A Low Complexity Full-Rate High-Diversity Achieving Precoder for TDD MIMO Systems

We consider a time division duplex multiple-input multiple-output (nt × nr MIMO). Using channel state information (CSI) at the transmitter, singular value decomposition (SVD) of the channel matrix is performed. This transforms the MIMO channel into parallel subchannels, but has a low overall diversity order. Hence, we propose X-Codes which achieve a higher diversity order by pairing the subchannels, prior to SVD preceding. In particular, each pair of information symbols is encoded by a fixed 2 × 2 real rotation matrix. X-Codes can be decoded using nr very low complexity two-dimensional real sphere decoders. Error probability analysis for X-Codes enables us to choose the optimal pairing and the optimal rotation angle for each pair. Finally, we show that our new scheme outperforms other low complexity precoding schemes.

Precoding by Pairing Subchannels to Increase MIMO Capacity With Discrete Input Alphabets

We consider Gaussian multiple-input multiple-output (MIMO) channels with discrete input alphabets. We propose a non-diagonal precoder based on the X-Codes in 1] to increase the mutual information. The MIMO channel is transformed into a set of parallel subchannels using singular value decomposition (SVD) and X-Codes are then used to pair the subchannels. X-Codes are fully characterized by the pairings and a 2 x 2 real rotation matrix for each pair (parameterized with a single angle). This precoding structure enables us to express the total mutual information as a sum of the mutual information of all the pairs. The problem of finding the optimal precoder with the above structure, which maximizes the total mutual information, is solved by: i) optimizing the rotation angle and the power allocation within each pair and ii) finding the optimal pairing and power allocation among the pairs. It is shown that the mutual information achieved with the proposed pairing scheme is very close to that achieved with the optimal precoder by Cruz et al., and is significantly better than Mercury/waterfilling strategy by Lozano et al. Our approach greatly simplifies both the precoder optimization and the detection complexity, making it suitable for practical applications.