A biochemical and structural characterization of Drosophila neuroglian

A number of cell-cell interactions in the nervous system are mediated by immunoglobulin gene superfamily members. For example, neuroglian, a homophilic neural cell adhesion molecule in Drosophila, has an extracellular portion comprising six C- 2 type immunoglobulin-like domains followed by five fibronectin type III (FnIII) repeats. Neuroglian shares this domain organization and significant sequence identity with Ll, a murine neural adhesion molecule that could be a functional homologue. Here I report the crystal structure of a proteolytic fragment containing the first two FnIII repeats of neuroglian (NgFn 1,2) at 2.0Å. The interpretation of photomicrographs of rotary shadowed Ng, the entire extracellular portion of neuroglian, and NgFnl-5, the five neuroglian Fn III domains, is also discussed.

The structure of NgFn 1,2 consists of two roughly cylindrical β-barrel structural motifs arranged in a head-to-tail fashion with the domains meeting at an angle of ~120, as defined by the cylinder axes. The folding topology of each domain is identical to that previously observed for single FnIII domains from tenascin and fibronectin. The domains of NgFn1,2 are related by an approximate two fold screw axis that is nearly parallel to the longest dimension of the fragment. Assuming this relative orientation is a general property of tandem FnIII repeats, the multiple tandem FnIII domains in neuroglian and other proteins are modeled as thin straight rods with two domain zig-zag repeats. When combined with the dimensions of pairs of tandem immunoglobulin-like domains from CD4 and CD2, this model suggests that neuroglian is a long narrow molecule (20 - 30 Å in diameter) that extends up to 370Å from the cell surface.

In photomicrographs, rotary shadowed Ng and NgFn1-5 appear to be highly flexible rod-like molecules. NgFn 1-5 is observed to bend in at least two positions and has a mean total length consistent with models generated from the NgFn1,2 structure. Ng molecules have up to four bends and a mean total length of 392 Å, consistent with a head-to-tail packing of neuroglian's C2-type domains.

Transceiver designs and analysis for LTI, LTV and broadcast channels - new matrix decompositions and majorization theory

Signal processing techniques play important roles in the design of digital communication systems. These include information manipulation, transmitter signal processing, channel estimation, channel equalization and receiver signal processing. By interacting with communication theory and system implementing technologies, signal processing specialists develop efficient schemes for various communication problems by wisely exploiting various mathematical tools such as analysis, probability theory, matrix theory, optimization theory, and many others. In recent years, researchers realized that multiple-input multiple-output (MIMO) channel models are applicable to a wide range of different physical communications channels. Using the elegant matrix-vector notations, many MIMO transceiver (including the precoder and equalizer) design problems can be solved by matrix and optimization theory. Furthermore, the researchers showed that the majorization theory and matrix decompositions, such as singular value decomposition (SVD), geometric mean decomposition (GMD) and generalized triangular decomposition (GTD), provide unified frameworks for solving many of the point-to-point MIMO transceiver design problems.

In this thesis, we consider the transceiver design problems for linear time invariant (LTI) flat MIMO channels, linear time-varying narrowband MIMO channels, flat MIMO broadcast channels, and doubly selective scalar channels. Additionally, the channel estimation problem is also considered. The main contributions of this dissertation are the development of new matrix decompositions, and the uses of the matrix decompositions and majorization theory toward the practical transmit-receive scheme designs for transceiver optimization problems. Elegant solutions are obtained, novel transceiver structures are developed, ingenious algorithms are proposed, and performance analyses are derived.

The first part of the thesis focuses on transceiver design with LTI flat MIMO channels. We propose a novel matrix decomposition which decomposes a complex matrix as a product of several sets of semi-unitary matrices and upper triangular matrices in an iterative manner. The complexity of the new decomposition, generalized geometric mean decomposition (GGMD), is always less than or equal to that of geometric mean decomposition (GMD). The optimal GGMD parameters which yield the minimal complexity are derived. Based on the channel state information (CSI) at both the transmitter (CSIT) and receiver (CSIR), GGMD is used to design a butterfly structured decision feedback equalizer (DFE) MIMO transceiver which achieves the minimum average mean square error (MSE) under the total transmit power constraint. A novel iterative receiving detection algorithm for the specific receiver is also proposed. For the application to cyclic prefix (CP) systems in which the SVD of the equivalent channel matrix can be easily computed, the proposed GGMD transceiver has K/log_2(K) times complexity advantage over the GMD transceiver, where K is the number of data symbols per data block and is a power of 2. The performance analysis shows that the GGMD DFE transceiver can convert a MIMO channel into a set of parallel subchannels with the same bias and signal to interference plus noise ratios (SINRs). Hence, the average bit rate error (BER) is automatically minimized without the need for bit allocation. Moreover, the proposed transceiver can achieve the channel capacity simply by applying independent scalar Gaussian codes of the same rate at subchannels.

In the second part of the thesis, we focus on MIMO transceiver design for slowly time-varying MIMO channels with zero-forcing or MMSE criterion. Even though the GGMD/GMD DFE transceivers work for slowly time-varying MIMO channels by exploiting the instantaneous CSI at both ends, their performance is by no means optimal since the temporal diversity of the time-varying channels is not exploited. Based on the GTD, we develop space-time GTD (ST-GTD) for the decomposition of linear time-varying flat MIMO channels. Under the assumption that CSIT, CSIR and channel prediction are available, by using the proposed ST-GTD, we develop space-time geometric mean decomposition (ST-GMD) DFE transceivers under the zero-forcing or MMSE criterion. Under perfect channel prediction, the new system minimizes both the average MSE at the detector in each space-time (ST) block (which consists of several coherence blocks), and the average per ST-block BER in the moderate high SNR region. Moreover, the ST-GMD DFE transceiver designed under an MMSE criterion maximizes Gaussian mutual information over the equivalent channel seen by each ST-block. In general, the newly proposed transceivers perform better than the GGMD-based systems since the super-imposed temporal precoder is able to exploit the temporal diversity of time-varying channels. For practical applications, a novel ST-GTD based system which does not require channel prediction but shares the same asymptotic BER performance with the ST-GMD DFE transceiver is also proposed.

The third part of the thesis considers two quality of service (QoS) transceiver design problems for flat MIMO broadcast channels. The first one is the power minimization problem (min-power) with a total bitrate constraint and per-stream BER constraints. The second problem is the rate maximization problem (max-rate) with a total transmit power constraint and per-stream BER constraints. Exploiting a particular class of joint triangularization (JT), we are able to jointly optimize the bit allocation and the broadcast DFE transceiver for the min-power and max-rate problems. The resulting optimal designs are called the minimum power JT broadcast DFE transceiver (MPJT) and maximum rate JT broadcast DFE transceiver (MRJT), respectively. In addition to the optimal designs, two suboptimal designs based on QR decomposition are proposed. They are realizable for arbitrary number of users.

Finally, we investigate the design of a discrete Fourier transform (DFT) modulated filterbank transceiver (DFT-FBT) with LTV scalar channels. For both cases with known LTV channels and unknown wide sense stationary uncorrelated scattering (WSSUS) statistical channels, we show how to optimize the transmitting and receiving prototypes of a DFT-FBT such that the SINR at the receiver is maximized. Also, a novel pilot-aided subspace channel estimation algorithm is proposed for the orthogonal frequency division multiplexing (OFDM) systems with quasi-stationary multi-path Rayleigh fading channels. Using the concept of a difference co-array, the new technique can construct M^2 co-pilots from M physical pilot tones with alternating pilot placement. Subspace methods, such as MUSIC and ESPRIT, can be used to estimate the multipath delays and the number of identifiable paths is up to O(M^2), theoretically. With the delay information, a MMSE estimator for frequency response is derived. It is shown through simulations that the proposed method outperforms the conventional subspace channel estimator when the number of multipaths is greater than or equal to the number of physical pilots minus one.

Financial equilibrium, voting procedures, and coalition structures in allocational mechanisms

This thesis is comprised of three chapters, each of which is concerned with properties of allocational mechanisms which include voting procedures as part of their operation. The theme of interaction between economic and political forces recurs in the three chapters, as described below.

Chapter One demonstrates existence of a non-controlling interest shareholders' equilibrium for a stylized one-period stock market economy with fewer securities than states of the world. The economy has two decision mechanisms: Owners vote to change firms' production plans across states, fixing shareholdings; and individuals trade shares and the current production / consumption good, fixing production plans. A shareholders' equilibrium is a production plan profile, and a shares / current good allocation stable for both mechanisms. In equilibrium, no (Kramer direction-restricted) plan revision is supported by a share-weighted majority, and there exists no Pareto superior reallocation.

Chapter Two addresses efficient management of stationary-site, fixed-budget, partisan voter registration drives. Sufficient conditions obtain for unique optimal registrar deployment within contested districts. Each census tract is assigned an expected net plurality return to registration investment index, computed from estimates of registration, partisanship, and turnout. Optimum registration intensity is a logarithmic transformation of a tract's index. These conditions are tested using a merged data set including both census variables and Los Angeles County Registrar data from several 1984 Assembly registration drives. Marginal registration spending benefits, registrar compensation, and the general campaign problem are also discussed.

The last chapter considers social decision procedures at a higher level of abstraction. Chapter Three analyzes the structure of decisive coalition families, given a quasitransitive-valued social decision procedure satisfying the universal domain and ITA axioms. By identifying those alternatives X* ⊆ X on which the Pareto principle fails, imposition in the social ranking is characterized. Every coaliton is weakly decisive for X* over X~X*, and weakly antidecisive for X~X* over X*; therefore, alternatives in X~X* are never socially ranked above X*. Repeated filtering of alternatives causing Pareto failure shows states in X^n*~X^((n+1))* are never socially ranked above X^((n+1))*. Limiting results of iterated application of the *-operator are also discussed.

DNA-mediated charge transport signaling within the cell

DNA possesses the curious ability to conduct charge longitudinally through the π-stacked base pairs that reside within the interior of the double helix. The rate of charge transport (CT) through DNA has a shallow distance dependence. DNA CT can occur over at least 34 nm, a very long molecular distance. Lastly, DNA CT is exquisitely sensitive to disruptions, such as DNA damage, that affect the dynamics of base-pair stacking. Many DNA repair and DNA-processing enzymes are being found to contain 4Fe-4S clusters. These co-factors have been found in glycosylases, helicases, helicase-nucleases, and even enzymes such as DNA polymerase, RNA polymerase, and primase across the phylogeny. The role of these clusters in these enzymes has remained elusive. Generally, iron-sulfur clusters serve redox roles in nature since, formally, the cluster can exist in multiple oxidation states that can be accessed within a biological context. Taken together, these facts were used as a foundation for the hypothesis that DNA-binding proteins with 4Fe-4S clusters utilize DNA-mediated CT as a means to signal one another to scan the genome as a first step in locating the subtle damage that occurs within a sea of undamaged bases within cells.

Herein we describe a role for 4Fe-4S clusters in DNA-mediated charge transport signaling among EndoIII, MutY, and DinG, which are from distinct repair pathways in E. coli. The DinG helicase is an ATP-dependent helicase that contains a 4Fe-4S cluster. To study the DNA-bound redox properties of DinG, DNA-modified electrochemistry was used to show that the 4Fe-4S cluster of DNA-bound DinG is redox-active at cellular potentials, and shares the 80 mV vs. NHE redox potential of EndoIII and MutY. ATP hydrolysis by DinG increases the DNA-mediated redox signal observed electrochemically, likely reflecting better coupling of the 4Fe-4S cluster to DNA while DinG unwinds DNA, which could have interesting biological implications. Atomic force microscopy experiments demonstrate that DinG and EndoIII cooperate at long range using DNA charge transport to redistribute to regions of DNA damage. Genetics experiments, moreover, reveal that this DNA-mediated signaling among proteins also occurs within the cell and, remarkably, is required for cellular viability under conditions of stress. Knocking out DinG in CC104 cells leads to a decrease in MutY activity that is rescued by EndoIII D138A, but not EndoIII Y82A. DinG, thus, appears to help MutY find its substrate using DNA-mediated CT, but do MutY or EndoIII aid DinG in a similar way? The InvA strain of bacteria was used to observe DinG activity, since DinG activity is required within InvA to maintain normal growth. Silencing the gene encoding EndoIII in InvA results in a significant growth defect that is rescued by the overexpression of RNAseH, a protein that dismantles the substrate of DinG, R-loops. This establishes signaling between DinG and EndoIII. Furthermore, rescue of this growth defect by the expression of EndoIII D138A, the catalytically inactive but CT-proficient mutant of EndoIII, is also observed, but expression of EndoIII Y82A, which is CT-deficient but enzymatically active, does not rescue growth. These results provide strong evidence that DinG and EndoIII utilize DNA-mediated signaling to process DNA damage. This work thus expands the scope of DNA-mediated signaling within the cell, as it indicates that DNA-mediated signaling facilitates the activities of DNA repair enzymes across the genome, even for proteins from distinct repair pathways.

In separate work presented here, it is shown that the UvrC protein from E. coli contains a hitherto undiscovered 4Fe-4S cluster. A broad shoulder at 410 nm, characteristic of 4Fe-4S clusters, is observed in the UV-visible absorbance spectrum of UvrC. Electron paramagnetic resonance spectroscopy of UvrC incubated with sodium dithionite, reveals a spectrum with the signature features of a reduced, [4Fe-4S]+1, cluster. DNA-modified electrodes were used to show that UvrC has the same DNA-bound redox potential, of ~80 mV vs. NHE, as EndoIII, DinG, and MutY. Again, this means that these proteins are capable of performing inter-protein electron transfer reactions. Does UvrC use DNA-mediated signaling to facilitate the repair of its substrates?

UvrC is part of the nucleotide excision repair (NER) pathway in E. coli and is the protein within the pathway that performs the chemistry required to repair bulky DNA lesions, such as cyclopyrimidine dimers, that form as a product of UV irradiation. We tested if UvrC utilizes DNA-mediated signaling to facilitate the efficient repair of UV-induced DNA damage products by helping UvrC locate DNA damage. The UV sensitivity of E. coli cells lacking DinG, a putative signaling partner of UvrC, was examined. Knocking out DinG in E. coli leads to a sensitivity of the cells to UV irradiation. A 5-10 fold reduction in the amount of cells that survive after irradiation with 90 J/m2 of UV light is observed. This is consistent with the hypothesis that UvrC and DinG are signaling partners, but is this signaling due to DNA-mediated CT? Complementing the knockout cells with EndoIII D138A, which can also serve as a DNA CT signaling partner, rescues cells lacking DinG from UV irradiation, while complementing the cells with EndoIII Y82A shows no rescue of viability. These results indicate that there is cross-talk between the NER pathway and DinG via DNA-mediated signaling. Perhaps more importantly, this work also establishes that DinG, EndoIII, MutY, and UvrC comprise a signaling network that seems to be unified by the ability of these proteins to perform long range DNA-mediated CT signaling via their 4Fe-4S clusters.