Low PAPR STBCs from Complex Partial-Orthogonal Designs (CPODs)

Space-time codes from complex orthogonal designs (CODs) with no zero entries offer low Peak to Average power ratio (PAPR) and avoid the problem of turning off antennas. But CODs for 2(a) antennas with a + 1 complex variables, with no zero entries are not known in the literature for a >= 4. In this paper, a method of obtaining no zero entry (NZE) codes, called Complex Partial-Orthogonal Designs (CPODs), for 2(a+1) antennas whenever a certain type of NZE code exists for 2(a) antennas is presented. This is achieved with slight increase in the ML decoding complexity for regular QAM constellations and no increase for other complex constellations. Since NZE CODs have been constructed recently for 8 antennas our method leads to NZE CPODs for 16 antennas. Moreover, starting from certain NZE CPODs for n antennas, a construction procedure is given to obtain NZE CPODs for 2n antennas. The class of CPODs do not offer full-diversity for all complex constellations. For the NZE CPODs presented in the paper, conditions on the signal sets which will guarantee full-diversity are identified. Simulations results show that bit error performance of our codes under average power constraint is same as that of the CODs and superior to CODs under peak power constraint.

Low correlation sequences over AM-PSK and QAM alphabets

A construction for a family of sequences over the 8-ary AM-PSK constellation that has maximum nontrivial correlation magnitude bounded as theta(max) less than or similar to root N is presented here. The famfly is asymptotically optimal with respect to the Welch bound on maximum magnitude of correlation. The 8-ary AM-PSK constellation is a subset of the 16-QAM constellation. We also construct two families of sequences over 16-QAM with theta(max) less than or similar to root 2 root N. These families are constructed by interleaving sets of sequences. A construction for a famBy of low-correlation sequences over QAM alphabet of size 2(2m) is presented with maximum nontrivial normalized correlation parameter bounded above by less than or similar to a root N, where N is the period of the sequences in the family and where a ranges from 1.61 in the case of 16-QAM modulation to 2.76 for large m. When used in a CDMA setting, the family will permit each user to modulate the code sequence with 2m bits of data. Interestingly, the construction permits users on the reverse link of the CDMA channel to communicate using varying data rates by switching between sequence famflies; associated to different values of the parameter m. Other features of the sequence families are improved Euclidean distance between different data symbols in comparison with PSK signaling and compatibility of the QAM sequence families with sequences belonging to the large quaternary sequence families {S(p)}.

Complex near-orthogonal designs with no zero entry

Zero entries in complex orthogonal designs (CODs) impede their practical implementation. In this paper, a method of obtaining a no zero entry (NZE) code for 2(k+1) antennas whenever a NZE code exists for 2(k) antennas is presented. This is achieved with slight increase in the ML decoding complexity for regular QAM constellations and no increase for other complex constellations. Since NZE CODs have been constructed recently for 8 antennas our method leads to NZE codes for 16 antennas. Simulation results show good performance of our new codes compared to the well known constructions for 16 and 32 antennas under peak power constraints.

Isoperimetric Problem and Meta-fibonacci Sequences

Let G = (V,E) be a simple, finite, undirected graph. For S ⊆ V, let $\delta(S,G) = \{ (u,v) \in E : u \in S \mbox { and } v \in V-S \}$ and $\phi(S,G) = \{ v \in V -S: \exists u \in S$ , such that (u,v) ∈ E} be the edge and vertex boundary of S, respectively. Given an integer i, 1 ≤ i ≤ ∣ V ∣, the edge and vertex isoperimetric value at i is defined as b e (i,G) =  min S ⊆ V; |S| = i |δ(S,G)| and b v (i,G) =  min S ⊆ V; |S| = i |φ(S,G)|, respectively. The edge (vertex) isoperimetric problem is to determine the value of b e (i, G) (b v (i, G)) for each i, 1 ≤ i ≤ |V|. If we have the further restriction that the set S should induce a connected subgraph of G, then the corresponding variation of the isoperimetric problem is known as the connected isoperimetric problem. The connected edge (vertex) isoperimetric values are defined in a corresponding way. It turns out that the connected edge isoperimetric and the connected vertex isoperimetric values are equal at each i, 1 ≤ i ≤ |V|, if G is a tree. Therefore we use the notation b c (i, T) to denote the connected edge (vertex) isoperimetric value of T at i. Hofstadter had introduced the interesting concept of meta-fibonacci sequences in his famous book “Gödel, Escher, Bach. An Eternal Golden Braid”. The sequence he introduced is known as the Hofstadter sequences and most of the problems he raised regarding this sequence is still open. Since then mathematicians studied many other closely related meta-fibonacci sequences such as Tanny sequences, Conway sequences, Conolly sequences etc. Let T 2 be an infinite complete binary tree. In this paper we related the connected isoperimetric problem on T 2 with the Tanny sequences which is defined by the recurrence relation a(i) = a(i − 1 − a(i − 1)) + a(i − 2 − a(i − 2)), a(0) = a(1) = a(2) = 1. In particular, we show that b c (i, T 2) = i + 2 − 2a(i), for each i ≥ 1. We also propose efficient polynomial time algorithms to find vertex isoperimetric values at i of bounded pathwidth and bounded treewidth graphs.

Low-delay, high-rate, non-square STBCs from scaled complex orthogonal designs

Space-time block codes (STBCs) obtained from non-square complex orthogonal designs are bandwidth efficient compared to those from square real/complex orthogonal designs for colocated coherent MIMO systems and has other applications in (i) non-coherent MIMO systems with non-differential detection, (ii) Space-Time-Frequency codes for MIMO-OFDM systems and (iii) distributed space-time coding for relay channels. Liang (IEEE Trans. Inform. Theory, 2003) has constructed maximal rate non-square designs for any number of antennas, with rates given by [(a+1)/(2a)] when number of transmit antennas is 2a-1 or 2a. However, these designs have large delays. When large number of antennas are considered this rate is close to 1/2. Tarokh et al (IEEE Trans. Inform. Theory, 1999) have constructed rate 1/2 non-square CODs using the rate-1 real orthogonal designs for any number of antennas, where the decoding delay of these codes is less compared to the codes constructed by Liang for number of transmit antennas more than 5. In this paper, we construct a class of rate-1/2 codes for arbitrary number of antennas where the decoding delay is reduced by 50% when compared with the rate-1/2 codes given by Tarokh et al. It is also shown that even though scaling the variables helps to lower the delay it can not be used to increase the rate.

Proton magnetic resonance spectroscopy of a boron neutron capture therapy 10B-carrier, L-p-boronophenylalanine-fructose complex

Boron neutron capture therapy (BNCT) is a radiotherapy that has mainly been used to treat malignant brain tumours, melanomas, and head and neck cancer. In BNCT, the patient receives an intravenous infusion of a 10B-carrier, which accumulates in the tumour area. The tumour is irradiated with epithermal or thermal neutrons, which result in a boron neutron capture reaction that generates heavy particles to damage tumour cells. In Finland, boronophenylalanine fructose (BPA-F) is used as the 10B-carrier. Currently, the drifting of boron from blood to tumour as well as the spatial and temporal accumulation of boron in the brain, are not precisely known. Proton magnetic resonance spectroscopy (1H MRS) could be used for selective BPA-F detection and quantification as aromatic protons of BPA resonate in the spectrum region, which is clear of brain metabolite signals. This study, which included both phantom and in vivo studies, examined the validity of 1H MRS as a tool for BPA detection. In the phantom study, BPA quantification was studied at 1.5 and 3.0 T with single voxel 1H MRS, and at 1.5 T with magnetic resonance imaging (MRSI). The detection limit of BPA was determined in phantom conditions at 1.5 T and 3.0 T using single voxel 1H MRS, and at 1.5 T using MRSI. In phantom conditions, BPA quantification accuracy of ± 5% and ± 15% were achieved with single voxel MRS using external or internal (internal water signal) concentration references, respectively. For MRSI, a quantification accuracy of <5% was obtained using an internal concentration reference (creatine). The detection limits of BPA in phantom conditions for the PRESS sequence were 0.7 (3.0 T) and 1.4 mM (1.5 T) mM with 20 × 20 × 20 mm3 single voxel MRS, and 1.0 mM with acquisition-weighted MRSI (nominal voxel volume 10(RL) × 10(AP) × 7.5(SI) mm3), respectively. In the in vivo study, an MRSI or single voxel MRS or both was performed for ten patients (patients 1-10) on the day of BNCT. Three patients had glioblastoma multiforme (GBM), and five patients had a recurrent or progressing GBM or anaplastic astrocytoma gradus III, and two patients had head and neck cancer. For nine patients (patients 1-9), MRS/MRSI was performed 70-140 min after the second irradiation field, and for one patient (patient 10), the MRSI study began 11 min before the end of the BPA-F infusion and ended 6 min after the end of the infusion. In comparison, single voxel MRS was performed before BNCT, for two patients (patients 3 and 9), and for one patient (patient 9), MRSI was performed one month after treatment. For one patient (patient 10), MRSI was performed four days before infusion. Signals from the tumour spectrum aromatic region were detected on the day of BNCT in three patients, indicating that in favourable cases, it is possible to detect BPA in vivo in the patient’s brain after BNCT treatment or at the end of BPA-F infusion. However, because the shape and position of the detected signals did not exactly match the BPA spectrum detected in the in vitro conditions, assignment of BPA is difficult. The opportunity to perform MRS immediately after the end of BPA-F infusion for more patients is necessary to evaluate the suitability of 1H MRS for BPA detection or quantification for treatment planning purposes. However, it could be possible to use MRSI as criteria in selecting patients for BNCT.

On the maximal rate of non-square STBCs from complex orthogonal designs

A Linear Processing Complex Orthogonal Design (LPCOD) is a p x n matrix epsilon, (p >= n) in k complex indeterminates x(1), x(2),..., x(k) such that (i) the entries of epsilon are complex linear combinations of 0, +/- x(i), i = 1,..., k and their conjugates, (ii) epsilon(H)epsilon = D, where epsilon(H) is the Hermitian (conjugate transpose) of epsilon and D is a diagonal matrix with the (i, i)-th diagonal element of the form l(1)((i))vertical bar x(1)vertical bar(2) + l(2)((i))vertical bar x(2)vertical bar(2)+...+ l(k)((i))vertical bar x(k)vertical bar(2) where l(j)((i)), i = 1, 2,..., n, j = 1, 2,...,k are strictly positive real numbers and the condition l(1)((i)) = l(2)((i)) = ... = l(k)((i)), called the equal-weights condition, holds for all values of i. For square designs it is known. that whenever a LPCOD exists without the equal-weights condition satisfied then there exists another LPCOD with identical parameters with l(1)((i)) = l(2)((i)) = ... = l(k)((i)) = 1. This implies that the maximum possible rate for square LPCODs without the equal-weights condition is the same as that or square LPCODs with equal-weights condition. In this paper, this result is extended to a subclass of non-square LPCODs. It is shown that, a set of sufficient conditions is identified such that whenever a non-square (p > n) LPCOD satisfies these sufficient conditions and do not satisfy the equal-weights condition, then there exists another LPCOD with the same parameters n, k and p in the same complex indeterminates with l(1)((i)) = l(2)((i)) = ... = l(k)((i)) = 1.

Ternary Iron(III) complex showing photocleavage of DNA in the photodynamic therapy window

A new ternary iron(III) complex [FeL(dpq)] containing dipyridoquinoxaline (dpq) and 2,2-bis(3,5-di-tert-butyl-2-hydroxybenzyl)aminoacetic acid (H3L) is prepared and structurally characterized by X-ray crystallography. The high-spin complex with a FeN3O3 core shows a quasi-reversible iron(III)/iron(II) redox couple at -0.62 V (vs SCE) in DMF/0.1 M TBAP and a broad visible band at 470 nm in DMF/Tris buffer. Laser photoexcitation of this phenolate (L)-to-iron(III) charge-transfer band at visible wavelengths including red light of >= 630 nm leads to cleavage of supercoiled pUC19 DNA to its nicked circular form via a photoredox pathway forming hydroxyl radicals.

IMIA working group on health record banking - How complex systems can cooperate towards having individual's consolidated data

This workshop aims at discussing alternative approaches to resolving the problem of health information fragmentation, partially resulting from difficulties of health complex systems to semantically interact at the information level. In principle, we challenge the current paradigm of keeping medical records where they were created and discuss an alternative approach in which an individual's health data can be maintained by new entities whose sole responsibility is the sustainability of individual-centric health records. In particular, we will discuss the unique characteristics of the European health information landscape. This workshop is also a business meeting of the IMIA Working Group on Health Record Banking.

Rationalizing the effects of amino acid side chain, pyridine, and imidazole on the assembly and reversible disassembly of a octanuclear Cu(III) complex

This paper reports the observation of a reversible disassembly process for a previously reported octanuclear Cu(II) complex with imidazole. To identify the factors responsible for the process, five Cu(II) complexes of different nuclearity with different amino acid-derived tetradentate ligands were structurally characterized. The results show that the coordination geometry preference of Cu(II), the tendency of imidazole to act as in-plane ligand, and H-bonding played important role in the formation and disassembly of the octanuclear complex. A general scheme describing the effect of different amino acid side arms, solvents, and exogenous ligands on the nuclearity of the Cu(II) complexes has been presented. The crystals of the complexes also showed formation of multifaceted networks in the resulting complexes.

Context-dependency of a complex fruit-frugivore mutualism: temporal variation in crop size and neighborhood effects

The quantity of fruit consumed by dispersers is highly variable among individuals within plant populations. The outcome Of Such selection operated by firugivores has been examined mostly with respect to changing spatial contexts. The influence of varying temporal contexts on frugivore choice, and their possible demographic and evolutionary consequences is poorly understood. We examined if temporal variation in fruit availability across a hierarchy of nested temporal levels (interannual, intraseasonal, 120 h, 24 h) altered frugivore choice for a complex seed dispersal system in dry tropical forests of southern India. The interactions between Phyllanthus emblica and its primary disperser (ruminants) was mediated by another frugivore (a primate),which made large quantities of fruit available on the ground to ruminants. The direction and strength of crop size and neighborhood effects on this interaction varied with changing temporal contexts.Fruit availability was higher in the first of the two study years, and at the start of the season in both years. Fruit persistence on trees,determined by primate foraging, was influenced by crop size andconspecific neighborhood densities only in the high fruit availability year. Fruit removal by ruminants was influenced by crop size in both years and neighborhood densities only in the high availability year. In both years, these effects were stronger at the start of the season.Intraseasonal reduction in fruit availability diminished inequalities in fruit removal by ruminants and the influence of crop size and fruiting neighborhoods. All trees were not equally attractive to frugivores in a P. emblica population at all points of time. Temporal asymmetry in frugivore-mediated selection could reduce potential for co-evolution between firugivores and plants by diluting selective pressures. Inter-dependencies; formed between disparate animal consumers can add additional levels of complexity to plant-frugivore mutualistic networks and have potential reproductive consequences for specific individuals within populations.

Transcription of Human Resistin Gene Involves an Interaction of Sp1 with Peroxisome Proliferator-Activating Receptor Gamma (PPAR gamma)

Background: Resistin is a cysteine rich protein, mainly expressed and secreted by circulating human mononuclear cells. While several factors responsible for transcription of mouse resistin gene have been identified, not much is known about the factors responsible for the differential expression of human resistin.Methodology/Principal Finding: We show that the minimal promoter of human resistin lies within similar to 80 bp sequence upstream of the transcriptional start site (-240) whereas binding sites for cRel, CCAAT enhancer binding protein alpha (C/EBP-alpha), activating transcription factor 2 (ATF-2) and activator protein 1 (AP-1) transcription factors, important for induced expression, are present within sequences up to -619. Specificity Protein 1(Sp1) binding site (-276 to -295) is also present and an interaction of Sp1 with peroxisome proliferator activating receptor gamma (PPAR gamma) is necessary for constitutive expression in U937 cells. Indeed co-immunoprecipitation assay demonstrated a direct physical interaction of Sp1 with PPAR gamma in whole cell extracts of U937 cells. Phorbol myristate acetate (PMA) upregulated the expression of resistin mRNA in U937 cells by increasing the recruitment of Sp1, ATF-2 and PPAR gamma on the resistin gene promoter. Furthermore, PMA stimulation of U937 cells resulted in the disruption of Sp1 and PPAR gamma interaction. Chromatin immunoprecipitation (ChIP) assay confirmed the recruitment of transcription factors phospho ATF-2, Sp1, Sp3, PPAR gamma, chromatin modifier histone deacetylase 1 (HDAC1) and the acetylated form of histone H3 but not cRel, C/EBP-alpha and phospho c-Jun during resistingene transcription.Conclusion: Our findings suggest a complex interplay of Sp1 and PPAR gamma along with other transcription factors that drives the expression of resistin in human monocytic U937 cells.

Purification, characterization and molecular cloning of a monocot mannose-binding lectin from Remusatia vivipara with nematicidal activity

A mannose-binding lectin (RVL) was purified from the tubers of Remusatia vivipara, a monocot plant by single-step affinity chromatography on asialofetuin-Sepharose 4B. RVL agglutinated only rabbit erythrocytes and was inhibited by mucin, asialomucin, asialofetuin and thyroglobulin. Lectin activity was stable up to 80A degrees C and under wide range of pH (2.0-9.3). SDS-PAGE and gel filtration results showed the lectin is a homotetramer of Mr 49.5 kDa, but MALDI analysis showed two distinct peaks corresponding to subunit mass of 12 kDa and 12.7 kDa. Also the N-terminal sequencing gave two different sequences indicating presence of two polypeptide chains. Cloning of RVL gene indicated posttranslational cleavage of RVL precursor into two mature polypeptides of 116 and 117 amino-acid residues. Dynamic light scattering (DLS) and gel filtration studies together confirmed the homogeneity of the purified lectin and supported RVL as a dimer with Mr 49.5 kDa derived from single polypeptide precursor of 233 amino acids. Purified RVL exerts potent nematicidal activity on Meloidogyne incognita, a root knot nematode. Fluorescent confocal microscopic studies demonstrated the binding of RVL to specific regions of the alimentary-tract and exhibited a potent toxic effect on M. incognita. RVL-mucin complex failed to interact with the gut confirming the receptor mediated lectin interaction. Very high mortality (88%) rate was observed at lectin concentration as low as 30 A mu g/ml, suggesting its potential application in the development of nematode resistant transgenic-crops.

Robust heuristics for scalable optimization of complex SQL queries

Modern database systems incorporate a query optimizer to identify the most efficient "query execution plan" for executing the declarative SQL queries submitted by users. A dynamic-programming-based approach is used to exhaustively enumerate the combinatorially large search space of plan alternatives and, using a cost model, to identify the optimal choice. While dynamic programming (DP) works very well for moderately complex queries with up to around a dozen base relations, it usually fails to scale beyond this stage due to its inherent exponential space and time complexity. Therefore, DP becomes practically infeasible for complex queries with a large number of base relations, such as those found in current decision-support and enterprise management applications. To address the above problem, a variety of approaches have been proposed in the literature. Some completely jettison the DP approach and resort to alternative techniques such as randomized algorithms, whereas others have retained DP by using heuristics to prune the search space to computationally manageable levels. In the latter class, a well-known strategy is "iterative dynamic programming" (IDP) wherein DP is employed bottom-up until it hits its feasibility limit, and then iteratively restarted with a significantly reduced subset of the execution plans currently under consideration. The experimental evaluation of IDP indicated that by appropriate choice of algorithmic parameters, it was possible to almost always obtain "good" (within a factor of twice of the optimal) plans, and in the few remaining cases, mostly "acceptable" (within an order of magnitude of the optimal) plans, and rarely, a "bad" plan. While IDP is certainly an innovative and powerful approach, we have found that there are a variety of common query frameworks wherein it can fail to consistently produce good plans, let alone the optimal choice. This is especially so when star or clique components are present, increasing the complexity of th- e join graphs. Worse, this shortcoming is exacerbated when the number of relations participating in the query is scaled upwards.